English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 55184/89457 (62%)
造访人次 : 10662982      在线人数 : 13
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/41201

    题名: Computing the exact distribution of the extremes of sums of consecutive spacings
    作者: Huffer, Fred W.;林千代;Lin, Chien-tai
    贡献者: 淡江大學數學學系
    关键词: Cluster probabilities;Scan statistic;Symbolic computation
    日期: 1997-12-04
    上传时间: 2010-01-28 06:55:37 (UTC+8)
    出版者: Elsevier
    摘要: Consider the spacings between i.i.d. uniform observations in the interval (0,1). We develop a general method for evaluating the distribution of the minimum or the maximum of random variables which are sums of consecutive spacings. We then present some applications of this method. The main idea underlying our approach was given by Huffer (1988): a recursion is used to break up the joint distribution of several linear combinations of spacings into a sum of simpler components. We continue applying this recursion until we obtain components which are simple and easily expressed in closed form. In this paper we propose an algorithm for the systematic application of this recursion. Our method can be used to solve a variety of problems involving sums of spacings or exponential random variables. In particular, our method gives another way to obtain the distribution of the scan statistic. Because the output of our procedure is a polynomial whose coefficients are computed exactly, we can supply numerical answers which are accurate to any required degree of precision.
    關聯: Computational Statistics and Data Analysis 26(2), pp.117-132
    DOI: 10.1016/S0167-9473(97)00027-3
    显示于类别:[數學學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数



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