Applied Mathematics Commons^™

The Primitive Root Problem: A Problem In Bqp, Shixin Wu

Mathematical Sciences Technical Reports (MSTR)

Shor’s algorithm proves that the discrete logarithm problem is in BQP. Based on his algorithm, we prove that the primitive root problem, a problem that verifies if some integer g is a primitive root modulo p where p is the largest prime number smaller than 2n for a given n, which is assumed to be harder than the discrete logarithm problem, is in BQP by using an oracle quantum Turing machine.

Data And Algorithmic Modeling Approaches To Count Data, Andraya Hack

Honors College Theses

Various techniques are used to create predictions based on count data. This type of data takes the form of a non-negative integers such as the number of claims an insurance policy holder may make. These predictions can allow people to prepare for likely outcomes. Thus, it is important to know how accurate the predictions are. Traditional statistical approaches for predicting count data include Poisson regression as well as negative binomial regression. Both methods also have a zero-inflated version that can be used when the data has an overabundance of zeros. Another procedure is to use computer algorithms, also known as …

A Novel Data Lineage Model For Critical Infrastructure And A Solution To A Special Case Of The Temporal Graph Reachability Problem, Ian Moncur

Graduate Theses and Dissertations

Rapid and accurate damage assessment is crucial to minimize downtime in critical infrastructure. Dependency on modern technology requires fast and consistent techniques to prevent damage from spreading while also minimizing the impact of damage on system users. One technique to assist in assessment is data lineage, which involves tracing a history of dependencies for data items. The goal of this thesis is to present one novel model and an algorithm that uses data lineage with the goal of being fast and accurate. In function this model operates as a directed graph, with the vertices being data items and edges representing …

Intra-Hour Solar Forecasting Using Cloud Dynamics Features Extracted From Ground-Based Infrared Sky Images, Guillermo Terrén-Serrano

Electrical and Computer Engineering ETDs

Due to the increasing use of photovoltaic systems, power grids are vulnerable to the projection of shadows from moving clouds. An intra-hour solar forecast provides power grids with the capability of automatically controlling the dispatch of energy, reducing the additional cost for a guaranteed, reliable supply of energy (i.e., energy storage). This dissertation introduces a novel sky imager consisting of a long-wave radiometric infrared camera and a visible light camera with a fisheye lens. The imager is mounted on a solar tracker to maintain the Sun in the center of the images throughout the day, reducing the scattering effect produced …

Toward Suicidal Ideation Detection With Lexical Network Features And Machine Learning, Ulya Bayram, William Lee, Daniel Santel, Ali Minai, Peggy Clark, Tracy Glauser, John Pestian

Northeast Journal of Complex Systems (NEJCS)

In this study, we introduce a new network feature for detecting suicidal ideation from clinical texts and conduct various additional experiments to enrich the state of knowledge. We evaluate statistical features with and without stopwords, use lexical networks for feature extraction and classification, and compare the results with standard machine learning methods using a logistic classifier, a neural network, and a deep learning method. We utilize three text collections. The first two contain transcriptions of interviews conducted by experts with suicidal (n=161 patients that experienced severe ideation) and control subjects (n=153). The third collection consists of interviews conducted by experts …

A New Application Of The Central Limit Theorem, Kenneth Winters

Selected Honors Theses

This paper discusses the Central Limit Theorem (CLT) and its applications. The paper gives an introduction to what the CLT is and how it can be applied to real life. Additionally, the paper gives a conceptual understanding of the theorem through various examples and visuals. The paper discusses the applications of the CLT in fields such as computer science, psychology, and political science. The author then suggests a new mathematical theorem as an application of the CLT and provides a proof of the theorem. The new theorem relates to expected value and probabilities of random variables and provides a link …

A Meshless Approach To Computational Pharmacokinetics, Anthony Matthew Khoury

Doctoral Dissertations and Master's Theses

The meshless method is an incredibly powerful technique for solving a variety of problems with unparalleled accuracy and efficiency. The pharmacokinetic problem of transdermal drug delivery (TDDD) is one such topic and is of significant complexity. The locally collocated meshless method (LCMM) is developed in solution to this topic. First, the meshless method is formulated to model this transport phenomenon and is then validated against an analytical solution of a pharmacokinetic problem set, to demonstrate this accuracy and efficiency. The analytical solution provides a locus by which convergence behavior are evaluated, demonstrating the super convergence of the locally collocated meshless …

