Abstract: A processor-implemented method, system, and/or computer program product generates and utilizes synthetic context-based objects. A non-contextual data object is associated with a context object, which comports with a predetermined set of constraints, to define a synthetic context-based object, where the non-contextual data object ambiguously relates to multiple subject-matters, and where the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object. The synthetic context-based object is then associated with at least one specific data store, which includes data that is associated with data contained in the non-contextual data object and the context object. A request for a data store that is associated with the synthetic context-based object results in the return of at least one data store that is associated with the synthetic context-based object.

Abstract: A method relates to receiving, by a processing device, a document comprising a first topic to be imported into a content management system, calculating a first signature of the first topic in view of content associated with the first topic, determining whether the first topic of the document is substantially similar to at least one of a plurality of topics stored in the content management system by comparing the first signature with a respective signature of the plurality of topics stored in the content management system, and in response to a determination that the first topic of the document is not substantially similar to any of the plurality of topics stored in the content management system, adding the first topic and the content associated with the first topic to the content management system.

Abstract: A method is directed to associating quality metadata with underlying data. The method includes, for one or more data items, a computing system identifying one or more threshold conditions related to the data items. The computing system determines that the one or more threshold conditions related to the data items have been met. As a result of determining that the one or more threshold conditions related to the data items have been met, the computing system associates quality metadata with the data items.

Abstract: The present invention relates to a method of executing an export process for an automated meta model driven export of entity parts from a source data base (10), wherein the meta model specifies an abstract model of the source data base (10) and comprises a description of an entity part and/or a reference relationship between entity parts being resolvable from a referencing entity part to a referenced entity part. The method comprising the steps identifying (S14) a set of entity parts being identifiable outside the source data base (10) by a public key, an internal key, or a mixture of a public key and an internal key as first level entity parts, supplementing (S16) the set of first level entity parts by a set of second level entity parts being referenced by the first level parts according to at least one reference relationship described in the meta model, and writing (S18) export data for the set of first level parts and the set of second level parts into an export file.

Abstract: A system is provided for presenting users with relevant personalized and/or customized information whenever a visitor visits a website or performs an Internet search. The described system described herein advantageously provides for the saving (clipping) of website information as an integrated part of a visitor's browsing experience. The user may be presented with either a suggested list of notebooks and/or a suggested list of tags for the website informationa. The content of the website information that is clipped may be advantageously controlled by a website owner/publisher. Using website clips, identified as “notes,” previously stored by a visitor, currently displayed website content may be accordingly modified in connection with identified relevant notes and/or a notification may be displayed on the current website for a particular visitor identifying stored relevant notes of the visitor.

Abstract: Methods and apparatus for determining aspects of locations based on computing interactions of users that pertain to the locations. In some implementations, an aspect of a location may be determined based on comparing a first computing interaction measure for the location to a second measure. The first computing interaction measure may be determined based on a first group of computing interactions that pertain to the location. In some implementations, the second measure may be determined based on a second group of addition computing interactions. In some implementations, a textual summary may be generated automatically based on the first and/or second computing interaction measure, and/or based on the determined aspect.

Abstract: A method for presenting search query results is provided. The method may include detecting an occurrence of the trigger event. The method may include determining a category of information based on data associated with the trigger event. The method may include identifying at least one constraint based on the determined category of information. The method may include appending to the identified at least one constraint to the determined category of information. The method may include generating at least one search query. The method may include selecting at least one candidate website based on the category of information. The method may include performing the at least one search query on the at least one candidate website. The method may include filtering each search query result within the search query results. The method may include sending each filtered search query result within the search query results to a user.

Abstract: A universal personal data portability capability is disclosed. The universal personal data portability supports automated porting of personal data of a user from a plurality of environments to a personal data store of the user.

Abstract: Resolving a discrepancy between disparate data sources is disclosed. Listing data for an item for sale is received from a plurality of disparate data sources. The listing data is compared with reliable listing data from a reliable data source. It is determined whether there is a discrepancy between the listing data and the reliable listing data. In the event there is a discrepancy between the listing data and the reliable listing data, at least a portion of the listing data is filtered.

Abstract: The present disclosure relates to an information processing apparatus, an information processing method, a program, and a content sharing system that allow for efficient use of an ACR service when content is shared.

