Patent classifications
G06N5/025
System and method for file archiving using machine learning
Methods for file archiving using machine learning are disclosed herein. An exemplary method comprises archiving a first file of a plurality of files from a storage server to a tiered storage system, training a machine learning module based on file access operations for the plurality of files, determining one or more rules for predicting access to the archived files using the machine learning module, determining a prediction of access of the archived file based on the one or more rules and retrieving the archived file from the tiered storage system into a file cache in the storage server based on the prediction of access.
Dynamically updateable rules engine
A system includes a plurality of sensors; a dynamically updateable rules engine coupled to the plurality of sensors; a data collection management module coupled to the dynamically updateable rules engine and the plurality of sensors; and a data storage and analysis inference module coupled to the data collection management module, the dynamically updateable rules engine and the plurality of sensors. Data from the plurality of sensors that is received by the dynamically updateable rules engine is transformed by the dynamically updateable rules engine by selectively executing rules based on conditions or events. The dynamically updateable rules engine is updated by the data storage and analysis inference module.
Dynamically updateable rules engine
A system includes a plurality of sensors; a dynamically updateable rules engine coupled to the plurality of sensors; a data collection management module coupled to the dynamically updateable rules engine and the plurality of sensors; and a data storage and analysis inference module coupled to the data collection management module, the dynamically updateable rules engine and the plurality of sensors. Data from the plurality of sensors that is received by the dynamically updateable rules engine is transformed by the dynamically updateable rules engine by selectively executing rules based on conditions or events. The dynamically updateable rules engine is updated by the data storage and analysis inference module.
Inference system
A rule storing unit stores a set of rules each defining facts and a relation between the facts, and weights representing importance levels of the rules. An input data storing unit stores input data. A query storing unit stores a query. An importance level calculating unit calculates an importance level of each fact type of the facts defined by the rules. A fact data generating unit generates, for each fact type, fact data in which true/false is observed as a fact by a number corresponding to the importance level of the fact type, from the input data. A fact data storing unit stores the fact data. An inference performing unit performs probabilistic inference of a result of the query by using the fact data, the rules, and the weights. An output unit outputs a result of the inference.
Scalable neutral atom based quantum computing
The present disclosure provides methods and systems for performing non-classical computations. The methods and systems generally use a plurality of spatially distinct optical trapping sites to trap a plurality of atoms, one or more electromagnetic delivery units to apply electromagnetic energy to one or more atoms of the plurality to induce the atoms to adopt one or more superposition states of a first atomic state and a second atomic state, one or more entanglement units to quantum mechanically entangle at least a subset of the one or more atoms in the one or more superposition states with at least another atom of the plurality, and one or more readout optical units to perform measurements of the superposition states to obtain the non-classical computation.
Automation system and method
A computer-implemented method, computer program product and computing system for receiving a complex task; processing the complex task to define a plurality of discrete tasks each having a discrete goal; executing the plurality of discrete tasks on a plurality of machine-accessible public computing platforms; determining if any of the plurality of discrete tasks failed to achieve its discrete goal; and if a specific discrete task failed to achieve its discrete goal, defining a substitute discrete task having a substitute discrete goal.
COMBINED COMMODITY MINING METHOD BASED ON KNOWLEDGE GRAPH RULE EMBEDDING
The present invention is a combined commodity mining method based on knowledge graph rule embedding, comprising: expressing rules, commodities, attributes, and attribute values as embeddings; splicing and inputting the embeddings of the rules and the embeddings of the attributes into a first neural network to obtain a importance scores of the attributes; splicing and inputting the rules and attributes into a second neural network to obtain the embeddings of the attribute values that the rules should take under the attributes; calculating a similarity between the value of two inputted commodities under the attribute and the embedding of the attribute value calculated by a model; after calculating scores of all attribute-attribute value pairs, summing up to obtain scores of these two commodities under this rule; then making the cross entropy loss with the real scores of these two commodities, and iteratively training based on an optimization algorithm having gradient descent; after the model is trained, parsing the embeddings of the rules in a similar way to obtain rules that can be understood by human beings.
SYSTEMS AND METHODS FOR ARCHITECTURE EMBEDDINGS FOR EFFICIENT DYNAMIC SYNTHETIC DATA GENERATION
Systems and methods for architecture embeddings for efficient dynamic synthetic data generation are disclosed. The disclosed systems and methods may include a system for generating synthetic data configured to perform operations. The operations may include retrieving a set of rules associated with a first data profile and generating, by executing a hyperparameter search, a plurality of hyperparameter sets for generative adversarial networks (GANs) that satisfy the set of rules. The operations may include generating mappings between the hyperparameter sets and the first data profile and storing the mappings in a hyperparameter library. The operations may include receiving a request for synthetic data, the request indicating a second data profile and selecting, from the mappings in the hyperparameter library, a hyperparameter set mapped to the second data profile. The operations may include building a GAN using the selected hyperparameter set and generating, using the GAN, a synthetic data set.
Cognitive data discovery and mapping for data onboarding
Performing an operation comprising transforming an input dataset to a predefined format, extracting, from the transformed dataset, a plurality of features describing the transformed dataset, and generating, by a machine learning (ML) algorithm executing on a processor and based on an ML model, a plurality of rules for modifying the transformed dataset to conform with a first data model.
Multiple data labels within a backup system
Embodiments for a method performing data migration such as backups and restores in a network by identifying characteristics of data in a data saveset to separate the data into defined types based on respective characteristics, assigning a data label to each defined type by receiving user selection or automatically merging or selecting a priority label, from among many labels associated with a file, defining migration rules for each data label, discovering assigned labels during a migration operation; and applying respective migration rules to labeled data in the data saveset. The migration rules can dictate storage location, access rights, replication periods, retention periods, and similar parameters.