Abstract: A computer system identifies a platform that corresponds to a first resource, wherein the first resource includes one or more resource pages. The computer system determines one or more x-paths that corresponds to the identified platform. The computer system utilizes at least a first x-path of the one or more x-paths to add a product to a digital shopping cart associated with the first resource. In response to adding the product to the digital shopping cart associated with the first resource, the computer system utilizes at least a second x-path of the one or more x-paths to access a first resource page of the one or more resource pages, wherein the first resource page is a checkout page. The computer system determines whether one or more elements located within the first resource page are valid.

Abstract: Systems and methods for query generation based on merger of subqueries are described. For example, methods may include accessing a first join graph representing tables in a database, wherein the first join graph has vertices corresponding to respective tables in the database and directed edges corresponding to join relationships; receiving a first query specification that references data in two or more of the tables of the database to specify multiple subqueries in a set of subqueries; checking that two or more subqueries from the set of subqueries have the same join graph; checking that the two or more subqueries have the same set of grouping columns; responsive, at least in part, to the two or more subqueries having the same join graph and the same set of grouping columns, merging the two or more subqueries to obtain a consolidated query.

Abstract: Techniques for generating an interactive visualization tool for building nested queries are disclosed. The interactive nested query visualization tool allows a user to observe, analyze, and modify query characteristics and attributes of a set of nested queries. A system displays an interactive visual depiction of a set of nested queries. Visual representations of the nested queries are positioned relative to each other based on the relationships between the nested queries. The system displays, simultaneously with the set of nested queries, editable fields for a selected query. The system modifies a functionality of a user interface based on which of the nested queries is selected.

Abstract: A method for processing data for discovering a new drug candidate substance by a data processing apparatus includes receiving at least some of omics levels that make up omics through a user interface, receiving at least some types of mutual association degrees among a plurality of types of mutual association degrees, selecting a DB for the at least some of the omics levels and a DB for the at least some types of mutual association from an omics DB including data for each omics level and data for each type of mutual association, generating a first matrix composed of the DB for the at least some of the omics levels and the DB for the at least some types of mutual association degrees, receiving a predetermined search word through the user interface, extracting a plurality of biological entities, and generating a multi-omics network in which a plurality of nodes.

Abstract: Systems, methods, computing platforms, and storage media for decomposing data are disclosed. Exemplary implementations may receive an input data set, identify a first set of criteria for analyzing the input data set, identify a first and a second data subset, wherein the first and second data subset are defined by a first and a second set of filters, respectively, identify a first set of parent sets, each parent set being a subset of the input data set and a superset of the second data subset, and each parent set being defined by a subset of the second set of filters that define the second data subset, generate a directed acyclic graph based at least in part on identifying the first set of parent sets, the first data subset, and/or the second data subset, and display, via a user interface, the directed acyclic graph to a user.

Abstract: In some embodiments, a method receives a sequence of subsidiary features that are associated with a sequence of main features. A subsidiary feature provides subsidiary information for a main feature. A sequence of first weights for the sequence of subsidiary features is generates where a first weight in the sequence of first weights is generated based on a respective subsidiary feature. The method processes the sequence of first weights to generate a sequence of second weights. The processing uses relationships in the sequence of first weights to generate values of the second weights. The method uses the sequence of second weights to process the sequence of main features to generate an output for the sequence of main features.

Abstract: A computer-implemented method of partitioning a blockchain network into shards is disclosed. The method comprises the steps of identifying a transaction id of a blockchain transaction and allocating the transaction to a shard based on the transaction id.

Abstract: A database session in an active standby server on which an active standby database resides receives a DML statement. The session is suspended while the statement is redirected over a database link to a primary database on which the statement is executed. Information associated with execution of the statement is communicated to the session in the active standby server. Redo records describing changes to the contents of the primary database are applied to the active standby database and control is returned to the session. Prior to commitment of a transaction including the statement, a query directed to data to which the statement was directed is received at the active standby server from a client and executed on the active standby database absent use of a database link based on whether information associated with a database session associated with the client matches the information associated with execution of the statement.

Abstract: Systems and methods for scoring potential actions are disclosed. An example method may be performed by one or more processors of a system and include training a machine learning model based at least in part on a sequential database and retention data, identifying an action subsequence executed by a user, generating, for each of a plurality of potential actions, using the machine learning model, a first value indicating a probability that the user will execute the potential action immediately after executing the action subsequence, a second value indicating a probability that the user will continue to use the system if the user executes the potential action immediately after executing the action subsequence, and a confidence score indicating a likelihood that recommending the potential action to the user will result in the user continuing to use the system, the confidence score generated based on the first value and the second value.

Abstract: Operations and Maintenance Design drawing maintenance, As-Built drawing conformance, and Record drawing conformance processes for protecting the integrity of dynamically modified files through all phases of a drawing's lifecycle.

Abstract: Systems, methods, and devices for incrementally refreshing a materialized view are disclosed. A method includes generating a materialized view based on a source table. The method includes merging the source table and the materialized view to generate a merged table to identify whether an update has been executed on the source table that is not reflected in the materialized view. The method includes, in response to detecting an update made to the source table that is not reflected in the materialized view, applying the update to the materialized view.

