Abstract: Methods, systems and media are provided for turning large volumes of globally distributed data into actionable information by building a distributed semantic graph and maintaining such graph with up to date changes in data and client needs are provided. The semantic graph can be used to run subscriptions over interconnected semantic servers where each server can be capable of coupling to data sources, client applications and other semantic servers.

Abstract: Techniques used in an automatic failover configuration having a primary database system, a standby database system, and an observer. In the automatic failover configuration, the primary database system remains available even in the absence of both the standby and the observer as long as the standby and the observer become absent sequentially. The failover configuration may use asynchronous transfer modes to transfer redo to the standby and permits automatic failover only when the observer is present and the failover will not result in data loss due to the asynchronous transfer mode beyond a specified maximum. The database systems and the observer have copies of failover configuration state and the techniques include techniques for propagating the most recent version of the state among the databases and the observer and techniques for using carefully-ordered writes to ensure that state changes are propagated in a fashion which prevents divergence.

Abstract: A method is provided for analyzing the semantic content of network configuration files, comprising the steps of accessing configuration files associated with corresponding network components, the files containing commands that define the configuration of those components; transforming the commands into a structural database based, at least in part, on a non-grammatical analysis of the commands, wherein the structure of the commands is represented as the structural database; and constructing a semantic database of the configuration files by querying the structural database.

Abstract: The present invention discloses an improved method and system for indexing and searching content in a distributed computing network. The present invention also enables users to search for content on a distributed computing network, as well as on the web, via a unified interface. In one embodiment, the present invention is directed toward a method for searching content on a distributed computing network having an index of available data. The method comprises scanning cached network files in a computer that is in data communication with a network wherein said network files are generated in the course of a user's access of public or private communication networks, indexing the cached network files to generate index data, and supplying index data to the index of available data on the distributed computing network.

Abstract: Exemplary embodiments of system, computer-accessible medium and method can be provided for organizing or analyzing at least two sets of data. The sets of data can be organized and/or analyzed by generating a data structure for the sets of data and comparing the data structure for the at least two sets of data. The data structure can be in the form of a phylogenetic-type tree, and at least one of the sets of the data can include time series data.

Abstract: A data structure is formatted that supports a single access operation while enabling data structure verification, data integrity verification, and data extensibility. The data format utilizes error identifier fields to enable the verification of data integrity and bracket pairs to verify data structure integrity and to support data structure extensibility. The data structure is utilized to perform a single access operation. In performing a single access operation, the data structure is read, the data format is verified, and the data integrity is verified. In addition, in instances where the data structure includes complex data, a new feature, or a prior program version, support for the complex data, new feature, or prior program version is provided.

Abstract: A system and method are provided for automatically generating systematic reviews of received information in a field of science and technology, such as scientific literature, where the systematic review includes a systematic review of a research field in the scientific literature.

Abstract: Method(s) for identifying a taxon corresponding to a query sequence are described herein. The method includes selecting a target cluster, from amongst a plurality of reference clusters, corresponding to the query sequence. The target cluster may be selected based on a composition based analysis. A similarity based analysis of the query sequence is performed with respect to the target cluster. From the target cluster, the taxon corresponding to the query sequence is identified based on the similarity based analysis.

Abstract: Methods and systems of the present invention allow for displaying suggested concept-based results. An exemplary method may comprise the steps of receiving a combination domain name and top level domain (TLD), determining from ontological calculations suggested TLDs related to the concept of the combination and displaying the suggested combination of the domain name with suggested TLDs.

Abstract: A computer-implemented method of defining a set of annotation elements to map a concept to electronic data as input data; generating a mapping rule, according to the set of annotation elements defined and a sample of the input data; mapping the concept to the input data by applying the mapping rule to the input data; and generating a semantic instance of the input data based upon the mapping of the concept to the input data. The set of annotation elements to map the concept to the input data are a selected ontology corresponding to the input data, a selected ontology concept from the selected ontology, a mapping of a word or word phrase in the sample input data to the selected ontology concept from the selected ontology, and a pattern of the mapped word or word phrase relative to a structure of the sample input data.

