Abstract: Systems and methods for determining and rewarding accuracy in predicting user-provided ratings of content provided by other users are disclosed.

Abstract: An in-vehicle processing device includes: a signal input unit that generates input data based on an input signal from outside; a processing unit that executes arithmetic processing for calculating output data based on the input data; a signal output unit that generates an output signal based on the output data to output the output signal to the outside; and a storage unit that stores application software for causing the processing unit to execute the arithmetic processing. The application software includes: a data management layer for managing object data which is a collection of data corresponding to a given target element on the storage unit; a data adaptation layer for generating the object data based on the input data to output the generated object data to the data management layer; and a data operation layer for acquiring the object data from the data management layer to calculate the output data based on the acquired object data.

Abstract: Techniques for inserting and extracting geolocation data using spatial indexing in a key value database are provided. In an embodiment, a system is provided for generating one or more geohashes for a geometry object, wherein the one or more geohashes comprises encoded bits that are stored as keys in a key value database. In one example, the system comprises a geometry indexing component that generates a spatial index, wherein the spatial index is based on a total number of the encoded bits generated for the one or more geohashes. In one example, the system comprises a geometry storing component that stores the geometry object and the one or more geohashes in the key value database using the spatial index to allow for faster retrieval of the geometry object. The advantage is that properly inserted and indexed spatial data can be quickly retrieved.

Abstract: Embodiments relate to high throughput blockchain systems that can handle large numbers of real-time operations. A system may include a server that handles the matching of operations in a quick and trusted manner and a blockchain that executes the matched operations in a decentralized manner after the matching is confirmed by the server. The server may receive an operation request from a user. To confirm the operation request, the user may cause a broadcast of entry on the blockchain that confirms the validity of the operation request. Upon verifying the operation request, the server may match the operation request with other operation requests that meet the criteria specified by the user's request. A set of code instructions recorded on the blockchain may generate one or more entries that execute the operations related to the match.

Abstract: Methods, systems and computer program products for organizing and displaying in real-time data related to a plurality of documents. A plurality of documents and a plurality of entity identifiers are stored in a relational database storage. Each entity identifier has an entity type selected from a plurality of entity types. A plurality of entity associations between the plurality of entity identifiers and the plurality of documents are stored in a non-relational database storage. Each entity association defines a relationship between one or more entity identifiers and a selected document in the plurality of documents. A plurality of file icons are displayed in a display interface. The plurality of file icons includes active icons corresponding to a selection of the plurality of documents where the selection is determined by querying the non-relational database storage using at least one currently-selected entity identifier.

Abstract: A method and a system for performing context-based search. The method is executed by a processing module. The method includes developing a search database, developing a search query, and retrieving at least one context-based data-record from the search database.

Abstract: For multiple queries written for a first database, some embodiments provide a method of processing the queries on a second database. From a client, the method receives individually each of the multiple queries written for the first database. The method performs an automated process to analyze properties of the second database to determine that the multiple queries can be replaced by a single query to the second database. Based on the determination, the method combines the multiple queries to generate a single query for the second database. The method forwards the generated single query to the second database for execution.

Abstract: A data management device includes a persistent storage and a processor. The persistent storage includes an object storage. The processor segments a file into file segments. The processor generates meta-data of the file segments. The processor stores a portion of the file segments in a data object of the object storage. The processor stores a portion of the meta-data of the file segments in a meta-data object of the object storage.

Abstract: A system, computer implemented method, and computer storage medium encoded with a computer program, for identifying newly trending topics in a data stream. An example method includes: receiving text documents forming part of a data stream from one or more servers; identifying terms within the received text documents; deriving from the identified terms, a set of terms identified as abnormal by virtue of having a relatively high frequency of occurrence within the text documents received in a recent period compared with that expected from their historic occurrence; creating a first set of one or more clusters, each cluster including a group of terms from the set of terms identified as abnormal which through their degree of co-occurrence in the received text documents are considered to relate to the same topic; and comparing clusters of a further set with the clusters of the first set to determine whether a cluster of the further set pertains to the same topic.

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.

Abstract: A data caching method comprises: after receiving a data request sent by a client, determining a remaining valid cache duration of cache data corresponding to the data request; determining whether the remaining valid cache duration is greater than a preset update threshold value; and if the remaining valid cache duration is less than or equal to the update threshold value, updating the cache data through a database.

