The wave-like behavior of single quantum particles is suppressed whenever we try to learn more about their complementary particle-like property. For twopath interferometers, e.g., the Mach-Zehnder interferometer (MZI), a relation describing such complementary behavior was derived and subsequently experimentally tested for massive particles as well as for photons. This relation sets an upper bou...

Amplification and cloning of the Schrödinger-cat state (even coherent-state superposition) in the optical nondegenerate parametric amplifier are analysed. In the long-time limit, distinguishability and interference in the marginal probability distributions of the Schrödinger-cat state cannot be preserved simultaneously during amplification. The mutual ratio between distinguishability and interf...

Introduction. We deal with DNA word design problem, i.e. the construction of codes of DNA strings under some biological combinatorial constraints. The point of view taken here is that of channel coding theory, meaning that we try to explain DNA coding by identifying a suitable channel and a suitable decoding mechanism. The coding theoretic framework used is based on the rather general concept o...

Physical non-invasive security has become crucial for cryptographic modules, which are widely used in pervasive computing. International security evaluation standards, such as U.S. Federal Information Processing Standard (FIPS) 140-3 and Common Criteria (CC) part 3 have added special requirements addressing physical non-invasive security. However, these evaluation standards lack of quantitative...

The reconstruction problem in electrical impedance tomography is highly ill-posed, and it is often observed numerically that reconstructions have poor resolution far away from the measurement boundary but better resolution near the measurement boundary. The observation can be quantified by the concept of distinguishability of inclusions. This paper provides mathematically rigorous results suppo...

The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity element of Aut(X) fixes (setwise) every inverse image f−1(k), k ∈ {0, 1, 2, · · · , n − 1}. All infinite, locally finite trees without pendant vertices are shown to be 2distinguishable. A proof is indicated that extends 2-disti...

We study the complexity of identifying (learning) timed automata in the limit from data. Timed automata are finite state models that model time explicitly, i.e., using numbers. Because timed automata use numbers to represent time, they can be exponentially more compact than models that model time implicitly, i.e., using states. We show three results that are essential in order to exactly determ...

We use an information-theoretic distortion measure called the Normalized Compression Distance (NCD), first proposed by M. Li et al., to determine whether two rectangular gray-scale images are visually distinguishable to a human observer. Image distinguishability is a fundamental constraint on operations carried out by all players in an image watermarking system. The NCD between two binary strin...