English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58323/91867 (63%)
造訪人次 : 14038312      線上人數 : 86
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58770

    題名: Planning Life Tests Based on Progressively Type-I Grouped Censored Data from the Weibull Distribution
    作者: Lin, Chien-tai;Balakrishnan, N.;Wu, Sam J. S.
    貢獻者: 淡江大學數學學系
    關鍵詞: Optimally spaced inspection times;Optimal progressive Type-I grouped censoring;Reliability sampling plan;Simulated annealing algorithm
    日期: 2011-03
    上傳時間: 2011-10-01 21:09:54 (UTC+8)
    出版者: Philadelphia: Taylor & Francis
    摘要: In this article, we apply the simulated annealing algorithm to determine optimally spaced inspection times for the two-parameter Weibull distribution for any given progressive Type-I grouped censoring plan. We examine how the asymptotic relative efficiencies of the estimates are affected by the position of the monitoring points and the number of monitoring points used. A comparison of different inspection plans is made that will enable the user to select a plan for a specified quality goal. Using the same algorithm, we can also determine an optimal progressive Type-I grouped censoring plan when the inspection times and the expected proportions of total failures in the experiment are pre-fixed. Finally, we discuss the sample size and the acceptance constant of the progressively Type-I grouped censored reliability sampling plan when the optimal inspection times are used.
    關聯: Communications in Statistics - Simulation and Computation 40(4), pp.574-595
    DOI: 10.1080/03610918.2010.549278
    顯示於類別:[數學學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    Planning Life Tests Based on Progressively Type-I Grouped Censored Data from the Weibull Distribution.pdf328KbAdobe PDF0檢視/開啟



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