A well-known theorem in "Number Theory", the Chinese Remainder Theorem, was first utilized by Paul K. Lin in constructing confounding systems for mixed factorial experiments. This study extends the use of the theorem to cover cases when more than one component from some of the symmetrical factorials are confounded, and to include cases where the number of levels of factors are not all relative prime.
The second part of this study concerns the randomized fractional replicates, a procedure which selects confounded subsets with pre-assigned probabilities. This procedure provides full information on a specific set of parameters of interest while making no assumption of zero nuisance parameters. Estimation procedures in general symmetrical as well as asymmetrical factorial systems are studied under a ”fully orthogonalized" model. The type-g estimator, investigated under the generalized inverse operator, and the class of linear estimators of parameters of interest and their variance-covariance matrices are given. The unbiasedness of these estimators can be obtained only under the condition that each subset of treatment combinations is selected with equal probability. This work is concluded with simulation studies to compare the classical and the randomization procedures. The results indicate that when information about the nuisance parameters is not available, randomization procedure guards against a bad choice of design. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/54195 |
| Date | January 1989 |
| Creators | Huang, Won-Chin Liao |
| Contributors | Statistics, Lentner, Marvin, Arnold, Jesse C., Brooks, Camilla A., Hinkelmann, Klaus, Reynolds, Marion R. Jr. |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Dissertation, Text |
| Format | vii, 107 leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 20438859 |
Page generated in 0.0022 seconds