Theory and Algorithms Commons^™

Effects Of Dynamic Goals On Agent Performance, Nathan R. Ball

Theses and Dissertations

Autonomous systems are increasingly being used for complex tasks in dynamic environments. Robust automation needs to be able to establish its current goal and determine when the goal has changed. In human-machine teams autonomous goal detection is an important component of maintaining shared situational awareness between both parties. This research investigates how different categories of goals affect autonomous change detection in a dynamic environment. In order to accomplish this goal, a set of autonomous agents were developed to perform within an environment with multiple possible goals. The agents perform the environmental task while monitoring for goal changes. The experiment tests …

Efficient Phase Retrieval For Off-Axis Point Spread Functions, Salome Esteban Carrasco

Theses and Dissertations

A novel pairing of phase retrieval tools allows for efficient estimation of pupil phase in optical systems from images of point spread functions (PSFs). The phase retrieval algorithm uses correlation of modeled phase in the focal plane to decouple aberrations that are difficult to identify in complex PSFs. The use of a phase kernel that departs from the Fresnel approximation for off-axis PSFs is a more accurate representation of wavefront phase in finite conjugate imaging. The combination of the approximation and phase correlation algorithm can be more efficient and accurate than generic algorithms.

Finding Spanning Trees In Strongly Connected Graphs With Per-Vertex Degree Constraints, Samuel Benjamin Chase

Computer Science and Software Engineering

In this project, I sought to develop and prove new algorithms to create spanning trees on general graphs with per-vertex degree constraints. This means that each vertex in the graph would have some additional value, a degree constraint d. For a spanning tree to be correct, every vertex v_i in the spanning tree must have a degree exactly equal to a degree constraint d_i. This poses an additional constraint on what would otherwise be a trivial spanning tree problem. In this paper, two proofs related to my studies will be discussed and analyzed, leading to my algorithm …

The Effect Of Endgame Tablebases On Modern Chess Engines, Christopher D. Peterson

Computer Engineering

Modern chess engines have the ability to augment their evaluation by using massive tables containing billions of positions and their memorized solutions. This report examines the importance of these tables to better understand the circumstances under which they should be used. The analysis conducted in this paper empirically examines differences in size and speed of memorized positions and their impacts on engine strength. Using this technique, situations where memorized tables improve play (and situations where they do not) are discovered.

Funqual: User-Defined, Statically-Checked Call Graph Constraints In C++, Andrew P. Nelson

Master's Theses

Static analysis tools can aid programmers by reporting potential programming mistakes prior to the execution of a program. Funqual is a static analysis tool that reads C++17 code ``in the wild'' and checks that the function call graph follows a set of rules which can be defined by the user. This sort of analysis can help the programmer to avoid errors such as accidentally calling blocking functions in time-sensitive contexts or accidentally allocating memory in heap-sensitive environments. To accomplish this, we create a type system whereby functions can be given user-defined type qualifiers and where users can define their own …

Temporal And Spatiotemporal Investigation Of Tourist Attraction Visit Sentiment On Twitter, Jose J. Padilla, Hamdi Kavak, Christopher J. Lynch, Ross J. Gore, Saikou Y. Diallo

VMASC Publications

In this paper, we propose a sentiment-based approach to investigate the temporal and spatiotemporal effects on tourists' emotions when visiting a city's tourist destinations. Our approach consists of four steps: data collection and preprocessing from social media; visitor origin identification; visit sentiment identification; and temporal and spatiotemporal analysis. The temporal and spatiotemporal dimensions include day of the year, season of the year, day of the week, location sentiment progression, enjoyment measure, and multi-location sentiment progression. We apply this approach to the city of Chicago using over eight million tweets. Results show that seasonal weather, as well as special days and …

Topographic Maps: Image Processing And Path-Finding, Calin Washington

Master's Theses

Topographic maps are an invaluable tool for planning routes through unfamiliar terrain. However, accurately planning routes on topographic maps is a time- consuming and error-prone task. One factor is the difficulty of interpreting the map itself, which requires prior knowledge and practice. Another factor is the difficulty of making choices between possible routes that have different trade-offs between length and the terrain they traverse.

To alleviate these difficulties, this thesis presents a system to automate the process of finding routes on scanned images of topographic maps. The system allows users to select any two points on a topographic map and …

