A note on the connectivity of generalized cyclic designs

A necessary and sufficient condition is given to ensure that a generating blook of a generalized cyclic design will give rise to a connected design. The use of disconnected designs is briefly discussed.     

Three methods of constructing pbib designs

Three construction methods of two- or three-associate partially balanced incomplete block (PBIB) designs are presented.     

Interaction balance for symmetrical factorial designs with generalized minimum aberration

There are two different systems of contrast parameterization when analyzing the interaction effects among the factors with more than two levels, i.e., linear-quadratic system and orthogonal components system. Based on the former system and an ANOVA model, Xu and Wu (2001) introduced the generalized wordlength pattern for general factorial designs. This paper shows that the generalized wordlength pattern exactly measures the balance pattern of interaction columns of a symmetrical design ground on the orthogonal components system, and thus an alternative angle to look at the generalized minimum aberration criterion is given. This work is partially supported by NNSF of China grant No. 10231030.     

Connectedness of two-associate PBIB designs

Necessary and sufficient conditions for two-associate partially balanced incomplete block designs to be connected are sysmematically discussed in terms of parameters of the original designs, together with the result of Mohan (1981).     

Theory of optimal blocking of nonregular factorial designs

The authors introduce the notion of split generalized wordlength pattern (GWP), i.e., treatment GWP and block GWP, for a blocked nonregular factorial design. They generalize the minimum aberration criterion to suit this type of design. Connections between factorial design theory and coding theory allow them to obtain combinatorial identities that govern the relationship between the split GWP of a blocked factorial design and that of its blocked consulting design. These identities work for regular and nonregular designs. Furthermore, the authors establish general rules for identifying generalized minimum aberration (GMA) blocked designs through their blocked consulting designs. Finally they tabulate and compare some GMA blocked designs from Hall's orthogonal array OA(16,2¹5,2) of type III.     

On a paper by kageyama and mohan

Kageyama Mohan (1984) have presented three methods of constructing new incomplete block designs from balanced incomplete block designs, They raise questions about the designs which come from each of their methods, These questions are answered, Another series of group divisible designs is derived as a special case of their second method.     

Construction of incomplete Sudoku square and partially balanced incomplete block designs

Abstract

The present article deals with the study of association among the elements of a Sudoku square. In this direction, we have defined an association scheme and constructed incomplete Sudoku square designs which are capable of studying four explanatory variables and also happen to be the designs for two-way elimination of heterogeneity. Some series of Partially Balanced Incomplete Block (PBIB) designs have also been obtained.     

Experimentation order with good properties for 2 k factorial designs

Randomizing the order of experimentation in a factorial design does not always achieve the desired effect of neutralizing the influence of unknown factors. In fact, with some very reasonable assumptions, an important proportion of random orders achieve the same degree of protection as that obtained by experimenting in the design matrix standard order. In addition, randomization can induce a large number of changes in factor levels and thus make experimentation expensive and difficult. De Leon et al. [Experimentation order in factorial designs with 8 or 16 runs, J. Appl. Stat. 32 (2005), pp. 297–313] proposed experimentation orders for designs with eight or 16 runs that combine an excellent level of protection against the influence of unknown factors, with the minimum number of changes in factor levels. This article presents a new methodology to obtain experimentation orders with the desired properties for designs with any number of runs.     

Experimentation order in factorial designs with 8 or 16 runs

Randomizing the order of experimentation in a factorial design does not always achieve the desired effect of neutralizing the influence of unknown factors. In fact, with some very reasonable assumptions, an important proportion of random orders afford the same degree of protection as that obtained by experimenting in the design matrix standard order. In addition, randomization can induce a big number of changes in factor levels and thus make experimentation expensive and difficult. This paper discusses this subject and suggests experimentation orders for designs with 8 or 16 runs that combine an excellent level of protection against the influence of unknown factors, with the minimum number of changes in factor levels.     

A new special class of peb designs

A new class of partially efficiency-balanced designs is introduced from a practical point of view. This new design includes all equireplicated incomplete block designs available in literature as special cases. The fundamental properties of the design are clarified with relation to other block designs.     

Experimentation order in factorial designs: new findings

Under some very reasonable hypotheses, it becomes evident that randomizing the run order of a factorial experiment does not always neutralize the effect of undesirable factors. Yet, these factors do have an influence on the response, depending on the order in which the experiments are conducted. On the other hand, changing the factor levels is many times costly; therefore it is not reasonable to leave to chance the number of changes necessary. For this reason, run orders that offer the minimum number of factor level changes and at the same time minimize the possible influence of undesirable factors on the experimentation have been sought. Sequences which are known to produce the desired properties in designs with 8 and 16 experiments can be found in the literature. In this paper, we provide the best possible sequences for designs with 32 experiments, as well as sequences that offer excellent properties for designs with 64 and 128 experiments. The method used to find them is based on a mixture of algorithmic searches and an augmentation of smaller designs.     

