Theory and Algorithms Commons^™

Bounded-Degree Plane Geometric Spanners: Connecting The Dots Between Theory And Practice, Matthew Alexander Graham

UNF Graduate Theses and Dissertations

The construction of bounded-degree plane geometric spanners has been a focus of interest since 2002 when Bose, Gudmundsson, and Smid proposed the first algorithm to construct such spanners. To date, eleven algorithms have been designed with various trade-offs in degree and stretch factor. We have implemented these sophisticated algorithms in C++ using the CGAL library and experimented with them using large synthetic and real-world pointsets. Our experiments have revealed their practical behavior and real-world efficacy. We share the implementations via GitHub for broader uses and future research.

We present a simple practical algorithm, named AppxStretchFactor, that can estimate stretch factors …

A Game Theoretical Model Of Radiological Terrorism Defense, Shraddha Rane, Jason Timothy Harris

International Journal of Nuclear Security

Radiological dispersal devices (RDD) pose a threat to the United States. Healthcare facilities housing high-risk radioactive materials and devices are potentially easy targets for unauthorized access and are vulnerable to malevolent acts of theft or sabotage. The three most attractive candidates for use in RDD considered in this study are: ⁶⁰Co (radiosurgery devices), ¹³⁷Cs (blood irradiators) and ¹⁹²Ir (brachytherapy high dose radiation device). The threat posed by RDDs has led to evaluating the security risk of radioactive materials and defending against attacks. The concepts of risk analysis used in conjunction with game theory lay the foundations of …

The Performance Optimization Of Asp Solving Based On Encoding Rewriting And Encoding Selection, Liu Liu

Theses and Dissertations--Computer Science

Answer set programming (ASP) has long been used for modeling and solving hard search problems. These problems are modeled in ASP as encodings, a collection of rules that declaratively describe the logic of the problem without explicitly listing how to solve it. It is common that the same problem has several different but equivalent encodings in ASP. Experience shows that the performance of these ASP encodings may vary greatly from instance to instance when processed by current state-of-the-art ASP grounder/solver systems. In particular, it is rarely the case that one encoding outperforms all others. Moreover, running an ASP system on …

Rankings Of Mma Fighters, Michael Schaefer

All Graduate Theses, Dissertations, and Other Capstone Projects

Ranking is an essential process that allows sporting authorities to determine the relative performance of athletes. While ranking is straightforward in some sports, it is more complicated in MMA (mixed martial arts), where competition is often fragmented. This paper describes the mathematics behind four existing ranking algorithms: Elo’s System, Massey’s Method, Colley’s Method, and Google’s PageRank, and shows how to adapt them to rank MMA fighters in the UFC (Ultimate Fighting Championship). We also provide a performance analysis for each ranking method.

Matrix Interpretations And Tools For Investigating Even Functionals, Benjamin Stringer

Theses and Dissertations--Computer Science

Even functionals are a set of polynomials evaluated on the terms of hollow symmetric matrices. Their properties lend themselves to applications such as counting subgraph embeddings in generic (weighted or unweighted) host graphs and computing moments of binary quadratic forms, which occur in combinatorial optimization. This research focuses primarily on counting subgraph embeddings, which is traditionally accomplished with brute-force algorithms or algorithms curated for special types of graphs. Even functionals provide a method for counting subgraphs algebraically in time proportional to matrix multiplication and is not restricted to particular graph types. Counting subgraph embeddings can be accomplished by evaluating a …

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 …

"Mystify": A Proactive Moving-Target Defense For A Resilient Sdn Controller In Software Defined Cps, Mohamed Azab, Mohamed Samir, Effat Samir

Electrical & Computer Engineering Faculty Publications

The recent devastating mission Cyber–Physical System (CPS) attacks, failures, and the desperate need to scale and to dynamically adapt to changes, revolutionized traditional CPS to what we name as Software Defined CPS (SD-CPS). SD-CPS embraces the concept of Software Defined (SD) everything where CPS infrastructure is more elastic, dynamically adaptable and online-programmable. However, in SD-CPS, the threat became more immanent, as the long-been physically-protected assets are now programmatically accessible to cyber attackers. In SD-CPSs, a network failure hinders the entire functionality of the system. In this paper, we present MystifY, a spatiotemporal runtime diversification for Moving-Target Defense (MTD) to secure …

