Matching Items (68)
Filtering by

Clear all filters

148207-Thumbnail Image.png
Description

Optimal foraging theory provides a suite of tools that model the best way that an animal will <br/>structure its searching and processing decisions in uncertain environments. It has been <br/>successful characterizing real patterns of animal decision making, thereby providing insights<br/>into why animals behave the way they do. However, it does

Optimal foraging theory provides a suite of tools that model the best way that an animal will <br/>structure its searching and processing decisions in uncertain environments. It has been <br/>successful characterizing real patterns of animal decision making, thereby providing insights<br/>into why animals behave the way they do. However, it does not speak to how animals make<br/>decisions that tend to be adaptive. Using simulation studies, prior work has shown empirically<br/>that a simple decision-making heuristic tends to produce prey-choice behaviors that, on <br/>average, match the predicted behaviors of optimal foraging theory. That heuristic chooses<br/>to spend time processing an encountered prey item if that prey item's marginal rate of<br/>caloric gain (in calories per unit of processing time) is greater than the forager's<br/>current long-term rate of accumulated caloric gain (in calories per unit of total searching<br/>and processing time). Although this heuristic may seem intuitive, a rigorous mathematical<br/>argument for why it tends to produce the theorized optimal foraging theory behavior has<br/>not been developed. In this thesis, an analytical argument is given for why this<br/>simple decision-making heuristic is expected to realize the optimal performance<br/>predicted by optimal foraging theory. This theoretical guarantee not only provides support<br/>for why such a heuristic might be favored by natural selection, but it also provides<br/>support for why such a heuristic might a reliable tool for decision-making in autonomous<br/>engineered agents moving through theatres of uncertain rewards. Ultimately, this simple<br/>decision-making heuristic may provide a recipe for reinforcement learning in small robots<br/>with little computational capabilities.

