Abstract: The invention relates to a system for the inductive determination of pattern probabilities of 16 dyadic logical connectors. Said system is especially useful for technically predicting human behavior, e.g. inclusion fallacies, and is therefore useful for controlling of technical systems and for data mining, search engines or human-machine interfaces. The system can be implemented in software with a processor controlled machine.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for estimating demographic compositions of television audiences from audience similarities. In an aspect, pairwise cosine similarities of segment of viewers of rated and unrated television programs are determined, demographic information of rated programs is attributed to the unrated programs from the cosine similarity measures and demographic information for the rated programs.

Abstract: A computer-implemented method, apparatus and product for solving a Constraint Satisfaction Problem (CSP). The computer-implemented method, performed by a computerized device, comprising: obtaining the CSP comprising a set of variables, a set of corresponding domains, and a set of constraints; and solving the CSP by iteratively: limiting the domains to exclude values that cannot satisfy one or more constraints of the set of constraints; heuristically selecting a variable out of the set of variables, wherein said heuristically selecting is based on constraint semantics of a constraint of the set of constraints; and limiting a corresponding domain of the selected variable.

Abstract: The described implementations relate to expressing terminologies in a hierarchical form. One implementation can receive a terminology that can include concept-code pairs. For example, each of the concept-code pairs can include a concept and a code that is assigned to the concept by the terminology. The implementation can map the concepts to levels of a hierarchical ontology, and associate some of the concepts across different levels of the hierarchical ontology. The implementation can also provide programmatic access to the concept-code pairs of the terminology via the hierarchical ontology.

Abstract: Systems and methods that determine a meaning of a knowledge item using related information are described. In one aspect, a knowledge item is received, related information associated with the knowledge item is received, at least one related meaning based on the related information is determined, and a knowledge item meaning for the knowledge item based at least in part on the related meaning is determined. Several algorithms and types of related information useful in carrying out such systems and methods are described.

Abstract: An analytic network process (ANP) storage memory stores an ANP weighted supermatrix representing an ANP model. A processor is in communication with the ANP storage memory. The processor is configured to change priorities of a node in the ANP weighted supermatrix to be more important, to change priorities of the node in the ANP weighted supermatrix to be less important, and to assess a sensitivity of the node which was changed relative to the ANP model. The processor further is configured to maintain a same proportionality in the ANP weighted supermatrix for the changing of the priorities and the assessing of the relative sensitivity.

Abstract: In particular embodiments, a method includes accessing a first binary decision diagram (BDD) representing data streams from sensors, accessing a second BDD representing health states associated with specified data ranges, and constructing a third BDD by performing an AND operation between the first and second BDDs.

Abstract: A method for automatically retrieving and analyzing multiple groups of documents by mining many-to-many relationships: (1) inputting first retrieval condition and retrieving first result set A; (2) inputting second retrieval condition and retrieving second result set B; (3) inputting at least one or pluralities of matching conditions for the first result set A and the second result set B; (4) obtaining at least one or pluralities of matched pairs, wherein the matched pairs Mmn=(Am, Bn) comprise of the first document Am from the first result set A, and the second document Bn from the second result set B and Am and Bn satisfy the matching conditions, and collecting sets of documents from the matched pairs Mmn as AT, BT, wherein AT={Am, Am?Mm.,}, BT={Bn, Bn?M.n}, Am?ATA, Bn?BTB; (5) analyzing AT, BT combined or separated and obtaining the results.

Abstract: Additional semantic information that describes data sets is inferred in response to a request for data from the data sets, e.g., in response to a query over the data sets, including analyzing a subset of results extracted based on the request for data to determine the additional semantic information. The additional semantic information can be verified by the publisher as correct, or satisfy correctness probabilistically. Mapping information based on the additional semantic information can be maintained and updated as the system learns additional semantic information (e.g., information about what a given column represents and data types represented), and the form of future data requests (e.g., URL based queries) can be updated to more closely correspond to the updated additional semantic information.

