Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Georgia Southern University (6)
- California State University, San Bernardino (5)
- California Polytechnic State University, San Luis Obispo (4)
- Claremont Colleges (4)
- The University of Akron (3)
-
- James Madison University (2)
- Murray State University (2)
- University of Louisville (2)
- Clemson University (1)
- Colby College (1)
- East Tennessee State University (1)
- Embry-Riddle Aeronautical University (1)
- Louisiana Tech University (1)
- Missouri State University (1)
- Syracuse University (1)
- The College of Wooster (1)
- University of Kentucky (1)
- University of Lynchburg (1)
- University of New Orleans (1)
- University of South Carolina (1)
- University of Tennessee, Knoxville (1)
- Virginia Commonwealth University (1)
- Washington University in St. Louis (1)
- Western University (1)
- Keyword
-
- Machine Learning (4)
- Statistics (4)
- Mathematics (3)
- Applied Mathematics (2)
- Convolution (2)
-
- Data Science (2)
- Deep Learning (2)
- Finance (2)
- Graph Theory (2)
- Neural Networks (2)
- Abstract Algebra (1)
- Abstract algebra (1)
- Actin binding proteins (1)
- Adaptively Weighted Discriminator Generative Adversarial Network (1)
- Analysis (1)
- And medication (1)
- Anxiety* (1)
- Applied Math (1)
- Arbitrage (1)
- Assorted-Time Normalization (1)
- BCH Codes (1)
- Barcode (1)
- Basics (1)
- Basketball (1)
- Bayes' rule (1)
- Bayesian hierarchical model (1)
- Bayesian linear regression (1)
- Bernoulli (1)
- Biobjective mixed integer optimization (1)
- Bivalve (1)
- Publication Year
- Publication
-
- Electronic Theses and Dissertations (8)
- Electronic Theses, Projects, and Dissertations (5)
- CMC Senior Theses (3)
- Williams Honors College, Honors Research Projects (3)
- Doctoral Dissertations (2)
-
- Master's Theses (2)
- Murray State Theses and Dissertations (2)
- All Dissertations (1)
- Doctor of Business Administration Dissertations (1)
- Doctoral Dissertations and Master's Theses (1)
- Electronic Thesis and Dissertation Repository (1)
- HMC Senior Theses (1)
- Honors Capstone Projects - All (1)
- Honors College Theses (1)
- Honors Theses (1)
- MSU Graduate Theses (1)
- Physics (1)
- Senior Honors Projects, 2010-2019 (1)
- Senior Honors Projects, 2020-current (1)
- Senior Independent Study Theses (1)
- Senior Theses (1)
- Statistics (1)
- Theses and Dissertations (1)
- Theses and Dissertations--Mathematics (1)
- Undergraduate Theses and Capstone Projects (1)
- University of New Orleans Theses and Dissertations (1)
Articles 1 - 30 of 44
Full-Text Articles in Other Applied Mathematics
Rigid Body Constrained Motion Optimization And Control On Lie Groups And Their Tangent Bundles, Brennan S. Mccann
Rigid Body Constrained Motion Optimization And Control On Lie Groups And Their Tangent Bundles, Brennan S. Mccann
Doctoral Dissertations and Master's Theses
Rigid body motion requires formulations where rotational and translational motion are accounted for appropriately. Two Lie groups, the special orthogonal group SO(3) and the space of quaternions H, are commonly used to represent attitude. When considering rigid body pose, that is spacecraft position and attitude, the special Euclidean group SE(3) and the space of dual quaternions DH are frequently utilized. All these groups are Lie groups and Riemannian manifolds, and these identifications have profound implications for dynamics and controls. The trajectory optimization and optimal control problem on Riemannian manifolds presents significant opportunities for theoretical development. Riemannian optimization is an attractive …
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Electronic Theses, Projects, and Dissertations
Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …
Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy
Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy
Theses and Dissertations--Mathematics
The two main areas of Deep Learning are Unsupervised and Supervised Learning. Unsupervised Learning studies a class of data processing problems in which only descriptions of objects are known, without label information. Generative Adversarial Networks (GANs) have become among the most widely used unsupervised neural net models. GAN combines two neural nets, generative and discriminative, that work simultaneously. We introduce a new family of discriminator loss functions that adopts a weighted sum of real and fake parts, which we call adaptive weighted loss functions. Using the gradient information, we can adaptively choose weights to train a discriminator in the direction …
Quadratic Neural Network Architecture As Evaluated Relative To Conventional Neural Network Architecture, Reid Taylor
Quadratic Neural Network Architecture As Evaluated Relative To Conventional Neural Network Architecture, Reid Taylor
Senior Theses
Current work in the field of deep learning and neural networks revolves around several variations of the same mathematical model for associative learning. These variations, while significant and exceptionally applicable in the real world, fail to push the limits of modern computational prowess. This research does just that: by leveraging high order tensors in place of 2nd order tensors, quadratic neural networks can be developed and can allow for substantially more complex machine learning models which allow for self-interactions of collected and analyzed data. This research shows the theorization and development of mathematical model necessary for such an idea to …
An Exploration Of Voting With Partial Orders, Mason Acevedo
An Exploration Of Voting With Partial Orders, Mason Acevedo
HMC Senior Theses
In this thesis, we discuss existing ideas and voting systems in social choice theory. Specifically, we focus on the Kemeny rule and the Borda count. Then, we begin trying to understand generalizations of these voting systems in a setting where voters can submit partial rankings on their ballot, instead of complete rankings.
Role Of Inhibition And Spiking Variability In Ortho- And Retronasal Olfactory Processing, Michelle F. Craft
Role Of Inhibition And Spiking Variability In Ortho- And Retronasal Olfactory Processing, Michelle F. Craft
Theses and Dissertations
Odor perception is the impetus for important animal behaviors, most pertinently for feeding, but also for mating and communication. There are two predominate modes of odor processing: odors pass through the front of nose (ortho) while inhaling and sniffing, or through the rear (retro) during exhalation and while eating and drinking. Despite the importance of olfaction for an animal’s well-being and specifically that ortho and retro naturally occur, it is unknown whether the modality (ortho versus retro) is transmitted to cortical brain regions, which could significantly instruct how odors are processed. Prior imaging studies show different …
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 …
Reinforcement Learning: Low Discrepancy Action Selection For Continuous States And Actions, Jedidiah Lindborg
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.
An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige
An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige
All Dissertations
Multiobjective quadratic programs (MOQPs) are appealing since convex quadratic programs have elegant mathematical properties and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this work, we develop a branch and bound (BB) algorithm for solving biobjective mixed-integer quadratic programs (BOMIQPs). An algorithm of this type does not exist in the literature.
The algorithm relies on five fundamental components of the BB scheme: calculating an initial set of efficient solutions with associated Pareto points, solving node problems, fathoming, branching, and set dominance. Considering the properties of the Pareto set of …
Preconditioned Nesterov’S Accelerated Gradient Descent Method And Its Applications To Nonlinear Pde, Jea Hyun Park
Preconditioned Nesterov’S Accelerated Gradient Descent Method And Its Applications To Nonlinear Pde, Jea Hyun Park
Doctoral Dissertations
We develop a theoretical foundation for the application of Nesterov’s accelerated gradient descent method (AGD) to the approximation of solutions of a wide class of partial differential equations (PDEs). This is achieved by proving the existence of an invariant set and exponential convergence rates when its preconditioned version (PAGD) is applied to minimize locally Lipschitz smooth, strongly convex objective functionals. We introduce a second-order ordinary differential equation (ODE) with a preconditioner built-in and show that PAGD is an explicit time-discretization of this ODE, which requires a natural time step restriction for energy stability. At the continuous time level, we show …
Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang
Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang
Electronic Theses and Dissertations
While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Williams Honors College, Honors Research Projects
In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Electronic Theses, Projects, and Dissertations
In Calculus we learned that Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …
From Branches To Fibers - Investigating F-Actin Networks With Biochemistry And Mathematical Modeling, Melissa A. Riddle
From Branches To Fibers - Investigating F-Actin Networks With Biochemistry And Mathematical Modeling, Melissa A. Riddle
Senior Honors Projects, 2020-current
F-actin networks have different structures throughout the cell depending on their location or mechanical role. For example, at the leading edge of a migrating cell, F-actin is organized in a region called the lamellipodia as a branched network responsible for pushing the membrane outwards. Behind the lamellipodia is a lamellar actin network where focal adhesions and stress fibers originate, and then within the cell cortex, actin is arranged in a gel-like network. Stress fibers are an important organization of F-actin and how they arise from either the branched lamellipodia network or the gel-like cortex network is poorly understood. Our approach …
Evaluating An Ordinal Output Using Data Modeling, Algorithmic Modeling, And Numerical Analysis, Martin Keagan Wynne Brown
Evaluating An Ordinal Output Using Data Modeling, Algorithmic Modeling, And Numerical Analysis, Martin Keagan Wynne Brown
Murray State Theses and Dissertations
Data and algorithmic modeling are two different approaches used in predictive analytics. The models discussed from these two approaches include the proportional odds logit model (POLR), the vector generalized linear model (VGLM), the classification and regression tree model (CART), and the random forests model (RF). Patterns in the data were analyzed using trigonometric polynomial approximations and Fast Fourier Transforms. Predictive modeling is used frequently in statistics and data science to find the relationship between the explanatory (input) variables and a response (output) variable. Both approaches prove advantageous in different cases depending on the data set. In our case, the data …
Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins
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 …
Reduced Dataset Neural Network Model For Manuscript Character Recognition, Mohammad Anwarul Islam
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 …
General Nonlinear-Material Elasticity In Classical One-Dimensional Solid Mechanics, Ronald Joseph Giardina Jr
General Nonlinear-Material Elasticity In Classical One-Dimensional Solid Mechanics, Ronald Joseph Giardina Jr
University of New Orleans Theses and Dissertations
We will create a class of generalized ellipses and explore their ability to define a distance on a space and generate continuous, periodic functions. Connections between these continuous, periodic functions and the generalizations of trigonometric functions known in the literature shall be established along with connections between these generalized ellipses and some spectrahedral projections onto the plane, more specifically the well-known multifocal ellipses. The superellipse, or Lam\'{e} curve, will be a special case of the generalized ellipse. Applications of these generalized ellipses shall be explored with regards to some one-dimensional systems of classical mechanics. We will adopt the Ramberg-Osgood relation …
The Martingale Approach To Financial Mathematics, Jordan M. Rowley
The Martingale Approach To Financial Mathematics, Jordan M. Rowley
Master's Theses
In this thesis, we will develop the fundamental properties of financial mathematics, with a focus on establishing meaningful connections between martingale theory, stochastic calculus, and measure-theoretic probability. We first consider a simple binomial model in discrete time, and assume the impossibility of earning a riskless profit, known as arbitrage. Under this no-arbitrage assumption alone, we stumble upon a strange new probability measure Q, according to which every risky asset is expected to grow as though it were a bond. As it turns out, this measure Q also gives the arbitrage-free pricing formula for every asset on our market. In …
Pascal's Triangle, Pascal's Pyramid, And The Trinomial Triangle, Antonio Saucedo Jr.
Pascal's Triangle, Pascal's Pyramid, And The Trinomial Triangle, Antonio Saucedo Jr.
Electronic Theses, Projects, and Dissertations
Many properties have been found hidden in Pascal's triangle. In this paper, we will present several known properties in Pascal's triangle as well as the properties that lift to different extensions of the triangle, namely Pascal's pyramid and the trinomial triangle. We will tailor our interest towards Fermat numbers and the hockey stick property. We will also show the importance of the hockey stick properties by using them to prove a property in the trinomial triangle.
Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates
Developments In Multivariate Post Quantum Cryptography., Jeremy Robert Vates
Electronic Theses and Dissertations
Ever since Shor's algorithm was introduced in 1994, cryptographers have been working to develop cryptosystems that can resist known quantum computer attacks. This push for quantum attack resistant schemes is known as post quantum cryptography. Specifically, my contributions to post quantum cryptography has been to the family of schemes known as Multivariate Public Key Cryptography (MPKC), which is a very attractive candidate for digital signature standardization in the post quantum collective for a wide variety of applications. In this document I will be providing all necessary background to fully understand MPKC and post quantum cryptography as a whole. Then, I …
Simulating The Electrical Properties Of Random Carbon Nanotube Networks Using A Simple Model Based On Percolation Theory, Roberto Abril Valenzuela
Simulating The Electrical Properties Of Random Carbon Nanotube Networks Using A Simple Model Based On Percolation Theory, Roberto Abril Valenzuela
Physics
Carbon nanotubes (CNTs) have been subject to extensive research towards their possible applications in the world of nanoelectronics. The interest in carbon nanotubes originates from their unique variety of properties useful in nanoelectronic devices. One key feature of carbon nanotubes is that the chiral angle at which they are rolled determines whether the tube is metallic or semiconducting. Of main interest to this project are devices containing a thin film of randomly arranged carbon nanotubes, known as carbon nanotube networks. The presence of semiconducting tubes in a CNT network can lead to a switching effect when the film is electro-statically …
Sports Analytics With Computer Vision, Colby T. Jeffries
Sports Analytics With Computer Vision, Colby T. Jeffries
Senior Independent Study Theses
Computer vision in sports analytics is a relatively new development. With multi-million dollar systems like STATS’s SportVu, professional basketball teams are able to collect extremely fine-detailed data better than ever before. This concept can be scaled down to provide similar statistics collection to college and high school basketball teams. Here we investigate the creation of such a system using open-source technologies and less expensive hardware. In addition, using a similar technology, we examine basketball free throws to see whether a shooter’s form has a specific relationship to a shot’s outcome. A system that learns this relationship could be used to …
Decoding Book Barcode Images, Yizhou Tao
Decoding Book Barcode Images, Yizhou Tao
CMC Senior Theses
This thesis investigated a method of barcode reconstruction to address the recovery of a blurred and convoluted one-dimensional barcode. There are a lot of types of barcodes used today, such as Code 39, Code 93, Code 128, etc. Our algorithm applies to the universal barcode, EAN 13. We extend the methodologies proposed by Iwen et al. (2013) in the journal article "A Symbol-Based Algorithm for Decoding barcodes." The algorithm proposed in the paper requires a signal measured by a laser scanner as an input. The observed signal is modeled as a true signal corrupted by a Gaussian convolution, additional noises, …
Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher
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 …
Making Models With Bayes, Pilar Olid
Making Models With Bayes, Pilar Olid
Electronic Theses, Projects, and Dissertations
Bayesian statistics is an important approach to modern statistical analyses. It allows us to use our prior knowledge of the unknown parameters to construct a model for our data set. The foundation of Bayesian analysis is Bayes' Rule, which in its proportional form indicates that the posterior is proportional to the prior times the likelihood. We will demonstrate how we can apply Bayesian statistical techniques to fit a linear regression model and a hierarchical linear regression model to a data set. We will show how to apply different distributions to Bayesian analyses and how the use of a prior affects …
Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King
Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King
Electronic Theses and Dissertations
In a voting situation where there are only two competing alternatives, simple majority rule outputs the alternatives with the most votes or declares a tie if both alternatives receive the same number of votes. For any non-negative integer k, the difference of votes rule Mk outputs the alternative that beats the competing alternative by more than k votes. Llamazares (2006) gives a characterization of the difference of votes rules in terms of five axioms. In this thesis, we extend Llamazares' result by completely describing the class of voting rules that satisfy only two out of his five axioms. …
Cayley Graphs Of Groups And Their Applications, Anna Tripi
Cayley Graphs Of Groups And Their Applications, Anna Tripi
MSU Graduate Theses
Cayley graphs are graphs associated to a group and a set of generators for that group (there is also an associated directed graph). The purpose of this study was to examine multiple examples of Cayley graphs through group theory, graph theory, and applications. We gave background material on groups and graphs and gave numerous examples of Cayley graphs and digraphs. This helped investigate the conjecture that the Cayley graph of any group (except Z_2) is hamiltonian. We found the conjecture to still be open. We found Cayley graphs and hamiltonian cycles could be applied to campanology (in particular, to the …
Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson
Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson
Murray State Theses and Dissertations
We translate the RISK board into a graph which undergoes updates as the game advances. The dissection of the game into a network model in discrete time is a novel approach to examining RISK. A review of the existing statistical findings of skirmishes in RISK is provided. The graphical changes are accompanied by an examination of the statistical properties of RISK. The game is modeled as a discrete time dynamic network graph, with the various features of the game modeled as properties of the network at a given time. As the network is computationally intensive to implement, results are produced …
Triple Non-Negative Matrix Factorization Technique For Sentiment Analysis And Topic Modeling, Alexander A. Waggoner
Triple Non-Negative Matrix Factorization Technique For Sentiment Analysis And Topic Modeling, Alexander A. Waggoner
CMC Senior Theses
Topic modeling refers to the process of algorithmically sorting documents into categories based on some common relationship between the documents. This common relationship between the documents is considered the “topic” of the documents. Sentiment analysis refers to the process of algorithmically sorting a document into a positive or negative category depending whether this document expresses a positive or negative opinion on its respective topic. In this paper, I consider the open problem of document classification into a topic category, as well as a sentiment category. This has a direct application to the retail industry where companies may want to scour …