Abstract: Techniques for generating a dataflow graph include generating a first dataflow graph with a plurality of first nodes representing first computer operations in processing data, with at least one of the first computer operations being a declarative operation that specifies one or more characteristics of one or more results of processing of data, and transforming the first dataflow graph into a second dataflow graph for processing data in accordance with the first computer operations, the second dataflow graph including a plurality of second nodes representing second computer operations, with at least one of the second nodes representing one or more imperative operations that implement the logic specified by the declarative operation, where the one or more imperative operations are unrepresented by the first nodes in the first dataflow graph.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient address spaces are distributed across the plurality of storage devices such that each of the plurality of failure resilient address spaces spans a plurality of the storage devices. The plurality of computing devices maintains metadata that maps each failure resilient address space to one of the plurality of computing devices. The metadata is grouped into buckets. Each bucket is stored in the backend of a computing device. Data may be migrated from an external file system to the plurality of storage devices using inode stubs to represent directories and files of the external file system. As the contents of the external file system are copied, the inode stubs are replaced with real inodes.

Abstract: Techniques are described to support shared applications, including a shared application that permits retrieval, presentation and traversal of information resources. The innovative techniques enable multiple participants at different locations to both see and interact with assets such as a web-based content. The innovative techniques centralize the functionality of an application that is to be shared. A shared application is executed, during a collaboration, at a centralized location in a manner that does not require any local resources to create an application instance.

Abstract: Systems, methods, and computer-readable and executable instructions are provided for providing a device agnostic active/active data center. Providing a device agnostic active/active data center can include receiving user communication assigned from a content delivery network (CDN) provider. In addition, providing a device agnostic active/active data center can include determining a designated database for the user communication. Furthermore, providing a device agnostic active/active data center can include assigning a destination address to the designated database for the user communication.

Abstract: Methods and systems for identifying a meaning of an ambiguous term in a natural language query. The media guidance application isolates first and second terms from a query received from a user and identifies, in a knowledge graph, first and second pluralities of candidate components associated with the first and second terms. The first and second terms each having multiple candidate components indicates the first and second terms have ambiguous meanings. The media guidance application matches each candidate component of the first and second pluralities of candidate components to form a plurality of pairs and determines strength of association for each pair in the plurality of pairs. The media guidance application filters the plurality of pairs by strength of association for each pair and determines a plurality of possible meanings based on the filtered plurality of pairs. The media guidance application selects a meaning from the plurality of possible meanings.

Abstract: A system for enforcing projection constraints on data values stored in specified variables of a shared dataset of a cloud data platform. A request is received from a first account of the cloud data platform that identifies a first operation to be performed on the shared dataset. A first set of data, including data accessed from a first variable, is accessed from the shared dataset to use in performing the first operation. A projection constraint policy attached to the first variable of the shared dataset is determined, and the projection constraint policy is further determined to be enforced based on the request. Based on the first set of data and the first operation, an output to the first request is generated.

Abstract: In some embodiments, techniques are provided for conducting similarity-based searches using DNA. In some embodiments, sets of features that represent stored data sets are encoded in DNA sequences such that a hybridization yield between a molecule having a given stored DNA sequence and a molecule having a reverse complement of a DNA sequence that encodes a set of features that represent a query data set reflects an amount of similarity between the set of features that represent the query data set and the set of features encoded in the given stored DNA sequence. In some embodiments, machine learning techniques are used to determine the DNA sequence encoding. In some embodiments, machine learning techniques are used to predict hybridization yields between DNA molecules.

Abstract: Presented herein are embodiments of a fast search on graph methodology for Maximum Inner Product Search (MIPS). This optimization problem is challenging since traditional Approximate Nearest Neighbor (ANN) search methods may not perform efficiently in the nonmetric similarity measure. Embodiments herein are based on the property that a Möbius/Möbius-like transformation introduces an isomorphism between a subgraph of 2-Delaunay graph and Delaunay graph for inner product. Under this observation, embodiments of a novel graph indexing and searching methodology are presented to find the optimal solution with the largest inner product with the query. Experiments show significant improvements compared to existing methods.

Abstract: Provided herein are systems and methods for replicating share objects to remote deployments. An example method includes generating, at a second deployment in a data exchange, a replica of a share object included in a first deployment of the data exchange. The share object grants privileges to a first account to access a first database of the first deployment, wherein the first database comprises a database object. The method also includes retrieving, at the first deployment, share grant metadata from the share object of the first deployment, wherein the share grant metadata includes a reference to the database object and allows the first account to use the database object. The method also includes transmitting a message comprising the share grant metadata to the replica in the second deployment. The share grant metadata in the replica allows a second account to use the database object replicated in the second deployment.

