No description available.

Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (leaves 51-52).

No description available.

No description available.

No description available.

Isomorphisms of automorphism groups of reduced torsion abelian p-groups have recently been classified by W. Liebert [L1] and [L2] for p ≠ 2. The primary objective of this study is to investigate the isomorphisms of automorphism groups of reduced mixed modules M and N of torsion-free ranks < ∞ over a complete discrete valuation ring with totally projective torsion submodules t(M) and t(N) respectively. For modules over ℤ(p), p ≠ 2, we show that if AutM and AutN are isomorphic and the quotient modules M/t(M) and N /t(N) are divisible, then M ≃ N.

Uniform design has found successful applications in manufacturing, system engineering, pharmaceutics and natural sciences since it appeared in 1980's. Recently, research related to uniform design is emerging. Discussions are mainly focusing on the construction and the theoretical properties of uniform design. On one hand, new construction methods can help researchers to search for uniform designs in more efficient and effective ways. On the other hand, since uniformity has been accepted as an essential criterion for comparing fractional factorial designs, it is interesting to explore its relationship with other criteria, such as aberration, orthogonality, confounding, etc. The first goal of this thesis is to propose new uniform design construction methods and recommend designs with good uniformity. A novel stochastic heuristic technique, the adjusted threshold accepting algorithm, is proposed for searching uniform designs. This algorithm has successfully generated a number of uniform designs, which outperforms the existing uniform design tables in the website https://uic.edu.hk/~isci/UniformDesign/UD%20Tables.html. In addition, designs with good uniformity are recommended for screening either qualitative or quantitative factors via a comprehensive study of symmetric orthogonal designs with 27 runs, 3 levels and 13 factors. These designs are also outstanding under other traditional criteria. The second goal of this thesis is to give an in-depth study of the uniformity property of fractional factorial designs. Close connections between different criteria and lower bounds of the average uniformity have been revealed, which can be used as benchmarks for selecting the best designs. Moreover, we find non-isomorphic designs have different combinatorial and geometric properties in their projected and level permutated designs. Two new non-isomorphic detection methods are proposed and utilized for classifying fractional factorial designs. The new methods take advantages over the existing ones in terms of computation efficiency and classification capability. Finally, the relationship between uniformity and isomorphism of fractional factorial designs has been discussed in detail. We find isomorphic designs may have different geometric structure and propose a new isomorphic identification method. This method significantly reduces the computational complexity of the procedure. A new uniformity criterion, the uniformity pattern, is proposed to evaluate the overall uniformity performance of an isomorphic design set.

Uniform design has found successful applications in manufacturing, system engineering, pharmaceutics and natural sciences since it appeared in 1980's. Recently, research related to uniform design is emerging. Discussions are mainly focusing on the construction and the theoretical properties of uniform design. On one hand, new construction methods can help researchers to search for uniform designs in more efficient and effective ways. On the other hand, since uniformity has been accepted as an essential criterion for comparing fractional factorial designs, it is interesting to explore its relationship with other criteria, such as aberration, orthogonality, confounding, etc. The first goal of this thesis is to propose new uniform design construction methods and recommend designs with good uniformity. A novel stochastic heuristic technique, the adjusted threshold accepting algorithm, is proposed for searching uniform designs. This algorithm has successfully generated a number of uniform designs, which outperforms the existing uniform design tables in the website https://uic.edu.hk/~isci/UniformDesign/UD%20Tables.html. In addition, designs with good uniformity are recommended for screening either qualitative or quantitative factors via a comprehensive study of symmetric orthogonal designs with 27 runs, 3 levels and 13 factors. These designs are also outstanding under other traditional criteria. The second goal of this thesis is to give an in-depth study of the uniformity property of fractional factorial designs. Close connections between different criteria and lower bounds of the average uniformity have been revealed, which can be used as benchmarks for selecting the best designs. Moreover, we find non-isomorphic designs have different combinatorial and geometric properties in their projected and level permutated designs. Two new non-isomorphic detection methods are proposed and utilized for classifying fractional factorial designs. The new methods take advantages over the existing ones in terms of computation efficiency and classification capability. Finally, the relationship between uniformity and isomorphism of fractional factorial designs has been discussed in detail. We find isomorphic designs may have different geometric structure and propose a new isomorphic identification method. This method significantly reduces the computational complexity of the procedure. A new uniformity criterion, the uniformity pattern, is proposed to evaluate the overall uniformity performance of an isomorphic design set.

It is shown that the cardinal product of graphs does not satisfy unique prime factorization even for a very restrictive class of graphs. It is also proved that every connected graph has a decomposition as a weak cartesian product into indecomposable factors and that this decomposition is unique to within isomorphisms. This latter result is established by considering a certain class of equivalence relations on the edge set of a graph and proving that this collection is a principal filter in the lattice of all equivalences. The least element of this filter is then used to decompose the graph into a weak cartesian product of prime graphs that is unique to within isomorphisms. / Thesis / Doctor of Philosophy (PhD)

Let G be a group. A Weak Cayley Table mapping ϕ : G → G is a bijection such that ϕ(g1g2) is conjugate to ϕ(g1)ϕ(g2) for all g1, g2 in G. The set of all such mappings forms a group W(G) under composition. We study W(G) for the seventeen wallpaper groups G.