首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
Rao (1947) provided two inequalities on parameters of an orthogonal array OA(N,m,s,t). An orthogonal array attaining these Rao bounds is said to be complete. Noda (1979) characterized complete orthogonal arrays of t=4 (strength). We here investigate complete orthogonal arrays with s=2 (levels) and general t; and with t=2, 3 and general s.  相似文献   

2.
If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the “expansive replacement” construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an N-run orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N, we investigate the height and the size of the lattice. It is shown that the height is at most ⌊c(N−1)⌋, where c=1.4039…, and that there is an infinite sequence of values of N for which this bound is attained. On the other hand, the number of nodes in the lattice is bounded above by a superpolynomial function of N (and superpolynomial growth does occur for certain sequences of values of N). Using a new construction based on “mixed spreads”, all parameter sets with 64 runs are determined. Four of these 64-run orthogonal arrays appear to be new.  相似文献   

3.
Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b1 and b2, the dimensions of the design array, are each ?50.  相似文献   

4.
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. These designs are useful in designing successive and/or simulataneous experiments on the same set of rc experimental units, in constructing codes, and in constructing orthogonal arrays. A pair of orthogonal F-rectangle designs exists for any set of v treatment (symbols), whereas no pair of orthogonal Latin square designs of order two and six exists; one of the two construction methods presented does not rely on any previous knowledge about the existence of a pair of orthogonal Latin square designs, whereas the second one does. It is shown how to extend the methods to r=pv row by c=qv column designs and how to obtain t pairwise orthogonal F-rectangle design. When the maximum possible number of pairwise orthogonal F-rectangle designs is attained the set is said to be complete. Complete sets are obtained for all v for which v is a prime power. The construction method makes use of the existence of a complete set of pairwise orthogonal Latin square designs and of an orthogonal array with vn columns, (vn−1)/(v−1) rows, v symbols, and of strength two.  相似文献   

5.
Search designs are considered for searching and estimating one nonzero interaction from the two and three factor interactions under the search linear model. We compare three 12-run search designs D1, D2, and D3, and three 11-run search designs D4, D5, and D6, for a 24 factorial experiment. Designs D2 and D3 are orthogonal arrays of strength 2, D1 and D4 are balanced arrays of full strength, D5 is a balanced array of strength 2, and D6 is obtained from D3 by deleting the duplicate run. Designs D4 and D5 are also obtained by deleting a run from D1 and D2, respectively. Balanced arrays and orthogonal arrays are commonly used factorial designs in scientific experiments. “Search probabilities” are calculated for the comparison of search designs. Three criteria based on search probabilities are presented to determine the design which is most likely to identify the nonzero interaction. The calculation of these search probabilities depends on an unknown parameter ρ which has a signal-to-noise ratio form. For a given value of ρ, Criteria I and II are newly proposed in this paper and Criteria III is given in Shirakura et al. (Ann. Statist. 24 (6) (1996) 2560). We generalize Criteria I–III for all values of ρ so that the comparison of search designs can be made without requiring a specific value of ρ. We have developed simplified methods for comparing designs under these three criteria for all values of ρ. We demonstrate, under all three criteria, that the balanced array D1 is more likely to identify the nonzero interaction than the orthogonal arrays D2 and D3, and the design D4 is more likely to identify the nonzero interaction than the designs D5 and D6.The methods of comparing designs developed in this paper are applicable to other factorial experiments for searching one nonzero interaction of any order.  相似文献   

6.
Complete sets of orthogonal F-squares of order n = sp, where g is a prime or prime power and p is a positive integer have been constructed by Hedayat, Raghavarao, and Seiden (1975). Federer (1977) has constructed complete sets of orthogonal F-squares of order n = 4t, where t is a positive integer. We give a general procedure for constructing orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set, where n is not necessarily a prime or prime power. In particular, we show how to construct sets of orthogonal F-squares of order n = 2sp, where s is a prime or prime power and p is a positive integer. These sets are shown to be near complete and approach complete sets as s and/or p become large. We have also shown how to construct orthogonal arrays by these methods. In addition, the best upper bound on the number t of orthogonal F(n, λ1), F(n, λ2), …, F(n, λ1) squares is given.  相似文献   

7.
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.  相似文献   

8.
For two-level factorials, we consider designs in N=2 (mod 4) runs as obtained by adding two runs, with a certain coincidence pattern, to an orthogonal array of strength two. These designs are known to be optimal main effect plans in a very broad sense in the absence of interactions. Among them, we explore the ones having minimum aberration, with a view to ensuring maximum model robustness even when interactions are possibly present. This is done by sequentially minimizing a measure of the bias caused by interactions of successively higher orders.  相似文献   

9.
A method of constructing a resolvable orthogonal array (4λk2,2) which can be partitioned into λ orthogonal arrays (4,k 2,1) is proposed. The number of constraints kfor this type of orthogonal array is at most 3λ. When λ=2 or a multiple of 4, an orthogonal array with the maximum number of constraints of 3λ can be constructed. When λ=4n+2(n≧1) an orthogonal array with 2λ+2 constraints can be constructed. When λ is an odd number, orthogonal arrays can be constructed for λ=3,5,7, and 9 with k=4,8,12, and 13 respectively.  相似文献   

