Matching Items (4)
Filtering by

Clear all filters

136058-Thumbnail Image.png
Description
Theory has often been historically characterized as lacking pragmatisms and action necessary for social change. Thus, as this challenge between pragmatists and theorists continues to exist, this project attempts to disclose a manner in which we may alter this conflict by reinterpreting theory, poetry, and philosophy as active political moments

Theory has often been historically characterized as lacking pragmatisms and action necessary for social change. Thus, as this challenge between pragmatists and theorists continues to exist, this project attempts to disclose a manner in which we may alter this conflict by reinterpreting theory, poetry, and philosophy as active political moments of resistance that fundamentally change our ethical relationship with language and consequently to others. This thesis recognizes that dire political situations of social injustice require a more materialistic and sociological analysis in order to achieve structural reform for marginalized groups. However, this work attempts to show how an ethical relationship with theory, poetry, and philosophy is requisite to cultural and material change, as these meditative ways of thinking hold a stake in the overall discussion of social progress as well.
ContributorsDel Rincon, Yessica (Contributor) / Ramsey, Ramsey Eric (Thesis director) / Kirsch, Sharon (Committee member) / Luna, Ilana (Committee member) / Barrett, The Honors College (Contributor)
Created2014-12
136069-Thumbnail Image.png
Description
This paper focuses on feudalist structure and values within this system in George R. R. Martin's fantasy novel series A Song of Ice and Fire and Shakespeare's play King Richard the Third. The paper is structured into three arguments that focus on different characters from each work. The first argument

This paper focuses on feudalist structure and values within this system in George R. R. Martin's fantasy novel series A Song of Ice and Fire and Shakespeare's play King Richard the Third. The paper is structured into three arguments that focus on different characters from each work. The first argument is focused on Tyrion Lannister and Richard III's deformity, and how they violate feudalist values. This argument ultimately comes to the discussion of whether or not these characters are monstrous and by what values. The second argument is focused on Daenerys Targaryen and Margaret, discussing why both authors give these women a supernatural power. The authors give women these powers because they believe that women should have power. Martin argues that women need to remake the structure, while Shakespeare believes women can change their place in the structure through collective action. The last argument focuses on Petyr Baelish and Richard III, and how they both represent a chaos attacking feudalism. Petyr is a chaos that comes outside the system, exploiting the values of the system, while Richard is a chaos within the system because he violates feudal values, while trying to hold positions where he needs to embody feudalist value. The authors come to different conclusions of what is trying to take down feudalist structure and how this could be fixed. Martin finds feudalism cannot be fixed and that other systems are not much better because they still create violence. Shakespeare comes to the conclusion that feudalism cannot be fixed because people continue to violate its values, so a new system must be put in place.
ContributorsPittaro, James Vincent (Author) / Mann, Annika (Thesis director) / Kirsch, Sharon (Committee member) / Barrett, The Honors College (Contributor) / School of Social and Behavioral Sciences (Contributor) / School of Humanities, Arts, and Cultural Studies (Contributor)
Created2015-05
134914-Thumbnail Image.png
Description
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and coating materials for engineering or programmable cells for medical uses. Previous research using this

Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and coating materials for engineering or programmable cells for medical uses. Previous research using this model has focused on shape formation and other spatial configuration problems, including line formation, compression, and coating. In this work we study foundational computational tasks that exceed the capabilities of the individual constant memory particles described by the model. These tasks represent new ways to use these self-organizing systems, which, in conjunction with previous shape and configuration work, make the systems useful for a wider variety of tasks. We present an implementation of a counter using a line of particles, which makes it possible for the line of particles to count to and store values much larger than their individual capacities. We then present an algorithm that takes a matrix and a vector as input and then sets up and uses a rectangular block of particles to compute the matrix-vector multiplication. This setup also utilizes the counter implementation to store the resulting vector from the matrix-vector multiplication. Operations such as counting and matrix multiplication can leverage the distributed and dynamic nature of the self-organizing system to be more efficient and adaptable than on traditional linear computing hardware. Such computational tools also give the systems more power to make complex decisions when adapting to new situations or to analyze the data they collect, reducing reliance on a central controller for setup and output processing. Finally, we demonstrate an application of similar types of computations with self-organizing systems to image processing, with an implementation of an image edge detection algorithm.
ContributorsPorter, Alexandra Marie (Author) / Richa, Andrea (Thesis director) / Xue, Guoliang (Committee member) / School of Music (Contributor) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12
135739-Thumbnail Image.png
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

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