Results 141 to 150 of about 67,727 (157)

D-optimality of the dual of BIB designs

Statistics & Probability Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Construction of Balanced Ternary Designs with Nested Rows and Columns Using BIB Designs

Calcutta Statistical Association Bulletin, 1998
Balanced ternary designs with nested rows and columns have been constructed using balanced incomplete block designs.
Tyagi, B. N., Rizwi, S. K.
openaire   +1 more source

Bib Designs with Blocks of Maximal Multiplicity.

1982
Abstract : The set of distinct blocks of a block design is known as its support. We construct a BIB design with parameters V or = 7, k = 3, lambda = v - 2 which contains a block of maximal multiplicity and has support (V/3) - 4(v-3). Any BIB design which contains such a block and has parameters as above must be supported on at most (V/3) - 4(v-3 ...
A. S. Hedaya, G. M. Constantine
openaire   +1 more source

Estimation and hypothesis testing in BIB design and robustness

Computational Statistics & Data Analysis, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tiku, Moti L., Şenoğlu, Birdal
openaire   +1 more source

Robustness of BIB and extended BIB designs against the unavailability of any number of observations in a block

Computational Statistics & Data Analysis, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Ashish, Kageyama, Sanpei
openaire   +2 more sources

Combinatorics of Incidence Structures and Bib-Designs

1983
We give an exposition of basic properties of incidence structures and designs (BIB-designs). Some properties relating internal and external structures, duality, and complementary structures are stated. We add some basic constructions for BIB-designs.
openaire   +1 more source

A recursive method of construction of resolvable BIB-designs

Mathematical Notes of the Academy of Sciences of the USSR, 1977
A theorem is proved that every resolvable BIB-design (v,k,λ) with λ=k−1 and the parameters v and k such that there exists a set of k−1 pairwise orthogonal Latin squares of order v can be embedded in a resolvable BIB-design ((k+1)v, k, k−1). An analogous theorem is established for the class of arbitrary BIB-designs.
openaire   +2 more sources

On the existence of BIB designs with large λ

Journal of Statistical Planning and Inference, 2001
Abstract In this article we prove the following theorem: Suppose that v and k are given, v⩾k+2 and λ 0 (v,k)=( v−2 k−2 ) 2 ·4 v−k−1 . If λ(v−1)≡0 ( mod k−1) , λv(v−1)≡0 ( mod k(k−1)) and λ>λ0(v,k), then there is a B(v,k,λ).
openaire   +1 more source

Some characterization of locally resistant BIB designs of degree one

Annals of the Institute of Statistical Mathematics, 1987
This paper investigates locally resistant balanced incomplete block (LRBIB) designs of degree one. A new necessary condition for the existence of such an LRBIB design is presented. This condition yields a complete characterization of affine α-resolvable LRBIB designs of degree one.
openaire   +1 more source

On the Construction of BIB Designs with Variable Support Sizes.

1980
Abstract : A balanced incomplete block (BIB) design with b blocks is said to have support size b* when exactly b* of the b blocks are distinct. The importance and the applications of BIB designs with b* b in design of experiments and controlled sampling were explained in detail in Foody and Hedayat (1977) and Wynn (1977).
H. L. Hwang, A. Hedayat
openaire   +1 more source