10.
Let R be a family of k-element blocks of a v-element set V such that any two elements of V are contained in λ blocks of R and R=R1∪…∪Rv?1, RiRj=? (ij) and ?{BiRji=1,…,v?k}=V (Bi a block in Rj), i.e. R is a resolvable block design RB(v, k, λ). In this paper it will be shown that a sufficient condition for the existence of an RB(v, 8, 7) is that v≡0 (mod 8) and v is nondivisible by 3, 5, 7.  相似文献   

11.
Latin hypercube designs (LHDs) have recently found wide applications in computer experiments. A number of methods have been proposed to construct LHDs with orthogonality among main-effects. When second-order effects are present, it is desirable that an orthogonal LHD satisfies the property that the sum of elementwise products of any three columns (whether distinct or not) is 0. The orthogonal LHDs constructed by Ye (1998), Cioppa and Lucas (2007), Sun et al. (2009) and Georgiou (2009) all have this property. However, the run size n of any design in the former three references must be a power of two (n=2c) or a power of two plus one (n=2c+1), which is a rather severe restriction. In this paper, we construct orthogonal LHDs with more flexible run sizes which also have the property that the sum of elementwise product of any three columns is 0. Further, we compare the proposed designs with some existing orthogonal LHDs, and prove that any orthogonal LHD with this property, including the proposed orthogonal LHD, is optimal in the sense of having the minimum values of ave(|t|), tmax, ave(|q|) and qmax.  相似文献   

12.
It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say Lt, that depends on the orders of the factors. Thus Lt is a lower bound on the size of arrays of strength t on those factors, and is no larger than Lk, the size of the complete factorial design. We investigate the relationship between the numbers Lt, and two questions in particular: For what t is Lt < Lk? And when Lt = Lk, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than Lk as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.  相似文献   

13.
This paper presents 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. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.  相似文献   

14.
Collineation groups of finite projective planes are studied which do not leave invariant any point, line or triangle and contain a non-trivial perspectivity. In many instances the collineation group G can be determined, and it can be proved that the underlying projective plane contains a desarguesian subplane, whose order is related to the order of G. This can be done, because one has rather strong results about the structure of G, in particular about the first terms of a chief series of G. Projective planes are taken here as a suitable testing ground for methods, which can be used for many classes of designs to quickly find new examples and obtain some classification.  相似文献   

15.
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2,…, x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v and index ρ [OQS] is a pair (X,H), where X is a finite set of v vertices and H is a collection of edge disjoint octagon quadrangles (called blocks) which partition the edge set of ρKv defined on X. An octagon quadrangle systemΣ=(X,H) of order v and index λ is said to be upper C4-perfect if the collection of all of the upper4-cycles contained in the octagon quadrangles form a μ-fold 4-cycle system of order v; it is said to be upper strongly perfect, if the collection of all of the upper4-cycles contained in the octagon quadrangles form a μ-fold 4-cycle system of order v and also the collection of all of the outside8-cycles contained in the octagon quadrangles form a ?-fold 8-cycle system of order v. In this paper, the authors determine the spectrum for these systems.  相似文献   

16.
This paper considers the use of orthogonal arrays of strength two as experimental designs for fitting a surrogate model. Contrary to standard space-filling designs or Latin hypercube designs, the points of an orthogonal array of strength two are well distributed when they are projected on the two-dimensional faces of the unit cube. The aim is to determine if this property allows one to fit an accurate surrogate model when the computer response is governed by second-order interactions of some input variables. The first part of the paper is devoted to the construction of orthogonal arrays with space-filling properties. In the second part, orthogonal arrays are compared with standard designs for fitting a Gaussian process model.  相似文献   

17.
Orthogonal Latin hypercube (OLH) is a good design choice in a polynomial function model for computer experiments, because it ensures uncorrelated estimation of linear effects when a first-order model is fitted. However, when a second-order model is adopted, an OLH also needs to satisfy the additional property that each column is orthogonal to the elementwise square of all columns and orthogonal to the elementwise product of every pair of columns. Such class of OLHs is called OLHs of order two while the former class just possessing two-dimensional orthogonality is called OLHs of order one. In this paper we present a general method for constructing OLHs of orders one and two for n=smn=sm runs, where s and m may be any positive integers greater than one, by rotating a grouped orthogonal array with a column-orthogonal rotation matrix. The Kronecker product and the stacking methods are revisited and combined to construct some new classes of OLHs of orders one and two with other flexible numbers of runs. Some useful OLHs of order one or two with larger factor-to-run ratio and moderate runs are tabulated and discussed.  相似文献   

18.
A connection between a balanced fractional 2m factorial design of resolution 2l + 1 and a balanced array of strength 2l with index set {μ0, μ1,…, μ2l} was established by Yamamoto, Shirakura and Kuwada (1975). The main purpose of this paper is to give a connection between a balanced fractional 3m factorial design of resolution V and a balanced array of strength 4, size N, m constraints, 3 levels and index set {λl0l1l2}.  相似文献   

19.
A lower bound is given for the number of experimental runs required in search designs for two-level orthogonal array of strength one.  相似文献   

20.
In the first part of this paper, we give a short and direct construction of signed orthogonal array SOA(λ,t,k,v), for any set of parameters λ,t,k,v,tk. We also construct a specific basis of the Z-module generated by any SOA(0,t,k,v), for any t,k,v,tk. We will then construct an inite family of large set of disjoint ordered designs by applying G.B. Khosrovshahi and S. Ajoodani-Namini's method to Luc. Teirlinck's construction.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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