Physical Sciences and Mathematics Commons^™

Classification In Supervised Statistical Learning With The New Weighted Newton-Raphson Method, Toma Debnath

Electronic Theses and Dissertations

In this thesis, the Weighted Newton-Raphson Method (WNRM), an innovative optimization technique, is introduced in statistical supervised learning for categorization and applied to a diabetes predictive model, to find maximum likelihood estimates. The iterative optimization method solves nonlinear systems of equations with singular Jacobian matrices and is a modification of the ordinary Newton-Raphson algorithm. The quadratic convergence of the WNRM, and high efficiency for optimizing nonlinear likelihood functions, whenever singularity in the Jacobians occur allow for an easy inclusion to classical categorization and generalized linear models such as the Logistic Regression model in supervised learning. The WNRM is thoroughly investigated …

Problems In Chemical Graph Theory Related To The Merrifield-Simmons And Hosoya Topological Indices, William B. O'Reilly

Electronic Theses and Dissertations

In some sense, chemical graph theory applies graph theory to various physical sciences. This interdisciplinary field has significant applications to structure property relationships, as well as mathematical modeling. In particular, we focus on two important indices widely used in chemical graph theory, the Merrifield-Simmons index and Hosoya index. The Merrifield-Simmons index and the Hosoya index are two well-known topological indices used in mathematical chemistry for characterizing specific properties of chemical compounds. Substantial research has been done on the two indices in terms of enumerative problems and extremal questions. In this thesis, we survey known extremal results and consider the generalized …

Cryptography Through The Lens Of Group Theory, Dawson M. Shores

Electronic Theses and Dissertations

Cryptography has been around for many years, and mathematics has been around even longer. When the two subjects were combined, however, both the improvements and attacks on cryptography were prevalent. This paper introduces and performs a comparative analysis of two versions of the ElGamal cryptosystem, both of which use the specific field of mathematics known as group theory.

Reinforcement Learning: Low Discrepancy Action Selection For Continuous States And Actions, Jedidiah Lindborg

Electronic Theses and Dissertations

In reinforcement learning the process of selecting an action during the exploration or exploitation stage is difficult to optimize. The purpose of this thesis is to create an action selection process for an agent by employing a low discrepancy action selection (LDAS) method. This should allow the agent to quickly determine the utility of its actions by prioritizing actions that are dissimilar to ones that it has already picked. In this way the learning process should be faster for the agent and result in more optimal policies.

Numerical Approximation Of Lyapunov Exponents And Its Applications In Control Systems, Nakita K. Andrews

Electronic Theses and Dissertations

The progression of state trajectories with respect to time, and its stability properties can be described by a system of nonlinear differential equations. However, since most nonlinear dynamical systems cannot be solved by hand, one must rely on computer simulations to observe the behavior of the system. This work focuses on chaotic systems. The Lyapunov Exponent (LE) is frequently used in the quantitative studies of a chaotic system. Lyapunov exponents give the average rate of separation of nearby orbits in phase space, which can be used to determine the state of a system, e.g. stable or unstable. The objective of …

Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins

Electronic Theses and Dissertations

In biology, minimizing a free energy functional gives an equilibrium shape that is the most stable in nature. The formulation of these functionals can vary in many ways, in particular they can have either a smooth or sharp interface. Minimizing a functional can be done through variational calculus or can be proved to exist using various analysis techniques. The functionals investigated here have a smooth and sharp interface and are analyzed using analysis and variational calculus respectively. From the former we find the condition for extremum and its second variation. The second variation is commonly used to analyze stability of …

Explicit Pseudo-Kähler Metrics On Flag Manifolds, Thomas A. Mason Iii

Electronic Theses and Dissertations

The coadjoint orbits of compact Lie groups each carry a canonical (positive definite) Kähler structure, famously used to realize the group's irreducible representations in holomorphic sections of certain line bundles (Borel-Weil theorem). Less well-known are the (indefinite) invariant pseudo-Kähler structures they also admit, which can be used to realize the same representations in higher cohomology of the sections (Bott), and whose analogues in a non-compact setting lead to new representations (Kostant-Langlands). The purpose of this thesis is to give an explicit description of these metrics in the case of the unitary group G=U_n.

Artificial Neural Network Models For Pattern Discovery From Ecg Time Series, Mehakpreet Kaur

Electronic Theses and Dissertations

