Barrett, The Honors College at Arizona State University proudly showcases the work of undergraduate honors students by sharing this collection exclusively with the ASU community.

Barrett accepts high performing, academically engaged undergraduate students and works with them in collaboration with all of the other academic units at Arizona State University. All Barrett students complete a thesis or creative project which is an opportunity to explore an intellectual interest and produce an original piece of scholarly research. The thesis or creative project is supervised and defended in front of a faculty committee. Students are able to engage with professors who are nationally recognized in their fields and committed to working with honors students. Completing a Barrett thesis or creative project is an opportunity for undergraduate honors students to contribute to the ASU academic community in a meaningful way.

Displaying 1 - 10 of 49
134157-Thumbnail Image.png
Description
This paper details the specification and implementation of a single-machine blockchain simulator. It also includes a brief introduction on the history & underlying concepts of blockchain, with explanations on features such as decentralization, openness, trustlessness, and consensus. The introduction features a brief overview of public interest and current implementations of

This paper details the specification and implementation of a single-machine blockchain simulator. It also includes a brief introduction on the history & underlying concepts of blockchain, with explanations on features such as decentralization, openness, trustlessness, and consensus. The introduction features a brief overview of public interest and current implementations of blockchain before stating potential use cases for blockchain simulation software. The paper then gives a brief literature review of blockchain's role, both as a disruptive technology and a foundational technology. The literature review also addresses the potential and difficulties regarding the use of blockchain in Internet of Things (IoT) networks, and also describes the limitations of blockchain in general regarding computational intensity, storage capacity, and network architecture. Next, the paper gives the specification for a generic blockchain structure, with summaries on the behaviors and purposes of transactions, blocks, nodes, miners, public & private key cryptography, signature validation, and hashing. Finally, the author gives an overview of their specific implementation of the blockchain using C/C++ and OpenSSL. The overview includes a brief description of all the classes and data structures involved in the implementation, including their function and behavior. While the implementation meets the requirements set forward in the specification, the results are more qualitative and intuitive, as time constraints did not allow for quantitative measurements of the network simulation. The paper concludes by discussing potential applications for the simulator, and the possibility for future hardware implementations of blockchain.
ContributorsRauschenbach, Timothy Rex (Author) / Vrudhula, Sarma (Thesis director) / Nakamura, Mutsumi (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2017-12
134325-Thumbnail Image.png
Description
This thesis project examines the likely factors that cause students to drop out of Barrett, the Honors College. Honors literature regarding retention and attrition suggests four areas encompassing individual student attributes and honors program characteristics which may impact a student's decision to stay or leave an Honors College. The primary

This thesis project examines the likely factors that cause students to drop out of Barrett, the Honors College. Honors literature regarding retention and attrition suggests four areas encompassing individual student attributes and honors program characteristics which may impact a student's decision to stay or leave an Honors College. The primary question in focus is, "Why do students leave the Honors College?" followed by the tertiary questions of, "what can be done to mitigate this occurrence?" and, "how does this affect the quality of an honors education?" Assessing attrition can be broken down into biographical, cognitive-behavioral, socio-environmental, and institutional-instrumental components. Students who graduated with honors and those who did not graduate with honors were assessed on these four components through survey methods and qualitative interviews to investigate specific reasons why students leave the honors program. The results indicated a wide array of reasons impacting student attrition, the most significant being negative perceptions towards (1) honors courses and contracts, (2) difficulty completing a thesis project, and (3) finding little to no value in "graduating with honors." Each of these reasons reflect the institutional-instrumental component of student attrition, making it the most salient group of reasons why students leave the Honors College. The socio-environmental component also influences student attrition through peer influence and academic advisor support, though this was found to be within the context of institutional-instrumental means. This project offers solutions to ameliorate each of the four components of attrition by offering standardized honors contracts and more mandatory honors classes, mandatory thesis preparatory courses instead of workshops, and emphasizing the benefit Barrett gives to students as a whole. These solutions aim at increasing graduation rates for future honors students at Barrett as well as improving the overall quality of an honors education.
ContributorsSanchez, Gilbert Xavier (Author) / Parker, John (Thesis director) / O'Flaherty, Katherine (Committee member) / School of Criminology and Criminal Justice (Contributor) / Department of Psychology (Contributor) / Barrett, The Honors College (Contributor)
Created2017-05
135380-Thumbnail Image.png
Description
Bioscience High School, a small magnet high school located in Downtown Phoenix and a STEAM (Science, Technology, Engineering, Arts, Math) focused school, has been pushing to establish a computer science curriculum for all of their students from freshman to senior year. The school's Mision (Mission and Vision) is to: "..provide

Bioscience High School, a small magnet high school located in Downtown Phoenix and a STEAM (Science, Technology, Engineering, Arts, Math) focused school, has been pushing to establish a computer science curriculum for all of their students from freshman to senior year. The school's Mision (Mission and Vision) is to: "..provide a rigorous, collaborative, and relevant academic program emphasizing an innovative, problem-based curriculum that develops literacy in the sciences, mathematics, and the arts, thus cultivating critical thinkers, creative problem-solvers, and compassionate citizens, who are able to thrive in our increasingly complex and technological communities." Computational thinking is an important part in developing a future problem solver Bioscience High School is looking to produce. Bioscience High School is unique in the fact that every student has a computer available for him or her to use. Therefore, it makes complete sense for the school to add computer science to their curriculum because one of the school's goals is to be able to utilize their resources to their full potential. However, the school's attempt at computer science integration falls short due to the lack of expertise amongst the math and science teachers. The lack of training and support has postponed the development of the program and they are desperately in need of someone with expertise in the field to help reboot the program. As a result, I've decided to create a course that is focused on teaching students the concepts of computational thinking and its application through Scratch and Arduino programming.
ContributorsLiu, Deming (Author) / Meuth, Ryan (Thesis director) / Nakamura, Mutsumi (Committee member) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
136617-Thumbnail Image.png
Description
We created an Android application, Impromp2, which allows users to search for and save events of interest to them in the Phoenix area. The backend, built on the Parse platform, gathers events daily using Web services and stores them in a database. Impromp2 was designed to improve upon similarly-purposed apps

We created an Android application, Impromp2, which allows users to search for and save events of interest to them in the Phoenix area. The backend, built on the Parse platform, gathers events daily using Web services and stores them in a database. Impromp2 was designed to improve upon similarly-purposed apps available for Android devices in several key ways, especially in user interface design and data interaction capability. This is a full-stack software project that explores databases and their performance considerations, Web services, user interface design, and the challenges of app development for a mobile platform.
ContributorsNorth, Joseph Robert (Author) / Balasooriya, Janaka (Thesis director) / Nakamura, Mutsumi (Committee member) / Faucon, Philippe (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2015-05
133803-Thumbnail Image.png
Description
Zoraida Ladrón de Guevarra was born in 1936 in Coyula, Mexico, a small village in the state of Oaxaca. Her father’s passing required Zoraida to find a job at age fourteen to support her family. Her story, a 200-page memoir entitled “After Papa Died,” follows Zoraida’s time as a servant

Zoraida Ladrón de Guevarra was born in 1936 in Coyula, Mexico, a small village in the state of Oaxaca. Her father’s passing required Zoraida to find a job at age fourteen to support her family. Her story, a 200-page memoir entitled “After Papa Died,” follows Zoraida’s time as a servant and eventual nanny in Veracruz. Flashing back to memories of her hometown and the people living in it, the story ends before she enters America first as a visitor in 1954, and later on a working Visa in 1957—the first woman in her village to leave to the United States. Hers is a story relevant today, evident with the paradoxes explored between poverty and riches, patriarchy and matriarchy, freedom and captivity. Assimilation impacts the reading of this memoir, as Zoraida began writing the memoir in her 80s (around fifty years after gaining American citizenship). This detailed family history is about the nature of memory, community, and in particular, the experience of being an immigrant. This thesis project centers on this text and includes three components: an edited memoir, informational interviews, and an introduction. Beginning as a diary steeped in the tradition of oral history, the memoir required a “translation” into a written form; chapters and chronological continuity helped with organization. Topics of interest from the story, such as identity, domestic violence, and religion, are further explored in a series of interviews with Zoraida. The inclusion of an introduction to the text contextualizes the stories documented in the memoir with supplemental information. The contents of the project are housed on a website: alongwaybabyproject.net.
ContributorsVan Slyke, Shea Elizabeth (Author) / Meloy, Elizabeth (Thesis director) / O'Flaherty, Katherine (Committee member) / Department of Supply Chain Management (Contributor) / Department of English (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
133853-Thumbnail Image.png
Description
For my thesis project, I have developed a cash register web application for the Arizona State University Barrett Dining Hall. I previously worked at the Barrett Dining Hall, and I would occasionally step in as a cashier. This work is how I came to be familiar with the system and

For my thesis project, I have developed a cash register web application for the Arizona State University Barrett Dining Hall. I previously worked at the Barrett Dining Hall, and I would occasionally step in as a cashier. This work is how I came to be familiar with the system and all its inefficiencies. The system requires multiple user inputs to implement even the most basic of tasks, is not user-friendly, and therefore very prone to error. In the event that multiple incorrect inputs are entered, the software will freeze, and the user will have to turn off the computer and turn it back on. In theory, this application is an improvement over the software system that is currently in place in that the user interface has been specifically designed to be user-friendly. This application reduces the number of required user inputs by automating certain tasks (such as pricing and determining the meal period), thereby reducing the chance of user error. It is also an improvement in that it allows students to log in to the system to view how many meals they have left, how much M&G is in their account, and how many guest passes they have left. This functionality is extremely important because this is a feature that is not currently in place, and is something that students have actively complained about. Currently, if students want to check on their meal plan, they have to either physically go to a dining hall and ask the cashier, or call a toll-free number. The two technologies used to develop this application are C# and XML. These technologies were chosen because I wanted to learn something new for this project to broaden my knowledge. I also happened to be taking a class at the start of this project that utilized C# and XML for Web Applications, and it seemed like the perfect opportunity to transfer over the skills I had been learning.
ContributorsLewis, Q. Mariha Paishance (Author) / Chen, Yinong (Thesis director) / Nakamura, Mutsumi (Committee member) / School of International Letters and Cultures (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
137462-Thumbnail Image.png
Description
Web-application development constantly changes \u2014 new programming languages, testing tools and programming methodologies are often proposed. The focus of this project is on the tool Selenium and the fairly new technique known as High Volume Automated Testing (HVAT). Both of these techniques were used to test the Just-in-Time Teaching and

Web-application development constantly changes \u2014 new programming languages, testing tools and programming methodologies are often proposed. The focus of this project is on the tool Selenium and the fairly new technique known as High Volume Automated Testing (HVAT). Both of these techniques were used to test the Just-in-Time Teaching and Learning Classroom Management System software. Selenium was used with a black-box testing technique and HVAT was employed in a white-box testing technique. Two of the major functionalities of this software were examined, which include the login and the professor functionality. The results of the black-box testing technique showed parts of the login component contain bugs, but the professor component is clean. HVAT white-box testing revealed error free implementation on the code level. We present an analysis on a new technique for HVAT testing with Selenium.
ContributorsEjaz, Samira (Author) / Balasooriya, Janaka (Thesis director) / Nakamura, Mutsumi (Committee member) / Wilkerson, Kelly (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor)
Created2013-05
135236-Thumbnail Image.png
Description
Tenga is an e-commerce demo web application for students studying Distributed Software Development and Software Integration and Engineering at Arizona State University (ASU). The application, written in C#, aims to empower students to understand how complex systems are build. Complementing the two courses taught at ASU, it seeks to demonstrate

Tenga is an e-commerce demo web application for students studying Distributed Software Development and Software Integration and Engineering at Arizona State University (ASU). The application, written in C#, aims to empower students to understand how complex systems are build. Complementing the two courses taught at ASU, it seeks to demonstrate how the concepts taught in the two classes can be applied to the real world. In addition to the practical software development process, Tenga also bring in the topics that students are inexperienced with such as recommendation systems and ranking algorithms. Tenga is going to be used in classrooms to help students to learn fundamental issues in Web software development and software integration and to understand tools and skill sets required to built a web application.
ContributorsKawanzaruwa, Allen Tom (Author) / Chen, Yinong (Thesis director) / Nakamura, Mutsumi (Committee member) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
135246-Thumbnail Image.png
Description
The areas of cloud computing and web services have grown rapidly in recent years, resulting in software that is more interconnected and and widely used than ever before. As a result of this proliferation, there needs to be a way to assess the quality of these web services in order

The areas of cloud computing and web services have grown rapidly in recent years, resulting in software that is more interconnected and and widely used than ever before. As a result of this proliferation, there needs to be a way to assess the quality of these web services in order to ensure their reliability and accuracy. This project explores different ways in which services can be tested and evaluated through the design of various testing techniques and their implementations in a web application, which can be used by students or developers to test their web services.
ContributorsHilliker, Mark Paul (Author) / Chen, Yinong (Thesis director) / Nakamura, Mutsumi (Committee member) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
135251-Thumbnail Image.png
Description
Many systems in the world \u2014 such as cellular networks, the post service, or transportation pathways \u2014 can be modeled as networks or graphs. The practical applications of graph algorithms generally seek to achieve some goal while minimizing some cost such as money or distance. While the minimum linear arrangement

Many systems in the world \u2014 such as cellular networks, the post service, or transportation pathways \u2014 can be modeled as networks or graphs. The practical applications of graph algorithms generally seek to achieve some goal while minimizing some cost such as money or distance. While the minimum linear arrangement (MLA) problem has been widely-studied amongst graph ordering and embedding problems, there have been no developments into versions of the problem involving degree higher than 2. An application of our problem can be seen in overlay networks in telecommunications. An overlay network is a virtual network that is built on top of another network. It is a logical network where the links between nodes represent the physical paths connecting the nodes in the underlying infrastructure. The underlying physical network may be incomplete, but as long as it is connected, we can build a complete overlay network on top of it. Since some nodes may be overloaded by traffic, we can reduce the strain on the overlay network by limiting the communication between nodes. Some edges, however, may have more importance than others so we must be careful about our selection of which nodes are allowed to communicate with each other. The balance of reducing the degree of the network while maximizing communication forms the basis of our d-degree minimum arrangement problem. In this thesis we will look at several approaches to solving the generalized d-degree minimum arrangement d-MA problem where we embed a graph onto a subgraph of a given degree. We first look into the requirements and challenges of solving the d-MA problem. We will then present a polynomial-time heuristic and compare its performance with the optimal solution derived from integer linear programming. We will show that a simple (d-1)-ary tree construction provides the optimal structure for uniform graphs with large requests sets. Finally, we will present experimental data gathered from running simulations on a variety of graphs to evaluate the efficiency of our heuristic and tree construction.
ContributorsWang, Xiao (Author) / Richa, Andrea (Thesis director) / Nakamura, Mutsumi (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05