 Fundamental Issues in Support Vector Machines
 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, standalone introduction to the subject of SVMs for the advanced undergraduate. Its second section provides a proof of the positivedefiniteness 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 pth 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. digital.library.unt.edu/ark:/67531/metadc500155/
 Maximum Likelihood Estimation of Logistic Sinusoidal Regression Models
 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 finitesample performance of the estimators digital.library.unt.edu/ark:/67531/metadc407796/
 A Comparative Study of Non Linear Conjugate Gradient Methods
 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=bAxk) 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 actual minimum. To improve the PR algorithm we suggest finding a better weighing parameter βk, using better line search method and/or using specific line search for certain functions and identifying specific restart criteria based on the function to be optimized. digital.library.unt.edu/ark:/67531/metadc283864/
 Centers of Invariant Differential Operator Algebras for Jacobi Groups of Higher Rank
 Let G be a Lie group acting on a homogeneous space G/K. The center of the universal enveloping algebra of the Lie algebra of G maps homomorphically into the center of the algebra of differential operators on G/K invariant under the action of G. In the case that G is a Jacobi Lie group of rank 2, we prove that this homomorphism is surjective and hence that the center of the invariant differential operator algebra is the image of the center of the universal enveloping algebra. This is an extension of work of Bringmann, Conley, and Richter in the rank 1case. digital.library.unt.edu/ark:/67531/metadc283833/
 Natural Smooth Measures on the Leaves of the Unstable Manifold of Open Billiard Dynamical Systems
 In this paper, we prove, for a certain class of open billiard dynamical systems, the existence of a family of smooth probability measures on the leaves of the dynamical system's unstable manifold. These measures describe the conditional asymptotic behavior of forward trajectories of the system. Furthermore, properties of these families are proven which are germane to the PYC programme for these systems. Strong sufficient conditions for the uniqueness of such families are given which depend upon geometric properties of the system's phase space. In particular, these results hold for a fairly nonrestrictive class of triangular configurations of scatterers. digital.library.unt.edu/ark:/67531/metadc278917/
 Minimality of the Special Linear Groups
 Let F denote the field of real numbers, complex numbers, or a finite algebraic extension of the padic field. We prove that the special linear group SLn(F) with the usual topology induced by F is a minimal topological group. This is accomplished by first proving the minimality of the upper triangular group in SLn(F). The proof for the upper triangular group uses an induction argument on a chain of upper triangular subgroups and relies on general results for locally compact topological groups, quotient groups, and subgroups. Minimality of SLn(F) is concluded by appealing to the associated Lie group decomposition as the product of a compact group and an upper triangular group. We also prove the universal minimality of homeomorphism groups of one dimensional manifolds, and we give a new simple proof of the universal minimality of S∞. digital.library.unt.edu/ark:/67531/metadc279280/
 Topics in Fractal Geometry
 In this dissertation, we study fractal sets and their properties, especially the open set condition, Hausdorff dimensions and Hausdorff measures for certain fractal constructions. digital.library.unt.edu/ark:/67531/metadc279332/
 Multifractal Measures
 The purpose of this dissertation is to introduce a natural and unifying multifractal formalism which contains the above mentioned multifractal parameters, and gives interesting results for a large class of natural measures. In Part 2 we introduce the proposed multifractal formalism and study it properties. We also show that this multifractal formalism gives natural and interesting results when applied to (nonrandom) graph directed selfsimilar measures in Rd and "cookiecutter" measures in R. In Part 3 we use the multifractal formalism introduced in Part 2 to give a detailed discussion of the multifractal structure of random (and hence, as a special case, nonrandom) graph directed selfsimilar measures in R^d. digital.library.unt.edu/ark:/67531/metadc279084/
 Aspects of Universality in Function Iteration
 This work deals with some aspects of universal topological and metric dynamic behavior of iterated maps of the interval. digital.library.unt.edu/ark:/67531/metadc278799/
 πregular Rings
 The dissertation focuses on the structure of πregular (regular) rings. digital.library.unt.edu/ark:/67531/metadc279388/
 Sufficient Conditions for Uniqueness of Positive Solutions and Non Existence of Sign Changing Solutions for Elliptic Dirichlet Problems
 In this paper we study the uniqueness of positive solutions as well as the non existence of sign changing solutions for Dirichlet problems of the form $$\eqalign{\Delta u + g(\lambda,\ u) &= 0\quad\rm in\ \Omega,\cr u &= 0\quad\rm on\ \partial\Omega,}$$where $\Delta$ is the Laplace operator, $\Omega$ is a region in $\IR\sp{N}$, and $\lambda>0$ is a real parameter. For the particular function $g(\lambda,\ u)=\vert u\vert\sp{p}u+\lambda$, where $p={4\over N2}$, and $\Omega$ is the unit ball in $\IR\sp{N}$ for $N\ge3$, we show that there are no sign changing solutions for small $\lambda$ and also we show that there are no large sign changing solutions for $\lambda$ in a compact set. We also prove uniqueness of positive solutions for $\lambda$ large when $g(\lambda,\ u)=\lambda f(u)$, where f is an increasing, sublinear, concave function with f(0) $<$ 0, and the exterior boundary of $\Omega$ is convex. In establishing our results we use a number of methods from nonlinear functional analysis such as rescaling arguments, methods of order, estimation near the boundary, and moving plane arguments. digital.library.unt.edu/ark:/67531/metadc279227/
 Existence of Many Sign Changing Non Radial Solutions for Semilinear Elliptic Problems on Annular Domains
 The aim of this work is the study of the existence and multiplicity of sign changing nonradial solutions to elliptic boundary value problems on annular domains. digital.library.unt.edu/ark:/67531/metadc278251/
 Polish Spaces and Analytic Sets
 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 nonBorel analytic subset we conclude that there exists a universally measurable nonBorel set. digital.library.unt.edu/ark:/67531/metadc277605/
 Physical Motivation and Methods of Solution of Classical Partial Differential Equations
 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. digital.library.unt.edu/ark:/67531/metadc277898/
 On Groups of Positive Type
 We describe groups of positive type and prove that a group G is of positive type if and only if G admits a nontrivial partition. We completely classify groups of type 2, and present examples of other groups of positive type as well as groups of type zero. digital.library.unt.edu/ark:/67531/metadc277804/
 Multifractal Analysis of Parabolic Rational Maps
 The investigation of the multifractal spectrum of the equilibrium measure for a parabolic rational map with a Lipschitz continuous potential, φ, which satisfies sup φ < P(φ) x∈J(T) is conducted. More specifically, the multifractal spectrum or spectrum of singularities, f(α) is studied. digital.library.unt.edu/ark:/67531/metadc278398/
 A Topological Uniqueness Result for the Special Linear Groups
 The goal of this paper is to establish the dependency of the topology of a simple Lie group, specifically any of the special linear groups, on its underlying group structure. The intimate relationship between a Lie group's topology and its algebraic structure dictates some necessary topological properties, such as second countability. However, the extent to which a Lie group's topology is an "algebraic phenomenon" is, to date, still not known. digital.library.unt.edu/ark:/67531/metadc278561/
 Using Steepest Descent to Find EnergyMinimizing Maps Satisfying Nonlinear Constraints
 The method of steepest descent is applied to a nonlinearly constrained optimization problem which arises in the study of liquid crystals. Let Ω denote the region bounded by two coaxial cylinders of height 1 with the outer cylinder having radius 1 and the inner having radius ρ. The problem is to find a mapping, u, from Ω into R^3 which agrees with a given function v on the surfaces of the cylinders and minimizes the energy function over the set of functions in the Sobolev space H^(1,2)(Ω; R^3) having norm 1 almost everywhere. In the variational formulation, the norm 1 condition is emulated by a constraint function B. The direction of descent studied here is given by a projected gradient, called a Bgradient, which involves the projection of a Sobolev gradient onto the tangent space for B. A numerical implementation of the algorithm, the results of which agree with the theoretical results and which is independent of any strong properties of the domain, is described. In chapter 2, the Sobolev space setting and a significant projection in the theory of Sobolev gradients are discussed. The variational formulation is introduced in Chapter 3, where the issues of differentiability and existence of gradients are explored. A theorem relating the Bgradient to the theory of Lagrange multipliers is stated as well. Basic theorems regarding the continuous steepest descent given by the Sobolev and Bgradients are stated in Chapter 4, and conditions for convergence in the application to the liquid crystal problem are given as well. Finally, in Chapter 5, the algorithm is described and numerical results are examined. digital.library.unt.edu/ark:/67531/metadc278362/
 Plane Curves, Convex Curves, and Their Deformation Via the Heat Equation
 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 FrenetSerret 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 FrenetSerret 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. digital.library.unt.edu/ark:/67531/metadc278501/
 Cycles and Cliques in Steinhaus Graphs
 In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order of induced cycles in Steinhaus graphs is at most [(n+3)/2]. Next the results of maximum clique size in Steinhaus graphs are used to enumerate the Steinhaus graphs having maximal cliques. Finally the concept of jumbled graphs and Posa's Lemma are used to show that almost all Steinhaus graphs are Hamiltonian. digital.library.unt.edu/ark:/67531/metadc278469/
 Property (H*) and Differentiability in Banach Spaces
 A continuous convex function on an open interval of the real line is differentiable everywhere except on a countable subset of its domain. There has been interest in the problem of characterizing those Banach spaces where the continuous functions exhibit similar differentiability properties. In this paper we show that if a Banach space E has property (H*) and B_E• is weak* sequentially compact, then E is an Asplund space. In the case where the space is weakly compactly generated, it is shown that property (H*) is equivalent for the space to admit an equivalent Frechet differentiable norm. Moreover, we define the SH* spaces, show that every SH* space is an Asplund space, and show that every weakly sequentially complete SH* space is reflexive. Also, we study the relation between property (H*) and the asymptotic norming property (ANP). By a slight modification of the ANP we define the ANP*, and show that if the dual of a Banach spaces has the ANP*I then the space admits an equivalent Fréchet differentiability norm, and that the ANP*II is equivalent to the space having property (H*) and the closed unit ball of the dual is weak* sequentially compact. Also, we show that in the dual of a weakly countably determined Banach space all the ANPK'S are equivalent, and they are equivalent for the predual to have property (H*). digital.library.unt.edu/ark:/67531/metadc277852/
 Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory
 In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs are rapidly mixing and an algorithm for the uniform generation of 2  (4k + 1,4,1) cyclic Mendelsohn designs is developed. digital.library.unt.edu/ark:/67531/metadc277740/
 Primitive Substitutive Numbers are Closed under Rational Multiplication
 Lehr (1991) proved that, if M(q, r) denotes the set of real numbers whose expansion in baser is qautomatic 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 baser 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. digital.library.unt.edu/ark:/67531/metadc278637/
 A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence
 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 ArnouxRauzy sequences (one of which is new even in the Sturmian case). ArnouxRauzy sequences arising from fixed points of primitive morphisms are characterized by an underlying periodic structure. We show that every ArnouxRauzy 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 bdigit expansion is an ArnouxRauzy sequence is transcendental. digital.library.unt.edu/ark:/67531/metadc278440/
 Countable Additivity, Exhaustivity, and the Structure of Certain Banach Lattices
 The notion of uniform countable additivity or uniform absolute continuity is present implicitly in the Lebesgue Dominated Convergence Theorem and explicitly in the VitaliHahnSaks and Nikodym Theorems, respectively. V. M. Dubrovsky studied the connection between uniform countable additivity and uniform absolute continuity in a series of papers, and Bartle, Dunford, and Schwartz established a close relationship between uniform countable additivity in ca(Σ) and operator theory for the classical continuous function spaces C(K). Numerous authors have worked extensively on extending and generalizing the theorems of the preceding authors. Specifically, we mention Bilyeu and Lewis as well as Brooks and Drewnowski, whose efforts molded the direction and focus of this paper. This paper is a study of the techniques used by Bell, Bilyeu, and Lewis in their paper on uniform exhaustivity and Banach lattices to present a Banach lattice version of two important and powerful results in measure theory by Brooks and Drewnowski. In showing that the notions of exhaustivity and continuity take on familiar forms in certain Banach lattices of measures they show that these important measure theory results follow as corollaries of the generalized Banach lattice versions. This work uses their template to generalize results established by Bator, Bilyeu, and Lewis. digital.library.unt.edu/ark:/67531/metadc278330/
 The Continuous Wavelet Transform and the Wave Front Set
 In this paper I formulate an explicit wavelet transform that, applied to any distribution in S^1(R^2), yields a function on phase space whose highfrequency singularities coincide precisely with the wave front set of the distribution. This characterizes the wave front set of a distribution in terms of the singularities of its wavelet transform with respect to a suitably chosen basic wavelet. digital.library.unt.edu/ark:/67531/metadc277762/
 Steepest Sescent on a Uniformly Convex Space
 This paper contains four main ideas. First, it shows global existence for the steepest descent in the uniformly convex setting. Secondly, it shows existence of critical points for convex functions defined on uniformly convex spaces. Thirdly, it shows an isomorphism between the dual space of H^{1,p}[0,1] and the space H^{1,q}[0,1] where p > 2 and {1/p} + {1/q} = 1. Fourthly, it shows how the BeurlingDenny theorem can be extended to find a useful function from H^{1,p}[0,1] to L_{p}[1,0] where p > 2 and addresses the problem of using that function to establish a relationship between the ordinary and the Sobolev gradients. The paper contains some numerical experiments and two computer codes. digital.library.unt.edu/ark:/67531/metadc278194/
 Existence of a SignChanging Solution to a Superlinear Dirichlet Problem
 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 onesign solutions are of Morse index 1 and the signchanging solution has Morse index 2. We also establish that the action level of the signchanging solution is bounded below by the sum of the two lesser levels of the onesign 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. digital.library.unt.edu/ark:/67531/metadc278179/
 Characterizations of Some Combinatorial Geometries
 We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be expressed as the union of two of its proper flats. A geometry G is upper homogeneous if for all k, k = 1, 2, ... , r(G), and for every pair x, y of flats of rank k, the contraction G/x is isomorphic to the contraction G/y. Given a signed graph, we define a corresponding signed—graphic geometry. We give a characterization of supersolvable signed graphs. Finally, we give the following characterization of non—splitting supersolvable signedgraphic geometries : If a nonsplitting supersolvable ternary geometry does not contain the Reid geometry as a subgeometry, then it is signed—graphic. digital.library.unt.edu/ark:/67531/metadc277894/
 Descriptions and Computation of Ultrapowers in L(R)
 The results from this dissertation are an exact computation of ultrapowers by measures on cardinals $\aleph\sb{n},\ n\in w$, in $L(\IR$), and a proof that ordinals in $L(\IR$) below $\delta\sbsp{5}{1}$ represented by descriptions and the identity function with respect to sequences of measures are cardinals. An introduction to the subject with the basic definitions and well known facts is presented in chapter I. In chapter II, we define a class of measures on the $\aleph\sb{n},\ n\in\omega$, in $L(\IR$) and derive a formula for an exact computation of the ultrapowers of cardinals by these measures. In chapter III, we give the definitions of descriptions and the lowering operator. Then we prove that ordinals represented by descriptions and the identity function are cardinals. This result combined with the fact that every cardinal $<\delta\sbsp{5}{1}$ in $L(\IR$) is represented by a description (J1), gives a characterization of cardinals in $L(\IR$) below $\delta\sbsp{5}{1}. Concrete examples of formal computations are shown in chapter IV. digital.library.unt.edu/ark:/67531/metadc277867/
 Intuition versus Formalization: Some Implications of Incompleteness on Mathematical Thought
 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. digital.library.unt.edu/ark:/67531/metadc277970/
 A Numerical Method for Solving Singular Differential Equations Utilizing Steepest Descent in Weighted Sobolev Spaces
 We develop a numerical method for solving singular differential equations and demonstrate the method on a variety of singular problems including first order ordinary differential equations, second order ordinary differential equations which have variational principles, and one partial differential equation. digital.library.unt.edu/ark:/67531/metadc278653/
 Continuous, NowhereDifferentiable Functions with no Finite or Infinite OneSided Derivative Anywhere
 In this paper, we study continuous functions with no finite or infinite onesided 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 nonempty compact subspace of (C[0,1],  • ) with respect to which the set of MorseBesicovitch functions is comeager. digital.library.unt.edu/ark:/67531/metadc278627/
 Traveling Wave Solutions of the Porous Medium Equation
 We prove the existence of a oneparameter family of solutions of the porous medium equation, a nonlinear heat equation. In our work, with space dimension 3, the interface is a half line whose end point advances at constant speed. We prove, by using maximum principle, that the solutions are stable under a suitable class of perturbations. We discuss the relevance of our solutions, when restricted to two dimensions, to gravity driven flows of thin films. Here we extend the results of J. Iaia and S. Betelu in the paper "Solutions of the porous medium equation with degenerate interfaces" to a higher dimension. digital.library.unt.edu/ark:/67531/metadc271876/
 Graev Metrics and Isometry Groups of Polish Ultrametric Spaces
 This dissertation presents results about computations of Graev metrics on free groups and characterizes isometry groups of countable noncompact HeineBorel Polish ultrametric spaces. In Chapter 2, computations of Graev metrics are performed on free groups. One of the related results answers an open question of Van Den Dries and Gao. In Chapter 3, isometry groups of countable noncompact HeineBorel Polish ultrametric spaces are characterized. The notion of generalized tree is defined and a correspondence between the isomorphism group of a generalized tree and the isometry group of a HeineBorel Polish ultrametric space is established. The concept of a weak inverse limit is introduced to capture the characterization of isomorphism groups of generalized trees. In Chapter 4, partial results of isometry groups of uncountable compact ultrametric spaces are given. It turns out that every compact ultrametric space has a unique countable orbital decomposition. An orbital space consists of disjoint orbits. An orbit subspace of an orbital space is actually a compact homogeneous ultrametric subspace. digital.library.unt.edu/ark:/67531/metadc271898/
 Determinacyrelated Consequences on Limit Superiors
 Laczkovich proved from ZF that, given a countable sequence of Borel sets on a perfect Polish space, if the limit superior along every subsequence was uncountable, then there was a particular subsequence whose intersection actually contained a perfect subset. Komjath later expanded the result to hold for analytic sets. In this paper, by adding AD and sometimes V=L(R) to our assumptions, we will extend the result further. This generalization will include the increasing of the length of the sequence to certain uncountable regular cardinals as well as removing any descriptive requirements on the sets. digital.library.unt.edu/ark:/67531/metadc271913/
 Descriptive Set Theory and Measure Theory in Locally Compact and Nonlocally Compact Groups
 In this thesis we study descriptivesettheoretic and measuretheoretic properties of Polish groups, with a thematic emphasis on the contrast between groups which are locally compact and those which are not. The work is divided into three major sections. In the first, working jointly with Robert Kallman, we resolve a conjecture of Gleason regarding the Polish topologization of abstract groups of homeomorphisms. We show that Gleason's conjecture is false, and its conclusion is only true when the hypotheses are considerably strengthened. Along the way we discover a new automatic continuity result for a class of functions which behave like but are distinct from functions of Baire class 1. In the second section we consider the descriptive complexity of those subsets of the permutation group S? which arise naturally from the classical LevySteinitz series rearrangement theorem. We show that for any conditionally convergent series of vectors in Euclidean space, the sets of permutations which make the series diverge, and diverge properly, are ?03complete. In the last section we study the phenomenon of Haar null sets a la Christensen, and the closely related notion of openly Haar null sets. We identify and correct a minor error in the proof of Mycielski that a countable union of Haar null sets in a Polish group is Haar null. We show the openly Haar null ideal may be distinct from the Haar null ideal, which resolves an uncertainty of Solecki. We show that compact sets are always Haar null in S? and in any countable product of locally compact noncompact groups, which extends the domain of a result of Dougherty. We show that any countable product of locally compact noncompact groups decomposes into the disjoint union of a meager set and a Haar null set, which gives a partial positive answer to a question of Darji. We display a translation property in the homeomorphism group Homeo+[0,1] which is impossible in any nontrivial locally compact group. Other related results are peppered throughout. digital.library.unt.edu/ark:/67531/metadc271792/
 Real Analyticity of Hausdorff Dimension of Disconnected Julia Sets of Cubic Parabolic Polynomials
 Consider a family of cubic parabolic polynomials given by for nonzero complex parameters such that for each the polynomial is a parabolic polynomial, that is, the polynomial has a parabolic fixed point and the Julia set of , denoted by , does not contain any critical points of . We also assumed that for each , one finite critical point of the polynomial escapes to the superattracting fixed point infinity. So, the Julia sets are disconnected. The concern about the family is that the members of this family are generally not even biLipschitz conjugate on their Julia sets. We have proved that the parameter set is open and contains a deleted neighborhood of the origin 0. Our main result is that the Hausdorff dimension function defined by is real analytic. To prove this we have constructed a holomorphic family of holomorphic parabolic graph directed Markov systems whose limit sets coincide with the Julia sets of polynomials up to a countable set, and hence have the same Hausdorff dimension. Then we associate to this holomorphic family of holomorphic parabolic graph directed Markov systems an analytic family, call it , of conformal graph directed Markov systems with infinite number of edges in order to reduce the problem of real analyticity of Hausdorff dimension for the given family of polynomials to prove the corresponding statement for the family . digital.library.unt.edu/ark:/67531/metadc271768/
 Nonparametric Estimation of Receiver Operating Characteristic Surfaces Via Bernstein Polynomials

