Abstract: A reasoning engine is disclosed. Contemplated reasoning engines acquire data relating to one or more aspects of various environments. Inference engines within the reasoning engines review the acquire data, historical or current, to generate one or more hypotheses about how the aspects of the environments might be correlated, if at all. The reasoning engine can attempt to validate the hypotheses through controlling acquisition of the environment data.

Abstract: Some embodiments of the invention provide a method for providing automated admission control services for a RAN system. The method receives a trigger alert that includes an application identifier for an application, a dRIC identifier associated with a dRIC to which the application is to be deployed, and a set of configurations for the application that are in a first format. The method converts the set of configurations from the first format to a second format and sends the set configurations in the second format to an FCAPS management pod deployed to the dRIC. Upon receiving positive acknowledgment indicating successful implementation of the set of configurations from the FCAPS management pod, the method updates a configuration table stored in a database of the RAN with a set of admissions control information for the application. The method sends a notification to an API server for the RAN indicating the set of configurations have been successfully implemented for the application.

Abstract: Methods and systems for generating a universal computer model for assessing a risk in an electronic transaction based on one or more risk assessment models are presented. The one or more risk assessment models may be incompatible with each other. Different portions of a risk assessment models may be extracted from the risk assessment models. A node structure is generated for each risk assessment model based on the portions extracted from a corresponding risk assessment model. The node structures generated based on the risk assessment models are merged to produce a merged node structure. The universal computer model is generated based on the merged node structure.

Abstract: An approach to facilitating consideration-based non-player character counseling is provided. A non-player character counsel may be controlled within a game space to provide counsel content to users in exchange for virtual consideration purchased with real world money. For example, responsive to reception of adequate virtual consideration from a first user, the non-player character counsel may be controlled to provide a first set of counsel content to the first user in the game space. The first set of counsel content may be a subset of the counsel content provided by the non-player character counsel to the users in the game space. The counsel content may include instructions for and/or demonstrations of activities to be performed by a first character under control of the first user in the game space.

Abstract: Translating gestures made by one avatar to a second avatar in a virtual world by receiving an input from a first user representing an input gesture to be made by the first avatar to the second avatar. The input gesture is translated to generate at least one translated gesture for display. The translated gesture may be output for display as being made by the first avatar to the second avatar.

Abstract: Embodiments of the present invention characterizing the uncertainty of the orbital state of an Earth-orbiting space object hereof using a Gauss von Mises probability density function defined on the n+1 dimensional cylindrical manifold n×. Additionally, embodiments of the present invention can include transforming a Gauss von Mises distribution under a diffeomorphism and approximating the output as a Gauss von Mises distribution. Embodiments of the present invention can also include fusing a prior state represented by a Gauss von Mises distribution with an update report, wherein the update can be either another Gauss von Mises distribution of the same dimension as the prior or an observation related to the prior by a stochastic measurement model. A Gauss von Mises distribution can be calculated from a plurality of reports, wherein the reports are either Gauss von Mises distributions or observations related to the state space by a stochastic measurement model.

Abstract: The present invention envisages a personalized plan generation system and a method that satisfies maximum user preferences and constraints; besides including a number of enabling features like of plan repair or revision with dynamically changing situations or contextual information. Moreover, the system is able to perform a collaborative planning by opinion mining in social networks to achieve better optimization. Significantly, the explanation for the selection of plan steps or a change in plan altogether can be expressed in natural language.

Abstract: A computer-implemented method, including receiving by one or more computer systems input information that represents a multi-dimensional communication; detecting, based on contents of the input information, a plurality of communication inputs; applying one or more weighted values to one or more of the communication inputs; assigning, based on application of the one or more weighted values, confidence levels to the communications inputs; determining which of the confidence levels are below a confidence threshold; executing one or more disambiguation rules to disambiguate the communication inputs with confidence levels below the confidence threshold; and generating a communication instruction to perform an action that is specified by the multi-dimensional communication.

Abstract: An contextual artificial intelligence system is disclosed. Intelligent business objects enable dynamic data object interaction and encapsulation of user context. Data is rationalized and data objects evolve by way of an artificial intelligence assisted process of self-discovery. Significant data is identified based upon factors such as cost, revenue and outcome and contextually significant result sets are automatically generated for users.

