Digital Commons Network^™

Biasing Medial Axis Rapidly-Exploring Random Trees With Safe Hyperspheres, David Qin

Honors Theses

Motion planning is a challenging and widely researched problem in robotics. Motion planning algorithms aim to not only nd unobstructed paths, but also to construct paths with certain qualities, such as maximally avoiding obstacles to improve path safety. One such solution is a Rapidly-Exploring Random Tree (RRT) variant called Medial Axis RRT that generates the safest possible paths, but does so slowly. This paper introduces a RRT variant called Medial Axis Ball RRT (MABallRRT) that uses the concept of clearance -- a robot's distance from its nearest obstacle -- to efficiently construct a roadmap with safe paths. The safety of …

Almost Difference Sets In 2-Groups, Xin Yutong

Honors Theses

Difference sets have been studied for decades due to their applications in digital communication, cryptography, algebra, and number theory. More recently, mathematicians have expanded their focus to the field of almost difference sets. Almost difference sets have similar functionalities with difference sets, yet with more potential of finding new constructions. In this paper I will introduce the definitions, properties, and applications of difference sets and almost difference sets, and discuss our effort and results in the exploration of almost difference sets in cyclic and non-cyclic groups.

Positivity-Preserving Segregate-Flux Method For Infiltration Dynamics In Tumor Growth Models, Gilbert Danso Acheampong

Open Access Theses & Dissertations

We study the positivity preserving property and an incompressibility condition in a recently proposed tumor growth model as well as its numerical simulations. In this model, the biological process is described by a free-boundary problem of hyperbolic equations that govern the in-tumor motion of cancer cells and the infiltration of immune cells. Particularly, due to an assumption that cells take constant volume (the incompressibility condition), the tumor growth/shrinkage is closely correlated to the magnitude of infiltration of immune cells into the tumor.

Despite the fact that previous simulation results largely reproduced experimental data, there remain unanswered questions that are crucial …

Planar Motion Control Of A Cube Satellite Using Cold Gas Thrusters, Christian Lozoya

Open Access Theses & Dissertations

This Thesis presents a mathematical model developed for the computational simulation ofCubeSat movement using four thrusters that permit uniaxial translation and rotation. Arbitrary functions are fit to boundary conditions to simulate the force, acceleration, velocity, and displacement of the CubeSat along a plane. The model is used to derive a motion control algorithm assuming constant pressure and mass. A single model describes both translation and rotation. This Thesis also explores the relationship between propellant consumption and the time required to complete a displacement implied by the model.

Uniform Three-Class Regular Partial Steiner Triple Systems With Uniform Degrees, Prangya Rani Parida

Dissertations, Master's Theses and Master's Reports

A Partial Steiner Triple system (X, T) is a finite set of points C and a collection T of 3-element subsets of C that every pair of points intersect in at most 1 triple. A 3-class regular PSTS (3-PSTS) is a PSTS where the points can be partitioned into 3 classes (each class having size m, n and p respectively) such that no triple belongs to any class and any two points from the same class occur in the same number of triples (a, b and c respectively). The 3-PSTS is said to be uniform if m = n = …

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 …

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 …

Elementary Hyperreal Analysis, Logan Cebula

Williams Honors College, Honors Research Projects

This text explores elementary analysis through the lens of non-standard analysis. The hyperreals will be proven to be implied by the existence of the reals via the axiom of choice. The notion of a hyperextension will be defined, and the so-called Transfer Principle will be proved. This principle establishes equivalence between results in real and hyperreal analysis. Sequences, subsequences, and limit suprema/infima will then be explored. Finally, integration will be considered.

Phylogenetic Networks And Functions That Relate Them, Drew Scalzo

Williams Honors College, Honors Research Projects

Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate …

Technological Software In Mathematics, Courtney Kish

Williams Honors College, Honors Research Projects

Technology has been advancing significantly over the years. One area that has been affected is mathematics. Technological software has been developed that has allowed for mathematics to be done using software programs. For example, WebAssign allows students to complete online math homework and example practice problems, as well as watch videos to explain topics in math. However, like all things, this is not without downfalls. While this technology offers students access to online lectures and instant feedback, cheating and costly expenses also come with it.

