Abstract: A method, system and computer program product for sharing resources among remote repositories. In a shared file system, a resource identifier and metadata are created for a resource, where the resource identifier is stored in a lock file in a shared volume accessible by the remote repositories. The lock file is then released in response to distributing the associated resource to the remote repositories. Alternatively, in a peer-to-peer system, a request is received to create, read, update or delete a resource stored in a content repository. A resource name, a resource version and/or a resource fingerprint are received in connection with the request to create, read, update or delete the resource in the content repository. A determination is then made as to whether the received resource name, resource version and/or resource fingerprint matches the respective resource name, resource version and/or resource fingerprint stored in a node graph for the resource.

Abstract: Techniques for outside-in mapping for corpus pairs are provided. In one example, a computer-implemented method comprises: inputting first keywords associated with a first domain corpus; extracting a first keyword of the first keywords; inputting second keywords associated with a second domain corpus; generating an embedded representation of the first keyword via a trained model and generating an embedded representation of the second keywords via the trained model; and scoring a joint embedding affinity associated with a joint embedding.

Abstract: An example operation may include one or more of receiving a request to create a second blockchain in a network that includes a first blockchain, sending a message to one or more validating peer nodes in the network, the one or more validating peer nodes corresponding to a subset of validating peer nodes of the network that have access to the first blockchain, the message requesting authorization for the second blockchain, analyzing responses to the message from the subset of validating peer nodes, and authorizing creation of the second blockchain based on the analyzed responses.

Abstract: An example operation may include one or more of generating a proposal to perform a ledger operation at a first node, informing one or more second nodes of the proposal, receiving a decision on consensus among the first node and the one or more second nodes for the proposal, and performing the ledger operation at the first node when there is consensus, wherein the ledger operation changes a state database of a ledger of the first node and wherein the state database corresponds to a blockchain stored in the ledger.

Abstract: An apparatus includes a memory and a processor. The memory stores a set of sentence blocks, each including one or more sentence variants, and information identifying a selected variant. The processor displays a sequence of elements, each associated with a block and displaying the selected variant of the block, and a plurality of sentences, each assigned to a block and corresponding to the selected sentence variant of the block. The processor receives a selection of a first element, associated with a first block, or a first sentence, corresponding to the selected sentence variant of the first block, and, in response, displays the sentence variants of the first block, and an identification of the first sentence as the selected sentence variant of the first block. The processor receives information identifying a new selected sentence variant of the first block, and replaces the displayed first sentence with the new selected sentence variant.

Abstract: A method, system and computer program product for sharing resources among remote repositories. In a shared file system, a resource identifier and metadata are created for a resource, where the resource identifier is stored in a lock file in a shared volume accessible by the remote repositories. The lock file is then released in response to distributing the associated resource to the remote repositories. Alternatively, in a peer-to-peer system, a request is received to create, read, update or delete a resource stored in a content repository. A resource name, a resource version and/or a resource fingerprint are received in connection with the request to create, read, update or delete the resource in the content repository. A determination is then made as to whether the received resource name, resource version and/or resource fingerprint matches the respective resource name, resource version and/or resource fingerprint stored in a node graph for the resource.

Abstract: Metadata and for posts originating from different social media sources and the posts themselves may be collected. A query specifying search criteria for the posts and filter criteria related to the metadata may be submitted to the system disclosed herein. The system may allow a client or tenant of the system to filter and search the metadata stored therein. The system may provide the posts in response to the query and permit a client or tenant to rapidly switch between social media sources and corresponding metadata types.

Abstract: Implementations of the present disclosure include setting, by a first consensus node, a timer that runs out before a timeout of a view change; sending, to a second consensus node, a request for one or more consensus messages missing by the first consensus node in response to the timer running out; receiving, from the second consensus node, the one or more consensus messages each digitally signed by a private key of a corresponding consensus node that generates the respective one or more consensus messages; and determining that a block of transactions is valid, if a quantity of commit messages included in the received one or more consensus messages is greater than or equal to 2f+1, where f is a maximum number of faulty nodes that is tolerable by the blockchain based on practical Byzantine fault tolerance.

Abstract: Data storage and calling methods and devices are provided. One of the methods includes: receiving first motion data and business data; establishing an association relationship between the first motion data and the business data and storing the association relationship; receiving second motion data; and determining first motion data that matches the second motion data, and returning, to a sender of the second motion data, business data associated with the matched first motion data.

Abstract: Techniques are disclosed for incremental agglomerative clustering of data, including but not limited to digital image data. Fewer than all of a plurality of existing digital image fingerprints are sampled from a first hierarchical data cluster of digital image fingerprints stored in a data storage device, the first hierarchical data cluster excluding a new digital image fingerprint. The new digital image fingerprint and the existing digital image fingerprints sampled from the first hierarchical data cluster are clustered to produce a second hierarchical data cluster of digital image fingerprints, the second hierarchical data cluster including the new digital image fingerprint. If a majority of the existing digital image fingerprints in the first hierarchical data cluster match the new digital image fingerprint, then the second hierarchical data cluster is mapped to the first hierarchical data cluster based on the determination.

