Matching Items (24)
Filtering by
- All Subjects: Physics
- Creators: School of Mathematical and Statistical Sciences
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
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
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
In many systems, it is difficult or impossible to measure the phase of a signal. Direct recovery from magnitude is an ill-posed problem. Nevertheless, with a sufficiently large set of magnitude measurements, it is often possible to reconstruct the original signal using algorithms that implicitly impose regularization conditions on this ill-posed problem. Two such algorithms were examined: alternating projections, utilizing iterative Fourier transforms with manipulations performed in each domain on every iteration, and phase lifting, converting the problem to that of trace minimization, allowing for the use of convex optimization algorithms to perform the signal recovery. These recovery algorithms were compared on a basis of robustness as a function of signal-to-noise ratio. A second problem examined was that of unimodular polyphase radar waveform design. Under a finite signal energy constraint, the maximal energy return of a scene operator is obtained by transmitting the eigenvector of the scene Gramian associated with the largest eigenvalue. It is shown that if instead the problem is considered under a power constraint, a unimodular signal can be constructed starting from such an eigenvector that will have a greater return.
ContributorsJones, Scott Robert (Author) / Cochran, Douglas (Thesis director) / Diaz, Rodolfo (Committee member) / Barrett, The Honors College (Contributor) / Electrical Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2014-05
Description
Within the context of the Finite-Difference Time-Domain (FDTD) method of simulating interactions between electromagnetic waves and matter, we adapt a known absorbing boundary condition, the Convolutional Perfectly-Matched Layer (CPML) to a background of Drude-dispersive medium. The purpose of this CPML is to terminate the virtual grid of scattering simulations by absorbing all outgoing radiation. In this thesis, we exposit the method of simulation, establish the Perfectly-Matched Layer as a domain which houses a spatial-coordinate transform to the complex plane, construct the CPML in vacuum, adapt the CPML to the Drude medium, and conclude with tests of the adapted CPML for two different scattering geometries.
ContributorsThornton, Brandon Maverick (Author) / Sukharev, Maxim (Thesis director) / Goodnick, Stephen (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Department of Physics (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and coating materials for engineering or programmable cells for medical uses. Previous research using this model has focused on shape formation and other spatial configuration problems, including line formation, compression, and coating. In this work we study foundational computational tasks that exceed the capabilities of the individual constant memory particles described by the model. These tasks represent new ways to use these self-organizing systems, which, in conjunction with previous shape and configuration work, make the systems useful for a wider variety of tasks. We present an implementation of a counter using a line of particles, which makes it possible for the line of particles to count to and store values much larger than their individual capacities. We then present an algorithm that takes a matrix and a vector as input and then sets up and uses a rectangular block of particles to compute the matrix-vector multiplication. This setup also utilizes the counter implementation to store the resulting vector from the matrix-vector multiplication. Operations such as counting and matrix multiplication can leverage the distributed and dynamic nature of the self-organizing system to be more efficient and adaptable than on traditional linear computing hardware. Such computational tools also give the systems more power to make complex decisions when adapting to new situations or to analyze the data they collect, reducing reliance on a central controller for setup and output processing. Finally, we demonstrate an application of similar types of computations with self-organizing systems to image processing, with an implementation of an image edge detection algorithm.
ContributorsPorter, Alexandra Marie (Author) / Richa, Andrea (Thesis director) / Xue, Guoliang (Committee member) / School of Music (Contributor) / Computer Science and Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12
Description
A working knowledge of mathematics is a vital requirement for introductory university physics courses. However, there is mounting evidence which shows that many incoming introductory physics students do not have the necessary mathematical ability to succeed in physics. The investigation reported in this thesis used preinstruction diagnostics and interviews to examine this problem in depth. It was found that in some cases, over 75% of students could not solve the most basic mathematics problems. We asked questions involving right triangles, vector addition, vector direction, systems of equations, and arithmetic, to give a few examples. The correct response rates were typically between 25% and 75%, which is worrying, because these problems are far simpler than the typical problem encountered in an introductory quantitative physics course. This thesis uncovered a few common problem solving strategies that were not particularly effective. When solving trigonometry problems, 13% of students wrote down the mnemonic "SOH CAH TOA," but a chi-squared test revealed that this was not a statistically significant factor in getting the correct answer, and was actually detrimental in certain situations. Also, about 50% of students used a tip-to-tail method to add vectors. But there is evidence to suggest that this method is not as effective as using components. There are also a number of problem solving strategies that successful students use to solve mathematics problems. Using the components of a vector increases student success when adding vectors and examining their direction. Preliminary evidence also suggests that repetitive trigonometry practice may be the best way to improve student performance on trigonometry problems. In addition, teaching students to use a wide variety of algebraic techniques like the distributive property may help them from getting stuck when working through problems. Finally, evidence suggests that checking work could eliminate up to a third of student errors.
ContributorsJones, Matthew Isaiah (Author) / Meltzer, David (Thesis director) / Peng, Xihong (Committee member) / Department of Physics (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12