Abstract: A computing device may identify a plurality of equally sized data blocks of a first navigation file and may identify a plurality of equally sized data blocks of a second navigation file. The computing device may perform binary difference operations between the data blocks of the first navigation file to corresponding data blocks of the second navigation file The result of the binary difference operations is stored in a plurality of navigation patch files. At least two of the plurality of navigation patch files are merged into a merged navigation patch file.

Abstract: Methods and apparatus for processing timedly-published data are provided. After receiving an operation request for the timedly-published data, at least one of an append-file and a delete-file can be written according to the operation request. The append-file corresponds to to-be-appended timedly-published data or post-updated timedly-published data. The delete-file corresponds to to-be-deleted timedly-published data or pre-updated timedly-published data. Each of the append-file and the delete-file uses a publishing time of the timedly-published data as an index.

Abstract: A system and method for loading data into column-partitioned database tables. The system and method incorporate a mechanism for buffering data extracted from the rows of a source table in column-oriented fashion within an in-buffer memory, enabling an efficient bulk-write of large arrays of values from the buffer into column-partitioned database tables. The system and method may also include optimizations for grouping columns according to data types and altering the order in which columns are inserted into the database tables.

Abstract: A method including combining multiple mutations of a document into a mutation cluster based on a contextual purpose for the mutations is provided. The method includes forming a proposal for modifying the document based on the mutation cluster, transmitting the proposal to a server for validation, storing the proposal in a proposal log when the server validates the proposal, and redoing or undoing the mutation cluster on the document upon an input from a user. A system and a non-transitory storage medium including instructions to perform the above method are also provided.

Abstract: Embodiments use a graphical tree to illustrate hierarchical records including a child record having parent field(s) identifying a first parent record and a second parent record of the child record. The graphical tree is generated by determining a first position for the child record and a second position for the first parent record without considering the second parent record. Subsequently, a third position for the second parent record is determined at a same level as the second position. Once the positions are determined, a first shape, a second shape and a third shape are rendered at the first position, the second position and the third position, respectively. The graphical tree is then generated by visually connecting the first shape with the second shape and the third shape, thereby graphically illustrating the plurality of hierarchical records on a target output medium.

Abstract: A method may include receiving, from a source application, partial data that is incomplete for use by a target application, obtaining a set of contextual data correlated with the partial data, assigning, using a ranking model, confidence levels to the set of contextual data, selecting, from the set of contextual data, contextual data according to the confidence levels assigned to the set of contextual data, generating augmented partial data using the contextual data and the partial data, determining that the augmented partial data satisfies a transaction completion criterion of a transaction schema, and in response to determining that the augmented partial data satisfies the transaction completion criterion, sending the augmented partial data to a transaction store used by the target application.

Abstract: Embodiments use a phantom apex node to graphically illustrate a plurality of hierarchical records. Each record includes a parent field, and an entry in the parent field identifies a parent record of a given record. The parent record is higher in hierarchy than the given record. Embodiments identify record(s) that have no entry in the parent field. A phantom apex record is added to the database. A reference to the phantom apex record is inserted for each record that did not have an entry in the parent field. An x-y coordinate position is determined for all hierarchical records based on the parent field in each record. Once the positions are determined, all references to the phantom apex record are removed from all of the parent fields, and the phantom apex record itself is removed from the database. The plurality of records are then graphically rendered on a target output medium.

Abstract: A control circuit obtains and utilizes a first set of rules that determines a distance, as a function of a modified Jaccard distance, between each of a number of predetermined classes. The control circuit utilizes that information to generate groups of the predefined classes by evaluating the distance between each of the predetermined classes. First probabilities for each of the additional text entries regarding membership in each of the groups so generated is calculated along with second probabilities regarding membership in a particular one of the predefined classes in its corresponding group. A resultant probability is then calculated using the first and second probabilities that a given additional text entry belongs to a particular one of the predefined classes. The control circuit then utilizes that resultant probability information to automatically classify additional text entries by associating the given additional text entry to a particular one of the predefined classes.

Abstract: Systems and methods for electronic data indexing support user-side scripting through an application program interface (API). In some aspects, a user-script generates target data using third party software programs. The user-script sends parameters through the API to an indexing engine. The parameters identify the target data to the indexing engine for processing, analyzing, and performing operations.

Abstract: The current invention relates to a system for detecting anomalies, said system comprising a communication module having access to a database comprising a plurality of physical entity records, each physical entity record comprising physical data values for at least one numeric attribute and partition-specifying values concerning values for one or more nominal attributes; a computing device comprising a processor, tangible non-volatile memory, program code present on said memory for instructing said processor; wherein the communication module is arranged to provide said computing device access to said database, and wherein said computing device is configured for carrying out a method for calculating an anomaly score for each of said plurality of physical entity records.

