Abstract: Systems and methods for reducing usage of computational resources when accessing siloed data across disparate locations via a unified metadata graph are disclosed. The system receives a user-specified query indicating a request to access a set of data objects. The system then performs natural language processing on the user-specified query to determine a set of phrases corresponding to the user-specified query. The system then accesses a metadata graph to determine a node corresponding to the set of phrases. Using a location identifier corresponding to the determined node, the system determines a data silo storing at least one data object of the set of data objects. The system then generates for display, on a graphical user interface, a visual representation of the at least one data object.

Abstract: Systems, computer program products, and methods are described herein for optimized data archival using data detection and classification model. The present invention is configured to receive information associated with a first data element within a distributed network environment; determine a first data type associated with the first data element; determine one or more archival actions associated with the first data element; determine one or more archival requirements associated with the first data element; determine one or more utilization parameters associated with the first data element; initiate an execution of the one or more archiving actions on the first data element; determine that the one or more archival actions meet the one or more archival requirements associated with the first data element; and execute the one or more archiving actions based on at least determining that the one or more archival actions meet the one or more archival requirements.

Abstract: Systems and methods are disclosed for executing a query that includes an indication to process data managed by an external data system. The system identifies the external data system that manages the data to be processed and generates a subquery for the external data system indicating that the results of the subquery are to be sent to one worker node of multiple worker nodes. The system instructs the one worker node to distribute the results received from the external data system to multiple worker nodes for processing.

Abstract: A method, device and system for organizing media content on a computer-based system to form a playlist, wherein the device has access to a database with a plurality of music tracks and associated feature vectors including feature values representing different semantic characteristics of a music track, as well as metadata including at least one type of metadata record representing associated information about the respective music track. The playlist is determined based on a query from the client device that includes an input vector, and at least one input metadata record, using an additional similarity matrix representing a measure of similarity between different metadata records of the same type.

Abstract: Asynchronous snapshot invalidation techniques are described. According to various such techniques, an enhanced file handle structure may be defined that includes a snapshot generation ID that is to comprise a value that singularly identifies a snapshot performed at a particular point in time. In some embodiments, when a snapshot ID assigned to that snapshot is reused at a subsequent point in time, a different snapshot generation ID may be assigned to that subsequent snapshot. With respect to an in-core cache, the differing snapshot generation IDs may eliminate unacceptable ambiguity regarding respective file information sets corresponding to the initial and subsequent snapshots sharing the same snapshot ID. As a result, obsolete file information sets may be cleared from the in-core cache asynchronously, enabling improved performance. The embodiments are not limited in this context.

Abstract: Detecting a trend in latency for storage underlying a deduplicated file system includes generating a set of data points by recording when input/output (IO) requests were issued to the storage and recording time required to receive success responses from the storage. Least squares regression is performed on the data points to find a best-fit line through the data points. A slope of the best-fit line is calculated. A determination is made as to whether the slope is positive, a positive slope thereby indicating a trend of increasing latency of the storage. When the slope is determined to be positive, clients accessing the deduplicated file system are throttled.

Abstract: A method for discovering causality from data includes acquiring to-be-processed data, and obtaining a covariance matrix of the to-be-processed data; determining a first target column in the covariance matrix, taking the number of columns of the first target column as a first place in a rearrangement sequence, and obtaining a first upper triangular matrix according to the first target column; determining a position of the number of columns of the covariance matrix other than the first target column except the first place in the rearrangement sequence according to the first target column and the first upper triangular matrix, and obtaining an upper triangular matrix in each position determination; obtaining an adjacency matrix according to an upper triangular matrix and a rearrangement sequence obtained in final position determination; and generating directed acyclic graph (DAG) by using the adjacency matrix, and taking the DAG as causality discovery result of the to-be-processed data.

Abstract: A method for comparing a first and a second databases to determine whether an individual is represented by both an element of the first database and an element of the second database, wherein said elements are biometric data, including the implementation of the steps applying a classification model for each element of each database so as to construct a set of first and second bins of the respective first and second databases, each bin bringing together similar elements, each first bin being associated with a second bin; comparing the elements from the first database for at least one pair of an associated first bin and second bin belonging to said first bin with the elements from the second database belonging to said second bin, at least one of the first and the second databases then being encrypted homomorphically.

Abstract: Described are methods, systems and computer readable media for computer data distribution architecture for efficient distribution and synchronization of plotting processing and data.

Abstract: In an embodiment, a computer-implemented method for training a decision tree using a database system, the decision tree comprising a plurality nodes, comprises, by one or more computing devices: storing in a database input data for training the decision tree, the input data comprising a plurality of feature values corresponding to a plurality of features; generating a particular node of the plurality of decision nodes by: selecting a subset of the plurality of features and a subset of the input data; using one or more queries to the database system, for each feature of the subset of the plurality of features, calculating an information gain associated with the feature based on the subset of the input data; identifying a particular feature of the subset of the plurality of features associated with the highest information gain; associating the particular node with the particular feature, wherein the particular node causes the decision tree to branch based on the particular feature.

