Abstract: Multiple sets of documents for different domains may be used to train multiple domain-specific models. A graph model may be generated to include nodes representing concepts included within the domain-specific models. A white space not including any nodes within the graph model may be identified. Analysis of the white space may be performed based on two or more nodes at periphery of the white space. Words/documents that cover the white space may be generated. Novelty of concepts may be readily assessed using the graph model/white space.

Abstract: An enterprise resource planning system server comprising a SQL database and an executing module to execute an SQL query according to an execution plan to generate execution data relative to the execution of each SQL query; a monitoring module to determine an estimated execution plan metric associated with executing the SQL query according to the execution plan, and to determine whether a hardware performance metric associated with executing the query plan exceeds a hardware performance metric threshold. The monitoring module also determines whether the SQL query is invalid by comparing an execution plan metric associated with executing the execution plan with the estimated execution plan metric in response to determining that the server performance metric exceeds the server performance metric threshold.

Abstract: Disclosed are methods, systems, and non-transitory computer-readable medium for context development. For instance, a first method may include obtaining first micro-application actor information associated with a first micro-application actor. The first micro-application actor information may include information for workflow rules, and the workflow rules may include data set rules, extract, transform, load (ETL) rules, and functional expressions. The first method may further include obtaining data from data sources based on the data set rules; applying the ETL rules to the obtained data to generate processed data; applying the functional expressions to the processed data to obtain an output; and performing at least one processing action based on the output. A second method may include generating a system component corresponding to a blueprint based on a user request; associating the system component with a domain of a user account; and performing processes associated the system component.

Abstract: A method, apparatus, and computer-readable medium are described that provide integrated testing and validation of multi-phase instructions before deployment. Aspects of the disclosure relate to testing ETL instructions using an efficient process that individually and/or holistically validates the ETL instructions and, using a random number generator, varies various aspects of the source datasets. A benefit of running the combination of instructions includes finding errors that are not apparent during testing of each instruction phase separately. Instructions may be separately provided that identify the framework of an in-memory source dataset (e.g., a quantity of rows, a quantity of columns, types of the various columns, data for each record, and the like). The instructions for the framework may also identify a variability of one or more of the items of the framework.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform receiving a search request from an electronic device of a user; determining a first number of one or more first results for the search request and a second number of one or more second results for the search request; generating a pagination query using the first number of the one or more first results and the second number of the one or more second results; coordinating a search of one or more databases of records using the pagination query; and coordinating displaying one or more search result pages based on the search of the one or more databases of records, the one or more search result pages comprising at least one of the one or more first results and at least one of the one or more second results. Other embodiments are disclosed herein.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a lock-free read access to one or more data structures. An embodiment operates by allocating a first portion of a memory corresponding to a first data structure of the one or more data structures, the first data structure comprising a size. The embodiment then performs a first operation associated with the first data structure. The embodiment then receives a first request to insert second data to the first data structure, and determines whether an increase of the size is to be executed. The embodiment then, based on the determination that an increase of the size is to be executed, inserting the second data to a modified first data structure, comprising: executing garbage collection to free-up the first portion of the memory based on at least one parallel operation associated with the first data structure.

Abstract: Fulfillment guidance devices, systems, and methods are disclosed herein. An example device includes a memory; a communications interface; and a processor to: obtain, from a location tracking system deployed in a facility containing items of a plurality of item types, current locations for each of the items; select a subset of the items having a common type, and satisfying a proximity criterion; generate and store, in the memory, an item cluster definition having a type indicator corresponding to the common type, a count of items in the subset, and a single cluster location derived from the current locations of the items in the subset; obtain an item request including one of the item types; determine that the one of the item types matches the type indicator of the cluster definition; responsive to the determination, send at least a portion of the cluster definition to a mobile device within the facility.

Abstract: There is provided a method of using a bitmap filter to filter a data source as part of a join operation. A set bit at a bit location of the bitmap filter is associated with an entry of the data source that comprises an identifier that matches a filter parameter. A row identifier of a row in another data source that corresponds to the identifier is determined based on a sum of a number of bits set in bit locations that are between the bit location of the set bit associated with the entry of the data source and a bit location in the bitmap filter corresponding to a different, known, row identifier of a different row in the another data source. The row of the another data source corresponding to the determined row identifier is interrogated to obtain information defining the identifier that matches the filter parameter.

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: 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.