Biometric Verification: Looking Beyond Raw Similarity Scores

Author(s):  
G. Aggarwal ◽  
N.K. Ratha ◽  
R.M. Bolle
BioTech ◽  
2020 ◽  
Vol 10 (1) ◽  
pp. 1
Author(s):  
Suriyea Tanbin ◽  
Fazia Adyani Ahmad Fuad ◽  
Azzmer Azzar Abdul Hamid

Dengue fever, which is a disease caused by the dengue virus (DENV), is a major unsolved issue in many tropical and sub-tropical regions of the world. The absence of treatment that effectively prevent further viral propagation inside the human’s body resulted in a high number of deaths globally each year. Thus, novel anti-dengue therapies are required for effective treatment. Human hexokinase II (HKII), which is the first enzyme in the glycolytic pathway, is an important drug target due to its significant impact on viral replication and survival in host cells. In this study, 23.1 million compounds were computationally-screened against HKII using the Ultrafast Shape Recognition with a CREDO Atom Types (USRCAT) algorithm. In total, 300 compounds with the highest similarity scores relative to three reference molecules, known as Alpha-D-glucose (GLC), Beta-D-glucose-6-phosphate (BG6), and 2-deoxyglucose (2DG), were aligned. Of these 300 compounds, 165 were chosen for further structure-based screening, based on their similarity scores, ADME analysis, the Lipinski’s Rule of Five, and virtual toxicity test results. The selected analogues were subsequently docked against each domain of the HKII structure (PDB ID: 2NZT) using AutoDock Vina programme. The three top-ranked compounds for each query were then selected from the docking results based on their binding energy, the number of hydrogen bonds formed, and the specific catalytic residues. The best docking results for each analogue were observed for the C-terminus of Chain B. The top-ranked analogues of GLC, compound 10, compound 26, and compound 58, showed predicted binding energies of −7.2, −7.0, and −6.10 kcal/mol and 7, 5, and 2 hydrogen bonds, respectively. The analogues of BG6, compound 30, compound 36, and compound 38, showed predicted binding energies of −7.8, −7.4, and −7.0 kcal/mol and 11, 9, and 5 hydrogen bonds, while the top three analogues of 2DG, known as compound 1, compound 4, and compound 31, showed predicted binding energies of −6.8, −6.3, and −6.3 kcal/mol and 4, 3, and 1 hydrogen bonds, sequentially. The highest-ranked compounds in the docking analysis were then selected for molecular dynamics simulation, where compound 10, compound 30, and compound 1, which are the analogues of GLC, BG6, and 2DG, have shown strong protein-ligand stability with an RMSD value of ±5.0 A° with a 5 H bond, ±4.0 A° with an 8 H bond, and ±0.5 A° with a 2 H bond, respectively, compared to the reference molecules throughout the 20 ns simulation time. Therefore, by using the computational studies, we proposed novel compounds, which may act as potential drugs against DENV by inhibiting HKII’s activity.


2021 ◽  
pp. 1-13
Author(s):  
Jenish Dhanani ◽  
Rupa Mehta ◽  
Dipti Rana

Legal practitioners analyze relevant previous judgments to prepare favorable and advantageous arguments for an ongoing case. In Legal domain, recommender systems (RS) effectively identify and recommend referentially and/or semantically relevant judgments. Due to the availability of enormous amounts of judgments, RS needs to compute pairwise similarity scores for all unique judgment pairs in advance, aiming to minimize the recommendation response time. This practice introduces the scalability issue as the number of pairs to be computed increases quadratically with the number of judgments i.e., O (n2). However, there is a limited number of pairs consisting of strong relevance among the judgments. Therefore, it is insignificant to compute similarities for pairs consisting of trivial relevance between judgments. To address the scalability issue, this research proposes a graph clustering based novel Legal Document Recommendation System (LDRS) that forms clusters of referentially similar judgments and within those clusters find semantically relevant judgments. Hence, pairwise similarity scores are computed for each cluster to restrict search space within-cluster only instead of the entire corpus. Thus, the proposed LDRS severely reduces the number of similarity computations that enable large numbers of judgments to be handled. It exploits a highly scalable Louvain approach to cluster judgment citation network, and Doc2Vec to capture the semantic relevance among judgments within a cluster. The efficacy and efficiency of the proposed LDRS are evaluated and analyzed using the large real-life judgments of the Supreme Court of India. The experimental results demonstrate the encouraging performance of proposed LDRS in terms of Accuracy, F1-Scores, MCC Scores, and computational complexity, which validates the applicability for scalable recommender systems.


Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2859
Author(s):  
Seong-Yun Jeon ◽  
Mun-Kyu Lee

With the recent advances in mobile technologies, biometric verification is being adopted in many smart devices as a means for authenticating their owners. As biometric data leakage may cause stringent privacy issues, many proposals have been offered to guarantee the security of stored biometric data, i.e., biometric template. One of the most promising solutions is the use of a remote server that stores the template in an encrypted form and performs a biometric comparison on the ciphertext domain, using recently proposed functional encryption (FE) techniques. However, the drawback of this approach is that considerable computation is required for the inner-pairing product operation used for the decryption procedure of the underlying FE, which is performed in the authentication phase. In this paper, we propose an enhanced method to accelerate the inner-pairing product computation and apply it to expedite the decryption operation of FE and for faster remote biometric verification. The following two important observations are the basis for our improvement—one of the two arguments for the decryption operation does not frequently change over authentication sessions, and we only need to evaluate the product of multiple pairings, rather than individual pairings. From the results of our experiments, the proposed method reduces the time required to compute an inner-pairing product by 30.7%, compared to the previous best method. With this improvement, the time required for biometric verification is expected to decrease by up to 10.0%, compared to a naive method.


2021 ◽  
Author(s):  
Syed Sadaf Ali ◽  
Vivek Singh Baghel ◽  
Iyyakutti Iyappan Ganapathi ◽  
Surya Prakash ◽  
Ngoc-Son Vu ◽  
...  

Author(s):  
Stelvio Cimato ◽  
Marco Gamassi ◽  
Vincenzo Piuri ◽  
Roberto Sassi ◽  
Fabio Stelvio Cimato ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document