Search

Physical unclonable functions (PUFs) have emerged as a promising encryption technology, utilizing intrinsic physical identifiers that offer enhanced security and tamper resistance. Multi‐level PUFs boost system complexity, thereby improving system reliability and fault tolerance. However, crosstalk‐free multi‐level PUFs remain a persistent challenge. In this study, a hierarchical PUF system that harnesses the spontaneous phase separation of silk fibroin /PVA blend and the random distribution of silicon‐vacancy diamonds within the blend is presented. The thermodynamic instability of phase separation and inherent unpredictability of diamond dispersion gives rise to intricate random patterns at two distinct scales, enabling time‐efficient hierarchical authentication for cryptographic keys. These patterns are complementary yet independent, inherently resistant to replication and damage thus affording robust security and reliability to the proposed system. Furthermore, customized authentication algorithms are constructed: visual PUFs authentication utilizes neural network combined structural similarity index measure, while spectral PUFs authentication employs Hamming distance and cross‐correlation bit operation. This hierarchical PUF system attains a high recognition rate without interscale crosstalk. Additionally, the coding capacity is exponentially enhanced using M‐ary encoding to reinforce multi‐level encryption. Hierarchical PUFs hold significant potential for immediate application, offering unprecedented data protection and cryptographic key authentication capabilities. [ABSTRACT FROM AUTHOR]

The so-called Hamming distance measures the difference between two binary strings A and B. In simplified form, it measures the number of changes in A to get B. This type of distance is very useful in classical computing in applications such as error correction. It is also advantageous in quantum computing, being for example widely used in quantum machine learning. Since current quantum computers have limited resources, this type of distance is particularly attractive because it can be computed using fewer qubits and operations than other distances such as Euclidean or Manhattan distances. In this paper, two circuits for calculating Hamming distances using exclusively Clifford+T gates are presented. The aim of both circuits is to reduce the quantum cost and number of T gates needed to compute the Hamming distance. The T gate is more expensive than the other gates, so this reduction will have a significant impact on the total cost of the circuits. Furthermore, the proposed circuits are implemented using only Clifford+T gates. The circuits implemented exclusively with this group of gates are compatible with proven error detection and correction codes. [ABSTRACT FROM AUTHOR]

Background: Modeling causality through graphs, referred to as causal graph learning, offers an appropriate description of the dynamics of causality. The majority of current machine learning models in clinical decision support systems only predict associations between variables, whereas causal graph learning models causality dynamics through graphs. However, building personalized causal graphs for each individual is challenging due to the limited amount of data available for each patient. Method: In this study, we present a new algorithmic framework using meta-learning for learning personalized causal graphs in biomedicine. Our framework extracts common patterns from multiple patient graphs and applies this information to develop individualized graphs. In multi-task causal graph learning, the proposed optimized initial guess of shared commonality enables the rapid adoption of knowledge to new tasks for efficient causal graph learning. Results: Experiments on one real-world biomedical causal graph learning benchmark data and four synthetic benchmarks show that our algorithm outperformed the baseline methods. Our algorithm can better understand the underlying patterns in the data, leading to more accurate predictions of the causal graph. Specifically, we reduce the structural hamming distance by 50-75%, indicating an improvement in graph prediction accuracy. Additionally, the false discovery rate is decreased by 20-30%, demonstrating that our algorithm made fewer incorrect predictions compared to the baseline algorithms. Conclusion: To the best of our knowledge, this is the first study to demonstrate the effectiveness of meta-learning in personalized causal graph learning and cause inference modeling for biomedicine. In addition, the proposed algorithm can also be generalized to transnational research areas where integrated analysis is necessary for various distributions of datasets, including different clinical institutions. [ABSTRACT FROM AUTHOR]

In communication technologies such as digital watermarking, wireless sensor networks (WSNs), and visual light communication (VLC), error-correcting codes are crucial. The Enhanced Hadamard Error-Correcting Code (EHC), which is based on 2D Hadamard Basis Images, is a novel error correction technique that is presented in this study. This technique is used to evaluate the effectiveness of the video watermarking scheme. Even with highly sophisticated embedding techniques, watermarks usually fail to resist such comprehensive attacks because of the extraordinarily high compression rate of approximately 1:200 that is frequently employed in video dissemination. It can only be used in conjunction with a sufficient error-correcting coding method. This study compares the efficacy of the well-known Reed–Solomon Code with this novel technique, the Enhanced Hadamard Error-Correcting Code (EHC), in maintaining watermarks in embedded videos. The main idea behind this newly created multidimensional Enhanced Hadamard Error-Correcting Code is to use a 1D Hadamard decoding approach on the 2D base pictures after they have been transformed into a collection of one-dimensional rows. Following that, the image is rebuilt, allowing for a more effective 2D decoding procedure. Using this technique, it is possible to exceed the theoretical error-correcting capacity threshold of ⌊ d m i n − 1 2 ⌋ bits, where d m i n is the Hamming distance. It may be possible to achieve better results by converting the 2D EHC into a 3D format. The new Enhanced Hadamard Code is used in a video watermarking coding scheme to show its viability and efficacy. The original video is broken down using a multi-level interframe wavelet transform during the video watermarking embedding process. Low-pass filtering is applied to the video stream in order to extract a certain frequency range. The watermark is subsequently incorporated using this filtered section. Either the Reed–Solomon Correcting Code or the Enhanced Hadamard Code is used to protect the watermarks. The experimental results show that EHC far outperforms the RS Code and is very resilient against severe MPEG compression. [ABSTRACT FROM AUTHOR]

The three-way decision paradigm is a decision-making approach that is analogous to human reasoning. It involves a neutrosophic set as an efficient tool for handling ambiguity. Using cotangent similarity, the Hamming distance, and the innovative Vicis-Wave Hedges distance for ranking, this study proposes three novel three-way decision models based on the Bayes decision. In particular, single-valued neutrosophic numbers are employed to represent each loss function. The proposed models are then condensed into an algorithm. Subsequently, an example is presented to demonstrate the validity and rationality of the proposed models. Finally, we compare the three models. This research provides a new method for decision-making problems. [ABSTRACT FROM AUTHOR]

