Matching Items (434)
Filtering by
- All Subjects: Music
- All Subjects: sports
- Creators: Barrett, The Honors College
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
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
There are no words for the trauma of death when it strikes unexpectedly. What to say when a mother dies in childbirth? When a father figure contracts an unknown disease for no apparent cause? When a beloved pet, long mourned, may still be alive and hidden by estranged family? Generations may pass, and children may grow up, but the pain leaves marks that echo across time and the other borders we construct between our past and present. We may find strength on solitude, or prayer, or the words of a song written by someone else. In these four stories, spanning almost half a century, the marks of death and attempts to soothe or hide them are everywhere. Children on the cusp of adulthood grapple with the lives and the lies of their parents. Musicians examine the relationship of their music to the world. Legends and myths lurk in the shadows, tempting with false hope and rationalizing the unexplainable.
In “Playing the Changes,” we meet two men stranded in a small desert town in 1972, a time when their attraction to each other is still dangerous. Nile Walker is a jazz musician, running from a spurned lover and the law. Benji Garza is a once-devout Catholic, fixing cars and caring for his orphaned nephew, Hector. Walker and Garza’s affair will spin both lives and their heredity into sweeping tragedies that characters battle with lust and melody. Walker has a son he never meets, a drifter who finds connection with another lost soul at an airport in “La Petite Mort.” Hector is forced into early adulthood in “The Words,” when his ailing uncle’s health fails due to a mysterious disease not yet called AIDS. Later Tre—a young man struggling with the weight of his own lineage—meets him in “PHX.” These stories examine questions of death’s causes and its myriad effects, and offer this solution: Knowing that we cannot know everything, and living, loving, and singing anyway.
In “Playing the Changes,” we meet two men stranded in a small desert town in 1972, a time when their attraction to each other is still dangerous. Nile Walker is a jazz musician, running from a spurned lover and the law. Benji Garza is a once-devout Catholic, fixing cars and caring for his orphaned nephew, Hector. Walker and Garza’s affair will spin both lives and their heredity into sweeping tragedies that characters battle with lust and melody. Walker has a son he never meets, a drifter who finds connection with another lost soul at an airport in “La Petite Mort.” Hector is forced into early adulthood in “The Words,” when his ailing uncle’s health fails due to a mysterious disease not yet called AIDS. Later Tre—a young man struggling with the weight of his own lineage—meets him in “PHX.” These stories examine questions of death’s causes and its myriad effects, and offer this solution: Knowing that we cannot know everything, and living, loving, and singing anyway.
ContributorsCohen, Michael Lawrence (Author) / Bell, Matt (Thesis director) / Pearson, Dustin (Committee member) / Department of English (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
Description
Education of any skill based subject, such as mathematics or language, involves a significant amount of repetition and pratice. According to the National Survey of Student Engagements, students spend on average 17 hours per week reviewing and practicing material previously learned in a classroom, with higher performing students showing a tendency to spend more time practicing. As such, learning software has emerged in the past several decades focusing on providing a wide range of examples, practice problems, and situations for users to exercise their skills. Notably, math students have benefited from software that procedurally generates a virtually infinite number of practice problems and their corresponding solutions. This allows for instantaneous feedback and automatic generation of tests and quizzes. Of course, this is only possible because software is capable of generating and verifying a virtually endless supply of sample problems across a wide range of topics within mathematics. While English learning software has progressed in a similar manner, it faces a series of hurdles distinctly different from those of mathematics. In particular, there is a wide range of exception cases present in English grammar. Some words have unique spellings for their plural forms, some words have identical spelling for plural forms, and some words are conjugated differently for only one particular tense or person-of-speech. These issues combined make the problem of generating grammatically correct sentences complicated. To compound to this problem, the grammar rules in English are vast, and often depend on the context in which they are used. Verb-tense agreement (e.g. "I eat" vs "he eats"), and conjugation of irregular verbs (e.g. swim -> swam) are common examples. This thesis presents an algorithm designed to randomly generate a virtually infinite number of practice problems for students of English as a second language. This approach differs from other generation approaches by generating based on a context set by educators, so that problems can be generated in the context of what students are currently learning. The algorithm is validated through a study in which over 35 000 sentences generated by the algorithm are verified by multiple grammar checking algorithms, and a subset of the sentences are validated against 3 education standards by a subject matter expert in the field. The study found that this approach has a significantly reduced grammar error ratio compared to other generation algorithms, and shows potential where context specification is concerned.
ContributorsMoore, Zachary Christian (Author) / Amresh, Ashish (Thesis director) / Nelson, Brian (Committee member) / Software Engineering (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
Description
"EP \u2014 Kyan Palmer" is a compilation of three songs, "Hit List," "Queen Cobra," and "Burn Mona Lisa" all written and recorded by Barrett student, Kyan Palmer. The project explores the process involved in creating recorded music and exposes the vulnerability and self-reflection in writing a song. The following depicts the thought process that came about in the creation of each song from the lyrics, to the vocals, to the production. This paper depicts a journal-like writing style outlining the various events that took place while creating EP \u2014 Kyan Palmer. The bulk of this Thesis/Creative Project was the written, produced, and recorded music attached in the appendix. With that said, the following document is intended to be reflective rather than scholarly and acts as an accompaniment to the audio recordings and video entries.
ContributorsPalmer, Kyan (Author) / Swoboda, Deanna (Thesis director) / Tobias, Evan (Committee member) / W. P. Carey School of Business (Contributor) / School of Music (Contributor) / Department of Marketing (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
Description
The research and work that allowed my thesis creative project to come to fruition were tokens of a truly enlightening experience. My thesis is entitled, ASU Olympians: Dissecting their Psyche, and delves into three main topics that blanket all eight of the subjects that I interviewed. The first topic encompasses the idea that Athletic Director Ray Anderson is constantly trying to expand the Olympic culture within ASU Athletics. The second topic is the fact that competing in the Olympics changes an athlete's trajectory whether they medal or not. The third topic focuses on the physical and mental toll the Games take on these athletes. I designed an interactive website to showcase these topics. In it, there are interactive features from up-and-coming applications such as a 360-degree photo from Bubbli, an infographic from Venngage and a timeline from Timeglider. I have written four long-form stories on marathoner Amy Hastings Cragg, swimmer Richard Bohus, high-jumper Bryan McBride and water polo defender Gao Ao. To enhance these ideas further, I created four videos: One about future ASU volunteer coach Michael Phelps, another on current ASU Swim & Dive Coach Bob Bowman, another on Ao to go along with her story and finally a one-on-one with Ray Anderson as the centerpiece to my project. Every piece of this website fits together to communicate one overarching message: The Olympics leave a massive impact on the ASU athletes that compete in them and an impact that each of these athlete's find an interesting story to tell in its wake.
ContributorsVicario, Kristina Louise (Author) / Lodato, Mark (Thesis director) / Hawken-Collins, Denise (Committee member) / Walter Cronkite School of Journalism and Mass Communication (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
Description
This creative project includes a self-reflection, four original compositions by Drew Hensley, and supplementary song commentaries. The self-reflection section of the project contains an extensive look into how Hensley's musical experiences and upbringing influenced his song writing process and compositional voice. Specifically, the piece analyzes how Hensley's gravitation to jazz music and musical styles of various cultures influenced the chord structures, rhythms, and melodies in his pop compositions. The track list for the project includes "Do It Anyway," "Puppeteer," "You Really Kind of Suck at Love," and "Drag You Down." Each piece includes lyrics and composed sheet music for vocals and instruments including guitar, piano, bass, and violin. The pieces were supplemented with commentaries describing specific inspirations for both the lyrics and music. "Do It Anyway" discusses Hensley's decision to pursue music and takes inspiration from classic American jazz melodies and Latin jazz rhythms. "Puppeteer" addresses the complexities of control through the metaphor strings. The piece pulls inspiration from the double harmonic scale often associated with Arabic music. "You Really Kind Of Suck At Love" addresses a break up through expertly placed humor and sarcasm. The piece is a new take on the standard 12 bar blues song form. "Drag You Down" tells of Hensley's personal struggles in music using thoroughly developed metaphors and chord progressions native to American rock music of the 1990's and 2000's. Together, the work will be recorded as an Extended Play entitled Do It Anyway. Hensley plans move to Los Angeles, California and use the recordings to pursue a career in pop music performance.
ContributorsHensley, Andrew Michael (Author) / McAdams, Charity (Thesis director) / Bhattacharjya, Nilanjana (Committee member) / School of Life Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
Description
Instead of providing the illusion of agency to a reader via a tree or network of prewritten, branching paths, an interactive story should treat the reader as a player who has meaningful influence on the story. An interactive story can accomplish this task by giving the player a large toolset for expression in the plot. LudoNarrare, an engine for interactive storytelling, puts "verbs" in this toolset. Verbs are contextual choices of action given to agents in a story that result in narrative events. This paper begins with an analysis and statement of the problem of creating interactive stories. From here, various attempts to solve this problem, ranging from commercial video games to academic research, are given a brief overview to give context to what paths have already been forged. With the background set, the model of interactive storytelling that the research behind LudoNarrare led to is exposed in detail. The section exploring this model contains explanations on what storyworlds are and how they are structured. It then discusses the way these storyworlds can be brought to life. The exposition on the LudoNarrare model finally wraps up by considering the way storyworlds created around this model can be designed. After the concepts of LudoNarrare are explored in the abstract, the story of the engine's research and development and the specifics of its software implementation are given. With LudoNarrare fully explained, the focus then turns to plans for evaluation of its quality in terms of entertainment value, robustness, and performance. To conclude, possible further paths of investigation for LudoNarrare and its model of interactive storytelling are proposed to inspire those who wish to continue in the spirit of the project.
ContributorsStark, Joshua Matthew (Author) / VanLehn, Kurt (Thesis director) / Wetzel, Jon (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2015-12
Description
Current popular NBA mobile applications do little to provide information about the NBA's players, usually providing limited statistical information or news and completely ignoring players' presence on social media. For fans, especially fans who are unfamiliar with the NBA, finding this information by themselves can be a daunting task, one which requires extensive knowledge about how the NBA provides media related to its players. NBA PlayerTrack has been designed to centralize player information from a variety of media streams, making it easier for fans to learn about and stay up-to-date with players and enabling fan discussion about those players and the NBA in general. By providing a variety of references to the locations of player information, NBA PlayerTrack also serves as a tool for learning about how and where the NBA presents player-related media, allowing fans to more easily locate information they desire as they become more invested in the NBA.
ContributorsSethia, Sumbhav (Author) / Davulcu, Hasan (Thesis director) / Faucon, Philippe (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2015-12
Description
Education in computer science is a difficult endeavor, with learning a new programing language being a barrier to entry, especially for college freshman and high school students. Learning a first programming language requires understanding the syntax of the language, the algorithms to use, and any additional complexities the language carries. Often times this becomes a deterrent from learning computer science at all. Especially in high school, students may not want to spend a year or more simply learning the syntax of a programming language. In order to overcome these issues, as well as to mitigate the issues caused by Microsoft discontinuing their Visual Programming Language (VPL), we have decided to implement a new VPL, ASU-VPL, based on Microsoft's VPL. ASU-VPL provides an environment where users can focus on algorithms and worry less about syntactic issues. ASU-VPL was built with the concepts of Robot as a Service and workflow based development in mind. As such, ASU-VPL is designed with the intention of allowing web services to be added to the toolbox (e.g. WSDL and REST services). ASU-VPL has strong support for multithreaded operations, including event driven development, and is built with Microsoft VPL users in mind. It provides support for many different robots, including Lego's third generation robots, i.e. EV3, and any open platform robots. To demonstrate the capabilities of ASU-VPL, this paper details the creation of an Intel Edison based robot and the use of ASU-VPL for programming both the Intel based robot and an EV3 robot. This paper will also discuss differences between ASU-VPL and Microsoft VPL as well as differences between developing for the EV3 and for an open platform robot.
ContributorsDe Luca, Gennaro (Author) / Chen, Yinong (Thesis director) / Cheng, Calvin (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2015-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