Abstract: The present invention provides an information processing system for more appropriately classifying elements that constitute an information processing device or the like. This information processing system is provided with: a means that, on the basis of information indicating the relationship between a plurality of elements that constitute a system, acquires, for first elements to be classified, a set of second elements capable of arriving at the first elements via a relationship of arbitrary numbers; and a means that, on the basis of the set corresponding to the first elements, classifies each of the first elements in any of a plurality of roles.

Abstract: This disclosure relates to blockchain-based transaction processing. In one aspect, a method includes obtaining pieces of transaction data. At least a portion of the pieces of transaction data have a respective group identifier that identifies a node group for the piece of transaction data. Each node group includes multiple blockchain nodes. Pieces of transaction data that have a same first group identifier that identifies a first node group are identified in the obtained pieces of transaction data. The pieces of transaction data are packaged into a first packaging result based on the pieces of transaction data having the same first group identifier. The first packaging result is submitted to a blockchain for storage.

Abstract: In an example, method of data protection in a document database system includes grouping documents input to the document database system into super documents, each of the super documents including a plurality of chunks, each of the plurality of chunks including one of the documents. The method further includes operating an object storage system according to a storage policy that implements parity processing, where the parity processing includes computing parity chunks for the super documents and storing the parity chunks in an object store, where a plurality of the parity chunks are computed for each of the super documents. The method further includes sending each of the super documents to the object storage system for parity processing according to the storage policy.

Abstract: Disclosed herein are methods and systems for identifying targets for distinguishing cell types. In some embodiments, the method comprises: hierarchically clustering expression profiles of cells to generate a dendrogram with each leaf representing the expression profile of a different individual cell. The dendrogram can be pruned by eliminating invalid splits (and their children). The remaining leaves in the dendrogram can be merged, independent of their locations in the dendrogram, based on their distances to one another to generate clusters of expression profiles. The method can identify targets for distinguishing cell types based on targets that are expressed differentially in the clusters.

Abstract: According to one aspect, a distributed database system is configured to manage multi-writer operations on a distributed database by implementing one or more catamorphic database operators. Catamorphic operators can be architected on the system, and executed with little or no reconciliation logic. Catamorphic operators define sets of catamorphic operations and respective execution logic where the order of execution of catamorphic operations is not relevant to a final result.

Abstract: One or more data assets associated with a data repository of a given enterprise is identified. Each of the one or more data assets is tagged with economic driver metadata that links each of the one or more data assets to at least one economic driver category from a plurality of economic driver categories associated with the given enterprise. At least one economic value is calculated for each of the one or more data assets based on the at least one economic driver category linked to each of the one or more data assets. Calculated economic values for the one or more data assets are stored in a valuation data structure.

Abstract: An aggregator system obtains a first set of measurements from a logical partition of a computing resource monitoring service. The aggregator system aggregates this first set of measurements with a second set of measurements obtained from a storage resource. Using these measurements, the aggregator system generates a data segment that corresponds to a time interval of both the first set of measurements and the second set of measurements. The aggregator system stores this data segment in the storage resource and updates an index to indicate the location in the storage resource where the data segment is stored.

Abstract: In one embodiment, a method includes receiving a number of notifications of activity relevant to a user. Each notification has an associated type. The method also includes calculating an interest of each activity to the user based at least in part on the type of each notification; ranking the notifications based at least in part on the calculated interest; and sending one or more of the notifications to the user. Each of the sent notifications has a ranking higher than a pre-determined threshold ranking.

Abstract: Methods and apparatus are provided for integrating a plurality of different database types in a semantic multi-database data lake. An exemplary method comprises providing a plurality of databases having different database types; translating ontology definition language database commands obtained from a user into a plurality of data definition language and/or data manipulation language commands supported by the different database types in order to replicate data from the user to each of the different database types; obtaining a query specified in a query language of a given database; and delegating the query to the given database. A plurality of cluster gateways optionally manage a corresponding plurality of clusters of database instances and wherein queries are delegated to a given database instance by delegating the queries to the appropriate cluster gateway. Dark data that was not queried by any supported query language in a predefined period of time can be detected.

Abstract: A cluster includes cluster shared volumes and nodes. A subset of the nodes are designated as being backup proxy nodes responsible for backing up the cluster shared volumes. The cluster shared volumes are divided into groups, each group having a number of cluster shared volumes that is less than a total number of cluster shared volumes in the cluster. Generation is initiated for a particular snapshot for a number of cluster shared volumes belonging to a particular group. The backup proxy nodes backup data from the particular cluster shared volumes belong to the particular group using the particular snapshot. After the backup, the steps initiating snapshot generation and backing up are repeated until each group of cluster shared volumes has been backed up.

