## You limited your search to:

**Partner:**UNT Libraries

**Degree Discipline:**Mathematics

**Degree Level:**Master's

**Collection:**UNT Theses and Dissertations

### 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

**Date:**May 2016

**Creator:**Le, Thu Anh

**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.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc849728/

### A Comparative Study of Non Linear Conjugate Gradient Methods

**Date:**August 2013

**Creator:**Pathak, Subrat

**Description:**We study the development of nonlinear conjugate gradient methods, Fletcher Reeves (FR) and Polak Ribiere (PR). FR extends the linear conjugate gradient method to nonlinear functions by incorporating two changes, for the step length αk a line search is performed and replacing the residual, rk (rk=b-Axk) by the gradient of the nonlinear objective function. The PR method is equivalent to FR method for exact line searches and when the underlying quadratic function is strongly convex. The PR method is basically a variant of FR and primarily differs from it in the choice of the parameter βk. On applying the nonlinear Rosenbrock function to the MATLAB code for the FR and the PR algorithms we observe that the performance of PR method (k=29) is far better than the FR method (k=42). But, we observe that when the MATLAB codes are applied to general nonlinear functions, specifically functions whose minimum is a large negative number not close to zero and the iterates too are large values far off from zero the PR algorithm does not perform well. This problem with the PR method persists even if we run the PR algorithm for more iterations or with an initial guess closer to the ...

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc283864/

### On the density of minimal free subflows of general symbolic flows.

**Date:**August 2009

**Creator:**Seward, Brandon Michael

**Description:**This paper studies symbolic dynamical systems {0, 1}G, where G is a countably infinite group, {0, 1}G has the product topology, and G acts on {0, 1}G by shifts. It is proven that for every countably infinite group G the union of the minimal free subflows of {0, 1}G is dense. In fact, a stronger result is obtained which states that if G is a countably infinite group and U is an open subset of {0, 1}G, then there is a collection of size continuum consisting of pairwise disjoint minimal free subflows intersecting U.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc11009/

### Determining Properties of Synaptic Structure in a Neural Network through Spike Train Analysis

**Date:**May 2007

**Creator:**Brooks, Evan

**Description:**A "complex" system typically has a relatively large number of dynamically interacting components and tends to exhibit emergent behavior that cannot be explained by analyzing each component separately. A biological neural network is one example of such a system. A multi-agent model of such a network is developed to study the relationships between a network's structure and its spike train output. Using this model, inferences are made about the synaptic structure of networks through cluster analysis of spike train summary statistics A complexity measure for the network structure is also presented which has a one-to-one correspondence with the standard time series complexity measure sample entropy.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3702/

### Compact Operators and the Schrödinger Equation

**Date:**December 2006

**Creator:**Kazemi, Parimah

**Description:**In this thesis I look at the theory of compact operators in a general Hilbert space, as well as the inverse of the Hamiltonian operator in the specific case of L2[a,b]. I show that this inverse is a compact, positive, and bounded linear operator. Also the eigenfunctions of this operator form a basis for the space of continuous functions as a subspace of L2[a,b]. A numerical method is proposed to solve for these eigenfunctions when the Hamiltonian is considered as an operator on Rn. The paper finishes with a discussion of examples of Schrödinger equations and the solutions.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc5453/

### Characterizations of Continua of Finite Degree

**Date:**August 2006

**Creator:**Irwin, Shana

**Description:**In this thesis, some characterizations of continua of finite degree are given. It turns out that being of finite degree (by formal definition) can be described by saying there exists an equivalent metric in which Hausdorff linear measure of the continuum is finite. I discuss this result in detail.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc5367/

### Mathematical Modeling of Charged Liquid Droplets: Numerical Simulation and Stability Analysis

**Date:**May 2006

**Creator:**Vantzos, Orestis

