213 Hits in 3.5 sec

New 3-level response surface designs constructed from incomplete block designs

Nam-Ky Nguyen, John J. Borkowski
2008 Journal of Statistical Planning and Inference  
Of the 17 aforementioned BB designs, 10 were constructed from balanced incomplete block designs (BIBDs) and seven were constructed from partially BIBDs (PBIBDs).  ...  In addition, we also report new orthogonally blocked solutions for 5, 8, 9, 11 and 13 factors. Note that an 11-factor BB design is available but cannot be orthogonally blocked.  ...  Of the 17 BB designs, 10 were constructed from balanced incomplete block designs (BIBDs) and seven were constructed from partially BIBDs (PBIBDs).  ... 
doi:10.1016/j.jspi.2007.05.002 fatcat:2ejiyctjujeazknzbxrvvjyvqe

A Fast Approach to Scale Up Disk Arrays with Parity Declustered Data Layout by Minimizing Data Migration

Zhipeng Li, Yinlong Xu, Yongkun Li, Chengjin Tian, John C. S. Lui
2019 IEEE Access  
We implement PDS in Linux kernel 3.14.72 and evaluate its performance with real-world traces.  ...  Furthermore, PDS can also be applied to scale RAIDs for improving reliability and/or storage efficiency as options by allocating more parity blocks and/or data blocks in stripes.  ...  As shown in Fig. 4 , the data layout of an array with four disks is defined by a primary Fig. 2a . We aim to scale up this RAID from four disks to seven.  ... 
doi:10.1109/access.2019.2896263 fatcat:7dakm3ndpvgihcg2d3vfcpqo2u

On λ-covers of pairs by quintuples: ν odd

W.H Mills, R.C Mullin
1994 Journal of combinatorial theory. Series A  
An e-resolvable balanced incomplete block design (e-RBIBD(v, k, 2)) is a BIBD(v, k, 2) together with a partition of the blocks into classes, called e-resolvable classes, which has the property that each  ...  There exists a BIBD(v, 5, 2)for all integers v>. 5 which satisfy and 2(v -1 ) --0 (rood 4) 2v(v -1 ) = 0 (rood 20) with the exception of v = 15 and 2 = 2.  ...  LEMMA 3. 3 . 3 There is a set of seventeen blocks of size 5 on seven points which has the property that two disjoint pairs each occur in precisely seven blocks while all other pairs occur in at least eight  ... 
doi:10.1016/0097-3165(94)90015-9 fatcat:qkr7z2kpmzc77oa7msh3r4a7lu

Page 1855 of Mathematical Reviews Vol. , Issue 94d [page]

1994 Mathematical Reviews  
Of the four remaining designs, three are shown to have smallest defining sets of seven blocks and one of eight blocks.  ...  only seven blocks.  ... 

Construction of balanced doubles schedules

Paul Healey
1980 Journal of combinatorial theory. Series A  
Combined with special constructions for v = 54 and 55 and previously known constructions, this gives schedules for all v.  ...  The following are BD schedules for four, five, six, and seven players.  ...  When the blocks of a pairwise balanced design are all one size, B[k, A; v] is a balanced incomplete block design (BIBD).  ... 
doi:10.1016/0097-3165(80)90022-9 fatcat:5u73cwpcofeyjdqbkj2twassda

A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs

