首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  免费   0篇
统计学   3篇
  1983年   1篇
  1979年   2篇
排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
The problem of embedding an orthogonal array of strength 2 into a complete orthogonal array is discussed. It is shown that for any n≠4 any orthogonal array of strength 2 and deficiency 2 can always be embedded into a corresponding complete orthogonal array.  相似文献   
2.
In this paper we study a robustness property of partially balanced incomplete block designs based on association schemes with m classes (PBIBD(m)) against the unavailability of data in the sense that, when any t (a positive integer) observations are unavailable the design remains connected w.r.t. treatment. We characterize the robustness property of PBIBD(m) completely for m=2 and partially for m=3.  相似文献   
3.
Let x ≥ 0 and n ≥ 2 be integers. Suppose there exists an orthogonal array A(n, q, μ1) of strength 2 in n symbols with q rows and n2μ1 columns where q = q1 ? d, q1 = n2x + n + 1, μ1 = (n ? 1)x + 1 and d is a positive integer. Then d is called the deficiency of the orthogonal array. The question of embedding such an array into a complete array A(n, q1, μ1) is considered for the case d ≥ 3. It is shown that for d = 3 such an embedding is always possible if n ≥ 2(d ? 1)2(2d2 ? 2d + 1). Partial results are indicated if d ≥ 4 for the embedding of a related design in a corresponding balanced incomplete block design.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号