Abstract: In one embodiment, it is proposed a method for storing input data on a set of DNA strands, said input data being represented in a numeral system. This method is remarkable in that it comprises: formatting said input data into a set of blocks of data, each block of data having a size inferior to a size of one DNA strand; applying a first encoding with an erasure code on said set of blocks of data, defining a first set of modified blocks of data, each modified block of data having a size inferior to a size of one DNA strand; applying a second encoding using an error correcting code on each modified block of data of said first set, defining a second set of modified blocks of data, each modified block having a size inferior to a size of one DNA strand; encoding each modified block of data of said second set into a nucleotides block sequence; generating a set of DNA strands, each DNA strand comprising a nucleotides block sequence obtained through said encoding.

Abstract: An access point receives from a client a first nonce and a first cryptographic hash for the first nonce, the first cryptographic hash calculated using a first key derived from a second key, the second key input on the client or derived from a passphrase input on the client, derives first keys from each of a stored primary input and at least one stored secondary input valid at the deriving, the stored primary input and the at least one stored secondary input each being one of a second key and a passphrase, verifies the cryptographic hash using each derived first key to find a derived first key that checks the first cryptographic hash, generates a third key and a second cryptographic hash using the derived first key that checks the first cryptographic hash, and sends the third key and the second cryptographic hash to the client.

Abstract: The present invention relates to a reliable method and device for backup of data from a first network to a second network. The method and device of the present invention can for example be used for a backup of voluminous data from the first to the second network via a link with a relatively small bandwidth.

Abstract: It is provided a method for checking plausibility of a value received from a device. It comprises receiving, by a neighbor of the device at a current time instant, a current output value and a previous output value of the device (S410) and; determining, by the neighbor of the device, that a value evolution between the current output value and the previous output value of the device is implausible according to the value evolution.

Abstract: In one embodiment, it is proposed a method for storing input data on a set of DNA strands, said input data being represented in a numeral system. This method is remarkable in that it comprises: formatting said input data into a set of blocks of data, each block of data having a size inferior to a size of one DNA strand; applying a first encoding with an erasure code on said set of blocks of data, defining a first set of modified blocks of data, each modified block of data having a size inferior to a size of one DNA strand; applying a second encoding using an error correcting code on each modified block of data of said first set, defining a second set of modified blocks of data, each modified block having a size inferior to a size of one DNA strand; encoding each modified block of data of said second set into a nucleotides block sequence; generating a set of DNA strands, each DNA strand comprising a nucleotides block sequence obtained through said encoding.

Abstract: A device and a method for online storage, device and method for searching for similar content, a device and a method of transmission and a device and a method. Encrypted data is saved at a provider of online services. With the encrypted data, encrypted hashing data is saved with a public key and the content to save is encrypted with the encrypted hash. This advantageously enables data duplication at the online service provider to be prevented while preserving the private life of the users of the service. In order to search for content similar to reference multimedia data, fingerprints are also saved at the service provider. In order to limit the number of false positives returned, the fingerprint can further contain a search fingerprint, an encrypted selection fingerprint.

Abstract: A client has a block of the code to be executed, executes the part and then determines the next block and requests it from a server that returns the block and a list of possible following blocks, and updates a list of blocks executed by the client. The client then executes the next block. To modify the program, it is sufficient to patch the corresponding block or blocks on the server. The transition system, which defines possible following blocks, is modified to integrate the new block in place of the old one. Depending on the modifications, it may be necessary to patch the memory of the client too. In this case, a complement block is added in order to modify the client memory to be compatible with the new block.

Abstract: The present invention concerns a method of transferring content from a first communication device to a second communication device in a communication network, comprising the following steps: defining a first probability, according to which a content can be encoded; defining a second probability, according to which a content can be chosen; upon request of content from said second communication device to said first communication device: encoding content with another content according to said first probability, said content being chosen with said second probability, and transferring content z=x XOR y from said first communication device to said second communication device, or according to probability 1?pe transferring unencoded content x from said first communication device to said second communication device.

