摘要:
Fog computing systems are provided comprising edge-nodes and middle-nodes between edge-nodes and cloud-node. These nodes form a hierarchical structure with each cloud, middle node having children nodes, and each middle, edge node having a parent-node. Each edge-node receives data from sensors, assigns reception-timestamp to each data indicating when data has been received to produce series of timestamp-ordered data, trains local model through machine-learning based on said series of timestamp-ordered data, and sends said series to parent-node of the edge-node. Each middle-node collects series of timestamp-ordered data from children nodes of the middle-node, trains supra-local model through machine-learning based on said collected series of timestamp-ordered data, and sends said collected series to parent-node of the middle-node. Parent-children structures, edge-nodes and middle-nodes for such fog computing systems are also provided. Methods and computer programs of operation of an edge-node, and methods and computer programs of operation of a middle-node are also provided.
摘要:
Methods and devices for discovering multiple instances of recurring values within a vector are disclosed. A first method calculates the prior instances of the vector. A second method calculates the last unique instances of the vector. An implementation of these methods as SIMD instructions is proposed. Sequential and parallel CAM implementations are also disclosed. The proposed methods can be used to correct conflicting indexes in vector memory indexed operations. Furthermore, an application to a vectorized sorting algorithm is proposed.
摘要:
There is provided a computer-implemented method for identifying of nucleic acid variants between two cells, such as a normal cell vs. a pathological cell of a patient, or a cell at two different stages of development. The method is alignment-free, as it does not depend on the use of a reference genome, and is based on the generation and comparison of polymorphic k-mers derived from the nucleotide sequence reads of both biological states. The invention accurately identifies all sorts of genetic variants, ranging from single nucleotide substitutions (SNVs) to large structural variants with great sensitivity and specificity. As a major novelty, it also identifies non-human insertions, such as those derived from retroviruses. Altogether, this invention allows the integration with specific hardware architectures in order to speed up the executions to an unprecedented level.
摘要:
It comprises a method of exploring the flexibility of macromolecules, where an available ensemble of structures of a receptor, such as one coming from a molecular dynamics trajectory or a set of experimentally derived structures, is used to generate an ensemble of structures for a closely related receptor, such as a receptor mutant, a receptor with a series of post-translational modifications, or one that is non-covalently bound to a second molecule. In this way, new ensembles of the pertubed receptor can be accessed without the need to explicitely simulate the new system. The method allows the study of structure and flexibility of derivatives and relatives of a receptor in a computer efficient manner, and therefore has applications in the rational-drug design field, especially in virtual screening. It also comprises a computer program product for causing a computer to perform the method, as well as a system of molecular modeling comprising computer means for carrying out each of the steps of the method.
摘要:
Fog computing systems are provided comprising edge-nodes and middle-nodes between edge-nodes and cloud-node. These nodes form a hierarchical structure with each cloud, middle node having children nodes, and each middle, edge node having a parent-node. Each edge-node receives data from sensors, assigns reception-timestamp to each data indicating when data has been received to produce series of timestamp-ordered data, trains local model through machine-learning based on said series of timestamp-ordered data, and sends said series to parent-node of the edge-node. Each middle-node collects series of timestamp-ordered data from children nodes of the middle-node, trains supra-local model through machine-learning based on said collected series of timestamp-ordered data, and sends said collected series to parent-node of the middle-node. Parent-children structures, edge-nodes and middle-nodes for such fog computing systems are also provided. Methods and computer programs of operation of an edge-node, and methods and computer programs of operation of a middle-node are also provided.
摘要:
Methods are provided of optimizing a tree-structured distributed-index with tree-nodes including data-elements and parent-child relations between tree-nodes. The distributed-index is stored in distributed system including computer-nodes each storing tree-nodes and a tree-map structurally describing the distributed-index. The methods include: inspecting the tree-map in first computer-node to determine whether the distributed-index is imbalanced due to a first tree-node in first computer-node and, in said case: notifying to other computer-nodes that first tree-node is replicable, to provoke that any request from other computer-nodes of inserting a data-element in first-tree-node includes inserting the data-element in corresponding child-node of first-tree-node; and verifying whether the other computer-nodes have been notified and, in said case, replicating data-elements stored in first tree-node into children-nodes thereof. Methods of inserting into and/or querying such distributed indexes or similar are also provided, along with computer programs and (computing) systems that are suitable for performing said optimizing, inserting and querying methods.
摘要:
Methods and devices for discovering multiple instances of recurring values within a vector are disclosed. A first method calculates the prior instances of the vector. A second method calculates the last unique instances of the vector. An implementation of these methods as SIMD instructions is proposed. Sequential and parallel CAM implementations are also disclosed. The proposed methods can be used to correct conflicting indexes in vector memory indexed operations. Furthermore, an application to a vectorized sorting algorithm is proposed.
摘要:
Techniques for workload management in cloud computing infrastructures are provided. In one aspect, a method for allocating computing resources in a datacenter cluster is provided. The method includes the steps of: creating multiple, parallel schedulers; and automatically selecting a resource allocation method for each of the schedulers based on one or more of a workload profile, user requirements, and a state of the datacenter cluster, wherein an optimistic resource allocation method is selected for at least a first one or more of the schedulers and a pessimistic resource allocation method is selected for at least a second one or more of the schedulers. Due to optimistic resource allocation conflicts may arise. Methods to resolve such conflicts are also provided.
摘要:
A method is used for managing a flow of data in at least one database, wherein said database is configured with at least two data models of data storage. In said method, during a first period of time, a first data flow portion is received in a computer, and the first data flow portion is then stored in a first data pool of the database according to the first data model. Then, after the first period of time, a transformation is made on the first portion of the data and the transformed first data is assigned to a second data model, and the first data flow portion is then transferred from the first data pool to a second data pool. The process is repeated with at least a second data flow portion and can be extended to more transformations, and, thus, to more data models, and more data pools accordingly.
摘要:
Methods are provided of optimizing a tree-structured distributed-index with tree-nodes including data-elements and parent-child relations between tree-nodes. The distributed-index is stored in distributed system including computer-nodes each storing tree-nodes and a tree-map structurally describing the distributed-index. The methods include: inspecting the tree-map in first computer-node to determine whether the distributed-index is imbalanced due to a first tree-node in first computer-node and, in said case: notifying to other computer-nodes that first tree-node is replicable, to provoke that any request from other computer-nodes of inserting a data-element in first-tree-node includes inserting the data-element in corresponding child-node of first-tree-node; and verifying whether the other computer-nodes have been notified and, in said case, replicating data-elements stored in first tree-node into children-nodes thereof. Methods of inserting into and/or querying such distributed indexes or similar are also provided, along with computer programs and (computing) systems that are suitable for performing said optimizing, inserting and querying methods.