You limited your search to:

  Partner: UNT Libraries
 Department: Department of Mathematics
 Collection: UNT Theses and Dissertations
Maximum Likelihood Estimation of Logistic Sinusoidal Regression Models

Maximum Likelihood Estimation of Logistic Sinusoidal Regression Models

Date: December 2013
Creator: Weng, Yu
Description: We consider the problem of maximum likelihood estimation of logistic sinusoidal regression models and develop some asymptotic theory including the consistency and joint rates of convergence for the maximum likelihood estimators. The key techniques build upon a synthesis of the results of Walker and Song and Li for the widely studied sinusoidal regression model and on making a connection to a result of Radchenko. Monte Carlo simulations are also presented to demonstrate the finite-sample performance of the estimators
Contributing Partner: UNT Libraries
Polynomial Isomorphisms of Cayley Objects Over a Finite Field

Polynomial Isomorphisms of Cayley Objects Over a Finite Field

Date: December 1989
Creator: Park, Hong Goo
Description: In this dissertation the Bays-Lambossy theorem is generalized to GF(pn). The Bays-Lambossy theorem states that if two Cayley objects each based on GF(p) are isomorphic then they are isomorphic by a multiplier map. We use this characterization to show that under certain conditions two isomorphic Cayley objects over GF(pn) must be isomorphic by a function on GF(pn) of a particular type.
Contributing Partner: UNT Libraries
Hausdorff, Packing and Capacity Dimensions

Hausdorff, Packing and Capacity Dimensions

Date: August 1989
Creator: Spear, Donald W.
Description: In this thesis, Hausdorff, packing and capacity dimensions are studied by evaluating sets in the Euclidean space R^. Also the lower entropy dimension is calculated for some Cantor sets. By incorporating technics of Munroe and of Saint Raymond and Tricot, outer measures are created. A Vitali covering theorem for packings is proved. Methods (by Taylor and Tricot, Kahane and Salem, and Schweiger) for determining the Hausdorff and capacity dimensions of sets using probability measures are discussed and extended. The packing pre-measure and measure are shown to be scaled after an affine transformation. A Cantor set constructed by L.D. Pitt is shown to be dimensionless using methods developed in this thesis. A Cantor set is constructed for which all four dimensions are different. Graph directed constructions (compositions of similitudes follow a path in a directed graph) used by Mauldin and Willjams are presented. Mauldin and Williams calculate the Hausdorff dimension, or, of the object of a graph directed construction and show that if the graph is strongly connected, then the a—Hausdorff measure is positive and finite. Similar results will be shown for the packing dimension and the packing measure. When the graph is strongly connected, there is a constant so that ...
Contributing Partner: UNT Libraries
The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors

The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors

Date: August 1989
Creator: Hipp, James W. (James William), 1956-
Description: We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W_3, and the 3-whirl W^3 as minor is (n - 1)q + 1, and geometries of maximum size are parallel connections of (q + 1)-point lines. We show that the maximum size of a geometry of rank n excluding the 5-point line, the 4-wheel W_4, and the 4-whirl W^4 as minors is 6n - 5, for n ≥ 3. Examples of geometries having rank n and size 6n - 5 include parallel connections of the geometries V_19 and PG(2,3).
Contributing Partner: UNT Libraries
Minimization of a Nonlinear Elasticity Functional Using Steepest Descent

Minimization of a Nonlinear Elasticity Functional Using Steepest Descent

Date: August 1988
Creator: McCabe, Terence W. (Terence William)
Description: The method of steepest descent is used to minimize typical functionals from elasticity.
Contributing Partner: UNT Libraries
Bounded, Finitely Additive, but Not Absolutely Continuous Set Functions

Bounded, Finitely Additive, but Not Absolutely Continuous Set Functions

Date: May 1989
Creator: Gurney, David R. (David Robert)
Description: In leading up to the proof, methods for constructing fields and finitely additive set functions are introduced with an application involving the Tagaki function given as an example. Also, non-absolutely continuous set functions are constructed using Banach limits and maximal filters.
Contributing Partner: UNT Libraries
Applications of Graph Theory and Topology to Combinatorial Designs

Applications of Graph Theory and Topology to Combinatorial Designs

