You limited your search to:

  Partner: UNT Libraries
 Degree Discipline: Mathematics
 Collection: UNT Theses and Dissertations
Means and Mean Value Theorems

Means and Mean Value Theorems

Date: 1951
Creator: Blummer, Raymond O.
Description: This study covers means, mean value theorems of the differential calculus, and mean value theorems of integral calculus.
Contributing Partner: UNT Libraries
Random Sampling

Random Sampling

Date: January 1957
Creator: Booker, Aaron Hicks
Description: The purpose of this study is to show the use of random sampling in solving certain mathematical problems. The origin of random numbers to be used in sampling is discussed and methods of sampling from known distributions are then given together with an indication that the sampling procedures are unbiased.
Contributing Partner: UNT Libraries
The Riemann-Complete Integral

The Riemann-Complete Integral

Date: May 1972
Creator: Boyd, Eddie
Description: The problem with which this paper is concerned is that of defining the Riemann-Complete Integral and comparing it with the Riemann and the Lebesgue Integrals.
Contributing Partner: UNT Libraries
Some Results of Two Topological Spaces

Some Results of Two Topological Spaces

Date: August 1955
Creator: Boyd, James Robert
Description: This thesis explores some results of two topological spaces.
Contributing Partner: UNT Libraries
The Study of Translation Equivalence on Integer Lattices

The Study of Translation Equivalence on Integer Lattices

Date: August 2003
Creator: Boykin, Charles Martin
Description: This paper is a contribution to the study of countable Borel equivalence relations on standard Borel spaces. We concentrate here on the study of the nature of translation equivalence. We study these known hyperfinite spaces in order to gain insight into the approach necessary to classify certain variables as either being hyperfinite or not. In Chapter 1, we will give the basic definitions and examples of spaces used in this work. The general construction of marker sets is developed in this work. These marker sets are used to develop several invariant tilings of the equivalence classes of specific variables . Some properties that are equivalent to hyperfiniteness in the certain space are also developed. Lastly, we will give the new result that there is a continuous injective embedding from certain defined variables.
Contributing Partner: UNT Libraries
Certain Properties of Functions Related to Exhaustibility

Certain Properties of Functions Related to Exhaustibility

Date: 1952
Creator: Bradford, James C.
Description: In this thesis, we shall attempt to present a study of certain properties of real functions related to the set property exhaustible.
Contributing Partner: UNT Libraries
A Study of Functions on Metric Spaces

A Study of Functions on Metric Spaces

Date: January 1968
Creator: Brice, Richard S.
Description: This thesis describes various forms of metric spaces and establishes some of the properties of functions defined on metric spaces. No attempt is made in this paper to examine a particular type of function in detail. Instead, some of properties of several kinds of functions will be observed as the functions are defined on various forms of metric spaces such as connected spaces, compact spaces, complete spaces, etc.
Contributing Partner: UNT Libraries
Abstract Measure

Abstract Measure

Date: 1957
Creator: Bridges, Robert Miller
Description: This study of abstract measure covers classes of sets, measures and outer measures, extension of measures, and planer measure.
Contributing Partner: UNT Libraries
Determining Properties of Synaptic Structure in a Neural Network through Spike Train Analysis

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
The Structure of a Boolean Algebra

The Structure of a Boolean Algebra

Date: August 1965
Creator: Bryant, June Anne
Description: The purpose of this chapter is to develop a form of a "free" Boolean algebra with Σ as a base, by imposing the usual Boolean operations on the set Σ and thus generating new elements freely within explicitly prescribed restrictions.
Contributing Partner: UNT Libraries