Abstract: A Global Information Bus (GIB) architecture is an infrastructure for deploying and managing individual services on a global scale. The GIB is a series of services that may change from one execution to another, finding and collaborating with other services dynamically. This series of collaborating services may start to resemble an ecosystem, and GIB architecture may maintain the interconnectedness and stability of this ecosystem as it continually changes. To that end, the GIB includes an enterprise repository service for storing related information related to services running in the enterprise where the enterprise consists of a group of network domains.

Abstract: Systems and methods for clustering documents, such as for scientific documents, taking into account the citation patterns of the documents are disclosed. In one embodiment, the method includes locating citations to other documents, e.g., search result documents, comparing each pair of documents to be clustered for overlapping citations in a first, a more specific second, and an even more specific optional third citation generality, and determining clusters of related documents based on the comparisons. The levels of generalities may be, for example, document-, paragraph-, and/or citation-level generalities. The locating may locate only citations to the other documents to be clustered. The clusters may be determined based on a weighted score of the amount of overlapping citations in the various generalities and/or by performing factor analysis using the comparison results. The clusters may be ranked to determine the dominant clusters.

Abstract: Predicate abduction involves identifying, from a database statement, predicates on attributes of dimensional data, and applying those predicates to corresponding measure data so that only measure values are fetched and returned for dimension values that satisfy the predicate. In contrast to processing joins of relational data, the subset of the measure data is determined without needing to join a fact table with a dimension table and, therefore, without processing every fact record to determine which measure values are associated with records that satisfy the condition. Buffer reuse involves storing in buffers the “domains” of queries executing on multidimensional data. Responsive to detecting that execution of a database statement requires multiple iterations of extracting the same multidimensional data, the data is extracted during the first iteration and stored in a buffer so that, for each subsequent iteration, the buffer-stored data is accessed rather than re-extracting the data.

Abstract: A method and apparatus for visualizing results from a text search engine are described. A query term is first received. A first set of results is generated based on the query term using a database storing documents, and an index of documents, each document having at least one structural element. Structural elements associated with the first set of results are retrieved. A second set of results is generated based a predefined relationship between the structure elements and the query term. A visualization of the second set of results is displayed.

Abstract: A computer-readable recording medium storing a data processing program that causes a computer of a group of mutually communicable computers to execute, an acquisition procedure configured, when a processing request for an arbitrary data is inputted, to acquire the number of replicas set in the arbitrary data, a selection procedure configured to select computers, which serve as arrangement destinations of the arbitrary data and are as many as the number of replicas, from the computers of the computer group by using a predetermined algorithm, a transmission procedure of the number of replicas, configured to transmit the number of replicas of the arbitrary data, which number is acquired by the acquisition procedure, to all the computers of the computer group, and a processing request transmission procedure configured to transmit the processing request to each the computers that are selected by the selection procedure and as many as the number of replicas.

Abstract: In an embodiment, a technique for changing a parent model based on changes made to a referenced model. The technique may include receiving one or more changes for the referenced model. The referenced model may be changed based on the received one or more changes. Change information about the one or more changes to the referenced model is maintained. A reference to the referenced model from the parent model is processed. Processing may include changing the parent model based on the maintained change information for the referenced model.

Abstract: A content management system provides a way to detect a change to one part of a document, and to generate a corresponding change in a different part of the same document. Dynamic inclusion rules define conditions that, when satisfied, allow automatically changing a link in a document to a new link when corresponding data in the document is added or changed. If a change corresponds to a defined dynamic inclusion rule, a corresponding query in the rule is evaluated according to the changes in the document. When there is enough information to run the query, the query is automatically executed in a background process. If there is a single link that satisfies the query, the document may be updated with the new link. If multiple links satisfy the query, the top ranked query result may be automatically selected, or the user may select which link should be included in the document.

Abstract: Determining and using word information entropies includes: determining one or more categories that correspond to a plurality of queries; sorting the plurality of queries into one or more groups based at least in part on the determined categories of the plurality of queries; segmenting queries that correspond to each of the one or more groups into a first plurality of phrases, wherein each phrase includes one or more words; determining occurrence probabilities for the plurality of phrases; and determining word information entropies for the plurality of phrases based at least in part on the determined occurrence probabilities.

Abstract: In one general aspect, the application discloses a data visualization method that includes accessing data tables and receiving an axis binding definition for a particular visualization that relates values in a first of the tables to sets of fields in a second of the tables. A marking indication can then be received that selects one of the values in the first of the tables, and a set of fields in the second table is accessed based on the marking indication and the axis binding definition. This accessed set of fields is presented in the particular visualization for which the axis binding definition was received.

