Digital Commons Network^™

Statistical Linear Mixed Models For Evaluation Of Training Program In Hand Surgery Chief Residents, Zoe Michelle Ross

Honors Theses

Resident clinics (RCs) are intended to catalyze the achievement of educational milestones through progressively autonomous patient care. However, few studies quantify their effect on competency-based surgical education, and no previous publications focus on hand surgery RCs. This study aims to use statistical theories and knowledge of descriptive statistics and inference statistics, such as confidence intervals, two sample t-tests, correlation and association tests, as well as statistical model building such as analysis of variance with random effects and mixed linear models. We hypothesize that the higher a resident’s training years, the higher the autonomy score (quality of surgery) will be. We …

The Axiom Of Choice In Topology, Ruoxuan Jia

Honors Theses

Cantor believed that properties holding for finite sets might also hold for infinite sets. One such property involves choices; the Axiom of Choice states that we can always form a set by choosing one element from each set in a collection of pairwise disjoint non-empty sets. Since its introduction in 1904, this seemingly simple statement has been somewhat controversial because it is magically powerful in mathematics in general and topology in particular. In this paper, we will discuss some essential concepts in topology such as compactness and continuity, how special topologies such as the product topology and compactification are defined, …

Choice Of Choice: Paradoxical Results Surrounding Of The Axiom Of Choice, Connor Hurley

Honors Theses

When people think of mathematics they think "right or wrong," "empirically correct" or "empirically incorrect." Formalized logically valid arguments are one important step to achieving this definitive answer; however, what about the underlying assumptions to the argument? In the early 20th century, mathematicians set out to formalize these assumptions, which in mathematics are known as axioms. The most common of these axiomatic systems was the Zermelo-Fraenkel axioms. The standard axioms in this system were accepted by mathematicians as obvious, and deemed by some to be sufficiently powerful to prove all the intuitive theorems already known to mathematicians. However, this system …

Bitcoin Volatility And Currency Acceptance: A Time-Series Approach, Francis Rocco

Honors Theses

Virtual currencies emerged in 2009 as alternatives to traditional methods of payment, offering faster transaction speeds and increased privacy. The prime example of these currencies is Bitcoin. Prior literature in the past five years has generally predicted that bitcoin would fail to supplant an existing widely traded currency, but the volatility of the currency has been decreasing since then. I test Dowd and Greenaway’s (1993) currency acceptance model using recent data on Bitcoin, including Bitcoin volatility. This paper will show whether Bitcoin's ability to act as a store of value and its level of price volatility affect the number of …

An Investigation Of The Four Vertex Theorem And Its Converse, Rebeka Kelmar

Honors Theses

In the study of curves there are many interesting theorems. One such theorem is the four vertex theorem and its converse. The four vertex theorem says that any simple closed curve, other than a circle, must have four vertices. This means that the curvature of the curve must have at least four local maxima/minima. In my project I explore different proofs of the four vertex theorem and its history. I also look at a modified converse of the four vertex theorem which says that any continuous real- valued function on the circle that has at least two local maxima and …

Elliptic Curve Cryptology, Francis Rocco

Honors Theses

In today's digital age of conducting large portions of daily life over the Internet, privacy in communication is challenged extremely frequently and confidential information has become a valuable commodity. Even with the use of commonly employed encryption practices, private information is often revealed to attackers. This issue motivates the discussion of cryptology, the study of confidential transmissions over insecure channels, which is divided into two branches of cryptography and cryptanalysis. In this paper, we will first develop a foundation to understand cryptography and send confidential transmissions among mutual parties. Next, we will provide an expository analysis of elliptic curves and …

The Elvis Problem A Minimal Time Problem With Constant Dynamics, Emily Ribando-Gros

Honors Theses

No abstract provided.

The Regularity Lemma And Its Applications, Elizabeth Sprangel

Honors Theses

