Matching Items (35)
Filtering by
- All Subjects: Computer Science
- All Subjects: Physics
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
We develop the mathematical tools necessary to describe the interaction between a resonant pole and a threshold energy. Using these tools, we analyze the properties an opening threshold has on the resonant pole mass (the "cusp effect"), leading to an effect called "pole-dragging." We consider two models for resonances: a molecular, mesonic model, and a color-nonsinglet diquark plus antidiquark model. Then, we compare the pole-dragging effect due to these models on the masses of the f0(980), the X(3872), and the Zb(10610) and compare the effect's magnitude. We find that, while for lower masses, such as the f 0 (980), the pole-dragging effect that arises from the molecular model is more significant, the diquark model's pole-dragging effect becomes dominant at higher masses such as those of the X(3872) and the Z b (10610). This indicates that for lower threshold energies, diquark models may have less significant effects on predicted resonant masses than mesonic models, but for higher threshold energies, it is necessary to include the pole-dragging effect due to a diquark threshold in high-precision QCD calculations.
ContributorsBlitz, Samuel Harris (Author) / Richard, Lebed (Thesis director) / Comfort, Joseph (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor) / Barrett, The Honors College (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
Preliminary feasibility studies for two possible experiments with the GlueX detector, installed in Hall D of Jefferson Laboratory, are presented. First, a general study of the feasibility of detecting the ηC at the current hadronic rate is discussed, without regard for detector or reconstruction efficiency. Second, a study of the use of statistical methods in studying exotic meson candidates is outlined, describing methods and providing preliminary data on their efficacy.
ContributorsPrather, Benjamin Scott (Author) / Ritchie, Barry G. (Thesis director) / Dugger, Michael (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2015-05
Description
Since the acceptance of Einstein's special theory of relativity by the scientific community, authors of science fiction have used the concept of time dilation to permit seemingly impossible feats. Simple spacecraft acceleration schemes involving time dilation have been considered by scientists and fiction writers alike. Using an original Java program based upon the differential equations for special relativistic kinematics, several scenarios for round trip excursions at relativistic speeds are calculated and compared, with particular attention to energy budget and relativistic time passage in all relevant frames.
ContributorsAlfson, Jonathan William (Author) / Jacob, Richard (Thesis director) / Covatto, Carl (Committee member) / Foy, Joseph (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2015-05
Description
In this paper, optimal control routines are applied to an existing problem of electron state transfer to determine if spin information can successfully be moved across a chain of donor atoms in silicon. The additional spin degrees of freedom are introduced into the formulation of the problem as well as the control optimization algorithm. We find a timescale of transfer for spin quantum information across the chain fitting with a t > π/A and t > 2π/A transfer pulse time corresponding with rotation of states on the electron Bloch sphere where A is the electron-nuclear coupling constant. Introduction of a magnetic field weakens transfer
efficiencies at high field strengths and prohibits anti-aligned nuclear states from transferring. We also develop a rudimentary theoretical model based on simulated results and partially validate the characteristic transfer times for spin states. This model also establishes a framework for future work including the introduction of a magnetic field.
efficiencies at high field strengths and prohibits anti-aligned nuclear states from transferring. We also develop a rudimentary theoretical model based on simulated results and partially validate the characteristic transfer times for spin states. This model also establishes a framework for future work including the introduction of a magnetic field.
ContributorsMorgan, Eric Robert (Author) / Treacy, Michael (Thesis director) / Whaley, K. Birgitta (Committee member) / Greenman, Loren (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor)
Created2015-05
Description
In this experiment an Electrodynamic Ion Ring Trap was constructed and tested. Due to the nature of Electrostatic fields, the setup required an oscillating voltage source to stably trap the particles. It was built in a safe manner, The power supply was kept in a project box to avoid incidental contact, and was connected to a small copper wire in the shape of a ring. The maximum voltage that could be experienced via incidental contact was well within safe ranges a 0.3mA. Within minutes of its completion the trap was able to trap small Lycopodium powder spores mass of approximately 1.7*10^{-11}kg in clusters of 15-30 for long timescales. The oscillations of these spores were observed to be roughly 1.01mm at their maximum, and in an attempt to understand the dynamics of the Ion Trap, a concept called the pseudo-potential of the trap was used. This method proved fairly inaccurate, involving much estimation and using a static field estimation of 9.39*10^8 N\C and a charge estimate on the particles of ~1e, a maximum oscillation distance of 1.37m was calculated. Though the derived static field strength was not far off from the field strength required to achieve the correct oscillation distance (Percent error of 9.92%, the small discrepancy caused major calculation errors. The trap's intended purpose however was to eventually trap protein molecules for mapping via XFEL laser, and after its successful construction that goal is fairly achievable. The trap was also housed in a vacuum chamber so that it could be more effectively implemented with the XFEL.
ContributorsNicely, Ryan Joseph (Author) / Kirian, Richard (Thesis director) / Weiterstall, Uwe (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor) / Barrett, The Honors College (Contributor)
Created2019-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