Abstract: Disclosed herein are system, method, and computer program product embodiments for validating input requests. In an embodiment, an application program interface (API) can receive a input request from a client device or server. The API can validate the input requests based on client-side or server-side technology implemented by the client device or server. In response to validating a input request from the client device and server, the database's framework can validate the database request before processing the input request. In response to failing to validate an input request at the client device, server, or database level, a machine-learning algorithm can be used to determine how to resolve a possible error, which may have caused the failure to validate the input request.

Abstract: Devices and techniques are generally described for regionalizing content based on the availability of similar content. In some examples, a first search query related to a first item may be received. A determination may be made that the first search query is associated with a first region. In some examples, the first item may be determined to be associated with the first region based at least in part on at least one of the first item or items classified as substitutes for the first item being available in a plurality of regions. A first plurality of search results associated with the first region may be determined. In further examples, code may be generated to cause the first computing device to display the first plurality of search results.

Abstract: Certain aspects of the present disclosure provide techniques for managing the transmission of mixed-modality messages using machine learning models. An example method generally includes generating, using a first machine learning model, an embedding representation of a mixed-modality message. The mixed-modality message is classified as an effective message or an ineffective message using a second machine learning model and the embedding representation of the mixed-modality message. One or more actions are taken to manage transmission of the mixed-modality message based on the classifying the mixed-modality message as an effective message or an ineffective message.

Abstract: A method for graph processing in a scalable graph processing framework may include applying a two-dimensional partitioning scheme to partition a graph. One or more partitions of the graph may be distributed to each graph core such that each graph core executes a graph processing algorithm on one or more partitions of the graph. The executing of the graph processing algorithm may include the graph cores exchanging vertex labels via a crossbar interconnecting the plurality of graph cores. Each graph core in the scalable graph processing framework may be coupled with a single memory channel upon which the partitions of the graph are distributed. The graph cores may synthesized on a field programmable gate array (FPGA) based on one or more user defined functions (UDFs). Related systems and computer program products are also provided.

Abstract: A computer-implemented system and method performs a search operation. One or more servers coupled in communication with a network, and comprising a processor, a data store, and a controller comprising a matching unit that is configured to access the data store. The matching unit is configured to receive a partial query term inputted into a displayed search access point at a remote computer, and to match the partial query term to the data store to create a list of match keywords. The matching unit is further configured to perform a relevancy process on the matched keywords. The matching unit is yet further configured to determine top matched keywords based upon the relevancy and send a listing of the top matched keywords, to be displayed adjacent the displayed search access point at the remote computer. The listing is configured to be changed based on a change to the partial query term.

Abstract: Generating a query response by receiving data for a non-user utterance, determining a question answering (QA) system response to the non-user utterance, receiving data for a user utterance responsive to the non-user utterance, determining a confidence score for the user utterance, determining a deviation between the user utterance and the QA system response, and providing the QA system response according to a combination of the deviation and the confidence score.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for governing phenotypic outcomes in plants. One method includes obtaining a model input comprising time series data, wherein the time series data comprises, for each previous time point of one or more previous time points, at least one of i) first multi-omics data corresponding to a plant at the previous time point, or ii) phenotypic data corresponding to the plant at the previous time point; and processing the model input using a machine learning model to obtain a model output that comprises, for each future time point of one or more of future time points, a prediction of at least one of i) a phenotype of the plant at the future time point, or ii) second multi-omics data corresponding to the plant at the future time point.

Abstract: A specially programmed machine and method generates propensity information based on inputs received from machines connected as part of an Internet of Things (IoT) environment, where the machine appends a predictive segmentation attribute to each data input received and generates a matrix based on the counts of each attribute-input combination. The attribute-input counts for each combination are converted to a statistical metric that represents propensity information for consumers fitting into the segment associated with the particular attribute. The propensity information can be relayed to a client in a variety of ways, including a direct display of the propensity information, appendage of the propensity information to the clients database, or using the information to provide an audience report to the client.

Abstract: A system that implements a data storage service may store data on behalf of clients in multiple replicas on respective computing nodes. The system may employ an external service to select a master replica for a replica group. The master replica may service consistent read operations and/or write operations that are directed to the replica group (or to a data partition stored by the replica group). The master replica may employ a quorum based mechanism for performing replicated write operations, and a local lease mechanism for determining the replica authorized to perform consistent reads, even when the external service is unavailable. The master replica may propagate local leases to replica group members as replicated writes. If another replica assumes mastership for the replica group, it may not begin servicing consistent read operations that are directed to the replica group until the lease period for a current local lease expires.

Abstract: Systems, methods, and apparatuses for storing PII information via a metadata driven blockchain using distributed and decentralized storage for sensitive user information, operable within a cloud based computing environment.