On the use of partial confounding for the construction of alternative regular two-level blocked fractional factorial designs

In this paper, we consider experimental situations in which a regular fractional factorial design is to be used to study the effects of m two-level factors using n=2^m−k experimental units arranged in 2^p blocks of size 2^m−k−p. In such situations, two-factor interactions are often confounded with blocks and complete information is lost on these two-factor interactions. Here we consider the use of the foldover technique in conjunction with combining designs having different blocking schemes to produce alternative partially confounded blocked fractional factorial designs that have more estimable two-factor interactions or a higher estimation capacity or both than their traditional counterparts.     

Isomorphism check in fractional factorial designs via letter interaction pattern matrix

Two fractional factorial designs are considered isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and/or switching the levels of factors. To identify the isomorphism of two designs is known as an NP hard problem. In this paper, we propose a three-dimensional matrix named the letter interaction pattern matrix (LIPM) to characterize the information contained in the defining contrast subgroup of a regular two-level design. We first show that an LIPM could uniquely determine a design under isomorphism and then propose a set of principles to rearrange an LIPM to a standard form. In this way, we can significantly reduce the computational complexity in isomorphism check, which could only take O(2^p)+O(3k³)+O(2^k) operations to check two 2^k−p designs in the worst case. We also find a sufficient condition for two designs being isomorphic to each other, which is very simple and easy to use. In the end, we list some designs with the maximum numbers of clear or strongly clear two-factor interactions which were not found before.     

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.     

Selecting the normal population with the smallest variance: A restricted subset selection rule

Consider k( ? 2) normal populations whose means are all known or unknown and whose variances are unknown. Let σ²_[1] ? ??? ? σ_[k]² denote the ordered variances. Our goal is to select a non empty subset of the k populations whose size is at most m(1 ? m ? k ? 1) so that the population associated with the smallest variance (called the best population) is included in the selected subset with a guaranteed minimum probability P* whenever σ²_[2]/σ_[1]² ? δ* > 1, where P* and δ* are specified in advance of the experiment. Based on samples of size n from each of the populations, we propose and investigate a procedure called R_BCP. We also derive some asymptotic results for our procedure. Some comparisons with an earlier available procedure are presented in terms of the average subset sizes for selected slippage configurations based on simulations. The results are illustrated by an example.     

Balanced and partially balanced incomplete block designs with autocorrelation errors

The paper aims to find variance balanced and variance partially balanced incomplete block designs when observations within blocks are autocorrelated and we call them BIBAC and PBIBAC designs. Orthogonal arrays of type I and type II when used as BIBAC designs have smaller average variance of elementary contrasts of treatment effects compared to the corresponding Balanced Incomplete Block (BIB) designs with homoscedastic, uncorrelated errors. The relative efficiency of BIB designs compared to BIBAC designs depends on the block size k and the autocorrelation ρ and is independent of the number of treatments. Further this relative efficiency increases with increasing k. Partially balanced incomplete block designs with autocorrelated errors are introduced using partially balanced incomplete block designs and orthogonal arrays of type I and type II.     

A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

On the construction of m-associate PBIB designs I

The m-associate triangular association scheme has been discussed, and several series of partially balanced incomplete block (PBIB) designs with m-associate triangular association scheme have been obtained in Section 1. In Section 2, an m-associate triangular-group divisible association scheme $\text{(T}{}_{\mathrm{q}}\text{—}\text{GD}\text{m}\text{, 1<q<m)}$ has been introduced and several series of PBIB designs with m-associate triangular group divisible association scheme, from m-associate triangular PBIB designs have been constructed. Some numerical values to the three associate triangular designs, and three associate triangular group divisible designs in the range b, v≦100; r, k≦10, with their average efficiencies are given, respectively, in Tables I and II, in Section 3, where as usual v denotes the number of treatments, b the number of blocks, r the number of replications of each treatment, and k the block size.     

Unbiased tests for some one-sided testing problems

