RLFC: Random Access Light Field Compression using Key Views and Bounded Integer Encoding

We present a new hierarchical compression scheme for encoding light field images (LFI) that is suitable for interactive rendering. Our method (RLFC) exploits redundancies in the light field images by constructing a tree structure. The top level (root) of the tree captures the common high-level details across the LFI, and other levels (children) of the tree capture specific low-level details of the LFI. Our decompressing algorithm corresponds to tree traversal operations and gathers the values stored at different levels of the tree. Furthermore, we use bounded integer sequence encoding which provides random access and fast hardware decoding for compressing the blocks of children of the tree. We have evaluated our method for 4D two-plane parameterized light fields. The compression rates vary from 0.08 - 2.5 bits per pixel (bpp), resulting in compression ratios of around 200:1 to 20:1 for a PSNR quality of 40 to 50 dB. The decompression times for decoding the blocks of LFI are 1 - 3 microseconds per channel on an NVIDIA GTX-960 and we can render new views with a resolution of 512X512 at 200 fps. Our overall scheme is simple to implement and involves only bit manipulations and integer arithmetic operations.Comment: Accepted for publication at Symposium on Interactive 3D Graphics and Games (I3D '19

Verifying OpenJDK's LinkedList using KeY

As a particular case study of the formal verification of state-of-the-art, real software, we discuss the specification and verification of a corrected version of the implementation of a linked list as provided by the Java Collection framework

Implementing Secure Group Communications using Key Graphs

While the technical issues of securing unicast communications for client-server computingare fairly well-understood, the technical issues of securing group communications are not. Theexisting approach to improve the scalability is to decompose a large group of clients into manysubgroups and employ a hierarchy of group security agents. In this paper, the secure groupcommunications using key graphs and the implementation of a different hierarchical approachto improve the scalability and secure group communication using key graphs has been presented

Single Cloud Security Enhancement using key Sharing Algorithm

The use of Cloud Computing (CC) has increased rapidly in many institutions. Few of the advantages of CC is cloud data storage, where the customers do not have to store their data on their remote servers, but the data is stored on the cloud service provider’s (CSP) side. To this end, security in Cloud computing is taken to be one of the most important aspects due to the sensitive and confidential information stored in the remote database(cloud) by the users. Our paper signifies a model to securely store information into the cloud in a manner that preserves data confidentiality, integrity and ensures availability. Our approach ensures the security and privacy of client sensitive information by storing data across single cloud, using a secret sharing approach that uses Shamir’s secret sharing key algorithm. The model avoids an unauthorized access and reduces the consequences of encryption techniques

Asymptotic stability of stochastic differential equations driven by Lévy noise

Using key tools such as Ito's formula for general semimartingales, Kunita's moment estimates for Levy-type stochastic integrals, and the exponential martingale inequality, we find conditions under which the solutions to the stochastic differential equations (SDEs) driven by Levy noise are stable in probability, almost surely and moment exponentially stable

Asymptotic stability of stochastic differential equations driven by Lévy noise

Using key tools such as Ito's formula for general semimartingales, Kunita's moment estimates for Levy-type stochastic integrals, and the exponential martingale inequality, we find conditions under which the solutions to the stochastic differential equations (SDEs) driven by Levy noise are stable in probability, almost surely and moment exponentially stable

Sharing of Data Using Key Aggregation and Searchable Encryption

Sharing data with different users is an important functionality of the cloud. However, while enjoying the convenience provided by the cloud storage, user’s main concern is regarding the data leakage present in cloud. A promising approach to prevent this is encryption of data before uploading onto cloud. The desire to selectively and securely share documents with any group of users demands different documents to have different encryption keys. This necessitates the distribution of a large number of keys to users for both encryption and search, those users will have to securely store these keys, and submit an equally large number of keyword trapdoors to the cloud in order to perform search. In this paper, we resolve this problem by extending the concept of Key Aggregate Searchable Encryption (KASE) scheme which employs a single aggregate key and a single trapdoor. Here, the data owner only needs to distribute a single key to a user for sharing a large number of documents, and the user only needs to submit a single trapdoor to the cloud for querying the documents. Also, we provide a functionality of selection of keyword based on their rank by the Data owner in such a way that the selected keywords describe the file. Thus, this scheme makes the management of the keys efficient and also makes the sharing of documents over the cloud more secure

Clostridium difficile infection in the United States: A national study assessing preventive practices used and perceptions of practice evidence

We surveyed 571 US hospitals about practices used to prevent Clostridium difficile infection (CDI). Most hospitals reported regularly using key CDI prevention practices, and perceived their strength of evidence as high. The largest discrepancy between regular use and perceived evidence strength occurred with antimicrobial stewardship programs.Infect. Control Hosp. Epidemiol. 2015;36(8):969–971</jats:p