scispace - formally typeset
Search or ask a question
Institution

International Institute of Information Technology, Hyderabad

EducationHyderabad, India
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).


Papers
More filters
Journal ArticleDOI
TL;DR: A variant of DTW based algorithm referred to as non-segmental DTW (NS-DTW) is used, with a computational upper bound of O (mn) and analyzed the performance of QbE-STD with Gaussian posteriorgrams obtained from spectral and temporal features of the speech signal, showing that frequency domain linear prediction cepstral coefficients can be used as an alternative to traditional spectral parameters.
Abstract: The task of query-by-example spoken term detection (QbE-STD) is to find a spoken query within spoken audio data. Current state-of-the-art techniques assume zero prior knowledge about the language of the audio data, and thus explore dynamic time warping (DTW) based techniques for the QbE-STD task. In this paper, we use a variant of DTW based algorithm referred to as non-segmental DTW (NS-DTW), with a computational upper bound of O (mn) and analyze the performance of QbE-STD with Gaussian posteriorgrams obtained from spectral and temporal features of the speech signal. The results show that frequency domain linear prediction cepstral coefficients, which capture the temporal dynamics of the speech signal, can be used as an alternative to traditional spectral parameters such as linear prediction cepstral coefficients, perceptual linear prediction cepstral coefficients and Mel-frequency cepstral coefficients. We also introduce another variant of NS-DTW called fast NS-DTW (FNS-DTW) which uses reduced feature vectors for search. With a reduction factor of α ∈ ℕ, we show that the computational upper bound for FNS-DTW is O(mn/(α2)) which is faster than NS-DTW.

57 citations

Journal ArticleDOI
TL;DR: The role of CDP chiral auxiliaries on the solvent-induced helical assembly and reversible chiroptical switching of naphthalenediimides is emphasized.
Abstract: Understanding the roles of various parameters in orchestrating the preferential chiral molecular organization in supramolecular self-assembly processes is of great significance in designing novel molecular functional systems. Cyclic dipeptide (CDP) chiral auxiliary-functionalized naphthalenediimides (NCDPs 1-6) have been prepared and their chiral self-assembly properties have been investigated. Detailed photophysical and circular dichroism (CD) studies have unveiled the crucial role of the solvent in the chiral aggregation of these NCDPs. NCDPs 1-3 form supramolecular helical assemblies and exhibit remarkable chiroptical switching behaviour (M- to P-type) depending on the solvent composition of HFIP and DMSO. The strong influence of solvent composition on the supramolecular chirality of NCDPs has been further corroborated by concentration and solid-state thin-film CD studies. The chiroptical switching between supramolecular aggregates of opposite helicity (M and P) has been found to be reversible, and can be achieved through cycles of solvent removal and redissolution in solvent mixtures of specific composition. The control molecular systems (NCDPs 4-6), with an achiral or D-isomer second amino acid in the CDP auxiliary, did not show chiral aggregation properties. The substantial roles of hydrogen bonding and π-π interactions in the assembly of the NCDPs have been validated through nuclear magnetic resonance (NMR), photophysical, and computational studies. Quantum chemical calculations at the ab initio, semiempirical, and density functional theory levels have been performed on model systems to understand the stabilities of the right (P-) and left (M-) handed helical supramolecular assemblies and the nature of the intermolecular interactions. This study emphasizes the role of CDP chiral auxiliaries on the solvent-induced helical assembly and reversible chiroptical switching of naphthalenediimides.

57 citations

