Question 4: Consider a 28-3 fractional factorial design with design generators F=ABC, G=ABD, and H=BCDE a)...

Question 4: Consider a 28-3 fractional factorial design with design generators F=ABC, G=ABD, and H=BCDE

a) Find the complete defining relation and generate the alias structure using the principle (positive) fraction. Second, determine the design resolution (you need to show your justification).

b) List the basic variables and the design configuration (All 32 design points with the + and – signs. You should show the setting for all 8 factors by using the design generators) (Hint: Here there are 5 basic variables which you can use to generate the entire design)

Expert Solution

b)

orchestra answered 1 year ago

Consider a 2^8-3 fractional factorial design with design generators F=ABC, G=ABD, and H=BCDE a)Find the complete...

Consider a 2^8-3 fractional factorial design with design generators F=ABC, G=ABD, and H=BCDE a)Find the complete defining relation and generate the alias structure using the principle(positive) fraction. Second, determine the design resolution (you need to show your justification). b)List the basic variables and the design configuration (All 32 design points with the + and – signs. You should show the setting for all 8 factors by using the design generators) (Hint: Here there are 5 basic variables which you can...

Question 3: Consider a 25 factorial design. (a) How many factors and levels are considered in...

Question 3: Consider a 25 factorial design. (a) How many factors and levels are considered in this factorial experiment? (b) Show all the 32 treatment combinations using a, b, c, d, and e. (c) Suppose you are not able to complete all 32 experiments in a day but you believe 16 experiments can be done in a day. How many blocks do you need under this situation? (d) Revisiting part (c), which interaction effect would be confounded with the blocks?...

Consider the reaction, 2 D(g) + 3 E(g) + F(g) => 2 G(g) + H(g) When...

Consider the reaction, 2 D(g) + 3 E(g) + F(g) => 2 G(g) + H(g) When H is increasing at 0.85 mol/Ls, how quickly is F decreasing?

Consider a fractional 2^5-2 design. The following runs were performed: de, ae, b, abd, cd, ac,...

Consider a fractional 2^5-2 design. The following runs were performed: de, ae, b, abd, cd, ac, bce, abcde. a) Find the design generators. b) Write the complete defining relation for this design. c) Write the full alias structure for this design. d) Suppose you have to perform the runs in two blocks. Propose a good block generator and indicate why it’s good. e) Which runs will go in which block if you use the generator from (d)?

Question: Consider the following C language instruction. A[10] = ((f+g) – (h+A[5])) + 100; Translate the...

Question: Consider the following C language instruction. A[10] = ((f+g) – (h+A[5])) + 100; Translate the above code into MIPS assembly language code. Assume variables f, g, and h are associated with registers $S0, $S1, and $S2 respectively. The base address of A is associated with register $S5.

1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4....

1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4. T→¬B, T→¬D ∴ T→¬(B∨D) 5. ¬(M∨¬S), S→(R→M) ∴A → (¬R∨T) 6. (F&G) → I, (I∨J) → K ∴F→(G→K) 7. ¬U, O→G, ¬(O∨G) →U ∴G Prove that the arguments are valid by constructing a dedication using the rules MP, MT, DN, Conj, Simp, CS, Disj, DS, DM, CP, HS, BE, and DL. Use CP if needed.

Given that h(x)=x+3 and g(x)=sqrt of x-4, find (g+h)(4), if it exists.

In this question we study the recursively defined functions f, g and h given by the...

In this question we study the recursively defined functions f, g and h given by the following defining equations f(0) = −1 base case 0, f(1) = 0 base case 1, and f(n) = n · f(n − 1) + f(n − 2)^2 recursive case for n ≥ 2. and g(0, m, r, k) = m base case 0, and g(n, m, r, k) = g(n − 1, r,(k + 2)r + m^2 , k + 1) recursive case for...

In this question we study the recursively defined functions f, g and h given by the...

In this question we study the recursively defined functions f, g and h given by the following defining equations f(0) = −1 base case 0, f(1) = 0 base case 1, and f(n) = n · f(n − 1) + f(n − 2)^2 recursive case for n ≥ 2. and g(0, m, r, k) = m base case 0, and g(n, m, r, k) = g(n − 1, r,(k + 2)r + m^2 , k + 1) recursive case for...

Consider G = (Z12, +). Let H = {0, 3, 6, 9}. a. Show that H...

Consider G = (Z12, +). Let H = {0, 3, 6, 9}. a. Show that H is a subgroup of G. b. Find all the cosets of H in G and denote this set by G/H. [Note: If x ∈ G then H +12 [x]12 = {[h + x]12?? | [h]12 ∈ H} is the coset generated by x.] c. For H +12 [x]12, H +12 [y]12 ∈ G/H define (H+12[x]12)⊕(H+12[y]12) by(H+12 [x]12)⊕(H+12 [y]12)=H+12 [x+y]12. d. Show that ⊕ is...

Question

Question 4: Consider a 28-3 fractional factorial design with design generators F=ABC, G=ABD, and H=BCDE a)...

Solutions

Expert Solution

Related Solutions

Consider a 2^8-3 fractional factorial design with design generators F=ABC, G=ABD, and H=BCDE a)Find the complete...

Question 3: Consider a 25 factorial design. (a) How many factors and levels are considered in...

Consider the reaction, 2 D(g) + 3 E(g) + F(g) => 2 G(g) + H(g) When...

Consider a fractional 2^5-2 design. The following runs were performed: de, ae, b, abd, cd, ac,...

Question: Consider the following C language instruction. A[10] = ((f+g) – (h+A[5])) + 100; Translate the...

1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4....

Given that h(x)=x+3 and g(x)=sqrt of x-4, find (g+h)(4), if it exists.

In this question we study the recursively defined functions f, g and h given by the...

In this question we study the recursively defined functions f, g and h given by the...

Consider G = (Z12, +). Let H = {0, 3, 6, 9}. a. Show that H...