Minimizers and convolutional neural networks (CNNs) are two quite distinct popular techniques that have both been employed to analyze categorical biological sequences. At face value, the methods seem entirely dissimilar. Minimizers use min-wise hashing on a rolling window to extract a single important k-mer feature per window. CNNs start with a wide array of randomly initialized convolutional filters, paired with a pooling operation, and then multiple additional neural layers to learn both the filters themselves and how they can be used to classify the sequence. In this study, our main result is a careful mathematical analysis of hash function properties showing that for sequences over a categorical alphabet, random Gaussian initialization of convolutional filters with max-pooling is equivalent to choosing a minimizer ordering such that selected k-mers are (in Hamming distance) far from the k-mers within the sequence but close to other minimizers. In empirical experiments, we find that this property manifests as decreased density in repetitive regions, both in simulation and on real human telomeres. We additionally train from scratch a CNN embedding of synthetic short-reads from the SARS-CoV-2 genome into 3D Euclidean space that locally recapitulates the linear sequence distance of the read origins, a modest step toward building a deep learning assembler, although it is at present too slow to be practical. In total, this article provides a partial explanation for the effectiveness of CNNs in categorical sequence analysis. [ABSTRACT FROM AUTHOR]

Nowadays, product development is challenged by increasing system complexity and stringent time-to-market. To handle the demanding market requirements, knowledge from prior product generations is used to derive new, but partially similar product versions. The concept of product generation engineering, hence, allows manufacturers to release high-quality products within short development times. Therefore, in this paper, we propose a novel approach to evaluate the similarity of two product implementations based on the concept of the Hamming distance. This allows the usage of similarity information in various heuristics as well as in strategies and thus, to improve the product design process. In a wide set of cases, we investigate the quality and similarity of design points. In the experiments, the use of strategies leads to significantly short searching times, but also tends to be too restrictive in certain cases. Simultaneously, the quality of the solutions found in the heuristic design space exploration has been shown to be as good or better than for the search from scratch and considerably closer solutions as part of the non-dominated solution front have been found. [ABSTRACT FROM AUTHOR]

A similar waveform search plays a crucial role in seismology for detecting seismic events, such as small earthquakes and low-frequency events. However, the high computational costs associated with waveform cross-correlation calculations represent bottlenecks during the analysis of long, continuous records obtained from numerous stations. In this study, we developed a deep-learning network to obtain 64-bit hash codes containing information on seismic waveforms. Using this network, we performed a similar waveform search for ∼35 million moving windows developed for the 30 min waveforms recorded continuously at 10 MHz sampling rates using 16 acoustic emission transducers during a laboratory hydraulic fracturing experiment. The sampling points of each channel corresponded to those of the 5.8-yr records obtained from typical seismic observations at 100 Hz sampling rates. Of the 35 million windows, we searched for windows with small average Hamming distances among the hash codes of 16 channel waveforms against template hash codes of 6057 events that were catalogued using conventional autoprocessing techniques. The calculation of average Hamming distances is 1430–1530 times faster than that of the corresponding network correlation. This hashing-based template matching enabled the detection of 23   462 additional events. We also demonstrated the feasibility of the hashing-based autocorrelation analysis, where similar event pairs were extracted without templates, by calculating the average Hamming distances for all possible pairs of the ∼35 million windows. This calculation required only 15.5 h under 120 thread parallelization. This deep hashing approach significantly reduced the required memory compared with locality-sensitive hashing approaches based on random permutations, enabling similar waveform searching on a large-scale data set. [ABSTRACT FROM AUTHOR]

Existing biohashing authentication schemes usually store bioinformation in the cloud, whose storage method can face the problems of bioinformation leakage and tampering, and single point of failure. To address the above problems, a ciphertext speech biohashing authentication scheme based on chaotic system and improved public chain is proposed. First, the fusion features are extracted and generated with the inner product of 3D chaotic system to generate the biohashing sequence. Second, the original speech is encrypted and uploaded to the InterPlanetary file system and then, uploaded to the blockchain after the data are encrypted. Finally, the server matches the hash sequence queried on the chain with the to-be-authenticated hash at the user's end using the Hamming distance. The experimental results show that the biohashing algorithm in this paper has better distinguishability, robustness, security and time efficiency. The key space of the speech encryption algorithm is 2 256 , which can well resist the exhaustive attack and ensure the security during speech authentication. In this paper, the combination of on-chain and off-chain storage of speech information can prevent the problem of bioinformation leakage and tampering, as well as avoiding the problem of single point of failure. [ABSTRACT FROM AUTHOR]

Testing modern integrated circuit (IC) is challenging with introduction of System-on Chip (SOC). Enormous test pattern count is required to authenticate the IC which inflates power consumption. Henceforth, it is mandatory to incorporate power minimization techniques at circuit design phase. Optimizing test patterns is one such effective technique that curtails test power without altering circuit design. In this paper, a new test pattern reordering algorithm is proposed based on Recurrent Neural Network. Hopfield Neural Network (HNN) constitutes an optimized solution for solving traveling salesman problem (TSP). Since, test pattern reordering can be interpreted as TSP, optimized test pattern order is attained with HNN. Energy function of this algorithm falls into local minimum, so to eradicate this issue, the algorithm is modified. Test patterns are reordered with minimal hamming distance among consecutive test patterns. The proposed algorithm is implemented in ISCAS'89 Sequential Benchmark circuits. Experimental results prove that significant reduction in transition count is accomplished with proposed algorithm without compromising fault coverage. [ABSTRACT FROM AUTHOR]

We developed a macroscopic description of the evolutionary dynamics by following the temporal dynamics of the total Shannon entropy of sequences, denoted by S, and the average Hamming distance between them, denoted by H. We argue that a biological system can persist in the so-called quasi-equilibrium state for an extended period, characterized by strong correlations between S and H, before undergoing a phase transition to another quasi-equilibrium state. To demonstrate the results, we conducted a statistical analysis of SARS-CoV-2 data from the United Kingdom during the period between March 2020 and December 2023. From a purely theoretical perspective, this allowed us to systematically study various types of phase transitions described by a discontinuous change in the thermodynamic parameters. From a more-practical point of view, the analysis can be used, for example, as an early warning system for pandemics. [ABSTRACT FROM AUTHOR]