Abstract: A dialogue control system that uses an ontology that systematically expresses domain knowledge representing concepts and relationships between concepts to determine questions for a user and implements the questions, and implements a dialogue in accordance with received user answers. One or more dimension-classified ontologies and a basic ontology are stored, a concept from a user response is specified as a condition, and one or a plural number of the dimension-classified ontologies that meet the specified condition are fetched. The content of the fetched dimension-classified ontology/ies is overwritten on the basic ontology, in order according to dimension priorities from the dimension-classified ontology with the lowest dimension priority, and a multidimensional ontology is generated. The dialogue control system uses this multidimensional ontology to control the dialogue.

Abstract: A document analyzer receives a collection of text-based terms associated with a document. The document analyzer performs a statistical analysis on the text-based terms to identify a distribution of where the text-based terms appear in the document and relative frequency indicating how often the text-based terms appear in the document. The document analyzer utilizes the distribution and relative frequency information derived from the statistical analysis to rank multiple themes associated with the document. For example, a received listing of multiple themes may not be presented in any useful order, although it can be assumed that the themes in the listing are present in the document. Based on application of distribution and relative frequency information derived from the analysis, the document analyzer can identify which themes are most relevant to the document as a whole and/or which of themes correspond to different portions (e.g., pages or sections) of the document.

Abstract: Managing network event information from a plurality of network appliances is disclosed. Each network appliance provides a network service and each has a version of a common database. Managing includes detecting network event information at a first network appliance, updating a version of the common database on the first network appliance with the network event information, and propagating the network event information to other versions of the database on other network appliances.

Abstract: Methods and systems for searching over large (i.e., Internet scale) data to discover relevant information artifacts based on similar content and/or relationships are disclosed. Improvements over simple keyword and phrase based searching over internet scale data are shown. Search engines providing accurate and contextually relevant search results are disclosed. Users are enabled to identify related documents and information artifacts and quickly, ascertain, via visualization, which of these documents are original, which are derived (or copied) from a source document or information artifact, and which subset is independently generated (i.e., an original document or information artifact).

Abstract: Methods, systems and media are provided for turning large volumes of globally distributed data into actionable information by building a distributed semantic graph and maintaining such graph with up to date changes in data and client needs are provided. The semantic graph can be used to run subscriptions over interconnected semantic servers where each server can be capable of coupling to data sources, client applications and other semantic servers.

Abstract: Systems and methods are provided to enhance biometric data available to authorities to identify individuals by linking the available biometric data semantically to data from other sources to improve identity management using a semantic computing server that builds a semantic graph based on the data. Using a semantic graph helps determine the identity and possible intention to deceive of certain individuals.

Abstract: A semantic-based searching apparatus and method which can search for desired information from various types of media using associative properties of search target objects are provided. The semantic-based searching apparatus stores an associative search structure that previously stores a semantic index. The associative search structure is to obtain a final search object corresponding to an input search query. The semantic index configuration includes feature metadata used to identify a specific object, semantic entity metadata to indicate semantic entities corresponding to the feature metadata, and semantic relation metadata to indicate a relation between the semantic entities. The semantic-based searching apparatus uses semantic metadata stored in conformity with the semantic index configuration, the semantic index, and the associative search structure to generate a search result corresponding to the input search query.

Abstract: Methods and apparatus for information organization and exchange by providing a data store of interconnected items of information that together form an intent-driven taxonomy. This allows users to easily discover and exchange real-time items of information across applications.