**Description:**The goal of this thesis is to study of the evolution of 3D electrically charged liquid droplets of fluid evolving under the influence of surface tension and electrostatic forces. In the first part of the thesis, an appropriate mathematical model of the problem is introduced and the linear stability analysis is developed by perturbing a sphere with spherical harmonics. In the second part, the numerical solution of the problem is described with the use of the boundary elements method (BEM) on an adaptive mesh of triangular elements. The numerical method is validated by comparison with exact solutions. Finally, various numerical results are presented. These include neck formation in droplets, the evolution of surfaces with holes, singularity formation on droplets with various symmetries and numerical evidence that oblate spheroids are unstable.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc5240/

### Applications in Fixed Point Theory

**Date:**December 2005

**Creator:**Farmer, Matthew Ray

**Description:**Banach's contraction principle is probably one of the most important theorems in fixed point theory. It has been used to develop much of the rest of fixed point theory. Another key result in the field is a theorem due to Browder, Göhde, and Kirk involving Hilbert spaces and nonexpansive mappings. Several applications of Banach's contraction principle are made. Some of these applications involve obtaining new metrics on a space, forcing a continuous map to have a fixed point, and using conditions on the boundary of a closed ball in a Banach space to obtain a fixed point. Finally, a development of the theorem due to Browder et al. is given with Hilbert spaces replaced by uniformly convex Banach spaces.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc4971/

### Lyapunov Exponents, Entropy and Dimension

**Date:**August 2004

**Creator:**Williams, Jeremy M.

**Description:**We consider diffeomorphisms of a compact Riemann Surface. A development of Oseledec's Multiplicative Ergodic Theorem is given, along with a development of measure theoretic entropy and dimension. The main result, due to L.S. Young, is that for certain diffeomorphisms of a surface, there is a beautiful relationship between these three concepts; namely that the entropy equals dimension times expansion.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc4559/

### Thermodynamical Formalism

**Date:**August 2004

**Creator:**Chousionis, Vasileios

**Description:**Thermodynamical formalism is a relatively recent area of pure mathematics owing a lot to some classical notions of thermodynamics. On this thesis we state and prove some of the main results in the area of thermodynamical formalism. The first chapter is an introduction to ergodic theory. Some of the main theorems are proved and there is also a quite thorough study of the topology that arises in Borel probability measure spaces. In the second chapter we introduce the notions of topological pressure and measure theoretic entropy and we state and prove two very important theorems, Shannon-McMillan-Breiman theorem and the Variational Principle. Distance expanding maps and their connection with the calculation of topological pressure cover the third chapter. The fourth chapter introduces Gibbs states and the very important Perron-Frobenius Operator. The fifth chapter establishes the connection between pressure and geometry. Topological pressure is used in the calculation of Hausdorff dimensions. Finally the sixth chapter introduces the notion of conformal measures.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc4631/

### A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions

**Date:**May 2004

**Creator:**Vlasic, Andrew

**Description:**We follow a research paper that J. Elstrodt published in 1998 to prove the Prime Number Theorem for arithmetic progressions. We will review basic results from Dirichlet characters and L-functions. Furthermore, we establish a weak version of the Wiener-Ikehara Tauberian Theorem, which is an essential tool for the proof of our main result.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc4476/

### Understanding Ancient Math Through Kepler: A Few Geometric Ideas from The Harmony of the World

**Date:**August 2002

**Creator:**Arthur, Christopher

**Description:**Euclid's geometry is well-known for its theorems concerning triangles and circles. Less popular are the contents of the tenth book, in which geometry is a means to study quantity in general. Commensurability and rational quantities are first principles, and from them are derived at least eight species of irrationals. A recently republished work by Johannes Kepler contains examples using polygons to illustrate these species. In addition, figures having these quantities in their construction form solid shapes (polyhedra) having origins though Platonic philosophy and Archimedean works. Kepler gives two additional polyhedra, and a simple means for constructing the “divine” proportion is given.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3269/

### Borel Determinacy and Metamathematics