In this research paper, I will discuss the benefits and shortcomings of different technological software …

Fast Medial Axis Sampling For Use In Motion Planning, Hanglin Zhou

Honors Theses

Motion planning is a difficult but important problem in robotics. Research has tended toward approximations and randomized algorithms, like sampling-based planning. Probabilistic RoadMaps (PRMs) are one common sampling-based planning approach, but they lack safety guarantees. One main approach, Medial Axis PRM (MAPRM) addressed this deficiency by generating robot configurations as far away from the obstacles as possible, but it introduced an extensive computational burden. We present two techniques, Medial Axis Bridge and Medial Axis Spherical Step, to reduce the computational cost of sampling in MAPRM and additionally propose recycling previously computed clearance information to reduce the cost of connection in …

Computer-Assisted Coloring-Graph Generation And Structural Analysis, Wesley Su

Honors Theses

Graphs are a well studied construction in discrete math, with one of the most common areas of study being graph coloring. The graph coloring problem asks for a color to be assigned to each vertex in a graph such that no two adjacent vertices share a color. An assignment of k colors that meets these criteria is called a k-coloring. The coloring graph Ck(G) is defined as the graph where every vertex represents a valid k-coloring of graph G and edges exist between colorings that di↵er by one vertex. We call graph G the base graph of the k-coloring graph …

Estimation And Clustering In Network And Indirect Data, Ramchandra Rimal

Electronic Theses and Dissertations, 2020-

The first part of the dissertation studies a density deconvolution problem with small Berkson errors. In this setting, the data is not available directly but rather in the form of convolution and one needs to estimate the convolution of the unknown density with Berkson errors. While it is known that the Berkson errors improve the precision of the reconstruction, it does not necessarily happen when Berkson errors are small. Furthermore, the choice of bandwidth in density estimation has been an open problem so far. In this dissertation, we provide an in-depth study of the choice of the bandwidth which leads …

Statistical Analysis Of Demographic Effects On Insurance Coverage Of Perinatal And Neonatal Morbidity, Madeline Durbin

Undergraduate Honors Thesis Projects

In the United States of America, Ohio has one of the worst neonatal and perinatal death rates. Within Ohio, Montgomery County has an above average neonatal and perinatal death rate. This statistic can be lowered if more women in Montgomery County have health insurance. They would be more likely to seek out prenatal health care, since they would no longer have to pay as much money out-of-pocket. This would allow medical professionals to be able to diagnose and treat any potential issues in the mother or child earlier. Having health insurance would also prevent mothers-to-be from seeking out other potentially …

Circuits And Cycles In Graphs And Matroids, Yang Wu

Graduate Theses, Dissertations, and Problem Reports

This dissertation mainly focuses on characterizing cycles and circuits in graphs, line graphs and matroids. We obtain the following advances.

1. Results in graphs and line graphs. For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line graph Ln(G) is panconnected. A path P is a divalent path of G if the internal vertices of P are of degree 2 in G. If every edge of P is a cut edge of G, then P is a bridge divalent path of G; …

Weighted Modulo Orientations Of Graphs, Jianbing Liu

Graduate Theses, Dissertations, and Problem Reports

This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte's 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte's 3-Flow Conjecture (1972) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. Extending Tutte's flows conjectures, Jaeger's Circular Flow Conjecture (1981) says every 4k-edge-connected graph admits a modulo (2k+1)-orientation, that is, an orientation such that the indegree is congruent to outdegree modulo (2k+1) at every vertex. Note that the k=1 case of Circular Flow Conjecture coincides with the 3-Flow Conjecture, and the case of k=2 implies the 5-Flow Conjecture. This work is devoted …

On The Dynamics And Structure Of Multiple Strain Epidemic Models And Genotype Networks, Blake Joseph Mitchell Williams

Graduate College Dissertations and Theses

