Security Dynamics In order for Computing Systems to remain a "Quarterly dedicated to the analysis and understanding of advanced computing systems," it is necessary to make the following clarification regarding an article in the V/inter 1996 issue (Volume 9, Number 1). The article in question was entitled "Independent One-Time Passwords," and authored by Aviel D. Rubin of Bellcore. In this artic...

Near-optimal gossiping algorithms are given for twoand higher dimensional tori. It is assumed that the amount of data each PU contributes is so large that start-up time may be neglected. For twodimensional tori, a previous algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In all steps of our algorithms, the PUs forward the received packets in the same way.

A new approach for modelling time that does not rely on the concept of a clock is proposed. In order to establish a notion of time, system behaviour is represented as a joint progression of multiple threads of control, which satisfies a certain set of axioms. We show that the clock-independent time model is related to the well-known concept of a global clock and argue that both approaches estab...

This paper describes the evolution of localised ensembles of initial conditions in two-and three-dimensional time-independent potentials which admit a coexistence of regular and chaotic orbits. The coarse-grained approach towards an invariant, or near-invariant, distribution was probed by tracking (1) moments hx i y j z k p l x p m y p n z i for i + j + k + l + m + n 4 and (2) binned representa...

3 WKB 17 3.

TheWigner phase-space distribution function provides the basis for Moyal’s deformation quantization alternative to the more conventional Hilbert space and path integral quantizations. General features of time-independent Wigner functions are explored here, including the functional (“star”) eigenvalue equations they satisfy; their projective orthogonality spectral properties; their Darboux (“sup...

Switching algorithms for combining sequential codes usually come with bounds, relating their performance to that of the best fixed strategy that switches m times. The overhead is parameterized by the number of outcomes n and the number of switches m; it may be difficult to judge whether this is acceptable. We present an alternative algorithm whose overhead does not depend on n; instead our boun...

Whereas decision trees are widely studied in the context of knowledge representation and inductive learning, guidelines can be considered as an extension of decision trees that have not received the same amount of attention in the artificial intelligence community, even though they have been proved highly useful in several decision support problems as the therapy process in health-care. This pa...

0