Abstract: Systems, computer program products, and methods are described herein for authorizing a database model using distributed ledger technology. The present invention is configured to receive, from a computing device of a user, a physical database model; determine one or more data sources; initiate a second machine learning model on the one or more data sources and the physical database model; determine at least one data source that is likely to be triggered when populating a database created using the physical database model; generate a new transaction object for the physical database model; broadcast the new transaction object for the physical database model to the at least one data source in a distributed ledger for validation; receive a validation of the physical database model; and authorize a generation of a database using the physical database model based on at least receiving the validation.

Abstract: According to the embodiments of the present disclosure, there is provided a method and device of detecting fault in production, and a computer readable storage medium. The method includes: determining whether a plurality of production paths in a production line are faultless in one or more production batches, based on production record data; and determining at least one of the plurality of production paths to be faulty, at least partially based on whether the plurality of production paths are faultless in the one or more production batches.

Abstract: Embodiments of the present invention provide a data management technology. An OSD receives a strip write request sent by a client server, where the strip write request carries a to-be-written strip, a version number of the to-be-written strip, an offset of the to-be-written strip, and an object ID of the to-be-written strip; and the OSD writes the to-be-written strip into a storage location determined by using the object ID, the version number of the to-be-written strip, and the offset of the to-be-written strip. By applying the present invention, a quantity of object IDs can be reduced.

Abstract: A method and system for dynamically determining a minimum support for automation mining is provided. The method and system include modifying the minimum support pattern such that the minimum support can result pattern mining algorithms finding a sufficient number of patterns in a practical duration.

Abstract: Disclosed are methods and systems for Semantics Node functions which provide semantics support in machine-to-machine systems. In an example, a Semantic node may manage semantics resources capable of being discovered, retrieved, or validated by other devices. In another example, the Semantics Node may be discovered by other nodes, and semantics resources may be discovered with subscription mechanisms.

Abstract: Methods, systems, and programming for retrieving content items for a search are described herein. In a non-limiting embodiment, a query including a plurality of terms may be received. For each of the plurality of terms, a posting list of one or more content items may be obtained. The posting list may include a ranked list of term scores corresponding to the one or more content items, each of the term scores being indicative of a level of relevance of a corresponding content item to a term associated with the posting list. A list of relevant content items for the query may be determined based on the term scores in each posting list for the one or more content items identified with respect to each term. At least one of the relevant content items may be provided as a response to the query.

Abstract: A method, apparatus, and system for managing file level restore agents is provided. The operations comprising: determining a computing resource usage level at a data protection appliance; determining whether the computing resource usage level at the data protection appliance is below a first threshold; in response to determining that the computing resource usage level at the data protection appliance is below a first threshold, assigning a new file level restore-associated job to a first tier file level restore agent for performance; and in response to determining that the computing resource usage level at the data protection appliance is not below a first threshold, assigning the new file level restore-associated job to a second tier file level restore agent for performance.

Abstract: Content items are rearranged within a digital collaboration space (e.g., a digital whiteboard) based on category metadata determined for the content items using one or more learning models. The content items are added to the digital collaboration space by one or more users. For each of the content items, category metadata is determined using a learning model that processes information associated with the content item. A rearrangement of the content items is determined based on the category metadata determined for each of the content items. The content items, rearranged according to the rearrangement, are then output to a layer of the digital collaboration space. Other rearrangements of the content items can be determined based on non-category metadata associated with the content items, and the content items, rearranged according to those other rearrangements, can be output to other layers of the digital collaboration space.

Abstract: Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time.

Abstract: Some embodiments improve object accessibility within a user interface based on a set of access patterns associated with the object. Improving accessibility for an object may include positioning a shortcut for the object to allow for quick access to the object. Another example includes executing commands to traverse a user interface, without receiving user input, to display a screen for accessing the object. Another example includes establishing a connection for accessing the object prior to receiving a request to access the object. A trigger for improving the accessibility for the object may be programmed based on a set of conditions detected when the object was previously accessed. Thereafter, detection of the same set of conditions triggers an improvement in the accessibility for the object. When the set of conditions corresponding to the trigger is no longer detected, the system may revert back to the default accessibility for the object.

Abstract: A system includes a processor and a memory storing multiple records in a key-value data structure and processor executable instructions for managing access to records in the key-value data structure. The instructions are executable to perform operations including managing a shared atomic epoch counter and thread epoch counters, determining a maximal safe epoch as a function of the shared atomic epoch counter and the thread epoch counters, maintaining a drain list of trigger actions, and triggering the trigger actions in the drain list as a function of an update of the shared atomic epoch counter and the maximal safe epoch.