As available genomic interval data increase in scale, we require fast systems to search them. A common approach is simple string matching to compare a search term to metadata, but this is limited by incomplete or inaccurate annotations. An alternative is to compare data directly through genomic region overlap analysis, but this approach leads to challenges like sparsity, high dimensionality, and computational expense. We require novel methods to quickly and flexibly query large, messy genomic interval databases. Here, we develop a genomic interval search system using representation learning. We train numerical embeddings for a collection of region sets simultaneously with their metadata labels, capturing similarity between region sets and their metadata in a low-dimensional space. Using these learned co-embeddings, we develop a system that solves three related information retrieval tasks using embedding distance computations: retrieving region sets related to a user query string, suggesting new labels for database region sets, and retrieving database region sets similar to a query region set. We evaluate these use cases and show that jointly learned representations of region sets and metadata are a promising approach for fast, flexible, and accurate genomic region information retrieval. [ABSTRACT FROM AUTHOR]

Feature extraction and matching are the basic procedures of the so-called Visual Odometer (VO), Simultaneous Localization and Mapping (SLAM) and many other image processing algorithms. Oriented features from accelerated segment test (FAST) and rotated binary robust independent elementary features (ORB) algorithm are widely used since they are computationally faster. In this paper, we proposed a method to generate a value for a feature, the value is called signature. In the matching step, we only compute Hamming distances of descriptors with the same signatures. Hence, the matching time is shortened. Compared with the original ORB algorithm, features to be matched dropped 69.63% on TUM datasets and 85.7% on VGG datasets by adopting our strategy. In addition, the precision is above 85% on both VGG and TUM datasets. We design a customized hardware architecture for ORB feature extraction and matching based on the proposed method. The hardware structure is implemented on Xilinx ZCU102 evaluation board. The clock frequency is set to 150 MHz. Our Field Programmable Gate Arrays (FPGA) system achieves 193 fps on 1 2 8 0 × 7 2 0 images with 1984 features on average and 314 fps on 6 4 0 × 4 8 0 images with 700 features on average, which is more efficient compared to the state-of-the-art works. [ABSTRACT FROM AUTHOR]

The incorporation of information and communication technologies in the power grids has greatly enhanced efficiency in the management of demand-responses. In addition, smart grids have seen considerable minimization in energy consumption and enhancement in power supply quality. However, the transmission of control and consumption information over open public communication channels renders the transmitted messages vulnerable to numerous security and privacy violations. Although many authentication and key agreement protocols have been developed to counter these issues, the achievement of ideal security and privacy levels at optimal performance still remains an uphill task. In this paper, we leverage on Hamming distance, elliptic curve cryptography, smart cards and biometrics to develop an authentication protocol. It is formally analyzed using the Burrows-Abadi-Needham (BAN) logic, which shows strong mutual authentication and session key negotiation. Its semantic security analysis demonstrates its robustness under all the assumptions of the Dolev-Yao (DY) and Canetti- Krawczyk (CK) threat models. From the performance perspective, it is shown to incur communication, storage and computation complexities compared with other related state of the art protocols. [ABSTRACT FROM AUTHOR]

Recent controllability analyses have demonstrated that driver nodes tend to be associated to genes related to important biological functions as well as human diseases. While researchers have focused on identifying critical nodes, intermittent nodes have received much less attention. Here, we propose a new efficient algorithm based on the Hamming distance for computing the importance of intermittent nodes using a Minimum Dominating Set (MDS)-based control model. We refer to this metric as criticality. The application of the proposed algorithm to compute criticality under the MDS control framework allows us to unveil the biological importance and roles of the intermittent nodes in different network systems, from cellular level such as signaling pathways and cell-cell interactions such as cytokine networks, to the complete nervous system of the nematode worm C. elegans. Taken together, the developed computational tools may open new avenues for investigating the role of intermittent nodes in many biological systems of interest in the context of network control. [ABSTRACT FROM AUTHOR]

Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers. Recently it has been revealed that warm-start approaches can improve the performance of QAOA, where approximate solutions are obtained by classical algorithms in advance and incorporated into the initial state and/or unitary ansatz. In this work, we study in detail how the accuracy of approximate solutions affects the performance of the warm-start QAOA (WS-QAOA). We numerically find that in typical MAX-CUT problems, WS-QAOA achieves higher fidelity (probability that exact solutions are observed) and approximation ratio than QAOA as the Hamming distance of approximate solutions to the exact ones becomes smaller. We reveal that this could be quantitatively attributed to the initial state of the ansatz. We also solve MAX-CUT problems by WS-QAOA with approximate solutions obtained via QAOA, having higher fidelity and approximation ratio than QAOA especially when the circuit is relatively shallow. We believe that our study may deepen understanding of the performance of WS-QAOA and also provide a guide as to the necessary quality of approximate solutions. [ABSTRACT FROM AUTHOR]

Sequence motif discovery algorithms enhance the identification of novel deoxyribonucleic acid sequences with pivotal biological significance, especially transcription factor (TF)-binding motifs. The advent of assay for transposase-accessible chromatin using sequencing (ATAC-seq) has broadened the toolkit for motif characterization. Nonetheless, prevailing computational approaches have focused on delineating TF-binding footprints, with motif discovery receiving less attention. Herein, we present Cis rEgulatory Motif Influence using de Bruijn Graph (CEMIG), an algorithm leveraging de Bruijn and Hamming distance graph paradigms to predict and map motif sites. Assessment on 129 ATAC-seq datasets from the Cistrome Data Browser demonstrates CEMIG's exceptional performance, surpassing three established methodologies on four evaluative metrics. CEMIG accurately identifies both cell-type-specific and common TF motifs within GM12878 and K562 cell lines, demonstrating its comparative genomic capabilities in the identification of evolutionary conservation and cell-type specificity. In-depth transcriptional and functional genomic studies have validated the functional relevance of CEMIG-identified motifs across various cell types. CEMIG is available at https://github.com/OSU-BMBL/CEMIG , developed in C++ to ensure cross-platform compatibility with Linux, macOS and Windows operating systems. [ABSTRACT FROM AUTHOR]

