Abstract: Taught is a search engine for science tools which dynamically evaluates search rank of said science tools through Natural Language Processing and machine learning. The search engine accepts into a corpus of public and private materials, which references individual science tools. Each item of the corpus is evaluated both as to how much that given item should be trusted, and what that item says about individual science tools. Each science tool is evaluated based on what the whole corpus of input data contains concerning those science tools, taking into account how valuable the source of the data is in order to render an overall score and search rank. The search engine generates a judgement of each individual science tool, which is dynamically updated as new information becomes available in the corpus of input data.

Abstract: In one example, the present disclosure describes a device, computer-readable medium, and method for adaptively clustering media content from multiple different domains in the presence of domain shift. For instance, in one example, a plurality of data content items is acquired from a plurality of different domains, wherein at least some data content items of the plurality of data content items are unlabeled. The plurality of data content items is encoded with a feature representing a domain shift variation that is assumed to be present in the plurality of data content items, wherein the domain shift variation comprises variation in a characteristic of the plurality of data content items. The plurality of data content items is clustered into a predefined number of content categories subsequent to the encoding.

Abstract: A method for improving consensus in a blockchain network through decentralized grouping includes: identifying, by each node of a plurality of nodes in a blockchain network that manages a blockchain, a plurality of groups, where each is comprised of a subset of nodes; generating, by each node in each subset of nodes, a new block for the blockchain; performing, by each subset of nodes, a first consensus operation among all nodes in the subset of nodes for the new block generated by in the subset of nodes to identify a group consensus block, where each node in the subset of nodes receives the group's group consensus block; and performing, by the blockchain network, a second consensus operation among all groups for the identified group consensus block to identify an overall consensus block, where a majority of groups of the plurality of groups receives the overall consensus block.

Abstract: A system and method for time synchronization. The method includes incrementing at least one instance of a snap value, wherein the at least one instance is stored in at least one storage node of a distributed storage system, wherein each of the at least one instance is incremented using a single-phase commit operation, wherein each of the plurality of storage nodes includes at least one timestamp, wherein each timestamp indicates a corresponding snap time, wherein each snap time is determined by reading one of the at least one instance at a time of creation of the corresponding timestamp.

Abstract: Context dependent execution time prediction may be applied to redirect queries to additional query processing resources. A query to a database may be received at a first query engine. A prediction model for executing queries at the first query engine may be applied to determine predicted query execution time for the first query engine. A prediction model for executing queries at a second query engine may also be applied to determine predicted query execution time for the second query engine. One of the query engines may be selected to perform the query based on a comparison of the predicted query execution times.

Abstract: A system for dynamically displaying specific sections of a file depending on a user identity is provided. The system utilizes access control data to enable an author to generate and share a file with a number of consumers and have each recipient view a customized set of sections of the file depending on access permissions associated with each recipient. The file can be in any format, e.g., a word processing document, presentation document, a media file, or any other file having a number of sections. A section of a file can be any definitive unit of data, such as a page, slide, tab, worksheet, video segment, audio segment, etc. Permissions can be based on a user's permission level, work history, skill level, role in an organization, title, etc. The system can also prevent access to certain sections of a file depending on the permissions associated with a consumer.

Abstract: Disclosed herein are systems, methods, and processes to perform replication between heterogeneous storage systems. In one embodiment, a request to perform a replication operation is sent by a target server to a source server, where the target server and the source server use different protocols to store data. A plurality of instructions, which are associated with a replication stream, are received from the source server by the target server, where the plurality of instructions comprise an include instruction to include existing data and a write instruction to write new data. A replication stream, which is associated with a backup stream stored on the source server, is also received from the source server, where the replication stream and the backup stream share a common format. The target server synthesizes a new replicated backup image, where the synthesizing comprises performing the include instruction and the write instruction on the replication stream.

Abstract: Systems, methods, and other embodiments associated with distributed primary identifier management in a multi-master database system are described. One embodiment includes: Receiving a request to add a new master node to a multi-master database environment. Retrieving the next available master node number from a master node counter for the database environment. Generating a numeric base for primary identifiers of data objects of the new master node by deriving high order bits of the numeric base from the retrieved master node number. Configuring the new master node to assign the next unassigned number in a sequence of numbers beginning with the numeric base as the primary identifier for each data object created by the new master node. Add the new master node to the database environment. In one embodiment, the numeric base is generated by replacing the leading bits of the primary identifier range with the reversed the binary equivalent of the node number of the new master node.

Abstract: The disclosed systems, structures, and methods are directed towards for processing a lock request by a master node to access a shared data object in a database located at a remote location comprising identifying, in the master node, a category of the lock request. If the lock request is for a self-compatible lock, determining a value of a counter associated with the master node and with one or more other master nodes, and if the value of the counter is zero, locally granting the lock request. If the value of the counter is greater than zero, forwarding the lock request to a global lock manager (GLM), and if the lock request is for a heavy-conflicting lock, forwarding the lock request by the master node to the GLM.

