Abstract: A method, system, and computer program product for of processing database queries using the resource description framework (RDF) language through a gateway service. The method commences by receiving a database query (e.g., an SQL query) from an application, the query being in a first query language format, then converting the query into a SPARQL query format and submitting the converted query to a SPARQL endpoint. The SPARQL endpoint processes the SPARQL query (e.g., by accessing an RDF repository), and sends back the query results. A gateway service (e.g., a SPARQL gateway) then receives the SPARQL query results from the SPARQL endpoint and transforms the SPARQL query results into a format corresponding to the first query language format so the initiating application can process it natively. Several performance features are disclosed, including a method for achieving a quality of service level by concurrently submitting multiple SPARQL queries with different LIMIT clauses.

Abstract: Systems, methods, and other embodiments associated with equivalence reasoning are described. One example method includes constructing a clique map that maps groups of equivalent resources to a representative canonical resource. The clique map is constructed by iteratively inputting batches of equivalence pairs from a semantic model to operating memory and building, in operating memory, one or more cliques for the input batch. Cliques for various input batches of equivalence pairs are merged in memory to produce the clique map for use by the semantic model. Triples associated with the semantic model may be consolidated by replacing resources that are in a clique with their corresponding representative canonical resource.

Abstract: Systems, methods, and other embodiments associated with data sources adapted for parallel inference on triples associated with a semantic model are described. One example method includes creating a source table that stores triples for entailment in a manner that is adapted for parallel inference. The source table may be partitioned by triple predicate or may store compact triple identifiers that have been mapped to triple identifiers from the semantic model.

Abstract: An un-indexed, partitioned temporary table and an exchange table are used in the inferencing of semantic data in a relational database system. The exchange table has the same structure as a semantic data table storing the semantic data. In the inferencing process, a new partition is created in the semantic data table. Inference rules are executed on the semantic data table, and any newly inferred semantic data generated is added to the temporary table. Once no new data is generated, the inferred semantic data is copied from the temporary table into the exchange table. Indexes that are the same as indexes for the semantic data table are built for the exchange table. The indexed data in the exchange table is then exchanged into the new partition in the semantic data table. By use of the un-indexed, partitioned temporary table, incremental maintenance of indexes is avoided, thus allowing for greater efficiency.

Abstract: Disclose is an improved approach for caching lexical values for RDF data. A compact, efficient resource ID to value mapping is stored in memory, where the cache is stored in memory such that the overhead of accessing and updating it is minimized. The advantage of this approach is improved query performance, since the database is performing less work with the in-memory RDF resource caching. In addition, throughput and performance of the database are also improved.

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 apparatus, system and method for adaptively controlling a frame interval between ultrasound scanning frames of an ultrasound elasticity imaging scan. The system includes a transmitter for transmitting ultrasound beams to a subject during an ultrasound elasticity imaging scan, and a receiver for receiving ultrasound beam echoes from the subject responsive to transmitted ultrasound beams. The system also includes a processor for processing a plurality of the ultrasound beam echoes to determine a strain variation of the tissue undergoing strain, calculating a value for an ultrasound scanning frame interval adapted for imaging the tissue undergoing the determined strain variation, and setting the value of the ultrasound scanning frame interval for acquiring ultrasound elasticity images of the tissue undergoing the determined strain variation.

Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

Abstract: A method is provided for allowing programmers to specify program execution control semantics using standard programming language syntax even when the standard language does not provide a language construct for specifying execution control. In a similar manner, the approach provides programmers the ability to extend the expressiveness of a language by introducing statements expressed in the syntax of a target programming language. A program written in a first programming language may be translated into statements of a second programming language, where the target programming language is more expressive than the first. This language-based approach preserves the standard syntax of the first programming language, allowing a program written with semantic extensions to be compiled and run according to the standard on any standards-compliant system.

Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

Abstract: An apparatus, system and method for adaptively controlling a frame interval between ultrasound scanning frames of an ultrasound elasticity imaging scan. The system includes a transmitter for transmitting ultrasound beams to a subject during an ultrasound elasticity imaging scan, and a receiver for receiving ultrasound beam echoes from the subject responsive to transmitted ultrasound beams. The system also includes a processor for processing a plurality of the ultrasound beam echoes to determine a strain variation of the tissue undergoing strain, calculating a value for an ultrasound scanning frame interval adapted for imaging the tissue undergoing the determined strain variation, and setting the value of the ultrasound scanning frame interval for acquiring ultrasound elasticity images of the tissue undergoing the determined strain variation.

Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

Abstract: Systems, methods, and other embodiments associated with data sources adapted for parallel inference on triples associated with a semantic model are described. One example method includes creating a source table that stores triples for entailment in a manner that is adapted for parallel inference. The source table may be partitioned by triple predicate or may store compact triple identifiers that have been mapped to triple identifiers from the semantic model.

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: Systems, methods, and other embodiments associated with equivalence reasoning are described. One example method includes constructing a clique map that maps groups of equivalent resources to a representative canonical resource. The clique map is constructed by iteratively inputting batches of equivalence pairs from a semantic model to operating memory and building, in operating memory, one or more cliques for the input batch. Cliques for various input batches of equivalence pairs are merged in memory to produce the clique map for use by the semantic model. Triples associated with the semantic model may be consolidated by replacing resources that are in a clique with their corresponding representative canonical resource.

Abstract: A repository server that provides stored copies of Web-accessible documents A client of the repository server may register a document in the repository server. The repository server makes a copy of the registered document and returns a repository URL for the copy to the client. The repository URL may be used to fetch the copy from the repository URL. Registration further relates the stored copy to its document URL, to an identifier for the stored copy, to a fingerprint that is a condensed representation of the stored copy's content and can be used to determine degrees of similarity other than match-no match, and to a set of stored copies having similar content. The fingerprints are used to compute similarity. The similarity computation further employs comparisons of links in the documents and of document URLS to determine whether it is necessary to use the fingerprints to compute similarity.

Abstract: The present invention provides a technical solution for a unified driver used in a handheld device. An embodiment of the technical solution may comprise a unified driving method used in a handheld device, which method may comprise: determining driver types of currently installed hardware; setting a current dispatch table on the basis of the driver type and a unified dispatch table suitable for multiple hardware and driving corresponding hardware or software by calling the current dispatch table.

Abstract: A repository server that makes stored copies of Web-accessible documents available at times when the documents themselves are inaccessible via the Web, because the server the document is located on is unavailable, because the server has removed or renamed the document, or because the server has replaced the version of which the stored copy is a copy with a different version. A client of the repository server may register a document in the repository server. The repository server makes a copy of the registered document and returns a repository URL for the copy to the client. The repository URL may be used to fetch the copy from the repository URL. Registration further relates the stored copy to its document URL, to an identifier for the stored copy, to a fingerprint that is a condensed representation of the stored copy's content and to a set of stored copies having similar content.

Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.