Abstract: Methods, systems, and apparatus for receiving a query image, receiving one or more entities that are associated with the query image, identifying, for one or more of the entities, one or more candidate search queries that are pre-associated with the one or more entities, generating a respective relevance score for each of the candidate search queries, selecting, as a representative search query for the query image, a particular candidate search query based at least on the generated respective relevance scores and providing the representative search query for output in response to receiving the query image.

Abstract: A data replication method and a storage system are provided. The method is applied to a storage system including a first storage device and a second storage device. According to the method, after determining replication information, a first storage system determines a first replication sub-information and a second replication sub-information according to the replication information, where the replication information is used to indicate data that needs to be replicated by the first storage system to a second storage system in a current replication task. Then, the first storage device replicates data to the second storage system according to the second replication sub-information, and the second storage device replicates data to the second storage system according to the second replication sub-information.

Abstract: Techniques described herein coordinate inline deduplication among nodes in a storage system. The method includes storing, in a page descriptor ring on a node, data and a fingerprint associated with the data in an entry. The method includes determining that a flushing work set (FWS) has been frozen. The node identifies, in the page descriptor ring, entries associated with the frozen FWS and having fingerprints with a parity associated with the node. The node deduplicates the entries based on a fingerprint database on the node. The node synchronizes deduplication of the frozen FWS with a peer node, so as to receive deduplication results concerning entries having fingerprints with a parity associated with the peer node. The node replaces entries in the page descriptor ring with the deduplication results from the peer node, and flushes entries in the frozen FWS to a storage device.

Abstract: Systems and methods for generating an interference prediction for a target well are disclosed herein. A computing system generates a plurality of interference metrics for a plurality of interference events. For each well, the computing system generates a graph based representation of the well and its neighboring wells. The computing system generates a predictive model using a graph-based model by generating a training data set and learning, by the graph-based model, an interference value for each interference event based on the training data set. The computing system receives, from a client device, a request to generate an interference prediction for a target well. The computing system generates, via the predictive model, an interference metric based on the one or more metrics associated with the target well.

Abstract: One example method includes connecting to a fileserver of a data protection system, initiating, at a client, an operation that is associated with a master pseudofs of the fileserver, creating, at the client, a client-specific pseudofs based upon the master pseudofs, and the client-specific pseudofs includes only those nodes of the master pseudofs that the client is authorized to access, and performing the operation using the client-specific pseudofs.

Abstract: A data structure embodied on a computer-readable medium is disclosed. The data structure may include a database schema for arranging a competition among associated users in a structured query language (SQL) database. The database schema may include a grouping schema and a competition schema. The grouping schema may identify one or more associated contestants. The grouping schema may receive one or more inputs from a host contestant to identify and associate the one or more associated contestants. The competition schema may include a plurality of contests. Each contest may have relational data tables configured to receive selections of songs, albums, and/or artists from the contestants, and reward points based on those selections. The points may be rewarded to each contestant based on their corresponding selections. The sum of the points for each contestant may be accumulated to determine a score. The points may be rewarded based on one or more activity tracking parameters.

Abstract: A data string that includes potentially sensitive information, such as an account number for a payment card, may be evaluated to determine whether or not any portion of the data string encodes a known identifier of sensitive information, such as a known bank identification number (BIN). A fixed number of bytes of the data string may be analyzed using a trie algorithm, in which the value of a first byte is compared with the value of a corresponding first character of the known identifier. A second byte is then compared with a set of values of corresponding second characters, which accompany the first character of the known identifier. Then the value of a third byte of the data string is compared with a set of values of corresponding third values, which accompany the first and second characters of the known identifier. The use of a trie algorithm decreases the length of the search process by several orders of magnitude.

Abstract: The present disclosure provides an integrated circuit chip device and a related product. The integrated circuit chip device includes: a primary processing circuit and a plurality of basic processing circuits. The primary processing circuit or at least one of the plurality of basic processing circuits includes the compression mapping circuits configured to perform compression on each data of a neural network operation. The technical solution provided by the present disclosure has the advantages of a small amount of computations and low power consumption.

Abstract: The present disclosure is directed to systems and methods for performant data matching. Entities maintain large amounts of data and desire to reconcile duplicative records. One way to solve this problem is through data matching. However, standard data matching at the record level can be laborious and inefficient. To remedy these inefficiencies in data matching, the present disclosure describes a system where the token records are tokenized a second time into token sets based on the token records satisfying at least one token set rule. A token set rule may be based on the common presence of multiple tokens in a token record. If multiple token records have the required tokens from the set rule, then those token records can be hashed and rolled-up into the token set (i.e., tokenized a second time into the token set). The token set allows for more efficient data matching.