Abstract: A method and system provide the ability to forecast events that match a criterion. Input is received and includes an event set and a criterion. The event set includes events and each of the events is a record with features. Each feature is an instance of a feature type (FT) and feature value (FV) combination. The criterion is a logical statement that specifies a criterion FT, a criterion FV, and an operator. The event set is partitioned and a partition BitSet is built for each partition. Each partition length of each partition BitSet is based on a number of the events. Based on the partition BitSets, a partition FT-FV count is created. For each partition, a partition FT criterion BitSet is created and a partition Criterion BitSet is computed based thereon. The forecast is then computed based on the partition Criterion BitSet.

Abstract: Embodiments of methods and/or systems for tagging trees are disclosed.

Abstract: An example operation may include one or more of receiving a request for trust information of an off-chain data source from a client, determining a category type of the off-chain data source from among a plurality of category types based on the request, retrieving a reliability value of the off-chain data source linked to one or more of an identity of the off-chain data source and the determined category type from a reliability database implemented via a distributed ledger shared among a plurality of peer nodes, and transmitting the retrieved reliability value linked to the category type to the client.

Abstract: An apparatus is described that includes an execution unit to execute a first instruction and a second instruction. The execution unit includes input register space to store a first data structure to be replicated when executing the first instruction and to store a second data structure to be replicated when executing the second instruction. The first and second data structures are both packed data structures. Data values of the first packed data structure are twice as large as data values of the second packed data structure. The execution unit also includes replication logic circuitry to replicate the first data structure when executing the first instruction to create a first replication data structure, and, to replicate the second data structure when executing the second data instruction to create a second replication data structure.

Abstract: Transportable storage devices are communicatively coupled behind one or more dedicated “edge” data servers to take advantage of the benefits of the data servers and transportable storage devices while limiting their disadvantages. Each edge data server ingests data from one or more client devices and copies the data to one or more of the transportable storage devices for eventual transport to a cloud data center for upload to a cloud storage system. Multiple versions of a segment of data (e.g., of a file or a blob) are maintained at various points in the disclosed system and the disclosed technology ensures that the most recent version is the version ultimately stored on the cloud storage system.

Abstract: An apparatus is described that includes an execution unit to execute a first instruction and a second instruction. The execution unit includes input register space to store a first data structure to be replicated when executing the first instruction and to store a second data structure to be replicated when executing the second instruction. The first and second data structures are both packed data structures. Data values of the first packed data structure are twice as large as data values of the second packed data structure. The execution unit also includes replication logic circuitry to replicate the first data structure when executing the first instruction to create a first replication data structure, and, to replicate the second data structure when executing the second data instruction to create a second replication data structure.

Abstract: Methods and systems for deploying a database are described. In an example, a processor can generate an object that specifies a set of data from the database, a set of dependencies associated with the set of data, and a set of changes applicable to the set of data. The processor can determine a schedule to lock the set of data based on the set of dependencies. The processor can lock the set of data in accordance with the schedule. The processor can apply the set of changes to the set of data. The processor can release the set of data with the applied changes to update the database.

Abstract: Systems and methods are disclosed for dynamic search interfaces. In one implementation, a search query is received from a user within a content retrieval interface. The search query is processed with respect to a first content source to determine a relevance of the first content source with respect to the search query. Based on a determination that the first content source exceeds a defined relevance threshold, content from the first content source is requested and/or received. The content received from the first content source is presented within the content retrieval interface.

Abstract: A method includes generating, using a processor, a graph including a plurality of nodes and a plurality of paths between the nodes, the graph representing a system comprising an arrangement of elements, and a data structure in which, for each node pair of the plurality of nodes, a count of the number of paths of length S between the node pair is stored in association with the length S. The method includes modifying the graph, using the processor, to obtain a modification of the graph related to the count of the number of paths of length S, and estimating, based on the data structure and the modification, an objective function that is quantitatively representative of the connections between the nodes and being indicative of performance of the system.

Abstract: Software-based technologies for improving structured data collection, presentation, validation, and workflow management processes are disclosed, including the use of interpretable configuration files to define data objects, generate object-level and sub-object-level specifications for a forms-based interface, validation processes and a workflow-based interface. A back-end integration component maps the data objects, validation and workflow processes, and interface specifications to portions of a back-end database system.

Abstract: An apparatus is described that includes an execution unit to execute a first instruction and a second instruction. The execution unit includes input register space to store a first data structure to be replicated when executing the first instruction and to store a second data structure to be replicated when executing the second instruction. The first and second data structures are both packed data structures. Data values of the first packed data structure are twice as large as data values of the second packed data structure. The execution unit also includes replication logic circuitry to replicate the first data structure when executing the first instruction to create a first replication data structure, and, to replicate the second data structure when executing the second data instruction to create a second replication data structure.