Abstract: A method and system for automatic data categorization in response to a user query. A document set is retrieved in response to the user query. A semantic parser parses the document set and produces semantic term-groups by parsing a semantic network of nodes. A seed ranker produces a plurality of advantageously spaced semantic seeds based on the semantic term-groups. A category accumulator stores the advantageously spaced semantic seeds. The semantic network of nodes is augmented with the advantageously spaced semantic seeds.

Abstract: Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include one or more intervals. Thereafter, a best search is performed to identify a path, or paths, from a starting vertex to a goal vertex having a path value closest to a target value.

Abstract: An extended collaboration event monitoring system monitors users' interactions with computer software applications and detects and extracts events. The system intelligently determines whether the extracted events trigger undetected events or other action items. The system provides the extracted events to a social networking client that translates the extracted events and returns the translated data to the system. The system publishes the translated data to a social networking/collaboration interface embedded into the interface of the computer software application being utilized by one of the users. The system not only publishes the translated data corresponding to a user's interactions with the computer software application to that user's interface, but also publishes the user's interactions with the computer software application to interfaces corresponding to other project team members as well.

Abstract: A disclosed method includes: converting, for each sample point, a set of performance item values for a sample point into coordinate values of a mesh element containing the set among plural mesh elements obtained by dividing a space mapped by the performance items; generating a binary decision graph representing a group of the coordinate values of the sample points; calculating the number of sample points including second sample points that dominates a first sample point and the first sample point, by counting the number of paths in the binary decision graph from a root node to a leaf node representing “1” through at least one of certain nodes corresponding to coordinate values that are equal to or less than coordinate values of the first sample point; and calculating a yield of the first sample point by dividing the calculated number by the number of the plural sample points.

Abstract: A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database.

Abstract: A system for transforming domain specific unstructured data into structured data including an intake platform controlled by feed back from a control platform. The intake platform includes an intake acquisition module for acquiring data building baseline data related to a domain and problem of interest, an intake pre-processing module, an intake language module, an intake application descriptors module, and an intake adjudication module. The control platform includes a control data acquisition module, a control data consistency collator, a control auditor, a control event definition and policy repository, an error resolver, and an output that outputs results of the workflow into structured data enabled to be used in data analytics.

Abstract: A method of optimizing a plurality of objectives includes the steps of initializing a set of simplices; selecting a simplex from the set of simplices; computing one or more weights based at least in part on the selected simplex; and generating a point on a tradeoff surface by utilizing the one or more weights in a weighted-sum optimization.

Abstract: In some example embodiments, a system and method are illustrated as including receive pattern data that includes transaction data relating to transactions between persons. Next, the system and method may include building at least one secondary network based upon the pattern data. Additionally, the system and method may include displaying the at least one secondary network.

Abstract: A network association mining algorithm and associated methods are presented which accepts data from biological and other experiments and automatically produces a network and attempts to explain the behavior of the biological or other system underlying the data using evolutionary techniques. The model and associated methods aim to identify the inter-relationships consistent with data and other prior knowledge supplied to the system. The network is represented in terms of coupled dynamical system. These dynamical systems are represented by differential or difference equations to educe these dynamical systems and coupling between them, an evolutionary algorithm is used. The output of the linkage finder could assist scientists to better understand the systems underlying and to guess at surrogate data.

Abstract: An information processing apparatus includes a controller acquiring texts including each of a plurality of commercial product names to be analyzed, with respect to the respective commercial product names, from a storage device when the commercial product names are entered into the controller, extracting first phrases and second phrases from the acquired texts with respect to the commercial product names, the first phrases and the second phrases being classified as belonging to a first kind and a second kind, respectively, as expressions of evaluation of commercial products indicated by the commercial product names, and generating a graph representing evaluation points as values corresponding to the differences between counts of the first phrases and the second phrases.

Abstract: A method of determining an appropriate response to an input includes linking a plurality of attributes to a plurality of response templates using a plurality of Boolean expressions. Each attribute is associated with a set of patterns. Each pattern within the set of patterns is equivalent. The method also includes determining an appropriate response template from the plurality of response templates based on the input.

Abstract: In one of many possible implementations, an exemplary method comprises maintaining a baseline data structure comprising a plurality of baseline data records and a base set of relationships between the baseline data records, providing, for access by an external party, a customizable data structure comprising copies of the baseline data records and a customizable set of relationships between the copies of the baseline data records, fixing the base set of relationships in the baseline data structure to be unchangeable by the external party, and defining the customizable set of relationships in the customizable data structure to be changeable by the external party. Corresponding systems and methods are also disclosed.

