You limited your search to:

  Partner: UNT Libraries
 Department: Department of 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.

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
A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil

A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil

Date: June 1947
Creator: Copp, George
Description: In treating the motion of a fluid mathematically, it is convenient to make some simplifying assumptions. The assumptions which are made will be justifiable if they save long and laborious computations in practical problems, and if the predicted results agree closely enough with experimental results for practical use. In dealing with the flow of air about an airfoil, at subsonic speeds, the fluid will be considered as a homogeneous, incompressible, inviscid fluid.
Contributing Partner: UNT Libraries
Some Effects of the War Upon the Mathematics Curriculum and the Motivating Forces at Work as Reflected in the Dallas City Schools

Some Effects of the War Upon the Mathematics Curriculum and the Motivating Forces at Work as Reflected in the Dallas City Schools

Date: August 1945
Creator: Smith, R. N.
Description: "To discuss the effect all this war activity has had upon the Dallas Schools and to voice a protest against those who seek to discredit mathematics and at the same time to contribute a readable thesis upon the subject is largely the purpose of this study." --leaf 2
Contributing Partner: UNT Libraries
Linear Operators

Linear Operators

Date: December 1975
Creator: Malhotra, Vijay Kumar
Description: This paper is a study of linear operators defined on normed linear spaces. A basic knowledge of set theory and vector spaces is assumed, and all spaces considered have real vector spaces. The first chapter is a general introduction that contains assumed definitions and theorems. Included in this chapter is material concerning linear functionals, continuity, and boundedness. The second chapter contains the proofs of three fundamental theorems of linear analysis: the Open Mapping Theorem, the Hahn-Banach Theorem, and the Uniform Boundedness Principle. The third chapter is concerned with applying some of the results established in earlier chapters. In particular, the concepts of compact operators and Schauder bases are introduced, and a proof that an operator is compact if and only if its adjoint is compact is included. This chapter concludes with a proof of an important application of the Open Mapping Theorem, namely, the Closed Graph Theorem.
Contributing Partner: UNT Libraries
Equivalent Sets and Cardinal Numbers

Equivalent Sets and Cardinal Numbers

Date: December 1975
Creator: Hsueh, Shawing
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.
Contributing Partner: UNT Libraries
The Use of Chebyshev Polynomials in Numerical Analysis

The Use of Chebyshev Polynomials in Numerical Analysis

Date: December 1975
Creator: Forisha, Donnie R.
Description: The purpose of this paper is to investigate the nature and practical uses of Chebyshev polynomials. Chapter I gives recognition to mathematicians responsible for studies in this area. Chapter II enumerates several mathematical situations in which the polynomials naturally arise and suggests reasons for the pursuance of their study. Chapter III includes: Chebyshev polynomials as related to "best" polynomial approximation, Chebyshev series, and methods of producing polynomial approximations to continuous functions. Chapter IV discusses the use of Chebyshev polynomials to solve certain differential equations and Chebyshev-Gauss quadrature.
Contributing Partner: UNT Libraries
Duals and Weak Completeness in Certain Sequence Spaces

Duals and Weak Completeness in Certain Sequence Spaces

Date: August 1980
Creator: Leavelle, Tommy L. (Tommy Lee)
Description: In this paper the weak completeness of certain sequence spaces is examined. In particular, we show that each of the sequence spaces c0 and 9, 1 < p < c, is a Banach space. A Riesz representation for the dual space of each of these sequence spaces is given. A Riesz representation theorem for Hilbert space is also proven. In the third chapter we conclude that any reflexive space is weakly (sequentially) complete. We give 01 as an example of a non-reflexive space that is weakly complete. Two examples, c0 and YJ, are given of spaces that fail to be weakly complete.
Contributing Partner: UNT Libraries
Subdirectly Irreducible Semigroups

Subdirectly Irreducible Semigroups

Date: December 1978
Creator: Winton, Richard Alan
Description: Definition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary operation (multiplication) on S. Notation. A semigroup (S,*) will ordinarily be referred to by the set S, with the multiplication understood. In other words, if (a,b)e SX , then *[(a,b)] = a*b = ab. The proof of the following proposition is found on p. 4 of Introduction to Semigroups, by Mario Petrich. Proposition 1.2. Every semigroup S satisfies the general associative law.
Contributing Partner: UNT Libraries
Interpolation and Approximation

Interpolation and Approximation

