Thesis (Ph. D.)--Rutgers University, 2007. / "Graduate Program in Mathematics." Includes bibliographical references (p. 82-85).

Thesis (Ph. D.)--Oregon State University, 1996. / Typescript (photocopy). Includes bibliographical references (leaves 68-69). Also available on the World Wide Web.

Thesis (doctoral)--Bonn, 1998. / Includes bibliographical references (p. 111-112).

Huge amount of data flows around the Internet every second, but for the data to be useful at its destination, it must be presented in a way such that the target has little problem interpreting it. Current data exchange technologies may rearrange the structure of data to suit expectations at the target. However, there may be semantics behind data (e.g. knowing the title of a book can determine its #pages) that may be violated after data translation. These semantics are expressed as integrity constraints (IC) in a database. Currently, there is no guarantee that the exchanged data conforms to the target’s ICs. As a result, existing applications (e.g. user queries) that assume such semantics will no longer function correctly. Current constraint repair techniques deal with data after it has been translated; thus take no consideration of the integrity constraints at the source. Moreover, such constraint repair methods usually involve addition/deletion/modification of data, which may yield incomplete or false data. We consider the constraints of both source and target schemas; together with the mapping, we can efficiently detect which constraint is violated and suggest ways to correct the mappings. / Science, Faculty of / Computer Science, Department of / Graduate

The main purpose of this paper is the study of transformations in topological space and relationships between special types of transformations.

We deal with two themes that are illustrative of the rigidity and regularity of holomorphic mappings. The first one concerns the regularity of continuous CR mappings between smooth pseudo convex, finite type hypersurfaces which is a well studied subject for it is linked with the problem of studying the boundary behaviour of proper holomorphic mappings between domains bounded by such hypersurfaces. More specifically, we study the regularity of Lipschitz CR mappings from an h-extendible(or semi-regular) hypersurface in Cn .Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A rigidity result for proper holomorphic mappings from strongly pseudo convex domains is also proved. The second theme dealt with, is the classification upto biholomorphic equivalence of model domains with abelian automorphism group in C3 .It is shown that every model domain i.e.,a hyperbolic rigid polynomial domainin C3 of finite type, with abelian automorphism group is equivalent to a domain that is balanced with respect to some weight.

published_or_final_version / Mathematics / Doctoral / Doctor of Philosophy

published_or_final_version / Mathematics / Doctoral / Doctor of Philosophy

This thesis considers problems concerning Latin squares and sets of mutually quasiorthogonal Latin squares (MQOLS). We show how MQOLS are related to a number of other designs and establish bounds on Nq(n), the maximum number of Latin squares of order n in a mutually quasi-orthogonal set. We report the number of quasi-complete mappings admitted by each group of order 15 or less, and explain the surprising result that each of the non-cyclic groups of order 8 possesses exactly 384 complete mappings. For each group G of order 15 or less, we identify the sizes of all maximal sets of mutually orthogonal orthomorphisms. We also identify a number of new maximal sets for larger groups. We present a method to determine all proper, maximal sets of MQOLS of order n and carry this out for n < 6. Also we present a search for 3 MQOLS of order 10, which, whilst not identifying such a set, led to the identification of all resolutions of each (10,3, 2)-balanced incomplete block design. We give a construction for MQOLS based on groups, and use this to determine new sets of 2n - 1 MQOLS of order 2n based on two infinite classes of group. Existence results for MQOLS based on groups are also extended. Two constructions for (n x n)/k semi-Latin squares are given, one of which provides some new A-, D- and E-optimal examples with k > n which out-perform the existing A-, D- and E-optimal examples in the E'-criteria. Finally we consider the problem of determining invertible directed terraces of each non-abelian group of order < 21, and in so doing construct the first doubly balanced bipartite tournament of odd order.

Lam, Ka Chun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 64-68). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts also in Chinese.