Lasso: Listing All Subset Sums Obediently For Evaluating Unbounded Subset Sums, Christopher N. Burgoyne, Travis J. Wheeler

Graduate Student Theses, Dissertations, & Professional Papers

In this study we present a novel algorithm, LASSO, for solving the unbounded and bounded subset sum problem. The LASSO algorithm was designed to solve the unbounded SSP quickly and to return all subsets summing to a target sum. As speed was the highest priority, we benchmarked the run time performance of LASSO against implementations of some common approaches to the bounded SSP, as well as the only comparable implementation for solving the unbounded SSP that we could find. In solving the bounded SSP, our algorithm had a significantly faster run time than the competing algorithms when the target sum …

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 …

The Locus Algorithm: A Novel Technique For Identifying Optimised Pointings For Differential Photometry, Oisin Creaner, Kevin Nolan Mr, E. Hickey, N. Smith

Articles

Studies of the photometric variability of astronomical sources from ground-based telescopes must overcome atmospheric extinction effects. Differential photometry by reference to an ensemble of reference stars which closely match the target in terms of magnitude and colour can mitigate these effects. This Paper describes the design, implementation, and operation of a novel algorithm – The Locus Algorithm – which enables optimised differential photometry. The Algorithm is intended to identify, for a given target and observational parameters, the Field of View (FoV) which includes the target and the maximum number of reference stars similar to the target. A collection of objects …

Mitigation Of Algorithmic Bias To Improve Ai Fairness, Kathy Wang

Cybersecurity Undergraduate Research Showcase

As artificial intelligence continues to evolve rapidly with emerging innovations, mass-scale digitization could be disrupted due to unfair algorithms with historically biased data. With the rising concerns of algorithmic bias, detecting biases is essential in mitigating and implementing an algorithm that promotes inclusive representation. The spread of ubiquitous artificial intelligence means that improving modeling robustness is at its most crucial point. This paper examines the omnipotence of artificial intelligence and its resulting bias, examples of AI bias in different groups, and a potential framework and mitigation strategies to improve AI fairness and remove AI bias from modeling techniques.

A Synthetic Prediction Market For Estimating Confidence In Published Work, Sarah Rajtmajer, Christopher Griffin, Jian Wu, Robert Fraleigh, Laxmann Balaji, Anna Squicciarini, Anthony Kwasnica, David Pennock, Michael Mclaughlin, Timothy Fritton, Nishanth Nakshatri, Arjun Menon, Sai Ajay Modukuri, Rajal Nivargi, Xin Wei, Lee Giles

Computer Science Faculty Publications

[First paragraph] Concerns about the replicability, robustness and reproducibility of findings in scientific literature have gained widespread attention over the last decade in the social sciences and beyond. This attention has been catalyzed by and has likewise motivated a number of large-scale replication projects which have reported successful replication rates between 36% and 78%. Given the challenges and resources required to run high-powered replication studies, researchers have sought other approaches to assess confidence in published claims. Initial evidence has supported the promise of prediction markets in this context. However, they require the coordinated, sustained effort of collections of human experts …

Spaghetti Tracer: A Framework For Tracing Semiregular Filamentous Densities In 3d Tomograms, Salim Sazzed, Peter Scheible, Jing He, Willy Wriggers

Computer Science Faculty Publications

Within cells, cytoskeletal filaments are often arranged into loosely aligned bundles. These fibrous bundles are dense enough to exhibit a certain regularity and mean direction, however, their packing is not sufficient to impose a symmetry between—or specific shape on—individual filaments. This intermediate regularity is computationally difficult to handle because individual filaments have a certain directional freedom, however, the filament densities are not well segmented from each other (especially in the presence of noise, such as in cryo-electron tomography). In this paper, we develop a dynamic programming-based framework, Spaghetti Tracer, to characterizing the structural arrangement of filaments in the challenging 3D …

Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu

Electrical & Computer Engineering Faculty Publications

