<mets:mets OBJID="oai:myais.fsktm.um.edu.my:1454" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mods="http://www.loc.gov/mods/v3" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-0.xsd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mets="http://www.loc.gov/METS/"><mets:metsHdr CREATEDATA="2009-01-09T01:34:54Z"><mets:agent TYPE="ORGANIZATION" ROLE="CUSTODIAN"><mets:name>Malaysian Abstracting and Indexing System</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_oai:myais.fsktm.um.edu.my:1454_mods"><mets:mdWrap MDTYPE="mods"><mets:xmlData><mods:titleInfo><mods:title>Bounds on Random Infinite Urn Model</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given"> </mods:namePart><mods:namePart type="family">Boonta, S.</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given"> </mods:namePart><mods:namePart type="family">Neammanee, K.</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>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</mods:abstract><mods:classification authority="lcc">Q Science, Computer Science</mods:classification><mods:originInfo><mods:dateIssued encoding="iso8061">2007</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Penerbit Universiti Sains Malaysia</mods:publisher></mods:originInfo><mods:genre>Journal</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_oai:myais.fsktm.um.edu.my:1454"><mets:rightsMD ID="rights_oai:myais.fsktm.um.edu.my:1454_mods"><mets:mdWrap MDTYPE="mods"><mets:xmlData><mods:useAndReproduction>
<p><strong>For work being deposited by its own author:</strong> 
In self-archiving this collection of files and associated bibliographic 
metadata, I grant Malaysian Abstracting and Indexing System the right to store 
them and to make them permanently available publicly for free on-line. 
I declare that this material is my own intellectual property and I 
understand that Malaysian Abstracting and Indexing System does not assume any 
responsibility if there is any breach of copyright in distributing these 
files or metadata. (All authors are urged to prominently assert their 
copyright on the title page of their work.)</p>

<p><strong>For work being deposited by someone other than its 
author:</strong> I hereby declare that the collection of files and 
associated bibliographic metadata that I am archiving at 
Malaysian Abstracting and Indexing System) is in the public domain. If this is 
not the case, I accept full responsibility for any breach of copyright 
that distributing these files or metadata may entail.</p>

<p>Clicking on the deposit button indicates your agreement to these 
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec></mets:fileSec><mets:structMap><mets:div DMDID="DMD_oai:myais.fsktm.um.edu.my:1454_mods" AMDID="TMD_oai:myais.fsktm.um.edu.my:1454"></mets:div></mets:structMap></mets:mets>