Abstract: A method of building a data integration environment is provided. According to one embodiment of the invention as applied to a computer network, the method comprising: identifying the data integration environment and the policies that apply to it 200, negotiating with the environment 202, and generating a new interface rule set enabling information to be passed in dependence thereon between the system which is made part of the integration environment and the integration environment. The method can be usefully applied in UAV networks, robot networks as well as in networks of fixed sensors. The invention finds utility in various important applications such as in network-enabled capability and in rapid integration of systems.

Abstract: Techniques for searching large data sets. A semantically restricted relation graph is generated for an ontology. Queries to the ontology are resolved using the semantically restricted relation graph.

Abstract: Systems, methods, and other embodiments associated with data manipulation operation restriction enforcement on graph data are described. A statement specifying a data manipulation operation to modify graph data that will modify one or more triples in the graph data is received. One or more resources that the one or more triples describe is determined. Data constraints associated with the resources are accessed. The access constraints are evaluated on the graph data. The data manipulation operation is selectively restricted based, at least in part on, the evaluation of the access constraints.

Abstract: A dictionary mapping source locale strings to target locale strings is constructed. A tree is constructed from the dictionary. The tree has nodes including a start node, end nodes, and string nodes. The nodes form node chains of the tree that correspond to the source locale strings. Each node chain links a collection of the nodes from the start node to a string node. Each node other than the start node has a parent node and corresponds to a character of the source locale strings. Each node other than the end nodes has one or more child nodes. Each string node ends a node chain, and corresponds to a mapping within the dictionary of a source locale string to a target locale string. An input string having the source locale is processed against the tree to generate an output string having the target locale.

Abstract: A computer implemented method of constructing formal definitions in intelligent glossaries for interpreting text, comprising the steps of: providing at least one Distinction having a Boundary, an Indication, a Counter-indication and a Frame; modeling each Distinction as a diagram to provide a Distinction Model; verifying each distinction model as being an instantiation of a generic Distinction Pattern; providing at least one Arrangement made of nonintersecting Marks of Distinction containing Indications from the verified Distinction Model; writing at least one Formulation for each Indication appearing in verified Distinction model and Arrangement, providing well-founded Indications; calculating precise Formulations in Natural Language from well-founded Indications by substituting Variables symbols and/or replacing Constants symbols to transform imprecise Formulations into precise Formulations; selecting a Definition type and embedding at least one precise Formulation and Definition type as a formal Definition

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: The patent describes a single location and application on a network where a user can organize public, group, and private/personal information and have this single, location accessible to the public. A new, ontology-driven portal that organizes all three categories of data according to various “facets” using underlying ontologies to define each “facet” and wherein any type of information can be classified and linked to other types of information is disclosed. An application that enables a user to effectively utilize and manage knowledge and data the user posses and allows other users to effectively and seamlessly benefit from the user's knowledge and data over a computer network is also disclosed. A method of processing content created by a user utilizing a semantic, ontology-driven portal on a computer network is described. The semantic portal application provides the user with a content base, such as a semantic form or meta-form, for creating a semantic posting.

Abstract: Pre-existing business objects (e.g., component parts of large business applications) may already define a hierarchy of related terms and include a search index created by a pre-existing search function. A semantic network including a plurality of semantic knowledge domains may be constructed automatically, based on the objects' initial terms structure and search index, and further modified by search results and related terms returned by the search function. This way, a customer specific semantic network may be constructed automatically from pre-existing software components and terms.

Abstract: Information processing systems, reasoning modules, and reasoning system design methods are described. According to one aspect, an information processing system includes working memory comprising a semantic graph which comprises a plurality of abstractions, wherein the abstractions individually include an individual which is defined according to an ontology and a reasoning system comprising a plurality of reasoning modules which are configured to process different abstractions of the semantic graph, wherein a first of the reasoning modules is configured to process a plurality of abstractions which include individuals of a first classification type of the ontology and a second of the reasoning modules is configured to process a plurality of abstractions which include individuals of a second classification type of the ontology, wherein the first and second classification types are different.