Abstract: A method and system For Semantically Unifying Data from multiple disparate sources into a common semantic framework. The method and system For Semantically Unifying Data generally includes a data unification system containing a computer, server, network connection, stored data files, and software logic to allow a user to edit and manage key data integration and data quality information; a semantic framework containing a domain's concepts and data definitions; rule dictionaries containing business and technical rules; data dictionaries containing data models and specifications; an object metadata schema containing semantic metadata; and, ontology templates defining object classes for machine readable data concepts.

Abstract: A method, system and program product for modeling data as an undirected graph is disclosed. A set of entities and a set of attributes are defined. A set of relationships is defined to represent semantic associations with each association connecting at least two entities. Attributes are associated with entities rather than with relationships. A hierarchical query language with a set of atomic operations on modeled data is employed. The modeled data is displayed on a display unit.

Abstract: A computer program product including stored program code adapted to implement a method for document analysis and retrieval. A document that includes text is received from a host. Document keys associated with the text are generated. In first embodiments, a document taxonomy is provided. The taxonomy has categories and associated category keys. The category keys of each category are compared with the document keys to determine a distance between the document and each category as a measure of how close the document is to each category. A subset of the categories is returned to the host, wherein the subset of the categories reflects the determined distances. In second embodiments, a search string is created as a logical function of a subset of the document keys. The search string is submitted to a search engine. Links to related documents are received from the search engine and returned to the host.

Abstract: A universal asset and relationship manager, allows interaction and correlation between user-based data records—which define, list and catalogue user-based assets, comprising both physical assets and information assets—with vendor-based data records, in a manner which enables users to manage, track and service their assets for organizational, upkeep, inventory and business purposes.

Abstract: Methods, systems, and products are disclosed for classifying content segments. A set of annotations is received that occur within a segment of time-varying content. Each annotation is scored to each node in an ontology. The segment is classified based on at least one of the scores.

Abstract: Data structures, systems, methods and computer program products that enable precise information retrieval and extraction, and thus facilitate relational and associative discovery are disclosed. The present invention utilizes a novel data structure termed a “Knowlet” which combines multiple attributes and values for relationships between concepts. While texts contain many re-iterations of factual statements, Knowlets record relationships between two concepts only once and the attributes and values of the relationships change based on multiple instances of factual statements, increasing co-occurrence or associations. The present invention's approach results in a minimal growth of the Knowlet space as compared to the text space and it thus useful where there is a vast data store, a relevant ontology/thesaurus, and a need for knowledge navigation and (relational, associative, and/or other) knowledge discovery.

Abstract: A system and associated method for utilizing file names for diagnostic data files generated by a runtime environment. The method employs a file counter base that defines a predefined maximum number of files permitted in a file system, a generation number that indicates an instance of the runtime environment, and a file counter that comprises a file name. The file counter circulates by a cycle equal to the file counter base such that the file system uses only a limited disk space. The method determines the generation number per instance of the runtime environment by examining file counters of existing files in the file system. The generation number initializes the file counter for creating file names in the instance of the runtime environment. The method guarantees a longest life span of a diagnostic data file in a file system that has a limited number of files.

Abstract: A content device may select associated content, such as adverts, for a user selected content item based on textual characterizing data for the associated content and the user selected content item. A term set characterizing the user selected content item is expanded using semantic graphs and similarity values between the expanded term set and term sets describing associated content is calculated. A specific associated content item is then selected based on the similarity values. The semantic graph based term set expansion may allow improved accuracy in selecting appropriate associated content while providing a process that is suitable for resource constrained scenarios. In particular, communication resource, memory resource, and computational resource usage may be kept low.

Abstract: An approach is provided for automatic controlled value expansion of information. A value expansion controller detects a request at a device to perform an information operation on a set of data elements of an information space, wherein the request identifies the set by a name and the information operation applies to each data element within the set. The value expansion controller intercepts the request based on the detection and determines the location of the data elements within a communication network based on the name. The value expansion controller retrieves the data elements from the location and populates an expansion table with the retrieved data elements, wherein the expansion table is correlated to the set. The value expansion controller performs the information operation on each data element in the expansion table and causes transmission of one or more results of the information operation to the device.

