Abstract: An image retrieval system that enables high-accuracy image retrieval in a short time is provided. The image retrieval system includes a processing portion provided with a neural network. The neural network includes a layer provided with a neuron. The processing portion has a function of comparing query image data with a plurality of pieces of database image data, and extracting the database image data including an area with a high degree of correspondence to the query image data as extracted image data. The processing portion has a function of extracting data of the area with a high degree of correspondence to the query image data from the extracted image data, as partial image data. The layer has a function of outputting an output value corresponding to the features of the image data input to the neural network.

Abstract: A method including receiving an input and embedding the input into a first data structure that defines first relationships among images and texts. The method also includes comparing the first data structure to an index including a second data structure that defines second relationships among pre-determined texts and pre-determined images. The method also includes returning a subset of images from the pre-determined images. The subset includes those images in the pre-determined images for which matches exist between the first relationships and the second relationships.

Abstract: Technologies are described for retrieving documents using image representations in the documents and is based on intra-image features. The identification of elements within an image representation can allow for deeper understanding of the image representation and for better relating image representations based on their intra-image features. The intra-image features present in image representations can be used in searches. Search results can further be reranked to improve search results. For example, reranking can allow search results to conform to intra-image dominant image features.

Abstract: In one example method, a second memory stores data in a database, and the second memory is a memory independent of a first device and a second device. When determining that a database service needs to be switched, the first device may migrate a redo log of the database from a first memory of the first device to the second memory. The second device migrates the redo log from the second memory to a third memory of the second device, and the first device and the second device perform operating system status migration online.

Abstract: A method for retrieving an image is provided. The method comprises: acquiring a first matrix obtained by performing feature extraction on a sketch of a target item; acquiring a second matrix composed of word vectors of keywords in a keyword set corresponding to the target item; acquiring a third matrix set obtained by performing feature extractions on images in an image set respectively; determining, for a third matrix in the third matrix set, a comprehensive matching degree between an item presented in an image corresponding to the third matrix and the target item, based on a first matching degree between the first matrix and the third matrix and a second matching degree between the second matrix and the third matrix; and selecting a preset number of images from the image set based on the determined comprehensive matching degrees, and sending the selected images.

Abstract: A method for managing data replication includes: identifying data being used by an application programming interface (API), in which the data is stored in a source device; tagging the data based on a usage level of the data by the API; obtaining a predicted probability of the usage level of the data; making a first determination that the data is tagged as important data and the predicted probability of the usage level of the data is low; and replicating, based on the first determination, the data from the source device to a target device.

Abstract: A method includes a full node storing a blockchain and being one of a plurality of full nodes forming a blockchain network receiving a message comprising update image data and a smart contract identifier from a first user device. The full node can then determine stored image data associated with the smart contract identifier. The full node can also determine whether or not image comparison data based on received image data and stored image data is consistent with a smart contract associated with the smart contract identifier and can then generate an entry for a block of the blockchain, comprising at least the smart contract identifier, the updated image data, and image comparison data. The full node can generate the block of the blockchain and transmit the block to the plurality of full nodes. The plurality of full nodes respectively verify the block.

Abstract: Aspects described herein may relate to methods, systems, and apparatuses that partitions searchable content and distributes the segments across a plurality of processing nodes, which in turn further sub-partitions the partitions for processing by local search actor in order to increase the speed with which a search request from a user is processed. Processing nodes available to receive partitioned searchable content are registered with an external storage device. The external storage device also maintains a global results collector that compiles results from the partitions of searchable content. Respective local collector actors receive compiled results from local search actors for a processing node and the compiled results are sent to the global results collector for compiling for the plurality of processing nodes. Results of the user search request are then provided to the user.

Abstract: To appropriately update evaluation on an evaluation target based on posts related to an evaluation target from a user. When a reliability of an evaluation information drops equal to or below a threshold related to the reliability of the evaluation information, the evaluation information representing an evaluation on an evaluation target, the reliability representing an index provided to evaluation information when the evaluation information is generated, an evaluation unit 26 of an evaluation device 14 generates evaluation information on the evaluation target again based on post information different from post information used for generating the evaluation information on the evaluation target.

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