Abstract: System generates data structure based on unique identifiers of objects in storages and sets indicators in positions corresponding to hashes of unique identifiers of objects. The system copies active objects from one storage to another, if number of active objects in storage does not satisfy threshold, and resets indicators in positions in data structure corresponding to hashes of unique identifiers of active objects copied to the other storage. The system generates another data structure based on unique identifiers created while generating data structure, positions in other data structure corresponding to hashes of the unique identifiers. System sets indicators in positions in the other data structure corresponding to hashes of unique identifiers of data objects in active storages while generating data structure. System resets indicators in positions in data structure corresponding to hashes of the unique identifiers corresponding to indicators set in positions of the other data structure.

Abstract: The claimed subject matter includes techniques for offline evaluation of ranking functions. An example system includes a first module configured to receive production log data, the first module to pre-process the production log data to generate an exploration data set. The example system also includes a second module configured to perform offline estimation of online metrics for ranking functions using the exploration data set. The example system also includes a third module to evaluate a proposed ranking function by comparing the estimated online metrics to a set of baseline metrics of a baseline ranking function and detecting that the estimated online metrics of the proposed ranking function exceed, are lower than, or are within a predetermined range of the baseline metrics.

Abstract: A cardinality of a query is estimated by creating a join plan for the query. The join plan is converted to a graph representation. A subtree graph kernel matrix is generated for the graph representation of the join plan. The subtree graph kernel matrix is submitted to a trained model for cardinality prediction which produces a predicted cardinality of the query.

Abstract: Methods and systems are provided for enhanced data loss prevention. The enhanced data loss prevention may be applied to data that is structured and/or semi-structured data, with the data comprising a plurality of records and a plurality of categories, with each record comprising a plurality of fields, each of which being associated with a different one of the plurality of categories. The enhanced data loss prevention may comprise selecting a subset of records of the data, with the selected subset comprising at least two records having between then one or more records not included in the subset. The fields of the selected subset may be scanned for sensitive information, and a likelihood to contain the sensitive information may be computed for each category based on the scanning. A subset of categories may be selected based on the computed likelihoods, and the sensitive information in the selected subset may be searched.

Abstract: A system and method are presented in which known genetic attributes associated with a condition are used to seed the determination of additional attributes which are associated with the condition. Based on the learning, the additional attributes (genetic, behavioral, or both) provide for an increased correlation between the combined attributes and the condition. For behavioral attributes, a measure of the impact of the behavioral attribute on the risk of the condition can be transmitted to another device or system.

Abstract: Generating a storage interface includes receiving a request for documents, detecting an accounting workflow type corresponding to request, and identifying a document organizational structure matching the accounting workflow type. Further, a virtual storage interface is built using an index on the documents and according to the document organizational structure, and presented.

Abstract: Systems and techniques for data tagging and task dataset generation are described herein. A set of context elements may be obtained for a data element in a data source. The set of context elements may be evaluated using a machine learning processor to embed one or more tags into the data element. A task to be completed by the user may be identified. A set of task tags may be determined that correspond to the task. The data source may be searched using the set of task tags to select the data element. A task dataset may be generated that includes the data element in response to the search.

Abstract: Approaches presented herein enable presenting, as an initial response to a search query from a user, a set of analytic summaries prior to initiating a document security protocol in a secured document environment. Each analytic summary represents a set or cluster of documents. A summary relevance value is calculated for each analytic summary and a document relevance value is calculated for each individual document. Analytic summaries are presented to the user while each document within each analytic summary are prioritized for a security review based on its related summary relevance value and document relevance value. Based on the priorities, a security review is initiated for the documents so that a highly relevant document within an analytic summary undergoes the security review before a less relevant document. Access to a particular document is granted to the user according to the security review of the document.

Abstract: Techniques for CPU cache efficiency may include performing concurrent processing, such as for first and second data operations, in a synchronized manner that prevents loading the same data chunk into the CPU cache more than once. Processing may include synchronizing the first and second data operations with respect to a first data chunk to ensure that both the first and second data operation processing has completed prior to proceeding with performing such processing on a second data chunk. The first and second data operations may be any two of deduplication, encryption, and compression, performed inline as part of the data path. In one embodiment, the first and second data operations for the first data chunk may be performed in parallel or sequentially where neither data operation proceeds with another data chunk until processing of the first and second data operations is complete for the first data chunk.