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.     

Cyclic Polygonal Designs with Block Size 3 and Joint Distance α = 2

Polygonal designs are useful in survey sampling in terms of balanced sampling plans excluding contiguous units (BSECs) and balanced sampling plans excluding adjacent units (BSAs). In this article, the method of cyclic shifts has been used for the construction of cyclic polygonal designs (in terms of BSAs) with block size k = 3 and λ = 1, 2, 3, 4, 6, 12 for joint distance α = 2 and 51 new designs for treatments v ≤ 100 are given.     

Sensitivity analysis in maximum likelihood factor analysis

The present paper deals with sensitivity analysis in maximum likelihood factor analysis. To investigate the influence of a small change of data we derive theoretical influence functions I(x; LL^T ) and I(x; Δ) for a common variance matrix T= LL^T and a unique variance matrix Δ respectively. Numerical examples are shown to illustrate our procedure.     

Circular First- and Second-Order Balanced Repeated Measurements Designs

Sharma (1977 Sharma , V. K. ( 1977 ). Change-over designs with complete balance for first and second order residual effect . Canad. J. Statist. 5 : 121 – 132 .[Crossref] , [Google Scholar]) and Aggarwal et al. (2006 Aggarwal , M. L. , Deng , L.-Y. , Jha , M. K. ( 2006 ). Balanced residual treatment effects designs of first and second order . Statist. Probab. Lett. 76 : 597 – 600 .[Crossref], [Web of Science ®] , [Google Scholar]) considered non circular construction of first- and second-order balanced repeated measurements designs. Sharma et al. (2002 Sharma , V. K. , Varghese , C. , Jaggi , S. ( 2002 ). On optimality of change-over designs balanced for first and second order residual effects . Metron 60 : 153 – 162 . [Google Scholar]) constructed circular first- and second-order balanced repeated measurements designs only for a class with parameters (v, p = 3n, n = v ²) and also showed its universal optimality. In this article, we consider circular construction of first- and second-order balanced repeated measurements designs and strongly balanced repeated measurements designs by using the method of cyclic shifts. Some new circular designs with parameters (v, p, n) for cases p = v, p < v and p > v are given.     

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).     

Projection Properties of Certain Three-Level Main Effect Plans with Quantitative Factors

ABSTRACT

Orthogonal arrays are used as screening designs to identify active main effects, after which the properties of the subdesign for estimating these effects and possibly their interactions become important. Such a subdesign is known as a “projection design”. In this article, we have identified all the geometric non isomorphic projection designs of an OA(27,13,3,2), an OA(18,7,3,2) and an OA(36,13,3,2) into k = 3,4, and 5 factors when they are used for screening out active quantitative experimental factors, with regard to the prior selection of the middle level of factors. We use the popular D-efficiency criterion to evaluate the ability of each design found in estimating the parameters of a second order model.     

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.     

Efficient three-level screening designs using weighing matrices

Screening is the first stage of many industrial experiments and is used to determine efficiently and effectively a small number of potential factors among a large number of factors which may affect a particular response. In a recent paper, Jones and Nachtsheim [A class of three-level designs for definitive screening in the presence of second-order effects. J. Qual. Technol. 2011;43:1–15] have given a class of three-level designs for screening in the presence of second-order effects using a variant of the coordinate exchange algorithm as it was given by Meyer and Nachtsheim [The coordinate-exchange algorithm for constructing exact optimal experimental designs. Technometrics 1995;37:60–69]. Xiao et al. [Constructing definitive screening designs using conference matrices. J. Qual. Technol. 2012;44:2–8] have used conference matrices to construct definitive screening designs with good properties. In this paper, we propose a method for the construction of efficient three-level screening designs based on weighing matrices and their complete foldover. This method can be considered as a generalization of the method proposed by Xiao et al. [Constructing definitive screening designs using conference matrices. J. Qual. Technol. 2012;44:2–8]. Many new orthogonal three-level screening designs are constructed and their properties are explored. These designs are highly D-efficient and provide uncorrelated estimates of main effects that are unbiased by any second-order effect. Our approach is relatively straightforward and no computer search is needed since our designs are constructed using known weighing matrices.     

A basic lemma and the analysis of block and Kronecker product designs

In this paper the analysis of the class of block designs whose C matrix can be expressed in terms of the Kronecker product of some elementary matrices is considered. The analysis utilizes a basic result concerning the spectral decomposition of the Kronecker product of symmetric matrices in terms of the spectral decomposition of the component matrices involved in the Kronecker product. The property (A) of Kurkjian and Zelen (1963) is generalised and the analysis of generalised property (A) designs is given. It is proved that a design is balanced factorially if and only if it is a generalised property (A) design. A method of analysis of Kronecker product block designs whose component designs are equi-replicate and proper is also suggested.     

Orthogonally Blocked Mixture Experiments in Ellipsoidal Restricted Regions

In practical situations involving mixtures formed from several ingredients, interest is sometimes centered on the response in an ellipsoidal neighborhood around a standard formulation. We show that standard, orthogonally blocked, response surface designs, defined on a q ? 1 dimensional unit sphere, may be transformed into similarly orthogonally blocked q-ingredient mixture designs defined within an ellipsoid centered at the standard formulation. The method is illustrated using several examples of mixture experiments with three, four, and five ingredients, arranged in two, three, or four orthogonal blocks, obtained by projecting standard central composite designs and Box–Behnken designs into the ellipsoidal mixture region. Rotations of the resulting designs within the ellipsoidal regions are also considered.     

