Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- BCH Codes (1)
- Cardiac arrhythmia (1)
- Combinatorial Optimization (1)
- Cooper's Philosophy (1)
- Cyclic Codes (1)
-
- Detection (1)
- Distance (1)
- Fraud (1)
- Game Provider (1)
- General Error Locator Polynomials (1)
- Gröbner Bases (1)
- Heuristic (1)
- Insurance (1)
- K-NN (1)
- Knapsack Problem (1)
- Linearization (1)
- Machine learning (1)
- Markov Chain (1)
- Multi-stage Tournament (1)
- Nonlinear Optimization (1)
- One-dimensional spiral waves (1)
- Online games (1)
- Operations Research (1)
- Representation Theory (1)
- Revenue per Game (1)
- Stationary Form (1)
- Ten Tusscher (1)
- Tran-sition Matrix (1)
- Wave reflections (1)
Articles 1 - 6 of 6
Full-Text Articles in Other Applied Mathematics
Wave Reflections In A Biophysically Detailed Model Of Cardiac Tissue, Grace Moberg
Wave Reflections In A Biophysically Detailed Model Of Cardiac Tissue, Grace Moberg
Honors Theses
Regular heart rhythms are governed by the coordinated spread of action potentials through cardiac tissue. The interaction of an action potential with a tissue heterogeneity may lead to a reflection, where both a retrograde and an anterograde wave propagate off of the initial impulse. Reflections have been experimentally linked to cardiac arrhythmias, but their mechanisms of generation are not well-understood. Mathematically, reflections in phenomenological models of cardiac tissue have been linked to an unstable periodic orbit. These models typically sacrifice detail about the variety of ionic currents and processes involved in action potential propagation in favor of mathematical simplicity. Biophysically …
The Precedence-Constrained Quadratic Knapsack Problem, Changkun Guan
The Precedence-Constrained Quadratic Knapsack Problem, Changkun Guan
Honors Theses
This thesis investigates the previously unstudied Precedence-Constrained Quadratic Knapsack Problem (PC-QKP), an NP-hard nonlinear combinatorial optimization problem. The PC-QKP is a variation of the traditional Knapsack Problem (KP) that introduces several additional complexities. By developing custom exact and approximate solution methods, and testing these on a wide range of carefully structured PC-QKP problem instances, we seek to identify and understand patterns that make some cases easier or harder to solve than others. The findings aim to help develop better strategies for solving this and similar problems in the future.
Fine-Tuning A 𝑘-Nearest Neighbors Machine Learning Model For The Detection Of Insurance Fraud, Alliyah Stout
Fine-Tuning A 𝑘-Nearest Neighbors Machine Learning Model For The Detection Of Insurance Fraud, Alliyah Stout
Honors Theses
Billions of dollars are lost within insurance companies due to fraud. Large money losses force insurance companies to increase premium costs and/or restrict policies. This negatively affects a company’s loyal customers. Although this is a prevalent problem, companies are not urgently working toward bettering their machine learning algorithms. Underskilled workers paired with inefficient computer algorithms make it difficult to accurately and reliably detect fraud.
The goal of this study is to understand the idea of -Nearest Neighbors ( -NN) and to use this classification technique to accurately detect fraudulent auto insurance claims. Using -NN requires choosing a value and a …
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Honors Theses
In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …
Representation Theory And Its Applications In Physics, Jakub Bystrický
Representation Theory And Its Applications In Physics, Jakub Bystrický
Honors Theses
Representation theory is a branch of mathematics that allows us to represent elements of a group as elements of a general linear group of a chosen vector space by means of a homomorphism. The group elements are mapped to linear operators and we can study the group using linear algebra. This ability is especially useful in physics where much of the theories are captured by linear algebra structures. This thesis reviews key concepts in representation theory of both finite and infinite groups. In the case of finite groups we discuss equivalence, orthogonality, characters, and group algebras. We discuss the importance …
Probabilistic Analysis Of Revenues In Online Games, Nishchal Sapkota
Probabilistic Analysis Of Revenues In Online Games, Nishchal Sapkota
Honors Theses
Online games are captivating and engage users across the world. Some game formats maintain a pseudo-currency to give incentive to the players to play the game in search of rewards as set by the game provider. We model a multi-stage online game and predict how much revenue game providers obtain per game. We compare the revenues generated from different tournament formats to find the one with the maximum per-game revenue for the provider. We have also found the limiting value of the revenue as the game provider increases the number of stages.
Our methods are based on concepts of the …