Abstract: The disclosed embodiments include systems and methods for tracing data. A disclosed tracing system can receive a request to access original data. The request can be associated with access request metadata. The tracing system can generate a tracer based at least in part on the access request metadata and can generate an altered version of the first data by inserting the tracer into the original data. The tracing system can update a database or log file associated with the first data to include association information based on the access request metadata. The tracing system can then provide the altered version of the first data in response to the request.

Abstract: An image processing system, method, and apparatus are provided and pertain to the field of information technologies. The method includes receiving an image processing instruction sent by a data source manager, the image processing instruction triggered by an application client and instructing to process an image obtained by an image input device corresponding to a general-purpose data source; processing, according to the image processing instruction, the image obtained by the image input device; and sending a processing result to the data source manager. According to the application, the general-purpose data source processes the image obtained by the image input device, thereby avoiding a problem that the image obtained by the image input device cannot be processed because the image input device does not provide a data source.

Abstract: Systems and methods for file archiving. The systems may obtain an image file to be transmitted that includes image data in a first format and a metadata file in a second format. The metadata file may include identification information of the image data. The image data may be acquired from a scan of a subject using an imaging device. The systems may transmit, according to a first protocol, the image data in the first format to an image archiving system for archiving. The systems may also transmit, according to a second protocol, the metadata file in the second format to the image archiving system for archiving.

Abstract: The present disclosure relates to systems and methods for parsing unstructured data with neural networks. In one implementation, a system for parsing unstructured data may include at least one processor and at least one non-transitory memory storing instructions that, when executed by the at least one processor, cause the system to: receive unstructured data; apply a classifier to the unstructured data to identify a type of the unstructured data; based on the identification, select a corresponding neural network; apply the selected neural network to the unstructured data to obtain structured data; and output the structured data.

Abstract: A systems 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 acts of: receiving a query image comprising at least one target object and at least one candidate image; generating a plurality of proposals based on the at least one candidate image; selecting a portion of the plurality of proposals to produce a reduced proposal set; generating a query embedding corresponding to the query image; generating candidate embeddings corresponding to the portion of the plurality of proposals included in the reduced proposal set; computing similarity scores for the portion of the plurality of proposals; and comparing the similarity scores to a threshold to determine if the at least one candidate image comprises the at least one target object. Other embodiments are disclosed herein.

Abstract: A device configured to identify a file in a network device, to generate a first set of block hash codes for data blocks for a first instance of the file, and to generate a second set of block hash codes for data blocks for a second instance of the file. The device is further configured to determine the first set of block hash codes matches the second set of block hash codes and to generate an entry in a file list for the instances of the file. The device is further configured to count the number of entries that are associated with the file and to determine the number of entries is greater than the redundancy threshold value. The device is further configured to delete one or more instances of the file in response to determining that the number of entries is greater than the redundancy threshold value.

Abstract: Systems and methods are provided for determining multiple fragments of data to be imported, the multiple fragments of data corresponding to different instances of data obtained from one or more external data sources, the different instances of data each corresponding to duplicate content. The multiple fragments of data that each correspond to different instances of duplicate content can be ingested. The multiple fragments of data can be de-duplicated to determine one or more corresponding object data source records (DSRs). The one or more object DSRs can be imported within a data platform system.

Abstract: Methods, systems and computer program products are provided for query understanding. A non-focused query quantifier generates non-focused query features that quantify a non-focused query and a non-focused query predictor generates a prediction associated with the non-focused query based on the non-focused query features.

Abstract: First and second trees having entities identified by hexadecimal values are generated. First files are allocated across the first tree based on hashes of the first files and hexadecimal values of the first tree entities. First index values are calculated for first tree entities using hashes of the first files that have been allocated to entities branching into a lower level of the first tree. Second files are allocated across the second tree based on hashes of the second files and hexadecimal values of the second tree entities. Second index values are calculated for the second tree entities using hashes of the second files that have been allocated to entities branching into a lower level of the second tree. A determination is made of a number of entities between the first and second trees having matching index values to measure similarity between the first and second trees.