Abstract: Embodiments of the present invention provide an approach for locating previously communicated electronic messages (e.g., emails, etc.). The request is initiated by a first party on behalf of a second party. Specifically, the system will receive a request to locate/retrieve a previously communicated electronic message (“message”). The request can be issued by a sender or a recipient of the message. In any event, the request will include a set (one or more) of characteristics pertaining to the message such as a set of recipients thereof. One or more electronic messaging databases will then be searched based on the message located. Once located, an alert will be sent to the second party alerting the second party that the first party would like to recall the electronic message on their behalf. If the alert is validated (e.g., the message recall was accepted), the message will be displayed to the second party.

Abstract: Methods and apparatuses are described for analyzing unstructured computer text for theme generation to determine sentiment. A computer store stores unstructured text that is delimited, a searched phrases log, and a phrase click log. A computer server extracts phrases from the unstructured delimited text by splitting each line of the unstructured delimited text into one or more phrases. The computer server generates tokens from the unstructured delimited text, where the tokens comprise segments of the unstructured delimited text. The computer server determines one or more themes present in the unstructured delimited text.

Abstract: The automated binding of a data source to a compound control. The properties of the compound control are identified. Furthermore, a particular data source is associated with the compound control. For each of one or more of the properties of the compound control, information regarding the compound control and the data source are used to identify a set of one or more fields of the particular data source that may be bound to the corresponding property of the compound control. If the corresponding property of the compound control has bound thereto an output parameter of a declarative transformation, the nature of the transformation may also be taken into consideration when identifying the set of one or more fields that may be used in order to bind to the corresponding property of the compound control.

Abstract: Efficiency with respect to traditional techniques is a key issue facing designers of software transactional synchronization mechanisms. Meta-transactional synchronization allows integration of transactional support into an object-oriented programming language, such as the Java language through the existing synchronization structure of the JVM. Meta-transactional synchronization provides source-level transactional operations that co-exist with synchronized operations. An implementation of a shared object in an object-oriented programming language tracks concurrently executing transactions attempting to access the shared object with at least one header word of the shared object.

Abstract: A search system executes: a first write procedure of extracting, for data in a data sequence, metadata from the data in input order and writing the metadata into a first storage module in association with identification information uniquely identifying the data; a second write procedure of writing, in parallel with the first write procedure, the data in the data sequence into a second storage module in input order in association with the identification information, and writing the identification information in the second storage module into a third storage module; a reception procedure of receiving a search request including a first search condition relating to search target data; a search procedure of searching a search destination, which is selected from the first and third storage modules in accordance with the search request received, for the identification information satisfying the first search condition; and an output procedure of outputting a search result.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributed nearest-neighbor search for image retrieval are disclosed. An example distributed image retrieval system includes a root server and a plurality of leaf servers. The root server controls the clustering of images in the image corpus, and determines the assignment of image clusters to a collection of leaf servers. Each leaf server is independently configured to perform a two-stage nearest-neighbor search in a locality-sensitive hash space for a received query image within the leaf server's assigned images clusters. Thus, the distributed image retrieval system is modular and amendable to tuning, modifications, duplication, and replacement on a per-server basis. In addition, the design of the image retrieval system allows flexible load balancing among the leaf servers.

Abstract: A computer-implemented system and method for integrating user observations into operational data is provided. A database maintains notes each having received from a user and comprising a subjective observation. Operational data including workflow data of an objective nature is defined. Each of the notes is associated with one or more tags. The note associated with the tags is further maintained in the database. Criteria for retrieving the note are defined for the workflow data and forming a query for each of the workflow data. The query to select the note associated with the tags is executed for the workflow data based on the criteria and the selected note is integrated into the workflow data. The workflow data with the integrated note is displayed on a display.

Abstract: A query relationship data structure (RELSTRUCT) generator configured to select a plurality of queries, each query structured for application against a database to yield a query result. The RELSTRUCT generator includes a query analyzer configured to identify query parts of individual queries, and determine for each query, a relation, if any, of an included query part to any query part of remaining queries of the plurality of queries. The RELSTRUCT generator also may create, for each query, a query relationship data structure in which the query is related to at least one other query of the plurality of queries, based on the determined relation of a query part of the query and a query part of the at least one other query of the plurality of queries.

Abstract: In one embodiment, a system is configured to use an owner GW node to write data for a first fileset and determine whether to utilize one or more other GW nodes to handle at least a portion of write traffic for the first fileset, select a set of eligible GW nodes, assign and define a size for one or more write task items for each GW node based on a current dynamic profile of each GW node, provide and/or ensure availability to in-memory and/or I/O resources at each GW node in the set of eligible GW nodes to handle one or more assigned write task items, and distribute workload to the set of eligible GW nodes according to the size for each of the one or more assigned write task items for each individual GW node in the set of eligible GW nodes.

Abstract: Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.