نتایج جستجو برای: generalizedpolya urn models
تعداد نتایج: 908827 فیلتر نتایج به سال:
A very simple specific case of a Polya urn scheme is as follows. At each trial one draws a ball from an urn with balls of two different colours. Then, one looks at the ball, and returns the ball to the urn together with another ball of the same colour. Then one makes another draw. Et cetera. At the first draw there is one ball of each colour. The rechargeable Polya urn scheme is essentially the...
The present study focuses on the impact of eddy viscosity turbulence models benchmark INSEAN E779A marine propeller hydroacoustic performance under non-cavitating and open water conditions. In numerical calculations, Realisable k-epsilon (k-?), k-? Shear Stress Transport (k-? SST) Spalart-Allmaras models, which are widely used in hydrodynamic fields, selected. Hydroacoustic model is predicted w...
Response-adaptive design involves the sequential selection of design points chosen depending on the outcomes at previously selected design points. The response-adaptive design has been extensively studied in the literature; see Rosenberger (1996), Flournoy and Rosenberger (1995) and Hu and Ivanova (2004) for details. An important family of adaptive designs can be developed from the generalized ...
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
To understand the relative importance of natural selection and random genetic drift in finite but growing populations, the asymptotic behavior of a class of generalized Polya urns is studied using the method of ordinary differential equation (ODE). Of particular interest is the replicator process: two balls (individuals) are chosen from an urn (the population) at random with replacement and bal...
In this paper we present an analysis of some generalization of a classic urn and balls model. In our model each urn has a fixed capacity and balls flow between urns. We will show a general form of formulas for the expected numbers of “black” balls in a given urn and we analyze some special cases (parallel and serial configurations) We are mainly interested in a counterpart of the Coupon Collect...
CDMTCS Research Report Series Logical Equivalence Between Generalized Urn Models and Finite Automata
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well. Introduction of concepts In what follows we shall explicitly and constructively demonstrate the equivalence of the empirical logics (i.e., the propositional calculi) associated with the generalized urn models (GUM) suggested by Ron Wright [Wright(1978), Wri...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید