Abstract: A system enabling smart versioning of files is provided. Techniques disclosed herein enable a system to snap to new versions of a file based on one or more measures of user interactions with the file. For instance, a system can create a new version number for a file based on an amount of time a user has spent editing the file, a number of saves that have occurred, and/or a quantity of data applied to edits of the file. The techniques disclosed herein can also utilize telemetry data to fine tune weightings that are applied to data measuring specific types user activity to provide results that best serve a range of use scenarios and file types. By providing version numbers of a file that are based on user interactions, a system can provide more meaningful version numbers that are aligned with the contents of a file.

Abstract: There are provided a digital content viewing system, a digital content viewing method, and a computer program, all of which make it possible to update a digital content that has been downloaded without downloading the entire digital content again if the digital content is updated. A digital content viewing system 1 includes a viewer terminal 5. The viewer terminal 5 includes: a configuration information file acquisition section 57A configured to check if a configuration information file corresponding to a digital content is stored in a data storage section 55 when the digital content is designated, and download the configuration information file OPF as necessary; and a content file acquisition section 57B configured to specify a corresponding content file on a basis of the configuration information file when the content file is designated, check if the content file having the same file name is stored in the data storage section 55, and download the content file as necessary.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a set of records from a set of inputs, with each record containing an entity key, a partition key, and one or more attribute-value pairs. Next, the system sorts and indexes the records by the entity key for each partitioned input. The system then processes a query of the records by matching entity key values to the sorted and indexed records for each input partition in the query. Next, the system merges the subset of records with the same entity key values into records, with each merged record containing an entity key field and a single field that includes a list of attribute-value pairs from the subset. Finally, the system outputs the merged records in response to the query.

Abstract: A method may include accessing a semantic map between a schema of a relational database (RDB) and a resource description framework (RDF) data model, the semantic map defined according to a first semantic ontology; applying the semantic map to data loaded from the RDB to generate a first set of semantic objects; storing the first set of semantic objects in a staging RDF triplestore; executing a script to transform the first set of semantic objects into a second set of semantic objects according to a second semantic ontology; and storing the second set of semantic objects into a production RDF triplestore.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for aggregating task data for multiple users. In one aspect, a method includes accessing action trail data that corresponds to a task and resources related to that task, wherein each task relates to one or more related topics and is defined by a sequence of user actions corresponding to the resources related to that task; clustering the action trails based on the action trail data such that each action trail cluster corresponds to a particular task and includes the action trails corresponding to that particular task; and for each action trail cluster, ranking the resources that correspond to the included action trails according to the topics of the particular task.

Abstract: Techniques are described for creating geospatial elements based on geographical data. In one example, a method for creating geospatial elements based on geographical data includes collecting one or more geographical indicators comprised in a set of operational data, the geographical indicators indicating one or more geographical areas. The method further includes collecting, from a set of geographical data, geospatial data associated with the one or more geographical areas indicated by the one or more geographical indicators. The method further includes generating one or more aggregated geospatial elements based on the one or more geographical indicators and the geospatial data.

Abstract: Batch interaction with a computerized question answering system can produce an answer that more closely relates to a user's information need. A batch of questions can be generated interactively, and provides a context for a first question received from a user. The batch of questions includes or more additional questions which have terms with a nonsynonymous semantic relation to a first term in the first question. A question answering system can process the batch of questions to determine candidate answers. An answer to the first question can be determined based, at least in part, on a combined ranking of the candidate answers.

Abstract: This disclosure relates generally to a system and method to optimize a plurality of validations in an ETL workflow. The ETL workflow implements all types of validations expecting that there is erroneous data and that the validation would fail. Therefore, the actual execution of validation is made conditional based on a switch that can be turned on (validation is performed) or off (validation is skipped). The output of each instance of execution is recorded continuously at a repository. The means of identifying a specific validation that is eligible for being turned off requires a thorough analysis of all validations performed so far in the history. The thorough analysis includes how many times a validation has been performed on a particular field and to calculate an exposure value which is compared with a threshold value of exposure and determine specific validation that is eligible to be turned off.

Abstract: A network device obtains, from a transaction queue, a plurality of transactions that do not conflict with each other, and performs reverse shallow copying in parallel for the transactions that do not conflict, to generate a plurality of temporary trees corresponding to the plurality of transactions. Because the plurality of transactions does not conflict with each other, processing the transactions in parallel can ensure accurate and proper transaction processing. In addition, generating the temporary trees in a reverse shallow copying manner can effectively reduce consumption of time and memory. Further, processing of the plurality of transactions is implemented by merging the plurality of temporary trees.

Abstract: A method for in-band de-duplication, the method may include receiving by a hardware accelerator, a received packet of a first sequence of packets that conveys a first data chunk; applying a data chunk hash calculation process on the received packet while taking into account a hash calculation result obtained when applying the data chunk hash calculation process on a last packet of the first sequence that preceded the received packet; wherein the calculating of the first data chunk hash value is initiated before a completion of a reception of the entire first data chunk by the hardware accelerator.

