A method is disclosed for the rendering, by a second terminal, of a content shared by a first terminal with the second terminal, the first terminal being engaged in playing back the content. The method includes a playback, by the second terminal, of the content from an effective temporal position within the content. The effective temporal position is determined as the temporal position of the content played back by the first terminal at the instant when a server receives a first request, the second terminal having transmitted the first request to the server following reception of an invitation by the first terminal to share in the playback of the content. The first request is a request for obtaining a content playback starting temporal position.

An apparatus and method of managing a licensable item includes accessing a licensing policy related to managing a licensable item, and a license agent making a determination to act to enforce the licensing policy or to first communicate with a server before acting to enforce the licensing policy. Further, the apparatus and method include enforcing the licensing policy in accordance with the determination to act to enforce the licensing policy or to first communicate with a server before acting.

A target hash phrase can be provided to a user on a computer that indicates a target state of the computer. The computer generates a local hash phrase that represents a current state of the computer. The local hash phrase can be used to verify that the computer is at the target state by comparing the local hash phrase with the target hash phrase. The computer may receive corrective input from the user to correct the state of the computer depending on the comparison. The local hash phrase can be generated by computing one or more hash values from data that represent a state of the computer. The one or more hash values correspond to one or more hash words that comprise the hash phrase. Individual letters of each hash word can be selected using segments of a corresponding hash value.

Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.

Embodiments of the present application provide a data synchronization method and system. The method includes: assigning a first task for a data fragment in a target data set; starting a task thread of the first task to execute data synchronization of the corresponding data fragment between a source end and a destination end; determining if the first task corresponding to a data fragment fails in the offline data synchronization and if the first task supports a failover operation; in response to the first task corresponding to the data fragment failing in the data synchronization and the first task supporting the failover operation, clearing processing resources of the data fragment corresponding to the failed first task; and reassigning a second task for the data fragment corresponding to the failed first task, and starting a task thread of the reassigned second task to execute the data synchronization of the data fragment between the source end and the destination end.

Securely sharing content between a first system and a second system is provided. A hardware-based root of trust is established between the first system and a server. Content requested by a user and an encrypted license blob associated with the content is received by the first system from the server. A first agent on the first system connects with a second agent on the second system. The encrypted license blob and a sub-license request are sent from the first agent to a security processor on the first system. The first security processor decrypts the encrypted license blob, validates the sub-license request, and if allowed, creates a sub-license to allow the second system to play the content. The first security processor sends the sub-license to a security processor on the second system. The first system provides access to the content to the second system for future playback according to the sub-license.

The techniques discussed herein relate to providing a highly available and reliable secret distribution infrastructure. In an implementation, a key master service (KMS) system is disclosed. The KMS system includes one or more computer readable storage media having program instructions stored thereon which, when executed by one or more processing systems, direct the one or more processing systems to identify a hydration event and, responsive to the hydration event, determine if other KMS systems are running in a secret distribution infrastructure. The program instructions, when executed by one or more processing systems, further direct the KMS system to hydrate the KMS system with secret information obtained from the one or more of the other KMS systems when the other KMS systems are running in the secret distribution infrastructure.

Data are maintained in a distributed computing system that describe a directed graph representing relationships among items. The directed graph has a plurality of vertices representing the items and has edges with values representing distances between the items connected by the vertices. A multiple reference point algorithm is executed for a plurality of the vertices in the directed graph in parallel for a series of synchronized iterations to determine shortest distances between the vertices and the source vertex. After executing the algorithm on the vertices, value pairs associated with the vertices are aggregated. The aggregated value pairs indicate shortest distances from the respective vertices to the source vertex. The aggregated value pairs are outputted.

A system and process for converting a digital media file into a digital token is disclosed. The embodiments modify a digital media file so that a set of rules are attached to the digital media file creating a digital token, which can be used to persist the digital media file through a network. In an exemplary embodiment, the network is a distributed ledger or blockchain based network that securely tracks distribution of the digital media file. The digital token may have a value added to it or value may intrinsically exist as the digital token is persisted through the network. The value associated with distribution of the digital media file may be used to reward the owner of the digital media file, distributors of the token, or as an incentive program for commercial transactions and non-commercial transactions.

A method, system, and apparatus for simultaneous media collaboration between remotely located users is disclosed. Unlike the existing collaboration methods currently used, which often include emailing files and comments back and forth between different users, the disclosed system and method enables real-time communication and collaboration between remotely located users without requiring the use of email or editing software.