Abstract: The invention relates to topic classification systems in which text intervals are represented as proposition trees. Free-text queries and candidate responses are transformed into proposition trees, and a particular candidate response can be matched to a free-text query by transforming the proposition trees of the free-text query into the proposition trees of the candidate responses. Because proposition trees are able to capture semantic information of text intervals, the topic classification system accounts for the relative importance of topic words, for paraphrases and re-wordings, and for omissions and additions. Redundancy of two text intervals can also be identified.

Abstract: Techniques are described for performing partition pruning in situations where previous database servers could not. Specifically, techniques are provided for (1) performing partition pruning based on predicates that involve non-prefix subsets of composite partitioning keys, (2) performing partition pruning when a global index access path is used to execute a query, and (3) performing partition pruning when predicates on partitioning columns are OR-ed together. More generally, techniques are described for partition pruning based on a non-contiguous set of not-pruned partitions.

Abstract: The present invention is a method and system for using predetermined preferences/characteristics to ascertain personal compatibility between network or chat room participants based upon profile information. When the system determines that these preferences are favorable for interpersonal compatibility, the system will automatically notify or page the participants so as to facilitate their introduction. Further functionality, aside from the compatibility based upon profile information, includes e-mail and other electronic notification of personal compatibility as well as geographic compatibility.

Abstract: A method for providing contextual support for a publish-subscribe system includes the steps of receiving a user-defined objective of subscription relating to a topic provided from a subscriber to the publish-subscribe system, and determining one or more topics related to the subscriber provided objective of subscription. The method also includes the steps of filtering through a plurality of feeds related to the subscriber provided objective of subscription fed to the publish-subscribe system from one or more feed sources to provide a filtered list of feeds, aggregating through the filtered list of feeds to provide an aggregated list of feeds, and inferencing through the aggregated list of feeds to determine one or more of the plurality feeds that are relevant to the subscriber provided objective of subscription.

Abstract: A method for stabilizing a knowledge graph includes: generating a knowledge graph in which same entities in a semantic relation list between entities provided as an input are represented as a single node based on names and types of the entities; computing, on the knowledge graph, semantic similarities between all potential entity pairs of same entity types by comparing, for each potential entity pair, a type of relation associated with an entity in the entity pair and an opponent entity to the entity; and selecting, based on the semantic similarities, a representative entity from each of semantically similar entity pairs on the knowledge graph and integrating an opponent entity to the representative entity into the representative entity. The method further includes computing relation weighted values between the entities by using a graph analysis and statistic information, and adding the weighted values to the knowledge graph.

Abstract: Methods, systems and media are provided for turning large volumes of globally distributed data into actionable information by building a distributed semantic graph and maintaining such graph with up to date changes in data and client needs are provided. The semantic graph can be used to run subscriptions over interconnected semantic servers where each server can be capable of coupling to data sources, client applications and other semantic servers.

Abstract: Systems, methods, and other embodiments associated with incremental inference are described. One example method includes updating existing or old triples in a semantic model with triples resulting from the addition of new triples. The updating is performed by separating inference rules into joining steps that are performed on first and second predicates for the inference rule. A first joining step joins results of execution of the first predicate on the new triples with the results of execution the second predicate on the union of the old and new triples to produce newly inferred triples. A second joining step joins results of execution of the first predicate on the union of the old and new triples with the results of execution the second predicate on the new triples to produce newly inferred triples.

Abstract: An object model allows code to be developed using a programming environment to access the functionality of an application, in a word processing application, for example. The object model may be used to manipulate one or more data bindings in an application. Code may also be developed using a programming environment for reacting to changes, in either direction, of a content region or a node in XML data associated with one or more data bindings. Code may be developed to define data bindings between file content and content within data in a data store. Additionally, code may be developed that reacts to changes within a bound region of a file or within a data store, trapping or intercepting events, such as edits, additions, deletions, etc.

