International Institute of Information Technology, Hyderabad

About: International Institute of Information Technology, Hyderabad is a education organization based out in Hyderabad, India. It is known for research contribution in the topics: Computer science & Authentication. The organization has 2048 authors who have published 3677 publications receiving 45319 citations. The organization is also known as: IIIT Hyderabad & International Institute of Information Technology (IIIT).

Structures, Dynamics, and Stabilities of Fully Modified Locked Nucleic Acid (β-d-LNA and α-l-LNA) Duplexes in Comparison to Pure DNA and RNA Duplexes

Abstract: Locked nucleic acid (LNA) is a chemical modification which introduces a -O-CH2- linkage in the furanose sugar of nucleic acids and blocks its conformation in a particular state. Two types of modifications, namely, 2'-O,4'-C-methylene-β-D-ribofuranose (β-D-LNA) and 2'-O,4'-C-methylene-α-L-ribofuranose (α-L-LNA), have been shown to yield RNA and DNA duplex-like structures, respectively. LNA modifications lead to increased melting temperatures of DNA and RNA duplexes, and have been suggested as potential therapeutic agents in antisense therapy. In this study, molecular dynamics (MD) simulations were performed on fully modified LNA duplexes and pure DNA and RNA duplexes sharing a similar sequence to investigate their structure, stabilities, and solvation properties. Both LNA duplexes undergo unwinding of the helical structure compared to the pure DNA and RNA duplexes. Though the α-LNA substituent has been proposed to mimic deoxyribose sugar in its conformational properties, the fully modified duplex was found to exhibit unique structural and dynamic properties with respect to the other three nucleic acid structures. Free energy calculations accurately capture the enhanced stabilization of the LNA duplex structures compared to DNA and RNA molecules as observed in experiments. π-stacking interaction between bases from complementary strands is shown to be one of the contributors to enhanced stabilization upon LNA substitution. A combination of two factors, namely, nature of the -O-CH2- linkage in the LNAs vs their absence in the pure duplexes and similar conformations of the sugar rings in DNA and α-LNA vs the other two, is suggested to contribute to the stark differences among the four duplexes studied here in terms of their structural, dynamic, and energetic properties.

Semantic Motion Segmentation Using Dense CRF Formulation

Abstract: While the literature has been fairly dense in the areas of scene understanding and semantic labeling there have been few works that make use of motion cues to embellish semantic performance and vice versa. In this paper, we address the problem of semantic motion segmentation, and show how semantic and motion priors augments performance. We propose an algorithm that jointly infers the semantic class and motion labels of an object. Integrating semantic, geometric and optical flow based constraints into a dense CRF-model we infer both the object class as well as motion class, for each pixel. We found improvement in performance using a fully connected CRF as compared to a standard clique-based CRFs. For inference, we use a Mean Field approximation based algorithm. Our method outperforms recently proposed motion detection algorithms and also improves the semantic labeling compared to the state-of-the-art Automatic Labeling Environment algorithm on the challenging KITTI dataset especially for object classes such as pedestrians and cars that are critical to an outdoor robotic navigation scenario.

Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary

Abstract: In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple parallel edges (called wires), each of which are directed from S to R or vice-versa. The unreliability of the network is modeled by a Byzantine adversary with infinite computing power. We investigate the problem with two different adversarial settings: (i) threshold and (ii) non-threshold. In [1], the authors have characterized PSMT against a t-active threshold adversary in directed networks1. However, their PSMT protocol was exponential both in terms of number of phases2 and communication complexity. In addition, they also presented a polynomial phase PSMT protocol with n′ = max(3t-u+1, 2t+1) wires from S to R. In this paper, we significantly improve the exponential phase protocol and present an elegant and efficient three phase PSMT protocol with polynomial communication complexity (and computational complexity) with n= max(3t-2u+1, 2t+1) wires from S to R. Also with n′ = max(3t - u + 1, 2t + 1) wires from S to R, we are able to further improve the communication complexity of our three phase PSMT protocol. Our second contribution in this paper is the first ever characterization for any two phase PSMT protocol. Finally, we also characterize PSMT protocol in directed networks tolerating nonthreshold adversary. In [3], the authors have given the characterization for PSMT against non-threshold adversary. However, in their characterization, they have only considered the paths from S to R, excluding the feedback paths (i.e paths from R to S) and hence their characterization holds good only for single phase protocols. We characterize multiphase PSMT considering feedback paths.

A Hybrid Approach for Anaphora Resolution in Hindi

Abstract: In this paper we present a hybrid approach to resolve Entity-pronoun references in Hindi. While most of the existing approaches, syntactic as well as data-driven, use phrase-structure syntax for anaphora resolution, we explore use of dependency structures as a source of syntactic information. In our approach, dependency structures are used by a rule-based module to resolve simple anaphoric references, while a decision tree classifier is used to resolve more ambiguous instances, using grammatical and semantic features. Our results show that, use of dependency structures provides syntactic knowledge which helps to resolve some specific types of references. Semantic information such as animacy and Named Entity categories further helps to improve the resolution accuracy.