Artificial Neural Network (ANN) models have recently become de facto models for deep learning with a wide range of applications spanning from scientific fields such as computer vision, physics, biology, medicine to social life (suggesting preferred movies, shopping lists, etc.). Due to advancements in computer technology and the increased practice of Artificial Intelligence (AI) in medicine and biological research, ANNs have been extensively applied not only to provide quick information about diseases, but also to make diagnostics accurate and cost-effective. We propose an ANN-based model to analyze a patient's electrocardiogram (ECG) data and produce accurate diagnostics regarding possible heart diseases …

Reduced Dataset Neural Network Model For Manuscript Character Recognition, Mohammad Anwarul Islam

Electronic Theses and Dissertations

The automatic character recognition task has been of practical interest for a long time. Nowadays, there are well-established technologies and software to perform character recognition accurately from scanned documents. Although handwritten character recognition from the manuscript image is challenging, the advancement of modern machine learning techniques makes it astonishingly manageable. The problem of accurately recognizing handwritten character remains of high practical interest since a large number of manuscripts are currently not digitized, and hence inaccessible to the public. We create our repository of the datasets by cropping each letter image manually from the manuscript images. The availability of datasets is …

Taking A Canon To The Adjunction Formula, Paul M. Harrelson

Electronic Theses and Dissertations

In this paper, we show how the canonical divisor of a graph is related to the canonical divisor of its subgraph. The use of chip firing and the adjunction formula for graphs ex- plains said relation and even completes it. We go on to show the difference between the formula for full subgraphs and that of non-full subgraphs. Examples are used to simplify these results and to see the adjunction formula in action. Finally, we show that though the adjunction formula seems simple at first glance, it is somewhat complex and rather useful.

Inverse Problems Related To The Wiener And Steiner-Wiener Indices, Matthew Gentry

Electronic Theses and Dissertations

In a graph, the generalized distance between multiple vertices is the minimum number of edges in a connected subgraph that contains these vertices. When we consider such distances between all subsets of $k$ vertices and take the sum, it is called the Steiner $k$-Wiener index and has important applications in Chemical Graph Theory. In this thesis we consider the inverse problems related to the Steiner Wiener index, i.e. for what positive integers is there a graph with Steiner Wiener index of that value?

Gallai-Ramsey Number For Classes Of Brooms, Benjamin J. Hamlin

Electronic Theses and Dissertations

Given a graph $G$, we consider the problem of finding the minimum number $n$ such that any $k$ edge colored complete graph on $n$ vertices contains either a rainbow colored triangle or a monochromatic copy of the graph $G$, denoted $gr_k(K_{3}:G)$. More precisely we consider $G=B_{m,\ell}$ where $B_{m,\ell}$ is a broom graph with $m$ representing the number of vertices on the handle and $\ell$ representing the number of bristle vertices. We develop a technique to reduce the difficulty of finding $gr_{k}(K_{3}:B_{m,\ell})$, and use the technique to prove a few cases with a fixed handle length, but arbitrarily many bristles. Further, …

Conflict Free Connectivity And The Conflict-Free-Connection Number Of Graphs, Travis D. Wehmeier

Electronic Theses and Dissertations

We explore a relatively new concept in edge-colored graphs called conflict-free connectivity. A conflict-free path is a (edge-) colored path that has an edge with a color that appears only once. Conflict-free connectivity is the maximal number of internally disjoint conflict-free paths between all pairs of vertices in a graph. We also define the c-conflict-free-connection of a graph G. This is the maximum conflict-free connectivity of G over all c-colorings of the edges of G. In this paper we will briefly survey the works related to conflict-free connectivity. In addition, we will use the probabilistic method to achieve a bound …

Totally Acyclic Complexes, Holly M. Zolt

Electronic Theses and Dissertations

We consider the following question: when is every exact complex of injective modules a totally acyclic one? It is known, for example, that over a commutative Noetherian ring of finite Krull dimension this condition is equivalent with the ring being Iwanaga-Gorenstein. We give equivalent characterizations of the condition that every exact complex of injective modules (over arbitrary rings) is totally acyclic. We also give a dual result giving equivalent characterizations of the condition that every exact complex of flat modules is F-totally acyclic over an arbitrary ring.

The Relationship Between Housing Affordability And Demographic Factors: Case Study For The Atlanta Beltline, Chapman T. Lindstrom