Abstract: In one embodiment, a method includes generating a subgraph from a dependency graph. The subgraph includes one or more potential paths between an event interest node and an event generator node of the dependency graph. The method also includes activating the event interest node and assigning, in response to activating the event interest node, a color to nodes along the one or more potential paths of the subgraph from the event interest node to the event generator node. The method further includes modifying the event generator node and modifying, in response to modifying the event generator node, one or more of the nodes along the one or more potential paths of the subgraph from the event generator node to the event interest node.

Abstract: Systems, methods, and computer program products for identifying a candidate product in an electronic marketplace based on a visual comparison between candidate product image visual content and input query image visual content. Embodiments generate and store descriptive image signatures from candidate product images or selected portions of such images. A subsequently calculated visual similarity measure serves as a visual search result score for the candidate product in comparison to an input query image. Any number of images of any number of candidate products may be analyzed, such as for items available for sale in an online marketplace. Image analysis results are stored in a database and made available for subsequent automated on-demand visual comparisons to an input query image. The embodiments enable substantially real time visual based product searching of a potentially vast catalog of items.

Abstract: Systems and methods are described for a streaming data processing system that defers processing of some data based on a determined importance of the data. A streaming data processing system can ingest a data stream that contains multiple events, and can extract data field values from individual events and process the data field values to determine event importance. The streaming data processing system can then do further processing and indexing of high importance events, and can generate a storage prefix for each low importance event that determines where to store the low importance event in a data storage system. The streaming data processing system can then process queries by retrieving the indexed high importance events, and can extract the data field values from a high importance event to determine the storage prefix for retrieving corresponding low importance events from the data storage system.

Abstract: An intelligent scanner device configured to facilitate improved accuracy for storage of scanned documentation. The scanner device may include an image processor, an identification engine, and a metadata engine. The scanner device may utilize artificial intelligence processes to generate metadata information to be stored with scanned documents.

Abstract: A server apparatus which transmits, to a plurality of other server apparatuses each of which performs subject recognition for an image, an image acquired from a client terminal and requests the plurality of other server apparatuses to perform subject recognition receives a result of subject recognition from each of the plurality of other server apparatuses, transmits, to the client terminal, subject information to be appended to metadata of the image based on the received result of subject recognition, and performs control to switch whether to, each time a result of subject recognition is received from each of the plurality of other server apparatuses, transmit, to the client terminal, subject information that is based on the received result of subject recognition or to transmit, to the client terminal, subject information that is based on a result obtained by integrating results of subject recognition received from the plurality of other server apparatuses.

Abstract: Method for encoding a query graph into a sequence representation includes receiving a set of m×n path queries representing a query graph, the query graph having a plurality of nodes including m root nodes and n leaf nodes, wherein m and n are integer values, each of the m×n path queries beginning with a root node and ending with a leaf node, and encoding positions of each node and each edge between nodes within each of the m×n path queries independently, wherein the encoded positions include a positional order within each path query. The positional encodings may include no positional ordering between different path queries. The query graph may include one or more missing entities and each token representing one of the one or more missing entities may be masked to produce a masked sequential query, which may be fed to a transformer encoder.

Abstract: Systems, methods, and computer program products for identifying a candidate product in an electronic marketplace based on a visual comparison between candidate product image visual content and input query image visual content. Embodiments generate and store descriptive image signatures from candidate product images or selected portions of such images. A subsequently calculated visual similarity measure serves as a visual search result score for the candidate product in comparison to an input query image. Any number of images of any number of candidate products may be analyzed, such as for items available for sale in an online marketplace. Image analysis results are stored in a database and made available for subsequent automated on-demand visual comparisons to an input query image. The embodiments enable substantially real time visual based product searching of a potentially vast catalog of items.

Abstract: In accordance with an embodiment, described herein are systems and methods that enable client-side calculation with data provided at a multidimensional or other database server. Data provided at the server in accordance with a server-side model, can be transformed/prepared into a grid, for use with a client-side application, for example a client spreadsheet application. During preparation of the grid, one or more portions of the grid that are identified as client-side dynamic parameters, can be represented as dynamic formulas that are modifiable within the client-side application; while parameters of the server-side model that are outside of the grid can be represented as constant values. The grid provided to the client can be used to perform client-side calculations that allow for rapid calculations in response to changes in the client-side model, without introducing a round-trip performance lag between the client-side and server-side.

Abstract: Some embodiments provide a program that queries a database for a subset of a plurality of records in the database. Each record in the plurality of records includes a value for a field. The program further samples the subset of the plurality of records to identify a set of records in the subset of the plurality of records. The program also sorts the set of records based on the value for the field in each record in the set of records. The program further determines a first value for the field of a first record in the sorted set of records and a second value for the field of a second record in the sorted set of records forms a slope that is greater than or equal to a defined slope. The program determines a threshold value for the subset of the plurality of records based on the first record.