M
Mike Jacroux
Researcher at Washington State University
Publications - 66
Citations - 858
Mike Jacroux is an academic researcher from Washington State University. The author has contributed to research in topics: Block design & Optimal design. The author has an hindex of 15, co-authored 66 publications receiving 839 citations.
Papers
More filters
Journal ArticleDOI
Optimal designs for comparing test treatments with controls
TL;DR: In this article, existing knowledge on optimal designs for comparing test treatments with controls under 0-, 1-, and 2-way elimination of heterogeneity models is presented. But the results are motivated through numerical examples.
Journal ArticleDOI
The construction of trend-free run orders of two-level factorial designs
Ching-Shui Cheng,Mike Jacroux +1 more
TL;DR: In this paper, the authors consider the problem of randomization of a factorial design with all factors occurring at two levels and show that randomization may lead to a run order in which the estimates of factor effects are adversely effected by the presence of the trend.
ReportDOI
Recent Discoveries on Optimal Designs for Comparing Test Treatments with Controls.
TL;DR: In this paper, the authors consider three possible models: 1) O-way elimination of heterogeneity model in which all experimental units are homogeneous before application of treatments, 2) 1-way removal of heterogeneity models in which experimental units can be divided into several homogeneous blocks, and 3) 2-way partitioning of the experimental units according to rows and columns.
Journal ArticleDOI
On the optimality of chemical balance weighing designs
TL;DR: In this paper, the problem of optimally weighing n objects with n weighings on a chemical balance was considered and several previously known results were generalized, including those of Ehlich (1964a) and Payne (1974), and the results on the E-optimality of weighing designs are also given.
Journal ArticleDOI
On the E‐Optimality of Regular Graph Designs
TL;DR: In this article, it is shown that when a regular graph design exists whose minimum non-zero eigenvalue is large enough, then an E-optimal regular graph is possible.