[图书][B] Design Theory: Volume 1
T Beth, D Jungnickel, H Lenz - 1999 - books.google.com
This is the first volume of a two-volume text on design theory. Since the first edition, there
has been extensive development of the theory. In particular, the growing importance of …
has been extensive development of the theory. In particular, the growing importance of …
[图书][B] Classification algorithms for codes and designs
P Kaski, PRJ Östergård - 2006 - Springer
Classification Algorithms for Codes and Designs Page 1 Algorithms and Computation in
Mathematics Volume 15 Classification Algorithms for Codes and Designs Classification …
Mathematics Volume 15 Classification Algorithms for Codes and Designs Classification …
2-(v, k, λ) designs of small order
1.1 A balanced incomplete block design (BIBD) is a pair (V, B) where V is a v-set and B is a
collection of bk-subsets of V (blocks) such that each element of V is contained in exactly r …
collection of bk-subsets of V (blocks) such that each element of V is contained in exactly r …
[图书][B] Optimal experimental design with R
D Rasch, J Pilz, LR Verdooren, A Gebhardt - 2011 - books.google.com
Optimal Experimental Design with R introduces experimenters to the philosophy of
experimentation, and the need for good design and data collection for experiments. It gives …
experimentation, and the need for good design and data collection for experiments. It gives …
Architectures and algorithms for on-line failure recovery in redundant disk arrays
M Holland, GA Gibson, DP Siewiorek - Distributed and Parallel Databases, 1994 - Springer
The performance of traditional RAID Level 5 arrays is, for many applications, unacceptably
poor while one of its constituent disks is non-functional. This paper describes and evaluates …
poor while one of its constituent disks is non-functional. This paper describes and evaluates …
25 Nested designs
JP Morgan - Handbook of statistics, 1996 - Elsevier
Publisher Summary This chapter will explore the practical motivation for, optimality
requirements of, and combinatorial assignment properties in, experimental situations with …
requirements of, and combinatorial assignment properties in, experimental situations with …
Exploiting symmetries within constraint satisfaction search
P Meseguer, C Torras - Artificial intelligence, 2001 - Elsevier
Symmetry often appears in real-world constraint satisfaction problems, but strategies for
exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry …
exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry …
Strongly regular semi-Cayley graphs
MJ De Resmini, D Jungnickel - Journal of Algebraic Combinatorics, 1992 - Springer
We consider strongly regular graphs Γ=(V, E) on an even number, say 2 n, of vertices which
admit an automorphism group G of order n which has two orbits on V. Such graphs will be …
admit an automorphism group G of order n which has two orbits on V. Such graphs will be …
[图书][B] On-line data reconstruction in redundant disk arrays
MC Holland - 1994 - search.proquest.com
There exists a wide variety of applications in which data availability must be continuous, that
is, where the system is never taken off-line and any interruption in the accessibility of stored …
is, where the system is never taken off-line and any interruption in the accessibility of stored …
Designs from projective planes and PBD bases
M Greig - Journal of Combinatorial Designs, 1999 - Wiley Online Library
The essential theme of this article is the exploitation of known configurations in projective
planes in order to construct pairwise balanced designs. Among the results shown are (q2+ …
planes in order to construct pairwise balanced designs. Among the results shown are (q2+ …