Matching Items (51)
Filtering by
- All Subjects: Education
- All Subjects: Computer Science
- Creators: School of Mathematical and Statistical Sciences
- Creators: Department of Economics
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
Description
Brundtland’s definition of sustainability is the ability to “meet the needs of the present<br/>without compromising the ability of future generations to meet their needs” (IISD, 2021). But<br/>what if there are no future generations? Social sustainability, the sector of sustainability that<br/>foregrounds the well-being and livelihoods of people (and thereby continuation of humanity), is<br/>included in definitions within the sustainability field, but less developed in sustainability<br/>practice. In an effort to bridge this gap of knowledge, 14 U.S. cities and over 100 sustainability<br/>policies were analyzed for their social sustainability performance. An eight-item analytical<br/>framework that deals with differing areas of social equity guided the analysis. Results found that<br/>most cities’ sustainability departments fell short of truly addressing social sustainability<br/>concerns. Out of the eight items, the most frequently addressed were housing security and racial<br/>and gender equality whereas few, if any, cities addressed the more specific social concerns of<br/>immigration, technology and media, or arts/cultural preservation. Future research is<br/>recommended to gain a better understanding of the ways existing cities can improve in this area.
ContributorsWeekes, Daniel Buckner (Co-author) / Tam, Joey (Co-author) / Brian, Jennifer (Thesis director) / Keeler, Lauren Withycombe (Thesis director) / N/A, N/A (Committee member) / Dean, W.P. Carey School of Business (Contributor) / Department of Economics (Contributor) / Department of Supply Chain Management (Contributor) / Barrett, The Honors College (Contributor)
Created2021-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
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
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
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
This thesis investigates the environment of support for reclassified English Language Learners (RCELLs) in Arizona schools. Arizona English Language Learner (ELL) policy and pedagogy have been the subjects of research nationwide; many studies demonstrate that ELLs struggle before, during and after participating in Arizona ELL programs (Lillie et al. 2012; Roa 2012; Garcia, Lawton & de Figuieredo 2012; Office of Civil Rights 2012). Despite evidence that the achievement gap between RCELLs and mainstream students is not closing, little information is available about additional language support that RCELLs might receive in mainstream classrooms. This thesis addresses that void of information through: 1) A literature review of the framework of RCELL support, as outlined by the Arizona Department of Education and relevant studies, and 2) a study of teacher and principal opinion about support components for RCELLs and whether such support is adequate. Study findings present that teachers and principals generally believe RCELLs are well-supported, in terms of both the availability and quality of study-defined support components. Yet there is only weak consensus among teachers that support components are adequate. Additionally, teachers' knowledgeability related to important RCELL support components is low, undermining the reliability of teacher responses. The disconnect between participants' optimistic perceptions of support and the external evidence of low RCELL achievement is rationalized by two conjectures. The first is that teachers are not knowledgeable about RCELL support components and cannot accurately gauge the quality of such support. The second is that existing support components are effective at assisting RCELLs with English learning but are not sufficient to close RCELL academic content achievement gaps.
ContributorsKelly, Cary Shepherd (Author) / Garcia, David (Thesis director) / Garcia, Eugene (Committee member) / Seleznow, Steven (Committee member) / Barrett, The Honors College (Contributor) / Department of Economics (Contributor) / W. P. Carey School of Business (Contributor)
Created2014-12
Description
Previous research discusses students' difficulties in grasping an operational understanding of covariational reasoning. In this study, I interviewed four undergraduate students in calculus and pre-calculus classes to determine their ways of thinking when working on an animated covariation problem. With previous studies in mind and with the use of technology, I devised an interview method, which I structured using multiple phases of pre-planned support. With these interviews, I gathered information about two main aspects about students' thinking: how students think when attempting to reason covariationally and which of the identified ways of thinking are most propitious for the development of an understanding of covariational reasoning. I will discuss how, based on interview data, one of the five identified ways of thinking about covariational reasoning is highly propitious, while the other four are somewhat less propitious.
ContributorsWhitmire, Benjamin James (Author) / Thompson, Patrick (Thesis director) / Musgrave, Stacy (Committee member) / Moore, Kevin C. (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / T. Denny Sanford School of Social and Family Dynamics (Contributor)
Created2014-05
Description
Computer simulations are gaining recognition as educational tools, but in general there is still a line dividing a simulation from a game. Yet as many recent and successful video games heavily involve simulations (SimCity comes to mind), there is not only the growing question of whether games can be used for educational purposes, but also of how a game might qualify as educational. Endemic: The Agent is a project that tries to bridge the gap between educational simulations and educational games. This paper outlines the creation of the project and the characteristics that make it an educational tool, a simulation, and a game.
ContributorsFish, Derek Austin (Author) / Karr, Timothy (Thesis director) / Marcus, Andrew (Committee member) / Jones, Donald (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2013-05
Description
Polar ice masses can be valuable indicators of trends in global climate. In an effort to better understand the dynamics of Arctic ice, this project analyzes sea ice concentration anomaly data collected over gridded regions (cells) and builds graphs based upon high correlations between cells. These graphs offer the opportunity to use metrics such as clustering coefficients and connected components to isolate representative trends in ice masses. Based upon this analysis, the structure of sea ice graphs differs at a statistically significant level from random graphs, and several regions show erratically decreasing trends in sea ice concentration.
ContributorsWallace-Patterson, Chloe Rae (Author) / Syrotiuk, Violet (Thesis director) / Colbourn, Charles (Committee member) / Montgomery, Douglas (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Computer Science and Engineering Program (Contributor)
Created2013-05
DescriptionThis project examines the television industry today, especially the field of educational programs. It includes the detailed implementation of one such show, a 30-minute demonstration of life skills, split into 3 segments. The pilot episode is also included.
ContributorsKesting, Amanda Jean (Author) / Alvarez, Melanie (Thesis director) / Snyder, Brian (Committee member) / Glaser, Ann (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Walter Cronkite School of Journalism and Mass Communication (Contributor)
Created2013-05