Thesis (Ph. D.)--Missouri University of Science and Technology, 2008. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed May 9, 2008) Includes bibliographical references (p. 71-73).

Thesis (Ph. D.)--Rutgers University, 2009. / "Graduate Program in Mathematics." Includes bibliographical references (p. 72-74).

Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1994. / Vita. Abstract. Includes bibliographical references (leaf 66). Also available via the Internet.

Thesis (Ph.D.)--University of Hong Kong, 2000. / Includes bibliographical references (leaves 50-53) Also available in print.

Schema mappings have been extensively studied in the context of data exchange and data integration, where they have turned out to be the right level of abstraction for formalizing data interoperability tasks. Up to now and for the most part, schema mappings have been studied as static objects, in the sense that each time the focus has been on a single schema mapping of interest or, in the case of composition, on a pair of schema mappings of interest. In this paper, we adopt a dynamic viewpoint and embark on a study of sequences of schema mappings and of the limiting behavior of such sequences. To this effect, we first introduce a natural notion of distance on sets of finite target instances that expresses how "Close" two sets of target instances are as regards the certain answers of conjunctive queries on these sets. Using this notion of distance, we investigate pointwise limits and uniform limits of sequences of schema mappings, as well as the companion notions of pointwise Cauchy and uniformly Cauchy sequences of schema mappings. We obtain a number of results about the limits of sequences of GAV schema mappings and the limits of sequences of LAV schema mappings that reveal striking differences between these two classes of schema mappings. We also consider the completion of the metric space of sets of target instances and obtain concrete representations of limits of sequences of schema mappings in terms of generalized schema mappings, that is, schema mappings with infinite target instances as solutions to (finite) source instances.

Submitted by Irene Nascimento (irene.kessia@ufpe.br) on 2016-10-11T18:36:34Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Tese Adriano Thiago.pdf: 1085326 bytes, checksum: 498b2bcfd47961466edce3360e11a858 (MD5) / Made available in DSpace on 2016-10-11T18:36:34Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Tese Adriano Thiago.pdf: 1085326 bytes, checksum: 498b2bcfd47961466edce3360e11a858 (MD5) Previous issue date: 2016-06-17 / Neste trabalho estudamos algumas extens˜oes do conceito de operadores multilineares absolutamente somantes, generalizamos alguns resultados conhecidos e respondemos parcialmente alguns problemas abertos. Para a classe das aplica¸c˜oes absolutamente (p; q; r)-somantes, obtemos alguns resultados de coincidˆencia e inclus˜ao e mostramos que o ideal de polinˆomios absolutamente (p; q; r)-somantes n˜ao ´e corente, de acordo com a no¸c˜ao de ideais coerentes devida a D. Carando, V. Dimant e S. Muro. Para contornar esta falha, introduzimos o conceito de aplica¸c˜oes m´ultiplo (p; q; r)-somantes e mostramos que, com essa nova abordagem, o ideal de polinˆomios m´ultiplo (p; q; r)- somantes ´e coerente e compat´ıvel com o ideal de operadores lineares absolutamente (p; q; r)-somantes. / In this work we investigate some extensions of the concept of absolutely summing operators, generalize some known results and provide partial answers to some open questions. For the class of absolutely (p; q; r)-summing mappings we obtain some inclusion and coincidence results and show that the ideal of absolutely (p; q; r)-summing polynomials is not coherent, according to the notion of coherent ideals due to D. Carando, V. Dimant and S. Muro. In order to bypass this deficiency, we introduce the concept of multiple (p; q; r)-summing multilinear and polynomial operators and show that, with this new approach, the ideal of multiple (p; q; r)-summing polynomials is coherent and compatible with the ideal of absolutely (p; q; r)-summing operators.

This thesis is about graph-indexed random walks, Lipschitz mappings and graph homo- morphisms. It discusses connections between these notions, surveys the existing results, and shows new results. Graph homomorphism is an adjacency-preserving mapping between two graphs. Our main objects of study are graph homomorphisms to an infinite path. We are interested in two parameters: maximum range and average range. The average range of a graph is the expected size of the image of a uniformly picked random homomorphism to an infinite path. We obtain formulas for several graph classes and investigate main conjectures on this parameter. For maximum range parameter we show a general formula and an algorithm to compute it for general graphs. Besides that, we study the problem of extending a prescribed partial graph homomorphism to a full graph homomorphism. We show that this problem is polynomial in some cases. 1

