Matching Items (15)
Filtering by
- Creators: School of Mathematical and Statistical Sciences
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
Description
Only in the world of acting can an individual be denied a job simply on the basis of their appearance, and in my thesis, I sought to explore alternatives to this through the concept of nontraditional casting and casting against "type", which included the presentation of a full-length production of the musical "Once on this Island" which I attempted to cast based on vocal quality and skill alone rather than taking physical characteristics into account. I researched the history and implementation of nontraditional casting, both in regards to race and other factors such as gender, socio-economic status, and disability. I also considered the legal and intellectual property challenges that nontraditional casting can pose. I concluded from this research that while nontraditional casting is only one solution to the problem, it still has a great deal of potential to create diversity in theater. For my own show, I held the initial auditions via audio recording, though the callback auditions were held in person so that I and my crew could appraise dance and acting ability. Though there were many challenges with our cast after this initial round of auditions, we were able to solidify our cast and continue through the rehearsal process. All things said, the show was very successful. It is my hope that those who were a part of the show, either as part of the production or the audience, are inspired to challenge the concept of typecasting in contemporary theater.
ContributorsBriggs, Timothy James (Author) / Yatso, Toby (Thesis director) / Dreyfoos, Dale (Committee member) / Barrett, The Honors College (Contributor) / School of Music (Contributor)
Created2014-12
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 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
Description
Rainbow Connection is an integrated choir with members on and off the autism spectrum. It was founded in the spring of 2012 by Barrett students Ali Friedman, Megan Howell, and Victoria Gilman as part of an honors thesis creative project. Rainbow Connection uses the rehearsal process and other creative endeavors to foster natural relationship building across social gaps. A process-oriented choir, Rainbow Connection's main goals concern the connections made throughout the experience rather than the final musical product. The authors believe that individual, non-hierarchical relationships are the keys to breaking down systemized gaps between identity groups and that music is an ideal facilitator for fostering such relationships. Rainbow Connection operates under the premise that, like colors in a rainbow, choir members create something beautiful not by melding into one homogenous group, but by collaboratively showcasing their individual gifts. This paper will highlight the basic premise and structure of Rainbow Connection, outline the process of enacting the choir, and describe the authors' personal reactions and takeaways from the project.
ContributorsFriedman, Alexandra (Co-author) / Gilman, Victoria (Co-author) / Howell, Megan (Co-author) / Rio, Robin (Thesis director) / Schildkret, David (Committee member) / Barrett, The Honors College (Contributor) / School of Music (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2014-12
Description
Independent artists are thriving in the modern music industry, creating and branding their own music, and developing rich concentrations of fans. Indie artists are progressively securing positions within mainstream music while also upholding individuality. With technology advancements, to include self-recording technology, wearable devices, and mobile operating systems, independent artists are able to extend their reach to a variety of audiences. Social media platforms' progression has further catalyzed artists' capability of growth, as they have the capacity to personalize marketing content, develop loyal fan-bases, and engage directly with potential consumers. Artists are increasingly fabricating their own unique spaces in an industry that was formerly controlled by conventions. This thesis involves the production of a three-song extended play, and ascertains how to effectively capitalize on the wide array of modern marketing platforms.
ContributorsBerk, Ruth C (Author) / Ostrom, Lonnie (Thesis director) / Schlacter, John (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Supply Chain Management (Contributor)
Created2015-05
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 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
Description
This project is an arrangement of three movements from Igor Stravinsky's most famous and beloved ballets for performance by classical guitar quartet. The movements arranged were "Augurs of Spring" from The Rite of Spring (1913), "Russian Dance" from Petrouchka (1911), and "Infernal Dance of All Kastchei's Subjects" from The Firebird (1910). Because the appeal of this music is largely based on the exciting rhythms and interesting harmonies, these works translate from full orchestra to guitar quite well. The arrangement process involved studying both the orchestral scores and Stravinsky's own piano reductions. The sheet music for these arrangements is accompanied by a written document which explains arrangement decisions and provides performance notes. Select movements from Stravinsky for Guitar Quartet were performed at concerts in Tempe, Glendale, Flagstaff, and Tucson throughout April 2016. The suite was performed in its entirety in the Organ Hall at the ASU School of Music on April 26th 2016 at the Guitar Ensembles Concert as well as on April 27th 2016 at Katie Sample's senior recital. A recording of the April 27th performance accompanies the sheet music and arrangement/performance notes.
ContributorsSample, Katherine Elizabeth (Author) / Koonce, Frank (Thesis director) / Lake, Brendan (Committee member) / Herberger Institute for Design and the Arts (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / School of Music (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
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 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
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 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
Description
This project is a small scale investigation of various factors concerning "Flow" in Piano Performance. "Flow" is the sweet spot where ability and challenge are about equal, and usually high (Csikszentmihalyi 1990). Piano performance is a state of playing the piano with some intent to perform. In this case, the intent is to create something new or improvise. Improvisation is one form of expressive creativity on the piano stemming from some knowledge and extrapolation upon that knowledge (Nachmanovitch 82). Creativity is essential to the development of new music, and though extensive literature exists on both creativity and music independently, there is a gap in research regarding links between the two (Macdonald et al. 2006). This project aims to address some of these gaps by working with piano players and non-musicians of various technical skill levels to examine the "Flow" state in improvisation as well as potential factors affecting creative performance. Factors such as listening, self-confidence, frustration in methodology, and meditation practices were found to correlate positively with technical skill. Participants who completed the practice program were able to reconstruct challenges and enter the "Flow" state in improvisation regardless of high or low technical scores.
ContributorsDorr, Alexander Nathan (Author) / Kaplan, Robert (Thesis director) / Parker, John (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
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 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