After the tremendous development and fast growth in communication systems and electronic devices, information security and preservation have become one of the most important procedures to be considered when transferring data between two parties. Encryption and data hiding are two of the most important techniques to protect the information sent over networks and the Internet. In this paper, a new technique of encryption and concealment is used through the following steps: First, the secret information is encrypted by using developed DNA to get (S1), second, by scrambling the encrypted data, the (S1) is diffused by using a zigzag method to get (S2), third, re-obfuscation the (S2) by using developed zigzag method through using Tinkerbell technique to get (S3), fourth, perform XoR operation between the (S3) and the Tinkerbell technique to get (S4), and fifth, the (S4) is hidden in the random locations of the cover image based on the LSB technique and the Tinkerbell technology, where the Tinkerbell has incredibly excellent characteristics and used to generate random sequence numbers twice with different initial and parameters value, once for the encryption process for scrambling secret information and once for the hiding process for determining hidden locations. Several metrics were used to evaluate the system's efficiency: histogram, PSNR, MSE, mean absolute error, bit error rate, encryption quality, Unified Average Changing Intensity, hamming distance, entropy, and correlation coefficient. The experimental results display that the suggested method has a good performance and reliability, high security, and greater embedding capacity and ensures higher image quality; also, the proposed method presented preferable outcomes when compared to other approaches. [ABSTRACT FROM AUTHOR]

Fully homomorphic encryption (FHE) cryptographic systems enable limitless computations over encrypted data, providing solutions to many of today's data security problems. While effective FHE platforms can address modern data security concerns in unsecure environments, the extended execution time for these platforms hinders their broader application. This project aims to enhance FHE systems through an efficient parallel framework, specifically building upon the existing torus FHE (TFHE) system chillotti2016faster. The TFHE system was chosen for its superior bootstrapping computations and precise results for countless Boolean gate evaluations, such as AND and XOR. Our first approach was to expand upon the gate operations within the current system, shifting towards algebraic circuits, and using graphics processing units (GPUs) to manage cryptographic operations in parallel. Then, we implemented this GPU-parallel FHE framework into a needed genomic data operation, specifically string search. We utilized popular string distance metrics (hamming distance, edit distance, set maximal matches) to ascertain the disparities between multiple genomic sequences in a secure context with all data and operations occurring under encryption. Our experimental data revealed that our GPU implementation vastly outperforms the former method, providing a 20-fold speedup for any 32-bit Boolean operation and a 14.5-fold increase for multiplications.This paper introduces unique enhancements to existing FHE cryptographic systems using GPUs and additional algorithms to quicken fundamental computations. Looking ahead, the presented framework can be further developed to accommodate more complex, real-world applications. [ABSTRACT FROM AUTHOR]

Geospatial data conflation is the process of identifying and merging the corresponding features in two datasets that represent the same objects in reality. Conflation is needed in a wide range of geospatial analyses, yet it is a difficult task, often considered too unreliable and costly due to various discrepancies between GIS data sources. This study addresses the reliability issue of computerized conflation by developing stronger optimization-based conflation models for matching two network datasets with minimum discrepancy. Conventional models match roads on a feature-by-feature basis. By comparison, we propose a new node-arc conflation model that simultaneously matches road-center lines and junctions in a topologically consistent manner. Enforcing this topological consistency increases the reliability of conflation and reduces false matches. Similar to the well-known rubber-sheeting method, our model allows for the use of network junctions as "control" points for matching network edges. Unlike rubber sheeting, the new model is automatic and matches all junctions (and edges) in one pass. To the best of our knowledge, this is the first optimized conflation model that can match nodes and edges in one model. Computational experiments using six road networks in Santa Barbara, CA, showed that the new model is selective and reduces false matches more than existing optimized conflation models. On average, it achieves a precision of 94.7% with over 81% recall and achieves a 99.4% precision when enhanced with string distances. [ABSTRACT FROM AUTHOR]

This paper presents a method for unsupervised classification of entities by a group of agents with unknown domains and levels of expertise. In contrast to the existing methods based on majority voting ("wisdom of the crowd") and their extensions by expectation-maximization procedures, the suggested method first determines the levels of the agents' expertise and then weights their opinions by their expertise level. In particular, we assume that agents will have relatively closer classifications in their field of expertise. Therefore, the expert agents are recognized by using a weighted Hamming distance between their classifications, and then the final classification of the group is determined from the agents' classifications by expectation-maximization techniques, with preference to the recognized experts. The algorithm was verified and tested on simulated and real-world datasets and benchmarked against known existing algorithms. We show that such a method reduces incorrect classifications and effectively solves the problem of unsupervised collaborative classification under uncertainty, while outperforming other known methods. [ABSTRACT FROM AUTHOR]

DNA code design is a challenging problem, and it has received great attention in the literature due to its applications in DNA data storage, DNA origami, and DNA computing. The primary focus of this paper is in constructing new DNA codes using the cosets of linear codes over the ring Z 4 . The Hamming distance constraint, GC-content constraint, and homopolymers constraint are all considered. In this study, we consider the cosets of Simplex alpha code, Kerdock code, Preparata code, and Hadamard code. New DNA codes of lengths four, eight, sixteen, and thirty-two are constructed using a combination of an algebraic coding approach and a variable neighborhood search approach. In addition, good lower bounds for DNA codes that satisfy important constraints have been successfully established using Magma software V2.24-4 and Python 3.10 programming in our comprehensive methodology. [ABSTRACT FROM AUTHOR]

Objectives: Specifiers for a major depressive disorder (MDE) are supposed to reduce diagnostic heterogeneity. However, recent literature challenges the idea that the atypical and melancholic specifiers identify more homogenous or coherent subgroups. We introduce the usage of distance metrics to characterize symptom heterogeneity. We attempt to replicate prior findings and explore whether symptom heterogeneity is reduced using specifier subgroups. Methods: We used data derived from the National Epidemiological Survey on Alcohol and Related Conditions (NESARC Wave I; N = 5,749) and the Sequenced Treatment Alternatives to Relieve Depression study (STAR*D; N = 2,498). We computed Hamming and Manhattan distances from study participants' unique symptom profiles. Distances were standardized from 0-1 and compared by their within- and between-group similarities to their non-specifier counterparts for the melancholic and atypical specifiers. Results: There was no evidence of statistically significant differences in heterogeneity for specifier (i.e., melancholic or atypical) vs. non-specifier designations (i.e., non-melancholic vs. non-atypical). Conclusion: Replicating prior work, melancholic and atypical depression specifiers appear to have limited utility in reducing heterogeneity. The current study does not support the claim that specifiers create more coherent subgroups as operationalized by similarity in the number of symptoms and their severity. Distance metrics are useful for quantifying symptom heterogeneity. [ABSTRACT FROM AUTHOR]

