Digital Commons Network^™

Spatiotemporal Subspace Feature Tracking By Mining Discriminatory Characteristics, Richard D. Appiah

Doctoral Dissertations

Recent advancements in data collection technologies have made it possible to collect heterogeneous data at complex levels of abstraction, and at an alarming pace and volume. Data mining, and most recently data science seek to discover hidden patterns and insights from these data by employing a variety of knowledge discovery techniques. At the core of these techniques is the selection and use of features, variables or properties upon which the data were acquired to facilitate effective data modeling. Selecting relevant features in data modeling is critical to ensure an overall model accuracy and optimal predictive performance of future effects. The …

Full Simulation For The Qweak Experiment At 1.16 And 0.877 Gev And Their Impact On Extracting The Pv Asymmetry In The N→Δ A Transition, Hend Abdullah Nuhait

Doctoral Dissertations

The Qweak project is seeking to find new physics beyond the Standard Model. It is aimed to measure the weak charge of the proton, which has never been measured, at 4% precision at low momentum transfer. The experiment is performed by scattering electrons from protons and exploiting parity violation in the weak interaction at low four-momentum transfer.

In this experiment, two measurements were considered: which are elastic and inelastic. The elastic is to measure the proton's weak charge. In addition, the inelastic asymmetry measurement, which will extract the low energy constant dΔ. That measurement works in the neutral current …

Motion-Capture-Based Hand Gesture Recognition For Computing And Control, Andrew Gardner

Doctoral Dissertations

This dissertation focuses on the study and development of algorithms that enable the analysis and recognition of hand gestures in a motion capture environment. Central to this work is the study of unlabeled point sets in a more abstract sense. Evaluations of proposed methods focus on examining their generalization to users not encountered during system training.

In an initial exploratory study, we compare various classification algorithms based upon multiple interpretations and feature transformations of point sets, including those based upon aggregate features (e.g. mean) and a pseudo-rasterization of the capture space. We find aggregate feature classifiers to be balanced across …

Using Pedagogical Tools To Help Hispanics Be Successful In Computer Science, Rodger Irish

Theses and Dissertations

Irish, Rodger, Using Pedagogical Tools to Help Hispanics Be Successful in Computer Science. Master of Science (MS), July 2017, 68 pp., 4 tables, 2 figures, references 48 titles. Computer science (CS) jobs are a growing field and pay a living wage, but the Hispanics are underrepresented in this field. This project seeks to give an overview of several contributing factors to this problem. It will then explore some possible solutions to this problem and how a combination of some tools (teaching methods) can create the best possible outcome. It is my belief that this approach can produce successful Hispanics to …

Fractals, Randomization, Optimal Constructions, And Replication In Algorithmic Self-Assembly, Cameron Chalk

Theses and Dissertations

The problem of the strict self-assembly of infinite fractals within tile self-assembly is considered. In particular, tile assembly algorithms are provided for the assembly of the discrete Sierpinski triangle and the discrete Sierpinski carpet.

The robust random number generation problem in the abstract tile assembly model is introduced. First, it is shown this is possible for a robust fair coin flip within the aTAM, and that such systems guarantee a worst case O(1) space usage. This primary construction is accompanied with variants that show trade-offs in space complexity, initial seed size, temperature, tile complexity, bias, and extensibility.

This work …

Exploiting Semantic Distance In Linked Open Data For Recommendation, Sultan Dawood Alfarhood

Graduate Theses and Dissertations

The use of Linked Open Data (LOD) has been explored in recommender systems in different ways, primarily through its graphical representation. The graph structure of LOD is utilized to measure inter-resource relatedness via their semantic distance in the graph. The intuition behind this approach is that the more connected resources are to each other, the more related they are. One drawback of this approach is that it treats all inter-resource connections identically rather than prioritizing links that may be more important in semantic relatedness calculations. Another drawback of current approaches is that they only consider resources that are connected directly …

Dpweka: Achieving Differential Privacy In Weka, Srinidhi Katla

Graduate Theses and Dissertations

Organizations belonging to the government, commercial, and non-profit industries collect and store large amounts of sensitive data, which include medical, financial, and personal information. They use data mining methods to formulate business strategies that yield high long-term and short-term financial benefits. While analyzing such data, the private information of the individuals present in the data must be protected for moral and legal reasons. Current practices such as redacting sensitive attributes, releasing only the aggregate values, and query auditing do not provide sufficient protection against an adversary armed with auxiliary information. In the presence of additional background information, the privacy protection …

Molecular Dynamics Simulations Of Dna-Functionalized Nanoparticle Building Blocks On Gpus, Tyler Landon Fochtman

Graduate Theses and Dissertations

This thesis discusses massively parallel molecular dynamics simulations of nBLOCKs using graphical processing units. nBLOCKs are nanoscale building blocks composed of gold nanoparticles functionalized with single-stranded DNA molecules. To explore greater simulation time scales we implement our nBLOCK computational model as an extension to the coarse grain molecular simulator oxDNA. oxDNA is parameterized to match the thermodynamics of DNA strand hybridization as well as the mechanics of single stranded DNA and double stranded DNA. In addition to an in-depth review of our implementation details we also provide results of the model validation and performance tests. These validation and performance tests …

A Hybrid Partially Reconfigurable Overlay Supporting Just-In-Time Assembly Of Custom Accelerators On Fpgas, Zeyad Tariq Aklah

Graduate Theses and Dissertations

The state of the art in design and development flows for FPGAs are not sufficiently mature to allow programmers to implement their applications through traditional software development flows. The stipulation of synthesis as well as the requirement of background knowledge on the FPGAs' low-level physical hardware structure are major challenges that prevent programmers from using FPGAs. The reconfigurable computing community is seeking solutions to raise the level of design abstraction at which programmers must operate, and move the synthesis process out of the programmers' path through the use of overlays. A recent approach, Just-In-Time Assembly (JITA), was proposed that enables …

A Study On The Effects Of Mutation On Populations Using Strategies While Playing Iterative Prisoner's Dilemma, Ramses Romulus De Guzman Reyes

Theses and Dissertations

This thesis examines the effects different types of mutation and mutation rates have on populations using strategies while playing the Iterative Prisoners Dilemma (IPD). The system used in order to conduct this study was used in Leas et al. (2016), which uses genetic algorithms as a means of studying memory and its impact on populations playing IPD. For this study, experiments are organized into three different environments: Control, Static and Dynamic. The Control Environment focuses on analyzing the system and forming initial results. The Static Environment focuses on studying the effects of different rates on strategic populations playing IPD, while …

Randomized Approach Tor Set Cover With Multiple Phases*, Ujjwol Subedi

Theses and Dissertations

We Develop an interactive algorithm for the set cover problem. The algorithm uses multiple stages and select some sets each stage via random samples among the uncovered points. We show that it has a O(log n)—approximation ratio and takes O(log n) rounds and O(m2+ϵ ) samples each round, where n is the size of universal set and m is the number of sets.

We also prove a Ω(√logn/loglogn) lower bound for both the number of phases if each phase has poly(m) the number of samples.