2003 / Some important ideas froni classical control theory are introduced with the intention of applying them to chaotic dynamical systems, in particular the coupled logistic equations. The structure of this dissertation is such that a strong foundation in control theory is first established before introducing the coupled logistic map or the methods of control and targetting in chaotic systems. In chapter 1 some aspects of classical control theory are reviewed. Continuous- and discrete-time dynamical systems are introduced and the existence and uniquendss criteria for the continuous case are explored via Lipschitz continuity. The matrix form of an inhomogeneous linear differential equation is presented and several properties of the associated transition matrix are discussed. Several linear algebraic ideas, most notably the Cayley-Hamilton theorem, are employed to explore the important concepts of controllability and observability in linear systems. The stabilisability problem is thoroughly investigated. Finally, the neighbourhood properties of continuous nonlinear dynamical systems with reference to controllability, stability and noise are established. Chapter 2 places emphasis on canonical forms, pole assignments and state observers. The decomposition of a general system into distinct components is facilitated by the general structure theorem, which is proved. The pole placement problem is described and the correspondence between the stabilisability of a system and the placement of poles is noted by the use'of a socalled feedback matrix. Lastly, the notion of a state observer, with reference to some dynamic feedback law, is introduced. The dynamics of the coupled logistic equations are studied in chapter 3. The fixed points of the map are calculated and the subsequent dynamical consequences explored. Using methods introduced in earlier chapters, the stability of the map is investigated. Using the so-called variational equations, the Lyapunov exponents are computed and used to classify, the motion of the system for the parameter values r and a. This chapter concludes with a discussion of the basins of attraction and critical curves associated with the coupled logistic equations. It is in chapter 4 that the models for controlling chaos are instantiated. The famous Ott-Grebogi- Yorke (OGY) method for controlling chaos is explained and related to the pole placement problem, discussed previously. The theory is extended to study the control of periodic orbits with periods greater than one.

A fixed point of a mapping is an element in the domain of the mapping that is mapped into itself by the mapping. The study of fixed points has been a field of interests to mathematicians since the discovery of the Banach contraction theorem, i.e. if is a complete metric space and is a contraction mapping (i.e. there exists such that for all ), then has a unique fixed point. The Banach contraction theorem has found many applications in pure and applied mathematics. Due to fixed point theory being a mixture of analysis, geometry, algebra and topology, its applications to other fields such as physics, economics, game theory, chemistry, engineering and many others has become vital. The theory is nowadays a very active field of research in which many new theorems are published, some of them applied and many others generalized. Motivated by all of this, we give an exposition of some generalizations of fixed point theorems in metric fixed point theory, which is a branch of fixed point theory about results of fixed points of mappings between metric spaces, where certain properties of the mappings involved need not be preserved under equivalent metrics. For instance, the contractive property of mappings between metric spaces need not be preserved under equivalent metrics. Since metric fixed point theory is wide, we limit ourselves to fixed point theorems for self and non-self-mappings on Banach and metric spaces. We also take a look at some open problems on this topic of study. At the end of the dissertation, we suggest our own problems for future research.

Data warehouses were envisioned to facilitate analytical reporting and data visualization by providing a model for the flow of data from operational databases to decision support environments. Decision support environments provide a multidimensional conceptual view of the underlying data warehouse, which is usually stored in relational DBMSs. Typically, there is an impedance mismatch between this conceptual view — shared also by all decision support applications accessing the data warehouse — and the physical model of the data stored in relational DBMSs. This thesis presents a mapping compilation algorithm in the context of the Conceptual Integration Model (CIM) [67] framework. In the CIM framework, the relationships between the conceptual model and the physical model are specified by a set of attribute-to-attribute correspondences. The algorithm compiles these correspondences into a set of mappings that associate each construct in the conceptual model with a query on the physical model. Moreover, the homogeneity and summarizability of data in conceptual models is the key to accurate query answering, a necessity in decision making environments. A data-driven approach to refactor relational models into summarizable schemas and instances is proposed as the solution of this issue. We outline the algorithms and challenges in bridging multidimensional conceptual models and the physical model of data warehouses and discuss experimental results.