Abstract: Present-day blockchain architectures suffer from several problems, including poor extensibility and scalability. This may stem from tying two parts of the consensus architecture, namely canonicality and validity, too closely together. The Polkadot architecture, which is a heterogeneous multi-chain, provides better extensibility and scalability by setting canonicality and validity apart. Compartmentalizing canonicality and validity and keeping overall functionality to a minimum of security and transport introduces practical core extensibility in situ. Scalability is addressed through a divide-and-conquer approach to canonicality and validity, scaling out of its bonded core through the incentivization of untrusted public nodes. The heterogeneity of this architecture enables many highly divergent types of consensus systems interoperating in a trustless, fully decentralized “federation,” allowing open and closed networks to have trust-free access to each other.

Abstract: Methods, apparatuses, and computer program products are described herein that are configured to express a linguistic description of set of points within a spatial area in an output text. In some example embodiments, a method is provided that comprises generating one or more descriptors and/or one or more combinations of descriptors that are configured to linguistically describe at least a portion of a set of points within a spatial area. The method of this embodiment may also include scoring each of the one or more descriptors and/or one or more combinations of the one or more descriptors. The method of this embodiment may also include selecting a descriptor or combination of descriptors that has the highest score when compared to other descriptors or combination of descriptors, providing the descriptor or combination of descriptors satisfies a threshold.

Abstract: A system that is capable of generating a multiplicity of representations from a set of multimedia objects, each with a potentially different form, is disclosed. In addition, a system that is capable of generating representations that include thematic groupings in addition to the traditional purely sequential groupings is disclosed. Analysis of metadata to generate derived metadata creates a more comprehensive repository of information about media assets. Using the abundance of metadata, embodiments of the methods disclosed teach uniquely grouping and prioritizing media assets into a storyboard, which is in turn mapped onto view-based representations based on a selected output modality.

Abstract: In some examples, image based target analysis may include performing a search to identify an image, and determining whether a target is present in the image, and image metadata. Image based target analysis may further include performing, in response to a determination that the target is present in the image, based on a relationship of the target to an entity, and the image metadata, a further search to identify another image, and generating, based on the image and/or the other image, a result indicative of further information on the target.

Abstract: A distributed data store may maintain versioned hierarchical data structures. Different versions of a hierarchical data structure may be maintained consistent with a transaction log for the hierarchical data structure. When access requests directed to the hierarchical data structure are received, a version of the hierarchical data structure may be identified for processing an access request. For access requests with snapshot isolation, the identified version alone may be sufficient to consistently process the access request. For access requests with higher isolation requirements, such as serializable isolation, transactions based on the access request may be submitted to the transaction log so that access requests resulting in committed transactions may be allowed, whereas access requests resulting in conflicting transactions may be denied.

Abstract: Cancelling file system operations at a file system client of a distributed file system is disclosed. In various embodiments, an indication is received to send locally-stored file system operations to a remote file system metadata server. A dependency graph or other data structure reflecting dependencies between the locally-stored file system operations is used to identify a set of locally-stored file system operations the members of which are fully dominated by a create-delete pair of operations comprising the set. The locally-stored file system operations comprising the set are cancelled, without being sent to the remote file system metadata server.

Abstract: Embodiments are directed to a replication engine that provides a root node for a file that may be associated with a replication snapshot where the file is comprised of the root node, internal nodes, and data nodes. The replication engine may start at the root node and traverse the file system. If a visited internal node has an epoch value that matches the epoch, the replication engine may continue the traversal by visiting a next unvisited adjacent internal node. If the visited internal node has an epoch value that mismatches the epoch, the replication engine may backtrack to a nearest adjacent internal node that matches the epoch. And, in response to visiting a data node the replication engine may be arranged to determine blocks that are associated with the data node and communicate a copy of the blocks to a target file system.

Abstract: A computer-implemented method for performing a data quality function includes receiving, at a data quality function process, at least one record from a source, where the record includes data, semantic annotations and data quality annotations associated with the data in the record. The semantic annotations are attributes that define the data including input format and output format and the data quality annotations are attributes that define data quality rules to be applied to the data. The data quality function process automatically maps the semantic annotations to data quality input fields and to data quality output fields. The data quality function process applies the data quality rules to the data using the data quality annotations to perform a data quality function. The data quality function process performs the data quality function on the data and outputs the data to a destination in a format defined by the data quality output fields.

Abstract: Techniques to eliminate redundant file system operations are disclosed. In various embodiments, an indication is received to send locally-stored file system operations to a remote file system metadata server. A set of related locally-stored file system operations is determined. Operations in the set are determined to satisfy a merger criteria and are merged into a single merged file system operation. The merged file system operation is sent to the remote file system metadata server.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for user drawing based image search. These aspects include an image retrieval system using a convolutional neural network trained to identify how users draw semantic concepts and using an image search engine to search against images having a similar concept. The aspects include mapping between concepts of the user drawing space and concepts of the image space such that images associated with the same concept are identified. For each input user drawing, the drawing is first processed through a concept classifier to identify a corresponding concept, and then through a feature extractor to form a corresponding feature vector. The results from the concept classifier and the feature extractor may be combined to search against a collection of images having a similar concept to determine a listing of images ranked by visual and semantic similarity to the input.