Date: May 1977
Creator: Lal, Ram
Description: In this paper, there are three chapters. The first chapter discusses interpolation. Here a theorem about the uniqueness of the solution to the general interpolation problem is proven. Then the problem of how to represent this unique solution is discussed. Finally, the error involved in the interpolation and the convergence of the interpolation process is developed. In the second chapter a theorem about the uniform approximation to continuous functions is proven. Then the best approximation and the least squares approximation (a special case of best approximation) is discussed. In the third chapter orthogonal polynomials as discussed as well as bounded linear functionals in Hilbert spaces, interpolation and approximation and approximation in Hilbert space.
Contributing Partner: UNT Libraries
Complete Ordered Fields

Complete Ordered Fields

Date: August 1977
Creator: Arnold, Thompson Sharon
Description: The purpose of this thesis is to study the concept of completeness in an ordered field. Several conditions which are necessary and sufficient for completeness in an ordered field are examined. In Chapter I the definitions of a field and an ordered field are presented and several properties of fields and ordered fields are noted. Chapter II defines an Archimedean field and presents several conditions equivalent to the Archimedean property. Definitions of a complete ordered field (in terms of a least upper bound) and the set of real numbers are also stated. Chapter III presents eight conditions which are equivalent to completeness in an ordered field. These conditions include the concepts of nested intervals, Dedekind cuts, bounded monotonic sequences, convergent subsequences, open coverings, cluster points, Cauchy sequences, and continuous functions.
Contributing Partner: UNT Libraries
The Wallman Spaces and Compactifications

The Wallman Spaces and Compactifications

Date: December 1976
Creator: Liu, Wei-kong
Description: If X is a topological space and Y is a ring of closed sets, then a necessary and sufficient condition for the Wallman space W(X,F) to be a compactification of X is that X be T1 andYF separating. A necessary and sufficient condition for a Wallman compactification to be Hausdoff is that F be a normal base. As a result, not all T, compactifications can be of Wallman type. One point and finite Hausdorff compactifications are of Wallman type.
Contributing Partner: UNT Libraries
Valuations on Fields

Valuations on Fields

Date: May 1977
Creator: Walker, Catherine A.
Description: This thesis investigates some properties of valuations on fields. Basic definitions and theorems assumed are stated in Capter I. Chapter II introduces the concept of a valuation on a field. Real valuations and non-Archimedean valuations are presented. Chapter III generalizes non-Archimedean valuations. Examples are described in Chapters I and II. A result is the theorem stating that a real valuation of a field K is non-Archimedean if and only if $(a+b) < max4# (a), (b) for all a and b in K. Chapter III generally defines a non-Archimedean valuation as an ordered abelian group. Real non-Archimedean valuations are either discrete or nondiscrete. Chapter III shows that every valuation ring identifies a non-Archimedean valuation and every non-Archimedean valuation identifies a valuation ring.
Contributing Partner: UNT Libraries
A Comparative Study of Non Linear Conjugate Gradient Methods

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
Properties of Bicentric Circles for Three-Sided Polygons

Properties of Bicentric Circles for Three-Sided Polygons

Date: August 1998
Creator: Heinlein, David J. (David John)
Description: We define and construct bicentric circles with respect to three-sided polygons. Then using inherent properties of these circles, we explore both tangent properties, and areas generated from bicentric circles.
Contributing Partner: UNT Libraries
Polish Spaces and Analytic Sets

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
Physical Motivation and Methods of Solution of Classical Partial Differential Equations

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
On Groups of Positive Type

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
Plane Curves, Convex Curves, and Their Deformation Via the Heat Equation

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
Primitive Substitutive Numbers are Closed under Rational Multiplication

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
Intuition versus Formalization: Some Implications of Incompleteness on Mathematical Thought

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
Continuous, Nowhere-Differentiable Functions with no Finite or Infinite One-Sided Derivative Anywhere

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
A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

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
Connectedness and Some Concepts Related to Connectedness of a Topological Space

Connectedness and Some Concepts Related to Connectedness of a Topological Space

Date: August 1969
Creator: Wallace, Michael A.
Description: The purpose of this thesis is to investigate the idea of topological "connectedness" by presenting some of the basic ideas concerning connectedness along with several related concepts.
Contributing Partner: UNT Libraries
Borel Sets and Baire Functions

Borel Sets and Baire Functions

Date: January 1970
Creator: Wemple, Fred W.
Description: This paper examines the relationship between Borel sets and Baire functions.
Contributing Partner: UNT Libraries
FIRST PREV 1 2 3 4 5 NEXT LAST