In this work, we explored a highly robust and unique Physical Unclonable Function (PUF) based on the stochastic assembly of single-walled Carbon NanoTubes (CNTs) integrated within a wafer-level technology. Our work demonstrated that the proposed CNT-based PUFs are exceptionally robust with an average fractional intra-device Hamming distance well below 0.01 both at room temperature and under varying temperatures in the range from 23 ∘ C to 120 ∘ C . We attributed the excellent heat tolerance to comparatively low activation energies of less than 40 meV extracted from an Arrhenius plot. As the number of unstable bits in the examined implementation is extremely low, our devices allow for a lightweight and simple error correction, just by selecting stable cells, thereby diminishing the need for complex error correction. Through a significant number of tests, we demonstrated the capability of novel nanomaterial devices to serve as highly efficient hardware security primitives. [ABSTRACT FROM AUTHOR]

One of the first steps in protein sequence analysis is comparing sequences to look for similarities. We propose an information theoretical distance to compare cellular automata representing protein sequences, and determine similarities. Our approach relies in a stationary Hamming distance for the evolution of the automata according to a properly chosen rule, and to build a pairwise similarity matrix and determine common ancestors among different species in a simpler and less computationally demanding computer codes when compared to other methods. [ABSTRACT FROM AUTHOR]

Quality control is paramount in product manufacturing as it ensures consistent production to meet customer expectations, regulatory requirements and maintain a company's reputation and profitability. Distance measures within fuzzy sets serve as powerful tools for quality control, allowing for data comparison and identification of potential defects or outliers within a system. This study aims to develop a hybrid concept by combining a Cubic Intuitionistic Fuzzy Set (CIFS) with Soft Set (SS) and extending it to Cubic Intuitionistic Fuzzy Hypersoft Set (CIFHSS). CIFHSS enables handling multiple distinct attributes at the sub-attribute level within a cubic set environment. The concept includes operations like internal, partial internal, external, complement, direct sum, and product. Additionally, six distance metrics are defined within CIFHSS and applied to establish a quality control management system for industrial applications. The versatility of CIFHSS in quality control management stems from its ability to capture and model uncertainty, vagueness, and imprecision in data. This makes it an effective tool for decision-making, risk analysis, and process optimization across a wide range of industrial applications. [ABSTRACT FROM AUTHOR]

Identifying viral variants through clustering is essential for understanding the composition and structure of viral populations within and between hosts, which play a crucial role in disease progression and epidemic spread. This article proposes and validates novel Monte Carlo (MC) methods for clustering aligned viral sequences by minimizing either entropy or Hamming distance from consensuses. We validate these methods on four benchmarks: two SARS-CoV-2 interhost data sets and two HIV intrahost data sets. A parallelized version of our tool is scalable to very large data sets. We show that both entropy and Hamming distance-based MC clusterings discern the meaningful information from sequencing data. The proposed clustering methods consistently converge to similar clusterings across different runs. Finally, we show that MC clustering improves reconstruction of intrahost viral population from sequencing data. [ABSTRACT FROM AUTHOR]

Motivated by Jin–Ke–Wang's work (J. Jin, Z. T. Ke and W. Wang, Ann. Statist. 45(5) (2017) 2151–2189), this paper studies estimation of misclassification rate in the Asymptotic Rare and Weak (ARW) model. In contrast to Jin–Ke–Wang's theorem, we measure the performance of the estimator by the misclassification rate instead of Hamming distance, and extend the Gaussian noise to sub-Gaussian's. The probability estimation with convergence rate is first given under some conditions. Then we prove that condition necessary as well. A direct corollary of our estimation can be compared with Jin–Ke–Wang's theorem. It turns out that our statistical limit coincides with theirs. [ABSTRACT FROM AUTHOR]

The orthogonal time frequency space (OTFS) modulation technique can provide reliable communication in time-varying channels. Due to the dispersive characteristics of underwater acoustic channels, this paper proposes an OTFS-IM underwater acoustic communication system based on Hamming distance optimization to reduce the impact of dispersion in underwater acoustic communication. Firstly, the OTFS-IM underwater acoustic communication system is introduced, which introduces index modulation into the Delay–Doppler (DD) domain to make the OTFS system have stronger anti-Delay–Doppler capability. In contrast, since there is index sequence redundancy in a specific index combination, a Hamming distance optimization model is used to eliminate the redundant combination in the specific index combination sequence and further improve the bit error rate performance of the system. In addition, the Hamming distance optimized OTFS-IM underwater acoustic communication system is verified by simulation analysis. The results show that the proposed Hamming distance optimized OTFS-IM can achieve more reliable bit error rate performance. [ABSTRACT FROM AUTHOR]

Monitoring variations in the extent of wet snow over space and time is essential for many applications, such as hydrology, mountain ecosystems, meteorology and avalanche forecasting. The Synthetic Aperture Radar (SAR) measurements from the Sentinel-1 satellite help detect wet snow in almost all weather conditions. Most detection methods use a fixed threshold to a winter image ratio with one or two reference images (with no snow or dry snow). This study aimed to explore the potential of image segmentation methods from different families applied to Sentinel-1 SAR images to improve the detection of wet snow over the French Alps. Several segmentation methods were selected and tested on a large alpine area of 100 × 100 km2. The segmentation methods were evaluated over one season using total snow masks from Sentinel-2 optical measurements and outputs from forecasters' bulletins combining model and in-situ observations. Different metrics were used (such as snow probability, correlations, Hamming distance, and structure similarity scores). The standard scores illustrated that filtering globally improved the segmentation results. Using a probabilistic score as a function of altitude highlights the interest in some segmentation methods, and we show that these scores could be relevant to calibrate the parameters of these methods better. [ABSTRACT FROM AUTHOR]

We introduce and investigate neutrosophic soft contra e-continuous maps and contra e-irresolute maps in neutrosophic soft topological spaces with examples. Also, neutrosophic soft contra econtinuous maps are compared with neutrosophic soft continuous maps, d-continuous maps, d-semi continuous maps, d-pre continuous maps and e* continuous maps in neutrosophic soft topological spaces. We derive some useful results and properties related to them. An application in decision making problem using distance measure is given. An example of a candidate selection from a company interview is formulated as neutrosophic soft model problem and the hamming distance measure is applied to calculate the distance between the interview candidates and the ideal candidate. The candidate having less distance with the ideal solution is the desirable candidate. [ABSTRACT FROM AUTHOR]

