Matching Items (28)
Filtering by

Clear all filters

131525-Thumbnail Image.png
Description
The original version of Helix, the one I pitched when first deciding to make a video game
for my thesis, is an action-platformer, with the intent of metroidvania-style progression
and an interconnected world map.

The current version of Helix is a turn based role-playing game, with the intent of roguelike
gameplay and a dark

The original version of Helix, the one I pitched when first deciding to make a video game
for my thesis, is an action-platformer, with the intent of metroidvania-style progression
and an interconnected world map.

The current version of Helix is a turn based role-playing game, with the intent of roguelike
gameplay and a dark fantasy theme. We will first be exploring the challenges that came
with programming my own game - not quite from scratch, but also without a prebuilt
engine - then transition into game design and how Helix has evolved from its original form
to what we see today.
ContributorsDiscipulo, Isaiah K (Author) / Meuth, Ryan (Thesis director) / Kobayashi, Yoshihiro (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
135452-Thumbnail Image.png
Description
According to the CDC, diabetes is the 7th leading cause of death in the U.S. and rates are continuing to rise nationally and internationally. Chronically elevated blood glucose levels can lead to type 2 diabetes and other complications. Medications can be used to treat diabetes, but often have side effects.

According to the CDC, diabetes is the 7th leading cause of death in the U.S. and rates are continuing to rise nationally and internationally. Chronically elevated blood glucose levels can lead to type 2 diabetes and other complications. Medications can be used to treat diabetes, but often have side effects. Lifestyle and diet modifications can be just as effective as medications in helping to improve glycemic control, and prevent diabetes or improve the condition in those who have it. Studies have demonstrated that consuming vinegar with carbohydrates can positively impact postprandial glycemia in diabetic and healthy individuals. Continuous vinegar intake with meals may even reduce fasting blood glucose levels. Since vinegar is a primary ingredient in mustard, the purpose of this study was to determine if mustard consumption with a carbohydrate-rich meal (bagel and fruit juice) had an effect on the postprandial blood glucose levels of subjects. The results showed that mustard improved glycemia by 17% when subjects consumed the meal with mustard as opposed to the control. A wide variety of vinegars exists. The defining ingredient in all vinegars is acetic acid, behind the improvement in glycemic response observed with vinegar ingestion. Vinegar-containing foods range from mustard, to vinaigrette dressings, to pickled foods. The benefits of vinegar ingestion with carbohydrates are dose-dependent, meaning that adding even small amounts to meals can help. Making a conscious effort to incorporate these foods into meals, in addition to an overall healthy lifestyle, could provide an additional tool for diabetics and nondiabetics alike to consume carbohydrates in a healthier manner.
ContributorsJimenez, Gabriela (Author) / Johnston, Carol (Thesis director) / Lespron, Christy (Committee member) / School of Nutrition and Health Promotion (Contributor) / School of International Letters and Cultures (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
136549-Thumbnail Image.png
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

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
136691-Thumbnail Image.png
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

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
136516-Thumbnail Image.png
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

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
136269-Thumbnail Image.png
Description
The development of the Diabetic Physiological state is influenced by the Receptor for Advanced Glycation End Products (RAGE). This receptor was discovered in 1992, and the accumulation of research on this subject has been extensive. Structural characterization studies of the RAGE protein have shown that it is a transmembrane protein

The development of the Diabetic Physiological state is influenced by the Receptor for Advanced Glycation End Products (RAGE). This receptor was discovered in 1992, and the accumulation of research on this subject has been extensive. Structural characterization studies of the RAGE protein have shown that it is a transmembrane protein that binds a number of different motile ligands. The diversity of ligands that can attach to the binding domain is the primary factor that allows for RAGE to exhibit its wide-range effects on host cells. Two different studies were completed: one study dealt with the role of IAPP in beta cell death, and the second study was related to RAGE influence on cardiomyocytes and, more specifically, it was related to cardiac cell death. After the completion of the two studies, a comprehensive report was written for each topic. The two papers were merged into a single document. Molecular studies are important for understanding the underlying mechanisms that motivate pathophysiological presentation. In addition to a molecular understanding of the development of diabetes, a clinical research study was completed through the examination of appropriate literature sources. This clinical aspect allowed for the progression of different phases in the research process. A relationship between vinegar and lower plasma glucose was found. The exact mechanism behind this relationship will be studied in the future.
ContributorsGonzalez, Matthew Joseph (Author) / Johnston, Carol (Thesis director) / Collins, Michael (Committee member) / Barrett, The Honors College (Contributor) / School of Nutrition and Health Promotion (Contributor)
Created2015-05
136430-Thumbnail Image.png
Description
Background: The prevalence of childhood obesity has disproportionately affected Latino youth. This increase in obesity is seen with an increased incidence of Type 2 Diabetes. Objective/Hypothesis: The objective of this study was to determine the effects of a community based lifestyle intervention, which encompassed nutrition education and physical activity, on

Background: The prevalence of childhood obesity has disproportionately affected Latino youth. This increase in obesity is seen with an increased incidence of Type 2 Diabetes. Objective/Hypothesis: The objective of this study was to determine the effects of a community based lifestyle intervention, which encompassed nutrition education and physical activity, on diabetes risk in pre-diabetic Latino adolescents. Diabetes risk was assessed using pancreatic beta cell function as measured by proinsulin: insulin ratio. It was hypothesized that reductions in added sugar intake and reductions in saturated fat intake will be associated with improved beta cell function as measured by proinsulin: insulin ratio. Study Design/Participants: In this quasi-experimental study design, n=17 pre-diabetic Latino adolescents between the ages of 14-16 participated in a lifestyle intervention. Methods: Anthropometric measurements (weight, height, waist circumference, BMI) and body composition (body %) were determined for all participants at baseline and post intervention. Fasting proinsulin (PI), fasting insulin (I) and 2hr-OGTT were also determined. Dietary intake was measured using the Block Kids Food Screener for kids ages 2-17y (2007). The intervention consisted of nutrition education classes and physical activity sessions for 12 weeks. Results: We found significant decreases in body fat % following the intervention. There were no significant decreases in fasting insulin. Proinsulin significantly decreased. However we did no see a significant change in PI/I (p= 0.003). Dietary behaviors of added sugar (p=0.03) and saturated fat (p=0.04) showed significant decreases. No significant associations were found between changes in added sugar to improvements in beta cell function, r=0.072, p-value= 0.7. We also did not observe significant associations between reductions in saturated fat intake and improvements in beta cell function, r=0.152, p-value =0.6. Conclusions: We concluded that a 12-week lifestyle intervention resulted in significant changes in dietary behaviors. These changes were not however associated with improvements in beta cell function.
ContributorsKaur, Manroop (Author) / Shaibi, Gabriel (Thesis director) / Bruening, Meredith (Committee member) / Barrett, The Honors College (Contributor) / School of Nutrition and Health Promotion (Contributor)
Created2015-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
Description
As computers become a more embedded aspect of daily life, the importance of communicating ideas in computing and technology to the general public has become increasingly apparent. One such growing technology is electronic voting. The feasibility of explaining electronic voting protocols was directly investigated through the generation of a presentation

As computers become a more embedded aspect of daily life, the importance of communicating ideas in computing and technology to the general public has become increasingly apparent. One such growing technology is electronic voting. The feasibility of explaining electronic voting protocols was directly investigated through the generation of a presentation based on journal articles and papers identified by the investigator. Extensive use of analogy and visual aids were used to explain various cryptographic concepts. The presentation was then given to a classroom of ASU freshmen, followed by a feedback survey. A self-evaluation on the presentation methods is conducted, and a procedure for explaining subjects in computer science is proposed based on the researcher's personal process.
ContributorsReniewicki, Peter Josef (Author) / Bazzi, Rida (Thesis director) / Childress, Nancy (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05