Abstract: A method, program, and system for specification verification. The method includes the steps of: (a) retaining a plurality of documents as groups of abstract documents that display values capable of indicating each metadata; (b) separating the group of abstract documents based on an input condition of an operation; (c) adding a new abstract document by using, based on an output condition, at least one the operation within a group of the operations; (d) separating the abstract documents according to overlapping ranges designated by the metadata; (e) unifying the abstract documents according to overlapping ranges designated by the metadata; (f) repeating the steps (b) to (e) until a termination condition is satisfied; and (g) verifying whether an incomplete abstract document exists when the termination condition is satisfied.

Abstract: A semantic client, a semantic information management server, a method of generating semantic information, a method of searching semantic information, and a computer program recording medium for performing the methods, the semantic client including: an identification (ID) generator to generate an ID of a target content; and a descriptor generator to generate a descriptor that defines correlations between the target content and one or more other contents. Furthermore, the semantic information management server includes: a semantic information database (DB) to store a descriptor including information about an ID of contents and correlations among the contents and other contents related to the contents; and an agent to search semantic information of the related contents with reference to the semantic information DB. Therefore, since contents have their own IDs, a user can easily search the contents.

Abstract: An audience selection system for the selection of an entity, based on an entity's consumption history without requiring the storage of a content descriptor for identifying content previously accessed by the entity. By directly and/or indirectly observing the usage of words used to locate content through a search engine over time for a population, a list of depersonalized keywords can be discovered, creating the ability to characterize content based on depersonalized keywords. A protected consumption history can be recorded for an entity using depersonalized keywords instead of recording a content descriptor for identifying the content. Depersonalized keywords do not uniquely identify content. Associating depersonalized keywords with an entity does not mean that the entity has used those depersonalized keywords; it only means that the entity has accessed content which has been accessed in the past by other entities in a population using the depersonalized keywords.

Abstract: A method and apparatus for searching the Internet is provided. In one embodiment, a computer implemented method of searching the Internet automatically creates a search query derived from a topic model used by a real time information retrieval service, where the real time information retrieval service produces real time information related to the topic model. The method uses a search engine for searching the Internet for non-real time information related to the search query.

Abstract: A device receives, in a technical computing environment (TCE), a heterogeneous array that includes columns and rows, and receives a command that references multiple columns and one or more rows of the heterogeneous array. The device determines, based on the command, that the referenced multiple columns of the heterogeneous array include a same data type. The device creates, based on the command and based on determining that the referenced multiple columns of the heterogeneous array include the same data type, a homogeneous array that includes the referenced multiple columns and the referenced one or more rows of the heterogeneous array. The device outputs the homogeneous array for further processing.

Abstract: A first process executing in a computer system in a data grid receives a request to perform at least one transaction operation of a transaction based on remote transaction data of at least one other process in the data grid. The at least one other process is capable to perform a prepare operation for a transaction. The first process identifies a local copy of the remote transaction data in a local data structure and performs the at least one transaction operation using the local copy of the remote transaction data without acquiring a lock on the remote transaction data.

Abstract: Presented herein are methods of replicating versioned and hierarchical data structures, as well as data structures representing complex transactions. Due to interdependencies between data entities and a lack of guaranteed message ordering, simple replication methods employed for simple data types cannot be used. Operations on data structures exhibit dependencies between the messages making up the operations. This strategy can be extended to various types of complex transactions by considering certain messages to depend on other messages or on the existence of other entries at the data store. Regardless of origin, these dependencies can be enforced by suspending the processing of messages with unsatisfied dependencies until all of its dependencies have been met. Alternately, transactions can be committed immediately, creating entities that include versioned identifiers for each of their dependencies. These entities can then be garbage collected of the parent objects are not subsequently created.

Abstract: A method includes defining a plurality of crop field boundaries such that an area of land falls within each of the plurality of field boundaries. The method further includes maintaining the plurality of crop field boundaries within the crop recordkeeping system, using a first of the crop field boundaries in performing a first function of the crop recordkeeping system executing on a computer, and using a second of the crop field boundaries in performing a second function of the crop recordkeeping system executing on the computer.

Abstract: A system for providing a tenant-aware database includes a relational database management system comprising a query engine, a transaction manager, a buffer manager, a recovery manager and a storage manager. The storage manager includes a tenant table, a tenant/user table, a tenant/object table, a multi-tenant table structure and multi-tenant index structure. The tenant table, the tenant/user table, the tenant/object table, the multi-tenant table structure and the multi-tenant index structure cooperate to provide a mechanism that has a single schema definition with multiple data instances for tables and their associated indexes, one for each tenant. The present invention also includes a variety of methods including: a method for reading or writing using the storage manager, a method for reading or writing using the multi-tenant table structure and the multi-tenant index structure, a method for determining the tenant of a user and a method for making multi-tenant schema changes.

