Abstract: A digital forensics tool and associated method are disclosed for extracting digital data from a user computing device, transforming and analyzing the digital data, and generating an interactive user interface that facilitates the identification of important digital data, such as for a criminal investigation.

Abstract: To efficiency search for an object associated with a sensed event, an information processing apparatus includes a sensor that analyzes a captured video and senses whether a predetermined event has occurred, a determining unit that determines a type of an object to be used as query information based on a type of the event in response to sensing of the event occurrence, and a generator that detects the object of the determined type from the video and generates the query information based on the detected object.

Abstract: A computer system is connected to a database, is capable of accessing a data catalog that manages an item for searching for data stored in the database, and holds data requirement management information for managing requirement data associated with a phase of a life cycle of an application and a data requirement. The computer system searches for data matching a search condition with reference to the data catalog when a search request including the search condition is received; specifies the requirement data corresponding to the phase with reference to the data requirement management information when an output request including information of data selected by the user and the phase is received; and outputs use data to be used in the phase based on the selected data and the specified requirement data.

Abstract: A system and method for measuring the quality of data reporting in a given medical study is presented. The instant innovation abstracts all relevant medical literature pertaining to a particular disease and categorizes the data and the study for quality and/or completeness. In an embodiment the instant innovation provides a system for study intake, permits user-determined search optimization, and provides for study data tagging. The innovation automates term inclusion and exclusion, automatically removing duplicates of previously collected study metadata, and then subjects the terms to a real-time sorting algorithm. Statistical analysis is performed upon included and excluded terms, and a representation of geometrical closeness from central tendency of any given data element is computed. The data elements and computed tendencies are reduced to a 2D visual representation and delivered to a user. The user may interact with the 2D visual representation using a device.

Abstract: Techniques involve determining, in response to acquiring a target block size for a shared folder of a first file system in a file system set, a shared folder de-duplication rate. The techniques further involve acquiring a de-duplication block size set supported by a storage system set for the file system set in response to determining that the de-duplication rate is less than a threshold de-duplication rate. The techniques further involve determining whether the de-duplication block size set includes a de-duplication block size that is the same as the target block size. The techniques further involve migrating the shared folder to a second file system in response to the de-duplication block size set including the de-duplication block size that is the same as the target block size. Accordingly, there is improved efficiency in deleting duplicate data, increased amount of deleted duplicate data, saved storage space and improved resource utilization.

Abstract: Techniques are described for generating an encoded-string automaton for a regex pattern from a decoded-string automaton of the regex pattern. In an embodiment, the process obtains a decoded-string automaton of the regex pattern and applies unique decoded string value(s) from the dictionary of the encoding. When applied at a selected state in the decoded-string automaton, the application may yield a transition to at least one target state in the decoded-string automaton for a unique dictionary value. Such a transition generates a transition in the encoded-string automaton from an encoded state corresponding to the selected state in the decoded-string automaton to a target state in the encoded-string automaton corresponding to the target state in the decoded-string automaton. The generated transition in the encoded-string automaton is conditioned on the token of the unique decoded string value in the dictionary.

Abstract: Systems and methods for backing up data for a software platform include segmenting data objects from a software platform into data chunks, which are subsequently stored. Data chunks may include content from data objects having similar content attributes, such as content type and an estimated frequency at which the content changes. In various embodiments, pages from a content collaboration platform and issues from an issue tracking platform are grouped into chunks and stored for backup. A size of the chunks may be based on one or more content attributes associated with the pages or issues. Examples of content attributes include a relationship between text and non-text content, a number of associated users, and a number of comments.

Abstract: A system, server device, and method are provided for managing document metadata. The method includes storing metadata in a graph separately from documents with which the metadata is associated and connecting metadata in the graph according to a hierarchy, with each node of the graph being classified based on metadata content. The method also includes assigning properties to edges in the graph connecting the nodes; receiving, via a communications module, an instruction to update the metadata; and dynamically updating at least one edge or node in the graph according to the instruction without requiring access to an associated document. The method also includes receiving, via the communications module, an inquiry related to a document; and responding to the inquiry, via the communications module, after accessing metadata associated with the document by navigating the graph.

Abstract: Providing content based data protection for data stored in a large-scale data storage system by creating a dataset by grouping metadata for unstructured data objects that are grouped together by one or more filters. The dataset can span multiple storage devices of different types, so that it defines a single data protection unit for the corresponding content data. A user initiated query input through a search engine interface generates the one or more filters, and a protection policy is defined that protects the dataset as the single unit based on data content rather than data location. Datasets are stored in a catalog, and are generated by running queries on the catalog, where a query comprises metadata selectors as tags applied to the catalog, where the tags define at least one of a file type, name, location, creation time, or file characteristic.

Abstract: A method includes determining a first number of logs of a first log type that are generated by a first data store at a first time for a first time interval. A first baseline number and a first threshold value are determined for the first data store. The first baseline number is an expected number of logs of the first log type generated by the first data store at the first time for the first time interval. In response to determining that the first number of logs differs from the first baseline number by more than the first threshold value, the first data store and the first log type are identified as degraded. A report is generated. The report includes an identification that the first data store is degraded and an identification that the first log type is degraded.

