Matching Items (26)
Filtering by
- All Subjects: Computer Science
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 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.
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
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
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
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
Transgene expression in mammalian cells has been shown to meet resistance in the form of silencing due to chromatin buildup within the cell. Interactions of proteins with chromatin modulate gene expression profiles. Synthetic Polycomb transcription factor (PcTF) variants have the potential to reactivate these silence transgenes as shown in Haynes & Silver 2011. PcTF variants have been constructed via TypeIIS assembly to further investigate this ability to reactive transgenes. Expression in mammalian cells was confirmed via fluorescence microscopy and red fluorescent protein (RFP) expression in cell lysate. Examination of any variation in conferment of binding strength of homologous Polycomb chromodomains (PCDs) to its trimethylated lysine residue target on histone three (H3K27me3) was investigated using a thermal shift assay. Results indicate that PcTF may not be a suitable protein for surveying with SYPRO Orange, a dye that produces a detectable signal when exposed to the hydrophobic domains of the melting protein. A cell line with inducible silencing of a chemiluminescent protein was used to determine the effects PcTF variants had on gene reactivation. Results show down-regulation of the target reporter gene. We propose this may be due to PcTF not binding to its target; this would cause PcTF to deplete transcriptional machinery in the nucleus. Alternatively, the CMV promoter could be sequestering transcriptional machinery in its hyperactive transcription of PcTF leading to widespread down-regulation. Finally, the activation domain used may not be appropriate for this cell type. Future PcTF variants will address these hypotheses by including multiple Polycomb chromodomains (PCDs) to alter the binding dynamics of PcTF to its target, and by incorporating alternative promoters and activation domains.
ContributorsGardner, Cameron Lee (Author) / Haynes, Karmella (Thesis director) / Stabenfeldt, Sarah (Committee member) / Barrett, The Honors College (Contributor) / Department of Finance (Contributor) / Harrington Bioengineering Program (Contributor)
Created2015-05
Description
Currently in synthetic biology only the Las, Lux, and Rhl quorum sensing pathways have been adapted for broad engineering use. Quorum sensing allows a means of cell to cell communication in which a designated sender cell produces quorum sensing molecules that modify gene expression of a designated receiver cell. While useful, these three quorum sensing pathways exhibit a nontrivial level of crosstalk, hindering robust engineering and leading to unexpected effects in a given design. To address the lack of orthogonality among these three quorum sensing pathways, previous scientists have attempted to perform directed evolution on components of the quorum sensing pathway. While a powerful tool, directed evolution is limited by the subspace that is defined by the protein. For this reason, we take an evolutionary biology approach to identify new orthogonal quorum sensing networks and test these networks for cross-talk with currently-used networks. By charting characteristics of acyl homoserine lactone (AHL) molecules used across quorum sensing pathways in nature, we have identified favorable candidate pathways likely to display orthogonality. These include Aub, Bja, Bra, Cer, Esa, Las, Lux, Rhl, Rpa, and Sin, which we have begun constructing and testing. Our synthetic circuits express GFP in response to a quorum sensing molecule, allowing quantitative measurement of orthogonality between pairs. By determining orthogonal quorum sensing pairs, we hope to identify and adapt novel quorum sensing pathways for robust use in higher-order genetic circuits.
ContributorsMuller, Ryan (Author) / Haynes, Karmella (Thesis director) / Wang, Xiao (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Chemistry and Biochemistry (Contributor) / School of Life Sciences (Contributor)
Created2015-05
Description
Synthetic biology is an emerging engineering disciple, which designs and controls biological systems for creation of materials, biosensors, biocomputing, and much more. To better control and engineer these systems, modular genetic components which allow for highly specific and high dynamic range genetic regulation are necessary. Currently the field struggles to demonstrate reliable regulators which are programmable and specific, yet also allow for a high dynamic range of control. Inspired by the characteristics of the RNA toehold switch in E. coli, this project attempts utilize artificial introns and complementary trans-acting RNAs for gene regulation in a eukaryote host, S. cerevisiae. Following modification to an artificial intron, splicing control with RNA hairpins was demonstrated. Temperature shifts led to increased protein production likely due to increased splicing due to hairpin loosening. Progress is underway to demonstrate trans-acting RNA interaction to control splicing. With continued development, we hope to provide a programmable, specific, and effective means for translational gene regulation in S. cerevisae.
ContributorsDorr, Brandon Arthur (Author) / Wang, Xiao (Thesis director) / Green, Alexander (Committee member) / Harrington Bioengineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
As the rates of anxiety in adults rapidly swell, new and creative treatment methods become increasingly relevant. Individuals with an anxiety disorder may experience challenging symptoms that interfere with daily activities and impede academic and social success. The purpose of this project is to design and engineer a portable heart rate monitor that communicates with an iOS mobile application for use by individuals suffering from anxiety or panic disorders. The proposed device captures the innovation of combining biosensor feedback with new, creative therapy methods on a convenient iOS application. The device is implemented as an Arduino Uno which translates radial pulse information onto an LCD screen from a wristband. Additionally, the iOS portion uses a slow expanding and collapsing animation to guide the user through a calming breathing exercise while displaying their pulse in beats per minute. The user's awareness or his or her ability to control one's own physiological state supports and facilitates an additional form of innovative therapy. The current design of the iOS app uses a random-number generator between 40 to 125 to imitate a realistic heart rate. If the value is less than 60 or greater than 105, the number is printed in red; otherwise the heart rate is displayed in green. Future versions of this device incorporate bluetooth capabilities and potentially additional synchronous methods of therapy. The information presented in this research provides an excellent example of the integrations of new mobile technology and healthcare.
ContributorsTadayon, Ramesh (Author) / Muthuswamy, Jit (Thesis director) / Towe, Bruce (Committee member) / Harrington Bioengineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
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 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
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 (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