Abstract: Systems, methods, and apparatuses for automated population of responses into query fields of a form are discussed. The responses are based on data in a networked user data repository maintained by a first party, and the form is presented by a second party. A login request for access to data in the user data repository may be received from a remote computing device. If access to the data in the user data repository is authorized, descriptors for at least one of the query fields may be received, and based on the descriptors, it may be determined whether any responses to any query fields are contained in the user data repository. Query fields may be populated with responses obtained through the data repository. The user provides the second party with information that is made available to the first party without separately inputting the information into the form of the second party.

Abstract: A method for data reduction may comprise computing (i) a first sketch of a first segment and (ii) a second sketch of a second segment. The first sketch and the second sketch may each comprise a set of features that are representative of or unique to the corresponding first and second segments. The method also comprise processing the first sketch and the second sketch to generate a similarity metric indicative of whether the second segment is similar to the first segment. The method may further comprise (1) performing a differencing operation on the second segment relative to the first segment when the similarity metric is greater than or equal to a similarity threshold, or (2) storing the first segment and the second segment in a database without performing the differencing operation when the similarity metric is less than the similarity threshold.

Abstract: Receiving contextual data including a facial movement associated with an active document. A response associated with the active document is detected and associated with the received contextual data. A contextual metadata tag is generated based on the detected response to the active document. A contextual keyword is created that corresponds to the contextual metadata tag. Search results received in response to the query are filtered based on the contextual metadata tag.

Abstract: To effectively implement ILM policies and account for unreliability in a geographically distributed large-scale storage system, “scanners” and “ILM rules appliers” can be deployed on nodes throughout the storage system for large scale ILM implementation. Each scanner is programmed to deterministically self-assign a region of object namespace and scan that region of object namespace. To “scan” a region, a scanner accesses metadata of each object that has an identifier within the scanner's region and inserts the object metadata into one of a set of queues for ILM evaluation. An ILM rules applier dequeues object metadata for evaluation against ILM rules and determines whether an ILM task is to be performed for ILM rule compliance.

Abstract: Implementations include actions of obtaining a set of entities based on one or more terms of a query, obtaining one or more entities associated with each live event of a plurality of live events, identifying a live event that is responsive to the query based on comparing at least one entity in the set of entities to one or more entities associated with each live event of a plurality of live events, determining that an event search result corresponding to the live event is to be displayed in search results, and in response: providing the event search result for display, the event search result including information associated with the live event, the information including an indicator of an occurrence of the live event.

Abstract: A wildcard searchable encryption method enables wildcard search of encrypted text in a cloud-stored encrypted file. In some embodiments, the wildcard searchable encryption method is implemented in a network intermediary, such as a proxy server. The network intermediary encrypts files on behalf of a user or an enterprise destined to be stored on a cloud storage service. The wildcard searchable encryption method performs keyword pre-processing of the file to be encrypted to generate a set of keyword-wildcard combinations in plaintext for some or all of the keywords in the file. The processed file is encrypted using an exact match searchable encryption algorithm. As a result of the encryption process, a search index is generated to include the keyword-wildcard combinations. As thus configured, the wildcard searchable encryption method enables wildcard search of the encrypted text, such as searches for prefixes or suffixes of the keywords.

Abstract: A question is analyzed to determine a set of categories, a category corresponding to a type of possible answers responsive to the question. A set of opinions is extracted from social media data. Each opinion is from a corresponding responder on a social media platform to which the question is sent. An opinion from the set of opinions is categorized into a category from the set of categories. A strength of the opinion is computed using a subset of a set of strength parameters. The opinion is ranked according to the strength of the opinion. The opinion, the strength, and the category are presented in a filterable presentation.

Abstract: A traditional data processing system is configured to process input data either in batch or in real-time. On one hand, a batch data processing system is limiting because the batch data processing often cannot take into account any data received during the batch data processing. On the other hand, a real-time data processing system is limiting because the real-time system often cannot scale. The real-time data processing system is often limited to dealing with primitive data types and/or a small amount of data. Therefore, it is desirable to address the limitations of the batch data processing system and the real-time data processing system by combining the benefits of the batch data processing system and the real-time data processing system into a single data processing system.

Abstract: A system for improving a distributable model with biases contained in distributed data is provided, comprising a network-connected distributable model configured to serve instances of a plurality of distributable models; and a directed computation graph module configured to receive at least an instance of at least one of the distributable models from the network-connected computing system, create a cleansed dataset from data stored in the memory based at least in part by biases contained within the data stored in memory, train the instance of the distributable model with the cleansed dataset, and generate an update report based at least in part by updates to the instance of the distributable model.

Abstract: A system for improving a distributable model with distributed data is provided, comprising a network-connected distributable model source configured to serve instances of a distributable model; and a directed computation graph module configured to receive at least an instance of the distributable model from the network-connected computing system, create a cleansed dataset from data stored in the memory with at least biases within the data stored in memory corrected, train the instance of the distributable model with the cleansed dataset, and generate an update report based at least in part by updates to the instance of the distributable model.