Abstract: In one aspect, a method includes determining a number of data streams to assign to a volume, assigning a fragment file for each data stream, sending fragment files to a backup storage device, synthesizing the fragment files to form an image file for the volume at the backup device, sending new fragment files with changes to the volume to the backup device and synthesizing the new fragment files with the corresponding image file to form a new image file for the volume.

Abstract: An approach for performing mobile visual search uses deep variant coding of images to reduce the amount of data transmitted from mobile devices to a search server and to provide more efficient indexing and searching on the search server. The amount of data used to represent an image varies depending upon the content of the image and is less than conventional fixed bit length hashing approaches. Denser regions of a feature space are represented by more encoding bits and sparser regions of the feature space are represented by fewer encoding bits, so that the overall number of encoding bits for an image feature is reduced. The approach generally involves determining a set of hash functions that provide deep hashing with more evenly-distributed hash buckets. One or more additional hash functions may be selectively generated for particular hash buckets that contain more than a specified number of images.

Abstract: Techniques and solutions are provided for analyzing constraints. A disclosed embodiment provides for determining whether a table contains a valid tuple, and if so, the minimum index of the first valid tuple. Determining whether the table contains a valid tuple can provide an early indication of whether a set of constraints is violated or entailed, for positive and negative constraints, respectively. Determining the minimum index of the first valid tuple can expedite subsequent constraint analysis. Further disclosed embodiments provide for removal of duplicate and wildcard values from a set of constraints, which can facilitate negative constraint analysis. An indication can be provided, such as through a user interface, of whether a set of constraints is violated or entailed. Software can restrict selection of values that may result in constraint violation based on the provided indication.

Abstract: The present disclosure relates to systems and methods for searching a machining knowledge database that includes stored 3D models and associated stored part signatures. The stored part signatures each include a shape metric that corresponds to geometric attributes of the corresponding 3D model. Methods include receiving input from a user relating to an input part, determining an input part signature that includes a shape metric that corresponds to geometric attributes of the input part, searching the machining knowledge database for similar 3D models based at least in part on the input part signature, and providing the search result to the user. Methods may include associating the input in the machining knowledge database and/or utilizing the search result, for example visualizing a comparison of the input and the search result.

Abstract: A storage unit stores hyperplane information indicating a first hyperplane, and second and third hyperplanes parallel to the first hyperplane. A computing unit generates a first binary value based on whether the position of a first feature vector is in the direction of a normal vector relative to the second hyperplane, a second binary value based on whether the position of the first feature vector is in the direction of the normal vector relative to the third hyperplane, and a third binary value based on whether the position of a second feature vector is in the direction of the normal vector relative to the first hyperplane, and determines a degree of similarity between the pieces of comparison data, based on a result of multiplying the exclusive OR result of the first and third binary values and the exclusive OR result of the second and third binary values.

Abstract: Systems and methods for generating an event-based data set using a computer implemented asset monitoring system are provided. An asset repository stores data related to one or more commissioned assets of an asset monitoring system. When event data is received from an asset, whether an asset maintenance record corresponding to the asset exists in the asset repository is determined based on comparing the data in the asset repository to the event data. When the asset maintenance record is determined to not exist in the asset repository, an asset identification record corresponding to the asset is rendered. The asset identification record comprises the event data and additional asset-related data collected from the asset. An event-based data set is generated based on the asset identification record.

Abstract: A database system is described that includes components for storing time-series data and executing custom, user-defined computational expressions in substantially real-time such that the results can be provided to a user device for display in an interactive user interface. For example, the database system may process stored time-series data in response to requests from a user device. The request may include a start time, an end time, a period, and/or a computational expression. The database system may retrieve the time-series data identified by the computational expression and, for each period, perform the arithmetic operation(s) identified by the computational expression on data values corresponding to times within the start time and the end time. Once all new data values have been generated, the database system may transmit the new data values to the user device for display in the interactive user interface.

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: In various embodiments, methods and systems for language scaling a natural language processing system (NLPS) are provided. A database schema of a database is accessed. The database schema includes entities that are defined in a query natural language different from an NLPS natural language upon which NLPS components are built. The entities are communicated to a machine translation service and top translations. A translated database schema model is generated based on the entities and translations. When a query associated with the query natural language and the database schema is received, a query translation is generated. The query translation comprises selectively translated portions of the query based on a selective translation mechanism that includes accessing the machine translation service to translate selected portions of the query. The selected portions are selected based on the translated database schema. The query translation is executed on the NLPS components to identify query results.

Abstract: The present disclosure is directed toward systems and methods for managing electronic documents. For example, systems and methods described herein can enable parties to an agreement outlined in an electronic document to add, track, and save electronic signatures associated with the electronic document. Furthermore, systems and methods described herein automatically identify expiration information associated with the electronic document and generate alerts for the electronic document based on the expiration information.