Electronic Theses and Dissertations

Housing affordability has been a widely examined subject for populations residing in major metropolitan regions around the world. The relationship between housing affordability and the city’s demographics and its volume of urban development are important to take into consideration. In the past two decades there has been an increasing volume of literature detailing Atlanta Georgia’s large-scale redevelopment project, the Atlanta BeltLine (ABL), and its relationship with Atlanta’s Metropolitan population and housing affordability. The first objective of this paper is to study the relationship between housing affordability at two scales within the Atlanta Metropolitan Area (AMA) for both renters and homeowners. …

Homological Constructions Over A Ring Of Characteristic 2, Michael S. Nelson

Electronic Theses and Dissertations

We study various homological constructions over a ring $R$ of characteristic $2$. We construct chain complexes over a field $K$ of characteristic $2$ using polynomials rings and partial derivatives. We also provide a link from the homology of these chain complexes to the simplicial homology of simplicial complexes. We end by showing how to construct all finitely-generated commutative differential graded $R$-algebras using polynomial rings and partial derivatives.

Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher

Electronic Theses and Dissertations

Through-out military history, the need to safely and effectively allocate resources to various military operations was a task of extreme importance. Satisfying the needs of multiple consumers by optimally pairing with appropriate suppliers falls into the category of vehicle routing problems (VRP), which has been intensively studied over the years. In general, finding the optimal solution to VRP is known to be NP-hard. The proposed solutions rely on mathematical programming and the size of the problems that can be optimally solved is typically limited. In military settings, balancing the needs of multiple consumers with the current operational environment has always …

Sparse Trees With A Given Degree Sequence, Ao Shen

Electronic Theses and Dissertations

In this thesis, we consider the properties of sparse trees and summarized a certain class of trees under some constraint (including with a given degree sequence, with given number of leaves, with given maximum degree, etc.) which have maximum Wiener index and the minimum number of subtrees at the same time. Wiener index is one of the most important topological indices in chemical graph theory. Steiner k�� Wiener index can be regarded as the generalization of Wiener index, when k = 2, Steiner Wiener index is the same as Wiener index. Steiner k�� Wiener index of a tree T is …

A Journey To The Adic World, Fayadh Kadhem

Electronic Theses and Dissertations

The first idea of this research was to study a topic that is related to both Algebra and Topology and explore a tool that connects them together. That was the entrance for me to the “adic world”. What was needed were some important concepts from Algebra and Topology, and so they are treated in the first two chapters.

The reader is assumed to be familiar with Abstract Algebra and Topology, especially with Ring theory and basics of Point-set Topology.

The thesis consists of a motivation and four chapters, the third and the fourth being the main ones. In the third …

Survey Of Results On The Schrodinger Operator With Inverse Square Potential, Richardson Saint Bonheur

Electronic Theses and Dissertations

In this paper we present a survey of results on the Schrodinger operator with Inverse ¨ Square potential, L_a= −∆ + a/|x|^2 , a ≥ −( d−2/2 )^2. We briefly discuss the long-time behavior of solutions to the inter-critical focusing NLS with an inverse square potential(proof not provided). Later we present spectral multiplier theorems for the operator. For the case when a ≥ 0, we present the multiplier theorem from Hebisch [12]. The case when 0 > a ≥ −( d−2/2 )^2 was explored in [1], and their proof will be presented for completeness. No improvements on the sharpness …

Old English Character Recognition Using Neural Networks, Sattajit Sutradhar

Electronic Theses and Dissertations

Character recognition has been capturing the interest of researchers since the beginning of the twentieth century. While the Optical Character Recognition for printed material is very robust and widespread nowadays, the recognition of handwritten materials lags behind. In our digital era more and more historical, handwritten documents are digitized and made available to the general public. However, these digital copies of handwritten materials lack the automatic content recognition feature of their printed materials counterparts. We are proposing a practical, accurate, and computationally efficient method for Old English character recognition from manuscript images. Our method relies on a modern machine learning …

A Survey Of Clustering Analysis And Clustering Analysis In Graphs, Raven D. Gilmore

Electronic Theses and Dissertations

Clustering analysis is an important topic in data mining, where data points that are similar to each other are grouped together. Graph clustering deals with clustering analysis of data points that correspond to vertices on a graph. We first survey some most well known algorithms for clustering analysis. Then for graph clustering we note that one of the fundamental factors is the distance measure between vertices. We further examine various known venues for defining such measures and propose some others.

