Abstract: This disclosure relates generally to system and method for classification of sensitive date using federated semi-supervised learning. Federated learning has emerged as a privacy-preserving technique to learn one or more machine learning (ML) models without requiring users to share their data. In federated learning, data distribution among clients is imbalanced resulting with limited data in some clients. The method includes extracting a training dataset from one or more data sources and pre-processing the training dataset into a machine readable form based on associated data type. Further, a federated semi-supervised learning model is iteratively trained based on a model contrastive and distillation learning to classify sensitive data from the unlabeled dataset. Then, sensitive data from a user query is received as input which are classified using the federated semi-supervised learning model.

Abstract: In accordance with embodiments, a decentralized financing system provides secure encrypted key retrieval by storing a user's encrypted private key on a Cloud keychain, accessible using the user's smart device, such as an iPhone or an Android device. To log on to her account, the user undergoes AML-KYC compliance, as well as liveness tests. In some embodiments, for quick retrieval and added security, the system stores the KYC-AML reference IDs but does not store any personal identifying information. The system further allows for minting an asset, such that AML-KYC compliance data, as well as other data of interest to regulators and traders alike, are publicly viewable absent personal identifiable information. Further, the system allows for asset creators and other selected parties to receive royalties for downstream trades of the asset.

Abstract: The disclosure relates to motion planning for autonomous vehicles to find a contiguous path to travel from a source to a destination in a real time environment. But, motion planning suffers due to dimensionality problem during planning a path in high dimensional configuration space. Conventional a priori path planning techniques utilize deterministic selection of a seed and there is a challenge in providing resolution completeness, especially in a cluttered environment. Here, the resolution problem associated with the cluttered environment, is rectified by utilizing random seed generation technique. A convex region is grown around each seed and a set of hyperplanes are generated around each convex region. A contiguous polytope is created by utilizing the set of hyperplanes associated with each convex region. Further, an undirected graph is created based on a plurality of polytope points associated with the contiguous polytope and a shortest path in the graph is computed.

Abstract: A technique replicates an index of an operations log (oplog) from a primary node to a secondary node of a cluster in the event of failure. The oplog functions as a staging area to coalesce random write operations directed to a virtual disk (vdisk) stored on a backend storage tier. The oplog temporarily caches write data as well as metadata describing the write data. The metadata includes descriptors to the write data corresponding to offset ranges of the vdisk and are used to identify ranges of write data for the vdisk that are cached in the oplog. To facilitate fast lookup operations of whether write data is cached in the oplog, an oplog index provides a state of the latest data for offset ranges of the vdisk that enables fast failover of metadata used to construct the oplog index in memory without downtime or significant metadata replay.

Abstract: Method and system for narrow passage path sampling based on levy flight is disclosed. The disclosed technique is an improvisation of Random Walk to Surface (RWS), wherein, instead of performing a random walk, the disclosed technique utilizes levy flight mechanism to identify samples in narrow passages (on the obstacle boundaries). The disclosed technique for identification of narrow passages sampling points in the narrow passage is based on several techniques that include random uniform sampling technique, a levy flight function (step size) and a collision detection technique. Moreover, in addition to identification of narrow passages sampling points, the disclosed technique also performs an additional check to ensure that the identified narrow passages sampling points are present in the narrow passage based on a levy flight bridge sampler technique.

Abstract: A technique improves implementation of an index for an operations log (oplog) that coalesces random write operations directed to a virtual disk (vdisk) stored on an extent store. The oplog temporarily caches data associated with the random write operations (i.e., write data) as well as metadata describing the write data. The metadata includes descriptors to the write data stored on virtual address regions, i.e., offset ranges, of the vdisk and are used to identify the offset ranges of write data for the vdisk that are cached in the oplog. To facilitate fast lookup operations of the offset ranges when determining whether write data is cached in the oplog, an oplog index provides a state of the latest data for offset ranges of the vdisk. The technique improves implementation of the oplog index by storing the oplog index in storage class memory, such as persistent memory, to obviate failure and subsequent recovery of the oplog index.

Abstract: A technique replicates an index of an operations log (oplog) from a primary node to a secondary node of a cluster in the event of a failure of the primary node. The oplog functions as a staging area to coalesce random write operations directed to a virtual disk (vdisk) stored on a backend storage tier organized as an extent store. The oplog temporarily caches data associated with the random write operations (i.e., write data) as well as metadata describing the write data. The metadata includes descriptors to the write data corresponding to virtual address regions, i.e., offset ranges, of the vdisk and are used to identify the offset ranges of write data for the vdisk that are cached in the oplog. To facilitate fast lookup operations of the offset ranges when determining whether write data io is cached in the oplog, an oplog index provides a state of the latest data for offset ranges of the vdisk.

Abstract: For the purpose of simple integration of conductor circuits into composite material components, a method and an apparatus for producing composite material components of this kind are proposed, wherein a conductor circuit is printed onto or applied in some other way to a support, is provided with a thermally activatable adhesive and then the support is applied to a blank of the composite material component for joint curing. The curing at high pressure and high temperature creates a strong connection between the conductor circuit and the composite material component.

Abstract: The disclosure relates to motion planning for autonomous vehicles to find a contiguous path to travel from a source to a destination in a real time environment. But, motion planning suffers due to dimensionality problem during planning a path in high dimensional configuration space. Conventional a priori path planning techniques utilize deterministic selection of a seed and there is a challenge in providing resolution completeness, especially in a cluttered environment. Here, the resolution problem associated with the cluttered environment, is rectified by utilizing random seed generation technique. A convex region is grown around each seed and a set of hyperplanes are generated around each convex region. A contiguous polytope is created by utilizing the set of hyperplanes associated with each convex region. Further, an undirected graph is created based on a plurality of polytope points associated with the contiguous polytope and a shortest path in the graph is computed.

Abstract: A method commences upon accessing a set of data items that describe computing nodes to be organized into failure-tolerant configuration. The failure-tolerant configuration is characterized by system availability characteristics such as a replication factor and such as a hierarchical distribution of computing nodes. Characteristics of the topology include boundaries that define two or more hierarchically-related availability domain levels. Computing nodes are situated within these boundaries. Instances of a target hierarchical availability domain level are sorted, and instances of a hierarchically lower availability domain level are also sorted to form a multi-level sort order of computing nodes. Computing entities are mapped onto the computing nodes by observing the multi-level sort order.

Abstract: For the purpose of simple integration of conductor circuits into composite material components, a method and an apparatus for producing composite material components of this kind are proposed, wherein a conductor circuit is printed onto or applied in some other way to a support, is provided with a thermally activatable adhesive and then the support is applied to a blank of the composite material component for joint curing. The curing at high pressure and high temperature creates a strong connection between the conductor circuit and the composite material component.

Abstract: A method commences upon accessing a set of data items that describe computing nodes to be organized into failure-tolerant configuration. The failure-tolerant configuration is characterized by system availability characteristics such as a replication factor and such as a hierarchical distribution of computing nodes. Characteristics of the topology include boundaries that define two or more hierarchically-related availability domain levels. Computing nodes are situated within these boundaries. Instances of a target hierarchical availability domain level are sorted, and instances of a hierarchically lower availability domain level are also sorted to form a multi-level sort order of computing nodes. Computing entities are mapped onto the computing nodes by observing the multi-level sort order.