This paper proposes that Systems Engineering and Product Lifecycle Management are closely related. In fact, the contention is that one of the threads that has led to the formation of Product Lifecycle Management is Systems Engineering. Product Lifecycle Management extends Systems Engineering and uses many of its methodologies and processes. However, this connection between these two areas has n...

In this article, we discuss the identity and indistinguishability of quantum systems and the consequent need to introduce an extra postulate in Quantum Mechanics to correctly describe situations involving indistinguishable particles. This is, for electrons, the Pauli Exclusion Principle, or in general, the Symmetrization Postulate. Then, we introduce fermions and bosons and the distributions re...

To navigate successfully, a mobile robot must be able to estimate the spatial relationships of the objects of interest in its environment. The main advantage of a bearing-only SLAM system is that it requires only a cheap vision sensor for navigation. In this paper, we present a bearing-only SLAM method for a 2D environment with visually indistinguishable landmarks (Unknown Data Association). Wh...

This paper studies the question of how to define, construct, and use obfuscators for probabilistic programs. Such obfuscators compile a possibly randomized program into a deterministic one, which achieves computationally indistinguishable behavior from the original program as long as it is run on each input at most once. For obfuscation, we propose a notion that extends indistinguishability obf...

This paper describes steganographic timing channels that use cryptographic primitives to hide the presence of covert channels in the timing of network traffic. We have identified two key properties for steganographic timing channels: (1) the parameters of the scheme should be cryptographically keyed, and (2) the distribution of input timings should be indistinguishable from output timings. Thes...

We give a new characterization of biinfinite Sturmian sequences in terms indistinguishable asymptotic pairs. Two on full Z-shift are if the sets occurrences every pattern each sequence coincide up to finitely supported permutation. This can be seen as an extension Pirillo’s theorem which characterizes Christoffel words. Furthermore, we provide pairs arbitrary alphabets using substitutions and c...