An Algorithm For Calculating Top-Dimensional Bounding Chains, J. Frederico Carvalho​, Mikael Vejdemo-Johansson, Danica Kragic, Florian T. Pokorny

Publications and Research

We describe the Coefficient-Flow algorithm for calculating the bounding chain of an (n-1)-boundary on an n-manifold-like simplicial complex S. We prove its correctness and show that it has a computational time complexity of O(|S(n−1)|) (where S(n−1) is the set of (n-1)-faces of S). We estimate the big-O coefficient which depends on the dimension of S and the implementation. We present an implementation, experimentally evaluate the complexity of our algorithm, and compare its performance with that of solving the underlying linear system.

An Analysis Of Frenkel Defects And Backgrounds Modeling For Supercdms Dark Matter Searches, Matthew Stein

Physics Theses and Dissertations

Years of astrophysical observations suggest that dark matter comprises more than ~80 % of all matter in the universe. Particle physics theories favor a weakly-interacting particle that could be directly detected in terrestrial experiments. The Super Cryogenic Dark Matter Search (SuperCDMS) Collaboration operates world-leading experiments to directly detect dark matter interacting with ordinary matter. The SuperCDMS Soudan experiment searched for weakly interacting massive particles (WIMPs) via their elastic-scattering interactions with nuclei in low-temperature germanium detectors.

During the operation of the SuperCDMS Soudan experiment, ²¹⁰Pb sources were installed to study background rejection of the Ge detectors. Data from these sources …

Appendix: A Reasonable Bias Approach To Gerrymandering: Using Automated Plan Generation To Evaluate Redistricting Proposals, Bruce E. Cain, Wendy K. Tam Cho, Yan Y. Liu, Emily R. Zhang

William & Mary Law Review Online

Here, we present our findings, analogous to those on the efficiency gap in Part I.B of our Article published in the print edition of the William & Mary Law Review, on the other measures of partisan fairness.

Applications Of Artificial Intelligence In Power Systems, Samin Rastgoufard

LSU New Orleans Theses and Dissertations

Artificial intelligence tools, which are fast, robust and adaptive can overcome the drawbacks of traditional solutions for several power systems problems. In this work, applications of AI techniques have been studied for solving two important problems in power systems.

The first problem is static security evaluation (SSE). The objective of SSE is to identify the contingencies in planning and operations of power systems. Numerical conventional solutions are time-consuming, computationally expensive, and are not suitable for online applications. SSE may be considered as a binary-classification, multi-classification or regression problem. In this work, multi-support vector machine is combined with several evolutionary computation …

Tamscript - High Level Programming Interface For The Abstract Tile Assembly Model, Perry Mills

Computer Science and Computer Engineering Undergraduate Honors Theses

This paper describes a programming interface, TAMScript, for use with the PyTAS simulator. The interface allows for the dynamic generation of tile types as the simulation progresses, with the goal of reducing complexity for researchers. This paper begins with an introduction to the PyTAS software and a description of the 3D model which it simulates. Next, the changes made to support a dynamic generation scheme are detailed, and some of the potential benefits of this scheme are outlined. Then several of the example scripts which have been written using the TAMScript interface are reviewed. Finally, the potential for future research …

Computer Vision Evidence Supporting Craniometric Alignment Of Rat Brain Atlases To Streamline Expert-Guided, First-Order Migration Of Hypothalamic Spatial Datasets Related To Behavioral Control, Arshad Khan, Jose Perez, Claire Wells, Olac Fuentes

Selected Works Temporary Series

The rat has arguably the most widely studied brain among all animals, with numerous reference atlases for rat brain having been published since 1946. For example, many neuroscientists have used the atlases of Paxinos and Watson (PW, first published in 1982) or Swanson (S, first published in 1992) as guides to probe or map specific rat brain structures and their connections. Despite nearly three decades of contemporaneous publication, no independent attempt has been made to establish a basic framework that allows data mapped in PW to be placed in register with S, or vice versa. Such data migration would allow …

Computational Complexity Of Determining The Rigidity Of Ftam Assemblies, Ian Perkins

Computer Science and Computer Engineering Undergraduate Honors Theses

