UNT Theses and Dissertations - Browse

ABOUT BROWSE FEED

Equivalence Classes of Subquotients of Pseudodifferential Operator Modules on the Line

Description: Certain subquotients of Vec(R)-modules of pseudodifferential operators from one tensor density module to another are categorized, giving necessary and sufficient conditions under which two such subquotients are equivalent as Vec(R)-representations. These subquotients split under the projective subalgebra, a copy of ????2, when the members of their composition series have distinct Casimir eigenvalues. Results were obtained using the explicit description of the action of Vec(R) with respect to this splitting. In the length five case, the equivalence classes of the subquotients are determined by two invariants. In an appropriate coordinate system, the level curves of one of these invariants are a pencil of conics, and those of the other are a pencil of cubics.
Date: August 2012
Creator: Larsen, Jeannette M.
Partner: UNT Libraries

Equivalent Sets and Cardinal Numbers

Description: The purpose of this thesis is to study the equivalence relation between sets A and B: A o B if and only if there exists a one to one function f from A onto B. In Chapter I, some of the fundamental properties of the equivalence relation are derived. Certain basic results on countable and uncountable sets are given. In Chapter II, a number of theorems on equivalent sets are proved and Dedekind's definitions of finite and infinite are compared with the ordinary concepts of finite and infinite. The Bernstein Theorem is studied and three different proofs of it are given. In Chapter III, the concept of cardinal number is introduced by means of two axioms of A. Tarski, and some fundamental theorems on cardinal arithmetic are proved.
Date: December 1975
Creator: Hsueh, Shawing
Partner: UNT Libraries

Euclidean Rings

Description: The cardinality of the set of units, and of the set of equivalence classes of primes in non-trivial Euclidean domains is discussed with reference to the categories "finite" and "infinite." It is shown that no Euclidean domains exist for which both of these sets are finite. The other three combinations are possible and examples are given. For the more general Euclidean rings, the first combination is possible and examples are likewise given. Prime factorization is also discussed in both Euclidean rings and Euclidean domains. For Euclidean rings, an alternative definition of prime elements in terms of associates is compared and contrasted to the usual definitions.
Date: May 1974
Creator: Fecke, Ralph Michael
Partner: UNT Libraries

Examples and Applications of Infinite Iterated Function Systems

Description: The aim of this work is the study of infinite conformal iterated function systems. More specifically, we investigate some properties of a limit set J associated to such system, its Hausdorff and packing measure and Hausdorff dimension. We provide necessary and sufficient conditions for such systems to be bi-Lipschitz equivalent. We use the concept of scaling functions to obtain some result about 1-dimensional systems. We discuss particular examples of infinite iterated function systems derived from complex continued fraction expansions with restricted entries. Each system is obtained from an infinite number of contractions. We show that under certain conditions the limit sets of such systems possess zero Hausdorff measure and positive finite packing measure. We include an algorithm for an approximation of the Hausdorff dimension of limit sets. One numerical result is presented. In this thesis we also explore the concept of positively recurrent function. We use iterated function systems to construct a natural, wide class of such functions that have strong ergodic properties.
Date: August 2000
Creator: Hanus, Pawel Grzegorz
Partner: UNT Libraries

Exhaustivity, continuity, and strong additivity in topological Riesz spaces.

Description: In this paper, exhaustivity, continuity, and strong additivity are studied in the setting of topological Riesz spaces. Of particular interest is the link between strong additivity and exhaustive elements of Dedekind s-complete Banach lattices. There is a strong connection between the Diestel-Faires Theorem and the Meyer-Nieberg Lemma in this setting. Also, embedding properties of Banach lattices are linked to the notion of strong additivity. The Meyer-Nieberg Lemma is extended to the setting of topological Riesz spaces and uniform absolute continuity and uniformly exhaustive elements are studied in this setting. Counterexamples are provided to show that the Vitali-Hahn-Saks Theorem and the Brooks-Jewett Theorem cannot be extended to submeasures or to the setting of Banach lattices.
Access: This item is restricted to UNT Community Members. Login required if off-campus.
Date: May 2004
Creator: Muller, Kimberly O.
Partner: UNT Libraries

Existence of a Sign-Changing Solution to a Superlinear Dirichlet Problem

Description: We study the existence, multiplicity, and nodal structure of solutions to a superlinear elliptic boundary value problem. Under specific hypotheses on the superlinearity, we show that there exist at least three nontrivial solutions. A pair of solutions are of one sign (positive and negative respectively), and the third solution changes sign exactly once. Our technique is variational, i.e., we study the critical points of the associated action functional to find solutions. First, we define a codimension 1 submanifold of a Sobolev space . This submanifold contains all weak solutions to our problem, and in our case, weak solutions are also classical solutions. We find nontrivial solutions which are local minimizers of our action functional restricted to various subsets of this submanifold. Additionally, if nondegenerate, the one-sign solutions are of Morse index 1 and the sign-changing solution has Morse index 2. We also establish that the action level of the sign-changing solution is bounded below by the sum of the two lesser levels of the one-sign solutions. Our results extend and complement the findings of Z. Q. Wang ([W]). We include a small sample of earlier works in the general area of superlinear elliptic boundary value problems.
Date: August 1995
Creator: Neuberger, John M. (John Michael)
Partner: UNT Libraries

An Existence Theorem for an Integral Equation

