<didl:DIDL xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:didl="urn:mpeg:mpeg21:2002:02-DIDL-NS" xsi:schemaLocation="urn:mpeg:mpeg21:2002:02-DIDL-NS 
			 http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/did/didmodel.xsd"><didl:Item><didl:Descriptior><didl:Statement mimeType="application/xml; charset=utf-8"><dii:Identifier xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="urn:mpeg:mpeg21:2002:01-DII-NS
		 	http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/dii/dii.xsd" xmlns:dii="urn:mpeg:mpeg21:2002:01-DII-NS">http://myais.fsktm.um.edu.my/1454/</dii:Identifier></didl:Statement></didl:Descriptior><didl:Descriptior><didl:Statement mimeType="application/xml; charset=utf-8"><oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/">
        <dc:title>Bounds on Random Infinite Urn Model</dc:title>
        <dc:creator>Boonta, S.,  </dc:creator>
        <dc:creator>Neammanee, K.,  </dc:creator>
        <dc:subject>Q Science, Computer Science</dc:subject>
        <dc:description>Let $N(n)$ be a Poisson random variable with Parameter $n$. An infinite urn model is defined as follows: $N(n)$ balls are independently placed in an infinite set of urns and each ball has probability $p_k &gt; 0$ of being assigned to the $k$-th urn. We assume that $p_k \geq p_{k+1}$ for all $k$ and $\sum_{k=1}^{\infty} p_k = 1$. Let $ U_n $, be the number of occupied urns after $N(n)$ balls have been thrown. Dutko showed in 1989 that under the condition $\lim_{n\rightarrow \infty} Var(U_{n}) = \infty$ we have $\frac{U_n - E(U_{n})}{\sqrt{Var(U_{n})}} \rightarrow^d \mathcal{N} (0,1)$ as $n \rightarrow \infty$ where $\mathcal{N} (0,1)$ is the standard random variable. However, Dutko did not give a bound of his approximation. So in this paper, we give uniform and non-uniform bounds of the approximation.&#13;
&#13;
&#13;
2000 Mathematics Subject Classification: 60F05, 60G50</dc:description>
        <dc:publisher>Penerbit Universiti Sains Malaysia</dc:publisher>
        <dc:date>2007</dc:date>
        <dc:type>Journal</dc:type>
        <dc:type>PeerReviewed</dc:type>
        <dc:relation>http://math.usm.my/bulletin/pdf/v30n2/v30n2p4.pdf</dc:relation>
        <dc:identifier>Boonta, S., and Neammanee, K., (2007) Bounds on Random Infinite Urn Model. Bulletin of the Malaysian Mathematical Sciences Society, 30 (2). pp. 121-128. ISSN 0126-6705</dc:identifier>
        <dc:relation>http://myais.fsktm.um.edu.my/1454/</dc:relation></oai_dc:dc></didl:Statement></didl:Descriptior></didl:Item></didl:DIDL>