Cyclic designs for a covariate model

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. We restrict our attention to classes of designs d for which the number of observations N to be taken is a multiple of V, i.e. N = V × R with R ≥2, and each treatment level is observed R times. Among these designs, called here equireplicated, there is a subclass characterized by the following: the allocation matrix of each treatment level (for short, allocation matrix) is obtained through cyclic permutation of the columns of the allocation matrix of the first treatment level. We call these designs cyclic. Besides having easy representation, the most efficient cyclic designs are often D-optimal in the class of equireplicated designs. A known upper bound for the determinant of the information matrix M(d) of a design, in the class of equireplicated ones, depends on the congruences of N and V modulo 4. For some combinations of parameter moduli, we give here methods of constructing families of D-optimal cyclic designs. Moreover, for some sets of parameters (N, V,K = V), where the upper bound on ∣M(d)∣ (for that specific combination of moduli) is not attainable, it is also possible to construct highly D-efficient cyclic designs. Finally, for N≤24 and V≤6, computer search was used to determine the most efficient design in the class of cyclic ones. They are presented, together with their respective efficiency in the class of equireplicated designs.     

浅析我国的绿色城市设计

分析了绿色城市设计作为未来城市设计发展主要方向的必然性及其特征,并结合北京为响应"绿色奥运"的口号所做的绿色城市设计实例,探讨了绿色城市设计的要求与实施途径。     

Random Pooling Designs Under Various Structures

Balding et al. (1995) showed that randomizing over the k-set space yields much better pooling designs than the random pooling design without the k-restriction. A natural question arises as to whether a smaller subspace, i.e., a space with more structure, will yield even better results. We take the random subset containment design recently proposed by Macula, which randomizes over a subspace of the k-set space, as our guinea pig to compare with the k-set space. Unfortunately the performance of the subset containment design is hard to analyze and only approximations are given. For a set of parameters, we are able to produce either an exact analysis or very good approximations. The comparisons under these parameters seem to favor the k-set space.     

On the non-existence of generalised Hadamard matrices

The determinant of a generalized Hadamard matrix over its group ring factored out by the relation Σ_gεG G = 0 is shown to have certain number theoretic properties. These are exploited to prove the non-existence of many generalised Hadamard matrices for groups whose orders are divisible by 3, 5 or 7. For example the GH(15, C₁₅), GH(15, C₃) and GH(15, C₅) do not exist. Also for certain n and G we find the set of determinants of the GH(n, G) matrices.     

Balanced e-optimal designs of resolution III for the 2×3 series

We consider the problem of constructing designs which are E-optimal in the class of all balanced resolution III designs for the 2^m×3ⁿ series. The inverse of the information matrix for general resolution III balanced 2^m×3ⁿ designs is obtained. Optimal designs are constructed for the cases (m,n)=(3, 1), (4, 1), (2, 2) and (3, 2) for various numbers of runs in the practical range.     

Construction of Cross-Over Designs for Comparing Test Treatments with Control Using Terraces

Segregated half-and-half and mutually orthogonal power sequence terraces have been used in this article for the construction of some new families of control balanced cross-over designs, which are Schur-optimal. One of the advantages of using terraces is that designs with larger number of treatments can also be constructed with relative ease. Designs up to 17 treatments have been constructed in this article.     

Minimal Markov Basis for Tests of Main Effect Models for 2p-1 Fractional Factorial Designs of Resolution p

We consider conditional exact tests of factor effects in design of experiments for discrete response variables. Similarly to the analysis of contingency tables, Markov chain Monte Carlo methods can be used to perform exact tests, especially when large-sample approximations of the null distributions are poor and the enumeration of the conditional sample space is infeasible. In order to construct a connected Markov chain over the appropriate sample space, one approach is to compute a Markov basis. Theoretically, a Markov basis can be characterized as a generator of a well-specified toric ideal in a polynomial ring and is computed by computational algebraic software. However, the computation of a Markov basis sometimes becomes infeasible, even for problems of moderate sizes. In the present article, we obtain the closed-form expression of minimal Markov bases for the main effect models of 2^{p ? 1} fractional factorial designs of resolution p.     

Split-plot designs with mirror image pairs as sub-plots

In this article we investigate two-level split-plot designs where the sub-plots consist of only two mirror image trials. Assuming third and higher order interactions negligible, we show that these designs divide the estimated effects into two orthogonal sub-spaces, separating sub-plot main effects and sub-plot by whole-plot interactions from the rest. Further we show how to construct split-plot designs of projectivity P≥3. We also introduce a new class of split-plot designs with mirror image pairs constructed from non-geometric Plackett-Burman designs. The design properties of such designs are very appealing with effects of major interest free from full aliasing assuming that 3rd and higher order interactions are negligible.     

Block response-adaptive randomization in clinical trials with binary endpoints

In a clinical trial, response-adaptive randomization (RAR) uses accumulating data to weigh the randomization of remaining patients in favour of the better performing treatment. The aim is to reduce the number of failures within the trial. However, many well-known RAR designs, in particular, the randomized play-the-winner-rule (RPWR), have a highly myopic structure which has sometimes led to unfortunate randomization sequences when used in practice. This paper introduces random permuted blocks into two RAR designs, the RPWR and sequential maximum likelihood estimation, for trials with a binary endpoint. Allocation ratios within each block are restricted to be one of 1:1, 2:1 or 3:1, preventing unfortunate randomization sequences. Exact calculations are performed to determine error rates and expected number of failures across a range of trial scenarios. The results presented show that when compared with equal allocation, block RAR designs give similar reductions in the expected number of failures to their unmodified counterparts. The reductions are typically modest under the alternative hypothesis but become more impressive if the treatment effect exceeds the clinically relevant difference.