Unbiased tests are found for various testing problems. In the first model considered we test homogeneity of k + 1 independent one-parameter exponential family populations vs. the tree-top ordering alternative. The tree-top alternative is appropriate for one-sided comparisons for treatments with a control. In the next set of models normality is assumed. In one such model k independent populations have different unknown means but have an unknown common variance. An independent estimate of the variance exists. We test homogeneity of means against the alternative of no homogeneity. We also consider the alternative of an ordering of the means as well as the tree-top ordering. The final model considered is when we take a random sample from a multivariate normal population with unknown mean vector and an unknown covariance matrix of the intraclass type. We test the hypothesis that the mean vector is the zero vector against the one-sided alternative that each mean is nonnegative (with at least one positive).     

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.     

A nonparametric procedure for the analysis of balanced crossover designs

The authors propose nonparametric tests for the hypothesis of no direct treatment effects, as well as for the hypothesis of no carryover effects, for balanced crossover designs in which the number of treatments equals the number of periods p, where p ≥ 3. They suppose that the design consists of n replications of balanced crossover designs, each formed by m Latin squares of order p. Their tests are permutation tests which are based on the n vectors of least squares estimators of the parameters of interest obtained from the n replications of the experiment. They obtain both the exact and limiting distribution of the test statistics, and they show that the tests have, asymptotically, the same power as the F‐ratio test.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

Optimal selection and ordering of columns in supersaturated designs

Two methods to select columns for assigning factors to work on supersaturated designs are proposed. The focus of interest is the degree of non-orthogonality between the selected columns. One method is the exhaustive enumeration of selections of p columns from all k columns to find the exact optimality, while the other is intended to find an approximate solution by applying techniques used in the corresponding analysis, aiming for ease of use as well as a reduction in the large computing time required for large k with the first method. Numerical illustrations for several typical design matrices reveal that the resulting “approximately” optimal assignments of factors to their columns are exactly optimal for any p. Ordering the columns in E(s²)-optimal designs results in promising new findings including a large number of E(s²)-optimal designs.     

Optimum designs for estimating EDp based on raw optical density data

For raw optical density (ROD) data, such as those generated in biological assays employing an ELISA plate reader, ED_p-optimal designs are identified for a family of homogeneous non-linear models with two parameters. In every case, the theoretical ED_p-optimal design is a design with one or two support points. These theoretical optimal designs might not be suitable for many practical applications. To overcome this shortcoming, we have specified ED_p-optimal designs within the class of k-point equally spaced and uniform designs. The efficiency robustness of these designs with respect to initial nominal values of the parameters have been investigated.     

One-factor-at-a-time designs of resolution V

Two classes of designs of resolution V are constructed using one-factor-at-a-time techniques. They facilitate sequential learning and are more economical in run size than regular 2_V^k−p designs. Comparisons of D efficiency with other designs are given to assess the suitability of the proposed designs. Their D_s efficiencies can be dramatically improved with the addition of a few runs.     

Improved bonferroni procedures for testing overall and pairwise homogeneity hypotheses

Simes' (1986) improved Bonferroni test is verified by simulations ^?to control the α-level when testing the overall homogeneity hypothesis with all pairwise t statistics in a balanced parallel group design. Similarly, this result was found to hold (for practical purposes) in various underlying distributions other than the normal and in some unbalanced designs. To allow the use of step-up procedures based on pairwise t statistics, simulations were used to verify that Simes' test, when applied to testing multiple subset homogeneity hypotheses with pairwise t statistics also keeps the level ? α. Some robustness as above was found here too. Tables of the simulation results are provided and an example of a step-up Hommel-Shaffer type procedure with pairwise comparisons is given.     

An exact upper limit for the variance bias in a carry-over model with correlated errors

