Random walk tests for pseudo-random number generators

It is well known that there are no perfectly good generators of random number sequences, implying the need of testing the randomness of the sequences produced by such generators. There are many tests for measuring the uniformity of random sequences, and here we propose a few new ones, designed by random walks. The experiments we have made show that our tests discover some discrepancies of random sequences passing many other tests

Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach

We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic apparatus. Next we consider Markov reward chains which are standardly presented in real matrix theory. By interpreting the obtained matrix conditions for bisimulations in this setting, we automatically obtain the definitions of strong, weak, and branching bisimulation for Markov reward chains. The obtained strong and weak bisimulations are shown to coincide with some existing notions, while the obtained branching bisimulation is new, but its usefulness is questionable

ACUTE BENIGN PERICARDITIS IN COXSACKIE INFECTION AND GRIPPE

No abstract

Communicating Processes with Data for Supervisory Coordination

We employ supervisory controllers to safely coordinate high-level discrete(-event) behavior of distributed components of complex systems. Supervisory controllers observe discrete-event system behavior, make a decision on allowed activities, and communicate the control signals to the involved parties. Models of the supervisory controllers can be automatically synthesized based on formal models of the system components and a formalization of the safe coordination (control) requirements. Based on the obtained models, code generation can be used to implement the supervisory controllers in software, on a PLC, or an embedded (micro)processor. In this article, we develop a process theory with data that supports a model-based systems engineering framework for supervisory coordination. We employ communication to distinguish between the different flows of information, i.e., observation and supervision, whereas we employ data to specify the coordination requirements more compactly, and to increase the expressivity of the framework. To illustrate the framework, we remodel an industrial case study involving coordination of maintenance procedures of a printing process of a high-tech Oce printer.Comment: In Proceedings FOCLASA 2012, arXiv:1208.432

Location prediction based on a sector snapshot for location-based services

In location-based services (LBSs), the service is provided based on the users' locations through location determination and mobility realization. Most of the current location prediction research is focused on generalized location models, where the geographic extent is divided into regular-shaped cells. These models are not suitable for certain LBSs where the objectives are to compute and present on-road services. Such techniques are the new Markov-based mobility prediction (NMMP) and prediction location model (PLM) that deal with inner cell structure and different levels of prediction, respectively. The NMMP and PLM techniques suffer from complex computation, accuracy rate regression, and insufficient accuracy. In this paper, a novel cell splitting algorithm is proposed. Also, a new prediction technique is introduced. The cell splitting is universal so it can be applied to all types of cells. Meanwhile, this algorithm is implemented to the Micro cell in parallel with the new prediction technique. The prediction technique, compared with two classic prediction techniques and the experimental results, show the effectiveness and robustness of the new splitting algorithm and prediction technique

High-Order Adiabatic Approximation for Non-Hermitian Quantum System and Complexization of Berry's Phase

In this paper the evolution of a quantum system drived by a non-Hermitian Hamiltonian depending on slowly-changing parameters is studied by building an universal high-order adiabatic approximation(HOAA) method with Berry's phase ,which is valid for either the Hermitian or the non-Hermitian cases. This method can be regarded as a non-trivial generalization of the HOAA method for closed quantum system presented by this author before. In a general situation, the probabilities of adiabatic decay and non-adiabatic transitions are explicitly obtained for the evolution of the non-Hermitian quantum system. It is also shown that the non-Hermitian analog of the Berry's phase factor for the non-Hermitian case just enjoys the holonomy structure of the dual linear bundle over the parameter manifold. The non-Hermitian evolution of the generalized forced harmonic oscillator is discussed as an illustrative examples.Comment: ITP.SB-93-22,17 page

Quadratic time algorithm for inversion of binary permutation polynomials

International audienceIn this paper, we propose a new version of the Lagrangian interpolation applied to binary permutation polynomials and, more generally , permutation polynomials over prime power modular rings. We discuss its application to obfuscation and reverse engineering.Quadratic time algorithm for inversion of binary permutation polynomial