Matching Items (2,471)
Filtering by

Clear all filters

ContributorsFletcher, Michelle (Performer) / Telling, Emily (Performer) / Wheeler-Roderer, Laurana (Performer) / Witherell, Esther (Performer) / Giauque, Hana (Performer) / Choe, Gina (Performer) / Yang, Tzui (Performer) / ASU Library. Music Library (Publisher)
Created2023-10-27
Description
Gerrymandering involves the purposeful manipulation of districts in order to gain some political advantage. Because legislators have a vested interest in continuing their tenure, they can easily hijack the redistricting process each decade for their and their political party's benefit. This threatens the cornerstone of democracy: a voter’s capability to

Gerrymandering involves the purposeful manipulation of districts in order to gain some political advantage. Because legislators have a vested interest in continuing their tenure, they can easily hijack the redistricting process each decade for their and their political party's benefit. This threatens the cornerstone of democracy: a voter’s capability to select an elected official that accurately represents their interests. Instead, gerrymandering has legislators to choose their voters. In recent years, the Supreme Court has heard challenges to state legislature-drawn districts, most recently in Allen v. Milligan for Alabama and Moore v. Harper for North Carolina. The highest court of the United States ruled that the two state maps were gerrymandered, and in coming to their decision, the 9 justices relied on a plethora of amicus briefs- one of which included the Markov Chain Monte Carlo method, a computational method used to find gerrymandering. Because of how widespread gerrymandering has become on both sides of the political aisle, states have moved to create independent redistricting commissions. Qualitative research regarding the efficacy of independent commissions is present, but there is little research using the quantitative computational methods from these SCOTUS cases. As a result, my thesis will use the Markov Chain Monte Carlo method to answer if impartial redistricting commissions (like we have in Arizona) actually preclude unfair redistricting practices. My completed project is located here: https://dheetideliwala.github.io/honors-thesis/
ContributorsDeliwala, Dheeti (Author) / Bryan, Chris (Thesis director) / Strickland, James (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor) / School of Politics and Global Studies (Contributor)
Created2023-12
ContributorsDeliwala, Dheeti (Author) / Bryan, Chris (Thesis director) / Strickland, James (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor) / School of Politics and Global Studies (Contributor)
Created2023-12
ContributorsDeliwala, Dheeti (Author) / Bryan, Chris (Thesis director) / Strickland, James (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor) / School of Politics and Global Studies (Contributor)
Created2023-12
ContributorsGuevara, Jose Antonio (Performer) / Novak, Gail (Pianist) (Performer) / Boyd, Liam (Performer) / Fern, Ellie (Performer) / ASU Library. Music Library (Publisher)
Created2023-10-29
190728-Thumbnail Image.png
Description
Human civilization within the last two decades has largely transformed into an online one, with many of its associated activities taking place on computers and complex networked systems -- their analog and real-world equivalents having been rendered obsolete.These activities run the gamut from the ordinary and mundane, like ordering food,

Human civilization within the last two decades has largely transformed into an online one, with many of its associated activities taking place on computers and complex networked systems -- their analog and real-world equivalents having been rendered obsolete.These activities run the gamut from the ordinary and mundane, like ordering food, to complex and large-scale, such as those involving critical infrastructure or global trade and communications. Unfortunately, the activities of human civilization also involve criminal, adversarial, and malicious ones with the result that they also now have their digital equivalents. Ransomware, malware, and targeted cyberattacks are a fact of life today and are instigated not only by organized criminal gangs, but adversarial nation-states and organizations as well. Needless to say, such actions result in disastrous and harmful real-world consequences. As the complexity and variety of software has evolved, so too has the ingenuity of attacks that exploit them; for example modern cyberattacks typically involve sequential exploitation of multiple software vulnerabilities.Compared to a decade ago, modern software stacks on personal computers, laptops, servers, mobile phones, and even Internet of Things (IoT) devices involve a dizzying array of interdependent programs and software libraries, with each of these components presenting attractive attack-surfaces for adversarial actors. However, the responses to this still rely on paradigms that can neither react quickly enough nor scale to increasingly dynamic, ever-changing, and complex software environments. Better approaches are therefore needed, that can assess system readiness and vulnerabilities, identify potential attack vectors and strategies (including ways to counter them), and proactively detect vulnerabilities in complex software before they can be exploited. In this dissertation, I first present a mathematical model and associated algorithms to identify attacker strategies for sequential cyberattacks based on attacker state, attributes and publicly-available vulnerability information.Second, I extend the model and design algorithms to help identify defensive courses of action against attacker strategies. Finally, I present my work to enhance the ability of coverage-based fuzzers to identify software vulnerabilities by providing visibility into complex, internal program-states.
ContributorsPaliath, Vivin Suresh (Author) / Doupe, Adam (Thesis advisor) / Shoshitaishvili, Yan (Thesis advisor) / Wang, Ruoyu (Committee member) / Shakarian, Paulo (Committee member) / Arizona State University (Publisher)
Created2023
156643-Thumbnail Image.png
Description
When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms

When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user’s ability to perceive graph properties for a given graph layout. This study applies previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. A large scale (n = 588) crowdsourced experiment is conducted to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber’s law. Three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS) are studied, and the results of this experiment establish the precision of judgment for these graph layouts and properties. The findings demonstrate that the perception of graph density can be modeled with Weber’s law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber’s law, and the MDS layout showed a significantly different precision of judgment than the FD layout.
ContributorsSoni, Utkarsh (Author) / Maciejewski, Ross (Thesis advisor) / Kobourov, Stephen (Committee member) / Sefair, Jorge (Committee member) / Arizona State University (Publisher)
Created2018
158427-Thumbnail Image.png
Description
ABSTRACT



