Computer Sciences Commons^™

06. Computer Science, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

04. Botany, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

09. Environmental Science, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

12. Kinesiology, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

08. Engineering, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

10. Forensic Science, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

05. Chemistry, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

14. Optometry, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

15. Pharmacy, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

17. Psychology, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

19. Zoology, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

Achieving Numerical Reproducibility In The Parallelized Floating Point Dot Product, Alyssa Anderson

Honors Theses, 1963-2015

The world depends on computers every day to do accurate real-world mathematics. Computers must store real numbers in a finite representation that approximates real numbers, called floating point representation. However, simply by changing the order in which we add a list of floating point numbers can provide a different result that may even be less accurate than another ordering. This is because floating point addition is not associative. That is, (a + b) + c is not necessarily equal to a + (b + c). Parallel computing techniques introduce the ability to reorder computations, thus producing a difference in results …

03. Biology, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

13. Mathematics, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

16. Physics, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

02. Animal Science, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

07. Criminal Justice, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

11. Genetics, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

18. Statistics, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

Fast Algorithms For Analyzing Partially Ranked Data, Matthew Mcdermott

HMC Senior Theses

Imagine your local creamery administers a survey asking their patrons to choose their five favorite ice cream flavors. Any data collected by this survey would be an example of partially ranked data, as the set of all possible flavors is only ranked into subsets of the chosen flavors and the non-chosen flavors. If the creamery asks you to help analyze this data, what approaches could you take? One approach is to use the natural symmetries of the underlying data space to decompose any data set into smaller parts that can be more easily understood. In this work, I describe …

A Mathematical Framework For Unmanned Aerial Vehicle Obstacle Avoidance, Sorathan Chaturapruek

HMC Senior Theses

The obstacle avoidance navigation problem for Unmanned Aerial Vehicles (UAVs) is a very challenging problem. It lies at the intersection of many fields such as probability, differential geometry, optimal control, and robotics. We build a mathematical framework to solve this problem for quadrotors using both a theoretical approach through a Hamiltonian system and a machine learning approach that learns from human sub-experts' multiple demonstrations in obstacle avoidance. Prior research on the machine learning approach uses an algorithm that does not incorporate geometry. We have developed tools to solve and test the obstacle avoidance problem through mathematics.

Modeling Tolerance In Dynamic Social Networks, Amanda Luby

Honors Theses, 1963-2015

The study of social networks has become increasingly important in recent years. Multi-agent systems research has proven to be an effective way of representing both static and dynamic social networks in order to model and analyze many different situations. Previous implementations of multi-agent systems have observed a phenomenon called tolerance between agents through simulation studies, which is defined as an agent maintaining an unrewarding connection. This concept has also arisen in the social sciences through the study of networks. We aim to bridge this gap between simulation studies in multi-agent systems and real-world observations. This project explores how local interactions …

Bifurcation And Non-Convergence In The Hansen-Patrick Root-Finding Method, Preston Hardy

Honors Theses, 1963-2015

The Hansen-Patrick Root-Finding Method is a one-parameter family of cubically convergent root-finding methods. The parameter is called alpha and can be any complex number. With a few different values of alpha, Hansen-Patrick becomes equivalent to other, more well-known root-finding methods. For example, when alpha equals -1, Hansen-Patrick becomes equivalent to Halley’s Method. There has been previous research into the dynamical systems that arise when varying the initial starting point or varying a family of functions. This paper deals with what happens when the initial point and function are fixed but the root-finding method varies. We are interested in spurious cycles …

Performance Modeling And Optimization Techniques For Heterogeneous Computing, Supada Laosooksathit

Doctoral Dissertations

Since Graphics Processing Units (CPUs) have increasingly gained popularity amoung non-graphic and computational applications, known as General-Purpose computation on GPU (GPGPU), CPUs have been deployed in many clusters, including the world's fastest supercomputer. However, to make the most efficiency from a GPU system, one should consider both performance and reliability of the system.

This dissertation makes four major contributions. First, the two-level checkpoint/restart protocol that aims to reduce the checkpoint and recovery costs with a latency hiding strategy in a system between a CPU (Central Processing Unit) and a GPU is proposed. The experimental results and analysis reveals some benefits, …

Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva

College of Graduate Studies: Theses & Dissertations

Epistasis is the interaction between two or more genes to control a single phenotype. We model epistasis of the prey in a two-locus two-allele problem in a basic predator- prey relationship. The resulting model allows us to examine both population sizes as well as genotypic and phenotypic frequencies. In the context of several numerical examples, we show that if epistasis results in an undesirable or desirable phenotype in the prey by making the particular genotype more or less susceptible to the predator or dangerous to the predator, elimination of undesirable phenotypes and then genotypes occurs.

Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue

Scholarship

style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> prime factors for every style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">with the property that …

Statistical Analysis Of The Variability And Reliability Of Eye-Tracking Test In Measuring Mild Traumatic Brain Injury, Xi He

Honors Theses

Saccadic eye-tracking tests have been advocated as a useful tool to distinguish mTBI patients from healthy people. However, intra-individual variances sometimes interfere with the interpretation of eye-tracking results, especially in experiments when group size is restricted. This study analyzes eye-tracking results of 14 mTBI patients taking the test twice with no medical administration in between. Using more accurate models to fit each individual's result, variables such as asymptote (of the fit func­tions) and hypothetical values for peak velocity, peak acceleration, and duration are derived for variability analysis. We conclude that the asymptotes for peak velocity and peak acceleration are the …

Sensor Selection And Integration To Improve Video Segmentation In Complex Environments, Adam R. Reckley, Wei-Wen Hsu, Chung-Hao Chen, Gangfeng Ma, E-Wen Huang

Electrical & Computer Engineering Faculty Publications

Background subtraction is often considered to be a required stage of any video surveillance system being used to detect objects in a single frame and/or track objects across multiple frames in a video sequence. Most current state-of-the-art techniques for object detection and tracking utilize some form of background subtraction that involves developing a model of the background at a pixel, region, or frame level and designating any elements that deviate from the background model as foreground. However, most existing approaches are capable of segmenting a number of distinct components but unable to distinguish between the desired object of interest and …

Weak Isometries Of Hamming Spaces, Ryan Walter Bruner

Dissertations, Master's Theses and Master's Reports - Open

In this thesis we study weak isometries of Hamming spaces. These are permutations of a Hamming space that preserve some but not necessarily all distances. We wish to find conditions under which a weak isometry is in fact an isometry. This type of problem was first posed by Beckman and Quarles for Rⁿ. In chapter 2 we give definitions pertinent to our research. The 3rd chapter focuses on some known results in this area with special emphasis on papers by V. Krasin as well as S. De Winter and M. Korb who solved this problem for the Boolean …

Neutrosophic Logic Approaches Applied To ”Rabot” Real Time Control, Alexandru Gal, Luige Vladareanu, Florentin Smarandache, Hongnian Yu, Mincong Deng

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we present a way of deciding which control law should operate at a time for a mobile walking robot. The proposed deciding method is based on the new research field, called Neutrosophic Logic. The results are presented as a simulated system for which the output is related to the inputs according to the Neutrosophic Logic.