Description: The principal theorem of this thesis is a theorem by Peano on the existence of a solution to a certain integral equation. The two primary notions underlying this theorem are uniform convergence and equi-continuity. Theorems related to these two topics are proved in Chapter II. In Chapter III we state and prove a classical existence and uniqueness theorem for an integral equation. In Chapter IV we consider the approximation on certain functions by means of elementary expressions involving "bent line" functions. The last chapter, Chapter V, is the proof of the theorem by Peano mentioned above. Also included in this chapter is an example in which the integral equation has more than one solution. The first chapter sets forth basic definitions and theorems with which the reader should be acquainted.
Date: May 1985
Creator: Hunt, Cynthia Young
Partner: UNT Libraries

An Exploration of the Word2vec Algorithm: Creating a Vector Representation of a Language Vocabulary that Encodes Meaning and Usage Patterns in the Vector Space Structure

Description: This thesis is an exloration and exposition of a highly efficient shallow neural network algorithm called word2vec, which was developed by T. Mikolov et al. in order to create vector representations of a language vocabulary such that information about the meaning and usage of the vocabulary words is encoded in the vector space structure. Chapter 1 introduces natural language processing, vector representations of language vocabularies, and the word2vec algorithm. Chapter 2 reviews the basic mathematical theory of deterministic convex optimization. Chapter 3 provides background on some concepts from computer science that are used in the word2vec algorithm: Huffman trees, neural networks, and binary cross-entropy. Chapter 4 provides a detailed discussion of the word2vec algorithm itself and includes a discussion of continuous bag of words, skip-gram, hierarchical softmax, and negative sampling. Finally, Chapter 5 explores some applications of vector representations: word categorization, analogy completion, and language translation assistance.
Date: May 2016
Creator: Le, Thu Anh
Partner: UNT Libraries

Field Extensions and Galois Theory

Description: This paper will be devoted to an exposition of some of the relationships existing between a field and certain of its extension fields. In particular, it will be shown that many fields may be characterized rather simply in terms of their subfields which, in turn, may be directly correlated with the subgroups of a finite group of automorphisms of the given field.
Date: August 1967
Creator: Votaw, Charles I.
Partner: UNT Libraries

Finite Difference Methods for Approximating Solutions to the Heat Equation

Description: This paper is concerned with finite difference methods for approximating solutions to the partial differential heat equation. The first chapel gives some introductory background into the physical problem, then motivates three finite difference methods. Chapters II through IV provide statements and proofs for the theorems used in the methods of Chapter I. The final Chapter, V, provides conclusions and an indication of future work. An appendix includes the computer codes written by the author with numerical results.
Date: August 1982
Creator: Neuberger, Barbara O. (Barbara Osher)
Partner: UNT Libraries

Finite Dimensional Vector Space

Description: The object of this thesis is to examine properties of an abstract vector space of finite dimension n. The properties of the set of complex numbers are assumed, and the definition of a field and of an abelian group are not stated, although reference to these systems is made.
Date: August 1960
Creator: Power, Billy Joe
Partner: UNT Libraries

Fourier Transforms of Functions on a Finite Abelian Group

Description: This paper presents a theory of Fourier transforms of complex-valued functions on a finite abelian group and investigates two applications of this theory. Chapter I is an introduction with remarks on notation. Basic theory, including Pontrvagin duality and the Poisson Summation formula, is the subject of Chapter II. In Chapter III the Fourier transform is viewed as an intertwining operator for certain unitary group representations. The solution of the eigenvalue problem of the Fourier transform of functions on the group Z/n of integers module n leads to a proof of the quadratic reciprocity law in Chapter IV. Chapter V addresses the, use of the Fourier transform in computing.
Date: August 1982
Creator: Currey, Bradley Norton
Partner: UNT Libraries

T-Functions

Description: The main purpose of this paper is to make a detailed study of a certain class T of complex functions. The functions of the class T have a special mapping property and are meromorphic in every region. As an application of this study, certain elementary functions are defined and studied in terms of a special T-function.
Date: June 1960
Creator: Barlow, John Rice
Partner: UNT Libraries

Fundamental Issues in Support Vector Machines

Description: This dissertation considers certain issues in support vector machines (SVMs), including a description of their construction, aspects of certain exponential kernels used in some SVMs, and a presentation of an algorithm that computes the necessary elements of their operation with proof of convergence. In its first section, this dissertation provides a reasonably complete description of SVMs and their theoretical basis, along with a few motivating examples and counterexamples. This section may be used as an accessible, stand-alone introduction to the subject of SVMs for the advanced undergraduate. Its second section provides a proof of the positive-definiteness of a certain useful function here called E and dened as follows: Let V be a complex inner product space. Let N be a function that maps a vector from V to its norm. Let p be a real number between 0 and 2 inclusive and for any in V , let ( be N() raised to the p-th power. Finally, let a be a positive real number. Then E() is exp(()). Although the result is not new (other proofs are known but involve deep properties of stochastic processes) this proof is accessible to advanced undergraduates with a decent grasp of linear algebra. Its final section presents an algorithm by Dr. Kallman (preprint), based on earlier Russian work by B.F. Mitchell, V.F Demyanov, and V.N. Malozemov, and proves its convergence. The section also discusses briefly architectural features of the algorithm expected to result in practical speed increases.
Date: May 2014
Creator: McWhorter, Samuel P.
Partner: UNT Libraries