The analysis of crossover designs assuming i.i.d. errors leads to biased variance estimates whenever the true covariance structure is not spherical. As a result, the OLS F-test for the equality of the direct effects of the treatments is not valid. Bellavance et al. [1996. Biometrics 52, 607–612] use simulations to show that a modified F-test based on an estimate of the within subjects covariance matrix allows for nearly unbiased tests. Kunert and Utzig [1993. JRSS B 55, 919–927] propose an alternative test that does not need an estimate of the covariance matrix. Instead, they correct the F-statistic by multiplying by a constant based on the worst-case scenario. However, for designs with more than three observations per subject, Kunert and Utzig (1993) only give a rough upper bound for the worst-case variance bias. This may lead to overly conservative tests. In this paper we derive an exact upper limit for the variance bias due to carry-over for an arbitrary number of observations per subject. The result holds for a certain class of highly efficient balanced crossover designs.     

An approximate degrees of freedom test for heteroscedastic two-way ANOVA

Heteroscedastic two-way ANOVA are frequently encountered in real data analysis. In the literature, classical F-tests are often blindly employed although they are often biased even for moderate heteroscedasticity. To overcome this problem, several approximate tests have been proposed in the literature. These tests, however, are either too complicated to implement or do not work well in terms of size controlling. In this paper, we propose a simple and accurate approximate degrees of freedom (ADF) test. The ADF test is shown to be invariant under affine-transformations, different choices of contrast matrix for the same null hypothesis, or different labeling schemes of cell means. Moreover, it can be conducted easily using the usual F-distribution with one unknown degree of freedom estimated from the data. Simulations demonstrate that the ADF test works well in various cell sizes and parameter configurations but the classical F-tests work badly when the cell variance homogeneity assumption is violated. A real data example illustrates the methodologies.     

Testing multiple slippages

A class of invariant Bayes rules is derived for testing homogeneity of k (≥2) different populations against (^k_t) slippage alternatives that some (unknown) subset of size t of the given populations has parameter larger than the remaining k-t, where t is a given integer between 1 and k-1. For a similar problem in nonparametric situations, locally best tests based on ranks are derived.     

The A-optimal non-saturated weighing designs for n = 15 observations

The problem of constructing A-optimal weighing and first order fractional factorial designs for n ≡ 3 mod 4 observations is considered. The non-existence of the weighing design matrices for n = 15 observations and k = 13, 14 factors, for which the corresponding information matrices have inverses with minimum trace, is proved. These designs are the first non-saturated cases (k < n) in which the unattainability of Sathe and Shenoy's (1989) lower bound on A-optimality is shown. Using an algorithm proposed in Farmakis (1991) we construct 15 × k (+1, −1)-matrices for k = 13, 14 and we prove their A-optimality using the improved (higher) lower bounds on A-optimality established by Chadjiconstantinidis and Kounias (1994). Also the A-optimal designs for n = 15, k ⩽ 12 are given.     

A Weighted Least Squares Approach to Levene's Test of Homogeneity of Variance

In 1960 Levene suggested a potentially robust test of homogeneity of variance based on an ordinary least squares analysis of variance of the absolute values of mean-based residuals. Levene's test has since been shown to have inflated levels of significance when based on the F-distribution, and tests a hypothesis other than homogeneity of variance when treatments are unequally replicated, but the incorrect formulation is now standard output in several statistical packages. This paper develops a weighted least squares analysis of variance of the absolute values of both mean-based and median-based residuals. It shows how to adjust the residuals so that tests using the F -statistic focus on homogeneity of variance for both balanced and unbalanced designs. It shows how to modify the F -statistics currently produced by statistical packages so that the distribution of the resultant test statistic is closer to an F-distribution than is currently the case. The weighted least squares approach also produces component mean squares that are unbiased irrespective of which variable is used in Levene's test. To complete this aspect of the investigation the paper derives exact second-order moments of the component sums of squares used in the calculation of the mean-based test statistic. It shows that, for large samples, both ordinary and weighted least squares test statistics are equivalent; however they are over-dispersed compared to an F variable.