Abstract: An optimum route searching apparatus, method and recording medium make it possible to obtain the optimum cable laying route in a short period of time. The optimum route searching apparatus includes an external storage device for storing search data comprising information related to a route that has a node as a connection point; a simplification device for creating simplified data by extracting information related to a node constituting a branching point, a bending point and a terminal point; a connection information creation device for creating a connection information file of cable laying route based on the simplified data; and a searching device for searching for an optimum cable laying route candidate based on the connection information file. The search termination determination determines search termination for all routes in accordance with the route of interconnected nodes from the start point to either the end point or the dead end having been written to all cards by a card writing device.

Abstract: Target value search methods and systems are presented for solving a target value path problem to identify a path or paths in a graph in which a connection graph is created and upper and lower bound values are determined for each node in the connection graph, and a first best search is performed to identify a path or paths from a starting node to a goal node having a path value closest to the target value.

Abstract: Disclosed are an apparatus and method of constructing interactive contents. The data processing apparatus may transit a branching graph into a planning domain, wherein information on nodes and arcs of the branching graph may be classified to generate property and class information, and the classified properties may be used as pre-conditions of a plan operator on the planning domain.

Abstract: Embodiments may include a system for generating an enhancement of an ontology. The system may have a memory unit and a processing unit. The memory unit may be configured to provide the ontology and to store the ontology with the enhancement. The processing unit may be configured to identify a service specification, such as a service product or a contract, that may be represented by a class of the ontology. The service specification may describe a capability of a service. The processing unit may be further configured to compute a set of instances that are specified by the service specification and by a requirement specification and to enhance the ontology with a generated class representing the set of instances in case that the set of instances has one or more instances.

Abstract: The present invention provides a method for extracting relationships between words in textual data. Initially, training relationship data, such as word triplets describing a cause-effect relationship, is received and used to collect additional textual data including the training relationship data. Distributed data collection is used to receive the training data and collect the additional textual data, allowing a broad range of data to be acquired from multiple sources. Syntactic patterns are extracted from the additional textual data and a distributed data source is scanned to extract additional relationship data describing one or more causal relationships using the extracted syntactic patterns. The extracted additional relationship data is then stored, and can be validated by a supervised learning algorithm before storage and used to train a classifier for automatic validation of additional relationship data.

Abstract: In a networked computer system that includes multiple nodes and multiple networks interconnecting the nodes, a database query optimizer takes network choice into consideration when optimizing a query. The query optimizer logs historical information for queries that includes network information. A network monitor determines network characteristics of the multiple networks. The query optimizer then selects a network for a query based on the network characteristics, and optionally based on the historical information as well. The result is a query optimizer that takes network choice into consideration, thereby providing a query that is optimized according to the characteristics of the networks.

Abstract: A computer implemented method used to interpret text, including from a set of formal glossaries which may refer one to the other and are intended to define precisely the terminology of a field of endeavor. Such glossaries are known as intelligent, in the sense that they allow machines to make deductions, without the need for human intervention. However, they may also accept human intervention. Once a word is defined in an intelligent glossary, all the logical consequences of the use of that word in a formal and well-formed sentence are computable. The process includes a question and answer mechanism, which applies the definitions contained in the intelligent glossaries to a given formal sentence. The methods may be applied in the development of knowledge management methods and tools that are based on semantics; for example: modeling of essential knowledge in the field based on the relevant semantics.

Abstract: Systems and computer-implemented methods are provided for comparing, associating and deriving associations between two or more spatial temporal data trails. One or more spatial-temporal data trails comprising one or more places are received at a processor. Each place is identified by a spatial temporal data point. And each spatial-temporal data trail is associated with an individual. The similarity between pairs of places is determined to establish one or more groups of places or one or more groups of individuals. Similarity and/groups can be determined based on demographics associated with the place or individual.