Abstract: Systems and methods for performing data analytics on sensitive data, such as deduplication are disclosed herein. A first request to perform a first data analytics operation for a set of sensitive data instances may be received. A first set of image representations for the set of sensitive data instances may be retrieved. A first sensitive data instance and a second sensitive data instance may be clustered into a first cluster. The first data analytics operation may be performed on the first cluster.

Abstract: The present disclosure may be directed to systems and methods for managing and monitoring services and modules. The system may include receiving, from a user device, a request to perform a test on a target application programming interface; calling the target application programming interface; and retrieving a search result page associated with the target application programming interface. The system may include retrieving a rule based on the target application programming interface and applying the rule to the retrieved search result page associated with the target application programming interface. The system may include determining whether to implement the target application programming interface based on the results of the applied rule.

Abstract: Technologies for detecting changes in a namespace using namespace enumeration endpoint response payloads are disclosed. A namespace is enumerated at a first time by retrieving response payloads containing metadata describing each location in the namespace from a namespace enumeration endpoint. Signatures are generated based on the response payloads and stored. To determine if changes were made to the namespace between the first time and a subsequent second time, metadata is retrieved from the namespace enumeration endpoint for the namespace at the second time and signatures are generated. Signatures generated at the first time are then compared to the signatures generated at the second time. If the signatures are different, the items in the location in the namespace changed between the first time and the second time. Changes occurring in a location of the namespace can then be identified based on the metadata obtained at the first and second times.

Abstract: Various embodiments provide a so-called companion experience in which content consumed on a primary screen can serve as a source for an automatic search that returns related content that can be presented on an auxiliary screen. The companion experience can be considered to reside in a layer that can be moved across different screens. The different screens can include different physical screens, such as those associated with different computing devices, or the same physical screen in which the companion experience would be rendered in a frame or sub-window.

Abstract: Systems and methods are described for automatically organizing application shortcuts into folders with user-defined names. An illustrative method includes identifying a plurality of keywords associated with folders with user-defined names on a device, identifying a keyword associated with an application being installed on the device, determining whether the keyword associated with the application matches a keyword in the plurality of keywords, and in response to determining that the keyword associated with the application matches a keyword in the plurality of keywords, adding a shortcut for the application to a folder with a user-defined name corresponding to the matching keyword.

Abstract: Embodiments of this application disclose a chunking method and an apparatus for implementing the method. According to the method provided in the embodiments of this application, a first data segment of a first length may be determined starting from a header of a to-be-chunked data flow, a data distribution characteristic of the first data segment is determined based on character values of all characters in the first data segment, and then a chunking position is determined for different data distribution characteristics by using different methods. In this way, a data flow can be better chunked, so as to enhance a deduplication effect.

Abstract: A computerized method is disclosed for storing data using a persistent queue. The computerized method includes operations of obtaining machine data from a remote electronic device, providing the machine data to a persistent queue component, wherein the persistent queue component organizes the machine data for storage on a first data store and storing a copy of the organized machine data in the first data store, and responsive to completion of the storing of the copy of the organized machine data. Further operations include transmitting an acknowledgement communication to the remote electronic device indicating storage of the copy of the machine data in the first data store, processing the machine data for storage, and responsive to completion of the storing of the processed machine data in a second data store, deleting the copy of the machine data from the first data store. The persistent queue component may include a socket server.

Abstract: Disclosed are methods and systems for managing file revisions, including revisions of a document. The system may compare various file versions (e.g., revised documents having revisions to a master document from multiple users) with a reference file (e.g., a master document) to obtain the changes (e.g., revisions) in each file version. The system may present the changes from each of the users in a merge interface from which a user may selectively accept or reject the changes from any of the users to update the reference file.

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.