Abstract: System fault codes, component fault codes, and failure modes may be received at a system. A first level model comprising first level causal relationships and first level causal weights between the system fault codes and the component fault codes may be generated. A second level model comprising second level causal relationships and second level causal weights between the component fault codes and the failure modes may be generated. The first level model and the second level model may be combined to generate a model such as graphical model. One or more causal probabilities may be determined using the graphical model.

Abstract: An contextual artificial intelligence system is disclosed. Intelligent business objects enable dynamic data object interaction and encapsulation of user context. Data is rationalized and data objects evolve by way of an artificial intelligence assisted process of self-discovery. Significant data is identified based upon factors such as cost, revenue and outcome and contextually significant result sets are automatically generated for users.

Abstract: An RDF reason maintenance system avoids imposing a scalability restriction on the number of explicit statements stored in RDF databases. The system can identify those inferred statements that suitably should be removed whenever an explicit statement is deleted (retracted). The system dynamically computes the truth using a combination of the forward-chaining hardware and the backward-chaining hardware. The system is time-efficient, computes faster than a full re-computation, and need not use any long-lived truth maintenance information (space-efficient).

Abstract: A system and method is disclosed for detecting distribution of multimedia content. The volume level of data traffic is monitored for a plurality of users to select any users with high-bandwidth usage. The time of day and the day of the week may be considered when determining whether a user is a high-bandwidth user. Upon selecting a user as one with high-bandwidth usage, such user may be subject to packet inspections of data traffic streams. In some embodiments, content identification parameters or watermarks are added to one or more packets in a data traffic stream carrying multimedia content.

Abstract: A truth maintenance method and system. The method includes receiving by a computer processor from RFID tags embedded in sensors, event data associated with events detected by said sensors. The computer processor associates portions of the event data with associated RFID tags and derives assumption data associated with each portion of the portions. The computer processor retrieves previous assumption data derived from and associated with previous portions of previous event data retrieved from the RFID tags and executes non monotonic logic with respect to the assumption data and the previous assumption data. In response, the computer processor generates and stores updated assumption data associated with the assumption data and the previous assumption data.

Abstract: A learning control system according to the present invention is one which performs learning of action values of actions in an apparatus which identifies its state as one of predetermined states, and selects an action based on the obtained action values and the identified state. The learning control system includes n action value learning devices including the first to the n th learning devices which perform learning of n action values from Q1 to Qn, assuming that n is a positive integer and an action value determining device which determines the total action value of an action Q of each state based on outputs of the n action value learning devices.

Abstract: A truth maintenance method and system. The method includes receiving by a computer processor from RFID tags embedded in sensors, event data associated with events detected by said sensors. The computer processor associates portions of the event data with associated RFID tags and derives assumption data associated with each portion of the portions. The computer processor retrieves previous assumption data derived from and associated with previous portions of previous event data retrieved from the RFID tags and executes non monotonic logic with respect to the assumption data and the previous assumption data. In response, the computer processor generates and stores updated assumption data associated with the assumption data and the previous assumption data.

Abstract: System fault codes, component fault codes, and failure modes may be received at a system. A first level model comprising first level causal relationships and first level causal weights between the system fault codes and the component fault codes may be generated. A second level model comprising second level causal relationships and second level causal weights between the component fault codes and the failure modes may be generated. The first level model and the second level model may be combined to generate a model such as graphical model. One or more causal probabilities may be determined using the graphical model.

Abstract: A subset of unique codes are generated from a set of codes. The subset of codes are stored in a database on a secure server and each of the codes is marked on a corresponding instantiation of the product. The marked instantiations are distributed. During their distribution, the marked instantiations are verified for authenticity and for routing. This verification is performed by reading or scanning the codes on the instantiations, and transmitting that information to the secure server for comparison against the codes and other information located in the database contained therein.

Abstract: Techniques are described providing mediated information about a current state that is modeled with multiple state attributes. In some situations, the providing includes receiving from a first source an indication of a first value for an indicated one of the state attributes of the modeled current state, receiving from a second source an indication of a second value for the indicated state attribute, and, after an indication from a client for a value for the indicated state attribute, sending to the client a mediated value for the indicated state attribute that is produced by mediating between available values for the indicated state attribute including at least the first and second values.

