Abstract: Systems, apparatuses, and methods for integrating a video codec with an inference engine are disclosed. A system is configured to implement an inference engine and a video codec while sharing at least a portion of its processing elements between the inference engine and the video codec. By sharing processing elements when combining the inference engine and the video codec, the silicon area of the combination is reduced. In one embodiment, the portion of processing elements which are shared include a motion prediction/motion estimation/MACs engine with a plurality of multiplier-accumulator (MAC) units, an internal memory, and peripherals. The peripherals include a memory interface, a direct memory access (DMA) engine, and a microprocessor. The system is configured to perform a context switch to reprogram the processing elements to switch between operating modes. The context switch can occur at a frame boundary or at a sub-frame boundary.

Abstract: Methods and systems for storing a file on a plurality of servers are provided including a number of servers and a maximum number of servers which may fail. A predefined number of byzantine failures and a number of crashes of the servers is contemplated. The file is divided into a plurality of chunks, where the number of chunks is equal to or greater than the number of servers. The chunks of the file are sent to the servers, where at least one chunk is sent to each server. The number of replies from the servers indicating successful storage of the respective chunks are determined. The number of replies matching a terminating condition is checked. A new file is generated.

Abstract: A method for replicating data in a cloud storage system supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities (A, B, C) for storing data objects, includes requesting, by a client, values and associated timestamps for a first data object from a first quorum of the object storing entities (A, B, C). The method further includes determining, by the client, a most recent value of the first data object based on the associated timestamps. The method additionally includes performing, by the client, a compare-and-swap procedure, so that the determined value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities (A, B, C).

Abstract: Systems, apparatuses, and methods for integrating a video codec with an inference engine are disclosed. A system is configured to implement an inference engine and a video codec while sharing at least a portion of its processing elements between the inference engine and the video codec. By sharing processing elements when combining the inference engine and the video codec, the silicon area of the combination is reduced. In one embodiment, the portion of processing elements which are shared include a motion prediction/motion estimation/MACs engine with a plurality of multiplier-accumulator (MAC) units, an internal memory, and peripherals. The peripherals include a memory interface, a direct memory access (DMA) engine, and a microprocessor. The system is configured to perform a context switch to reprogram the processing elements to switch between operating modes. The context switch can occur at a frame boundary or at a sub-frame boundary.

Abstract: Methods and systems for storing a file on a plurality of servers are provided including a number of servers and a maximum number of servers which may fail. A predefined number of byzantine failures and a number of crashes of the servers is contemplated. The file is divided into a plurality of chunks, where the number of chunks is equal to or greater than the number of servers. The chunks of the file are sent to the servers, where at least one chunk is sent to each server. The number of replies from the servers indicating successful storage of the respective chunks are determined. The number of replies matching a terminating condition is checked. A new file is generated.

Abstract: Methods and systems for storing a file on a plurality of servers are provided. The number of servers is n and the maximum number of servers which may fail is t. A predefined number b of byzantine failures and a number t?b of crashes of the servers is contemplated, where n equals 2t+b+1. The file is divided into a plurality of chunks, where the number of chunks is equal to or greater than the number of servers. The chunks of the file are sent to the n servers, where at least one chunk is sent to each server. The number of replies r from the n servers indicating successful storage of the respective chunks are determined. The number of replies r matching a terminating condition is checked. A new file based is generated. The process is repeated for the new file.

Abstract: A method for generating a dataset structure for location-based services includes partitioning a geographical area, including areas of interest, into tiles. The tiles are associated with servers, wherein each of the tiles is associated with at least one server based on a consistent hashing function. For each of the tiles, a first dataset is generated which includes the areas of interest intersecting the tile. The areas of interest of the first dataset are trimmed by edges of the tile or completely contained in the tile. For each of the tiles, a second dataset is generated which includes overflowed parts. Each of the overflowed parts is part of an areas of interest of the first dataset, is trimmed by an edge of the tile and is located outside of the tile. For each of the tiles, the first and second datasets are stored at the server(s) associated to the tile.

Abstract: A method for preserving privacy within a communication system, wherein a location-based service concerning an area of interest is provided for at least one user by a database server and wherein location information represented by coordinates of objects and/or users and/or areas and/or queries, made to the location-based service, is concealed, includes concealing the location information by transforming coordinates by first splitting the area of interest up in tiles for providing at least one tiling of the area of interest, and then permuting the tiles by a pseudo-random permutation process.

Abstract: A method for byzantine fault tolerant data replication with a plurality of 2f+1 data servers and one or more clients includes storing data in at least f+1 different data servers out of the 2f+1 data servers, and storing metadata of the stored data under a metadata-identifier in a metadata-service (MDS). The stored metadata includes a unique identifier of the stored data, a fingerprint of the stored data, and a list of the at least f+1 different data servers which have stored the data.