Optimization Methods For Tabular Data Protection, Iryna Petrenko

Electronic Theses and Dissertations

In this thesis we consider a minimum distance Controlled Tabular Adjustment (CTA) model for statistical disclosure limitation (control) of tabular data. The goal of the CTA model is to find the closest safe table to some original tabular data set that contains sensitive information. The measure of closeness is usually measured using l₁ or l₂ norm; with each measure having its advantages and disadvantages. According to the given norm CTA can be formulated as an optimization problem: Liner Programing (LP) for l₁, Quadratic Programing (QP) for l₂. In this thesis we present an alternative …

A Quantum Astrochemical Perspective On The C-C3h Radical With Application To The Interstellar Medium, Matthew Bassett

Electronic Theses and Dissertations

The interstellar medium (ISM) has been an area of focus for astrochemists and quantum chemists for many years, with particular interest in the presence of interstellar molecules and the resulting chemical processes. The c-C3H radical has been detected in the ISM near the dark molecular cloud TMC-1. With the application of ab initio computational methods using coupled-cluster theory at the singles, doubles, and perturbative triples [CCSD(T)] level, highly accurate quartic force fields (QFFs) are constructed to define the electronic wavefunction for the inter nuclear Hamiltonian. The QFF is used to predict the equilibrium geometry and produce vibrational frequencies, rotational constants, …

Dynamics Of Gene Networks In Cancer Research, Paul Scott

Electronic Theses and Dissertations

Cancer prevention treatments are being researched to see if an optimized treatment schedule would decrease the likelihood of a person being diagnosed with cancer. To do this we are looking at genes involved in the cell cycle and how they interact with one another. Through each gene expression during the life of a normal cell we get an understanding of the gene interactions and test these against those of a cancerous cell. First we construct a simplified network model of the normal gene network. Once we have this model we translate it into a transition matrix and force changes on …

A Journey To Fuzzy Rings, Brett T. Ernst

Electronic Theses and Dissertations

Enumerative geometry is a very old branch of algebraic geometry. In this thesis, we will describe several classical problems in enumerative geometry and their solutions in order to motivate the introduction of tropical geometry. Finally, fuzzy rings, a powerful algebraic framework for tropical and algebraic geometry is introduced.

Fiber Products In Commutative Algebra, Keller Vandebogert

Electronic Theses and Dissertations

The purpose of this thesis is to introduce and illustrate some of the deep connections between commutative and homological algebra. We shall cover some of the fundamental definitions and introduce several important classes of commutative rings. The later chapters will consider a particular class of rings, the \emph{fiber product}, and, among other results, show that any Gorenstein fiber product is precisely a one dimensional hypersurface. It will also be shown that any Noetherian local ring with a (nontrivially) decomposable maximal ideal satisfies the Auslander-Reiten conjecture. To conclude, generalizations of results by Takahashi and Atkins-Vraciu shall be presented.

Pattern Containment In Circular Permutations, Charles Lanning

Electronic Theses and Dissertations

Pattern containment in permutations, as opposed to pattern avoidance, involves two aspects. The first is to contain every pattern at least once from a given set, known as finding superpatterns; while the second is to contain some given pattern as many times as possible, known as pattern packing. In this thesis, we explore these two questions in circular permutations and present some interesting observations. We also raise some questions and propose some directions for future study.

Graph Invariants Of Trees With Given Degree Sequence, Rachel Bass

Electronic Theses and Dissertations

Graph invariants are functions defined on the graph structures that stay the same under taking graph isomorphisms. Many such graph invariants, including some commonly used graph indices in Chemical Graph Theory, are defined on vertex degrees and distances between vertices. We explore generalizations of such graph indices and the corresponding extremal problems in trees. We will also briefly mention the applications of our results.

Combinatorics Of Compositions, Meghann M. Gibson

Electronic Theses and Dissertations

Integer compositions and related enumeration problems have been extensively studied. The cyclic analogues of such questions, however, have significantly fewer results. In this thesis, we follow the cyclic construction of Flajolet and Soria to obtain generating functions for cyclic compositions and n-color cyclic compositions with various restrictions. With these generating functions we present some statistics and asymptotic formulas for the number of compositions and parts in such compositions. Combinatorial explanations are also provided for many of the enumerative observations presented.