Abstract: Conventionally, text summarization has been rule-based method and neural network based which required large dataset for training and the summary delivered had to be assessed by user in terms of relevancy. System and method are provided by present disclosure that generate causal insight summaries wherein event of importance is detected, and it is determined why event is relevant to a user. Text description is processed for named entities recognition, polarities of sentences identified, extraction of causal effects sentences (CES) and causal relationship identification in text segments which correspond to impacting events. Named entities are then role labeled. A score is computed for named entities, polarities of sentences, causal effects sentences, causal relationships, and the impacting events. A causal insight summary is generated with overall polarity being computed/determined.

Abstract: The subject technology receives a query, the query including a query range for processing the query and a set of requested columns. The subject technology based on the query range, determining a set of blob files and a set of delete vectors. The subject technology for each blob file, storing each row, including the set of request columns, into an array of rowsets. The subject technology for each rowset, generating a delete bitset to at least indicate whether each row has been deleted. The subject technology for each delta file, indicate a previous row of a visible row of the delta file as being deleted based on a delete pointer of the visible row. The subject technology providing a set of rowsets, including a corresponding selection column set, as a result of the query.

Abstract: A method for determining an academic impact, including: pre-processing a citing paper to obtain pre-processed data; determining a category of an impact, on the citing paper, of each reference paper and ranking of contribution, to the citing paper, of each reference paper, according to the pre-processed data; determining a local influential factor, on the citing paper, of each reference paper, according to the category of the impact and the ranking of the contribution of each reference paper; and determining a global influential factor of each reference paper according to a global influential factor of the citing paper and the local influential factor.

Abstract: A method and system for executing distributed locks in a locking system is disclosed. The system includes receiving a lock request including at least a lock name of a resource to place a lock on; determining a shard key at least based on the lock name and a prefix value, wherein the locking system includes a set of database instances, and wherein the prefix value is a number of database instances in the locking system; sending the lock request to at least two database instances in the set of database instances to place the lock in an entry pointed by the shard key; acknowledging the lock request when all of the at least two database instances acknowledge the lock request; and dismissing the lock request when at least one database instance of the at least two database instances cannot acknowledge the lock request.

Abstract: Various embodiments of the present invention provide methods, apparatuses, systems, computing devices, computing entities, and/or the like for facilitating efficient and effective execution of database management operations. For example, various embodiments of the present invention describe techniques for performing one or more database update operations given a concurrent write request group for a database using P concurrent request processor computing nodes, a match result serialization queue, and a centralized match result serializer computing node.

Abstract: The technology involves sampling space-saving set sketches, which relates to tracking and evaluating information associated with large data sets. This can include a number of distributed data streams or other data sets that may come from different sources such as Internet traffic. The sets each have corresponding labels and distinct items. One approach includes performing a query for each distributed data set to determine whether a given label associated with that distributed data set is in a corresponding sketch. When that label is in the corresponding sketch, the distinct item associated with that label is inserted into the corresponding sketch. When the label is not in the corresponding sketch, then depending on whether a number of labels in the sketch is less than a specified size, the approach may add the label to a particular sketch and/or insert the distinct item into the particular sketch according to certain defined criteria.

Abstract: A method for edge profiling within a data graph measures the impact that a particular type of edge has on a data graph. A list of all edges contained within a single connected component within the graph is generated in order to search for bridges across connected subcomponents. The process is implemented as two MapReduce jobs on separate compute clusters. The first job is the edge profile job, which is implemented as a Map-only job. The second job reads the output of the first, and builds multiple in-memory data structures representing each connected component within the data graph. After the graph is created, it is traversed to find bridges.

Abstract: A document retrieval system retrieving a document with the concept of the document taken into account is provided. The system includes a processing portion and the processing portion creates a retrieval graph from a retrieval composition. The retrieval graph includes first to m-th retrieval local graphs (m is an integer of greater than or equal to 1), and the retrieval local graphs are each constituted by two nodes and one edge. The processing portion performs retrieval of first to m-th sentences on a reference document. The i-th sentence (i is an integer of greater than or equal to 1 and less than or equal to m) includes one of the two nodes in the i-th retrieval local graph or a related term or a hyponym of the one of the two nodes; the other of the two nodes in the i-th retrieval local graph or a related term or a hyponym of the other of the two nodes; and the edge in the i-th retrieval local graph or a related term or a hyponym of the edge.

Abstract: Technology is disclosed for selecting at least one people highlight, with respect to a person of interest, to be shown on one or more user devices. The user device is monitored to determine a user interest in a person of interest. A set of possible people highlights, with respect to the person of interest is determined. A determination is made as to whether any of the possible people highlights should be suppressed and not presented to the user on the user device. Any people highlights that were determined to be people highlights that should be suppressed and not presented are removed to create a remaining set of possible people highlights. At least one of the remaining set of possible people highlights are presented on the user device.

Abstract: An information processing apparatus includes an acquisition unit configured to acquire data with a first schema and data with a second schema, the data with the first schema including case-insensitive first identification information in identification information for management of data, the data with the second schema including the first identification information corresponding to the identification information and case-sensitive second identification information in the identification information, and a management unit configured to manage the data with the first schema and the data with the second schema in a retrievable manner.