Results 241 to 250 of about 484,766 (271)
Some of the next articles are maybe not open access.
Nearly Balanced Incomplete Block Designs
Biometrika, 1981Abstract : A class of nearly balanced incomplete block designs is defined. This extends the concept of regular graph designs of John and Mitchell (1977) to the unequally replicated case. Some necessary conditions on the existence of such designs are derived. Methods of construction are given for some special cases. For five or six varieties, the 'best'
Cheng, Ching-Shui, Wu, Chien-Fu
openaire +1 more source
Generalized Cyclic Incomplete Block Designs
Biometrika, 1978SuMwY A wide class of incomplete block designs based on cyclic methods of construction is defined when the number of treatments can be factorized. The designs have a concise representation and the reduced normal equations can be constructed and solved by a unified method. Procedures are outlined for producing designs with good statistical properties.
Jarrett, R. G., Hall, W. B.
openaire +1 more source
Balanced Incomplete Block Designs with Block Size 7
Designs, Codes and Cryptography, 1998This paper makes considerable progress in fully determining the spectrum of balanced incomplete block designs (BIBDs) with block size \(k = 7\). This work was begun by \textit{H. Hanani} [Balanced incomplete block designs and related designs, Discrete Math. 11, 255-369 (1975; Zbl 0361.62067)] and continued by \textit{A. E. Brouwer, A.
Abel, R. Julian R., Greig, Malcolm
openaire +1 more source
2017
When a block design is needed for controlling the effects of nuisance factors, but the blocks cannot be made sufficiently large to accommodate all the treatments, incomplete block designs can be used instead. Basic design issues of block size, connectedness, and randomization are discussed in this chapter.
Angela Dean +2 more
openaire +1 more source
When a block design is needed for controlling the effects of nuisance factors, but the blocks cannot be made sufficiently large to accommodate all the treatments, incomplete block designs can be used instead. Basic design issues of block size, connectedness, and randomization are discussed in this chapter.
Angela Dean +2 more
openaire +1 more source
The efficiency of blocking in incomplete block designs
Biometrika, 19601. Summary. Procedures for estimating the relative efficiency of certain designs have been considered by Yates (1935), Cochran & Cox (1957), and Kempthorne (1952, 1955). In this paper the efficiency of blocking in general is considered. A general formula for any incomplete block design of fairly general form is obtained. 2. Introduction.
Folks, John Leroy, Kempthorne, Oscar
openaire +2 more sources
Preconditioning by incomplete block elimination
Numerical Linear Algebra with Applications, 2000Summary: The recursive construction of Schur complements is used to construct a multi-level preconditioner for an iterative linear solver. For each level, the removed unknowns are selected in such a way that the eliminated matrix block is strictly diagonally dominant.
openaire +2 more sources
2014
The designs considered in the previous chapters, namely, randomized complete block and Latin square design assume that each block always contain enough experimental units to allow for each treatment (or treatment combination in case of a factorial design) to be contained at least once in each block or in the case of Latin square design in each row or ...
openaire +1 more source
The designs considered in the previous chapters, namely, randomized complete block and Latin square design assume that each block always contain enough experimental units to allow for each treatment (or treatment combination in case of a factorial design) to be contained at least once in each block or in the case of Latin square design in each row or ...
openaire +1 more source
Balanced Incomplete Block Designs
Journal of the Institute of Actuaries, 1970In my earlier paper I expressed disappointment at failure to find b.i.b.d.s for the case ν= 4p, k = 4, b = ½ν(ν−1), λ = 6 (p is an odd prime). The failure was not complete because I had given a solution for ν = p + 1, k = 4, λ = 6 which covered the cases of ν = 4p where ν−1 was also a prime.
openaire +1 more source