Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

Abstract: Techniques for identity management, and more particularly, to techniques for dynamically assigning membership to users in the system based on dynamic rules. In one aspect a computer-implement method is provided that breaks down the processing from a single large thread or operation into multiple minutest level threads or operations and makes use of event driven architecture used in distributed environments such as a cloud environment, to achieve a scalable model and can work seamlessly for multi-tenant applications. Every sub problem is assigned to a dedicated set of subscribers on a messaging service for processing.

Abstract: Techniques discussed herein relate to implementing a distributed computing cluster (the “cluster”) including a plurality of edge devices (e.g., devices individually configured to selectively execute within an isolated computing environment). One edge device may be configured to operate as a head node of the cluster at a given time. A request for virtual resources of the cluster may be received from a user device and directed to the first edge device of the cluster. The first edge device may determine it is not operating as a head node of the cluster. The first edge device may determine that a second edge device of the cluster is operating as the head node. In response, the first edge device may forward the request to the second edge device, wherein forwarding the request to the second edge device causes the second request to be processed by the cluster.

Abstract: Methods, systems, and computer readable media for validating subscriber entities against spoofing attacks in a communications network are disclosed. One method includes receiving, by a proxy element, a subscriber authentication request message that is sent from an access and mobility management function (AMF) and is directed to a unified data management (UDM) function in a home network, creating, by the proxy element, a record entry including a subscriber identifier and a public land mobile network (PLMN) identifier contained in the subscriber authentication request message, wherein the record entry is stored in an authentication registry database prior to forwarding the subscriber authentication request message to the UDM function.

Abstract: Techniques are described for a hierarchical caching mechanism enabling efficient cross-region replications. In some embodiments, replication-related information (e.g., key-value pairs) is stored in a particular layout in a binary tree (B-tree) of a file system for replication processing. A hierarchy of caches storing a first type of information (e.g., crypto keys associated with iNodes) may be arranged to match the particular layout in the B-tree to enable efficient parallel processing of a second type of information (e.g., files, file data, or symbolic links), where the replication-related information in the B-tree is partitioned into multiple key ranges for parallel processing. In some embodiments, the caches in different hierarchies may be shared by different parallel-processing key ranges and replication jobs in a file system.

Abstract: A computer-implemented method includes: accessing a plurality of datasets, where each dataset of the plurality of datasets includes training examples; selecting datasets that include the training examples in a source language and a target language; and sampling, based on a sampling weight that is determined for each of the selected datasets, the training examples from the selected datasets to generate the training batches; training an ML model for performing at least a first task using the training examples of the training batches, by interleavingly inputting the training batches to the ML model; and outputting the trained ML model configured to perform the at least the first task on input utterances provided in at least one among the source language and the target language. The sampling weight is determined for each of the selected datasets based on one or more attributes common to the training examples of the selected dataset.

Abstract: Techniques for perspective-preserving seamless application switching are disclosed. A system may display a first interface using a first application. The first interface includes interface elements representing a plurality of objects. The system may detect a zoom-in command, received by the first application, requesting a particular zoom level for a first interface element, corresponding to a first object in the first plurality of objects. The system may determine that the requested zoom level exceeds a threshold. Responsive to determining that the requested zoom level exceeds the threshold, the system may display, using a second application, a second interface corresponding to the first object. The second interface may include one or more of: (a) characteristics associated with the first object that were not displayed by the first application, or (b) user input elements for executing operations associated with the first object that were not displayed by the first application.

Abstract: The present disclosure is related to techniques for converting a natural language utterance to a logical form query and deriving a natural language interpretation of the logical form query. The techniques include accessing a Meaning Resource Language (MRL) query and converting the MRL query into a MRL structure including logical form statements. The converting includes extracting operations and associated attributes from the MRL query and generating the logical form statements from the operations and associated attributes. The techniques further include translating each of the logical form statements into a natural language expression based on a grammar data structure that includes a set of rules for translating logical form statements into corresponding natural language expressions, combining the natural language expressions into a single natural language expression, and providing the single natural language expression as an interpretation of the natural language utterance.

Abstract: Approaches of reassigning a home region from a first data center to a second data center as requested by a customer are described herein. The home region is able to implement write operations to a domain, whereas other data centers cannot implement write operations to the domain. The customer can request the home region being reassigned to another data center such that the customer can utilize the other data center to implement write operations to the domain.

Abstract: The present invention relates to machine learning (ML) explainability (MLX). Herein are local explanation techniques for black box ML models based on coalitions of features in a dataset. In an embodiment, a computer receives a request to generate a local explanation of which coalitions of features caused an anomaly detector to detect an anomaly. During unsupervised generation of a new coalition, a first feature is randomly selected from features in a dataset. Which additional features in the dataset can join the coalition, because they have mutual information with the first feature that exceeds a threshold, is detected. For each feature that is not in the coalition, values of the feature are permuted in imperfect copies of original tuples in the dataset. An average anomaly score of the imperfect copies is measured. Based on the average anomaly score of the imperfect copies, a local explanation is generated that references (e.g. defines) the coalition.

Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

