Secure election audits require some method of randomly selecting the units to be audited. Because physical methods such as dice rolling or lotterystyle ping pong ball selection are inefficient when a large number of audit units must be selected, some authors have proposed to stretch physical methods by using them to seed randomness tables or random number generators. We analyze the security of ...

We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the uniform random numbers, called the (variable-length) resolvability, is investigated. We first analyze the variable-length resolvability with the variational d...

This paper presents a random generator of discrete event systems that are by construction kdiagnosable. The aim of this generator is to provide an almost infinite set of diagnosable systems for creating benchmarks. The goal of such benchmarks is to provide a solid set of examples to test and compare algorithms that solve many problems around diagnosable discrete event systems.

We present the system for versioning two packages: the TAUOLA of τ -lepton decay and PHOTOS for radiative corrections in decays. The following features can be chosen in an automatic or semi-automatic way: (1) format of the common block HEPEVT; (2) version of the physics input (for TAUOLA): as published, as initialized by the CLEO collaboration, as initialized by the ALEPH collaboration (it is s...

For programmers seeking to familiarize themselves with the component of the C++11 standard library, we provide background information and tutorial guidance with numerous usage examples.

The following two propositions are true: (1) For every sequence s1 of real numbers and for every real number r such that s1 is bounded and 0 ≤ r holds lim inf(r s1) = r · lim inf s1. (2) For every sequence s1 of real numbers and for every real number r such that s1 is bounded and 0 ≤ r holds lim sup(r s1) = r · lim sup s1. Let X be a real Banach space. One can verify that MetricSpaceNormX is co...

A uniform random vector over a simplex is generated. An explicit expression for the first moment of its largest spacing is derived. The result is used in a proposed diagnostic tool which examines the validity of random number generators. It is then shown that the first moment of the largest uniform spacing is related to the dependence measure of random vectors following any extreme value distri...

Tausworthe random number generators based on a primitive trinomial allow an easy and fast implementation when their parameters obey certain restrictions. However, such generators, with those restrictions, have bad statistical properties unless we combine them. A generator is called maximally equidistributed if its vectors of successive values have the best possible equidistribution in all dimen...

Parallel computing code can be applied to solve chemically reacting systems. In a well stirred chemical system, the number of molecules for each species can be solved by implicit tau method, and the histogram of the method is used to compare with the exact simulation called SSA. In this report, the parallel code will be implemented in both SSA and implicit tau, with the discussion that how rand...