In this paper, we discuss a tile-based self-assembly model called the Folding Tile Assembly Model (FTAM). We briefly define what makes the FTAM unique in its ability to have folding 2D tiles. We also discuss the difficulty of determining the computational complexity of certain FTAM properties despite it being simpler for less dynamic models. Specifically, we discuss the property of rigidity in FTAM assemblies by devising a simple definition of rigidity, so that it is easier to determine its complexity. We use a reduction between an assembly and a 3SAT instance along with a series of proofs to give a …

Computer Vision Evidence Supporting Craniometric Alignment Of Rat Brain Atlases To Streamline Expert-Guided, First-Order Migration Of Hypothalamic Spatial Datasets Related To Behavioral Control, Khan, Jose Perez, Claire Wells, Olac Fuentes

Departmental Papers (Biology)

The rat has arguably the most widely studied brain among all animals, with numerous reference atlases for rat brain having been published since 1946. For example, many neuroscientists have used the atlases of Paxinos and Watson (PW, first published in 1982) or Swanson (S, first published in 1992) as guides to probe or map specific rat brain structures and their connections. Despite nearly three decades of contemporaneous publication, no independent attempt has been made to establish a basic framework that allows data mapped in PW to be placed in register with S, or vice versa. …

Empirical Risk Landscape Analysis For Understanding Deep Neural Networks, Pan Zhou, Jiashi Feng

Research Collection School Of Computing and Information Systems

This work aims to provide comprehensive landscape analysis of empirical risk in deep neural networks (DNNs), including the convergence behavior of its gradient, its stationary points and the empirical risk itself to their corresponding population counterparts, which reveals how various network parameters determine the convergence performance. In particular, for an l-layer linear neural network consisting of di neurons in the i-th layer, we prove the gradient of its empirical risk uniformly converges to the one of its population risk, at the rate of O(r 2l p l √ maxi dis log(d/l)/n). Here d is the total weight dimension, s is …

Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch

Electronic Theses and Dissertations

The performance and stability of the Particle Swarm Optimization algorithm depends on parameters that are typically tuned manually or adapted based on knowledge from empirical parameter studies. Such parameter selection is ineffectual when faced with a broad range of problem types, which often hinders the adoption of PSO to real world problems. This dissertation develops a dynamic self-optimization approach for the respective parameters (inertia weight, social and cognition). The effects of self-adaption for the optimal balance between superior performance (convergence) and the robustness (divergence) of the algorithm with regard to both simple and complex benchmark functions is investigated. This work …

Minimization Techniques For Symbolic Automata, Jonathan Homburg

Honors Scholar Theses

Symbolic finite automata (SFAs) are generalizations of classical finite state automata. Whereas the transitions of classical automata are labeled by characters from some alphabet, the transitions of symbolic automata are labeled by predicates over a Boolean algebra defined on the alphabet. This allows for SFAs to be efficiently constructed over extremely large, and possibly infinite, alphabets. This thesis examines an existing incremental algorithm for the minimization of deterministic finite automata. Several extensions of this algorithm to de- terministic symbolic automata are introduced. Although more efficient algorithms already exist for deterministic SFA minimization, the presented algorithms are uniquely designed to minimize …

Use Of The Proof-Of-Stake Algorithm For Distributed Consensus In Blockchain Protocol For Cryptocurrency, Spencer J. Hosack

Honors Scholar Theses

Recent attention to Bitcoin and other cryptocurrencies has opened investors and the public to the realm of digital currency. Greater exposure around the world has led to a frenzy of entry into the market and a test into the long-term feasibility of Bitcoin being able to remain a functioning peer-to-peer (P2P), decentralized currency. Its main structure is supported by the Proof-of-Work (PoW) protocol in which users can elect to participate in determining transaction approval and ensuring an honest blockchain. This system relies on elected users to expend computational power and energy to solve puzzles to prove the accuracy of the …

Blockchain In Payment Card Systems, Darlene Godfrey-Welch, Remy Lagrois, Jared Law, Russell Scott Anderwald, Daniel W. Engels

SMU Data Science Review

Payment cards (e.g., credit and debit cards) are the most frequent form of payment in use today. A payment card transaction entails many verification information exchanges between the cardholder, merchant, issuing bank, a merchant bank, and third-party payment card processors. Today, a record of the payment transaction often records to multiple ledgers. Merchant’s incur fees for both accepting and processing payment cards. The payment card industry is in dire need of technology which removes the need for third-party verification and records transaction details to a single tamper-resistant digital ledger. The private blockchain is that technology. Private blockchain provides a linked …