Book ChapterDOI
21 Jun 2010
TL;DR: This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties using the paradigm of secret sharing, which allows the data to be divided into multiple shares and processed separately at different servers.
Abstract: This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering is one of the fundamental algorithms used in the field of data mining. Advances in data acquisition methodologies have resulted in collection and storage of vast quantities of user’s personal data. For mutual benefit, organizations tend to share their data for analytical purposes, thus raising privacy concerns for the users. Over the years, numerous attempts have been made to introduce privacy and security at the expense of massive additional communication costs. The approaches suggested in the literature make use of the cryptographic protocols such as Secure Multiparty Computation (SMC) and/or homomorphic encryption schemes like Paillier’s encryption. Methods using such schemes have proven communication overheads. And in practice are found to be slower by a factor of more than 106. In light of the practical limitations posed by privacy using the traditional approaches, we explore a paradigm shift to side-step the expensive protocols of SMC. In this work, we use the paradigm of secret sharing, which allows the data to be divided into multiple shares and processed separately at different servers. Using the paradigm of secret sharing, allows us to design a provably-secure, cloud computing based solution which has negligible communication overhead compared to SMC and is hence over a million times faster than similar SMC based protocols.

57 citations

Journal ArticleDOI
TL;DR: In this paper, a secure biometrics-based user authentication scheme in WMSNs using smart card is presented and it is shown that the scheme is secure against possible known attacks.
Abstract: A wireless medical sensor network (WMSN ) is a professional application of the traditional wireless body area sensor networks in medicine. Using WMSNs, the parameters of patients' vital signs can be gathered from the sensor nodes deployed on the body of the patients and accessed by the healthcare professionals by using a mobile device. Due to wireless communication, securing communication becomes a vital issue in WMSNs. Since the vital signs parameters are sensitive to the patients' health status and these information must not be revealed to the others except the healthcare professionals, the protection of patients' privacy becomes another key issue for WMSNs applications. Thus, user authentication with anonymity property is the most basic and commonly used method in order to resolve the security and privacy issues of WMSNs. He et al. presented a user authentication protocol for healthcare applications using WMSNs to protect the security and privacy problems. However, Li et al. showed that their scheme is incorrect in authentication and session key agreement phase, has no wrong password detection mechanism and is vulnerable to denial of service caused by password change with wrong password. In this paper, we review Li et al.'s scheme and show that their scheme is still vulnerable to privileged-insider attack, sensor node capture attack and fails to provide user anonymity property. Moreover, we find that He et al.'s scheme is still vulnerable to the same attacks as we find out in Li et al.'s scheme. In order to remedy the security weaknesses found in both He et al.'s scheme and Li et al.'s scheme, we present a secure biometrics-based user authentication scheme in WMSNs using smart card. Through the rigorous formal and informal security analysis, we show that our scheme is secure against possible known attacks. In addition, we simulate our scheme using the most-widely accepted and used Automated Validation of Internet Security Protocols and Applications tool and the simulation results reveal that our scheme is secure. Our scheme is also efficient in computation and communication as compared to He et al.'s scheme, Li et al.'s scheme and other related schemes.

56 citations

Journal ArticleDOI
TL;DR: This paper presents a methodology for computing the maximum velocity profile over a trajectory planned for a mobile robot, indicative of maximum speeds that can be possessed by the robot along its path without colliding with any of the mobile objects that could intercept its future trajectory.

56 citations


Authors

Showing all 2066 results

NameH-indexPapersCitations
Ravi Shankar6667219326
Joakim Nivre6129517203
Aravind K. Joshi5924916417
Ashok Kumar Das562789166
Malcolm F. White5517210762
B. Yegnanarayana5434012861
Ram Bilas Pachori481828140
C. V. Jawahar454799582
Saurabh Garg402066738
Himanshu Thapliyal362013992
Monika Sharma362384412
Ponnurangam Kumaraguru332696849
Abhijit Mitra332407795
Ramanathan Sowdhamini332564458
Helmut Schiessel321173527
Network Information
Related Institutions (5)
Microsoft
86.9K papers, 4.1M citations

90% related

Facebook
10.9K papers, 570.1K citations

89% related

Google
39.8K papers, 2.1M citations

89% related

Carnegie Mellon University
104.3K papers, 5.9M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202310
202229
2021373
2020440
2019367
2018364