Abstract: Apparatus, methods, and other embodiments associated with object synthesis are described. One example apparatus includes logic for identifying a block in a data de-duplication repository and for identifying a reference to the block. The apparatus also includes logic for representing a source object using a first named, organized collection of references to blocks in the data de-duplication repository and logic for representing a target object using a second named, organized collection of references. The apparatus is configured to synthesize the target object from the source object. Since synthesis may be complicated by edge cases, the apparatus is configured to account for conditions including a block in the target object needing less than all the data in a source object block, data to be used to synthesize the target object residing in a sparse hole in a data stream, and the target object needing data not present in the source object.

Abstract: A method and apparatus are provided for navigating through a media object collection using a mobile device. Users navigate to the target media objects by repeatedly specifying filters. After a user specifies a filter, the filter is applied in combination with all previously specified filters to produce a filtered set of media objects. After a filter is applied, a display level is selected for each hierarchical dimension for which the media objects have metadata. The selection of the display level may be based on the number of distinct values that the media objects in the filtered set have for each level of the hierarchical dimension. Single-action controls are then displayed for each of the values that the media objects in the filtered set have for the selected display level.

Abstract: A data visualization tool (“tool”) configured to generate a visualization for tree data. The tool can calculate a number of hierarchical levels of the tree data. The tool can further subdivide a presentation area for the data visualization into a number of concentric parts. The concentric parts are equivalent to the number of hierarchical levels. Each of the concentric parts corresponds to one of the hierarchical levels. Further, the tool can graphically generate the data visualization for presentation via an electronic display. A first of the concentric parts that corresponds to a highest of the hierarchal levels is an outermost one of the concentric parts in the presentation area. Each successive concentric part inward corresponds to a next lower hierarchical level.

Abstract: Roughly described, a system for user identification of a desired document. A database is provided which identifies a catalog of documents in an embedding space, the database identifying a distance in the embedding space between each pair of documents corresponding to a predetermined measure of dissimilarity between the pair of documents. The system presents an initial collection of the documents toward the user, from an initial candidate space which is part of the embedding space. The system then iteratively refines the candidate space using geometric constraints on the embedding space determined in response to relative feedback by the user. At each iteration the system identifies to the user a subset of documents from the then-current candidate space, based on which the user provides the relative feedback. In an embodiment, these subsets of documents are more discriminative than the average discriminativeness of similar sets of documents in the then-current candidate space.

Abstract: Described herein is a computer implemented method for managing summary data maintained for each node in a tree-structured dataset. The method comprises initiating a summary data reset process which comprises: determining a new summary data length; recalculating data summaries for all nodes in the tree-structured dataset so that data summaries for all nodes have a length is equal to the new summary data length, and wherein for a given subtree of the tree-structured dataset, recalculating data summaries comprises: initially recalculating data summary items for leaf nodes of the given subtree; and following recalculation of data summary items for leaf nodes, working progressively up the given subtree to a root of the given subtree.

Abstract: A method and associated system. Multiple virtual triples for an entity of multiple entities identified within a first data source are generated. Each virtual triple consists of a subject, a predicate, and an object. The subject is the entity. The predicate is a relationship between the entity and other entities identified within the first data source. The object is associated with an attribute of the entity. The subject, the predicate, and the object are each identified within the first data source. A degree of similarity between two entities of the two or more entities is identified by comparing the respective frequency metrics of the two entities. The two entities within the data structure are associated in response to a determination that an identified degree of similarity between the two entities exceeds a first predetermined threshold.

Abstract: A syntax-based ranking technique is provided that ranks search results from multiple source code files in an order that considers the relevance of each matched term with a corresponding code type and the relevance of the type of file that contains the matched term. Boost values are provided for each code type of a matched term in order to weigh certain occurrences of the matched term with more relevance. Boost values are provided for each type of file that contains the matched term in order to weigh the occurrence of the term in a particular file with more relevance.

Abstract: Computer program products, as well as corresponding systems and methods are configured for performing deduplication in conjunction with random read and write operations, and include: computing a fingerprint of data included in a write request; determining whether a short term dictionary comprises an entry corresponding to the fingerprint; in response to determining the short term dictionary comprises the entry corresponding to the fingerprint, writing the data to a data store in a deduplicating manner; in response to determining the short term dictionary does not comprise the entry, determining whether a long term dictionary corresponding to the namespace comprises the entry; in response to determining the long term dictionary comprises the entry, writing the data to the data store in the deduplicating manner; and in response to determining the long term dictionary does not comprise the entry, writing the data to the data store in a non-deduplicating manner.

Abstract: An approach for generating an index in Darwin Information Typing Architecture (DITA) source files. The approach determines one or more similar index entries of a prioritized index. The approach determines a fraternal association exists between at least two of the one or more similar index entries when at least one of the one or more similar index entries occur with one or more similar high priority index entries. Responsive to a determination that a fraternal association exists between at least two of the one or more similar index entries, the approach determines whether an inheritance from a parent exists. The approach determines based, at least in part, on whether a fraternal association exists and whether an inheritance from a parent exists, a Darwin Information Typing Architecture (DITA) index.