G.H.J.van Rees
1989 Discrete Mathematics  
The counterexample was non-embeddable as two blocks intersected in four varieties. Brown [3] produced such a design which was non-embeddable but had no block intersection of size 4.  ...  It is quite easy to check if the new design has 2n2 + 3n + 2 elements and (n" + n + l)(n + 1) + ((n + 1)/2) = (n + 1)(2n2 + 3n + 2)/2 blocks of size 2n + 2.  ... 
doi:10.1016/0012-365x(89)90373-7 fatcat:sjla6oqvqvgejh355moblbluwi

NewE(S2)-Optimal Supersaturated Designs Constructed From Incomplete Block Designs

Nam-Ky Nguyen, Ching-Shui Cheng
2008 Technometrics  
A computer search is conducted to find SSDs with 5 ≤ n ≤ 50 and n ≤ m ≤ 2n that can be constructed from regular graph designs, where m is the number of factors and n is the run size.  ...  We present a method for constructing two-level supersaturated designs (SSDs) from incomplete block designs. A lower bound of E(s 2 ) that also covers the case of odd run sizes is given.  ...  of New England.  ... 
doi:10.1198/004017007000000452 fatcat:b2v6lsxepzg33goxp3ubdxk5eu

Resistance of Balanced Incomplete Block Designs

Bernard M. Most
1975 Annals of Statistics  
This leads to a lower bound (of 2A(vn)) on the number of blocks required for fully locally resistant BIBDs which are not essentially trivial. Examples of resistant designs are given.  ...  The main result is a structure theorem which states that a BIBD in v treatments and k plots per block is resistant to the removal of any subset of a specific set of n treatments, n < k < v, if and only  ...  Yet, if we form a new design, P, by uniting five copies of this one, the resultant design has parameters (7, 35, 15, 3, 5) exactly those of a trivial design for seven treatments in blocks of size three  ... 
doi:10.1214/aos/1176343246 fatcat:q4owbiughngvzmfagvm6v3776e

Balanced incomplete block designs: selected business-related applications and usage caveats

David R. Rink
2017 Innovative Marketing  
Whenever respondents must rank-order a large number of items and/or the reliability of their rankings may be questionable, balanced incomplete block designs (BIBDs) represent a more effective means for  ...  BIBDs.  ...  The CEO felt top management could rank six locations more accurately than seven. As there were 11 executives, the CEO was constrained to a BIBD with 11 blocks.  ... 
doi:10.21511/im.12(1).2016.02 fatcat:ctur5y4vjfggzgetsnrfq6wchy

Block Design-Based Asynchronous Neighbor Discovery Protocol for Wireless Sensor Networks

Sangil Choi, Wooksik Lee, Teukseob Song, Jong-Hoon Youn
2015 Journal of Sensors  
A key aspect of the proposed protocol is that it combines two block designs in order to construct a new block for neighbor discovery.  ...  This paper proposes a new Block design-based Asynchronous Neighbor Discovery protocol for sensor networks calledBAND. We borrow the concept of combinatorial block designs for neighbor discovery.  ...  We can generate a new NDS by combining any two block designs. If there exists a BIBD with a desired duty cycle, we can just use the BIBD for the neighbor discovery.  ... 
doi:10.1155/2015/951652 fatcat:mlub4iv57jarto7dc3zxjq5hom

Group divisible designs with three unequal groups and larger first index

Spencer P. Hurd, Dinesh G. Sarvate
2011 Discrete Mathematics  
We show the necessary conditions are sufficient for the existence of group divisible designs (or PBIBDs) with block size k = 3 with three groups of size (n, 2, 1) for any n ≥ 2 and any two indices with  ...  Use 6t + 4 classes with each of the four points of B and use one with z. Use the blocks {a, b, j} × 2 for j in A.  ...  Use the blocks of a GDD(4, 2, 1; 8, 2) from the earlier example with groups B, {a, b}, and {z}. Use the blocks of a BIBD(B, 3, 6t). Use a resolvable BIBD(A, 3, 12t + 8).  ... 
doi:10.1016/j.disc.2011.04.026 fatcat:o6hsx2j65bbp7oj3xzyyp4i2zq

Page 1294 of Mathematical Reviews Vol. , Issue 84d [page]

1984 Mathematical Reviews  
This article first presents four species of 134 Youden “square”. By using them, the author constructs two new 0:07:T00 designs of size 13 <4 in playing-card notation.  ...  In a balanced incomplete block design (BIBD), if the b blocks can be separated into ¢ sets of m blocks each such that each set contains every treatment exactly p times, the design is said to be p-resolvable  ... 

Isolation, Identification, and Characterization of Novel Arenaviruses, the Etiological Agents of Boid Inclusion Body Disease

U. Hetzel, T. Sironen, P. Laurinmaki, L. Liljeroos, A. Patjas, H. Henttonen, A. Vaheri, A. Artelt, A. Kipar, S. J. Butcher, O. Vapalahti, J. Hepojoki
2013 Journal of Virology  
in a large cohort of snakes with BIBD, confirming the causative role of arenaviruses.  ...  Sequencing confirmed that UHV is a novel arenavirus species that is distinct from other known arenaviruses including those recently identified in snakes with BIBD.  ...  Morales, Departmento de Patologia, Escuela de Medicina Veterinaria, University of Heredia, Costa Rica, for the provision of BIBD cases, M.  ... 
doi:10.1128/jvi.01123-13 pmid:23926354 pmcid:PMC3807292 fatcat:tp2xcundojbf5a6l5g6du2oy2m

Combinatorial designs

Douglas R. Stinson
2008 ACM SIGACT News  
Replace each block A of size seven by the seven blocks of a (7, 3, 1)-BIBD on point set A. The result is a (21, 3, 1)-BIBD.  ...  Then apply Theorem 7.39 with w = 3, using as ingredients group-divisible designs with four groups of size three and blocks of size four (these arise from (13, 4, 1)-BIBDs using Theorem 7.30).  ...  Note also that existence of a difference set implies the existence of the corresponding symmetric BIBD, and nonexistence of a symmetric BIBD implies nonexistence of a difference set with the same parameters  ... 
doi:10.1145/1466390.1466393 fatcat:ofdobskyynaqzl4jual5uswjp4

An Algorithmic Approach to Constructing Supersaturated Designs

Nam-Ky Nguyen
1996 Technometrics  
Consider an example in which a car manufacturer is conducting a passenger-impact crash test on a planned new four-wheel-drive (4WD) range.  ...  Many saturated designs (designs with the number of factors m equal to n -1, where n is the number of runs) have proved useful for this purpose.  ...  associated with new design.  ... 
doi:10.2307/1268904 fatcat:mibymtsqozcehbqibqwydzyb2u
« Previous Showing results 1 — 15 out of 213 results