The regularity lemma (also known as Szemerédi's Regularity Lemma) is one of the most powerful tools used in extremal graph theory. In general, the lemma states that every graph has some structure. That is, every graph can be partitioned into a finite number of classes in a way such that the number of edges between any two parts is “regular." This thesis is an introduction to the regularity lemma through its proof and applications. We demonstrate its applications to extremal graph theory, Ramsey theory, and number theory.

Sum-Defined Colorings In Graphs, James Hallas

Honors Theses

There have been numerous studies using a variety of methods for the purpose of uniquely distinguishing every two adjacent vertices of a graph. Many of these methods have involved graph colorings. The most studied colorings are proper colorings. A proper coloring of a graph G is an assignment of colors to the vertices of G such that adjacent vertices are assigned distinct colors. The minimum number of colors required in a proper coloring of G is the chromatic number of G. In our work, we introduce a new coloring that induces a (nearly) proper coloring. Two vertices u and …

War Gaming Applications For Achieving Optimum Acquisition Of Future Space, Karel Marshall

Honors Theses

In 2014, the federal government spent nearly half a trillion dollars on contractor projects. The Department of Defense wants to develop an algorithm to optimize the acquisition of new technologies. This project makes us of game theory, probability and statistics, non-linear programming and mathematical models to model negotiations between governmental agencies and private contractors. If focuses on generating the optimum solution and its corresponding acquisition strategy for different contract types. This project culminates in a collection of MATLAB (MathWorks) programs and the newly developed strategy shows strong convergence to Nash equilibrium values and successful selection of optimum solutions.

Extending Uniqueness Implies Existence Results To Fractional Differential Equations, Tyler Masthay

Honors Theses

In 1967, Andrzej Lasota and Zdzisław Opial proved that under sufficient conditions, uniqueness of solutions for boundary value problems for a second-order ordinary differential equation implies their existence. Lloyd Jackson and Keith Schrader then proved an extension of this result for boundary value problems of third order. In proving the third-order case, this compactness theorem is applied as a key part of the proof. It states that under sufficient conditions, uniform boundedness of a sequence of solutions on a compact domain implies existence of a subsequence which converges uniformly with respect to its zeroth, first, and second derivatives. We present …

Tying The Knot: Applications Of Topology To Chemistry, Tarini S. Hardikar

Honors Theses

Chirality (or handedness) is the property that a structure is “different” from its mirror image. Topology can be used to provide a rigorous framework for the notion of chirality. This project examines various types of chirality and discusses tools to detect chirality in graphs and knots. Notable theorems that are discussed in this work include ones that identify chirality using properties of link polynomials (HOMFLY polynomials), rigid vertex graphs, and knot linking numbers. Various other issues of chirality are explored, and some specially unique structures are discussed. This paper is borne out of reading Dr. Erica Flapan’s book, When Topology …

Elliptic Curve Cryptography And Quantum Computing, Emily Alderson

Honors Theses

In the year 2007, a slightly nerdy girl fell in love with all things math. Even though she only was exposed to a small part of the immense field of mathematics, she knew that math would always have a place in her heart. Ten years later, that passion for math is still burning inside. She never thought she would be interested in anything other than strictly mathematics. However, she discovered a love for computer science her sophomore year of college. Now, she is graduating college with a double major in both mathematics and computer science.

This nerdy girl is me. …

Normal Surfaces And 3-Manifold Algorithms, Josh D. Hews

Honors Theses

This survey will develop the theory of normal surfaces as they apply to the S3 recognition algorithm. Sections 2 and 3 provide necessary background on manifold theory. Section 4 presents the theory of normal surfaces in triangulations of 3-manifolds. Section 6 discusses issues related to implementing algorithms based on normal surfaces, as well as an overview of the Regina, a program that implements many 3-manifold algorithms. Finally section 7 presents the proof of the 3-sphere recognition algorithm and discusses how Regina implements the algorithm.

A Study Of Conductance For A Random, Hierarchically-Structured Material, Daniel Salvador

Honors Theses

I consider a mathematical model for the conductance of a system formed by a hi- erarchical network of random bonds. My simulations show that the net conductance converges to a fixed number γ ≈ 0.35337 when the conductances of the bonds are num- bers selected uniformly at random from the interval (0,1). By linearly approximating the model around γ, I derive a new simplified model which I then study in rigorous mathematical detail. I prove a generalized central limit theorem for the new linearized system.

Some Examples Of The Interplay Between Algebra And Topology, Joseph D. Malionek

Honors Theses

This thesis presents several undergraduate and graduate level concepts in the fields of algebraic topology and topological group theory in a manner which requires very little mathematical background of the reader. It uses non-rigorous interpretations of concepts while introducing the reader to the rigorous ideas with which they are associated. In order to give the reader an idea of how the fields of algebra and topology are closely affiliated, the paper goes over five main concepts, the fundamental group, homology, cohomology, Eilenberg-Maclane spaces, and group dimension.

Quantum Groups And Knot Invariants, Greg A. Hamilton

Honors Theses

Knot theory arguably holds claim to the title of the mathematical discipline with the most unusually diverse applications. A knot can be defined topologically as an embedding of S1 in R3. Naturally, two knots are topologically equivalent if one cannot be smoothly deformed into the other. The question of whether two knots are equivalent is highly non-trivial, and so the question of knot invariants used to distinguish knots has occupied knot theorists for over a century. Knot theory has found application in statistical mechanics [1], symbolic logic and set theory [2], quantum fi theory [3], quantum computing [4], etc. …

A New Almost Difference Set Construction, David Clayton

Honors Theses

This paper considers the appearance of almost difference sets in non-abelian groups. While numerous construction methods for these structures are known in abelian groups, little is known about ADSs in the case where the group elements do not commute. This paper presents a construction method for combining abelian difference sets into nonabelian almost difference sets, while also showing that at least one known almost difference set construction can be generalized to the nonabelian case.

Differential Privacy For Growing Databases, Gi Heung (Robin) Kim

Honors Theses

Differential privacy [DMNS06] is a strong definition of database privacy that provides indi- viduals in a database with the guarantee that any particular person’s information has very little effect on the output of any analysis of the overall database. In order for this type of analysis to be practical, it must simultaneously preserve privacy and utility, where utility refers to how well the analysis describes the contents of the database.

An analyst may additionally wish to evaluate how a database’s composition changes over time. Consider a company, for example, that accumulates data from a growing base of customers. This company …

Differential Equations Models Of Pathogen-Induced Single- And Multi-Organ Tissue Damage, Fiona Lynch

Honors Theses

The rise of antibiotic resistance has created a significant burden on healthcare systems around the world. Antibiotic resistance arises from the increased use of antibiotic drugs and antimicrobial agents, which kill susceptible bacterial strains, but have little effect on strains that have a mutation allowing them to survive antibiotic treatment, defined as “resistant” strains. With no non-resistant bacteria to compete for resources, the resistant bacteria thrives in this environment, continuing to reproduce and infect the host with an infection that does not respond to traditional antibiotic treatment.

A number of strategies have been proposed to tackle the problem of antibiotic …

Toward A Scientific Investigation Of Convolutional Neural Networks, Anh Tran

Honors Theses

This thesis does not assume the reader is familiar with artificial neural networks. However, to keep the thesis concise, it assumes the reader is familiar with the standard Machine Learning concepts of training set, validation set, and test set [1]. Their usage is intended to help ensure that the Machine Learning system can generalize its training from input examples used during its training to “similar” kinds of examples never used during its training.

The concept of a Convolutional Neural Network (CNN) is one of the most successful computational concepts today for solving image classification problems. However, CNNs are difficult and …

The Largest Bond In 3-Connected Graphs, Melissa Flynn

Honors Theses

A graph G is connected if given any two vertices, there is a path between them. A bond B is a minimal edge set in G such that G − B has more components than G. We say that a connected graph is dual Hamiltonian if its largest bond has size |E(G)|−|V (G)|+2. In this thesis we verify the conjecture that any simple 3-connected graph G has a largest bond with size at least Ω(nlog32) (Ding, Dziobiak, Wu, 2015 [3]) for a variety of graph classes including planar graphs, complete graphs, ladders, Mo ̈bius ladders and circular ladders, complete bipartite …