Abstract: A system for increasing computing efficiency is disclosed. The system includes a memory that stores at least one tabular constraint. The tabular constraint contains a finite array of symbols, with each symbol representing a value thereby creating a relational symbol (r-symbol), or a potentially infinite set of values, with such a symbol thereby creating a quasi-finite symbol (QF-symbol). The system includes a program configured to compress and to query the tabular constraint.

Abstract: In one embodiment, a system, is provided to take not just a person's time and location into consideration, but also has knowledge of and takes into account their availability, their preferences, their schedule, their purpose for being at their current location, and/or their next goal or stop. One embodiment is able to take into account a real-time view of supplier inventory and deduce and make available much better-adapted offerings and support for that person's travels and endeavors. In one embodiment, having an understanding of a rate of conversion and its relation to traffic and weather patterns allows service providers to make more accurate predictions about various items, including but not limited to, conversion rates, offer types, offer upgrades, traffic etc. In yet another aspect of the invention, the information collected from many travelers, and also information collected from airlines and weather observers, etc.

Abstract: A heuristic method for the data clustering problem includes a greedy algorithm, which selects the centroids of well-separated clusters, and a single-solution-based heuristic, which performs clustering with the objective of optimizing a cluster validity index. The attributes of the centroids of clusters are genes and a fitness is determined for each gene. A mutation operation changes the values of the genes of low fitness values and creates a mutant solution. The values of genes of the mutant can replace the values of the genes of the parent if they are better than the genes of the parent. Diversification in the search process is maintained by allowing, with a small probability, the genes of the mutant to replace the genes of the parent even if they are not better than them.

Abstract: A computer system and method for maintaining and using a domain ontology. The computer system includes a triple store comprising a domain ontology, a computer-readable tangible medium comprising software instructions, and a processor configured to access the computer-readable tangible medium to load and execute the software instructions. The software instructions provide a write service configured for receiving a request from a client interface of an authenticated user to edit the domain ontology of the triple store and an interface for updating the domain ontology based on the received request. The method includes steps of providing access to a domain ontology stored on a triple store, receiving a request from a client interface of a first client computer an authenticated user to edit the domain ontology of the triple store, and updating the domain ontology based on the received request by storing updates to the domain ontology in the triple store.

Abstract: Example methods and systems for indexing fingerprints are described. Fingerprints may be made up of sub-fingerprints, each of which corresponds to a frame of the media, which is a smaller unit of time than the fingerprint. In some example embodiments, multiple passes are performed. For example, a first pass may be performed that compares the sub-fingerprints of the query fingerprint with every thirty-second sub-fingerprint of the reference material to identify likely matches. In this example, a second pass is performed that compares the sub-fingerprints of the query fingerprint with every fourth sub-fingerprint of the likely matches to provide a greater degree of confidence. A third pass may be performed that uses every sub-fingerprint of the most likely matches, to help distinguish between similar references or to identify with greater precision the timing of the match. Each of these passes is amenable to parallelization.

Abstract: A system and method for a text search of a database, including converting a text search expression to a query plan and implementing the text search as the query plan on the database. The implementing of the text search includes a one-pass indexing as a single scan of an inverse index table associated with the database.

Abstract: Systems and methods for processing requests for shared records are described. A server computing system receives a data access request associated with a user. The server determines shared records granted by a first sharing rule associated with the user in response to receiving a data access request. The server processes the data access request based on the shared records granted by the first sharing rule and shared records granted by a second sharing rule associated with the user. The shared records granted by the second sharing rule having been determined prior to receiving the data access request, the first sharing rule and the second sharing rule generated prior to receiving the data access request.

Abstract: In one embodiment, a method receives a search query including terms formed in a natural language expression. The terms are included in entities that are categorized in types of entities. The method analyzes the entities for the terms to generate a set of branch queries that include different combinations of entities for the terms. The set of branch queries are ranked based on the types of entities associated with entities of the respective branch queries and a branch query is selected based on the ranking for the branch query. The method uses the entities of the branch query to perform a search of a structured database of structured objects.

Abstract: An apparatus for constructing Aho-Corasick automata according to the present invention includes a concatenative normal form transforming unit configured to receive a regular expression that is expressed using an operator including a concatenation and an alternation and transform the regular expression into concatenative normal forms (wherein each concatenative normal form is defined as a form in which character alternations are connected by concatenation); a trie generating unit configured to generate a trie from the concatenative normal forms by updating states and transitions of the trie (wherein each transition corresponds to a set of characters) while processing each concatenative normal form in order; and a failure link creating unit configured to create a failure link for each state of the trie by using a set of characters corresponding to each transition of the trie.