Abstract: A method may include obtaining data representative of an NNT of a graph-based model that includes multiple components. The multiple components may include multiple neural nodes and at least one connection. The at least one connection may associate two or more of the neural nodes. The method may include displaying the NNT including the multiple components in a GUI via a display screen. The method may include receiving user input effective to indicate that at least one of the components of the NNT is to be modified. The user input may be received via the GUI. The method may include modifying the at least one of the components of the NNT. The at least one of the components may be modified based on the user input. The method may include displaying the NNT that comprises the modification of the at least one of the components via the GUI.

Abstract: A content management system synchronizes content items across client computing systems connected by a network. Each client device has a storage allocation for synchronized shared content items. If the storage allocation for shared content items on a client device is exceeded by the request to add or edit a content item such that it is enlarged, or open a large content item remote to the client device, a client application or the host of content management system selects content items to remove from residence on the client device but keep remotely on content management system. Upon removal of the selected content items, the client application creates shadow items, representing the content item but only containing the metadata of the content item. This creates sufficient space for the initial request to be completed while maintaining user access to all synchronized shared content items.

Abstract: There is provided a method and apparatus for remote differential compression (RDC) and data deduplication. According to embodiments, when a sending device acquires a new target file, the following steps are performed. Initially, Jaccard segmentation is performed, followed by performing identity-based segment deduplication and similarity-based segment deduplication. The transmission of the target file in the deduplicated form to the recipient device is subsequently performed. The recipient device can then rebuild the original target file from the deduplicated form thus replicating the target file at the recipient device with the target file originally present at the sending device.

Abstract: The present invention provides a similarity search engine for a digital visual object (i.e., a digital image that represents a design, graphics, logo, symbols, words, or any combination thereof). The similarity search engine is based on a method that consists of conducting several independent search queries, thus each query examining a different aspect of similarity.

Abstract: A manager file system (MFS) runs as a user space file system. The MFS, implemented using an OS process, exposes a mount point as a communication endpoint to the single process. Mounting, unmounting, and changing configuration of individual database file systems (DBFSs) are done by overloading extended attributes on the mount point. The MFS services all DBFSs mounted at different mount points registered to the single process of the MFS and ensures optimal resource utilization among the DBFSs in the single process while guaranteeing resource isolation. Multiple MFSs may be created to manage sets of DBFSs.

Abstract: Artificial intelligence (AI)-based process identification, extraction, and automation for robotic process automation (RPA) is disclosed. Listeners may be deployed to user computing systems to collect data pertaining to user actions. The data collected by the listeners may then be sent to one or more servers and be stored in a database. This data may be analyzed by AI layers to recognize patterns of user behavioral processes therein. These recognized processes may then be distilled into respective RPA workflows and deployed to automate the processes.

Abstract: The invention relates to a method for documenting at least one work step with a hand-held tool, wherein the hand-held tool has at least one camera mechanically connected to the tool, in which the steps of activating the camera and capturing images of the work step which is performed with the hand-held tool, and the generation of image data pertaining to the work step are provided.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to facilitate electronic data security. An example apparatus includes a data storage including a memory adjusted to store data organized according to a data table including columns identifying a first data record and a first security tag associated with the first data record. In the example apparatus, retrieval of data from the data storage involves a bit operation comparing the first security tag with a first privilege tag. In the example apparatus, the data storage provides the first data record when the bit operation comparing the first security tag with the first privilege tag has a non-zero result, and the data storage does not provide the first data record when the bit operation comparing the first security tag with the first privilege tag has a zero result.

Abstract: The disclosure is for displaying a search result for products. A server may include a communication module, a memory including a database which stores product information in association with one or more product images corresponding to a product and text information related to the product, and a processor.

Abstract: A method may include obtaining data representative of an NNT of a graph-based model that includes multiple components. The multiple components may include multiple neural nodes and at least one connection. The at least one connection may associate two or more of the neural nodes. The method may include displaying the NNT including the multiple components in a GUI via a display screen. The method may include receiving user input effective to indicate that at least one of the components of the NNT is to be modified. The user input may be received via the GUI. The method may include modifying the at least one of the components of the NNT. The at least one of the components may be modified based on the user input. The method may include displaying the NNT that comprises the modification of the at least one of the components via the GUI.

Abstract: A database system could include a first database engine, a second database engine, and a replication engine. The database system could also include processors configured to perform operations. The operations could involve obtaining indicators that are respectively associated with performance issues that can occur in the database system, each indicator defining one or more conditions that, when satisfied, cause the indicator to become active. The operations could also involve obtaining mappings between: (i) at least some of the indicators, and (ii) remediation subroutines.