Super-simple cyclic designs with small values

Super-simple cyclic designs are useful on constructing codes and designs such as superimposed codes, perfect hash families and optical orthogonal codes with index two. In this paper, we show that there exists a super-simple cyclic (v,4,λ)$(v,4,\lambda )$ for 7?v?41$7?v?41$ and all admissible λ$\lambda$ with two definite exceptions of (v,λ)=(9,3),(13,5)$(v,\lambda )=(9,3),(13,5)$ and one possible exception of (v,λ)=(39,18)$(v,\lambda )=(39,18)$. Some useful algorithms are explained for computer search and new designs are displayed.     

Optimal balanced block designs for correlated observations

The construction of universally optimal designs, if such exist, is difficult to obtain, especially when there are some nuisance effects or correlated errors. The hub correlation is a special correlation structure with applications to experiments in genetics, networks and other areas in industry and agriculture. There may be restrictions on the correlation values of the hub structure depending on the experiment. Optimality of block designs under hub correlation has been studied for the case of a constant correlation value. In this article, we consider the hub structure when one of the correlation values is different from the others, and the universally optimal block designs, binary or non-binary, are theoretically obtained. Also, we introduce an algorithm to construct the optimal designs. The Canadian Journal of Statistics 48: 596–604; 2020 © 2020 Statistical Society of Canada     

Minimum variance rectangular designs for U-statistics

We consider a certain class of rectangular designs for incomplete U-statistics based on Latin squares and show it to be optimal with respect to the minimal variance criterion. We also show it to be asymptotically efficient when compared with the corresponding complete statistics, as well as uniformly more efficient than the random subset selection. We provide the necessary and sufficient conditions for the existence of our design and give some examples of applications.     

Empirical likelihood for generalized linear models with fixed and adaptive designs

Empirical likelihood inference for generalized linear models with fixed and adaptive designs is considered. It is shown that the empirical log-likelihood ratio at the true parameters converges to the standard chi-square distribution. Furthermore, we obtain the maximum empirical likelihood estimate of the unknown parameter and the resulting estimator is shown to be asymptotically normal. Some simulations are conducted to illustrate the proposed method.     

Asymptotic properties of maximum quasi-likelihood estimators in generalized linear models with adaptive designs

In this paper, we present the asymptotic properties of maximum quasi-likelihood estimators (MQLEs) in generalized linear models with adaptive designs under some mild regular conditions. The existence of MQLEs in quasi-likelihood equation is discussed. The rate of convergence and asymptotic normality of MQLEs are also established. The results are illustrated by Monte-Carlo simulations.     

REDUCED RESIDUE CLASSES CYCLIC PBIB DESIGNS

A new general class of m-class cyclic association scheme is defined for v treatments, where v is a composite number. A simple method of construction of PBIB designs having this association scheme using more than one initial block and some methods using only one initial block are proposed. A complete analysis of this type of PBIB designs is given. Also given is a list of 39 useful PBIB designs of this type having v≤15 and r≤10 and having only three associate classes together with their efficiency factors for all types of comparisons and over all efficiency factors.     

Robust quasi-likelihood inference in generalized linear mixed models with outliers

It is well known that in a traditional outlier-free situation, the generalized quasi-likelihood (GQL) approach [B.C. Sutradhar, On exact quasilikelihood inference in generalized linear mixed models, Sankhya: Indian J. Statist. 66 (2004), pp. 261–289] performs very well to obtain the consistent as well as the efficient estimates for the parameters involved in the generalized linear mixed models (GLMMs). In this paper, we first examine the effect of the presence of one or more outliers on the GQL estimation for the parameters in such GLMMs, especially in two important models such as count and binary mixed models. The outliers appear to cause serious biases and hence inconsistency in the estimation. As a remedy, we then propose a robust GQL (RGQL) approach in order to obtain the consistent estimates for the parameters in the GLMMs in the presence of one or more outliers. An extensive simulation study is conducted to examine the consistency performance of the proposed RGQL approach.     

Characterization of singular balanced fractional sm factorial designs derivable from balanced arrays with maximum number of constraints

An upper bound on the maximum number of constraints for s-symbol balanced arrays is derived. It is shown that balanced fractional s^m factorial designs derived from some balanced arrays with the maximum possible number of constraints become singular.