Matching Items (625)
151708-Thumbnail Image.png
Description
Simultaneously culture heroes and stumbling buffoons, Tricksters bring cultural tools to the people and make the world more habitable. There are common themes in these figures that remain fruitful for the advancement of culture, theory, and critical praxis. This dissertation develops a method for opening a dialogue with Trickster figures.

Simultaneously culture heroes and stumbling buffoons, Tricksters bring cultural tools to the people and make the world more habitable. There are common themes in these figures that remain fruitful for the advancement of culture, theory, and critical praxis. This dissertation develops a method for opening a dialogue with Trickster figures. It draws from established literature to present a newly conceived and more flexible Trickster archetype. This archetype is more than a collection of traits; it builds on itself processually to form a method for analysis. The critical Trickster archetype includes the fundamental act of crossing borders; the twin ontologies of ambiguity and liminality; the particular tactics of humor, duplicity, and shape shifting; and the overarching cultural roles of culture hero and stumbling buffoon. Running parallel to each archetypal element, though, are Trickster's overarching critical spirit of Quixotic utopianism and underlying telos of manipulating human relationships. The character 'Q' from Star Trek: The Next Generation is used to demonstrate the critical Trickster archetype. To be more useful for critical cultural studies, Trickster figures must also be connected to their socio-cultural and historical contexts. Thus, this dissertation offers a second set of analytics, a dialogical method that connects Tricksters to the worlds they make more habitable. This dialogical method, developed from the work of M. M. Bakhtin and others, consists of three analytical tools: utterance, intertextuality, and chronotope. Utterance bounds the text for analysis. Intertextuality connects the utterance, the text, to its context. Chronotope suggests particular spatio-temporal relationships that help reveal the cultural significance of a dialogical performance. Performance artists Andre Stitt, Ann Liv Young, and Steven Leyba are used to demonstrate the method of Trickster dialogics. A concluding discussion of Trickster's unique chronotope reveals its contributions to conceptions of utopia and futurity. This dissertation offers theoretical advancements about the significance and tactics of subversive communication practices. It offers a new and unique method for cultural and performative analyses that can be expanded into different kinds of dialogics. Trickster dialogics can also be used generatively to direct and guide the further development of performative praxis.
ContributorsSalinas, Chema (Author) / de la Garza, Amira (Thesis advisor) / Carlson, Cheree (Committee member) / Olson, Clark (Committee member) / Ellsworth, Angela (Committee member) / Arizona State University (Publisher)
Created2013
153795-Thumbnail Image.png
Description
Waiting for a Passenger / Ship to Go to Sea is a performance made by In Kyung Lee and performed by five dancers. It premiered in Americas Gallery at ASU Art Museum on January 20, January 24, and Jan 27, 2015. The work existed in a container of geometric spatial

Waiting for a Passenger / Ship to Go to Sea is a performance made by In Kyung Lee and performed by five dancers. It premiered in Americas Gallery at ASU Art Museum on January 20, January 24, and Jan 27, 2015. The work existed in a container of geometric spatial structure and cyclical rhythmic cycles, which were filled with repetition, accumulation, and minimalistic durational movement vocabulary. The dancers courageously ventured through the rigorous and exacting structure, transforming individual and collective struggles and vulnerabilities into the beauty of being human. This document looks into the background and creation process of the work.
ContributorsYi, In-gyŏng (Author) / Standley, Eileen (Thesis advisor) / Ellsworth, Angela (Committee member) / Fitzgerald, Mary (Committee member) / Arizona State University (Publisher)
Created2015
133359-Thumbnail Image.png
Description
The current trend of interconnected devices, or the internet of things (IOT) has led to the popularization of single board computers (SBC). This is primarily due to their form-factor and low price. This has led to unique networks of devices that can have unstable network connections and minimal processing power.