Abstract: The present invention provides a method for populating and searching a drug informatics database that includes receiving unprocessed data associated with a chemical compound from one or more data sources. The unprocessed data is parsed into a plurality of data objects based on a categorization associated with each of the data objects. Additional information, such as explanatory notes, is identified and associated with at least one of the data objects. The data objects are stored in entries within a data structure, where the data structure is searchable based on one or more of the data objects. A query for data associated with a chemical compound is received at a drug informatics database. The drug informatics database is then searched for data associated with the chemical compound and the search results are provided to a user.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing filters from resource content. In one aspect, a system receives data identifying a set of resources that are determined to be responsive to a search query and extracts a set of keywords from the contents of the resources and related queries. The keywords are processed according to candidate selection criteria, and a set of candidate query filters are determined. The candidate filters may be used to filter the resources that are responsive to the query.

Abstract: Methods, systems, and products characterize consistency of data in a stream warehouse. A warehouse table is derived from a continuously received a stream of data. The warehouse table is stored in memory as a plurality of temporal partitions, with each temporal partition storing data within a contiguous range of time. A level of consistency is assigned to each temporal partition in the warehouse table.

Abstract: A self-optimizing interval detection data structure is provided herein. A data storage system as described herein can include a memory that stores computer executable components and a processor that executes computer executable components stored in the memory. The computer executable components can include a candidate assignment component that maps properties of a resource of the data storage system to respective candidate data structures; a latency estimation component that estimates respective latencies associated with the respective candidate data structures; and a selection component that selects a candidate data structure of the respective candidate data structures having a latency that is less than a threshold latency, resulting in a selected data structure.

Abstract: A method comprises: obtaining content, a content location search term, and an image trigger; submitting the content location search term to a web mapping service so that a service API searches with the content location search term; receiving content locations corresponding to the content; adding the content, image trigger, and content locations to a distribution database that is searchable by location; receiving from a consumer device a location of the consumer device; searching the database using the location of the consumer device to identify any content having content locations that correspond to the consumer device's location, and obtaining the associated image trigger(s); performing an image recognition process on image data captured by the consumer device to identify the presence of the or each said associated image trigger in the image data; and if the presence of any of the image triggers is detected, serving the content to the consumer device.

Abstract: Determining relative relationships of people who share a common ancestor within at least a threshold number of generations includes: receiving recombinable deoxyribonucleic acid (DNA) sequence information of a first user and recombinable DNA sequence information of a plurality of users; processing, using one or more computer processors, the recombinable DNA sequence information of the plurality of users in parallel; determining, based at least in part on a result of processing the recombinable DNA information of the plurality of users in parallel, a predicted degree of relationship between the first user and a user among the plurality of users, the predicted degree of relative relationship corresponding to a number of generations within which the first user and the second user share a common ancestor.

Abstract: A method, system, and computer program product for data compression in storage clients. In some embodiments, a storage client for accessing a storage service from a computer program is provided. A compression method is provided in the storage client to reduce a size of data objects. A frequency of compressing data from the computer program or modifying a compression algorithm based on assessing costs and benefits of compressing the data is varied.

Abstract: A method, computer program product, and system includes a processor obtaining data including values and generating a value conversion dictionary by applying a parse tree based compression algorithm to the data, where the value conversion dictionary includes dictionary entries that represent the values. The processor obtains a distribution of the values and estimates a likelihood for each based on the distribution. The processor generates a code word to represent each value, a size of each code word is inversely proportional to the likelihood of the word. The processor assigns a rank to each code word, the rank for each represents the likelihood of the value represented by the code word; and based on the rank associated with each code word, the processor reorders each dictionary entry in the value conversion dictionary to associate each dictionary entry with an equivalent rank, the reordered value conversion dictionary comprises an architected dictionary.

Abstract: A client computer includes a synchronization manager. The synchronization manager communicates with a remote content management system to determine a set of objects in a content navigation hierarchy. The synchronization manager provides a user interface with controls to allow a user to independently select multiple objects in the content navigation hierarchy for synchronization and receives an input, via the interface, that selects objects from the set of objects for synchronization. The synchronization manager stores local peers of the selected objects in a local cache in a local file system. The synchronization manager synchronizes changes to the selected objects at the content management system to the local peers in the file system.

Abstract: A method, computer program product, and system includes a processor obtaining data including values and generating a value conversion dictionary by applying a parse tree based compression algorithm to the data, where the value conversion dictionary includes dictionary entries that represent the values. The processor obtains a distribution of the values and estimates a likelihood for each based on the distribution. The processor generates a code word to represent each value, a size of each code word is inversely proportional to the likelihood of the word. The processor assigns a rank to each code word, the rank for each represents the likelihood of the value represented by the code word; and based on the rank associated with each code word, the processor reorders each dictionary entry in the value conversion dictionary to associate each dictionary entry with an equivalent rank, the reordered value conversion dictionary comprises an architected dictionary.