In November 1999, the International Telecommunication Union (ITU-T, SG 17) initiated a question on the standardization of a User Requirements Notation (URN) for complex reactive, distributed, and dynamic systems and applications. URN is intended to be standardized by September 2003. This paper presents the motivations behind URN, its objectives, and the current proposal that combines two comple...

A rich and  exible class of random probability measures, which we call stick-breaking priors, can be constructed using a sequence of independent beta random variables. Examples of random measures that have this characterization include the Dirichlet process, its two-parameter extension, the two-parameter Poisson–Dirichlet process, Ž nite dimensional Dirichlet priors, and beta two-parameter pro...

We introduce simple models, inspired by previous models for froths and covalent glasses, with trivial equilibrium properties but dynamical behaviour characteristic of strong glass forming systems. These models are also a generalization of backgammon or urn models to a non-constant number of particles, where entropic barriers are replaced by energy barriers, allowing for the existence of activat...

We study a multiple-urn version of the Ehrenfest model. In this setting, we denote n urns by Urn 1 to n, where n>=2. Initially, M balls are randomly placed in urns. At each subsequent step, ball is selected and put into other n-1 with equal probability. The expected hitting time leading change balls' status computed using method stopping times. As corollary, obtain moving all from 2. This prove...

Abdellaoui, Baillon, Placido and Wakker [2011] conclude that different probability weighting functions are used when subjects face risky processes with known probabilities and uncertain processes with subjective processes. They call this “source dependence,” where the notion of a source is relatively easy to identify in the context of an artefactual laboratory experiment, and hence provides the...

A cyclic urn is an urn model for balls of types 0, . . . ,m − 1 where in each draw the ball drawn, say of type j, is returned to the urn together with a new ball of type j + 1 mod m. The case m = 2 is the well-known Friedman urn. The composition vector, i.e., the vector of the numbers of balls of each type after n steps is, after normalization, known to be asymptotically normal for 2 ≤ m ≤ 6. F...