We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to the well-known BCH bound for cyclic codes. This BCH-like bound serves as a foundation for proposing some minimum-distance lower bounds for single-generator quasi-twisted (QT) codes. Associating each QT code with a constacyclic code over an extension field, we obtain the first bound. This is the QT analogue to a result in the literature for quasi-cyclic codes. We point out some weaknesses in this bound and propose a novel bound that takes into account the Chinese remainder theorem approach to QT codes as well as the BCH bound of constacyclic codes. This proposed bound, in contrast to previous bounds in the literature, does not presuppose a specific form of code generator and does not require calculations in any extension field. We illustrate that our bound meets the one in the literature when the code generator adheres to the specific form assumed in that study. Various numerical examples enable us to compare and discuss these bounds. [ABSTRACT FROM AUTHOR]

Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = Fq +uFq + u²Fq, where u³ = 0 mod q. Further, we find a unique set of generators for cyclic codes over R and classify the reversible cyclic codes with their generators. Moreover, it is shown that the dual of reversible cyclic code over R is reversible. Finally, some examples of reversible cyclic codes are provided to justify the importance of these results. [ABSTRACT FROM AUTHOR]

It has been argued that orientifold vacua with fluxes in type IIA string theory can achieve moduli stabilisation and arbitrary decoupling between the AdS and KK scales upon sending certain unconstrained RR-flux quanta to infinity. In this paper, we find a novel scalar field in the open-string sector that allows us to interpolate between such IIA vacua that differ in flux quanta and find that the limit of large fluxes is nicely consistent with the distance conjecture. This shows that the massive IIA vacua pass an important Swampland criterion and suggests that scale-separated AdS vacua might not be in the Swampland. Our analysis also naturally suggests a flux analogue of "Reid's fantasy" where flux vacua that differ in quantised flux numbers can be connected through trajectories in open-string field space and not just via singular domain walls. [ABSTRACT FROM AUTHOR]

This paper proposes a new image hashing method, which uses histogram reconstruction to solve the problem of the histogram not being sensitive to the change of pixel position, while ensuring the robustness of the hashing algorithm against common content preservation attacks (such as blurring, noise addition and rotation). The proposed algorithm can resist arbitrary angles of rotation, possibly because the reconstructed histogram leverages the rotational symmetry and its own invariance to rotation operations. We measure the similarity between different images by calculating the Hamming distance of the hash vectors of different images. Our experiments show that the proposed method performs well in robustness and discrimination compared with other established algorithms. In addition, we conduct a receiver operating characteristic curve analysis to further verify the superior overall performance of our image hash method. [ABSTRACT FROM AUTHOR]

Lightning localization is of great significance to weather forecasting, forest fire prevention, aviation, military, and other aspects. Traditional lightning localization requires the deployment of base stations and expensive measurement equipment. With the development of IoT technology and the continuous expansion of application scenarios, IoT devices can be interconnected through sensors and other technical means to ultimately achieve the goal of automatic intelligent computing. Therefore, this paper proposes a low-cost distributed thunder-localization system based on IoT smart devices, namely ThunderLoc. The main idea of ThunderLoc is to collect dual-microphone data from IoT smart devices, such as smartphones or smart speakers, through crowdsourcing, turning the localization problem into a search problem in Hamming space. We studied the dual microphones integrated with smartphones and used the sign of Time Difference Of Arrival (TDOA) as measurement information. Through a simple generalized cross-correlation method, the TDOA of thunderclaps on the same smartphone can be estimated. After quantifying the TDOA measurement from the smartphone node, thunder localization was performed by minimizing the Hamming distance between the binary sequence and the binary vector measured in a database. The ThunderLoc system was evaluated through extensive simulations and experiments (a testbed with 30 smartphone nodes). The extensive experimental results demonstrate that ThunderLoc outperforms the main existing schemes in terms of effectively locating position and good robustness. [ABSTRACT FROM AUTHOR]

In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N , K , d + 1)) s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N , 1 , d + 1)) s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3 , s , 2)) s for all s i ≥ 3 , ((4 , s 2 , 2)) s for all s i ≥ 5 , ((5 , s , 3)) s for all s i ≥ 4 , ((6 , s 2 , 3)) s for all s i ≥ 5 , ((7 , s 3 , 3)) s for all s i ≥ 7 , ((8 , s 2 , 4)) s for all s i ≥ 9 , ((9 , s 3 , 4)) s for all s i ≥ 11 , ((9 , s , 5)) s for all s i ≥ 9 , ((10 , s 2 , 5)) s for all s i ≥ 11 , ((11 , s , 6)) s for all s i ≥ 11 , and ((12 , s 2 , 6)) s for all s i ≥ 13 , where s = s 1 ⋯ s n and s 1 , ... , s n are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets. [ABSTRACT FROM AUTHOR]

Application of genetic distances to measure phenotypic relatedness is a challenging task, reflecting the complex relationship between genotype and phenotype. Accurate assessment of proximity among sequences with different phenotypic traits depends on how strongly the chosen distance is associated with structural and functional properties. In this study, we present a new distance measure Mutual Information and Entropy H (MIH) for categorical data such as nucleotide or amino acid sequences. MIH applies an information matrix (IM), which is calculated from the data and captures heterogeneity of individual positions as measured by Shannon entropy and coordinated substitutions among positions as measured by mutual information. In general, MIH assigns low weights to differences occurring at high entropy positions or at dependent positions. MIH distance was compared with other common distances on two experimental and two simulated data sets. MIH showed the best ability to distinguish cross-immunoreactive sequence pairs from non-cross-immunoreactive pairs of variants of the hepatitis C virus hypervariable region 1 (26,883 pairwise comparisons), and Major Histocompatibility Complex (MHC) binding peptides (n = 181) from non-binding peptides (n = 129). Analysis of 74 simulated RNA secondary structures also showed that the ratio between MIH distance of sequences from the same RNA structure and MIH of sequences from different structures is three orders of magnitude greater than for Hamming distances. These findings indicate that lower MIH between two sequences is associated with greater probability of the sequences to belong to the same phenotype. Examination of rule-based phenotypes generated in silico showed that (1) MIH is strongly associated with phenotypic differences, (2) IM of sequences under selection is very different from IM generated under random scenarios, and (3) IM is robust to sampling. In conclusion, MIH strongly approximates structural/functional distances and should have important applications to a wide range of biological problems, including evolution, artificial selection of biological functions and structures, and measuring phenotypic similarity. [ABSTRACT FROM AUTHOR]