Tree Structured QBD Markov Chains and Tree‐Like QBD Processes

Abstract

In this paper, we show that an arbitrary tree structured quasi‐birth–death (QBD) Markov chain can be embedded in a tree‐like QBD process with a special structure. Moreover, we present an algebraic proof that applying the natural fixed point iteration (FPI) to the nonlinear matrix equation V = B + ∑ _s=1 ^d U _s (I ? V)^?1 D _s that solves the tree‐like QBD process, is equivalent to the more complicated iterative algorithm presented by Yeung and Alfa (1996).     

Construction and analysis of edge designs from skew-symmetric supplementary difference sets

The purpose of screening experiments is to identify the dominant variables from a set of many potentially active variables which may affect some characteristic y. Edge designs were recently introduced in the literature and are constructed by using conferences matrices and were proved to be robust. We introduce a new class of edge designs which are constructed from skew-symmetric supplementary difference sets. These designs are particularly useful since they can be applied for experiments with an even number of factors and they may exist for orders where conference matrices do not exist. Using this methodology, examples of new edge designs for 6, 14, 22, 26, 38, 42, 46, 58, and 62 factors are constructed. Of special interest are the new edge designs for studying 22 and 58 factors because edge designs with these parameters have not been constructed in the literature since conference matrices of the corresponding order do not exist. The suggested new edge designs achieve the same model-robustness as the traditional edge designs. We also suggest the use of a mirror edge method as a test for the linearity of the true underlying model. We give the details of the methodology and provide some illustrating examples for this new approach. We also show that the new designs have good D-efficiencies when applied to first order models.     

Efficient Block Designs for Dependent Observations—A Computer-Aided Search

In this article, the exchange and interchange algorithm of Zergaw (1989 Zergaw , G. ( 1989 ). A sequential method of constructing optimal block designs . Austral. J. Statist. 31 : 333 – 342 .[Crossref] , [Google Scholar]) and Martin and Eccleston (1992 Martin , R. J. , Eccleston , J. A. ( 1992 ). Recursive formulae for constructing block designs with dependent errors . Biometrika 79 : 426 – 430 .[Crossref], [Web of Science ®] , [Google Scholar]) have been modified and used for searching efficient block designs for making all possible pairwise treatment comparisons when observations are dependent. The lower bounds to the A- and D-efficiencies of the designs in a given class of the designs have been obtained for correlated observation structure and the procedure of computing lower bounds to A- and D-efficiencies has been incorporated in the algorithm. The algorithm has been translated into a computer program using Microsoft Visual C++. Using this program, a search for efficient designs for making all possible pairwise treatment comparisons has been made for v ≤ 10, b ≤ 33, k ≤ 10 such that bk ≤ 100 and v > k. The block designs considered are usual block designs (rectangular block designs) and circular block designs. Nearest neighbor (NN), autoregressive of order 1 (AR(1)) correlation structures are studied. The ranges of correlation coefficients for different correlation structures investigated are |ρ|≤0.50 for NN correlation structure in rectangular blocks, |ρ|≤0.45 for NN correlation structure in circular blocks, and |ρ|≤0.95 for AR(1) correlation structure. For these ranges, the matrix of correlation coefficients among observations within a block is positive definite. Robustness aspects of designs that are efficient for a given value of correlation have been investigated against other values of correlation coefficients. Robustness aspects of designs that are efficient for independent observations have also been studied for experimental situations with dependent observations.     

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.     

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.     

Designs for approximately linear regression: Maximizing the minimum coverage probability of confidence ellipsoids

The classical D-optimality principle in regression design may be motivated by a desire to maximize the coverage probability of a fixed-volume confidence ellipsoid on the regression parameters. When the fitted model is exactly correct, this amounts to minimizing the determinant of the covariance matrix of the estimators. We consider an analogue of this problem, under the approximately linear model E[y|x] = θ^Tz(x) + f(x). The nonlinear disturbance f(x) is essentially unknown, and the experimenter fits only to the linear part of the response. The resulting bias affects the coverage probability of the confidence ellipsoid on θ. We study the construction of designs which maximize the minimum coverage probability as f varies over a certain class. Explicit designs are given in the case that the fitted response surface is a plane.     

Constructions of Residual Treatment Effects Designs for Comparing Test Treatments with a Control

This article deals with residual treatment effects designs for the purpose of comparing v test treatments with a control treatment when the number of periods is no larger than v + 1. Control balanced residual treatment effects designs, which are Schur-optimal, are considered. Some methods of their construction are given.     

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.     

Distorted Copulas: Constructions and Tail Dependence

Given a copula C, we examine under which conditions on an order isomorphism ψ of [0, 1] the distortion C _ψ: [0, 1]² → [0, 1], C _ψ(x, y) = ψ{C[ψ^?1(x), ψ^?1(y)]} is again a copula. In particular, when the copula C is totally positive of order 2, we give a sufficient condition on ψ that ensures that any distortion of C by means of ψ is again a copula. The presented results allow us to introduce in a more flexible way families of copulas exhibiting different behavior in the tails.