Abstract: Systems and methods to extract a string from a communication. A method includes: receiving a communication comprising a plurality of strings; assigning a score to each of the strings, wherein the score assigned to each of the strings corresponds to a frequency of usage of the respective string for a first function relative to an overall frequency of usage of the respective string; determining a respective total sum for each of a plurality of sequences in the communication, the respective total sum determined as a sum of the scores for each string in the respective sequence; and extracting a first sequence of the sequences from the communication based on the total sum for the first sequence. In one embodiment, the total sum includes an additional score for each of a starting word and an ending word of the first word sequence, wherein each respective additional score is associated with a probability that the starting (or ending) word is used as the first (or last word) of an address.

Abstract: Systems and methods are presented for efficient and effective computation of LSH hashing functions for use in various environments, including nearest-neighbor search. A corpus of items is maintained, with each item of the corpus being associated with information identifying one of a plurality of LSH partitions to which the item has been mapped or hashed. In response to an input item, the input item is projected one or more times into an orthoplex inscribed within a multi-dimensional space. For each mapping, a determination is made as to the nearest vertex of the orthoplex to the projected input item in view of determined offsets that provide for balanced distribution, and the LSH partitions associated with the nearest vertex are aggregated and associated with the input item as the input item's LSH partition.

Abstract: Techniques for allowing a user to invoke lifecycle operations on a data store configured in accordance with a data management scheme, without knowledge of the data management scheme. Techniques include receiving user input from a user interface; identifying, in the received user input, an indication of a first lifecycle operation corresponding to a first entry in a template; based on information in the first entry, identifying in the received user input a first configuration value associated with the first lifecycle operation; formatting the first configuration value as at least a portion of at least one argument to a first command; and invoking, via the first command with the at least one argument, a first computer program configured to perform the first lifecycle operation on the data store.

Abstract: A method includes replicating a data pattern to be searched for, storing the replicated data pattern into a first row of memory cells, and comparing the replicated data pattern to data stored into a second row of memory cells. In response to detecting the data pattern in the data stored into the second row of memory cells, storing into a third row a value indicative of at least one of an occurrence of the data pattern or a position of the searched for data pattern in the data stored into the row of memory cells.

Abstract: Techniques are provided for transitioning a first storage object and a second storage object from an asynchronous replication state to a synchronous replication state. Metadata operations are logged into a metadata log. Dirty data, modified by data operations executed upon the first storage object, are tracked using a dirty region log. Metadata operations are replicated from the metadata log to the second storage object during a metadata drain phase. During the metadata drain phase, incoming operations are logged into the metadata log when the metadata log has a non-zero size, otherwise, the metadata operations are replicated to the second storage object. After the metadata drain phase, a data drain phase is performed using the dirty region log.

Abstract: Techniques are provided to allow a user to interact with a computer to automatically analyze a transcript and provide interactive feedback pertaining to interactions between the user and other parties. This may be accomplished by dividing the transcript into text sequences, such as sentences, and matching each text sequence against a set of rules that define patterns that relate text sequences to particular characteristic categories. These matches can be further scored and ranked to allow particular text sequences to be interactively displayed to the user in response to selection of a particular categorization.

Abstract: A method of storing blockchain state data, including: after execution of a transaction in a target block is completed, based on a latest account state of a target account related to the transaction in the target block after update, generating updated data nodes corresponding to the current Merkle state tree of the target block and, based on generated historical data nodes and data nodes other than the reused data nodes corresponding to the target account on the historical Merkle state tree of the previous block of the target block, creating the historical Merkle state tree for the target block.

Abstract: A computing device implemented method for building a mutable type is disclosed. A data structure is generated in a contiguous section of memory. The data structure includes an element portion and an over-allocation portion. The element portion stores elements accessible with an index. A gap object is inserted into the over-allocation portion. The gap object is garbage collected.

Abstract: Methods, systems, and computer readable media for performing metadata-driven data collection are disclosed. In some examples, a method includes receiving a request for system status data for components of a distributed computing system while the distributed computing system is in operation. The request includes metadata specifying a data collection sequence for collecting component-level system status data. The components include compute components, network components, and storage components. The method includes obtaining, using the metadata, the component-level system status data by querying protocol-based data collectors in an order, one after the other, as specified by the data collection sequence specified by the metadata. The method includes assembling the component-level system status data into assembled status data and storing the assembled status data in memory and/or a repository.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program identifies a first data structure having a first type. The first data structure is configured to store a set of geometries. The program further identifies a second data structure associated with the first data structure. The second data structure is configured to store modifications to the set of geometries. The program also perform a merge operation on the first data structure and the second data structure to form a third data structure.