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

Mathematics Commons

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

Articles 1 - 7 of 7

Full-Text Articles in Mathematics

Individual Based Model To Simulate The Evolution Of Insecticide Resistance, William B. Jamieson Dec 2019

Individual Based Model To Simulate The Evolution Of Insecticide Resistance, William B. Jamieson

Department of Mathematics: Dissertations, Theses, and Student Research

Insecticides play a critical role in agricultural productivity. However, insecticides impose selective pressures on insect populations, so the Darwinian principles of natural selection predict that resistance to the insecticide is likely to form in the insect populations. Insecticide resistance, in turn, severely reduces the utility of the insecticides being used. Thus there is a strong economic incentive to reduce the rate of resistance evolution. Moreover, resistance evolution represents an example of evolution under novel selective pressures, so its study contributes to the fundamental understanding of evolutionary theory.

Insecticide resistance often represents a complex interplay of multiple fitness trade-offs for individual …


Bioinformatic Game Theory And Its Application To Cluster Multi-Domain Proteins, Brittney Keel May 2015

Bioinformatic Game Theory And Its Application To Cluster Multi-Domain Proteins, Brittney Keel

Department of Mathematics: Dissertations, Theses, and Student Research

The exact evolutionary history of any set of biological sequences is unknown, and all phylogenetic reconstructions are approximations. The problem becomes harder when one must consider a mix of vertical and lateral phylogenetic signals. In this dissertation we propose a game-theoretic approach to clustering biological sequences and analyzing their evolutionary histories. In this context we use the term evolution as a broad descriptor for the entire set of mechanisms driving the inherited characteristics of a population. The key assumption in our development is that evolution tries to accommodate the competing forces of selection, of which the conservation force seeks to …


The Neural Ring: Using Algebraic Geometry To Analyze Neural Codes, Nora Youngs Aug 2014

The Neural Ring: Using Algebraic Geometry To Analyze Neural Codes, Nora Youngs

Department of Mathematics: Dissertations, Theses, and Student Research

Neurons in the brain represent external stimuli via neural codes. These codes often arise from stimulus-response maps, associating to each neuron a convex receptive field. An important problem confronted by the brain is to infer properties of a represented stimulus space without knowledge of the receptive fields, using only the intrinsic structure of the neural code. How does the brain do this? To address this question, it is important to determine what stimulus space features can - in principle - be extracted from neural codes. This motivates us to define the neural ring and a related neural ideal, algebraic objects …


Combinatorial And Algebraic Coding Techniques For Flash Memory Storage, Kathryn A. Haymaker Apr 2014

Combinatorial And Algebraic Coding Techniques For Flash Memory Storage, Kathryn A. Haymaker

Department of Mathematics: Dissertations, Theses, and Student Research

Error-correcting codes are used to achieve reliable and efficient transmission when storing or sending information across a noisy channel. This thesis investigates a mathematical approach to coding techniques for storage devices such as flash memory storage, although many of the resulting codes and coding schemes can be applied in other contexts. The main contributions of this work include the design of efficient codes and decoding algorithms using discrete structures such as graphs and finite geometries, and developing a variety of strategies for adapting codes to a multi-level setting.

Information storage devices are prone to errors over time, and the frequency …


Random Search Models Of Foraging Behavior: Theory, Simulation, And Observation., Ben C. Nolting Dec 2013

Random Search Models Of Foraging Behavior: Theory, Simulation, And Observation., Ben C. Nolting

Department of Mathematics: Dissertations, Theses, and Student Research

Many organisms, from bacteria to primates, use stochastic movement patterns to find food. These movement patterns, known as search strategies, have recently be- come a focus of ecologists interested in identifying universal properties of optimal foraging behavior. In this dissertation, I describe three contributions to this field. First, I propose a way to extend Charnov's Marginal Value Theorem to the spatially explicit framework of stochastic search strategies. Next, I describe simulations that compare the efficiencies of sensory and memory-based composite search strategies, which involve switching between different behavioral modes. Finally, I explain a new behavioral analysis protocol for identifying the …


Modeling And Mathematical Analysis Of Plant Models In Ecology, Eric A. Eager Jun 2012

Modeling And Mathematical Analysis Of Plant Models In Ecology, Eric A. Eager

Department of Mathematics: Dissertations, Theses, and Student Research

Population dynamics tries to explain in a simple mechanistic way the variations of the size and structure of biological populations. In this dissertation we use mathematical modeling and analysis to study the various aspects of the dynamics of plant populations and their seed banks.

In Chapter 2 we investigate the impact of structural model uncertainty by considering different nonlinear recruitment functions in an integral projection model for Cirsium canescens. We show that, while having identical equilibrium populations, these two models can elicit drastically different transient dynamics. We then derive a formula for the sensitivity of the equilibrium population to …


On Morrey Spaces In The Calculus Of Variations, Kyle Fey May 2011

On Morrey Spaces In The Calculus Of Variations, Kyle Fey

Department of Mathematics: Dissertations, Theses, and Student Research

We prove some global Morrey regularity results for almost minimizers of functionals of the form u → ∫Ω f(x, u, ∇u)dx. This regularity is valid up to the boundary, provided the boundary data are sufficiently regular. The main assumption on f is that for each x and u, the function f(x, u, ·) behaves asymptotically like the function h(|·|)α(x), where h is an N-function.

Following this, we provide a characterization of the class of Young measures that can be generated by a sequence …