Circular balanced repeated measurement designs in periods of three different sizes

Abstract

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then repeated measurements designs with unequal period sizes should be used. In this article, some infinite series are developed to generate the minimal balanced repeated measurement designs in periods of three different sizes p₁, p₂ and p₃, where 2?≤?p₃?<?p₂ ≤ 10 and p₂?<?p₁.     

Minimal circular strongly balanced repeated measurements designs in periods of three different sizes

Repeated measurements designs (RMD) are widely used in medicine, pharmacology, animal sciences, and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then RMD in periods of unequal sizes should be used. In this article, some infinite series are developed to generate the minimal circular strongly balanced RMD in periods of three different sizes p₁, p₂, and p₃, where 2 ≤ p₃ < p₂ ≤ 10.     

THE USE OF A CLASS OF FOLDOVER DESIGNS AS SEARCH DESIGNS

It is shown that members of a class of two-level nonorthogonal resolution IV designs with n factors are strongly resolvable search designs when k, the maximum number of two-factor interactions thought possible, equals one; weakly resolvable when k = 2 except when the number of factors is 6; and may not be weakly resolvable when k≥ 3.     

D-minimax Second-order Designs Over Hypercubes for Extrapolation and Restricted Interpolation Regions

The D-minimax criterion for estimating slopes of a response surface involving k factors is considered for situations where the experimental region χ and the region of interest ? are co-centered cubes but not necessarily identical. Taking χ = [ ? 1, 1]^k and ? = [ ? R, R]^k, optimal designs under the criterion for the full second-order model are derived for various values of R and their relative performances investigated. The asymptotically optimal design as R → ∞ is also derived and investigated. In addition, the optimal designs within the class of product designs are obtained. In the asymptotic case it is found that the optimal product design is given by a solution of a cubic equation that reduces to a quadratic equation for k = 3?and?6. Relative performances of various designs obtained are examined. In particular, the optimal asymptotic product design and the traditional D-optimal design are compared and it is found that the former performs very well.     

Some new construction of circular weakly balanced repeated measurements designs in periods of two different sizes

Abstract

Balanced repeated measurements designs (RMDs) balance out the residual effects. Williams Latin square designs work as minimal combinatorial balanced as well as variance balanced for RMDs for p (period sizes) = v (number of treatments). If minimal balanced RMDs cannot be constructed for the situations where p must be less than v then weakly balanced RMDs should be preferred. In this article, some generators are developed to generate circular weakly balanced RMDs in periods of two different sizes. To obtain the proposed designs, some construction procedures are also described for some of the cases where we could not develop generators.     

Construction of Efficient Multi-Level k-Circulant Supersaturated Designs

This article proposes an algorithm to construct efficient balanced multi-level k-circulant supersaturated designs with m factors and n runs. The algorithm generates efficient balanced multi-level k-circulant supersaturated designs very fast. Using the proposed algorithm many balanced multi-level supersaturated designs are constructed and cataloged. A list of many optimal and near optimal, multi-level supersaturated designs is also provided for m ≤ 60 and number of levels (q) ≤10. The algorithm can be used to generate two-level k-circulant supersaturated designs also and some large optimal two-level supersaturated designs are presented. An upper bound to the number of factors in a balanced multi-level supersaturated design such that no two columns are fully aliased is also provided.     

COMPUTER-AIDED CONSTRUCTION OF SMALL (M, S)-OPTIMAL INCOMPLETE BLOCK DESIGNS

A new exchange algorithm for the construction of (M, S)-optimal incomplete block designs (IBDS) is developed. This exchange algorithm is used to construct 973 (M, S)-optimal IBDs (v, k, b) for v= 4,…,12 (varieties) with arbitrary v, k (block size) and b (number of blocks). The efficiencies of the “best” (M, S)-optimal IBDs constructed by this algorithm are compared with the efficiencies of the corresponding nearly balanced incomplete block designs (NBIBDs) of Cheng(1979), Cheng & Wu (1981) and Mitchell & John(1976).     

Computer-Generated Neighbor Designs

Neighbor designs are useful to remove the neighbor effects. In this article, an algorithm is developed and is coded in Visual C + +to generate the initial block for possible first, second,…, and all order neighbor designs. To get the required design, a block (0, 1, 2,…, k ? 1) is then augmented with (v ? 1) blocks obtained by developing the initial block cyclically mod (v ? 1).     

Block designs for incomplete factorial treatment structures with two factors

Abstract

In this paper, the problem of obtaining efficient block designs for incomplete factorial treatment structure with two factors excluding one treatment combination for estimation of dual versus single treatment contrasts is considered. The designs have been obtained using the A-optimal completely randomized designs and modified strongest treatment interchange algorithm. A catalog of efficient block designs has been prepared for m₁?=?3, 4 and m₂?=?2, b?≤?10 and k?≤?9 and for m₁?=?3,4 and m₂?=?3, 4, b?≤?10 and k?≤?10.     

Construction of minimum aberration blocked two-level regular factorial designs

ABSTRACT

In this article, we consider the construction of minimum aberration 2^{n ? k}: 2^p designs with respect to some existing combined wordlength patterns, where a 2^{n ? k}: 2^p design is a blocked two-level design with n treatment factors, 2^p blocks, and N = 2^q runs with q = n ? k. Two methods are proposed for two situations: n ? 2^{q ? p} ? 1 and n > N/2. These methods enable us to obtain some new minimum aberration 2^{n ? k}: 2^p designs from existing minimum aberration unblocked and blocked designs. Examples are included to illustrate the theory.     

