A class of new pbib designs

Two series of PBIB designs, one with three associate classes and theother with four associate classes ars developed. Efficiency factors for two designs are computed.     

Generalizing Clatworthy group divisible designs

In this paper a neat construction is provided for three new families of group divisible designs that generalize some designs from Clatworthy's table of the only 11 designs with two associate classes that have block size four, three groups, and replication numbers at most 10. In each case (namely, _λ1=4${\lambda }_1=4$ and _λ2=5${\lambda }_2=5$, _λ1=4${\lambda }_1=4$ and _λ2=2${\lambda }_2=2$, and _λ1=8${\lambda }_1=8$ and _λ2=4${\lambda }_2=4$), we have proved that the necessary conditions found are also sufficient for the existence of such GDD's with block size four and three groups, with one possible exception.     

Robustness of a Class of Partial Diallel Cross Designs to the Unavailability of a Complete Block of Observations

Complete and partial diallel cross designs are examined as to their construction and robustness against the loss of a block of observations. A simple generalized inverse is found for the information matrix of the line effects, which allows evaluation of expressions for the variances of the line-effect differences with and without the missing block. A-efficiencies, based on average variances of the elementary contrasts of the line-effects, suggest that these designs are fairly robust. The loss of efficiency is generally less than 10%, but it is shown that specific comparisons might suffer a loss of efficiency of as much as 40%.     

Some constructions for PBIBDs

New families of group divisible designs have recently been constructed by Bush, by Kageyama and Tanaka, and by Bhagwandas and Parihar. Their constructions are generalised here.     

Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

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.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

OPTIMUM SINGULAR SPRING BALANCE WEIGHING DESIGNS WITH NON-HOMOGENEITY OF THE VARIANCES OF ERRORS FOR ESTIMATING THE TOTAL WEIGHT

The problem of estimation of the total weight of objects using a singular spring balance weighing design with non-homogeneity of the variances of errors has been dealt with in this paper. Based on a theorem by Katulska (1984) giving a lower bound for the variance of the estimated total weight, a necessary and sufficient condition for this lower bound to be attained is obtained. It is shown that weighing designs for which the the lower bound is attainable, can be constructed from the incidence matrices of (α₁,.,α_t)-resolvable block designs, α-resolvable block designs, singular group divisible designs, and semi-regular group divisible designs.     

Three-stage designs for monitoring clinical trials

Optimal three-stage designs with equal sample sizes at each stage are presented and compared to fixed sample designs, fully sequential designs, designs restricted to use the fixed sample critical value at the final stage, and to modifications of other group sequential designs previously proposed in the literature. Typically, the greatest savings realized with interim analyses are obtained by the first interim look. More than 50% of the savings possible with a fully sequential design can be realized with a simple two-stage design. Three-stage designs can realize as much as 75% of the possible savings. Without much loss in efficiency, the designs can be modified so that the critical value at the final stage equals the usual fixed sample value while maintaining the overall level of significance, alleviating some potential confusion should a final stage be necessary. Some common group sequential designs, modified to allow early acceptance of the null hypothesis, are shown to be nearly optimal in some settings while performing poorly in others. An example is given to illustrate the use of several three-stage plans in the design of clinical trials.     

Nonproper variance balanced designs and optimality

This communication deals with the construction and optimality of non-proper (unequal block sized) variance balanced (VB) designs obtainable under linear homoscedastic normal model. Several methods of construction of non-proper VB designs have been given. Some constructed designs are universally optimal non-proper variance balanced designs.     

A comparison of random balance and two-stage group screening designs: A case study

In this paper we focus on the problem of supersaturated (fewer runs than factors) screening experiments. We consider two major types of designs which have been proposed in this situ¬ation: random balance and two-stage group screening. We discuss the relative merits and demerits of each strategy. In addition, we compare the performance of these strategies by means of a case study in which 100 factors are screened in 20,42,62, and 84 runs.     

On d- and e- minimax optimal designs for estimating the axial slopes of a second-order response surface over hypercubic regions

Design of experiments for estimating the slopes of a response surface is considered. Design criteria analogous to the traditional ones but based upon the variance-covariance matrix of the estimated slopes along factor axes are proposed. Optimal designs under the proposed criteria are derived for second-order polynomial regression over hypercubic regions. Best de¬signs within some commonly used classes of designs are also obtained and their efficiencies are investigated.     

ON CONSTRUCTION OF GENERALIZED GROUP DIVISIBLE DESIGNS WITH TWO GROUPS

ABSTRACT

Many simple and general methods of construction, using α-resolvable balanced incomplete block designs, for generalized group divisible designs with two groups (GGDD(2)) are given. The E-optimality of all constructed designs is also discussed.     

Application of group screening to dynamic building energy simulation models

In order to select the most influential parameters of a building thermal model, a group screening technique was conducted. This technique uses regression analysis and experimental Plackett and Burman designs. After 136 simulations, 23 factors were selected from the initial set of 390. We came to the conclusion that global output variations (obtained with all parameters) can be accurately predicted from these 23 parameters. On the other hand, the results confirmed that group screening can be employed in the case of the building energy models despite the fact that the signs of the parameter effects are unknown. For the analysed configuration, the effects were found to be strongly influenced by the exchanged heat flows. In addition, the influential parameters (with respect to the inner air temperature) were all related to the building components having the largest heat exchange with the air cell.     

The interplay of optimality and combinatorics in experimental design

The design of statistical experiments, as developed by R. A. Fisher and his followers, often used combinatorial structures that yielded simple calculation of estimates and/or symmetric variances and covariances. Examples are block designs with balance, regression experiments with equally spaced observations, etc. More recently, considerations of optimality (choosing a design that achieves most accurate inference in some sense) have sometimes justified the traditional designs, but have sometimes led to new combinatorial investigations. Illustrations are given.     

On Some Two- and Three-dimensional D-minimax Designs for Estimating Slopes of a Third-order Response Surface

Design of experiments is considered for the situation where estimation of the slopes of a response surface is the main interest. Under the D-minimax criterion, the objective is to minimize the generalized variance of the estimated axial slopes at a point maximized over all points in the region of interest in the factor space. For the third-order model over spherical regions, the D-minimax designs are derived in two and three dimensions. The efficiencies of some two- and three-dimensional designs available in the literature are also investigated.     

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.     

Three methods of constructing pbib designs

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

Circular Binary Block Second- and Higher-Order Neighbor Designs

Some new neighbor designs are presented here. Second-order neighbor designs for different configurations are generated in circular binary blocks. Third-order and fourth-order neighbor designs for some cases are also constructed. In all cases, circular blocks are well separated and these designs are obtained through initial block/s. At the end of the study, some models for analysis of these designs are also presented.