Abstract: A Codex system of computers linked into a neural network continuously scans and gathers information from, understands, and interacts with, an environment, an optimizer software executing software instructions based on rules of grammar and semantics searches a encyclopedia of human knowledge to transform input into a search pattern. Then the Codex monetizes and commercializes each transformed input and corresponding optimal output. An artificial intelligence interaction software, hereinafter referred to as virtual maestro, uses the search pattern and optimal output in order to interact and engage scripted communication with the end user.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for obtaining data stored at a storage device using a first processor of an entity correlation system. The data includes information about multiple entities. The first processor generates data arrays using the obtained data. Each data array includes parameter values for multiple entities and is configured for processing at a respective computing cell of a second processor. The system provides the data arrays to the second processor. The second processor is configured to execute a correlation algorithm to concurrently process the data arrays at the respective computing cells. The second processor computes a correlation score based on calculations performed at the cells using the algorithm and the parameter values. The system determines relationships among entities of the data arrays based on the correlation score.

Abstract: Structured data comprising primary data is transformed into object-based data comprising the primary data and at least one search function. The object-based data when loaded into memory provides the search function as executable instructions for an object instance. When an application calls the object instance with search terms as input, the search terms are located within the primary data (which is loaded into memory) by the search function, and the object instance returns corresponding field values from the primary data associated with the search terms to the application.

Abstract: Certain embodiments described herein relate to data analysis systems, methods, and devices that comprise one or more processes and/or methodologies to add structure around a tabular database. By doing so, certain data analysis systems, methods, and devices can provide similar analytical functionalities as structured databases on one hand, as well as similar scalability and/or performance capabilities as tabular databases. In some embodiments, an add-in to a tabular data engine, such as Microsoft Excel, can be provided, through which a user can be allowed to input one or more dimensions and/or variables as desired for generating an analytical report. Based on such input, in certain embodiments, the system can be configured to build one or more data analysis expression (DAX) queries to dynamically generate a report, which can subsequently be displayed in the tabular data engine.

Abstract: To be able to deal with more request information without increasing the load on a peer-to-peer database system. An information processing apparatus is provided including an acquisition unit that acquires data provided from a P2P database on the basis of request information, and a storage control unit that controls storage of the data performed by a cache storage unit.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for clustering data elements. In one aspect, a method includes determining a respective linkage value for each of multiple cluster pairs, where each cluster pair includes a respective first cluster and a respective second cluster. Determining a linkage value for a cluster pair includes determining a set of pairwise similarity values for the cluster pair. Each pairwise similarity value defines a similarity measure between: (i) a particular data element from the first cluster of the cluster pair, and (ii) a given data element from the second cluster of the cluster pair. The linkage value for the cluster pair is assigned as a given percentile of the set of pairwise similarity values, wherein the given percentile is greater than 0 and less than 100. A cluster pair is merged based on the linkage values of the cluster pairs.

Abstract: Disclosed is a plurality of computer servers operating a rewards-based, universal, integrated code base in which each respective platform operating on the rewards-based, universal, integrated code base agrees to an information exchange, payment and rewards framework. The rewards-based, universal, integrated code base is a single code base including an aggregation of each respective platform and which enables at least one or more of rewards, payments and data sharing between each respective platform in the rewards-based, universal, integrated code base such that users do not open or close different applications. A data management module manages the receipt and use or sharing of data in which the data is accessible across the respective platforms on the rewards-based, universal, integrated code base.

Abstract: Implementations provide a database lock mechanism used to prevent concurrent writes to service on network partition scenarios associated with a version control system. The database lock mechanism may be provided on per repository basis to ensure both nodes are working and maintaining data consistency, even when they are not connected when interruptions in network communication disrupts the intercommunication between nodes. In other implementations, the disclosed locking mechanism is configured to ensure and perform write and synchronization operations on isolated nodes, regardless of miss-communication between the nodes.

Abstract: Techniques are described for managing the optimized refreshing of metadata associated with online and live systems. In some implementations, a set of metadata modules associated with one or more entities are identified, the metadata modules defining metadata associated with a particular data model for the associated entities. A request to initiate a refreshing of the metadata for a subset of the set of metadata modules is identified. Each metadata module from the subset of the set of metadata modules is prioritized into a prioritization order. A determination is made as to whether two or more idle database connections are available. In response to determining that two or more idle database connections are available, a concurrent refresh of the subset of the set of metadata modules is initialized in the prioritization order.

Abstract: A real-time analytical database system allows queries on data obtained from a transactional system that is frequently updated by the transactional system. The real-time analytical database system receives change logs from the transactional system. The change logs describe operations performed by the transactional system. The real-time analytical database system stores a plurality of indexes in a key-value store, each index comprising key-value pairs. A key of a key-value pair is obtained by combining field data describing a field of a document. The real-time analytical database system determines modifications to the key-value pairs of the key-value store corresponding to the operations of the transactional system as represented by the received change logs. The real-time analytical database system receives and processes queries using the plurality of indexes.