Energy detection (ED) represents a low complexity approach used by secondary users (SU) to sense spectrum occupancy by primary users (PU) in cognitive radio (CR) systems. In this paper, we present a new algorithm that senses the spectrum occupancy by performing ED in K consecutive sensing time slots starting from the current slot and continuing by alternating before and after the current slot. We consider a PU traffic model specified in terms of an average duty cycle value, and derive analytical expressions for the false alarm probability (FAP) and correct detection probability (CDP) for any value of K . Our …

Reinforcement Learning Applied To The Shoals Marine Laboratory Smart Grid, Daniel C. Mattson

Honors Theses and Capstones

Reinforcement learning (RL) techniques have been applied to smart grids with a variety of applications. The most common objective is to optimize profit for one actor in the system. The goal of this work is to apply different RL models to the smart grid at the Shoals Marine Laboratory (SML) located on Appledore Island, Maine in an effort to reduce costs and minimize the amount of nonrenewable energy consumed on the island. The RL models implemented resulted in more sustainable practices in simulations, with a linear spline model outperforming the naive policy the SML currently uses. Future work includes extending …

Effect Of Trigonometric Transformations On The Machine Learning Prediction And Quality Control Of Air Temperature, Andrea Fenoglio, Torrey J. Wagner, Paul Auclair, Brent T. Langhals

Faculty Publications

Conducting effective quality control of weather observations in real time is vital to the 14th Weather Squadron’s mission of providing authoritative climate data. This study explored automated quality control of weather observations by applying multiple machine learning techniques to 43,487 surface weather observations from 5 years of data at a single location. Temperature predictors were evaluated using recursive feature elimination on linear regression and XGBoost algorithms, as well as using a neural network hyperparameter sweep. Modeling was repeated after calculating trigonometric transforms of temporal variables to give the models insight into the diurnal heating cycle of the Earth. All models …

A Quantum Interpretation Of Separating Conjunction For Local Reasoning Of Quantum Programs Based On Separation Logic, Xuan Bach Le, Shang-Wei Lin, Jun Sun, David Sanan

Research Collection School Of Computing and Information Systems

It is well-known that quantum programs are not only complicated to design but also challenging to verify because the quantum states can have exponential size and require sophisticated mathematics to encode and manipulate. To tackle the state-space explosion problem for quantum reasoning, we propose a Hoare-style inference framework that supports local reasoning for quantum programs. By providing a quantum interpretation of the separating conjunction, we are able to infuse separation logic into our framework and apply local reasoning using a quantum frame rule that is similar to the classical frame rule. For evaluation, we apply our framework to verify various …

Parameter Estimation And Inference Of Spatial Autoregressive Model By Stochastic Gradient Descent, Gan Luan

Dissertations

Stochastic gradient descent (SGD) is a popular iterative method for model parameter estimation in large-scale data and online learning settings since it goes through the data in only one pass. While SGD has been well studied for independent data, its application to spatially-correlated data largely remains unexplored. This dissertation develops SGD-based parameter estimation and statistical inference algorithms for the spatial autoregressive (SAR) model, a common model for spatial lattice data.

This research contains three parts. (I) The first part concerns SGD estimation and inference for the SAR mean regression model. A new SGD algorithm based on maximum likelihood estimator (MLE) …

Implementation Of Switching Algorithm For Svpwm Inverter In Induction Motor Drive System On Electric Vehicle Applications, Bayu Praharsena, Mohammad Jauhari, Era Purwanto, Mentari Putri Jati, Angga Wahyu Aditya, Aries Alfian Prasetyo

Elinvo (Electronics, Informatics, and Vocational Education)

Electric cars are the way to reduce global warming and fuel shortages. Performance variable speed drive is needed for various drive electric vehicle applications. Unfortunately, high performance is still being investigated with a variety of drive systems. This paper presents a design, analysis, and implementation of the SV-PWM inverter motor drive system. The SV-PWM algorithm in design using Matlab, to analyze the system include signal response, THD-V, THD-I. All algorithms are embedded in STM32F4, as the main controller. The hardware uses a 3-phase motor control Steval power module. Response speed and output signal inverters are shown in chart form for …

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.