Abstract: Systems and methods for implementing extensible attributes in ETL are disclosed. In some examples, attributes configured at a source file may be extracted from the source file. The extracted attributes can be mapped to a target column of a data warehouse table, and then a dynamic ETL script may be generated. The dynamic script may be executed to move data associated with the attributes to an appropriate new column of the data warehouse.

Abstract: In accordance with an embodiment, described herein are systems and methods for use with an analytic applications environment, for determination of recommendations and alerts in such environments. A data pipeline or process can operate in accordance with an analytic applications schema adapted to address particular analytics use cases or best practices, to receive data from a customer's (tenant's) enterprise software application or data environment, for loading into a data warehouse instance. When provided as part of a software-as-a-service (SaaS) or cloud environment, the data sourced from a plurality of organizations can be aggregated, to leverage information gleaned from the collective or shared data. The system can be used to generate semantic alerts, including obtaining permission from; and analyzing the collective data of; the plurality of organizations, to determine operational advantages indicated by the data, and providing alerts associated with those operational advantages.

Abstract: Systems and methods for using queue pair 1 (QP1) for receiving multicast based announcements in multiple partitions in a high performance computing. In accordance with an embodiment, by extending the scope of QP1 to also include receiving and sending multicast packets in any partition defined for the port, it is possible to implement generic MC based announcement and discovery without requiring the complexity of unique QPs for individual partitions, nor any update of QP configuration as a consequence of change of partition membership.

Abstract: The present embodiments relate to implementing change data on no-master NoSQL data stores. An optimized node can be identified from a plurality of NoSQL data storage nodes and a specialized node can be connected (e.g., collocated) to the optimized node. The specialized node can maintain change data capture (CDC) data provided by client nodes in a hash map that can be used as a point of truth for coordinating CDC data across the plurality of NoSQL data storage nodes. The plurality of NoSQL data storage nodes can identify and coordinate all read/write data obtained from multiple client devices in a geographically separated large-scale (e.g., planet scale) system to identify change data in a distributed data store. The specialized data can provide read data to devices in the large-scale system to reconcile inconsistencies in change data across nodes in the large-scale system.

Abstract: Techniques are disclosed for applying a trained machine learning model to incoming voice communications to determine whether the voice communications are genuine or not genuine. The trained machine learning model may identify vocal attributes within the target call and use the identified attributes, and the training, determine whether the target call is genuine or not genuine. An applied trained machine learning model may include multiple different types of trained machine learning models, where each of different types of machine learning models is trained and/or configured for a different function within the analysis.

Abstract: A distributed computing system is described that leverages a nearline storage layer to minimize the downtime required for bootstrapping a new computing cluster in the distributed computing system. The system executes a computing cluster comprising a set of computing nodes and determines a set of one or more data segments to be written to a nearline storage system. The system writes the data segments to the nearline storage system. In certain examples, the system receives a request to create a second computing cluster and responsive to the request, bootstraps the second computing cluster using the set of data segments stored on the nearline storage system. The system additionally leverages the nearline storage layer to accelerate query processing by the computing nodes of a computing cluster.

Abstract: A type restriction contextually modifies an existing type descriptor. The type restriction is imposed on a data structure to restrict the values that are assumable by the data structure. The type restriction does not cancel or otherwise override the effect of the existing type descriptor on the data structure. Rather the type restriction may declare that a value of the data structure's type is forbidden for the data structure. Additionally or alternatively, the type restriction may declare that an element count allowable for a data structure's type is forbidden for the data structure. Type restriction allows optionality (where only a singleton value for a data structure is allowed), empty sets (where no value for a data structure is allowed), and multiplicity (where only a limited element count for a data structure) to be injected into a code set independent of data type. Type restriction allows certain optimizations to be performed.

Abstract: Systems, methods, and other embodiments for sorting-based assignment to optimize order fulfillment with short supply. One embodiment includes identifying a set of one or more distributions within a series of days. Sorting all demands of a first priority level occurring in the series of days by ascending order of size of the demand. For each demand of the first priority level in sorted order, (a) selecting an initial distribution during which the demand is scheduled to be fulfilled from the set of distributions, and (b) generating an indication that the demand can cannot be completely fulfilled, based on the size of the demand and the amount of supply available. Automatically arranging a graphical representation of a schedule of supplies and met and unmet demands for the series of days in a graphical user interface based at least on the indications generated for each demand.

Abstract: Techniques for processing top-K queries are provided. In one technique, a database statement is received that requests top-K results related to a database object and that indicates two columns thereof: a first column by which to partition a result set and a second column by which to order the result set. A buffer is generated. For each of multiple rows in the database object: a first key value that associated with a first value in the first column of said each row is identified; a second key value that associated with a second value in the second column of said each entry is identified; a slot in the buffer is identified based on the first key value and the second key value; and the slot in the buffer may be updated based on the second key value. A response to the database statement is generated based on the buffer.