Filtering by
- All Subjects: Computer Science
- Creators: Barrett, The Honors College
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
- Resource Type: Text
Among classes in the Computer Science curriculum at Arizona State University, Automata Theory is widely considered to be one of the most difficult. Many Computer Science concepts have strong visual components that make them easier to understand. Binary trees, Dijkstra's algorithm, pointers, and even more basic concepts such as arrays all have very strong visual components. Not only that, but resources for them are abundantly available online. Automata Theory, on the other hand, is the first Computer Science course students encounter that has a significant focus on deep theory. Many
of the concepts can be difficult to visualize, or at least take a lot of effort to do so. Furthermore, visualizers for finite state machines are hard to come by. Because I thoroughly enjoyed learning about Automata Theory and parsers, I wanted to create a program that involved the two. Additionally, I thought creating a program for visualizing automata would help students who struggle with Automata Theory develop a stronger understanding of it.
This thesis explores how large scale cyber exercises work in the 21st century, going in-depth on Exercise Cyber Shield, the Department of Defense’s largest unclassified cyber defense exercise run by the Army National Guard. It highlights why these cyber exercises are so relevant, going over several large scale cyber attacks that have occurred in the past year and the impact they caused. This research aims to illuminate the intricacies around cyber exercise assessment involving manual vs automated scoring systems; this is brought back to work on creating an automated scoring engine for Exercise Cyber Shield. This thesis provides an inside look behind the scenes of the operations of the largest unclassified cyber defense exercise in the United States, including conversations with the Exercise Officer-In-Charge of Cyber Shield as well as a cyber exercise expert working on assessment of Exercise Cyber Shield, and the research also includes information from past final reports for Cyber Shield. Issues that these large scale cyber exercises have faced over the years are brought to light, and attempts at solutions are discussed.
This paper’s field of study falls into the cross section of geology and fire science, history, social conflict, public service ethics, and collaborative failures. I explore how a series of small choices snowballed into a full, government funded relocation effort after attempts at controlling the anthracite coal seam fire failed. Geology and fire science worked in tandem during the mine fire, influencing each other and complicating the firefighting efforts. The fire itself was a unique challenge. The history of Centralia played a large role in the government and community response efforts. I use the borough and regional history to contextualize the social conflict that divided Centralia. Social conflict impaired the community’s ability to unify and form a therapeutic community, and in turn, it damaged community-government relationships. The government agencies involved in the mine fire response did their own damage to community relationships by pursuing their own interests. Agencies worried about their brand image, and politicians worried about re-election. I study how these ethical failures impacted the situation. Finally, I look at a few examples of collaborative failures on behalf of the government and the community. Over the course of my research, it became apparent the people killed Centralia, not the fire.
For my creative project, I designed a website through which smaller, local tournament registration and management are possible. Users can register for tournaments through the registration page. Registered users can check their registration is successful by viewing a table of all competitors. If the list of competitors is too long, they can filter results based on search criteria. Tournament management will be possible via a functioning timer following WKF rules which keeps track of both the match’s score as well as time.
}}=\tau$. This research will focus on improving approximations on the lower bound of $\tau$. Toward this end we will examine algorithmic enumeration, and series analysis for self-avoiding polygons.