Abstract: A media agent is configured to perform substantially autonomously to initiate, continue, and manage information management operations such as a backup job of a certain client's primary data, manage the operations, and generate and store resultant system-level metadata from the operations, etc. The media agent is configured to do this even when out of communication with the storage manager that manages the information management system. When communications are restored, the media agent reports the relevant metadata to the storage manager. The storage manager comprises corresponding enhancements, including specialized logic for identifying the media agent as an intelligent media agent capable of some autonomous functionality, for transmitting management parameters thereto, and for seamlessly integrating the received metadata into the storage manager's associated management infrastructure such as a management database.

Abstract: Embodiments of the present disclosure provide a quantization method of feature vector, search method, apparatus and storage medium, wherein the quantization method comprises: setting quantization codewords; selecting, from the set quantization codewords, at least one quantization codeword of which distance from an original feature vector is smaller than first predetermined distance as a quantization codeword subset; determining quantization feature vectors corresponding to the original feature vector by using at least two quantization codewords, wherein at least one quantization codeword from the at least two quantization codewords are in the quantization codeword subset. The search method is a method of performing a search among quantization feature vectors after a quantization using the quantization method.

Abstract: Disclosed herein are distributed ledger systems and methods for efficiently creating and updating a query optimized distributed ledger. In particular, the present disclosure introduces methods and apparatuses for efficiently updating indexes when new blocks are added to the distributed ledger by using snapshots of data and appending new snapshot tables and indexes to previous snapshot tables and indexes.

Abstract: The technology described herein provides for a match fix-up stage that removes matching documents identified for a search query that don't actually contain terms from the search query. A representation of each document (e.g., a forward index storing a list of terms for each document) is used to identify valid matching documents (i.e., documents containing terms from the search query) and invalid matching documents (i.e., documents that don't contain terms from the search query). Any invalid matching documents are removed from further processing and ranking for the search query.

Abstract: Systems and methods for extending reasoning capability for data analytics in Internet of Things (IoT) platform(s) are provided. Traditional systems and methods for executing IoT analytics tasks suffer as IoT analytics techniques are generated in different programming language platforms, and this leads to a manual intervention or an asynchronous and sequential analysis of IoT analytics task(s). Embodiments of the method disclosed provide for overcoming the limitations faced by the traditional systems and methods by dynamically creating procedural functions from a plurality of programming languages upon determining an absence of pre-defined procedural functions, and extracting, using the dynamically created procedural functions, one or more semantic rules in a real-time, wherein the one or more semantic rules extend a reasoning capability for executing the one or more data analytics tasks in a plurality of IoT platforms.

Abstract: A system for storing and retrieving configuration data causes time-based and content-based indexes to be stored on a storage service. The system receives a request to identify the value of a property during a time period indicated by the request. The system retrieves, from the storage service, a time-based index associated with the time period. The retrieved time-based index is searched to identify a content index associated with the time period. The system retrieves the content index from the storage service, and searches the content index to identify a value, of the property, that is associated with the time period. The system generates a response to the request based on the results of the search of the content index.

Abstract: A data storage system for use with a multi-threaded processing system receives concurrent requests to store data to a common data store, and efficiently and securely swaps an active data store for a new data store while avoiding conflicts arising from multiple threads attempting to swap a same data store and minimizing reliance on operations that re-attempt actions upon failure of an attempted action, thereby improving performance of the data storage system and also the multi-threaded processing system.

Abstract: A content-based image retrieval (CBIR) system and method is presented herein. The CBIR system generates a relatively short vector or array of data, referred to as a barcode, from an input image. The short vector or array data can be used to represent the content of the image for image retrieval purposes. The system obtains the image and applies a transform to the image to generate a plurality of image transform values. The system thresholds the plurality of image transform values to obtain compact image transform values. The system generates a barcode in accordance with the compact image transform values and representative of the image. The system may then transmit the barcode to a database for storage or draw the barcode on a display. The system may also compare barcodes to find and retrieve similar images associated with similar barcodes.

Abstract: Systems and methods are described for modifying input and output (I/O) to an object storage service by implementing one or more owner-specified functions to I/O requests. A function can implement a data manipulation, such as filtering out sensitive data before reading or writing the data. The functions can be applied prior to implementing a request method (e.g., GET or PUT) specified within the I/O request, such that the data to which the method is applied my not match the object specified within the request. For example, a user may request to obtain (e.g., GET) a data set. The data set may be passed to a function that filters sensitive data to the data set, and the GET request method may then be applied to the output of the function. In this manner, owners of objects on an object storage service are provided with greater control of objects stored or retrieved from the service.

Abstract: A computer system for executing k-mismatch searches, comprising at least one processor, configured to: receive a size of a search term; receive a similarity threshold: and generate a set of filters by: forming the set of filters based on a set of combinations of positions of matches, and gaps for the—size of the search term according to the similarity threshold, wherein each one—of the combinations contains at least one filter from the set of filters.