Matching Items (32)
Filtering by
- All Subjects: Computer Science
- All Subjects: Creative Project
Description
The original version of Helix, the one I pitched when first deciding to make a video game
for my thesis, is an action-platformer, with the intent of metroidvania-style progression
and an interconnected world map.
The current version of Helix is a turn based role-playing game, with the intent of roguelike
gameplay and a dark fantasy theme. We will first be exploring the challenges that came
with programming my own game - not quite from scratch, but also without a prebuilt
engine - then transition into game design and how Helix has evolved from its original form
to what we see today.
for my thesis, is an action-platformer, with the intent of metroidvania-style progression
and an interconnected world map.
The current version of Helix is a turn based role-playing game, with the intent of roguelike
gameplay and a dark fantasy theme. We will first be exploring the challenges that came
with programming my own game - not quite from scratch, but also without a prebuilt
engine - then transition into game design and how Helix has evolved from its original form
to what we see today.
ContributorsDiscipulo, Isaiah K (Author) / Meuth, Ryan (Thesis director) / Kobayashi, Yoshihiro (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
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 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
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
"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
Mathematics is an increasingly critical subject and the achievement of students in mathematics has been the focus of many recent reports and studies. However, few studies exist that both observe and discuss the specific teaching and assessment techniques employed in the classrooms across multiple countries. The focus of this study is to look at classrooms and educators across six high achieving countries to identify and compare teaching strategies being used. In Finland, Hong Kong, Japan, New Zealand, Singapore, and Switzerland, twenty educators were interviewed and fourteen educators were observed teaching. Themes were first identified by comparing individual teacher responses within each country. These themes were then grouped together across countries and eight emerging patterns were identified. These strategies include students active involvement in the classroom, students given written feedback on assessments, students involvement in thoughtful discussion about mathematical concepts, students solving and explaining mathematics problems at the board, students exploring mathematical concepts either before or after being taught the material, students engagement in practical applications, students making connections between concepts, and students having confidence in their ability to understand mathematics. The strategies identified across these six high achieving countries can inform educators in their efforts of increasing student understanding of mathematical concepts and lead to an improvement in mathematics performance.
ContributorsAnglin, Julia Mae (Author) / Middleton, James (Thesis director) / Vicich, James (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (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
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
Since the acceptance of Einstein's special theory of relativity by the scientific community, authors of science fiction have used the concept of time dilation to permit seemingly impossible feats. Simple spacecraft acceleration schemes involving time dilation have been considered by scientists and fiction writers alike. Using an original Java program based upon the differential equations for special relativistic kinematics, several scenarios for round trip excursions at relativistic speeds are calculated and compared, with particular attention to energy budget and relativistic time passage in all relevant frames.
ContributorsAlfson, Jonathan William (Author) / Jacob, Richard (Thesis director) / Covatto, Carl (Committee member) / Foy, Joseph (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2015-05