English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 55184/89457 (62%)
造访人次 : 10684096      在线人数 : 71
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/41705


    题名: Using Moments to Approximate the Distribution of the Scan Statistic
    作者: Huffer, Fred W.;Lin, Chien-tai
    贡献者: 淡江大學數學學系
    关键词: Compound Poisson approximation;Markov chain approximation;linear programming;probability bounds;method of moments;spacings;number of clumps
    日期: 1999
    上传时间: 2010-01-28
    出版者: Boston: Birkhäuser
    摘要: Let C w denote the number ofm:wclumps amongNrandom points uniformly distributed in the interval (01]. (We say that anm:wclump exists whenmpoints fall within an interval of lengthw.) The previous chapter described how to compute the lower-order moments ofC w . In the present chapter, we discuss ways these moments can be used to obtain bounds and approximations for the distribution of the (continuous conditional) scan statisticS w . We give upper and lower bounds based on the use of four moments. In some situations, these bounds improve considerably on the previously available bounds. We present an approximation based on a simple Markov chain model, and also give a variety of compound Poisson approximations. These approximations are compared with others in the literature. Finally, we present a compound Poisson approximation to the distribution of the number of clumpsC w .
    關聯: Scan Statistics and Applications, pp.165-190
    显示于类别:[數學學系暨研究所] 專書之單篇

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML327检视/开启
    index.html0KbHTML103检视/开启
    index.html0KbHTML90检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