Abstract: A method transforms unstructured text into structured data in a domain-specific ontology. The method includes recording an input block of text using an information extraction module (IEM), accessing a domain-specific ontology and supplemental data in a knowledge source(s) via the IEM, processing the input text block, and using the IEM to generate a plurality of nodes in the domain-specific ontology. Each node classifies the unstructured text to corresponding objects of interest, thereby transforming the unstructured text into the structured data. An IEM is also provided having a computer device and an algorithm executable thereby to transform unstructured text into structured data in a domain-specific ontology. The IEM is adapted for recording a text phrase using the computer device, accessing and retrieving the domain-specific ontology and supplemental data from a knowledge source(s), and processing the text block using the computer device to generate a plurality of nodes in the domain-specific ontology.

Abstract: A method of semantic-aware record matching includes receiving source and target string record specifications associated with a source string record and a target string record, receiving semantic knowledge referring to tokens of the source string record and target string record, creating a first set of tokens for the source string record and a second set of tokens for the target string record based on the semantic knowledge, assigning a similarity score to the source string record and the target string record based on a semantic relationship between the first set of tokens and the second set of tokens, and matching the source string record and the target string record based on the similarity score.

Abstract: Video on demand services rely on frequent viewing and downloading of content to enhance the return on investment on such services. Videos in general and movies in particular hosted by video portals need to have extensive annotations to help in greater monetization of content. Such deep annotations help in creating content packages based on bits and pieces extracted from specific videos suited to individuals' queries thereby providing multiple opportunities for piece-wise monetization. Considering the complexity involved in extracting deep semantics for deep annotation based on video and audio analyses, a system and method for deep annotation uses video/movie scripts associated with content for supporting video-audio analysis in deep annotation.

Abstract: A system and method to map a set of words to a set of ontology terms, the method including determining a starting point for ontologies including terms matching a set of words, determining a term set corresponding to the set of words in an ontology context of each of the starting points, ranking the term sets determined for all of the starting points, and providing an output of the term sets in a ranked order.

Abstract: A metadata management system and method enables complex query searches by users, e.g., different users having different query needs, using the same infrastructure. For querying metadata, the metadata management system provides functionality for aggregating all the concepts (metadata items) and relationships of the metadata across one or more users in a common format; extracting concepts and storing them in a metadata store (e.g., a relational database); extracting relationships and modeling them in a standard semantic representation. The system and method further records users' different needs on relationships into user-specific configuration files. The system is configured for retrieving, in response to a user query, relevant data items by using the meta-data selectively.

Abstract: The invention relates to a process which makes it possible to display on a computer screen information associated with one or more key words and in which: customers associate information with a word group containing one or more “required” key words selected from a database, a user selects one or more key words “offered”, chosen from the database, for each “required” word group, one analyzes the semantic proximity of the words “offered” and of the aforesaid “required” words by calculating a score inversely proportional to the number of connections separating the aforementioned words on an ontology graph, the aforementioned score being calculated by averaging the partial-scores obtained for each “offered” and “required” word pair, the aforementioned partial-scores being calculated according to the following algorithm: on each ontology graph, one calculates the topology distance between an “offered” word and a “required” word: d(Wo?Wr), if one cannot measure the topological distance then: partial-score=0 if

Abstract: Embodiments of the subject invention comprise a computer based system and methods to collect and compare the attributes of a group of entities using data representing topic data of the entity and interaction data between entities. Embodiments of the invention comprise using minimally invasive means to automatically collect and model both an entity's attributes such as their knowledge/work/interest as well as model the social interactions of the entity together with a means to identify opportunities to influence changes in the entity attributes. Minimally invasive means to collect and model attributes include semantic analysis and topic modeling techniques. Means to model social interactions include social network analysis techniques that can incorporate location data of the entity. Embodiments of the invention further provide a sharable index of the attributes of the entities and the group of entities.