Families of proper generalized neighbor designs

A generalized neighbor design relaxes the equality condition on the number of times two treatments occur as neighbors in the design. In this article we have constructed a new series of generalized neighbor designs with equal block sizes, a series of neighbor designs of Rees [1967. Some designs of use in serology. Biometrics 23, 779–791] and a series of neighbor designs with two distinct block sizes. Two more new series of GN₂ designs are also constructed for even number of treatments. It has been shown that quasi neighbor designs introduced by Preece [1994. Balanced Ouchterlony neighbor designs. J. Combin. Math. Combin. Comput. 15, 197–219] are special cases of generalized neighbor designs with t=2$t=2$. All the designs given here are binary. A new definition—partially balanced circuit design is introduced which is a special case of generalized neighbor designs with binary blocks.     

Tables of Cyclic Incomplete Block Designs: r=k

Initial blocks and efficiencies are given for cyclic incomplete block designs in the range t= 10(1)60 and r=k= 3(1)10. The designs have been selected by search procedures using optimality criteria which maximize the efficiency factor.     

Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition

In this article, a general method of construction of neighbor block designs is given. The designs are constructed using variation of a simple method which we refer to as the method of addition (renamed as the method of cyclic shifts). We give complete solution of neighbor balanced designs for k = 4 for any value of v. We also give many series of generalized neighbor designs (GNDs). In the last section, we have constructed GNDs in a sequential manner (as Did John 1981) for v ≤ 50 and r is multiple of k.     

Generalized Bhaskar Rao designs

Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In particular this paper shows that the necessary conditions are sufficient for the existence of generalized Bhaskar Rao designs with k=3 for the following groups: ?G? is odd, G=Z^r₂, and G=Z^r₂×H where 3? ?H? and r?1. It also constructs generalized Bhaskar Rao designs with υ=k, which is equivalent to υ rows of a generalized Hadamard matrix of order n where υ?n.     

Minimal circular balanced repeated measurement designs in unequal period sizes

Abstract

Repeated measurement designs (RMDs) are widely used in medicine, pharmacology, animal sciences and psychology. In these fields, there are several situations where these designs should be used in periods of different sizes. With the use of RMD, residual effects or carry over effects may arise and balanced RMDs are solution to this problem. In this article, therefore, some infinite series are developed through method of cyclic shifts to obtain circular balanced repeated measurements designs in periods of two different sizes.     

PARTIALLY EQUINEIGHBOURED DESIGNS

This paper presents further results on a class of designs called equineighboured designs, ED. These designs are intended for field and related experiments, especially whenever there is evidence that observations in the same block are correlated. An ED has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at each level. Ipinyomi (1986) has defined and shown that ED are balanced designs when neighbouring observations are correlated. He has also presented ED as a continuation of the development of optimal block designs. An ED would often require many times the number of experimental materials needed for the construction of an ordinary balanced incomplete block, BIB, design for the same number of treatments and block sizes. Thus for a relatively large number of treatments and block sizes the required minimum number of blocks may be excessively large for practical use of ED. In this paper we shall define and examine partially equineighboured designs with n concurrences, PED (n), as alternatives where ED are practically unachievable. Particular attention will be given to designs with smaller numbers of blocks and for which only as little balance as possible may be lost.     

Construction of repeated measurements designs strongly balanced for residual effects

Abstract

Repeated Measurements Designs have been widely used in agriculture, animal husbandry, education, biology, botany and engineering. Balanced or strongly balanced repeated measurements designs are useful to balance out the residual effects. In this article, some new generators and construction procedures are proposed to obtain circular strongly balanced repeated measurements designs in periods of (a) equal sizes, (b) two different sizes, and (c) three different sizes.     

D-Optimal Designs for Covariate Parameters in Block Design Set Up

The problem considered is that of finding D-optimal design for the estimation of covariate parameters and the treatment and block contrasts in a block design set up in the presence of non stochastic controllable covariates, when N = 2(mod 4), N being the total number of observations. It is clear that when N ≠ 0 (mod 4), it is not possible to find designs attaining minimum variance for the estimated covariate parameters. Conditions for D-optimum designs for the estimation of covariate parameters were established when each of the covariates belongs to the interval [?1, 1]. Some constructions of D-optimal design have been provided for symmetric balanced incomplete block design (SBIBD) with parameters b = v, r = k = v ? 1, λ =v ? 2 when k = 2 (mod 4) and b is an odd integer.     

A method for constructing supersaturated designs and its Es2 optimality

A lower bound for the Es² value of an arbitrary supersaturated design is derived. A general method for constructing supersaturated designs is proposed and shown to produce designs with n runs and m = k(n — 1) factors that achieve the lower bound for Es² and are thus optimal with respect to the Es² criterion. Within the class of designs given by the construction method, further discrimination can be made by minimizing the pairwise correlations and using the generalized D and A criteria proposed by Wu (1993). Efficient designs of 12, 16, 20 and 24 runs are constructed by following this approach.     

CONSTRUCTION OF BALANCED TERNARY DESIGNS

In this paper variance balanced ternary designs are constructed in unequal block sizes for situations when suitable BIB designs do not exist for a given number of treatments because of the constraints bk=vr,and λ(v - 1) =r(k- 1).