𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Aliasing in 2n−k fractions in the case of a separation of factors

✍ Scribed by Gregory Constantine; Lianyong Xue

Book ID
104340624
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
99 KB
Volume
72
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

✦ Synopsis

When studying a response as a function of several factors, engineering reasons or other deterministic considerations often imply that interactions between certain factors do not exist. This prompts advantageous exploitation of the aliasing pattern in fractional factorial designs. The general case when factors (each at two levels) can be partitioned into two classes, with no interactions present between the two classes, is treated in this paper.

📜 SIMILAR VOLUMES

Aliasing in 2n–k fractions in the absenc
Aliasing in 2n–k fractions in the absence of within group interactions
✍ G. Constantine; L. Xue 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 802 KB

It is often known in advance that certain subsets of factors act independently upon a response. Such information can be used to estimational advantage by aliasing low-order effects with such zero interactions. We find the best 2 "-k fractions for the case when the factors can be partitioned into two

On the existence of rainbows in 1-factor
On the existence of rainbows in 1-factorizations of K2n
✍ David E. Woolbright; Hung-Lin FU 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

A 1-factor of a graph G = (V, E) is a collection of disjoint edges which contain all the vertices of V . Given a 2n -1 edge coloring of K2n, n ≥ 3, we prove there exists a 1-factor of K2n whose edges have distinct colors. Such a 1-factor is called a ''Rainbow.''