The Specification of Robust Binary Block Designs Against the Loss of Whole Blocks
Duration: 26 mins 52 secs
About this item
Godolphin, J (Surrey)
Friday 02 September 2011, 09:30-10:00
|Collection:||Design and Analysis of Experiments|
|Publisher:||Isaac Newton Institute|
|Abstract:||A new criterion is suggested for measuring the robustness of a binary block design D against the loss of whole blocks, which is based on the concept of rectangle concurrencies.
This criterion is superior to the notion of minimal concurrence that has been employed previously and it enables improved conditions for classifying the robustness status of D to be derived.
It is shown that several classes of binary block designs, with the positive feature of possessing either partial balance or near balance, are maximally robust; thus expanding a classic result in the literature, known as Ghosh's theorem, that confines this status to balanced designs.
|MPEG-4 Video||640x360||1.84 Mbits/sec||372.73 MB||View||Download|
|WebM||640x360||799.78 kbits/sec||156.99 MB||View||Download|
|Flash Video||484x272||568.88 kbits/sec||111.94 MB||View||Download|
|iPod Video||480x270||506.39 kbits/sec||99.65 MB||View||Download|
|MP3||44100 Hz||125.04 kbits/sec||24.41 MB||Listen||Download|
|Auto *||(Allows browser to choose a format it supports)|