**Date:**December 2001

**Creator:**Bryant, Ross

**Description:**Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and a Borel set of Turing degrees that neither contains nor omits a cone; so by another theorem of Martin, Borel Determinacy is not a theorem of ZC. This paper contains three main sections: Martin's proof of Borel Determinacy; a simpler example of Friedman's result, namely, (in ZFC) a coanalytic set of Turing degrees that neither contains nor omits a cone; and finally, the Friedman result.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3061/

### Hyperspace Topologies

**Date:**August 2001

**Creator:**Freeman, Jeannette Broad

**Description:**In this paper we study properties of metric spaces. We consider the collection of all nonempty closed subsets, Cl(X), of a metric space (X,d) and topologies on C.(X) induced by d. In particular, we investigate the Hausdorff topology and the Wijsman topology. Necessary and sufficient conditions are given for when a particular pseudo-metric is a metric in the Wijsman topology. The metric properties of the two topologies are compared and contrasted to show which also hold in the respective topologies. We then look at the metric space R-n, and build two residual sets. One residual set is the collection of uncountable, closed subsets of R-n and the other residual set is the collection of closed subsets of R-n having n-dimensional Lebesgue measure zero. We conclude with the intersection of these two sets being a residual set representing the collection of uncountable, closed subsets of R-n having n-dimensional Lebesgue measure zero.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc2902/

### A Presentation of Current Research on Partitions of Lines and Space

**Date:**December 1999

**Creator:**Nugen, Frederick T.

**Description:**We present the results from three papers concerning partitions of vector spaces V over the set R of reals and of the set of lines in V.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc2243/

### A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

**Date:**August 1998

**Creator:**Risley, Rebecca N.

**Description:**We investigate a class of minimal sequences on a finite alphabet Ak = {1,2,...,k} having (k - 1)n + 1 distinct subwords of length n. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of binary Sturmian sequences. We describe two simple combinatorial algorithms for constructing characteristic Arnoux-Rauzy sequences (one of which is new even in the Sturmian case). Arnoux-Rauzy sequences arising from fixed points of primitive morphisms are characterized by an underlying periodic structure. We show that every Arnoux-Rauzy sequence contains arbitrarily large subwords of the form V^2+ε and, in the Sturmian case, arbitrarily large subwords of the form V^3+ε. Finally, we prove that an irrational number whose base b-digit expansion is an Arnoux-Rauzy sequence is transcendental.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc278440/

### Plane Curves, Convex Curves, and Their Deformation Via the Heat Equation

**Date:**August 1998

**Creator:**Debrecht, Johanna M.

**Description:**We study the effects of a deformation via the heat equation on closed, plane curves. We begin with an overview of the theory of curves in R3. In particular, we develop the Frenet-Serret equations for any curve parametrized by arc length. This chapter is followed by an examination of curves in R2, and the resultant adjustment of the Frenet-Serret equations. We then prove the rotation index for closed, plane curves is an integer and for simple, closed, plane curves is ±1. We show that a curve is convex if and only if the curvature does not change sign, and we prove the Isoperimetric Inequality, which gives a bound on the area of a closed curve with fixed length. Finally, we study the deformation of plane curves developed by M. Gage and R. S. Hamilton. We observe that convex curves under deformation remain convex, and simple curves remain simple.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc278501/

### Primitive Substitutive Numbers are Closed under Rational Multiplication

**Date:**August 1998

**Creator:**Ketkar, Pallavi S. (Pallavi Subhash)

**Description:**Lehr (1991) proved that, if M(q, r) denotes the set of real numbers whose expansion in base-r is q-automatic i.e., is recognized by an automaton A = (Aq, Ar, ao, δ, φ) (or is the image under a letter to letter morphism of a fixed point of a substitution of constant length q) then M(q, r) is closed under addition and rational multiplication. Similarly if we let M(r) denote the set of real numbers α whose base-r digit expansion is ultimately primitive substitutive, i.e., contains a tail which is the image (under a letter to letter morphism) of a fixed point of a primitive substitution then in an attempt to generalize Lehr's result we show that the set M(r) is closed under multiplication by rational numbers. We also show that M(r) is not closed under addition.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc278637/

