Matching Items (48)
Filtering by
- All Subjects: Creative Project
- All Subjects: Computer Science
- Creators: School of Mathematical and Statistical Sciences
- Creators: School of Sustainability
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
Description
Soiled: An Environmental Podcast is a six episode series where common environmental topics are discussed and misconceptions surrounding these topics are debunked.
ContributorsKuta, Tiffany T (Co-author) / Jones, Cassity (Co-author) / Turner, Natalie (Co-author) / Boyer, Mackenzie (Thesis director) / Ward, Kristen (Committee member) / Civil, Environmental and Sustainable Eng Program (Contributor) / School of Sustainability (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
Description
I set out to better understand the issues, perceptions & solutions surrounding drought. The question that compelled my project was "What might be all the ways that we can improve the experience of conserving, reusing & educating on the topic of water." Through the process of design research I developed a system of products that improves the user experiences surrounding water. The result is IOW, an intelligent 3-product system that aims to make your water needs & wants smarter & less wasteful.
ContributorsShappee, Christian Kyle (Author) / Shin, Dosun (Thesis director) / McDermott, Lauren (Committee member) / Barrett, The Honors College (Contributor) / Herberger Institute for Design and the Arts (Contributor) / School of Sustainability (Contributor) / The Design School (Contributor)
Created2015-05
Description
A primary goal in computer science is to develop autonomous systems. Usually, we provide computers with tasks and rules for completing those tasks, but what if we could extend this type of system to physical technology as well? In the field of programmable matter, researchers are tasked with developing synthetic materials that can change their physical properties \u2014 such as color, density, and even shape \u2014 based on predefined rules or continuous, autonomous collection of input. In this research, we are most interested in particles that can perform computations, bond with other particles, and move. In this paper, we provide a theoretical particle model that can be used to simulate the performance of such physical particle systems, as well as an algorithm to perform expansion, wherein these particles can be used to enclose spaces or even objects.
ContributorsLaff, Miles (Author) / Richa, Andrea (Thesis director) / Bazzi, Rida (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2015-05
Description
This paper explores two areas of study: Colony Collapse Disorder and urban apiculture--the practice of keeping bees in urban areas. Additionally, this paper discusses the ways in which Colony Collapse Disorder has encouraged an increase in urban beekeeping, and the possible role of urban apiculture as a means of combatting the negative effects of Colony Collapse Disorder. The symptoms, history, and possible causes of Colony Collapse Disorder are presented, as well as the important role that honey bees play in human agriculture. Following the discussion of Colony Collapse Disorder is a description of my urban beekeeping apprenticeship at Desert Marigold School where I kept bees, researched various hives, attended a beekeeping workshop in Tucson, and eventually built a hive and established a colony with my mentor. This paper includes a guide to beekeeping basics, as well as a guide to starting a hive based upon the lessons learned during my apprenticeship.
ContributorsRomero, Madelyn Rattan (Author) / Schoon, Michael (Thesis director) / Silcox, Holly (Committee member) / Barrett, The Honors College (Contributor) / School of Sustainability (Contributor) / School of Geographical Sciences and Urban Planning (Contributor)
Created2015-05
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 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.
ContributorsBennewitz, Dana (Co-author) / Ray, Payel (Co-author) / Martin, Thomas (Thesis director) / Scott Lynch, Jacquelyn (Committee member) / Civil, Environmental and Sustainable Engineering Programs (Contributor) / Barrett, The Honors College (Contributor) / School of Geographical Sciences and Urban Planning (Contributor) / Electrical Engineering Program (Contributor) / School of Social Transformation (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2015-05
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 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
Description
Bots tamper with social media networks by artificially inflating the popularity of certain topics. In this paper, we define what a bot is, we detail different motivations for bots, we describe previous work in bot detection and observation, and then we perform bot detection of our own. For our bot detection, we are interested in bots on Twitter that tweet Arabic extremist-like phrases. A testing dataset is collected using the honeypot method, and five different heuristics are measured for their effectiveness in detecting bots. The model underperformed, but we have laid the ground-work for a vastly untapped focus on bot detection: extremist ideal diffusion through bots.
ContributorsKarlsrud, Mark C. (Author) / Liu, Huan (Thesis director) / Morstatter, Fred (Committee member) / Barrett, The Honors College (Contributor) / Computing and Informatics Program (Contributor) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2015-05
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
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