Abstract: Compressing files is disclosed. An input file to be compressed is first aligned. The alignment may be facilitated using the structure of the file. The file may include aspects such as format, rows, fields, or text, that can be used to create a warm start for the alignment operation. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Abstract: A disclosed information handling system includes an edge device communicatively coupled to a cloud computing resource. The edge device is configured to respond to receiving, from an internet of things (IoT) unit, a numeric value for a parameter of interest by determining a compressed encoding for the numeric value in accordance with a non-lossless compression algorithm. The edge device transmits the compressed encoding of the numeric value to the cloud computing resource. The cloud computing resource includes a decoder communicatively coupled to the encoder and configured to respond to receiving the compressed encoding by generating a surrogate for the numeric value. The surrogate may be generated in accordance with a probability distribution applicable to the parameter of interest. The compression algorithm may be a clustering algorithm such as a k-means clustering algorithm.

Abstract: Methods and systems for managing data collection are disclosed. To manage data collection, a system may include a data aggregator and a data collector. The data aggregator and/or data collector may utilize inference models to predict the future operation of the data collector. To minimize data transmission, the data collector may transmit a representation of data to the data aggregator only if the representation of data falls outside a threshold. The threshold may be adapted by the data aggregator in response to the needs of downstream consumers of the data.

Abstract: Co-clustering of at least some parameters is employed to reduce data transferred between edge and cloud resources. Single-parameter cluster information, including cluster counts, for each of two or more parameters of interest is accessed. Each parameter may represent a time series of numeric values sent from an IoT unit to an edge device. A co-clustering ratio is determined for each unique parameter pair. The co-clustering ratio indicates whether the number of clusters produced by a co-clustering algorithm applied to a group of parameters is less than the number of clusters required to represent the parameters without co-clustering. Co-cluster groups may be identified based on the cluster ratios. For each co-cluster group, the co-clustering algorithm may be invoked to produce compressed encodings of numeric value tuples. The compressed encoding is then transmitted to a cloud computing resource and decoded into a tuple of surrogate values.

Abstract: Techniques are provided for adaptive sensor position determination for multiple mobile sensors.

Abstract: Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Abstract: Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. When splitting the file into sequences or when performing subsequent recursive splitting, the splitting is based on a longest sequence match. The result is a compression matrix, where each row of the matrix corresponds to part of the file. A consensus sequence is determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Abstract: A Function as a Service (FaaS) distribution system is configured to implement FaaS as a Service (FaaSaaS), enabling autonomous storage systems to be used as FaaS providers during periods where the storage systems are not being used at full capacity to process primary workloads. The FaaS distribution system receives functions from FaaS consumers, and selects a FaaS provider from a set of autonomous storage systems currently able to process FaaS workloads. The FaaS distribution system selects FaaS providers based on an expected execution time of the function and expected execution times of other functions executing on particular FaaS providers, to preferentially select a FaaS provider that is currently running an instance of the function, and to preferentially select a FaaS provider that has other functions that are current executing that are not expected to finish execution at the same time the current function is expected to complete execution.

Abstract: Compressing files is disclosed. An input, which is associated with an original file and new content, is to be compressed. The input includes a consensus sequence of the original file and the new content. The new content is aligned based using the consensus sequence of the original file in order to generate a new consensus sequence that reflects both the original content and the new content. The compression engine generates a new compression matrix and a new consensus sequence. Using the new consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The new compressed file includes the pointer pairs and the new consensus sequence.

Abstract: Compressing files is disclosed. An DNA sequence to be compressed is first aligned. Aligning the DNA sequence includes splitting the DNA sequences into smaller sequences or portions that can be aligned. After the DNA sequence is spilt one or more time and aligned, a compression matrix is generated. Each row of the compression matrix corresponds to part of the DNA sequence. A consensus sequence is determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Abstract: One example method includes encoding data as a polysaccharide structure, synthesizing the polysaccharide structure to create polysaccharide storage media that comprises the data, and storing the polysaccharide storage media. The example method may also include receiving a read request directed to the polysaccharide storage media, mapping the polysaccharide structure to create a map in response to the read request, traversing the map of the polysaccharide structure to determine an X-base number, and obtaining the data by converting the X-base number to a binary form.

Abstract: A system can divide a database into a group of shards that are distributed among a group of data centers. The system can train a machine learning model on a group of labeled input data, wherein the group of labeled input data comprises respective requests to operate on the database, and wherein the respective requests are labeled with respective shards of the group of shards used to process the respective requests, and to produce a trained machine learning model. The system can, after training the machine learning model, receive a request. The system can process the request with the trained machine learning model to predict that a data center of the group of data centers will have a largest number of leader shards of the group of shards to process the request. The system can send the request to the first data center to be processed.

