Showing papers on "Orthogonal array published in 1982"
TL;DR: It is proved that the universal optimality of fractional factorial plans derivable through orthogonal arrays in the presence of lower order interactions is proved.
Abstract: This paper extends the results of Cheng (1980) and proves the universal optimality of fractional factorial plans derivable through orthogonal arrays in the presence of lower order interactions. Also the connexion with orthogonal fractional factorial plans has been explored.
23 citations
TL;DR: In this article, a number of methods of construction of GD-RC and RectanguIar-RC designs, based upon the series A of BIB-RC, using the method of Kronecker product, are developed.
Abstract: Summary
A number of methods of construction of GD-RC and RectanguIar-RC designs, based upon the series A of BIB-RC designs, using the method of Kronecker product, are developed.
9 citations
TL;DR: In this article, the concept of pairwise orthogonal Latin square design is applied to r row by c column experiment designs which are called pairwise Orthogonal F -rectangle designs.
8 citations
TL;DR: In this article, the trace of the covariance matrix of the estimates of effects based on a fractional 2m factorial (2m-FF) design T of resolution V for the following two cases: one is the case where T is constructed by adding some restricted assemblies to an orthogonal array.
5 citations
TL;DR: Finite embedding theorems for partial 3-quasigroups of various types are produced to show that a finite partial member of the class can be embedded in a finite complete member of a class.
1 citations
1 Jan 1982
TL;DR: In this article, the set of d-tuples k = (K1, Kd) with positive integers for coordinates, where d is a fixed positive integer, was considered.
Abstract: Let Nd be the set of d-tuples k = (K1,…,Kd) With positive integers for coordinates, where d is a fixed positive integer. As usual, we write 2K = (2K1,…,2Kd), 1 = (1,…,1), and k ≤ n iff kj ≥ nj for each j = l,…,d.