Abstract: In one embodiment, a service mediator provides a service that is a composite of atomic services and executes a recovery pattern in the event that a service is not available. More particularly, in an initial phase of operation, the service mediator determines one or more recovery patterns for each atomic service offered in the composite service and stores in a database an identity of each such recovery pattern for each atomic service. In subsequent operation, the service mediator monitors the availability of each atomic service. When a user inquires of a composite service, the service mediator determines if any of its atomic services is unavailable. If an atomic service is unavailable, the service mediator selects a recovery pattern and executes it.

Abstract: Disclosed are an apparatus, method, and program product which each provide an enhanced database engine. Access to precise values is provided while permitting unfettered access to those who are not interested in precise values. This is accomplished via an enhanced database index and indexing method. The entries of the database index are normalized to exclude precision. Individuals interested in precision can then specify precision as part of their query through use of a PRECISE keyword. Results are then filtered to account for the specified precision.

Abstract: The methods, systems, and data structures are taught for federating disparate calendaring systems into composite calendaring systems and composite calendars. First and second calendaring systems are bridged to a composite calendaring system using a bridging communication. The composite calendaring system tracks and presents selective information within a composite calendar.

Abstract: An electronic document analysis method using a processor for analyzing N electronic documents, the method comprising providing a set of control electronic documents from among the electronic N documents; and using the set of control electronic documents and a processor to evaluate at least one aspect of a computerized text-classifier based electronic document categorization process performed on the N documents including computation of at least one statistic; wherein providing includes providing an initial set of control electronic documents; computing, using a processor, an estimated validation level of the at least one statistic assuming the initial set is used, and comparing the estimated validation level to a desired validation level, using a processor, and enlarging the initial set of control electronic documents if the estimated validation level falls below the desired validation level.

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: A data storage or management method is provided which allows both a content object-based access and a file-based access. A first request for storing a content object in accordance with the processing of an application program executed in a host is sent to an object archive control functionality executed in the host, an intermediate server, or a storage apparatus. The object archive control functionality generates an object identifier corresponding to the content object received in response to the first request, a directory name corresponding to the object identifier, and a plurality of file names corresponding to a plurality of fields contained in the content object. The storage apparatus stores a directory having the directory name and the plurality of files having the plurality of file names in accordance with the second request.

Abstract: The present invention relates to a system for generating a table comprising generating means for generating a table which contains at least a column or line depicting one or more first categories and at least a column or line depicting first values associated with said first categories and wherein the system further comprises selecting means for selecting one of said first categories by a user and adding means for enlarging the table upon selection of a category by said selecting means, said adding means being adapted to enlarge the table by adding a new column or line which comprises second categories into which said selected first category may be subdivided as well as second values associated with said second categories and wherein said new column or line does not comprise categories into which non selected first categories may be subdivided.

Abstract: A system to update a data structure based on a plurality of parent data structures, where at least one of the plurality of parent data structures is associated with point data. Some embodiments may include reception of a notification to update from one of the plurality of parent data structures, determination that one or more of the plurality of parent data structures is updating, determination of whether a notification to update has been received from each of the one or more of the plurality of parent data structures, and, if the notification to update has been received from each of the one or more of the plurality of parent data structures, update of the data structure based on data of the one or more of the plurality of parent data structures.

Abstract: Described is a technology in which new words (including a phrase or set of Chinese characters) are mined from a query log. The new words may be added to (or otherwise supplement) an IME dictionary. A set of candidate queries may be selected from the log based upon market (e.g., the Chinese market) and/or by language. From this set, various filtering steps are performed to locate only new words that are frequently in used. For example, only frequent queries are kept for further processing, which may include filtering out queries based on length (e.g., less than two or greater than eight Chinese characters), and/or filtering out queries based on too many stop-words in the query. Processing may also include filtering out a query that is a substring of a larger query, or vice-versa. Also described is Pinyin-based clustering and filtering, and filtering out queries already handled in the dictionary.

Abstract: An apparatus for generating a collection profile of a collection of different media data items has a feature extractor for extracting at least two different features describing a content of a media data item for a plurality of media data items of the collection, and a profile creator for creating the collection profile by combining the extracted features or weighted extracted features so that the collection profile represents a quantitative fingerprint of a content of the media data collection. This collection profile or music DNA can be used for transmitting information, which is based on this collection profile, to the entity itself or to a remote entity.

Abstract: One embodiment of the present invention provides a system that generates queries to search for matching forms in a set of forms, without requiring a pre-configured forms management system. During operation, the system obtains a form template, wherein the form template includes a form schema which specifies field names and data types for fields in form instances associated with the form template. Next, the system allows a user to specify search criteria for one or more fields defined by the form schema. Then the system generates a query based on search criteria entered by the user, and runs the query against the set of forms to identify matching forms. Finally, the system generates a list of the matching forms.