Abstract: Consistent with embodiments of the present disclosure, an information governance platform may be provided. The platform of the present disclosure may provide computer-implemented, metadata-driven methods and systems for managing enterprise data risk by incorporating information governance reconciliation controls and stakeholder notifications. The information governance platform may be configured to map and verify data consistency across an organization employing a plurality of data sources.

Abstract: An optimized and efficient method of identifying one or more points within a dataset that are close to the centers of clumps similar records in a large, multi-element dataset uses Monte Carlo techniques to compute approximate clustering costs at significantly reduced computational expense. The inaccuracy caused by the approximate methods is also estimated, and if it is too high, the method may be repeated with a larger Monte Carlo sample size to improve accuracy. Portions of the algorithm that are independent are distributed among a number of cooperating computing nodes so that the full algorithm can be completed in less time.

Abstract: Systems and methods for a mobile electronic system that gathers and analyzes odors, airborne chemicals and/or compounds. A signature or representation of the odors, airborne chemicals and/or compounds can be generated. Extrinsic data associated with the odors, airborne chemicals and/or compounds or capturing the odors, airborne chemicals and/or compounds can be identified. A model can be generated based on the representation and the extrinsic data. Filters can be generated based on the extrinsic data. The model can be searched for candidate matches, solutions, or other results based on the representation and the filters. Results can be generated based on the search and candidate matches.

Abstract: In some embodiments, a method can involve storing a database containing information about content items associated with a user account on a content management system, the information identifying a storage organization of the content items and respective data sizes of the content items. The method can involve generating, based on the information, a tree structure including a plurality of nodes representing the content items and depicting the storage organization of the content items, the plurality of nodes identifying storage utilization values of the content items being based on their respective data sizes. The method can involve storing the tree structure on memory and, in response to an input, determining, from the tree structure, the storage organization of the content items and storage utilization values. The method can further involve displaying the content items and storage utilization values on a user interface according to the storage organization of the content items.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for incremental backup. The method comprises receiving a set of file paths to be backed up and parsing each file path in the set of file paths to construct a prefix tree. The method further comprises traversing the prefix tree to read an ordered set of file paths in the prefix tree and performing an incremental backup sequentially according to the ordered set of file paths. Embodiments of the present disclosure sort a set of file paths to be backed up using a prefix tree that shares common path prefixes. Thus, embodiments of the present disclosure can achieve fast sort of the set of file paths, and can effectively save storage space needed for sorting a considerable number of file paths in the memory, thereby reducing the times of comparing file names when sorting file paths.

Abstract: A system and method for efficiently storing data in a storage system. A data storage subsystem includes multiple data storage locations on multiple storage devices in addition to at least one mapping table. A data storage controller determines whether data to store in the storage subsystem has one or more patterns of data intermingled with non-pattern data within an allocated block. Rather than store the one or more pattern on the storage devices, the controller stores information in a header on the storage devices. The information includes at least an offset for the first instance of a pattern, a pattern length, and an identification of the pattern. The data may be reconstructed for a corresponding read request from the information stored in the header.

Abstract: Systems and methods for automated sequencing database generation are disclosed herein. The system can include memory that can include a content library database; a graph database; and a model database. The system can include a user device and at least one server. The at least one server can: receive a content aggregation from the content library database; identify content components of the content aggregation based on a natural language processing analysis of at least a portion of the content aggregation; identify explicit sequencing of the content components; generate an intermediate content graph based on the explicit sequencing of the content components; generate a final content graph from the intermediate content graph based on implicit sequencing of the content components; and store the final content graph within the graph database.

Abstract: A system for generating a query plan is provided. In some example embodiments, the system performs operations comprising: determining, at a query execution engine, a first primitive call for implementing a query operation on data at a database; performing the query operation by at least sending, to a data management engine coupled to the database, the first primitive call for execution by the data management engine; and determining, based at least on a result of the first primitive call, a result of the query operation. Related methods and articles of manufacture, including computer program products, are also described.

Abstract: A computer system has a plurality of computers each executing stream data processing and a management computer assigning a plurality of divided queries to the plurality of computers. The management computer includes a parameter input module configured to receive an analysis scenario including a plurality of queries and division information for dividing the analysis scenario into the plurality of divided queries; and a query analysis module configured to analyze the analysis scenario to generate a query graph. The query analysis module specifies, based on the analysis scenario and the division information, at least one of the divided queries that requires flow control; and sets the flow control for the plurality of computers to each of which the at least one of the divided queries that requires the flow control is to be assigned.

Abstract: An event historian system receives event data from a client system via a network connection and stores the event data in a block data storage system. An event data block in which to store the received event data is selected based on the time range of the occurrence of the received event data. The received event data is stored in a snapshot within the event data block. Event property data is extracted from the received event data and used to build a plurality of event property index files.