Abstract: The present invention is a method and system for handling a plurality of information units in an information processing system, such as a multimodal human computer interaction (HCI) system, through verification process for the plurality of information units. The present invention converts each information unit in the plurality of information units into verified object by augmenting the first meaning in the information unit with a second meaning and expresses the verified objects by object representation for each verified object. The present invention utilizes a processing structure, called polymorphic operator, which is capable of applying a plurality of relationships among the verified objects based on a set of predefined rules in a particular application domain for governing the operation among the verified objects. The present invention is named Object Verification Enabled Network (OVEN).

Abstract: A machine-based method for querying information in an ontology model includes providing an ontology model to represent domain information, executing a query of the ontology model, the query directed to identify desired domain information based on at least one parameter, processing a query result to identify any of the desired domain information, in response to identifying desired domain information, rendering the desired domain information, re-executing the query automatically at a predetermined frequency, and generating an alert message when query results have changed.

Abstract: The invention relates to topic classification systems in which text intervals are represented as proposition trees. Free-text queries and candidate responses are transformed into proposition trees, and a particular candidate response can be matched to a free-text query by transforming the proposition trees of the free-text query into the proposition trees of the candidate responses. Because proposition trees are able to capture semantic information of text intervals, the topic classification system accounts for the relative importance of topic words, for paraphrases and re-wordings, and for omissions and additions. Redundancy of two text intervals can also be identified.

Abstract: A rating program on a mobile computing device communicates with other mobile devices regarding collected ratings. A user enters ratings and requests for information; the mobile computing device will then operate in the background, actively scanning for other users with the same type of short-range communications and a ratings program. The devices are able to exchange and save ratings, providing a mobile, socially-relevant means of collecting information.

Abstract: The present invention is a method and system for using predetermined preferences/characteristics to ascertain personal compatibility between network or chat room participants based upon profile information. When the system determines that these preferences are favorable for interpersonal compatibility, the system will automatically notify or page the participants so as to facilitate their introduction. Further functionality, aside from the compatibility based upon profile information, includes e-mail and other electronic notification of personal compatibility as well as geographic compatibility.

Abstract: A method of providing information from at least one information resource. A semantic query is received that includes one or more generic constructs referencing an ontology relating to a domain of the information resource(s). A representation of the semantic query in an ontology representation language is inferred from the constructs. The query representation is used to access the information resource(s). This method allows a user to formulate database queries semantically without knowledge as to underlying data structures.

Abstract: A document analyzer receives a collection of text-based terms associated with a document. The document analyzer performs a statistical analysis on the text-based terms to identify a distribution of where the text-based terms appear in the document and relative frequency indicating how often the text-based terms appear in the document. The document analyzer utilizes the distribution and relative frequency information derived from the statistical analysis to rank multiple themes associated with the document. For example, a received listing of multiple themes may not be presented in any useful order, although it can be assumed that the themes in the listing are present in the document. Based on application of distribution and relative frequency information derived from the analysis, the document analyzer can identify which themes are most relevant to the document as a whole and/or which of themes correspond to different portions (e.g., pages or sections) of the document.

Abstract: A method, system, and computer usable program product for semantic data validation of disjoint data are provided in the illustrative embodiments. A mapping is performed for artifacts from a schema to artifacts in a selected ontology, creating a mapping graph having nodes. A first node in the nodes is analyzed using an inference algorithm. The analyzing determines a semantic error in a data corresponding to the schema artifact represented at a second node. A correction for the data is provided such that the correction eliminates the semantic error. Selecting the ontology includes receiving a set of ontologies from ontology sources. A subset of ontologies may be aggregated from the set of ontologies to form a super-ontology. A set of schema artifacts may be matched to a set of artifacts of the super-ontology. The super-ontology may be reduced to form a reduced ontology. The reduced ontology forms the ontology.