The current trend of interconnected devices, or the internet of things (IOT) has led to the popularization of single board computers (SBC). This is primarily due to their form-factor and low price. This has led to unique networks of devices that can have unstable network connections and minimal processing power. Many parallel program- ming libraries are intended for use in high performance computing (HPC) clusters. Unlike the IOT environment described, HPC clusters will in general look to obtain very consistent network speeds and topologies. There are a significant number of software choices that make up what is referred to as the HPC stack or parallel processing stack. My thesis focused on building an HPC stack that would run on the SCB computer name the Raspberry Pi. The intention in making this Raspberry Pi cluster is to research performance of MPI implementations in an IOT environment, which had an impact on the design choices of the cluster. This thesis is a compilation of my research efforts in creating this cluster as well as an evaluation of the software that was chosen to create the parallel processing stack.
ContributorsO'Meara, Braedon Richard (Author) / Meuth, Ryan (Thesis director) / Dasgupta, Partha (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
133381-Thumbnail Image.png
Description
This thesis discusses three recent optimization problems that seek to reduce disease spread on arbitrary graphs by deleting edges, and it discusses three approximation algorithms developed for these problems. Important definitions are presented including the Linear Threshold and Triggering Set models and the set function properties of submodularity and monotonicity.

This thesis discusses three recent optimization problems that seek to reduce disease spread on arbitrary graphs by deleting edges, and it discusses three approximation algorithms developed for these problems. Important definitions are presented including the Linear Threshold and Triggering Set models and the set function properties of submodularity and monotonicity. Also, important results regarding the Linear Threshold model and computation of the influence function are presented along with proof sketches. The three main problems are formally presented, and NP-hardness results along with proof sketches are presented where applicable. The first problem seeks to reduce spread of infection over the Linear Threshold process by making use of an efficient tree data structure. The second problem seeks to reduce the spread of infection over the Linear Threshold process while preserving the PageRank distribution of the input graph. The third problem seeks to minimize the spectral radius of the input graph. The algorithms designed for these problems are described in writing and with pseudocode, and their approximation bounds are stated along with time complexities. Discussion of these algorithms considers how these algorithms could see real-world use. Challenges and the ways in which these algorithms do or do not overcome them are noted. Two related works, one which presents an edge-deletion disease spread reduction problem over a deterministic threshold process and the other which considers a graph modification problem aimed at minimizing worst-case disease spread, are compared with the three main works to provide interesting perspectives. Furthermore, a new problem is proposed that could avoid some issues faced by the three main problems described, and directions for future work are suggested.
ContributorsStanton, Andrew Warren (Author) / Richa, Andrea (Thesis director) / Czygrinow, Andrzej (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
131504-Thumbnail Image.png
Description
In the last few years, billion-dollar companies like Yahoo and Equifax have had data breaches causing millions of people’s personal information to be leaked online. Other billion-dollar companies like Google and Facebook have gotten in trouble for abusing people’s personal information for financial gain as well. In this new age

In the last few years, billion-dollar companies like Yahoo and Equifax have had data breaches causing millions of people’s personal information to be leaked online. Other billion-dollar companies like Google and Facebook have gotten in trouble for abusing people’s personal information for financial gain as well. In this new age of technology where everything is being digitalized and stored online, people all over the world are concerned about what is happening to their personal information and how they can trust it is being kept safe. This paper describes, first, the importance of protecting user data, second, one easy tool that companies and developers can use to help ensure that their user’s information (credit card information specifically) is kept safe, how to implement that tool, and finally, future work and research that needs to be done. The solution I propose is a software tool that will keep credit card data secured. It is only a small step towards achieving a completely secure data anonymized system, but when implemented correctly, it can reduce the risk of credit card data from being exposed to the public. The software tool is a script that can scan every viable file in any given system, server, or other file-structured Linux system and detect if there any visible credit card numbers that should be hidden.
ContributorsPappas, Alexander (Author) / Zhao, Ming (Thesis director) / Kuznetsov, Eugene (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
131514-Thumbnail Image.png
Description
Political polarization is the coalescence of political parties -- and the individuals of which parties are composed -- around opposing ends of the ideological spectrum. Political parties in the United States have always been divided, however, in recent years this division has only intensified. Recently, polarization has also wound its

Political polarization is the coalescence of political parties -- and the individuals of which parties are composed -- around opposing ends of the ideological spectrum. Political parties in the United States have always been divided, however, in recent years this division has only intensified. Recently, polarization has also wound its way to the Supreme Court and the nomination processes of justices to the Court. This paper examines how prevalent polarization in the Supreme Court nomination process has become by looking specifically at the failed nomination of Judge Merrick Garland and the confirmations of now-Justices Neil Gorsuch and Brett Kavanaugh. This is accomplished by comparing the ideologies and qualifications of the three most recent nominees to those of previous nominees, as well as analysing the ideological composition of the Senate at the times of the individual nominations.
ContributorsJoss, Jacob (Author) / Hoekstra, Valerie (Thesis director) / Critchlow, Donald (Committee member) / Computer Science and Engineering Program (Contributor) / School of Politics and Global Studies (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
131525-Thumbnail Image.png
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

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.
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
131529-Thumbnail Image.png
Description
RecyclePlus is an iOS mobile application that allows users to be knowledgeable in the realms of sustainability. It gives encourages users to be environmental responsible by providing them access to recycling information. In particular, it allows users to search up certain materials and learn about its recyclability and how to

RecyclePlus is an iOS mobile application that allows users to be knowledgeable in the realms of sustainability. It gives encourages users to be environmental responsible by providing them access to recycling information. In particular, it allows users to search up certain materials and learn about its recyclability and how to properly dispose of the material. Some searches will show locations of facilities near users that collect certain materials and dispose of the materials properly. This is a full stack software project that explores open source software and APIs, UI/UX design, and iOS development.
ContributorsTran, Nikki (Author) / Ganesh, Tirupalavanam (Thesis director) / Meuth, Ryan (Committee member) / Watts College of Public Service & Community Solut (Contributor) / Department of Information Systems (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
131537-Thumbnail Image.png
Description
At present, the vast majority of human subjects with neurological disease are still diagnosed through in-person assessments and qualitative analysis of patient data. In this paper, we propose to use Topological Data Analysis (TDA) together with machine learning tools to automate the process of Parkinson’s disease classification and severity assessment.

At present, the vast majority of human subjects with neurological disease are still diagnosed through in-person assessments and qualitative analysis of patient data. In this paper, we propose to use Topological Data Analysis (TDA) together with machine learning tools to automate the process of Parkinson’s disease classification and severity assessment. An automated, stable, and accurate method to evaluate Parkinson’s would be significant in streamlining diagnoses of patients and providing families more time for corrective measures. We propose a methodology which incorporates TDA into analyzing Parkinson’s disease postural shifts data through the representation of persistence images. Studying the topology of a system has proven to be invariant to small changes in data and has been shown to perform well in discrimination tasks. The contributions of the paper are twofold. We propose a method to 1) classify healthy patients from those afflicted by disease and 2) diagnose the severity of disease. We explore the use of the proposed method in an application involving a Parkinson’s disease dataset comprised of healthy-elderly, healthy-young and Parkinson’s disease patients.
ContributorsRahman, Farhan Nadir (Co-author) / Nawar, Afra (Co-author) / Turaga, Pavan (Thesis director) / Krishnamurthi, Narayanan (Committee member) / Electrical Engineering Program (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
133896-Thumbnail Image.png
Description
After freelancing on my own for the past year and a half, I have realized that one of the biggest obstacles to college entrepreneurs is a fear or apprehension to sales. As a computer science major trying to sell my services, I discovered very quickly that I had not been

After freelancing on my own for the past year and a half, I have realized that one of the biggest obstacles to college entrepreneurs is a fear or apprehension to sales. As a computer science major trying to sell my services, I discovered very quickly that I had not been prepared for the difficulty of learning sales. Sales get a bad rap and very often is the last thing that young entrepreneurs want to try, but the reality is that sales is oxygen to a company and a required skill for an entrepreneur. Due to this, I compiled all of my knowledge into an e-book for young entrepreneurs starting out to learn how to open up a conversation with a prospect all the way to closing them on the phone. Instead of starting from scratch like I did, college entrepreneurs can learn the bare basics of selling their own services, even if they are terrified of sales and what it entails. In this e-book, there are tips that I have learned to deal with my anxiety about sales such as taking the pressure off of yourself and prioritizing listening more than pitching. Instead of trying to teach sales expecting people to be natural sales people, this e-book takes the approach of helping entrepreneurs that are terrified of sales and show them how they can cope with this fear and still close a client. In the future, I hope young entrepreneurs will have access to more resources that handle this fear and make it much easier for them to learn it by themselves. This e-book is the first step.
ContributorsMead, Kevin Tyler (Author) / Sebold, Brent (Thesis director) / Kruse, Gabriel (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05