Matching Items (16)
Filtering by

Clear all filters

136691-Thumbnail Image.png
Description
Covering subsequences with sets of permutations arises in many applications, including event-sequence testing. Given a set of subsequences to cover, one is often interested in knowing the fewest number of permutations required to cover each subsequence, and in finding an explicit construction of such a set of permutations that has

Covering subsequences with sets of permutations arises in many applications, including event-sequence testing. Given a set of subsequences to cover, one is often interested in knowing the fewest number of permutations required to cover each subsequence, and in finding an explicit construction of such a set of permutations that has size close to or equal to the minimum possible. The construction of such permutation coverings has proven to be computationally difficult. While many examples for permutations of small length have been found, and strong asymptotic behavior is known, there are few explicit constructions for permutations of intermediate lengths. Most of these are generated from scratch using greedy algorithms. We explore a different approach here. Starting with a set of permutations with the desired coverage properties, we compute local changes to individual permutations that retain the total coverage of the set. By choosing these local changes so as to make one permutation less "essential" in maintaining the coverage of the set, our method attempts to make a permutation completely non-essential, so it can be removed without sacrificing total coverage. We develop a post-optimization method to do this and present results on sequence covering arrays and other types of permutation covering problems demonstrating that it is surprisingly effective.
ContributorsMurray, Patrick Charles (Author) / Colbourn, Charles (Thesis director) / Czygrinow, Andrzej (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2014-12
137020-Thumbnail Image.png
Description
In many systems, it is difficult or impossible to measure the phase of a signal. Direct recovery from magnitude is an ill-posed problem. Nevertheless, with a sufficiently large set of magnitude measurements, it is often possible to reconstruct the original signal using algorithms that implicitly impose regularization conditions on this

In many systems, it is difficult or impossible to measure the phase of a signal. Direct recovery from magnitude is an ill-posed problem. Nevertheless, with a sufficiently large set of magnitude measurements, it is often possible to reconstruct the original signal using algorithms that implicitly impose regularization conditions on this ill-posed problem. Two such algorithms were examined: alternating projections, utilizing iterative Fourier transforms with manipulations performed in each domain on every iteration, and phase lifting, converting the problem to that of trace minimization, allowing for the use of convex optimization algorithms to perform the signal recovery. These recovery algorithms were compared on a basis of robustness as a function of signal-to-noise ratio. A second problem examined was that of unimodular polyphase radar waveform design. Under a finite signal energy constraint, the maximal energy return of a scene operator is obtained by transmitting the eigenvector of the scene Gramian associated with the largest eigenvalue. It is shown that if instead the problem is considered under a power constraint, a unimodular signal can be constructed starting from such an eigenvector that will have a greater return.
ContributorsJones, Scott Robert (Author) / Cochran, Douglas (Thesis director) / Diaz, Rodolfo (Committee member) / Barrett, The Honors College (Contributor) / Electrical Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2014-05
134914-Thumbnail Image.png
Description
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and coating materials for engineering or programmable cells for medical uses. Previous research using this

Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and coating materials for engineering or programmable cells for medical uses. Previous research using this model has focused on shape formation and other spatial configuration problems, including line formation, compression, and coating. In this work we study foundational computational tasks that exceed the capabilities of the individual constant memory particles described by the model. These tasks represent new ways to use these self-organizing systems, which, in conjunction with previous shape and configuration work, make the systems useful for a wider variety of tasks. We present an implementation of a counter using a line of particles, which makes it possible for the line of particles to count to and store values much larger than their individual capacities. We then present an algorithm that takes a matrix and a vector as input and then sets up and uses a rectangular block of particles to compute the matrix-vector multiplication. This setup also utilizes the counter implementation to store the resulting vector from the matrix-vector multiplication. Operations such as counting and matrix multiplication can leverage the distributed and dynamic nature of the self-organizing system to be more efficient and adaptable than on traditional linear computing hardware. Such computational tools also give the systems more power to make complex decisions when adapting to new situations or to analyze the data they collect, reducing reliance on a central controller for setup and output processing. Finally, we demonstrate an application of similar types of computations with self-organizing systems to image processing, with an implementation of an image edge detection algorithm.
ContributorsPorter, Alexandra Marie (Author) / Richa, Andrea (Thesis director) / Xue, Guoliang (Committee member) / School of Music (Contributor) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12
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
148485-Thumbnail Image.png
Description

The COVID-19 pandemic has and will continue to radically shift the workplace. An increasing percentage of the workforce desires flexible working options and, as such, firms are likely to require less office space going forward. Additionally, the economic downturn caused by the pandemic provides an opportunity for companies to secure

The COVID-19 pandemic has and will continue to radically shift the workplace. An increasing percentage of the workforce desires flexible working options and, as such, firms are likely to require less office space going forward. Additionally, the economic downturn caused by the pandemic provides an opportunity for companies to secure favorable rent rates on new lease agreements. This project aims to evaluate and measure Company X’s potential cost savings from terminating current leases and downsizing office space in five selected cities. Along with city-specific real estate market research and forecasts, we employ a four-stage model of Company X’s real estate negotiation process to analyze whether existing lease agreements in these cities should be renewed or terminated.

ContributorsSaker, Logan (Co-author) / Ries, Sarah (Co-author) / Hegardt, Brandon (Co-author) / Patterson, Jack (Co-author) / Simonson, Mark (Thesis director) / Hertzel, Michael (Committee member) / Department of Finance (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
147577-Thumbnail Image.png
Description

Following the Global Financial Crisis of 2007-2008, financial institutions faced regulatory changes due to inherent weaknesses that were exposed by the recession. Within the United States, regulation came via the passing of the Dodd-Frank Wall Street Reform and Consumer Protection Act in 2010, which was heavily influenced by the internationally

Following the Global Financial Crisis of 2007-2008, financial institutions faced regulatory changes due to inherent weaknesses that were exposed by the recession. Within the United States, regulation came via the passing of the Dodd-Frank Wall Street Reform and Consumer Protection Act in 2010, which was heavily influenced by the internationally focused Basel III accord. A key component to both of these sets of regulations focused on raising the capital requirements for financial institutions, as well as creating capital buffers to help protect solvency during economic downturns in the future. The goal of this study is to evaluate the effectiveness of these changes to capital requirements, and to hypothesize as to what would happen if the modern banking system experienced the COVID-19 pandemic recession with the capital and leverage levels of the banking institutions circa 2007. To accomplish this, data from the Federal Reserve describing the capital and leverage ratios of the banking industry will be evaluated during both the Global Financial Crisis of 2007-2008, as well as during the COVID-19 Recession. Specifically, we will look at by how much capital was improved due to Dodd-Frank/Basel III, the resiliency of the capital and leverage ratios during the modern COVID-19 recession, and we will look at the average drop in capital levels caused by the COVID-19 recession and apply these percentage changes to the leverage/capital levels seen in 2007. Given the results, it is clear to see that the change in capital requirements along with the counter-cyclical buffers described in Dodd-Frank and Basel III allowed the banking system to function throughout the COVID recession without approaching insolvency in the slightest, something that ailed many large banks and firms during the Global Financial Crisis. As an answer to our hypothetical, we found that the drop seen affecting the measures of bank capital experienced during the COVID pandemic when applied to values seen at the beginning of the 2007 recession still led to a well-capitalized banking industry as a whole, highlighting the resiliency seen during the COVID recession thanks to the capital buffers put in place, as well as the direct assistance provided by the federal government (via PPP loans and stimulus checks) and the Federal Reserve in keeping the hit on capital to minimal values throughout the pandemic.

ContributorsMiner, Jackson J (Author) / McDaniel, Cara (Thesis director) / Wong, Kelvin (Committee member) / Economics Program in CLAS (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148156-Thumbnail Image.png
Description

This thesis project is part of a larger collaboration documenting the history of the ASU Biodesign Clinical Testing Laboratory (ABCTL). There are many different aspects that need to be considered when transforming to a clinical testing laboratory. This includes the different types of tests performed in the laboratory. In addition

This thesis project is part of a larger collaboration documenting the history of the ASU Biodesign Clinical Testing Laboratory (ABCTL). There are many different aspects that need to be considered when transforming to a clinical testing laboratory. This includes the different types of tests performed in the laboratory. In addition to the diagnostic polymerase chain reaction (PCR) test that is performed detecting the presence of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), antibody testing is also performed in clinical laboratories. Antibody testing is used to detect a previous infection. Antibodies are produced as part of the immune response against SARS-CoV-2. There are many different forms of antibody tests and their sensitives and specificities have been examined and reviewed in the literature. Antibody testing can be used to determine the seroprevalence of the disease which can inform policy decisions regarding public health strategies. The results from antibody testing can also be used for creating new therapeutics like vaccines. The ABCTL recognizes the shifting need of the community to begin testing for previous infections of SARS-CoV-2 and is developing new forms of antibody testing that can meet them.

ContributorsRuan, Ellen (Co-author) / Smetanick, Jennifer (Co-author) / Majhail, Kajol (Co-author) / Anderson, Laura (Co-author) / Breshears, Scott (Co-author) / Compton, Carolyn (Thesis director) / Magee, Mitch (Committee member) / School of Life Sciences (Contributor, Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148176-Thumbnail Image.png
Description

In this project, I examined the relationship between lockdowns implemented by COVID-19 and the activity of animals in urban areas. I hypothesized that animals became more active in urban areas during COVID-19 quarantine than they were before and I wanted to see if my hypothesis could be researched through Twitter

In this project, I examined the relationship between lockdowns implemented by COVID-19 and the activity of animals in urban areas. I hypothesized that animals became more active in urban areas during COVID-19 quarantine than they were before and I wanted to see if my hypothesis could be researched through Twitter crowdsourcing. I began by collecting tweets using python code, but upon examining all data output from code-based searches, I concluded that it is quicker and more efficient to use the advanced search on Twitter website. Based on my research, I can neither confirm nor deny if the appearance of wild animals is due to the COVID-19 lockdowns. However, I was able to discover a correlational relationship between these two factors in some research cases. Although my findings are mixed with regard to my original hypothesis, the impact that this phenomenon had on society cannot be denied.

ContributorsHeimlich, Kiana Raye (Author) / Dorn, Ronald (Thesis director) / Martin, Roberta (Committee member) / Donovan, Mary (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148187-Thumbnail Image.png
Description

The COVID-19 pandemic has resulted in preventative measures and has led to extensive changes in lifestyle for the vast majority of the American population. As the pandemic progresses, a growing amount of evidence shows that minority groups, such as the Deaf community, are often disproportionately and uniquely affected. Deaf

The COVID-19 pandemic has resulted in preventative measures and has led to extensive changes in lifestyle for the vast majority of the American population. As the pandemic progresses, a growing amount of evidence shows that minority groups, such as the Deaf community, are often disproportionately and uniquely affected. Deaf people are directly affected in their ability to personally socialize and continue with daily routines. More specifically, this can constitute their ability to meet new people, connect with friends/family, and to perform in their work or learning environment. It also may result in further mental health changes and an increased reliance on technology. The impact of COVID-19 on the Deaf community in clinical settings must also be considered. This includes changes in policies for in-person interpreters and a rise in telehealth. Often, these effects can be representative of the pre-existing low health literacy, frequency of miscommunication, poor treatment, and the inconvenience felt by Deaf people when trying to access healthcare. Ultimately, these effects on the Deaf community must be taken into account when attempting to create a full picture of the societal shift caused by COVID-19.

ContributorsDubey, Shreya Shashi (Co-author) / Asuncion, David Leonard (Co-author) / Patterson, Lindsey (Thesis director) / Lee, Lindsay (Committee member) / School of Molecular Sciences (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
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