The HNN is often used as a human-like associative memory (AM). Nonetheless, HNNs suffered from limited noise tolerance and limited storage capacity. However, unfortunately, Hopfield neural networks suffered from limited tolerance to noise and limited storage capacity. This study proposes a novel approach for overcoming these limitations using the concept of multiple connections architecture in a Hopfield neural network with an energy function and Hamming distance (HD). In this architecture, a single connection among neurons of the network is employed to store a pattern, resulting in an etalon array, and the collection of etalon arrays corresponding to each neuronal connection forms a weight matrix (also called connection matrix). This approach of storing a single pattern on a single set of connections reduces the chances of being trapped in local minima and increases storage capacity because more patterns are stored in the network as the number of connections increases. The Lyapunov energy function and the Hamming distance concept are utilized to determine the testing pattern’s proximity to one of the stored patterns for perfect recall. Several experiments are conducted to compare the recall success rate and storage capacity of handwritten character images to those of existing methods. Experiments using multiple connections Hopfield neural network with hamming distance and Lyapunov energy function demonstrate promising results in comparison to existing methods. [ABSTRACT FROM AUTHOR]

We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range. We obtain an almost complete picture of the complexity landscape regarding the distance constraints and the maximum number of missing entries in any row. We develop polynomial-time algorithms for maximum diameter three based on Deza's theorem (1973) [11] from extremal set theory. We also prove NP-hardness for diameter at least four. For the number of missing entries per row, we show polynomial-time solvability when there is only one and NP-hardness when there can be at least two. In many of our algorithms, we heavily rely on Deza's theorem to identify sunflower structures. This paves the way towards polynomial-time algorithms which are based on finding graph factors and solving 2-SAT instances. [ABSTRACT FROM AUTHOR]

In this article, we discuss a few fresh approaches to the spherical vague normal set (SVNS) approach to multiple attribute decision‐making (MADM) problems. A new generalization of the vague set (VS) and the spherical interval valued fuzzy set (SIVFS) is the spherical vague set (SVS). The spherical vague number (SVN) concepts consolidate normal fuzzy number (NFN) and we defined the spherical vague normal number (SVNN) and some of its intriguing fundamental operations. The purpose of this article is to discuss a novel idea of spherical vague normal weighted averaging (SVNWA), spherical vague normal weighted geometric (SVNWG), generalized spherical vague normal weighted averaging (GSVNWA) and generalized spherical vague normal weighted geometric (GSVNWG) operators. We talked about a flowchart with an algorithm that uses this operators and the MADM approach. With the help of a numerical example, we interact the extended euclidean and hamming distance measures. In this communication, it is also important to elaborate on some key SVN approach characteristics based on various algebraic operations, such as idempotency, boundedness, commutativity, and monotonicity. They are quicker to find the best option, more straightforward and practical. Think about five farmers. The four factors that are taken into account for each of the five farmers are climate, water, soil, disease, and flood, and their corresponding weights are displayed. We want to select the best option from a large number of choices by comparing expert assessments with the criteria. As a result, the conclusions of the defined models are more precise and closely related to Θ. We contrast some of the current models with the ones that have been proposed in order to demonstrate the dependability and utility of the models under investigation. The study's findings are also intriguing and fascinating. [ABSTRACT FROM AUTHOR]

The main motivation of this work is to study and obtain some reversible and DNA codes of length n with better parameters. Here, we first investigate the structure of cyclic and skew cyclic codes over the chain ring R : = F 4 [ v ] / 〈 v 3 〉 . We show an association between the codons and the elements of R using a Gray map. Under this Gray map, we study reversible and DNA codes of length n. Finally, several new DNA codes are obtained that have improved parameters than previously known codes. We also determine the Hamming and the Edit distances of these codes. [ABSTRACT FROM AUTHOR]

Multi-attribute group decision making is widely used in the real world, and many scholars have done a lot of research on it. The public's focus on emergencies can provide an important reference for emergency handling decision making in the social media big data environment. Due to the complexity of emergency handling decision making, the asymmetry of user evaluation information is easy to cause the loss of important information. It is very important to mine valuable information for decision making through online reviews. Then, a generalized extended hybrid distance measure method between the probabilistic linguistic term sets is proposed. Based on this, an extended GDMD-PROMETHEE large-scale multi-attribute group decision-making method is proposed as well, which can be used to decision making under symmetric information and asymmetric information. Firstly, web crawler technology is used to explore the topics of public concern of emergency handling on social media platforms, and use k -means cluster analysis to classify the crawling variables, then the attributes and subjective weights of emergency handling plans are obtained by TF-IDF and Word2vec technology. Secondly, in order to better retain the linguistic evaluation information from decision-makers, a new generalized probabilistic hybrid distance measure method based on Hamming distance is proposed. Considering the difference of decision makers' evaluation, the objective weight of decision makers is calculated by combining the maximum deviation method with the new extended hybrid Euclidean distance. On this basis, the comprehensive weights of the attributes are calculated by combining subjective and objective factors. Meanwhile, this paper realizes the distance measures and information fusion of probabilistic linguistic term sets under cumulative prospect theory, and the ranking results of the emergency handling plans based on the extended GDMD-PROMETHEE algorithm are given. Finally, the feasibility and effectiveness of the extended GDMD-PROMETHEE algorithm are verified by the case study of the explosion accident handling decision making of Shanghai "6.18" Petrochemical, and the comparative analyses between the several traditional algorithms demonstrate the extended GDMD-PROMETHEE algorithm is more scientific and superior in this paper. [ABSTRACT FROM AUTHOR]

Error-correcting output coding (ECOC) is a method for constructing a multi-valued classifier using a combination of given binary classifiers. ECOC can estimate the correct category by other binary classifiers even if the output of some binary classifiers is incorrect based on the framework of the coding theory. The code word table representing the combination of these binary classifiers is important in ECOC. ECOC is known to perform well experimentally on real data. However, the complexity of the classification problem makes it difficult to analyze the classification performance in detail. For this reason, theoretical analysis of ECOC has not been conducted. In this study, if a binary classifier outputs the estimated posterior probability with errors, then this binary classifier is said to be noisy. In contrast, if a binary classifier outputs the true posterior probability, then this binary classifier is said to be noiseless. For a theoretical analysis of ECOC, we discuss the optimality for the code word table with noiseless binary classifiers and the error rate for one with noisy binary classifiers. This evaluation result shows that the Hamming distance of the code word table is an important indicator. [ABSTRACT FROM AUTHOR]

In image-based three-dimensional (3D) reconstruction, texture-mapping techniques can give the model realistic textures. When the geometric surface in some regions is not reconstructed, such as for moving cars, powerlines, and telegraph poles, the textures in the corresponding image are textured to other regions, resulting in errors. To solve this problem, this letter proposes an image consistency detection method based on the Binary Robust Independent Elementary Features (BRIEF) descriptor. The method is composed of two parts. First, each triangle in the mesh and its neighboring triangles are sampled uniformly to obtain sampling points. Then, these sampled points are projected into the visible image of the triangle, and the corresponding sampled points and their RGB color values are obtained on the corresponding image. Based on the sampled points on these images, a BRIEF descriptor is calculated for each image corresponding to that triangle. In the second step, the Hamming distance between these BRIEF descriptors is calculated, outliers are removed according to the method, and noisy images are also removed. In addition, we propose adding semantic information to Markov energy optimization to reduce errors further. The two methods effectively reduced errors in texture mapping caused by objects not reconstructed, improving the texture quality of 3D models. [ABSTRACT FROM AUTHOR]

Synthetic Aperture Radar (SAR) remote sensing has been widely used as one of the most effective tools for responding to earthquake disasters. In general, damaged-building detection with SAR data has been conducted based on change detection using temporal SAR data acquired in the same observation mode. However, it is not always possible to use SAR data obtained with the appropriate observation mode in unexpected events such as natural disasters. This study aims to detect earthquake-induced damaged buildings using temporal SAR data having different observation modes. We presented a contextual change analysis method to map damaged buildings based on novel textural features. This study was conducted using the bi-temporal Komapsat-5 data obtained in different polarization modes. Experimental results for the area severely damaged by the 2016 Kumamoto earthquake showed that the proposed textural analysis can improve detectability in building-damaged areas while maintaining low false alarm rates in agricultural areas. According to the grid-based accuracy analysis, the proposed method can successfully detect the damaged areas with a detection rate of about 72.5% and false alarms of about 6.8% even on challenging data sets. [ABSTRACT FROM AUTHOR]

As an important supplement to my country's financial institutions, micro-loan companies serve "agriculture, rural areas and farmers", small and micro enterprises, and individuals, to a certain extent, alleviating the financing difficulties of such groups and regulating private finance. However, micro-loan companies only lend but do not deposit. In the process of lending, due to inadequate risk management, the risk problem has become increasingly prominent. With the continuous growth of the loan amount of rural credit and the continuous increase of microfinance groups lending customers, it faces certain problems in its risk management, which increases the risks of the company in all aspects. The performance evaluation of sustainable microfinance groups lending is a classical MAGDM issues. In such paper, the Hamming distances of single-valued neutrosophic sets (SVNSs) and maximizing deviation method (MDM) is used to obtain the attribute weights and the single-valued neutrosophic numbers MABAC(SVNN-MABAC) method is structured for MAGDM under SVNSs. Finally, an example about performance evaluation of sustainable microfinance groups lending and some comparative decision analysis are given to proof the SVNN-MABAC. [ABSTRACT FROM AUTHOR]

Motivation Comparing single-stranded nucleic acids (ssNAs) secondary structures is fundamental when investigating their function and evolution and predicting the effect of mutations on their structures. Many comparison metrics exist, although they are either too elaborate or not sensitive enough to distinguish close ssNAs structures. Results In this context, we developed AptaMat, a simple and sensitive algorithm for ssNAs secondary structures comparison based on matrices representing the ssNAs secondary structures and a metric built upon the Manhattan distance in the plane. We applied AptaMat to several examples and compared the results to those obtained by the most frequently used metrics, namely the Hamming distance and the RNAdistance, and by a recently developed image-based approach. We showed that AptaMat is able to discriminate between similar sequences, outperforming all the other here considered metrics. In addition, we showed that AptaMat was able to correctly classify 14 RFAM families within a clustering procedure. Availability and implementation The python code for AptaMat is available at https://github.com/GEC-git/AptaMat.git. Supplementary information Supplementary data are available at Bioinformatics online. [ABSTRACT FROM AUTHOR]

We propose a first-order autoregressive (i.e. AR(1)) model for dynamic network processes in which edges change over time while nodes remain unchanged. The model depicts the dynamic changes explicitly. It also facilitates simple and efficient statistical inference methods including a permutation test for diagnostic checking for the fitted network models. The proposed model can be applied to the network processes with various underlying structures but with independent edges. As an illustration, an AR(1) stochastic block model has been investigated in depth, which characterizes the latent communities by the transition probabilities over time. This leads to a new and more effective spectral clustering algorithm for identifying the latent communities. We have derived a finite sample condition under which the perfect recovery of the community structure can be achieved by the newly defined spectral clustering algorithm. Furthermore the inference for a change point is incorporated into the AR(1) stochastic block model to cater for possible structure changes. We have derived the explicit error rates for the maximum likelihood estimator of the change-point. Application with three real data sets illustrates both relevance and usefulness of the proposed AR(1) models and the associate inference methods. [ABSTRACT FROM AUTHOR]

Purpose: To study the effect of pupil dilation on a biometric iris recognition (BIR) system for personal authentication and identification. Methods: A prospective, non-randomized, single-center cohort study was conducted on patients who reported for a routine eye check-up from November 2017 to November 2019 (2 years). An iris scanning device "IRITECH-MK2120U" was used to initially enroll the undilated eyes. Baseline scans were taken after matching with the enrolled database. All eyes were topically dilated and matched again with the enrolled database. The Hamming distance (a measure of disagreement between two iris codes) and recognition status were recorded from the device output, and eyes were evaluated by slit-lamp ophthalmoscopy with special emphasis on pupil shape, size, and texture. Results: All 321 enrolled eyes matched after topical dilation. The pupil size had a significant effect on Hamming distance with a P value <0.05. There were no false matches. A correct recognition rate of 100% was obtained after dilation. No loss of iris texture or pupil shape was observed after dilation. Conclusion: A BIR system is a reliable method for identification and personal authentication after pupil dilation. Topically dilated pupils are not a cause for non-recognition of iris scans. [ABSTRACT FROM AUTHOR]