Abstract: A system operative to execute and train at least one avatar for each user of an interactive environment comprising a knowledge engine operative to continuously monitor each user's response to events in the interactive environment while each user controls the at least one avatar, a knowledge base operative to store each of the monitored user responses to events in the interactive environment and an action engine operative to control one or more actions of the at least one avatar for each user in the interactive environment based on the stored monitored responses regardless of each user's control of the at least one avatar.

Abstract: The safety in robotic operations is enhanced and the floor space in a factory or the like is effectively utilized. A virtual safety barrier 50 including the trajectory of movement of a work or tool 7 mounted on a wrist 5 of a robot 1 in operation is defined in a memory. At least two three-dimensional spatial regions S (S1 to S3) including a part of the robot including the work or tool are defined. Predicted positions of the defined three-dimensional spatial regions obtained by trajectory calculations are matched with the virtual safety barrier 50, and if the predicted position of any one of the defined three-dimensional spatial regions based on trajectory calculations is included in the virtual safety barrier 50, a control is effected to stop the movement of the robot arms 3 and 4.

Abstract: The present invention relates generally to expert systems that synthesize data from multiple disparate sources of evidential information. More specifically, the present invention relates to systems, methods, devices, and computer readable media for implementing evidential reasoning with multi-agent systems.

Abstract: One implementation provides a method for modifying a knowledge base on a client device. The method includes receiving input from a user of the client device specifying a first proposed modification to the knowledge base, modifying the knowledge base as specified by the first proposed modification, and subsequently receiving electronic information from a host server specifying a second proposed modification to the knowledge base. The method further includes comparing the second proposed modification to the first proposed modification previously made to the knowledge base and, upon comparison, determining whether to modify the knowledge base as specified by the second proposed modification.

Abstract: File system interaction with digital rights management (DRM) is facilitated by enabling one or more file system components to be DRM-aware. These one or more file system components may be part of a computer operating system. An exemplary system implementation includes: one or more processors; and one or more media in operative communication therewith, the media storing one or more file system components that are configured to provide content having DRM controls to a requesting program in either a raw form or a decrypted form in dependence on whether the DRM controls comprise simple DRM content controls or complex DRM content controls. In another exemplary system implementation, the one or more file system components are configured to provide files with simple DRM content controls to requesting applications in a decrypted form and to provide files with complex DRM content controls to requesting applications in an unaltered form.

Abstract: A system and method are disclosed for detecting intrusions in a host system on a network. The intrusion detection system comprises an analysis engine configured to use continuations and apply forward- and backward-chaining using rules. Also provided are sensors, which communicate with the analysis engine using a meta-protocol in which the data packet comprises a 4-tuple. A configuration discovery mechanism locates host system files and communicates the locations to the analysis engine. A file processing mechanism matches contents of a deleted file to a directory or filename, and a directory processing mechanism extracts deallocated directory entries from a directory, creating a partial ordering of the entries. A signature checking mechanism computes the signature of a file and compares it to previously computed signatures. A buffer overflow attack detector compares access times of commands and their associated files.

Abstract: Disclosed is a technology relating to an agent system for generating an excellent plan. A script can be freely described by individually storing an action definition and the script without any limitation due to a language form of the action definition. Constructing as one of agent functions an update of knowledge using information acquired by execution, removes the necessity for the description of operations relating to an update in the plan. Diversification of contents of a replanning enhances a flexibility of the operations by an agent. Furthermore, when the agent moves among nodes, both of the agent and the node decide reliabilities of nodes to and from which the agent moves, so that a safety of information processing is improved. By preserving information used for restoring the agent at the time of the move of the agent, the agent having interrupted its action due to trouble can resume the action.

Abstract: A computer-implemented method for transforming an SQL query having a WHERE clause having nested SELECT expressions. The expression in the WHERE clause being transformed by the iterative application of rules to have ThereExists expressions and associated truth-value expressions. Further transforming the expression to form a truth expression having the IS operator and iteratively applying further rules to translate 3-valued logic to z-valued logic. Carrying out a further transformation to remove NOT expressions from the expression and to remove any ThereExists expressions so as to define an expression in z-valued logic with simplified SELECT expressions.