### Polish Spaces and Analytic Sets

**Date:**August 1997

**Creator:**Muller, Kimberly (Kimberly Orisja)

**Description:**A Polish space is a separable topological space that can be metrized by means of a complete metric. A subset A of a Polish space X is analytic if there is a Polish space Z and a continuous function f : Z —> X such that f(Z)= A. After proving that each uncountable Polish space contains a non-Borel analytic subset we conclude that there exists a universally measurable non-Borel set.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc277605/

### On Groups of Positive Type

**Date:**August 1995

**Creator:**Moore, Monty L.

**Description:**We describe groups of positive type and prove that a group G is of positive type if and only if G admits a non-trivial partition. We completely classify groups of type 2, and present examples of other groups of positive type as well as groups of type zero.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc277804/

### Physical Motivation and Methods of Solution of Classical Partial Differential Equations

**Date:**August 1995

**Creator:**Thompson, Jeremy R. (Jeremy Ray)

**Description:**We consider three classical equations that are important examples of parabolic, elliptic, and hyperbolic partial differential equations, namely, the heat equation, the Laplace's equation, and the wave equation. We derive them from physical principles, explore methods of finding solutions, and make observations about their applications.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc277898/

### Continuous, Nowhere-Differentiable Functions with no Finite or Infinite One-Sided Derivative Anywhere

**Date:**December 1994

**Creator:**Lee, Jae S. (Jae Seung)

**Description:**In this paper, we study continuous functions with no finite or infinite one-sided derivative anywhere. In 1925, A. S. Beskovitch published an example of such a function. Since then we call them Beskovitch functions. This construction is presented in chapter 2, The example was simple enough to clear the doubts about the existence of Besicovitch functions. In 1932, S. Saks showed that the set of Besicovitch functions is only a meager set in C[0,1]. Thus the Baire category method for showing the existence of Besicovitch functions cannot be directly applied. A. P. Morse in 1938 constructed Besicovitch functions. In 1984, Maly revived the Baire category method by finding a non-empty compact subspace of (C[0,1], || • ||) with respect to which the set of Morse-Besicovitch functions is comeager.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc278627/

### Intuition versus Formalization: Some Implications of Incompleteness on Mathematical Thought

**Date:**August 1994

**Creator:**Lindman, Phillip A. (Phillip Anthony)

**Description:**This paper describes the tension between intuition about number theory and attempts to formalize it. I will first examine the root of the dilemma, Godel's First Incompleteness Theorem, which demonstrates that in any reasonable formalization of number theory, there will be independent statements. After proving the theorem, I consider some of its consequences on intuition, focusing on Freiling's "Dart Experiment" which is based on our usual notion of the real numbers as a line. This experiment gives an apparent refutation of the Axiom of Choice and the Continuum Hypothesis; however, it also leads to an equally apparent paradox. I conclude that such paradoxes are inevitable as the formalization of mathematics takes us further from our initial intuitions.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc277970/

### Dimension Theory

**Date:**August 1986

**Creator:**Frere, Scot M. (Scot Martin)

**Description:**This paper contains a discussion of topological dimension theory. Original proofs of theorems, as well as a presentation of theorems and proofs selected from Ryszard Engelking's Dimension Theory are contained within the body of this endeavor. Preliminary notation is introduced in Chapter I. Chapter II consists of the definition of and theorems relating to the small inductive dimension function Ind. Large inductive dimension is investigated in Chapter III. Chapter IV comprises the definition of covering dimension and theorems discussing the equivalence of the different dimension functions in certain topological settings. Arguments pertaining to the dimension o f Jn are also contained in Chapter IV.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc500690/