Real-Time Complex Hand Gestures Recognition Based On Multi- Dimensional Features, Isack Bulugu

Tanzania Journal of Engineering and Technology (TJET)

Gesture recognition is broadly utilized within the field of sensing. There are basically three gesture recognition methods based on computer vision, depth sensor and motion sensor. Motion sensor-based gesture recognition has few input data, fast speed, and direct access to three- dimensional information of the hand. The advantages of traditional motion sensor-based gesture recognition have gradually become a current research hotspot. The essence of traditional motion sensor-based gesture recognition is a pattern recognition problem, and its accuracy depends heavily on the feature dataset extracted from prior experience. Unlike traditional pattern recognition methods, deep learning can be used to a large …

Complete Neighbourhood Search Heuristic Algorithm For Portfolio Optimization, Collether John

Tanzania Journal of Engineering and Technology (TJET)

In portfolio optimization, the fundamental goal of an investor is to optimally allocate investments between different assets. Mean-variance optimization methods make unrealistic assumptions to solve the problem of optimal allocation. On the other hand, when realistic constraints like holding size and cardinality are introduced it leads to optimal asset allocation which differ from the mean variance optimization. The resulting optimization problem become quite complex as it exhibits multiple local extrema and discontinuities. Heuristic algorithms work well for the complex problem. Therefore, a heuristic algorithm is developed which is based on hill climbing complete (HC-C). It is utilized to solve the …

Numerical Treatment For Special Type Of Mixed Linear Delay Volterra Integro-Differential Equations, Atheer J. Kadhim

Emirates Journal for Engineering Research

The idea of research is a representation of the nonlinear pseudo-random generators using state-space equations that is not based on the usual description as shift register synthesis but in terms of matrices. Different types of nonlinear pseudo-random generators with their algorithms have been applied in order to investigate the output pseudo-random sequences. Moreover, two examples are given for conciliated the results of this representation.

The Nature Of Numbers: Real Computing, Bradley J. Lucier

Journal of Humanistic Mathematics

While studying the computable real numbers as a professional mathematician, I came to see the computable reals, and not the real numbers as usually presented in undergraduate real analysis classes, as the natural culmination of my evolving understanding of numbers as a schoolchild. This paper attempts to trace and explain that evolution. The first part recounts the nature of numbers as they were presented to us grade-school children. In particular, the introduction of square roots induced a step change in my understanding of numbers. Another incident gave me insight into the brilliance of Alan Turing in his paper introducing both …

The Power Of First-Order Smooth Optimization For Black-Box Non-Smooth Problems, Alexander V. Gasnikov., Anton Novitskii, Vasilii Novitskii, Farshed Abdukhakimov, Dmitry Kamzolov, Aleksandr Beznosikov, Martin Takáč, Pavel Dvurechensky, Bin Gu

Machine Learning Faculty Publications

Gradient-free/zeroth-order methods for black-box convex optimization have been extensively studied in the last decade with the main focus on oracle calls complexity. In this paper, besides the oracle complexity, we focus also on iteration complexity, and propose a generic approach that, based on optimal first-order methods, allows to obtain in a black-box fashion new zeroth-order algorithms for non-smooth convex optimization problems. Our approach not only leads to optimal oracle complexity, but also allows to obtain iteration complexity similar to first-order methods, which, in turn, allows to exploit parallel computations to accelerate the convergence of our algorithms. We also elaborate on …

Robust Error Estimation Based On Factor-Graph Models For Non-Line-Of-Sight Localization, O. Arda Vanli, Clark N. Taylor

Faculty Publications

This paper presents a method to estimate the covariances of the inputs in a factor-graph formulation for localization under non-line-of-sight conditions. A general solution based on covariance estimation and M-estimators in linear regression problems, is presented that is shown to give unbiased estimators of multiple variances and are robust against outliers. An iteratively re-weighted least squares algorithm is proposed to jointly compute the proposed variance estimators and the state estimates for the nonlinear factor graph optimization. The efficacy of the method is illustrated in a simulation study using a robot localization problem under various process and measurement models and measurement …

Guide To The Dr. L.S. Dederick Papers, 1908-1956, Undated, Orson Kingsley, Patrick Koetsch

