Open Access. Powered by Scholars. Published by Universities.®

Other Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

PDF

Georgia Southern University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1 - 19 of 19

Full-Text Articles in Other Mathematics

Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov Jun 2022

Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov

Theory and Applications of Graphs

Let (X, d) be a semimetric space and let G be a graph. We say that G is the diametrical graph of (X, d) if X is the vertex set of G and the adjacency of vertices x and y is equivalent to the equality diam X = d(x, y). It is shown that a semimetric space (X, d) with diameter d* is ultrametric if the diametrical graph of (X, d ε) with d ε (x, y) = min{d(x, y), ε} is complete multipartite for every ε ∈ (0, d* …


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

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.


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

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 …


Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins Jan 2020

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 …


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

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 …


Group Theory And Particles, Elizabeth V. Hawkins Nov 2018

Group Theory And Particles, Elizabeth V. Hawkins

Honors College Theses

We begin by a brief overview of the notion of groups and Lie groups. We then explain what group representations are and give their main properties. Finally, we show how group representation form a natural framework to understand the Standard Model of physics.


Building A Better Risk Prevention Model, Steven Hornyak Mar 2018

Building A Better Risk Prevention Model, Steven Hornyak

National Youth Advocacy and Resilience Conference

This presentation chronicles the work of Houston County Schools in developing a risk prevention model built on more than ten years of longitudinal student data. In its second year of implementation, Houston At-Risk Profiles (HARP), has proven effective in identifying those students most in need of support and linking them to interventions and supports that lead to improved outcomes and significantly reduces the risk of failure.


Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher Jan 2018

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 …


Optimization Methods For Tabular Data Protection, Iryna Petrenko Jan 2017

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 l1 or l2 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 l1, Quadratic Programing (QP) for l2. In this thesis we present an alternative …


Drawing Numbers And Listening To Patterns, Loren Zo Haynes Apr 2016

Drawing Numbers And Listening To Patterns, Loren Zo Haynes

Honors College Theses

The triangular numbers is a series of number that add the natural numbers. Parabolic shapes emerge when this series is placed on a lattice, or imposed with a limited number of columns that causes the sequence to continue on the next row when it has reached the kth column. We examine these patterns and construct proofs that explain their behavior. We build off of this to see what happens to the patterns when there is not a limited number of columns, and we formulate the graphs as musical patterns on a staff, using each column as a line or space …


Gallai-Ramsey And Vertex Proper Connection Numbers, Emily C. Chizmar Apr 2015

Gallai-Ramsey And Vertex Proper Connection Numbers, Emily C. Chizmar

Honors College Theses

Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number N such that every coloring of G using exactly k colors contains either a rainbow triangle or a monochromatic star on t vertices. This number is known for small cases and generalized for larger cases for a fixed k. Second, we introduce the vertex proper connection number of a graph and provide a relationship to the chromatic number of minimally connected subgraphs. Also a notion of total proper connection is introduced and a question is asked about a possible relationship between the total proper …


Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr. Jan 2015

Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.

Electronic Theses and Dissertations

The purpose of this thesis is to introduce a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as Domineering. Please note that this document contains color images so please keep that in mind when printing.


Teacher Influence On Elementary School Students’ Participation In Science, Technology, Engineering, And Mathematics, Courtney Hartman Jan 2015

Teacher Influence On Elementary School Students’ Participation In Science, Technology, Engineering, And Mathematics, Courtney Hartman

Honors College Theses

The purpose of this study is to explore the influence of elementary school teachers on encouraging students’ interest and participation in Science, Technology, Engineering, and Mathematics. The researcher sought to understand what methods teachers use in their classrooms to encourage students to participate in STEM subjects and programs. This mixed methods study consisted of a questionnaire to collect quantitative data, as well as an interview of selected teachers who participated in the questionnaire to collect qualitative data. The data was analyzed to determine the overall perceptions of teachers regarding the importance of encouraging students to participate in STEM. The qualitative …


Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen Jan 2015

Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen

Electronic Theses and Dissertations

In this thesis, we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some centering steps (at most three in practice). The improved version guarantees that after one feasibility step, the new iterated point is feasible and close enough to central path. Thus, the centering steps are eliminated. This improvement is based on the Lemma(Roos, 2015). Thanks to this lemma, proximity …


Analysis Of Resource Allocation Through Game Theory, Brittney L. Benzio Apr 2014

Analysis Of Resource Allocation Through Game Theory, Brittney L. Benzio

Honors College Theses

Game theory presents a set of decision-makers in a model in order to simulate how they will interact according to a set of rules. The game is set up with a set of players, actions, and preferences. The model allows each player to, in some way, be affected by the actions of all players. Nash equilibrium illustrates that the best action for any given player depends on the other players’ actions, and so, each player must make some assumption about what the competition will do. The goal of this project is to model situations of different car companies to improve …


Structure Vs. Properties Using Chemical Graph Theory, Tabitha N. Williford Jan 2014

Structure Vs. Properties Using Chemical Graph Theory, Tabitha N. Williford

Electronic Theses and Dissertations

Chemical graph theory began as a way for mathematicians to bring together the areas of the Physical Sciences and Mathematics. Through its use, mathematicians are able to model chemical systems, predict their properties as well as structure-property relationships. In this dissertation, we consider two questions involving chemical graph theory and its applications. We first look at tree-like polyphenyl systems, which form an important family of compounds in Chemistry, particularly in Material Science. The importance can be seen in LEDs, transmitters, and electronics. In recent years, many extremal results regarding such systems under specific constraints have been reported. More specifically are …


Elements Of Convergence Approach Theory, William D. Trott Jan 2014

Elements Of Convergence Approach Theory, William D. Trott

Electronic Theses and Dissertations

We introduce two generalizations to convergence approach spaces of classical results characterizing regularity of a convergence space in terms of continuous extensions of maps on one hand, and in terms of continuity of limits for the continuous convergence on the other. Characterizations are obtained for two alternative extensions of reg- ularity to convergence-approach spaces: regularity and strong regularity. Along the way, we give a brief overview of the theory of convergence spaces and of convergence approach spaces.


Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva Jan 2014

Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva

Electronic Theses and Dissertations

Epistasis is the interaction between two or more genes to control a single phenotype. We model epistasis of the prey in a two-locus two-allele problem in a basic predator- prey relationship. The resulting model allows us to examine both population sizes as well as genotypic and phenotypic frequencies. In the context of several numerical examples, we show that if epistasis results in an undesirable or desirable phenotype in the prey by making the particular genotype more or less susceptible to the predator or dangerous to the predator, elimination of undesirable phenotypes and then genotypes occurs.


The Distribution Of Individual Stock Returns In A Modified Black-Scholes Option Pricing Model, Daniel Lee Richey Jan 2012

The Distribution Of Individual Stock Returns In A Modified Black-Scholes Option Pricing Model, Daniel Lee Richey

Electronic Theses and Dissertations

Author's abstract: There have been many attempts to find a model that can accurately price options. These models are built on many assumptions, including which probability distribution stock returns follow. In this paper, we test several distributions to see which best fit the log returns of 20 different companies over a period between November 1, 2006 to October 31, 2011. If a "best" distribution is found, a modified Black-Scholes model will be defined by modifying the Weiner process. We use Monte Carlo simulations to generate estimated prices under specified parameters, and compare these prices to those simulated by the model …