Matching Items (15)
Filtering by

Clear all filters

136617-Thumbnail Image.png
Description
We created an Android application, Impromp2, which allows users to search for and save events of interest to them in the Phoenix area. The backend, built on the Parse platform, gathers events daily using Web services and stores them in a database. Impromp2 was designed to improve upon similarly-purposed apps

We created an Android application, Impromp2, which allows users to search for and save events of interest to them in the Phoenix area. The backend, built on the Parse platform, gathers events daily using Web services and stores them in a database. Impromp2 was designed to improve upon similarly-purposed apps available for Android devices in several key ways, especially in user interface design and data interaction capability. This is a full-stack software project that explores databases and their performance considerations, Web services, user interface design, and the challenges of app development for a mobile platform.
ContributorsNorth, Joseph Robert (Author) / Balasooriya, Janaka (Thesis director) / Nakamura, Mutsumi (Committee member) / Faucon, Philippe (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (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
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
136702-Thumbnail Image.png
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

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
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
133794-Thumbnail Image.png
Description
This creative project centers on creating evaluative writing about film, in the form of a film review blog. Preliminary writing was done, in which the distinction was made between critical film writing and movie reviewing, as well as an analysis of how film critics have honed in their criticism and

This creative project centers on creating evaluative writing about film, in the form of a film review blog. Preliminary writing was done, in which the distinction was made between critical film writing and movie reviewing, as well as an analysis of how film critics have honed in their criticism and what makes their content effective for their audience. The rest of the writing for this project consists of a total of 15 reviews for 15 different movies released in 2017 and 2018. In these reviews, there is a brief introduction of the plot and context in which the film is made, followed by an evaluative analysis of what made the film effective or ineffective in achieving its artistic goals. The reviews involve an amalgamation of the content and topics taught in the Film and Media Studies program at Arizona State University, from screenwriting to cinematography. This process of writing reviews and being edited by the Director and Second Reader allows for the opportunity to find a unique writing voice and create content that is accessible for the wide audience that would be reading the work. All of the writing completed for this project (except for the "My Favorite Film Critics" piece) is compiled together in a WordPress blog, in an easily readable and accessible format. The blog itself serves as a way to reach the desired audience, as well as entice them to engage with the writing and the films being written about. This includes providing images and trailers for each respective film, to add a visual component to the writing. The final product is a unique way to engage with the content taught in the Film and Media Studies program, while simultaneously building a portfolio of writing that will be expanded upon and continued in the future.
ContributorsPolich, Brennan Taylor (Author) / Green, Michael (Thesis director) / Bernstein, Gregory (Committee member) / Department of English (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
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
133091-Thumbnail Image.png
Description
FastStat is a responsive website designed to work on any handheld, laptop, or desktop device. It serves as a first step into statistical calculations, educating the user on the basics of statistical analysis, and guiding them as they perform analyses of their own using built-in calculators. The calculators available can

FastStat is a responsive website designed to work on any handheld, laptop, or desktop device. It serves as a first step into statistical calculations, educating the user on the basics of statistical analysis, and guiding them as they perform analyses of their own using built-in calculators. The calculators available can perform z tests, t tests, chi square tests, and analysis of variance tests to determine significant characteristics of the user's data. Outputted data includes means, standard deviations, significance levels, applicable statistics, and worded results indicating the outcome of the performed test. With its clean design, FastStat directs the user in an intuitive manner to fill in the information needed, giving clear indications of what types of values are needed where and flagging descriptive error messages if any inputted values are incorrect. FastStat also implements a halt to calculations if any errors are found, which saves time by avoiding impossible calculations. Once complete, FastStat outputs a variety of information of use to the user in a clearly labeled manner. The calculators are designed in such a way that the user will know what information they will get out of the calculator before performing any calculations at all. Aside from the calculators, FastStat includes introductory pages designed to get users familiar with common statistical terms and the associated tests, solidifying its purpose as an introductory tool. All tests are described by their typical uses, necessary inputs, calculated outputs, and extra notes of importance. Many terms are defined for the purpose of statistics, complete with examples to help educate the user on the concepts. With the information available, even the newest statistician can learn and begin performing tests almost immediately.
ContributorsBroin, Demetri Evan (Author) / Squire, Susan (Thesis director) / Samara, Marko (Committee member) / Graphic Information Technology (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2018-12
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