Abstract: A method is used to build a concurrent data structure in the form of a ranked register based on a Compare-And-Swap (CAS) functionality and an according ranked register, to allow reliable access of shared data within a storage by multiple clients. Read and write operations are defined within the ranked register. The read operation takes a rank as argument and returns a rank-value pair. The write operation takes a rank-value pair as argument and returns either commit or abort. The read operation returns a rank-value pair that was written in a previous write operation.

Abstract: A method for preserving privacy within a communication system, wherein a location-based service concerning an area of interest is provided for at least one user by a database server and wherein location information represented by coordinates of objects and/or users and/or areas and/or queries, made to the location-based service, is concealed, includes concealing the location information by transforming coordinates by first splitting the area of interest up in tiles for providing at least one tiling of the area of interest, and then permuting the tiles by a pseudo-random permutation process.

Abstract: A method for byzantine fault tolerant data replication with a plurality of 2f+1 data servers and one or more clients includes storing data in at least f+1 different data servers out of the 2f+1 data servers, and storing metadata of the stored data under a metadata-identifier in a metadata-service (MDS). The stored metadata includes a unique identifier of the stored data, a fingerprint of the stored data, and a list of the at least f+1 different data servers which have stored the data.

Abstract: A method and system for storing data in a key value storage having a plurality of n servers, wherein t<n servers may fail arbitrarily and wherein 3t+1=n is satisfied, the method includes: a) generating commitment information for a secret information, b) disseminating a first message including the data to be stored, a corresponding key for the data and the generated commitment information to the n servers, c) storing the information included in the first message on at least a number of servers, d) providing first storing confirmation information by at least n-t servers, e) disseminating a second message including corresponding key and the secret information to the n servers, f) storing the information included in the second message, and g) providing second storing confirmation information by at least n-t servers.

Abstract: A method is used to build a concurrent data structure in the form of a ranked register based on a Compare-And-Swap (CAS) functionality and an according ranked register, to allow reliable access of shared data within a storage by multiple clients. Read and write operations are defined within the ranked register. The read operation takes a rank as argument and returns a rank-value pair. The write operation takes a rank-value pair as argument and returns either commit or abort. The read operation returns a rank-value pair that was written in a previous write operation.

Abstract: A method for generating a dataset structure for location-based services includes partitioning a geographical area, including areas of interest, into tiles. The tiles are associated with servers, wherein each of the tiles is associated with at least one server based on a consistent hashing function. For each of the tiles, a first dataset is generated which includes the areas of interest intersecting the tile. The areas of interest of the first dataset are trimmed by edges of the tile or completely contained in the tile. For each of the tiles, a second dataset is generated which includes overflowed parts. Each of the overflowed parts is part of an areas of interest of the first dataset, is trimmed by an edge of the tile and is located outside of the tile. For each of the tiles, the first and second datasets are stored at the server(s) associated to the tile.

Abstract: The present invention relates to a method for storing a file on a plurality of servers, wherein the number of servers is n and the maximum number of servers which might be fail is t, preferably including a predefined number b of byzantine failures and a number t?b of crashes of the servers, and wherein n equals 2t+b+1, comprising the steps of a) Dividing the file into a plurality of chunks, wherein the number of chunks is equal to or greater than the number of servers n, b) Sending n chunks of the file to the n servers, wherein one chunk is sent to each server, c) Determining the number of replies r from the n servers indicating successful storage of the respective chunks, d) Checking if the number of replies r matches a terminating condition, and if not e) Generating a new file based on one or more chunks of the old file, a reconstruction threshold of the old file and the number of replies, f) Perform steps a)-e) with the new file as file for these steps, until the terminating condition in step d) is fulfil

Abstract: A method for replicating data in a cloud storage system supporting multiple clients, wherein the cloud storage system comprises a plurality of object storing entities (A, B, C) for storing data objects, includes requesting, by a client, values and associated timestamps for a first data object from a first quorum of the object storing entities (A, B, C). The method further includes determining, by the client, a most recent value of the first data object based on the associated timestamps. The method additionally includes performing, by the client, a compare-and-swap procedure, so that the determined value and its corresponding timestamp for the first data object updates the first data object with a value with a newer timestamp and stores the first data object in a second quorum of the object storing entities (A, B, C).

Abstract: A method and system for storing data in a key value storage having a plurality of n servers, wherein t<n servers may fail arbitrarily and wherein 3t+1=n is satisfied, the method includes: a) generating commitment information for a secret information, b) disseminating a first message including the data to be stored, a corresponding key for the data and the generated commitment information to the n servers, c) storing the information included in the first message on at least a number of servers, d) providing first storing confirmation information by at least n-t servers, e) disseminating a second message including corresponding key and the secret information to the n servers, f) storing the information included in the second message, and g) providing second storing confirmation information by at least n-t servers.