Abstract: Embodiments for integration of social interactions in shared media by a processor. The social interactions are mapped in real time according to a predetermined preference. Duplicate ones of the social interactions are managed according to a data deduplication operation. The shared media is analyzed in view of the mapped social interactions to generate placement or duration display attributes for the social interactions such that the mapped social interactions and the shared media may be concurrently viewed on a particular display without obfuscating content of the shared media at a particular time.

Abstract: A method and system of correlating annotations of media files. A first media file is received from a first media recording device. A file record for the first media file is created in the file table. A determination is made whether the first media file belongs to an existing matter group. Upon determining that the first media file belongs to an existing matter group: the file record is related with the existing matter group in the file table; annotations of the first media file that are flagged to be shared, are related to all media files of the existing matter group; and annotations of all the media files of the existing matter group to the first media file are related. Upon determining that the first media file does not belong to an existing matter group, a new matter group is created for the first media file in the matter table of the central server.

Abstract: In one embodiment, a deduplicating storage system includes a processor and logic integrated with and/or executable by the processor. The logic is configured to cause the processor to perform a method which includes: computing a fingerprint of a data chunk, and determining whether a short term dictionary corresponding to the namespace comprises an entry corresponding to the fingerprint. In response to determining the short term dictionary does not comprise the entry, a determination is made whether a long term dictionary corresponding to the namespace comprises the entry. In response to determining the long term dictionary comprises the entry: the data chunk is written to the data store in the deduplicating manner, and the short term dictionary is repopulated with the entry. Moreover, in response to determining the long term dictionary does not comprise the entry, the data chunk is written to the data store in a non-deduplicating manner.

Abstract: A media guidance application the media guidance application may determine end dates for user profile modifications based on real-life events. For example, as opposed to modifying a user profile for a predetermined about of time, the media guidance application may dynamically determine when to remove a user profile modification (or modify a user profile back to a previous state) based on subsequent user actions.

Abstract: Embodiments for integration of social interactions in shared media by a processor. The social interactions are mapped in real time according to a predetermined preference. Duplicate ones of the social interactions are managed according to a data deduplication operation. The shared media is analyzed in view of the mapped social interactions to generate placement or duration display attributes for the social interactions such that the mapped social interactions and the shared media may be concurrently viewed on a particular display without obfuscating content of the shared media at a particular time.

Abstract: Systems herein allow a user device to monitor calendar events with a secure bubble application. When an event is upcoming, the secure bubble application can present a notification. The secure bubble application can search other managed applications for content relevant to the meeting event. The secure bubble application can extract text, tags, and other metadata from the calendar event and any attached files. The text, tags, and other metadata can be used to search each managed application. Relevant emails, files, and notes can be displayed in a card generated by the secure bubble application.

Abstract: A method for unsupervised transformation of denormalized data into RDF data includes summarizing an existing resource description framework (RDF) file wherein a data summary file is produced, wherein said RDF file includes a plurality of nodes, property labels, and literals and is represented as a directed graph, and said data summary file is a graph that includes a single instance of each node-property-literal triple in the RDF file; analyzing a plurality of denormalized records wherein a record summary is produced, wherein said record summary is represented as a directed graph with a root node corresponding to each record connected to a node for each field in the record; determining one or more transformation patterns that match elements of the record summary to elements of the data summary; and transforming the plurality of denormalized records into a new RDF file by executing one of the one or more transformation patterns.

Abstract: The present invention provides for inline/parallel processing of data messages, specifically data response messages, to both transform and parse the data in one single pass. Parsing includes extracting common data elements (such as, error codes, fault codes, status codes and the like) from the message and deleting generic headers from the messages. In specific embodiments of the invention, the parallel processing of the present invention is made possible by implementation of a SAX parser. In such embodiments of the invention, the SAX parser implements a single filter to both transform and parse the data response messages simultaneously.

Abstract: A method of implementing sub-table replication starts with the processor detecting an update to an entitlements table. The processor performs filtering of a data table based on the update to the entitlements table. The data table including an entitlements column. The processor detects an update to the entitlements column and performs incremental replication of the data table by causing a version-based replication to be executed. Other embodiments are also described herein.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for authentic content search using style classifications. A system may be a search engine that uses a set of style classifiers to detect one or more styles associated with an image and a logistic regression model to determine a level of authenticity for the image based on the associated styles. Training images are fed to train a series of neural networks that output a set of style classifiers. An image is processed through the style classifiers to determine respective probabilities for each style classification. The results from the set of style classifiers are then input to the logistic regression model to determine an authenticity score for the image. For example, the authenticity score shows how authentic is an image (e.g., a score of 1.0 refers to 100% authenticity, whereas a score of 0.0 represents a non-authentic image).

Abstract: The subject matter described herein relates to implementation of a dictionary in a column-based, in-memory database where values are not stored directly, rather, for each column, a dictionary is created with all distinct values. For each row, a reference to the corresponding value in the dictionary is stored. In one aspect, data is stored in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows. A dictionary for each column in the memory structure is generated. The dictionary has distinct values for each column. A reference to the dictionary is generated for each column in the memory structure. The dictionary and the reference to the dictionary are stored in the memory structure.