The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2

In this paper necessary and sufficient conditions for a vector to be the fine structure of a balanced ternary design with block size 3, index 3 and rho(2) = 1 and 2 are determined with one unresolved case.

On the construction of nearest neighbour balanced row-column designs

Nearest–neighbour balance is considered a desirable property for an experiment to possess in situations where experimental units are influenced by their neighbours. This paper introduces a measure of the degree of nearest–neighbour balance of a design. The measure is used in an algorithm which generates nearest–neighbour balanced designs and is readily modified to obtain designs with various types of nearest–neighbour balance. Nearest–neighbour balanced designs are produced for a wide class of parameter settings, and in particular for those settings for which such designs cannot be found by existing direct combinatorial methods. In addition, designs with unequal row and column sizes, and designs with border plots are constructed using the approach presented here.

Proportionally balanced designs: Some further results and general constructions

Proportionally balanced designs were introduced by Gray and Matters in response to a need for the allocation of markers of the Queensland Core Skills Test to have a certain property. Put simply, markers were allocated to pairs of units in proportions that reflected the relative numbers of markers allocated in total to each unit. In this paper, the first author extends the theoretical results relating to such designs and provides further instances, and two general constructions, in the case that the design comprises blocks of precisely two sizes.

Variance-balanced designs under interference for dependent observations

It is shown that variance-balanced designs can be obtained from Type I orthogonal arrays for many general models with two kinds of treatment effects, including ones for interference, with general dependence structures. These designs can be used to obtain optimal and efficient designs. Some examples and design comparisons are given. (C) 2002 Elsevier B.V. All rights reserved.

Existence of complementary pairs of proportionally balanced designs

Proportionally balanced designs (pi BDs) were introduced by Gray and Matters in response to a need for the allocation of markers of the Queensland Core Skills Test to have a certain property. Subsequent papers extended the theoretical results relating to such designs and provided further instances and general constructions. This work focused on designs comprising blocks of precisely two sizes, and when each variety occurs with one of precisely two possible frequencies. Two designs based on the set V of varieties are complementary if, whenever B is a block of one, then its complement with regard to the set V is a block of the other. Here we present necessary conditions for the existence of complementary pairs of such pi BDs and provide lists of some restricted parameter sets satisfying these necessary conditions. The lists are arranged according to the number of blocks. We demonstrate that not all of these parameter sets give rise to designs. However we establish by construction of the sets of blocks that, for every feasible number of blocks less than or equal to 100, with the possible exception of 63, there exists at least one pair of complementary pi BDs. We also investigate the conditions under which the complementary design can be isomorphic to the original design, and again provide a list of feasible parameters for pairs of such designs with at most 400 blocks.

Two-dimensional balanced sampling plans excluding contiguous units

A balanced sampling plan excluding contiguous units (or BSEC for short) was first introduced by Hedayat, Rao and Stufken in 1988. These designs can be used for survey sampling when the units are arranged in one-dimensional ordering and the contiguous units in this ordering provide similar information. In this paper, we generalize the concept of a BSEC to the two-dimensional situation and give constructions of two-dimensional BSECs with block size 3. The existence problem is completely solved in the case where lambda = 1.

Levene tests of homogeneity of variance for general block and treatment designs

This article develops a weighted least squares version of Levene's test of homogeneity of variance for a general design, available both for univariate and multivariate situations. When the design is balanced, the univariate and two common multivariate test statistics turn out to be proportional to the corresponding ordinary least squares test statistics obtained from an analysis of variance of the absolute values of the standardized mean-based residuals from the original analysis of the data. The constant of proportionality is simply a design-dependent multiplier (which does not necessarily tend to unity). Explicit results are presented for randomized block and Latin square designs and are illustrated for factorial treatment designs and split-plot experiments. The distribution of the univariate test statistic is close to a standard F-distribution, although it can be slightly underdispersed. For a complex design, the test assesses homogeneity of variance across blocks, treatments, or treatment factors and offers an objective interpretation of residual plot.

Optimal crossover designs for logistic regression models in pharmacodynamics

Pharmacodynamics (PD) is the study of the biochemical and physiological effects of drugs. The construction of optimal designs for dose-ranging trials with multiple periods is considered in this paper, where the outcome of the trial (the effect of the drug) is considered to be a binary response: the success or failure of a drug to bring about a particular change in the subject after a given amount of time. The carryover effect of each dose from one period to the next is assumed to be proportional to the direct effect. It is shown for a logistic regression model that the efficiency of optimal parallel (single-period) or crossover (two-period) design is substantially greater than a balanced design. The optimal designs are also shown to be robust to misspecification of the value of the parameters. Finally, the parallel and crossover designs are combined to provide the experimenter with greater flexibility.

The intersection problem for star designs

We determine those triples (m, II, k) of integers for which there are two m-star designs on the same n-set having exactly k stars in common.

Designs for an asymmetric gradient set and a compact superconducting magnet for neural magnetic resonance imaging

Imaging of the head and neck is the most commonly performed clinical magnetic resonance imaging (MRI) examination [R. G. Evans and J. R. G. Evans, AJR 157, 603 (1991)]. This is usually undertaken in a generalist MRI instrument containing superconducting magnet system capable of imaging all organs. These generalist instruments are large, typically having a bore of 0.9-1.0 m and a length of 1.7-2.5 m and therefore are expensive to site, somewhat claustrophobic to the patient, and offer little access by attending physicians. In this article, we present the design of a compact, superconducting MRI magnet for head and neck imaging that is less than 0.8 m in length and discuss in detail the design of an asymmetric gradient coil set, tailored to the magnet profile. In particular, the introduction of a radio-frequency FM modulation scheme in concert with a gradient sequence allows the epoch of the linear region of the gradient set to be much closer to the end of the gradient structure than was previously possible. Images from a prototype gradient set demonstrate the effectiveness of the designs. (C) 1999 American Institute of Physics. [S0034-6748(99)04910-2].

On the spectrum for K_{m+2}/K_m designs

The spectrum problem for the decomposition of K-n into copies of the graph K_{m+2}\K_m is solved for n = 0 or 1 (mod 2m + 1). (C) 1997 John Wiley & Sons, Inc.

The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Constructing a class of designs with proportional balance

Text serves as a sequel to 'Computational and Constructive Design Theory,' c1996; containing research papers and surveys of recent research work on design construction and computer-aided study of designs. For researchers in theory of computational designs.

Coupling 3D visualisation to qualitative assessment of built environment designs

Geographical information systems (GIS) coupled to 3D visualisation technology is an emerging tool for urban planning and landscape design applications. The utility of 3D GIS for realistically visualising the built environment and proposed development scenarios is much advocated in the literature. Planners assess the merits of proposed changes using visual impact assessment (VIA). We have used Arcview GIS and visualisation software: called PolyTRIM from the University of Toronto, Centre for Landscape Research (CLR) to create a 3D scene for the entrance to a University campus. The paper investigates the thesis that to facilitate VIA in planning and design requires not only visualisation, but also a structured evaluation technique (Delphi) to arbitrate the decision-making process. (C) 2001 Elsevier Science B.V. All rights reserved.