Archives & Special Collections Finding Aids

Louis Serle (L.S.) Dederick was born in Chicago in 1883. He received his Ph.D. in Mathematics from Harvard University in 1909. From 1909 – 1917 he was a professor at Princeton University. From 1917 – 1924 he was professor at the U.S. Naval Academy in Annapolis, Maryland. In 1926 Dederick began working for the U.S. Army, Ordnance. During his time there he was the Associate Director of the Ballistic Research Laboratory at the Aberdeen Proving Grounds in Aberdeen, Maryland where he focused on ballistics research.

While Dederick worked as a mathematician at the Aberdeen Proving Grounds, he was involved with …

Electroencephalogram Classification Of Brain States Using Deep Learning Approach, Hrishitva Patel

Computer Science Faculty Scholarship

The oldest diagnostic method in the field of neurology is electroencephalography (EEG). To grasp the information contained in EEG signals, numerous deep machine learning architectures have been developed recently. In brain computer interface (BCI) systems, classification is crucial. Many recent studies have effectively employed deep learning algorithms to learn features and classify various sorts of data. A systematic review of EEG classification using deep learning was conducted in this research, resulting in 90 studies being discovered from the Web of Science and PubMed databases. Researchers looked at a variety of factors in these studies, including the task type, EEG pre-processing …

Eeg Signals Classification Using Lstm-Based Models And Majority Logic, James A. Orgeron

College of Graduate Studies: Theses & Dissertations

The study of elecroencephalograms (EEGs) has gained enormous interest in the last decade with the increase of computational power and availability of EEG signals collected from various human activities or produced during medical tests. The applicability of analyzing EEG signals ranges from helping impaired people communicate or move (using appropriate medical equipment) to understanding people's feelings and detecting diseases.

We proposed new methodology and models for analyzing and classifying EEG signals collected from individuals observing visual stimuli. Our models rely on powerful Long-Short Term Memory (LSTM) Neural Network models, which are currently the state of the art models for performing …

Colonial Markets, Consumers, And Trade: A Comparative Analysis Of Historic Ceramics From The Bluefields Bay Area, Westmoreland, Jamaica, Lacy Risner

Murray State Theses and Dissertations

The ceramic assemblages from a British colonial settlement in Bluefields Bay, Jamaica, provide a unique window into the market availability, exchange routes, and consumption patterns of the eighteenth century. This study compares the historic ceramics collected from two sites in Bluefields Bay to one another and to other intra-island (Jamaica), intraregional (Lesser Antilles), and international (North America) colonial and postcolonial sites to reveal patterns of individual and global ceramic consumption and distribution in the emergent capitalist networks and markets of the colonial era. Integrating small British colonial sites into the networks of other more extensive studies focusing primarily on plantations …

Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa

Honors Theses

In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …

A Simple Algorithm For Generating A New Two Sample Type-Ii Progressive Censoring With Applications, E. M. Shokr, Rashad Mohamed El-Sagheer, Mahmoud Mansour, H. M. Faied, B. S. El-Desouky

Basic Science Engineering

In this article, we introduce a simple algorithm to generating a new type-II progressive censoring scheme for two samples. It is observed that the proposed algorithm can be applied for any continues probability distribution. Moreover, the description model and necessary assumptions are discussed. In addition, the steps of simple generation algorithm along with programming steps are also constructed on real example. The inference of two Weibull Frechet populations are discussed under the proposed algorithm. Both classical and Bayesian inferential approaches of the distribution parameters are discussed. Furthermore, approximate confidence intervals are constructed based on the asymptotic distribution of the maximum …

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal

CMC Senior Theses

In many applications of graph analytics, the optimal graph construction is not always straightforward. I propose a novel algorithm to dynamically infer a graph structure on multiple time series by first imposing a state evolution equation on the graph and deriving the necessary equations to convert it into a maximum likelihood optimization problem. The state evolution equation guarantees that edge weights contain predictive power by construction. After running experiments on simulated data, it appears the required optimization is likely non-convex and does not generally produce results significantly better than randomly tweaking parameters, so it is not feasible to use in …

On Implementing And Testing The Rsa Algorithm, Kien Trung Le

Senior Independent Study Theses