"The Soul Unto Itself," a chamber music song cycle, was commissioned by the author, Rosa LoGiudice, and composed by William Clay, a doctoral candidate in composition at Arizona State University. The cycle was conceived and composed in the summer and fall

ABSTRACT



"The Soul Unto Itself," a chamber music song cycle, was commissioned by the author, Rosa LoGiudice, and composed by William Clay, a doctoral candidate in composition at Arizona State University. The cycle was conceived and composed in the summer and fall of 2019. The chamber ensemble was a sextet comprised of Megan Law, mezzo-soprano, Kristi Hanno, clarinet, Emilio Vazquez, violin, Rittika Gambhir, bassoon, Nathaniel De la Cruz, double bass, and Rosa LoGiudice, piano, all based in Tempe, Arizona. The song cycle was premiered in a lecture recital on December 8, 2019 at Hammer and Strings Conservatory in Gilbert, AZ.

"The Soul Unto Itself" is a cycle of six songs based on poems of Emily Dickinson. The poems all have common themes of personal transformation achieved through the introspective observations of the poet. An unusual chamber ensemble was chosen to include instruments not commonly used in vocal chamber music in order to create a greater variety of musical colors and timbres. This project included the creation of the musical score, a live performance that was video recorded, and the research paper. This document discusses the process of working with the composer, rehearsing the music as it was being composed, and negotiating revisions necessary to make the music more effective in performance. Each song is discussed in detail, especially the connection between the music and poetry, the overall form of the song, revisions discussed and implemented, and important motivic relationships between the songs that unify the cycle. In summary, the process of collaborating with a composer is a rewarding experience for both the performers and the composer, as everyone is challenged to improve their craft and overcome obstacles to achieve a successful performance.
ContributorsLoGiudice, Rosa Mia (Author) / Campbell, Andrew (Thesis advisor) / Ryan, Russell (Committee member) / Rockmaker, Jody (Committee member) / Arizona State University (Publisher)
Created2020
192577-Thumbnail Image.png
Description

American Sign Language (ASL) is used for Deaf and Hard of Hearing (DHH) individuals to communicate and learn in a classroom setting. In ASL, fingerspelling and gestures are two primary components used for communication. Fingerspelling is commonly used for words that do not have a specifically designated sign or gesture.

American Sign Language (ASL) is used for Deaf and Hard of Hearing (DHH) individuals to communicate and learn in a classroom setting. In ASL, fingerspelling and gestures are two primary components used for communication. Fingerspelling is commonly used for words that do not have a specifically designated sign or gesture. In technical contexts, such as Computer Science curriculum, there are many technical terms that fall under this category. Most of its jargon does not have standardized ASL gestures; therefore, students, educators, and interpreters alike have been reliant on fingerspelling, which poses challenges for all parties. This study investigates the efficacy of both fingerspelling and gestures with fifteen technical terms that do have standardized gestures. The terms’ fingerspelling and gesture are assessed based on preference, ease of use, ease of learning, and time by research subjects who were selected as DHH individuals familiar with ASL.

The data is collected in a series of video recordings by research subjects as well as a post-participation questionnaire. Each research subject has produced thirty total videos, two videos to fingerspell and gesture each technical term. Afterwards, they completed a post-participation questionnaire in which they indicated their preference and how easy it was to learn and use both fingerspelling and gestures. Additionally, the videos have been analyzed to determine the time difference between fingerspelling and gestures. Analysis reveals that gestures are favored over fingerspelling as they are generally preferred, considered easier to learn and use, and faster. These results underscore the significance for standardized gestures in the Computer Science curriculum for accessible learning that enhances communication and promotes inclusion.

ContributorsKarim, Bushra (Author) / Gupta, Sandeep (Thesis director) / Hossain, Sameena (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor) / School of International Letters and Cultures (Contributor)
Created2024-05
192724-Thumbnail Image.png
Description
This thesis details a Python-based software designed to calculate the Jones polynomial, a vital mathematical tool from Knot Theory used for characterizing the topological and geometrical complexity of curves in 3-space, which is essential in understanding physical systems of filaments, including the behavior of polymers and biopolymers. The Jones polynomial serves as a topological

This thesis details a Python-based software designed to calculate the Jones polynomial, a vital mathematical tool from Knot Theory used for characterizing the topological and geometrical complexity of curves in 3-space, which is essential in understanding physical systems of filaments, including the behavior of polymers and biopolymers. The Jones polynomial serves as a topological invariant capable of distinguishing between different knot structures. This capability is fundamental to characterizing the architecture of molecular chains, such as proteins and DNA. Traditional computational methods for deriving the Jones polynomial have been limited by closure-schemes and high execu- tion costs, which can be impractical for complex structures like those that appear in real life. This software implements methods that significantly reduce calculation times, allowing for more efficient and practical applications in the study of biological poly- mers. It utilizes a divide-and-conquer approach combined with parallel computing and applies recursive Reidemeister moves to optimize the computation, transitioning from an exponential to a near-linear runtime for specific configurations. This thesis provides an overview of the software’s functions, detailed performance evaluations using protein structures as test cases, and a discussion of the implications for future research and potential algorithmic improvements.
ContributorsMusfeldt, Caleb (Author) / Panagiotou, Eleni (Thesis director) / Richa, Andrea (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Historical, Philosophical & Religious Studies, Sch (Contributor)
Created2024-05