Abstract: A facility for identifying a location in a printed document is described. The facility obtains an image of the printed document, and extracts gestalt information from text occurring in the image of the printed document. The facility compares the extracted gestalt information to an index of documents and, based upon this comparison, identifies a document that includes the gestalt information.

Abstract: The present disclosure provides methods and systems for improving a data transfer rate from an intelligent electronic device (IED) to external PC clients, via a network interface. In one embodiment, an FTP based approach is disclosed which allows for significant optimization of download speeds providing as much a 100 times the download speed capability. In accordance with one aspect of present disclosure, an improved data rate is achieved by utilizing a high-speed transfer protocol, such as the FTP protocol in conjunction with a novel file system incorporated into the IED.

Abstract: A data lineage system is provided that traces a data lineage of a data warehouse. The data lineage system maps a target data element to one or more source data elements. The data lineage system further stores one or more source surrogate keys within one or more auxiliary columns of a target data record. The data lineage system further stores, for each source data element, a data lineage mapping system record within a data lineage mapping system table that represents the mapping of the target data element and the corresponding source data element. The data lineage system further maps a source data element to one or more target data elements. The system further stores, for each target data element, a shadow system record within a shadow system table that represents the mapping of the source data element and the corresponding target data element.

Abstract: A computer-implemented method of and a device, such as a base station for a headset, for arranging text items in a predefined order, comprising storing, in the memory of a peripheral device, a collection of multiple text items arranged in multiple sets of text items and in multiple groups of text items; storing a respective code item with a respective group of text items; and storing a sort key that has values that designate a predefined order of the text items in each set. The sort key is appended to the text items and comprises at least one character with a value within the Private Use range of the Unicode format.

Abstract: Systems and methods are provided for file searching on mobile devices. A system includes a user interface and a file query system. The user interface is for receiving a user-provided spatio-temporal query for use in searching for a particular file. The user-provided spatio-temporal query is provided by a user of a mobile device. The file query system is for determining information about the particular file responsive to the user-provided spatio-temporal query, and identifying from the information one or more files as a search result for the particular file.

Abstract: The technique introduced here includes a system and method for identifying and mapping duplicate data objects referenced by data objects. The technique illustratively utilizes a hierarchical tree of fingerprints for each data object to compare the data objects and identify duplicate data blocks referenced by the data objects. A progressive comparison of the hierarchical trees starts from a top layer of the hierarchical trees and proceeds toward a base layer. Between the compared data objects (i.e., the compared hierarchical trees), the technique maps matching fingerprints only at the top-most layer of the hierarchical trees at which the fingerprints match. Lower layer matching fingerprints are neither compared nor mapped. Data blocks corresponding to the matching fingerprints are then deleted. Such an identification and mapping technique substantially reduces the amount of mapping metadata stored in data objects that have been subject to deduplication.

Abstract: Systems and methods are provided for file searching on mobile devices. A system includes a user interface and a file query system. The user interface is for receiving a user-provided spatio-temporal query for use in searching for a particular file. The user-provided spatio-temporal query is provided by a user of a mobile device. The file query system is for determining information about the particular file responsive to the user-provided spatio-temporal query, and identifying from the information one or more files as a search result for the particular file.

Abstract: A replication system includes N (>=3) storage devices and N nodes, connected to a host via a 1st network and connected to the N number of storage devices via a 2nd network, each to receive a request for accessing a storage device associated with itself and to have an access with a content in response to the received access request to the storage device, wherein when a node receives a write request of data from the host, each of M nodes (1<M<N) including the node stores the data in the storage device associated with itself, and if first data in a first storage device cannot be read out, the first data stored in another storage device is stored into a second storage device not stored with the first data by transmitting the first data via the second network.

Abstract: A method for archiving a file that has multiple file parts stored on multiple object storage devices of a computer system includes the steps of saving the file parts on one or more archive devices, allowing one or more changes to be made to the file during the saving step, and applying at least one of the changes made during the saving step to one of the file parts stored on a respective object storage device. Furthermore, the method is performed such that the file parts saved on the one or more archive devices do not include the one or more changes made to the file during the saving step.

Abstract: A system extracts data from at least one database. The data is extracted into a data set. The system performs a transformation function on the data extracted into the data set. The transformation function is performed for the purpose of determining a preferred version of data from at least one database. The database is capable of being updated with the preferred version of data such that the database is capable of being synchronized with the centralized data store. The system loads the preferred version of data into the centralized data store.

Abstract: A method, system and computer program product for finding a diversified ranking list for a given query. In one embodiment, a multitude of date items responsive to the query are identified, a marginal score is established for each data item; and a set, or ranking list, of the data items is formed based on these scores. This ranking list is formed by forming an initial set, and one or more data items are added to the ranking list based on the marginal scores of the data items. In one embodiment, each of the data items has a measured relevance and a measured diversity value, and the marginal scores for the data items are based on the measured relevance and the measured diversity values of the data items.