Abstract: A method for combining multiple interactions into a single record entry is disclosed. A data package can be created that represents a set of interactions, and each entity associated with an interaction can review the data package. Each entity can indicate agreement with the interactions by digitally signing the data package. Once signed by each involved entity, the data package can be stored in a record such as a blockchain.

Abstract: Embodiments of the present disclosure provide a method, system and computer program product for single view presentation of multiple query. In an embodiment of the disclosure, a method for single view presentation of multiple query includes directing a query against a database along a selected dimension of multiple different elements. In response, a primary result set is received. The result set is then organized into a tabular view of cells according to the selected dimension and values for the selected dimension. Thereafter, a set of nested queries may be directed for each of the elements in the selected dimension against the result set utilizing a different dimension. In response to each directed set of nested queries, a corresponding result set is thus received. Finally, each corresponding result set is inserted into a cell associated with a common one of the elements.

Abstract: Systems and methods of inferential user matching include inferring an interest in matching between the first user and the second user based at least in part on a first profile of a first user and a second profile of a second user. Based at least in part on the inferred interest in matching, the systems and methods match the first user and the second user for a service, and transmit (i) a first representation of the first user to a portable device of the second user, and (ii) a second representation of the second user to a portable device of the first user.

Abstract: To provide a trusted, secure, and immutable record of transactions within a process plant, techniques are described for utilizing a distributed ledger in process control systems. The distributed ledger may be maintained by nodes which receive transactions broadcasted from field devices, controllers, operator workstations, or other devices operating within the process plant. The transactions may include process plant data, such as process parameter data, product parameter data, configuration data, user interaction data, maintenance data, commissioning data, plant network data, and product tracking data. The distributed ledgers may also be utilized to execute smart contracts to allow machines such as field devices to transact by themselves without human intervention. In this manner, recorded process parameter values and product parameter values may be retrieved to verify the quality of products.

Abstract: A search query relating to a search for people and including one or more search terms is received. A search graph for the search is created from a previously created graph which is a directional graph in which people are represented by nodes and content is represented by nodes or edges. The search graph is generated by filtering out nodes or edges that represent content that is determined not to be relevant to the search terms in the search query; and, for the remaining content that is determined to be relevant to the search terms in the search query, adding to the graph a measure of the relevance of the content to the search terms. The search results are generated by operating on the search graph to identify people in the search graph who are sources of content that is relevant to the search terms.

Abstract: A computer-implemented method includes receiving information expressing a user's interest in one or more media programs, obtaining information indicative of popularity for a plurality of media programs responsive to the received information by individuals other than the user, and transmitting one or more recommendations of media programs for display to the user, from the plurality of media programs that relate to the received information.

Abstract: A constraint system enforces projection constraints on data values stored in specified columns of a shared dataset when queries are received by a database system. A projection constraint identifies that the data in a column may be restricted from being projected (e.g., presented, read, outputted) in an output to a received query, while allowing specified operations to be performed on the data and a corresponding output to be provided. For example, the projection constraint may indicate a context for a query that triggers the constraint, such as based on the user that submitted the query. Enforcing projection constraints on queries received at the database system allows for data to be shared and used anonymously by entities to perform various operations without the need to tokenize the data.

Abstract: Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.

Abstract: A method is performed at a server system having one or more processors and memory storing instructions for execution by the one or more processors. The server system provides a content service. The method includes providing a first media item for playback based on a request from an application executing on an electronic device. The method includes receiving data associated with a behavior of a first user of the content service. The data associated with the behavior of the first user includes an indication of at least a first user input for controlling the playback of the first media item. The method includes using the received data to provide a media recommendation to the electronic device.

Abstract: Systems and methods are provided for master-to-master OT-based artifact peering. A “master-to-master” architecture for artifacts is implemented in a network comprising a plurality of nodes and clients, where no node is designated a “master” or “primary” for a given artifact. A first node receives a subset of remote proposed operations from a second node and determines if a conflict exists between the received subset of remote proposed operations and at least one of a plurality of locally-proposed operations. The first node resolves the conflict based on a total-ordering agreed upon between the first node and the second node. The first node transforms at least one operation, either received or locally-proposed, based on the resolved conflict. The first node than updates a local log to include the transformed operation.

Abstract: Automatic finding of online profiles of an entity location is disclosed. Reference location data for location attributes of an entity location are obtained. A search for a profile of the entity location on a source is performed using at least some of the obtained reference location data. One or more search results are obtained. A search result includes a Uniform Resource Locator (URL) and corresponding search result location data. The search result is evaluated. Evaluating the search result includes normalizing the search result location data included with the search result and comparing the normalized search result location data against the reference location data. Based at least in part on the evaluation, it is determined whether the search result matches to a profile of the entity location on the source. In the event that the search result matches to a profile of the entity location on the source, the search result is provided as output.