Mathematical disease modeling has long operated under the assumption that any one infectious disease is caused by one transmissible pathogen. This paradigm has been useful in simplifying the biological reality of epidemics and has allowed the modeling community to focus on the complexity of other factors such as contact structure and interventions. However, there is an increasing amount of evidence that the strain diversity of pathogens, and their interplay with the host immune system, can play a large role in shaping the dynamics of epidemics.

This body of work first explores the role of strain-transcending immunity in mathematical disease models, …

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.

Estimation And Clustering In Block Models, Majid Noroozi

Electronic Theses and Dissertations, 2020-

Networks with community structure arise in many fields such as social science, biological science, and computer science. Stochastic block models are popular tools to describe such networks. For this reason, in this dissertation which is composed of two parts we explore some stochastic block models and the relationship between them. In the first part of the dissertation, we study the Popularity Adjusted Block Model (PABM) and introduce its sparse case, the Sparse Popularity Adjusted Block Model (SPABM). The SPABM is the only existing block model which allows to set some probabilities of connections to zero. For both the PABM and …

An Exploration Of The Use Of The Fibonacci Sequence In Unrelated Mathematics Disciplines, Molly E. Boodey

Honors Theses and Capstones

No abstract provided.

Some Results On A Set Of Data Driven Stochastic Wildfire Models, Maxfield E. Green

Graduate College Dissertations and Theses

Across the globe, the frequency and size of wildfire events are increasing. Research focused on minimizing wildfire is critically needed to mitigate impending humanitarian and environmental crises. Real-time wildfire response is dependent on timely and accurate prediction of dynamic wildfire fronts. Current models used to inform decisions made by the U.S. Forest Service, such as Farsite, FlamMap and Behave do not incorporate modern remotely sensed wildfire records and are typically deterministic, making uncertainty calculations difficult. In this research, we tested two methods that combine artificial intelligence with remote sensing data. First, a stochastic cellular automata that learns algebraic expressions was …

Extremal/Saturation Numbers For Guessing Numbers Of Undirected Graphs, Jo Ryder Martin

Graduate College Dissertations and Theses

Hat guessing games—logic puzzles where a group of players must try to guess the color of their own hat—have been a fun party game for decades but have become of academic interest to mathematicians and computer scientists in the past 20 years. In 2006, Søren Riis, a computer scientist, introduced a new variant of the hat guessing game as well as an associated graph invariant, the guessing number, that has applications to network coding and circuit complexity. In this thesis, to better understand the nature of the guessing number of undirected graphs we apply the concept of saturation to guessing …

Reference Governors For Time-Varying Systems And Constraints, Collin Freiheit

Graduate College Dissertations and Theses

Control systems are often subject to constraints imposed by physical limitations or safety considerations, and require means of constraint management to ensure the stability and safety of the system. For real-time implementation, constraint management schemes must not carry a heavy computational burden; however many of the current solutions are computationally unattractive, especially those with robust formulations. Thus, the design of constraint management schemes with low computational loads is an important and practical problem for control engineers. Reference Governor (RG) is an efficient constraint management scheme that is attractive for real-time implementation due to its low computational complexity and ease of …

Cycle Double Covers And Integer Flows, Zhang Zhang

Graduate Theses, Dissertations, and Problem Reports

My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture and the integer flows conjectures. This kind of problem is undoubtedly one of the major catalysts in the tremendous development of graph theory. It was observed by Tutte that the Four color problem can be formulated in terms of integer flows, as well as cycle covers. Since then, the topics of integer flows and cycle covers have always been in the main line of graph theory research. This dissertation provides several partial results on these two classes of problems.

Theory And Techniques Of Convergence Of Topological Transformation Group Actions, Murtadha Jaber Sarray

Graduate Theses, Dissertations, and Problem Reports

n this dissertation, we present new set functions called strongly limit and strongly prolongation limit sets. We show the new sets, especially strongly prolongation limit sets, characterize proper action under an arbitrary setting. That is, we characterize proper action for wider class of proper ܩ-spaces. Also, we show the new version of the sets could be derived from strongly exceptional sets which have been used as a good technique for the characterization of a proper maps. Moreover, we review properties of well-known limit sets and prolongations and properties for the new version of limit sets under an arbitrary setting on …