Abstract: There is disclosed a system and method for using a knowledge representation to provide relevant information based on environmental inputs. In an embodiment, the system and method considers environmental information from members in a crowd to generate a pool of interests based on the semantic relevance concepts associated with those interests. The most prominent concepts of interest may then be the basis for presenting content to the crowd as a whole. In another embodiment, environmental inputs and other surrounding inputs are considered as a user context. The concepts may be identified as relevant from the environmental context and used to present information relevant to the user given his or her surroundings.

Abstract: A method, system, and computer software for information retrieval in semantic networks, has the steps of: acquiring a graph of interest, assuming a novel metric regarding the acquired graph, specifying a query node of interest on the obtained graph, calculating a shortest-path distance from the query node of interest to a plurality of other nodes on the acquired graph, obtaining a ranked list of nodes based on the calculated shortest-path distance, and displaying for a user the retrieved information.

Abstract: A computer implemented data processor system shifts a semantic network topology to increase efficiency in disambiguating a contextual meaning of natural language symbols.

Abstract: A semantic home network management system includes: a home network for collecting sensing information based on a state of a home network and analyzing the collected sensing information to configure semantic information; and a cloud inference apparatus for collecting and managing the semantic information provided from the home network through an internet protocol (IP) network, and applying an inference rule to the collected and managed semantic information to provide inference rule-applied semantic information to the home network. The inference rule is a rule that performs inference by recognizing at least one of a device state, a network state, a system state, and a service state.

Abstract: A computer implemented data processor system automatically disambiguates a contextual meaning of natural language symbols to enable precise meanings to be stored for later retrieval from a natural language database, so that natural language database design is automatic, to enable flexible and efficient natural language interfaces to computers, household appliances and hand-held devices.

Abstract: Some embodiments of the present invention provide a system that selects links while updating a probabilistic generative model for textual documents. During operation, the system receives a current model, which contains terminal nodes representing words and cluster nodes representing clusters of conceptually related words, wherein nodes in the current model are coupled together by weighted links, wherein if a node fires, a link from the node to another node is activated and causes the other node to fire with a probability proportionate to the weight of the link. Next, the system applies a set of training documents containing words to the current model to produce a new model. While doing so, the system: determines expected counts for activations of links and prospective links; determines link-ratings for the links and the prospective links based on the expected counts, and selects links to be included in the new model based on the determined link-ratings.

Abstract: Systems and methods are provided for assisted decision-making. A knowledge base comprises a plurality of executable stories. A given story comprises a belief network containing at least one associated hypothesis and evidence associated with the at least one hypothesis. The system further comprises at least one decision algorithm having respective associated input formats. A translation interface is operative to convert a given story from the knowledge base into a decision network having a format associated with the at least one decision algorithm.

Abstract: Semantic information that describes data sets is inferred based upon a semantic analysis performed on data sets retained within a data repository. The semantic analysis can include a determination of formats associated with fields of the data sets and a comparison of values of the fields against reference data sets having predetermined semantic types. Correlations are inferred between data sets based upon respective semantic information. The correlations are incorporated into visualizations displayed in connection with a graphical user interface.

Abstract: A system and method for performing discovery of digital information in a subject area is provided. Each of topics in a subject area, training material for the topics, and a corpus comprising digital information are designated. Topic models for each of the topics are built. The topic models are evaluated against the training material. The digital information from the corpus is organized by the topics using the topic models into an evergreen index.

Abstract: A network includes at least one relational grid with nodes with each node in the relational grid having an opinion about all other nodes in the grid, including the datum and associated interpretation held by each other node, with the opinions of nodes about a given node in the relational grid being independent.

Abstract: A method and system for determining a probability of inferring an unknown attribute value for an attribute of interest for a target node in a social network. The method comprises the steps of receiving as an input attribute values and link relationships for a plurality of additional nodes in the social network, creating a simplified network using the input values and relationships, and calculating the probability of inferring the unknown attribute value for the target node.

Abstract: A system and method of selecting a package model may include maintaining a data structure of a plurality of package models. Each package model may have a plurality of package model attributes including at least a size and a style. A user input may be received that is descriptive of a desired package capability. The user input may be analyzed using a semantic reasoner to determine one or more desired attributes. One or more package models may be automatically selected by accessing the data structure wherein, for each selected package model, each desired attribute satisfies the corresponding package model attribute. The one or more selected package models may be presented.