Access: Use of this item is restricted to the UNT Community.
Receiver operating characteristic (ROC) analysis is one of the most widely used methods in evaluating the accuracy of a classification method. It is used in many areas of decision making such as radiology, cardiology, machine learning as well as many other areas of medical sciences. The dissertation proposes a novel nonparametric estimation method of the ROC surface for the threeclass classification problem via Bernstein polynomials. The proposed ROC surface estimator is shown to be uniformly consistent for estimating the true ROC surface. In addition, it is shown that the map from which the proposed estimator is constructed is Hadamard differentiable. The proposed ROC surface estimator is also demonstrated to lead to the explicit expression for the estimated volume under the ROC surface . Moreover, the exact mean squared error of the volume estimator is derived and some related results for the mean integrated squared error are also obtained. To assess the performance and accuracy of the proposed ROC and volume estimators, MonteCarlo simulations are conducted. Finally, the method is applied to the analysis of two real data sets. digital.library.unt.edu/ark:/67531/metadc177212/  Semisupervised and Selfevolving Learning Algorithms with Application to Anomaly Detection in Cloud Computing
 Semisupervised learning (SSL) is the most practical approach for classification among machine learning algorithms. It is similar to the humans way of learning and thus has great applications in text/image classification, bioinformatics, artificial intelligence, robotics etc. Labeled data is hard to obtain in real life experiments and may need human experts with experimental equipments to mark the labels, which can be slow and expensive. But unlabeled data is easily available in terms of web pages, data logs, images, audio, video les and DNA/RNA sequences. SSL uses large unlabeled and few labeled data to build better classifying functions which acquires higher accuracy and needs lesser human efforts. Thus it is of great empirical and theoretical interest. We contribute two SSL algorithms (i) adaptive anomaly detection (AAD) (ii) hybrid anomaly detection (HAD), which are self evolving and very efficient to detect anomalies in a large scale and complex data distributions. Our algorithms are capable of modifying an existing classier by both retiring old data and adding new data. This characteristic enables the proposed algorithms to handle massive and streaming datasets where other existing algorithms fail and run out of memory. As an application to semisupervised anomaly detection and for experimental illustration, we have implemented a prototype of the AAD and HAD systems and conducted experiments in an oncampus cloud computing environment. Experimental results show that the detection accuracy of both algorithms improves as they evolves and can achieve 92.1% detection sensitivity and 83.8% detection specificity, which makes it well suitable for anomaly detection in large and streaming datasets. We compared our algorithms with two popular SSL methods (i) subspace regularization (ii) ensemble of Bayesian submodels and decision tree classifiers. Our contributed algorithms are easy to implement, significantly better in terms of space, time complexity and accuracy than these two methods for semisupervised anomaly detection mechanism. digital.library.unt.edu/ark:/67531/metadc177238/
 Connectedness and Some Concepts Related to Connectedness of a Topological Space
 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. digital.library.unt.edu/ark:/67531/metadc163958/
 Borel Sets and Baire Functions
 This paper examines the relationship between Borel sets and Baire functions. digital.library.unt.edu/ark:/67531/metadc163964/
 Regular Semigroups
 This thesis describes semigroups and the properties of both regular and inverse semigroups. digital.library.unt.edu/ark:/67531/metadc163914/
 Linear Algebras
 This paper is primarily concerned with the fundamental properties of a linear algebra of finite order over a field. A discussion of linear sets of finite order over a field is used as an introduction to these properties. digital.library.unt.edu/ark:/67531/metadc163844/
 Measure Functions
 This thesis examines measure functions. A measure function has as its domain of definition a class of sets. It also must satisfy a certain additive condition. To state a concise definition of a measure function, it is convenient to define set function and completely additive set function. digital.library.unt.edu/ark:/67531/metadc163875/
 Elliptic Geometry
 This thesis discusses elliptic geometry including the order and incidence properties, projective properties and congruence properties. digital.library.unt.edu/ark:/67531/metadc163883/
 Completing the Space of Step Functions
 In this thesis a study is made of the space X of all step functions on [0,1]. This investigation includes determining a completion space, X*, for the incomplete space X, defining integration for X*, and proving some theorems about integration in X*. digital.library.unt.edu/ark:/67531/metadc164014/
 Continuous Multifunctions
 This paper is a discussion of multifunctions, various types of continuity defined on multifunctions, and implications of continuity for the range and domain sets of the multifunctions. digital.library.unt.edu/ark:/67531/metadc164025/
 A Classification of Regular Planar Graphs
 The purpose of this paper is the investigation and classification of regular planar graphs. The motive behind this investigation was a desire to better understand those properties which allow a graph to be represented in the plane in such a manner that no two edges cross except perhaps at vertices. digital.library.unt.edu/ark:/67531/metadc164029/
 On the Stielitjes Integral
 This paper is a study of the Stieltjes integral, a generalization of the Riemann integral normally studied in introductory calculus courses. The purpose of the paper is to investigate many of the basic manipulative properties of the integral. digital.library.unt.edu/ark:/67531/metadc164008/