Suppose Π is an exchangeable random partition of the positive integers and Πn is its restriction to {1, . . . , n}. Let Kn denote the number of blocks of Πn, and let Kn,r denote the number of blocks of Πn containing r integers. We show that if 0 < α < 1 and Kn/(n l(n)) converges in probability to Γ(1 − α), where l is a slowly varying function, then Kn,r/(n l(n)) converges in probability to αΓ(r...

Authors have previously shown that alpha-mercaptopropionylglycine (alpha-MPG) and sodium dipropylacetate (DPA) facilitate immunity as well as host-mediated anti-tumor activity. In this study, we found that a compound related to alpha-MPG and DPA, (2-n-propyl-n-pentanoyl)glycine (KN-539), inhibited the growth of E.L.4 lymphosarcoma transplanted in C57BL/6 mice and further investigated the anti-t...

A particle-in cellldynamic Monte Carto simulation technique was developed to study the spatiotemporal electron dynamics in radio-frequency glow discharges. The electric field profile in a parallel plate one-dimensional geometly was obtained from a self-consistent fluid simulation. Using this profile, the particlein-celVdynamic Monte Carto simulation yielded the spatiotemporal electron velocity ...

We consider the number Kn of clusters at a distance level dn ∈ (0, 1) of n independent random variables uniformly distributed in [0, 1] , or the number Kn of connected components in the random interval graph generated by these variables and dn , and, depending upon how fast dn → 0 as n → ∞ , determine the asymptotic distribution of Kn , with rates of convergence, and of related random variables...

For a given graph H and n ≥ 1, let f(n,H) denote the maximum number m for which it is possible to colour the edges of the complete graph Kn with m colours in such a way that each subgraph H in Kn has at least two edges of the same colour. Equivalently, any edge-colouring of Kn with at least rb(n,H) = f(n,H) + 1 colours contains a rainbow copy of H. The numbers f(n,H) and rb(Kn, H) are called an...

Let r(G,H) be the smallest integer N such that for any 2-coloring (say, red and blue) of the edges of Kn, n > N there is either a red copy of G or a blue copy of H . Let Kn − K1,s be the complete graph on n vertices from which the edges of K1,s are dropped. In this note we present exact values for r(Km −K1,1,Kn −K1,s) and new upper bounds for r(Km,Kn−K1,s) in numerous cases. We also present som...

bhw = line half-width, Å E = radiative energy, W Eabs = radiative energy absorbed by cell, W Ebundle = radiative energy carried by photon bundle, W Eemis = emission energy, W Etrans = transmitted radiative energy, W Kn;1 = freestream Knudsen number, dimensionless k, k1, k2 = line-center index, dimensionless L = nose radius of the Stardust blunt body, m l1;2 = ratio between face endpoints, m Nra...

We consider an occupancy scheme in which “balls” are identified with n points sampled from the standard exponential distribution, while the role of “boxes” is played by the spacings induced by an independent random walk with positive and nonlattice steps. We discuss the asymptotic behavior of five quantities: the index K n of the last occupied box, the number Kn of occupied boxes, the number Kn...