Search results for "error detection"
showing 9 items of 39 documents
A simple comparative analysis of exact and approximate quantum error correction
2014
We present a comparative analysis of exact and approximate quantum error correction by means of simple unabridged analytical computations. For the sake of clarity, using primitive quantum codes, we study the exact and approximate error correction of the two simplest unital (Pauli errors) and nonunital (non-Pauli errors) noise models, respectively. The similarities and differences between the two scenarios are stressed. In addition, the performances of quantum codes quantified by means of the entanglement fidelity for different recovery schemes are taken into consideration in the approximate case. Finally, the role of self-complementarity in approximate quantum error correction is briefly ad…
Quantum Walk Search through Potential Barriers
2015
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers, and some amplitude of staying put. We investigate the algorithmic consequence of such barriers for the quantum walk formulation of Grover's algorithm. We prove that the failure amplitude must scale as $O(1/\sqrt{N})$ for search to retain its quantum $O(\sqrt{N})$ runtime; otherwise, it searches in classical $O(N)$ time. Thus searching larger "databases" requires increasingly reliable hop operations or error correction. This condition holds for both discre…
kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.
2018
Abstract Motivation K-mers along with their frequency have served as an elementary building block for error correction, repeat detection, multiple sequence alignment, genome assembly, etc., attracting intensive studies in k-mer counting. However, the output of k-mer counters itself is large; very often, it is too large to fit into main memory, leading to highly narrowed usability. Results We introduce a novel idea of encoding k-mers as well as their frequency, achieving good memory saving and retrieval efficiency. Specifically, we propose a Bloom filter-like data structure to encode counted k-mers by coupled-bit arrays—one for k-mer representation and the other for frequency encoding. Exper…
Systematic Error Correction of a 3D Laser Scanning Measurement Device
2011
International audience; Non-contact measurement techniques using laser scanning have the advantage of fast acquiring large numbers of points. However, compared to their contact-based counterparts, these techniques are known to be less accurate. The work presented in this paper aims at improving the accuracy of these techniques through an error correction procedure based on an experimental process that concerns mechanical parts. The influence of the three parameters defining the relative position and the orientation between the sensor and the surface is studied. The process used to build an experimental global model of error is presented and applied to a typical part composed of planes or sk…
Learning the structure of HMM's through grammatical inference techniques
2002
A technique is described in which all the components of a hidden Markov model are learnt from training speech data. The structure or topology of the model (i.e. the number of states and the actual transitions) is obtained by means of an error-correcting grammatical inference algorithm (ECGI). This structure is then reduced by using an appropriate state pruning criterion. The statistical parameters that are associated with the obtained topology are estimated from the same training data by means of the standard Baum-Welch algorithm. Experimental results showing the applicability of this technique to speech recognition are presented. >
Presentations of constrained systems with unconstrained positions
2005
International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…
Learning from Errors: Detecting ZigBee Interference in WiFi Networks
2014
In this work we show how to detect ZigBee interference on commodity WiFi cards by monitoring the reception errors, such as synchronization errors, invalid header formats, too long frames, etc., caused by ZigBee transmissions. Indeed, in presence of non-WiFi modulated signals, the occurrence of these types of errors follows statistics that can be easily recognized. Moreover, the duration of the error bursts depends on the transmission interval of the interference source, while the error spacing depends on the receiver implementation. On the basis of these considerations, we propose the adoption of hidden Markov chains for characterizing the behavior of WiFi receivers in presence of controlle…
Node co-activations as a means of error detection : Towards fault-tolerant neural networks
2022
Context: Machine learning has proved an efficient tool, but the systems need tools to mitigate risks during runtime. One approach is fault tolerance: detecting and handling errors before they cause harm. Objective: This paper investigates whether rare co-activations – pairs of usually segregated nodes activating together – are indicative of problems in neural networks (NN). These could be used to detect concept drift and flagging untrustworthy predictions. Method: We trained four NNs. For each, we studied how often each pair of nodes activates together. In a separate test set, we counted how many rare co-activations occurred with each input, and grouped the inputs based on whether its class…
Analysis of the psicometric properties of a multiplication and division processes assessment scale
2019
Esta comunicación se encuentra disponible en la siguiente URL: http://www.infad.eu/RevistaINFAD/OJS/index.php/IJODAEP/article/view/1464/1321 Este número está dedicado a la "Psicología de la Educación y Saberes Originarios". The domain of multiplication and division operations depends on both algorithm management and the ability to identify the semantic structure of the problem and to translate it into mathematical language. Many students present difficulties in identifying the semantic structure of the problem but not applying the algorithm when the problem is presented numericaly. The aim of the study is to validate an assessment tool of the processes involved in multiplication and divisio…