Date: December 1988
Creator: Somporn Sutinuntopas
Description: This dissertation is concerned with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to obtain a design from a difference family. Chapters II to IV study the existence of an affine 3-(p^m,4,λ) design where the v-set is the Galois field GF(p^m). Associated to each prime p, this paper constructs a graph. If the graph has a 1-factor, then a difference family and hence an affine design exists. The question arises of how to determine when the graph has a 1-factor. It is not hard to see that the graph is connected and of even order. Tutte's theorem shows that if the graph is 2-connected and regular of degree three, then the graph has a 1-factor. By using the concept of quadratic reciprocity, this paper shows that if p Ξ 53 or 77 (mod 120), the graph is almost regular of degree three, i.e., every vertex has degree three, except two vertices each have degree tow. Adding an extra edge joining the two vertices with degree tow gives a regular graph of degree three. Also, Tutte proved that if A is an edge of the graph satisfying the above conditions, ...
Contributing Partner: UNT Libraries
Dynamics of One-Dimensional Maps: Symbols, Uniqueness, and Dimension

Dynamics of One-Dimensional Maps: Symbols, Uniqueness, and Dimension

Date: May 1988
Creator: Brucks, Karen M. (Karen Marie), 1957-
Description: This dissertation is a study of the dynamics of one-dimensional unimodal maps and is mainly concerned with those maps which are trapezoidal. The trapezoidal function, f_e, is defined for eΣ(0,1/2) by f_e(x)=x/e for xΣ[0,e], f_e(x)=1 for xΣ(e,1-e), and f_e(x)=(1-x)/e for xΣ[1-e,1]. We study the symbolic dynamics of the kneading sequences and relate them to the analytic dynamics of these maps. Chapter one is an overview of the present theory of Metropolis, Stein, and Stein (MSS). In Chapter two a formula is given that counts the number of MSS sequences of length n. Next, the number of distinct primitive colorings of n beads with two colors, as counted by Gilbert and Riordan, is shown to equal the number of MSS sequences of length n. An algorithm is given that produces a bisection between these two quantities for each n. Lastly, the number of negative orbits of size n for the function f(z)=z^2-2, as counted by P.J. Myrberg, is shown to equal the number of MSS sequences of length n. For an MSS sequence P, let H_ϖ(P) be the unique common extension of the harmonics of P. In Chapter three it is proved that there is exactly one J(P)Σ[0,1] such that the ...
Contributing Partner: UNT Libraries
Operators on Continuous Function Spaces and Weak Precompactness

Operators on Continuous Function Spaces and Weak Precompactness

Date: August 1988
Creator: Abbott, Catherine Ann
Description: If T:C(H,X)-->Y is a bounded linear operator then there exists a unique weakly regular finitely additive set function m:-->L(X,Y**) so that T(f) = ∫Hfdm. In this paper, bounded linear operators on C(H,X) are studied in terms the measure given by this representation theorem. The first chapter provides a brief history of representation theorems of these classes of operators. In the second chapter the represenation theorem used in the remainder of the paper is presented. If T is a weakly compact operator on C(H,X) with representing measure m, then m(A) is a weakly compact operator for every Borel set A. Furthermore, m is strongly bounded. Analogous statements may be made for many interesting classes of operators. In chapter III, two classes of operators, weakly precompact and QSP, are studied. Examples are provided to show that if T is weakly precompact (QSP) then m(A) need not be weakly precompact (QSP), for every Borel set A. In addition, it will be shown that weakly precompact and GSP operators need not have strongly bounded representing measures. Sufficient conditions are provided which guarantee that a weakly precompact (QSP) operator has weakly precompact (QSP) values. A sufficient condition for a weakly precomact operator to be strongly ...
Contributing Partner: UNT Libraries
Existence of a Solution for a Wave Equation and an Elliptic Dirichlet Problem

Existence of a Solution for a Wave Equation and an Elliptic Dirichlet Problem

Date: May 1988
Creator: Sumalee Unsurangsie
Description: In this paper we consider an existence of a solution for a nonlinear nonmonotone wave equation in [0,π]xR and an existence of a positive solution for a non-positone Dirichlet problem in a bounded subset of R^n.
Contributing Partner: UNT Libraries