Abstract: In a semcard management application, a user interface that consists of several panels that facilitate the use of semcards, the objects they represent, and the knowledge network is described. These panels include an entry point panel, a filter panel, a results panel, and a viewer. One category of entry points is referred to as “context” entry points. Contexts allow semcards to be organized into hierarchically arranged categories. After the user has created a context, this context can be used as an entry point to a set of semcards meeting a certain criteria.

Abstract: A system and method for processing a large constraint satisfaction problem quickly, including a subset generating module (1), which divides a set of alternatives provided for a plurality of parts of a given problem into a plurality of subsets, such that each subset has not more than two alternatives for each part. For each subset generated by the division, a solution calculation module (2) finds a solution by calculating combinations of alternatives satisfying a constraint between alternatives selected for each two parts. The calculation of a solution for a subset, such that each subset has not more than two alternatives for each part, requires a very short period of processing time, even if the parts are many. Thus, the sum of the times required for finding a solution for all the subsets is much shorter than the time required for finding a solution for the original problem without such processing.

Abstract: A method for identifying services, service elements and dependencies among the services and service elements includes executing first and second phases of discovery. In the first phase, the services and service elements are detected, as well as a first set of dependencies. The second phase is based on results of the first phase and is focused upon detecting inter-service dependencies, i.e., conditions in which proper operation of one service relies upon at least one other service. Various techniques may be used in executing the first phase, including accessing information in a domain name service (DNS) of the network to identify dependencies, as well as services and service elements. Discovery within the first phase may also be based upon recognizing naming conventions. Regarding the second phase, one approach to discovering inter-service dependencies is to deploy discovery agents implemented in computer software to access content of configuration files of applications detected in the first phase.

Abstract: The invention relates to a method of configuring a set of object values in a computer. At least one object value of the set of object values is user-chosen from a number of object values. Each object has at least one possible object value. Each object value is determined or undetermined. Each of the determined object values is assigned to a value. Some or all of these object values is included in the set of object values. The object values are constrained by a rule base defining a number of relationships between the objects or the object values. The method uses at least one interruptable algorithm adapted to deduce knowledge about the undetermined object values. This knowledge indicates whether a user selection of a part of or all of the individual undetermined object values are possible or not. The algorithm(s) includes at least one readout point.

Abstract: A method is described which aids the generation of a controller from an application-related formal specification. The method enables the generation of controllers which satisfy specified safety conditions, specifically in such a way that the generation process ensures that they are complied with. Constructs for specifying sequential and parallel sequences are provided, which allow the exclusive description of only the functionally desired aspects, so that a clear separation of safety and function is possible.

Abstract: A hypothetical query in a database system is transformed using algebraic equivalences involving explicit substitutions so as to produce one or more equivalent queries which can be evaluated more efficiently than the original hypothetical query. The hypothetical query may be of the form Q when {U} where Q is a relational algebra query and U is an update expression. The value assigned to the hypothetical query in a database state DB is the value that Q would return in the database state reached from DB by executing update U. One or more explicit substitutions are used to represent hypothetical database state changes, and algebraic equivalences involving the explicit substitutions are applied to the hypothetical query in order to generate at least one additional query which is equivalent to the hypothetical query. Several equivalent queries may be generated, and their estimated computation times compared, in order to select a particular equivalent query for direct evaluation.

Abstract: The present invention discloses a method for building a self-learning evidential reasoning system from examples. In this invention a hierarchical model structure for the self-learning evidential reasoning system is defined. After the model structure has been defined examples are supplied by experts. The examples are entered directly into example spreadsheets and then used to train the model structure. The model structure is then trained to minimize error between model output and the desired output. The error is minimized by using a gradient descent optimization. The model structure is then put into production and then used to make a recommendation. The self-learning evidential reasoning system can be used in various fields, such as analyzing the risk of financial service applications.

Abstract: A system operative to execute and train at least one avatar for each user of an interactive environment comprising a knowledge engine operative to continuously monitor each user's response to events in the interactive environment while each user controls the at least one avatar, a knowledge base operative to store each of the monitored user responses to events in the interactive environment and an action engine operative to control one or more actions of the at least one avatar for each user in the interactive environment based on the stored monitored responses regardless of each user's control of the at least one avatar.