Abstract: A method and a related electronic device for selecting, from a plurality of candidate video frame sets, a candidate video frame set to be inserted in a video frame slot of a given video content. It comprises obtaining the plurality of candidate video frame sets according to ranking values of a sorting parameter associated with each of the candidate video frame sets, thereby obtaining a list of candidate video frame sets and for each candidate video frame set of the list, determining a processing cost for inserting the candidate video frame set and applying the processing cost for obtaining an updated candidate video frame set ranking value according to the sorting parameter. The list is then sorted according to the updated ranking values of the sorting parameter and a selection of a candidate video frame set of the sorted list according to the updated ranking value.

Abstract: Video is provided in chunks to a player. Some chunks need to be computed because they are targeted to a particular user. Computing of targeted chunks is done by cloud computing instances that pop jobs from associated queues. Targeted chunks may be required sooner or later than initially expected due to the player using trick modes. In order to have targeted chunks delivered to the player at the right time, a play time tracker regularly inserts overloaded chunk requests in the manifest file. The overloaded requests comprise references to future needed targeted chunks as well as expected play out time of these chunks. Overloaded requests are verified and if it is determined that the future needed targeted chunk has not already been computed, a message for verification is transmitted to a scheduler. The scheduler verifies if measures need to be taken to ensure timely delivery of the targeted video chunks.

Abstract: Method for providing targeted content in image frames of a video and corresponding device A scalable and flexible solution for targeting a video through overlaying image frame zones with content that is targeted to individual users according to user preferences is provided. A video sequence is processed to determine sequences of image frames that comprise overlayable zones for overlay with targeted content. Features that describe these frames and these zones for a content overlay operation are stored in metadata that is associated to the unmodified video sequence. When the video is transmitted to a user, the metadata is used to overlay content in the overlayable zones, whereby the content is chosen according to the preferences of the user.

Abstract: The present invention relates to a reliable method and device for backup of data from a first network to a second network. The method and device of the present invention can for example be used for a backup of voluminous data from the first to the second network via a link with a relatively small bandwidth.

Abstract: The invention proposes a method and corresponding device for exact repair of pairs of failed storage nodes interconnected in a distributed data storage system, which method and device are particularly efficient with respect to reliability while keeping the use of resources of the distributed storage network low.

Abstract: A method for securely accessing a web service by a web application running in a browser on a user device through a network is disclosed. The web service is hosted by at least a device among which a local device is being accessed by the user device. The local device comprises a global name that uniquely identifies the local device and a certificate associated to the global name.

Abstract: It is provided a method for providing content for a video.

Abstract: The methods of the invention of storing a data item and the associated method of repair of a failed storage device allow exact repair of the data lost by a failed storage device in a distributed data storage system. As repaired data is exactly identical to lost data, this simplifies data integrity checking, which is appealing for distributed data storage systems that require a high level of data security. The methods and devices of the invention use erasure correcting codes that are optimized at the MBCR point such that they minimize both storage size required to store a data item and repair bandwidth required for data- and message exchange between the devices of the distributed storage system in case of repair.

Abstract: The present invention generally relates to distributed data storage systems, where different devices manipulate data shared by these devices. In particular, the technical field of the present invention is to related storing of data in a distributed data storage system and associated data synchronization for devices connecting to such a system.

Abstract: A scalable and cost-effective solution for implementing a cache in a data processing environment. A sliding window comprises a number of past time slots. For each time slot, a number of request for a data item is counted. A mean request rate for the data item is computed over the sliding window. If the mean request rate is superior to a threshold, the data item is added to cache, or the data item is removed from cache otherwise.

Abstract: The present disclosure relates to a method for selecting nodes in networks, especially in complex networks with a great number of interconnected nodes and edges, by using a first centrality computation to filter the nodes and deliver a sub-network with a smaller number of nodes, to which can be applied a second centrality computation.

Abstract: A replication set of k storage devices is defined, that stores a particular data item. Each device in the replication set has an associated timer for which a timeout value for disconnection is determined based on individual downtime data distribution of the device. A new device for storing the data item is added to the replication set when the timer expires for a device in the replication set, and if the number of devices in the replication set that are still connected is below a predetermined threshold. Timeout values are adapted according to a factor of criticalness determined for the replication set, resulting in a more reactive, or on the contrary, a less reactive replacement of devices in the replication set. The factor of criticalness is determined according to a difference between the connected devices in the replication set and the predetermined number k.