Theory and Algorithms Commons^™

Read This: A Content Analysis Framework For Book Recommendation Applications, Cypress S. Payne

Honors Projects

Book recommendation applications combine word-of-mouth recommendations with algorithms that can suggest books based on a user’s account activity, creating a robust system for finding new books to read. Current research on recommendation systems is purely quantitative, focusing on the efficacy of the system, and content analyses are only just beginning to be performed on mobile applications. I use previous content analyses on applications as a basis for creating a content analysis framework for book recommendation applications. This framework can be used to analyze what users find important in book recommendation apps and inform app creators about their users’ wants and …

Growing Reservoir Networks Using The Genetic Algorithm Deep Hyperneat, Nancy L. Mackenzie

Student Research Symposium

Typical Artificial Neural Networks (ANNs) have static architectures. The number of nodes and their organization must be chosen and tuned for each task. Choosing these values, or hyperparameters, is a bit of a guessing game, and optimizing must be repeated for each task. If the model is larger than necessary, this leads to more training time and computational cost. The goal of this project is to evolve networks that grow according to the task at hand. By gradually increasing the size and complexity of the network to the extent that the task requires, we will build networks that are more …

Adversarial Machine Learning For The Protection Of Legitimate Software, Colby Parker

Theses and Dissertations

Obfuscation is the transforming a given program into one that is syntactically different but semantically equivalent. This new obfuscated program now has its code and/or data changed so that they are hidden and difficult for attackers to understand. Obfuscation is an important security tool and used to defend against reverse engineering. When applied to a program, different transformations can be observed to exhibit differing degrees of complexity and changes to the program. Recent work has shown, by studying these side effects, one can associate patterns with different transformations. By taking this into account and attempting to profile these unique side …

A Machine-Verified Proof Of Linearizability For A Queue Algorithm, Ugur Yavuz

Dartmouth College Master’s Theses

Proofs of linearizability are typically intricate and lengthy, and readers may find it difficult to verify their correctness. We present a unique technique for producing proofs of linearizability that are fully verifiable by a mechanical proof system, thereby eliminating the need for any manual verification. Specifically, we reduce the burden of proving linearizable object implementations correct to the proof of a particular invariant whose correctness can be shown inductively. Noting that the latter is a task that many proof systems (such as the TLA+ Proof System we chose to work with) are well-suited to handle, this technique allows us to …

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.

Implementing The Cms+ Sports Rankings Algorithm In A Javafx Environment, Luke Welch

Industrial Engineering Undergraduate Honors Theses

Every year, sports teams and athletes get cut from championship opportunities because of their rank. While this reality is easier to swallow if a team or athlete is distant from the cut, it is much harder when they are right on the edge. Many times, it leaves fans and athletes wondering, “Why wasn’t I ranked higher? What factors when into the ranking? Are the rankings based on opinion alone?” These are fair questions that deserve an answer. Many times, sports rankings are derived from opinion polls. Other times, they are derived from a combination of opinion polls and measured performance. …

Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague

Computer Science and Computer Engineering Undergraduate Honors Theses

The advancements of quantum computers brings us closer to the threat of our current asymmetric cryptography algorithms being broken by Shor's Algorithm. NIST proposed a standardization effort in creating a new class of asymmetric cryptography named Post-Quantum Cryptography (PQC). These new algorithms will be resistant against both classical computers and sufficiently powerful quantum computers. Although the new algorithms seem mathematically secure, they can possibly be broken by a class of attacks known as side-channels attacks (SCA). Side-channel attacks involve exploiting the hardware that the algorithm runs on to figure out secret values that could break the security of the system. …

Gauging The State-Of-The-Art For Foresight Weight Pruning On Neural Networks, Noah James

Computer Science and Computer Engineering Undergraduate Honors Theses

The state-of-the-art for pruning neural networks is ambiguous due to poor experimental practices in the field. Newly developed approaches rarely compare to each other, and when they do, their comparisons are lackluster or contain errors. In the interest of stabilizing the field of pruning, this paper initiates a dive into reproducing prominent pruning algorithms across several architectures and datasets. As a first step towards this goal, this paper shows results for foresight weight pruning across 6 baseline pruning strategies, 5 modern pruning strategies, random pruning, and one legacy method (Optimal Brain Damage). All strategies are evaluated on 3 different architectures …

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 …

Undiscounted Recursive Path Choice Models: Convergence Properties And Algorithms, Tien Mai, Emma Frejinger

Research Collection School Of Computing and Information Systems

Traffic flow predictions are central to a wealth of problems in transportation. Path choice models can be used for this purpose, and in state-of-the-art models—so-called recursive path choice (RPC) models—the choice of a path is formulated as a sequential arc choice process using undiscounted Markov decision process (MDP) with an absorbing state. The MDP has a utility maximization objective with unknown parameters that are estimated based on data. The estimation and prediction using RPC models require repeatedly solving value functions that are solutions to the Bellman equation. Although there are several examples of successful applications of RPC models in the …

