On Start-Up Demonstration Tests Under Exchangeability
On Start-Up Demonstration Tests Under Exchangeability
复制标题
DOI：
10.1109/tr.2008.2006290
复制
发表时间：
2008-11
影响因子：
5.9
通讯作者：
S. Eryilmaz;S. Chakraborti
中科院分区：
文献类型：
--
作者：
S. Eryilmaz;S. Chakraborti
连续成功总失败(CSTF)是一种众所周知的启动演示测试程序，在该程序中，当连续启动尝试在指定数量的失败之前产生指定数量的连续成功时，被测试的单元被接受；否则该单元被拒绝，并且在两种情况下测试(实验)都被终止。在假设启动成功的概率为随机变量的情况下，研究了CSTF过程。在这一假设下，尝试创业的结果是遵循可交换模型的相依随机变量。推导并研究了在这种情况下等待时间(测试长度)的无条件概率分布和条件概率分布。计算了无条件等待时间分布的前两个时刻。给出了数值和图形说明，并与I.I.D.的相应结果进行了比较。模特。
Consecutive successes total failures (CSTF) is a well known start-up demonstration test procedure in which a unit under test is accepted when successive start-up attempts produce a specified number of consecutive successes before a specified number of failures; otherwise the unit is rejected, and in both cases testing (the experiment) is terminated. The CSTF procedure is studied here assuming that the probability of a successful start-up is a random variable. Under this assumption, the outcomes of the attempted start-ups are dependent random variables following an exchangeable model. The unconditional, and the conditional probability distributions of the waiting time (length of the test) are derived and studied in this situation. The first two moments of unconditional waiting time distribution are calculated. Numerical and graphical illustrations are provided, and comparisons are made with the corresponding results for the i.i.d. model.