ContributorsCothren, Liliaokeawawa Kiyoko (Author) / Pavlic, Theodore (Thesis director) / Brewer, Naala (Committee member) / School of Mathematical and Statistical Sciences (Contributor, Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148454-Thumbnail Image.png
Description

This thesis is a supplement textbook designed with ASU’s MAT 370, or more generally, a course in introductory real analysis (IRA). With research in the realms of mathematics textbook creation and IRA pedagogy, this supplement aims to provide students or interested readers an additional presentation of the materials. Topics discussed

This thesis is a supplement textbook designed with ASU’s MAT 370, or more generally, a course in introductory real analysis (IRA). With research in the realms of mathematics textbook creation and IRA pedagogy, this supplement aims to provide students or interested readers an additional presentation of the materials. Topics discussed include the real number system, some topology of the real line, sequences of real numbers, continuity, differentiation, integration, and the Fundamental Theorem of Calculus. Special emphasis was placed on worked examples of proven results and exercises with hints at the end of every chapter. In this respect, this supplement aims to be both versatile and self-contained for the different mathematics skill levels of readers.

ContributorsCarpenter, Jackson Robinett (Author) / Jones, Don (Thesis director) / Quigg, John (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / School of International Letters and Cultures (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
136114-Thumbnail Image.png
Description
Preliminary feasibility studies for two possible experiments with the GlueX detector, installed in Hall D of Jefferson Laboratory, are presented. First, a general study of the feasibility of detecting the ηC at the current hadronic rate is discussed, without regard for detector or reconstruction efficiency. Second, a study of the

Preliminary feasibility studies for two possible experiments with the GlueX detector, installed in Hall D of Jefferson Laboratory, are presented. First, a general study of the feasibility of detecting the ηC at the current hadronic rate is discussed, without regard for detector or reconstruction efficiency. Second, a study of the use of statistical methods in studying exotic meson candidates is outlined, describing methods and providing preliminary data on their efficacy.
ContributorsPrather, Benjamin Scott (Author) / Ritchie, Barry G. (Thesis director) / Dugger, Michael (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2015-05
136340-Thumbnail Image.png
Description
This paper focuses on the Szemerédi regularity lemma, a result in the field of extremal graph theory. The lemma says that every graph can be partitioned into bounded equal parts such that most edges of the graph span these partitions, and these edges are distributed in a fairly uniform way.

This paper focuses on the Szemerédi regularity lemma, a result in the field of extremal graph theory. The lemma says that every graph can be partitioned into bounded equal parts such that most edges of the graph span these partitions, and these edges are distributed in a fairly uniform way. Definitions and notation will be established, leading to explorations of three proofs of the regularity lemma. These are a version of the original proof, a Pythagoras proof utilizing elemental geometry, and a proof utilizing concepts of spectral graph theory. This paper is intended to supplement the proofs with background information about the concepts utilized. Furthermore, it is the hope that this paper will serve as another resource for students and others to begin study of the regularity lemma.
ContributorsByrne, Michael John (Author) / Czygrinow, Andrzej (Thesis director) / Kierstead, Hal (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Chemistry and Biochemistry (Contributor)
Created2015-05
136450-Thumbnail Image.png
Description
"The Legal Adventures of Frankie and Rosie" is a creative project that explores the nontraditional format of comics to express creative nonfiction. The project is a set of 30 independent comics that focuses on two primary college-going students who are based off of the authors. The characters, Frankie and Rosie

"The Legal Adventures of Frankie and Rosie" is a creative project that explores the nontraditional format of comics to express creative nonfiction. The project is a set of 30 independent comics that focuses on two primary college-going students who are based off of the authors. The characters, Frankie and Rosie narrate their stories through dialogue. The authors use this narrative model to archive their college experience at ASU. Representing creative nonfiction through comics yields an amalgamated format that can be challenging for both the writers to produce as well as for the readers to consume. Ultimately, the project serves as an attempt to test whether or not the comic medium can stand by itself as an appropriate format to express creative nonfictional narratives without becoming a diluted combination of its purer predecessors.
Created2015-05
136508-Thumbnail Image.png
Description
The title means nothing because the stories have little in common, aside from the fact that I wrote them. The common theme of anxiety was unintentional, though it is prevalent in the stories, poetry and my life. Each story is written from a different style, with a different interest in

The title means nothing because the stories have little in common, aside from the fact that I wrote them. The common theme of anxiety was unintentional, though it is prevalent in the stories, poetry and my life. Each story is written from a different style, with a different interest in mind. The poetry that breaks up the stories is mine, and also free of common bonds. People whom I love inspired some of them; others stem from people with whom I was (or still am) angry. Some of them are just me trying to write poetry like other successful poets, who seem to know something I don't. I wrote this set of stories and poems because I wanted to see if I could do it. I wanted to challenge myself in a new medium (two new mediums really, if you separate literature and poetry). I wanted to prove to myself that I could do it, if I really set my mind to it. I wanted to have some wealth of words, which I could record myself reading. Overall, I hope that you enjoy these stories and words. I wrote them to entertain myself, and they seem to do that pretty well. If you don't like them, stop reading. If you do like them, keep reading and tell everyone you know about this collection. I'm proud of my work here, so anything beyond that is icing on my cake.
ContributorsRagatz, Zachariah Edward (Author) / Scott, Jason Davids (Thesis director) / Espinosa, Micha (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / School of Film, Dance and Theatre (Contributor)
Created2015-05
136520-Thumbnail Image.png
Description
Deconvolution of noisy data is an ill-posed problem, and requires some form of regularization to stabilize its solution. Tikhonov regularization is the most common method used, but it depends on the choice of a regularization parameter λ which must generally be estimated using one of several common methods. These methods

Deconvolution of noisy data is an ill-posed problem, and requires some form of regularization to stabilize its solution. Tikhonov regularization is the most common method used, but it depends on the choice of a regularization parameter λ which must generally be estimated using one of several common methods. These methods can be computationally intensive, so I consider their behavior when only a portion of the sampled data is used. I show that the results of these methods converge as the sampling resolution increases, and use this to suggest a method of downsampling to estimate λ. I then present numerical results showing that this method can be feasible, and propose future avenues of inquiry.
ContributorsHansen, Jakob Kristian (Author) / Renaut, Rosemary (Thesis director) / Cochran, Douglas (Committee member) / Barrett, The Honors College (Contributor) / School of Music (Contributor) / Economics Program in CLAS (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2015-05
135651-Thumbnail Image.png
Description
Honey bees (Apis mellifera) are responsible for pollinating nearly 80\% of all pollinated plants, meaning humans depend on honey bees to pollinate many staple crops. The success or failure of a colony is vital to global food production. There are various complex factors that can contribute to a colony's failure,

Honey bees (Apis mellifera) are responsible for pollinating nearly 80\% of all pollinated plants, meaning humans depend on honey bees to pollinate many staple crops. The success or failure of a colony is vital to global food production. There are various complex factors that can contribute to a colony's failure, including pesticides. Neonicotoids are a popular pesticide that have been used in recent times. In this study we concern ourselves with pesticides and its impact on honey bee colonies. Previous investigations that we draw significant inspiration from include Khoury et Al's \emph{A Quantitative Model of Honey Bee Colony Population Dynamics}, Henry et Al's \emph{A Common Pesticide Decreases Foraging Success and Survival in Honey Bees}, and Brown's \emph{ Mathematical Models of Honey Bee Populations: Rapid Population Decline}. In this project we extend a mathematical model to investigate the impact of pesticides on a honey bee colony, with birth rates and death rates being dependent on pesticides, and we see how these death rates influence the growth of a colony. Our studies have found an equilibrium point that depends on pesticides. Trace amounts of pesticide are detrimental as they not only affect death rates, but birth rates as well.
ContributorsSalinas, Armando (Author) / Vaz, Paul (Thesis director) / Jones, Donald (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / School of International Letters and Cultures (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
135739-Thumbnail Image.png
Description
Many programmable matter systems have been proposed and realized recently, each often tailored toward a particular task or physical setting. In our work on self-organizing particle systems, we abstract away from specific settings and instead describe programmable matter as a collection of simple computational elements (to be referred to as

Many programmable matter systems have been proposed and realized recently, each often tailored toward a particular task or physical setting. In our work on self-organizing particle systems, we abstract away from specific settings and instead describe programmable matter as a collection of simple computational elements (to be referred to as particles) with limited computational power that each perform fully distributed, local, asynchronous algorithms to solve system-wide problems of movement, configuration, and coordination. In this thesis, we focus on the compression problem, in which the particle system gathers as tightly together as possible, as in a sphere or its equivalent in the presence of some underlying geometry. While there are many ways to formalize what it means for a particle system to be compressed, we address three different notions of compression: (1) local compression, in which each individual particle utilizes local rules to create an overall convex structure containing no holes, (2) hole elimination, in which the particle system seeks to detect and eliminate any holes it contains, and (3) alpha-compression, in which the particle system seeks to shrink its perimeter to be within a constant factor of the minimum possible value. We analyze the behavior of each of these algorithms, examining correctness and convergence where appropriate. In the case of the Markov Chain Algorithm for Compression, we provide improvements to the original bounds for the bias parameter lambda which influences the system to either compress or expand. Lastly, we briefly discuss contributions to the problem of leader election--in which a particle system elects a single leader--since it acts as an important prerequisite for compression algorithms that use a predetermined seed particle.
ContributorsDaymude, Joshua Jungwoo (Author) / Richa, Andrea (Thesis director) / Kierstead, Henry (Committee member) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
135688-Thumbnail Image.png
Description
Education is a very sensitive topic when it comes to implementing the right policies. From professionals well-versed in the topic, to the very students who are being taught, feedback for reform is constantly being addressed. Nonetheless, there remains a large gap between the performance of some of the most advanced

Education is a very sensitive topic when it comes to implementing the right policies. From professionals well-versed in the topic, to the very students who are being taught, feedback for reform is constantly being addressed. Nonetheless, there remains a large gap between the performance of some of the most advanced countries in the world and the United States of America. As it stands today, USA is arguably the most technologically advanced country and the outright leader of the free market. For over a century this nation has been exceeding expectations in nearly every industry known to man and aiding the rest of the world in their endeavors for a higher standard of living. Yet, there seems to be something critically wrong with the way a large majority of the younger generation are growing up. How can a country so respected in the world fall so far behind in what is considered the basics of human education: math and science? The Trends in International Mathematics and Science Study (TIMSS) is a series of assessments taken by countries all around the world to determine the strength of their youth's knowledge. Since its inception in 1995, TIMSS has been conducted every four years with an increasing number of participating countries and students each time. In 1999 U.S. eighth-graders placed #19 in the world for mathematics and #18 for science (Appendix Fig. 1). In the years following, and further detailed in the thesis, the U.S. managed to improve the overall performance by a small margin but still remained a leg behind countries like Singapore, Hong Kong, Japan, Russia, and more. Clearly these countries were doing something right as they consistently managed to rank in the top tier. Over the course of this paper we will observe and analyze why and how Singapore has topped the TIMSS list for both math and science nearly every time it has been administered over the last two decades. What is it that they are teaching their youth that enables them to perform exceptionally above the norm? Why is it that we cannot use their techniques as a guideline to increase the capabilities of our future generations? We look to uncover the teaching methods of what is known as Singapore Math and how it has helped students all over the world. By researching current U.S. schools that have already implemented the system and learning about their success stories, we hope to not only educate but also persuade the local school districts on why integrating Singapore Math into their curriculum will lead to the betterment of the lives of thousands of children and the educational threshold of this great nation.
ContributorsKichloo, Parth (Co-author) / Leverenz, Michael (Co-author) / Kashiwagi, Dean (Thesis director) / Kashiwagi, Jacob (Committee member) / Rivera, Alfredo (Committee member) / Department of Management (Contributor) / Department of Marketing (Contributor) / Department of Finance (Contributor) / Department of Information Systems (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05