Tiktok As A Digital Activism Space: Social Justice Under Algorithmic Control, Brittany Haslem

Institute for the Humanities Theses

TikTok, a video sharing application, has become the center of viral internet culture. The app has risen in popularity so quickly that scholarly literature investigating its vast societal impact is still nascent. TikTok is not only used to discuss popular culture topics and create trends, but also being utilized as a tool for social justice activism in the United States in the wake of a tumultuous year with major events such as the coronavirus pandemic, a resurgence of the Black Lives Matter movement, and the 2020 presidential election. TikTok activism is not without critiques, ranging from concerns of foreign government …

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 …

Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan

Graduate Theses and Dissertations

Critical infrastructures (CI) play a vital role in majority of the fields and sectors worldwide. It contributes a lot towards the economy of nations and towards the wellbeing of the society. They are highly coupled, interconnected and their interdependencies make them more complex systems. Thus, when a damage occurs in a CI system, its complex interdependencies make it get subjected to cascading effects which propagates faster from one infrastructure to another resulting in wide service degradations which in turn causes economic and societal effects. The propagation of cascading effects of disruptive events could be handled efficiently if the assessment and …

Robust And Fair Machine Learning Under Distribution Shift, Wei Du

Graduate Theses and Dissertations

Machine learning algorithms have been widely used in real world applications. The development of these techniques has brought huge benefits for many AI-related tasks, such as natural language processing, image classification, video analysis, and so forth. In traditional machine learning algorithms, we usually assume that the training data and test data are independently and identically distributed (iid), indicating that the model learned from the training data can be well applied to the test data with good prediction performance. However, this assumption is quite restrictive because the distribution shift can exist from the training data to the test data in many …

Quantum Federated Learning: Training Hybrid Neural Networks Collaboratively, Anneliese Brei

Undergraduate Honors Theses

This thesis explores basic concepts of machine learning, neural networks, federated learning, and quantum computing in an effort to better understand Quantum Machine Learning, an emerging field of research. We propose Quantum Federated Learning (QFL), a schema for collaborative distributed learning that maintains privacy and low communication costs. We demonstrate the QFL framework and local and global update algorithms with implementations that utilize TensorFlow Quantum libraries. Our experiments test the effectiveness of frameworks of different sizes. We also test the effect of changing the number of training cycles and changing distribution of training data. This thesis serves as a synoptic …

The Executive’S Guide To Getting Ai Wrong, Jerrold Soh

Asian Management Insights

It’s all math. Really.

Computational Complexity Reduction Of Deep Neural Networks, Mee Seong Im, Venkat Dasari

Mathematica Militaris

Deep neural networks (DNN) have been widely used and play a major role in the field of computer vision and autonomous navigation. However, these DNNs are computationally complex and their deployment over resource-constrained platforms is difficult without additional optimizations and customization.

In this manuscript, we describe an overview of DNN architecture and propose methods to reduce computational complexity in order to accelerate training and inference speeds to fit them on edge computing platforms with low computational resources.

Unconventional Computation Including Quantum Computation, Bruce J. Maclennan

Faculty Publications and Other Works -- EECS

Unconventional computation (or non-standard computation) refers to the use of non-traditional technologies and computing paradigms. As we approach the limits of Moore’s Law, progress in computation will depend on going beyond binary electronics and on exploring new paradigms and technologies for information processing and control. This book surveys some topics relevant to unconventional computation, including the definition of unconventional computations, the physics of computation, quantum computation, DNA and molecular computation, and analog computation. This book is the content of a course taught at UTK.

Performance Improvements In Inner Product Encryption, Serena Riback

Honors Scholar Theses

Consider a database that contains thousands of entries of the iris biometric. Each entry identifies an individual, so it is especially important that it remains secure. However, searching for entries among an encrypted database proves to be a security problem - how should one search encrypted data without leaking any information to a potential attacker? The proximity searchable encryption scheme, as discussed in the work by Cachet et al., uses the notions of inner product encryption developed by Kim et al.. In this paper, we will focus on the efficiency of these schemes. Specifically, how the symmetry of the bilinear …

Mapping State-Sponsored Information Operations With Multi-View Modularity Clustering, Joshua Uyheng, Iain Cruickshank, Kathleen Carley

ACI Journal Articles

This paper presents a new computational framework for mapping state-sponsored information operations into distinct strategic units. Utilizing a novel method called multi-view modularity clustering (MVMC), we identify groups of accounts engaged in distinct narrative and network information maneuvers. We then present an analytical pipeline to holistically determine their coordinated and complementary roles within the broader digital campaign. Applying our proposed methodology to disclosed Chinese state-sponsored accounts on Twitter, we discover an overarching operation to protect and manage Chinese international reputation by attacking individual adversaries (Guo Wengui) and collective threats (Hong Kong protestors), while also projecting national strength during global crisis …