Abstract: Techniques for analyzing and synthesizing complex knowledge representations (KRs) may utilize an atomic knowledge representation model including both an elemental data structure and knowledge processing rules stored as machine-readable data and/or programming instructions. One or more of the knowledge processing rules may be applied to analyze an input complex KR to deconstruct its complex concepts and/or concept relationships to elemental concepts and/or concept relationships to be included in the elemental data structure. One or more of the knowledge processing rules may be applied to synthesize an output complex KR from the stored elemental data structure in accordance with an input context. Multiple input complex KRs of various types may be analyzed and deconstructed to populate the elemental data structure, and input complex KRs may be transformed through the elemental data structure to output complex KRs of different types, providing semantic interoperability to KRs of different types and/or KR models.

Abstract: A method and system for converting XML files to and from files in a data format based on hierarchies in real-time. A method for converting from XML to the data format based on hierarchies includes: applying a stylesheet to at least one XML file thereby generating at least one data record in an intermediate format and including information included in the at least one XML file; and, translating the at least one record in the intermediate format to the data format based on hierarchies. A method for converting from a data format based on hierarchies to XML includes: translating at least one record including information stored in the file format based on hierarchies to an intermediate format; and, applying a stylesheet to the at least one record in the intermediate format thereby generating at least one XML file being indicative of the information and suitable for transmission.

Abstract: Methods and apparatus for the convenient arrangement of a user's address book according to intelligent algorithms. These intelligent algorithms, in one embodiment, take advantage of one or more of: (i) stored contact information associated with one or more users, (ii) stored geographic location information associated with the users and one or more contact entries in the user's address book, and/or (iii) stored voice and data communication information associated with the user. This algorithm arranges the entries in the users address book, using the stored information as an input, in an intelligent manner. In other embodiments, additional information is used as an input to the contact entry arranging algorithms such as, for example, entries in a user's digital calendar. Business methods utilizing the aforementioned methods and apparatus are also disclosed.

Abstract: An analysis module is provided in the invention. The analysis module is connected with a database containing several data. The analysis module comprises an analysis unit and a database managing system. The analysis unit is developed by a development software to combine HHT algorithm and an automatic data-loading program. The database managing system is integrated in the analysis unit and connected with the database. The data are transferred to the analysis unit by the database managing system, and the analysis unit is used to load the data by the automatic data-loading program and analyzes the data.

Abstract: An interactive grid display presented on a communications device offers a frontline representative of an enterprise or other user at a work site access to information for addressing a client's request. Available information is sorted and selected via the interactive grid based on a number of primary categories that are identified along one dimension of the grid and a number of subcategories identified along another dimension of the grid. Information is presented in the interactive grid directly, for example, typically without requiring the user to conduct a search for the information. In response to a user selecting a point on the grid for the category and sub-category that best matches the information desired by the representative, based on grid intersection for appropriate primary and secondary categories, the device interface drills down to obtain more specific information for presentation to the user.

Abstract: A computer-based architecture and system provides operational control of the document management process, permitting a client seamless access to sophisticated document production operations. Direct client control over SEC compliant document management permits faster more accurate document production operations.

Abstract: A method and system for merging files of multiple volumes in a data store to a single merged volume. The method includes creating one or more snapshots of one or more volumes of a data store of a first system. Files in the one or more snapshots are merged into a merged volume. The merged volume is mounted and stored in a second system.

Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.

Abstract: Described herein are technologies pertaining to generating co-citation graphs. A context-informative co-citation graph includes a first node that represents a first research document, a second node that represents a second research document, and a third node that represents a third research document that includes a citation to both the first research document and the second research document. The context-informative co-citation graph also includes a first edge that couples the first node and the third node, and a second edge that couples the second node and the third node. The two edges visually indicate that the first research document and the second research document are co-cited by the third research document. The context-informative co-citation graph further includes at least a portion of a sentence in the third research document that includes a citation to at least one of the first research document or the second research document.

Abstract: A method and system for dynamically generating and displaying a home screen on a display of a user device are provided. The method comprises determining at least one estimated user intent based in part on at least one input variable; selecting a plurality of resources of information respective of at least the at least one estimated user intent, wherein each selected resource has a representative icon; providing the plurality of resources to the user device; receiving a selection of a desired resource from the user device; determining a definitive user intent from the at least one estimated user intent based on the selection; generating a new home screen respective of the definitive user intent; and causing the user device to replace a current home screen with the new generated home screen.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for a search dialog user interface. In one aspect, a method includes displaying a search using interface, comprising: a search dialog user interface in which a plurality of search threads are initiated, each search thread comprising a plurality of entries, wherein the entries comprise: one or more query messages, each query message being descriptive of one or more search criteria, one or more result messages, each result message being a message describing criteria for a corresponding search and that is responsive to one or more preceding query messages within the search thread; and a search result display location in which search results corresponding to an active result message are displayed.

