Digital Commons Network^™

Making Curry With Rice: An Optimizing Curry Compiler, Steven Libby

Dissertations and Theses

In this dissertation we present the RICE optimizing compiler for the functional logic language Curry. This is the first general optimizing compiler for a functional logic language. Our work is based on the idea of compiling through program transformations, which we have adapted from the functional language compiler community. We also present the GAS system for generating new program transformations, which uses the power of functional logic programming to provide a flexible framework for describing transformations. This allows us to describe and implement a wide range of optimizations including inlining, shortcut deforestation, unboxing, and case shortcutting, a new optimization we …

Using Intrinsically-Typed Definitional Interpreters To Verify Compiler Optimizations In A Monadic Intermediate Language, Dani Barrack

Dissertations and Theses

Compiler optimizations are critical to the efficiency of modern functional programs. At the same time, optimizations that unintentionally change the semantics of programs can systematically introduce errors into programs that pass through them. The question of how to best verify that optimizations and other program transformations preserve semantics is an important one, given the potential for error introduction. Dependent types allow us to prove that properties about our programs are correct, as well as to design data types and interpreters in such a way that they are correct-by-construction. In this thesis, we explore the use of dependent types and intrinsically-typed …

Quantum Grover's Oracles With Symmetry Boolean Functions, Peng Gao

Dissertations and Theses

Quantum computing has become an important research field of computer science and engineering. Among many quantum algorithms, Grover's algorithm is one of the most famous ones. Designing an effective quantum oracle poses a challenging conundrum in circuit and system-level design for practical application realization of Grover's algorithm.

In this dissertation, we present a new method to build quantum oracles for Grover's algorithm to solve graph theory problems. We explore generalized Boolean symmetric functions with lattice diagrams to develop a low quantum cost and area efficient quantum oracle. We study two graph theory problems: cycle detection of undirected graphs and generalized …

Proximal Policy Optimization For Radiation Source Search, Philippe Erol Proctor

Dissertations and Theses

Rapid localization and search for lost nuclear sources in a given area of interest is an important task for the safety of society and the reduction of human harm. Detection, localization and identification are based upon the measured gamma radiation spectrum from a radiation detector. The nonlinear relationship of electromagnetic wave propagation paired with the probabilistic nature of gamma ray emission and background radiation from the environment leads to ambiguity in the estimation of a source's location. In the case of a single mobile detector, there are numerous challenges to overcome such as weak source activity, multiple sources, or the …

Forecasting Optimal Parameters Of The Broken Wing Butterfly Option Strategy Using Differential Evolution, David Munoz Constantine

Dissertations and Theses

Obtaining an edge in financial markets has been the objective of many hedge funds, investors, and market participants. Even with today's abundance of data and computing power, few individuals achieve a consistent edge over an extended time. To obtain this edge, investors usually use options strategies. The Broken Wing Butterfly (BWB) is an options strategy that has increased in popularity among traders. Profit is generated primarily by exploiting option value time decay. In this thesis, the selection of entry and exit BWB parameters, such as profit and loss targets, are optimized for an in-sample period. Afterward, they are used to …