In this work, we give a comprehensive introduction to the RSA cryptosystem, implement it in Java, and compare it empirically to three other RSA implementations. We start by giving an overview of the field of cryptography, from its primitives to the composite constructs used in the field. Then, the paper presents a basic version of the RSA algorithm. With this information in mind, we discuss several problems with this basic conception of RSA, including its speed and some potential attacks that have been attempted. Then, we discuss possible improvements that can make RSA runs faster and more secure. On the …

Determining Power System Fault Location Using Neural Network Approach, Edward O. Ojini

Theses and Dissertations--Electrical and Computer Engineering

Fault location remains an extremely pivotal feature of the electric power grid as it ensures efficient operation of the grid and prevents large downtimes during fault occurrences. This will ultimately enhance and increase the reliability of the system. Since the invention of the electric grid, many approaches to fault location have been studied and documented. These approaches are still effective and are implemented in present times, and as the power grid becomes even more broadened with new forms of energy generation, transmission, and distribution technologies, continued study on these methods is necessary. This thesis will focus on adopting the artificial …

Reinforcement Learning: Low Discrepancy Action Selection For Continuous States And Actions, Jedidiah Lindborg

College of Graduate Studies: Theses & Dissertations

In reinforcement learning the process of selecting an action during the exploration or exploitation stage is difficult to optimize. The purpose of this thesis is to create an action selection process for an agent by employing a low discrepancy action selection (LDAS) method. This should allow the agent to quickly determine the utility of its actions by prioritizing actions that are dissimilar to ones that it has already picked. In this way the learning process should be faster for the agent and result in more optimal policies.

Interpretable Design Of Reservoir Computing Networks Using Realization Theory, Wei Miao, Vignesh Narayanan, Jr-Shin Li

Publications

The reservoir computing networks (RCNs) have been successfully employed as a tool in learning and complex decision-making tasks. Despite their efficiency and low training cost, practical applications of RCNs rely heavily on empirical design. In this article, we develop an algorithm to design RCNs using the realization theory of linear dynamical systems. In particular, we introduce the notion of α-stable realization and provide an efficient approach to prune the size of a linear RCN without deteriorating the training accuracy. Furthermore, we derive a necessary and sufficient condition on the irreducibility of the number of hidden nodes in linear RCNs based …

Stroke Clustering And Fitting In Vector Art, Khandokar Shakib

Senior Independent Study Theses

Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.

Camouflaged Poisoning Attack On Graph Neural Networks, Chao Jiang, Yi He, Richard Chapman, Hongyi Wu

Computer Science Faculty Publications

Graph neural networks (GNNs) have enabled the automation of many web applications that entail node classification on graphs, such as scam detection in social media and event prediction in service networks. Nevertheless, recent studies revealed that the GNNs are vulnerable to adversarial attacks, where feeding GNNs with poisoned data at training time can lead them to yield catastrophically devastative test accuracy. This finding heats up the frontier of attacks and defenses against GNNs. However, the prior studies mainly posit that the adversaries can enjoy free access to manipulate the original graph, while obtaining such access could be too costly in …

Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu

Mathematical Sciences Technical Reports (MSTR)

Molina and Watrous present a variation of the method to simulate a quantum Turing machine employed in Yao’s 1995 publication “Quantum Circuit Complexity”. We use a computer program to implement their method with linear algebra and an additional unitary operator defined to complete the details. Their method is verified to be correct on a quantum Turing machine.

(R1494) Approximate Solutions Of The Telegraph Equation, Ilija Jegdić

Applications and Applied Mathematics: An International Journal (AAM)

In this paper the initial boundary value problems for the linear telegraph equation in one and two space dimensions are considered. To find approximate solutions, a recently proposed optimization-free approach that utilizes artificial neural networks with one hidden layer is used, in which the connecting weights from the input layer to the hidden layer are chosen randomly and the weights from the hidden layer to the output layer are found by solving a system of linear equations. One of the advantages of this method, in comparison to the usual discretization methods for the two-dimensional linear telegraph equation, is that this …

Understanding The Dynamics Of Human Reliance And Trust On Automation, Carlos E. Bustamante Orellana, Lucero Rodriguez Rodriguez, Jordy Cevallos Chavez, Yun Kang

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Reconstructing Mathematical Models With Chaotic Attractors Via Genetic Algorithms, Luis A. Ramirez Islas, Paul A. Valle

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.