Abstract: A disclosed information handling system includes an edge device communicatively coupled to a cloud computing resource. The edge device is configured to respond to receiving, from an internet of things (IoT) unit, a numeric value for a parameter of interest by determining a compressed encoding for the numeric value in accordance with a non-lossless compression algorithm. The edge device transmits the compressed encoding of the numeric value to the cloud computing resource. The cloud computing resource includes a decoder communicatively coupled to the encoder and configured to respond to receiving the compressed encoding by generating a surrogate for the numeric value. The surrogate may be generated in accordance with a probability distribution applicable to the parameter of interest. The compression algorithm may be a clustering algorithm such as a k-means clustering algorithm.

Abstract: A system can a divide database into a group of shards distributed among a group of data centers, wherein the group of shards comprises respective leader replicas. The system can determine respective correlation values between pairs of shards of the group of shards. The system can examine the pairs of shards in a descending order of respective correlation values, comprising, in response to determining that a respective pair of shards of the pairs of shards has a first correlation value greater than a predetermined threshold value, and that at least one shard of the respective pair of shards is unlocked, reassigning leader replicas of the respective pair of shards to be stored in a same data center of the group of data centers, and locking the leader replicas of the respective pair of shards from being reassigned to another data center of the group of data centers during the examining.

Abstract: A method for alleviating data poisoning in an edge computing resource includes receiving a numeric value from an Internet of Things (IoT) unit and associating the numeric value with a cluster selected from a plurality of clusters in accordance with a suitable clustering algorithm such as a k-means clustering algorithm. In at least some embodiments, the numeric value comprises a poisoned numeric value including an adversarial component injected by an adversary to negatively impact a trained model of a cloud-based artificial intelligence engine. Rather than permitting the injected adversarial component to corrupt the AI engine, a cluster with which the numeric value is associated is sampled in accordance with a probability distribution of the cluster to obtain a surrogate for the poisoned numeric value. The surrogate may then be provided as an input to an inference module of the AI engine to generate a prediction.

Abstract: Co-clustering of at least some parameters is employed to reduce data transferred between edge and cloud resources. Single-parameter cluster information, including cluster counts, for each of two or more parameters of interest is accessed. Each parameter may represent a time series of numeric values sent from an IoT unit to an edge device. A co-clustering ratio is determined for each unique parameter pair. The co-clustering ratio indicates whether the number of clusters produced by a co-clustering algorithm applied to a group of parameters is less than the number of clusters required to represent the parameters without co-clustering. Co-cluster groups may be identified based on the cluster ratios. For each co-cluster group, the co-clustering algorithm may be invoked to produce compressed encodings of numeric value tuples. The compressed encoding is then transmitted to a cloud computing resource and decoded into a tuple of surrogate values.

Abstract: A system can establish a primary file system on a block array of computer storage, wherein the block array comprises a range of addresses, wherein the primary file system is configured to address the range of addresses. The system can establish a shadowed file system on the block array, wherein the shadowed file system is configured to access portions of the block array that are unused by the primary file system. The system can, in response to receiving a request to write data to the primary file system, and in response to determining that an amount of the block array utilized by the primary file system is full, transfer a first portion of the block array utilized by the shadowed file system to the primary file system.

Abstract: A system can generate a neural network, wherein an output of the neural network indicates whether a first test of a computer code will pass given an input of respective results of whether respective tests, of a group of tests of the computer code, pass, and wherein respective weights of the neural network indicate a correlation from a group of correlations comprising a positive correlation between a respective output of a respective node of the neural network and the output of the neural network, a negative correlation between the respective output and the output, and no correlation between the respective output and the output. The system can apply sets of inputs to the neural network, respective inputs of the sets of inputs identifying whether the respective tests pass or fail.

Abstract: A search engine responding to a user query to find relevant data assets in a federation business data lake (FBDL) system based on interactions of known users interacting with data assets in the FBDL system. Data assets are optimally placed for minimal latency or maximal load. Data asset recommendations and past data asset access information are input as features to a time-series model for predicting future data access patterns. An expected latency and load risk is then determined and scored by a weighted mean of these values, and placement optimization is simulated using an optimization method (e.g., genetic algorithm). Using the scoring and simulation, a data asset placement engine is then used to move the locations of the data assets to minimize latency and/or to minimize maximal load.

Abstract: A search engine responding to a user query to find relevant data assets in a federation business data lake (FBDL) system by monitoring and recording interactions of known users interacting with data assets in the FBDL system. Predicted data usage for unknown or new users is derived by training a generative model that uses reconstructive self-supervised learning (SSL) techniques to generate possible values for missing data usage features of the unknown users. The predicted usage is then used to generate similarity scores that are combined for those of the known users to help inform the search engine processing to return relevant results to a target user.