Abstract: The present invention discloses methods, systems, and tools for knowledge processing by building maps of ontological subjects for compositions or the contents accompanying a request for service by a user. In one embodiment of the invention the method assigns and calculates an ontological subject power spectrum to each composition or ontological subject. The resulting power spectrum and the adjacency matrix of the map are used to evaluate the merits of the compositions in the context of reference universes. It is also used as a research guiding tool for knowledge discovery. The invention serves knowledge seekers, knowledge creators, inventors, discoverer, as well as general public by assisting and guiding users to assess their work, identify their unknowns, optimize their research trajectory, and provide higher quality contents. The method and system, thereby, is instrumental in increasing the speed and efficiency of knowledge acquisition, discovery, retrieval, as well as faster learning and problem solving.

Abstract: Resolving a query term includes receiving at least one query term from a requestor and determining a geographic location of the requestor. The geographic location of the requestor may be determined by accessing an electronic information store containing a requestor profile including geographic information about the requestor, where the requestor profile is used by more than one program. The query term is resolved against electronic information within at least one electronic information store to determine whether one or more matches exist and a result is generated that accounts for the geographic location of the requestor.

Abstract: A method for dynamically clustering data items, the method comprising: receiving a plurality of data items originating from at least two sources, a plurality of distinct metadata details, and data indicative of associations between the data items and the metadata details, wherein each data item is associated with at least one metadata detail indicative of its owner, and wherein at least a first data item originating from a first source and a second data item originating from a second source are related data items associated with at least one shared metadata detail; grading probabilities of relationships between at least one of the data items and at least one of the metadata details; clustering the data items into one or more clusters, based on the calculated probabilities; and, optionally, sharing clusters and meta-clusters between users.

Abstract: A treewalk for splitting a file directory is disclosed for parallel execution of work items over a filesystem. The given work item is assigned to a worker. Thereafter, a request is sent to split the file directory to share a portion of the file directory with another worker. The worker examines the file directory for a next splittable directory entry key after a current in-progress location within a key space for the file directory. If no key is detected, the file directory is identified as unsplittable. If an entry is detected, the key space is progressively searched for a next entry between a next available directory entry key and an upper boundary. The worker identifies the file directory as splittable if the next available entry is found, providing a range of entries within the file directory for which parallel execution of the work item.

Abstract: An assertion management method includes collecting a SameAs assertion from a plurality of assertions; searching the plurality of assertions for any assertion having a first individual of the SameAs assertion as an instance; and creating a new assertion having a second individual of the SameAs assertion as an instance from each found assertion.

Abstract: Systems and methods for clustering a group of data points based on a measure of similarity between each pair of data points in the group are provided. A pairwise similarity function can be estimated for each pair of data points in the group. A clustering algorithm can be executed to create clusters and associate data points with the clusters using the pairwise similarity function. The algorithm can be iterated multiple times until a stopping condition is reached in order to reduce variance in the output of the algorithm. The pairwise similarity function for each pair of data points can be updated between iterations of the algorithm and the results of each iteration can be aggregated. The data in each data point associated with a cluster can be consolidated into a consolidated data point.

Abstract: Graph queries are processed using a plurality of independent query execution engines. A graph query submitted to a graph database which is modeled by an attributed graph is received. The graph query is decomposed into a plurality of query components. For each of the query components, a one of the query execution engines that is available to process the query component is identified, a sub-query representing the query component is generated, the sub-query is sent to the identified query execution engine for processing, and results for the sub-query are received from the identified query execution engine. The results received are then combined to generate a response to the graph query.

Abstract: An internet and/or intranet based system and method for limiting access to confidential records to properly authorized and authenticated parties. The system's central premise is that the person to whom such records pertain should control access rights through specific, informed consent. It reinforces the widely held conception of privacy in general, while also providing an expedited and cost efficient means to find and transfer confidential records. It also gives the repositories where these records are held the right to stipulate the specific terms and conditions that must be fulfilled before they will release documents. And it carries out all of these legitimate interests in a way that is fast, simple to use and easy to audit. The system optionally includes a billing mechanism to pay for any added cost associated with providing this additional protection; and in its preferred embodiment, is applicable to both digital as well as non-digital records.

Abstract: A method includes receiving a search query from a user interface. The method includes performing a keyword search at a computer device based on the search query to generate keyword search results. The method includes performing a natural language search of a frequently-asked question database based on the search query to generate frequently-asked question search results. The method also includes outputting a display page for display at a display device. The display page categorizes the keyword search results and the frequently-asked question search results into a plurality of categories.