Theory and Algorithms Commons^™

Coded Distributed Function Computation, Pedro J. Soto

Dissertations, Theses, and Capstone Projects

A ubiquitous problem in computer science research is the optimization of computation on large data sets. Such computations are usually too large to be performed on one machine and therefore the task needs to be distributed amongst a network of machines. However, a common problem within distributed computing is the mitigation of delays caused by faulty machines. This can be performed by the use of coding theory to optimize the amount of redundancy needed to handle such faults. This problem differs from classical coding theory since it is concerned with the dynamic coded computation on data rather than just statically …

Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca

Research Collection School Of Computing and Information Systems

Reaching consensus-a macroscopic state where the system constituents display the same microscopic state-is a necessity in multiple complex socio-technical and techno-economic systems: their correct functioning ultimately depends on it. In many distributed systems-of which blockchain-based applications are a paradigmatic example-the process of consensus formation is crucial not only for the emergence of a leading majority but for the very functioning of the system. We build a minimalistic network model of consensus formation on blockchain systems for quantifying how central nodes-with respect to their average distance to others-can leverage on their position to obtain competitive advantage in the consensus process. We …

Private Information Retrieval And Function Computation For Noncolluding Coded Databases, Sarah A. Obead

Dissertations

The rapid development of information and communication technologies has motivated many data-centric paradigms such as big data and cloud computing. The resulting paradigmatic shift to cloud/network-centric applications and the accessibility of information over public networking platforms has brought information privacy to the focal point of current research challenges. Motivated by the emerging privacy concerns, the problem of private information retrieval (PIR), a standard problem of information privacy that originated in theoretical computer science, has recently attracted much attention in the information theory and coding communities. The goal of PIR is to allow a user to download a message from a …

Missing Value Estimation Using Clustering And Deep Learning Within Multiple Imputation Framework, Manar D. Samad, Sakib Abrar, Norou Diawara

Computer Science Faculty Research

Missing values in tabular data restrict the use and performance of machine learning, requiring the imputation of missing values. Arguably the most popular imputation algorithm is multiple imputation by chained equations (MICE), which estimates missing values from linear conditioning on observed values. This paper proposes methods to improve both the imputation accuracy of MICE and the classification accuracy of imputed data by replacing MICE’s linear regressors with ensemble learning and deep neural networks (DNN). The imputation accuracy is further improved by characterizing individual samples with cluster labels (CISCL) obtained from the training data. Our extensive analyses of six tabular data …

The Significance Of Sonic Branding To Strategically Stimulate Consumer Behavior: Content Analysis Of Four Interviews From Jeanna Isham’S “Sound In Marketing” Podcast, Ina Beilina

Student Theses and Dissertations

Purpose:
Sonic branding is not just about composing jingles like McDonald’s “I’m Lovin’ It.” Sonic branding is an industry that strategically designs a cohesive auditory component of a brand’s corporate identity. This paper examines the psychological impact of music and sound on consumer behavior reviewing studies from the past 40 years and investigates the significance of stimulating auditory perception by infusing sound in consumer experience in the modern 2020s.

Design/methodology/approach:
Qualitative content analysis of audio media was used to test two hypotheses. Four archival oral interview recordings from Jeanna Isham’s podcast “Sound in Marketing” featuring the sonic branding experts …

The Behaviors Of Bert Attention Heads In Stereotype Detection, Joseph H. Hajjar

Dartmouth College Master’s Theses

We are living in the age of information, where it has become increasingly easy to share ideas, news, and content which are seen by an increasingly large number of people. This increasing scope of the increasing amount of data that is being shared lends itself to the question: how can we determine whether what we are reading promotes a stereotype? Previous work has applied transformer based models in this domain yielding impressive performance, but few studies exist interpreting the nature of attention heads in this task. Our work explores the feature encoding and extraction behaviors of attention heads in transformer …

A Novel Method For Sensitivity Analysis Of Time-Averaged Chaotic System Solutions, Christian A. Spencer-Coker

Theses and Dissertations

The direct and adjoint methods are to linearize the time-averaged solution of bounded dynamical systems about one or more design parameters. Hence, such methods are one way to obtain the gradient necessary in locally optimizing a dynamical system’s time-averaged behavior over those design parameters. However, when analyzing nonlinear systems whose solutions exhibit chaos, standard direct and adjoint sensitivity methods yield meaningless results due to time-local instability of the system. The present work proposes a new method of solving the direct and adjoint linear systems in time, then tests that method’s ability to solve instances of the Lorenz system that exhibit …

A Machine Learning And Deep Learning Framework For Binary, Ternary, And Multiclass Emotion Classification Of Covid-19 Vaccine-Related Tweets, Aditya Dubey

Honors Scholar Theses

My research mines public emotion toward the Covid-19 vaccine based on Twitter data collected over the past 6-12 months. This project is centered around building and developing machine learning and deep learning models to perform natural language processing of short-form text, which in our case tweets. These tweets are all vaccine-related tweets and the goal of the classification task is for our models to accurately classify a tweet into one of four emotion groups: Apprehension/Anticipation, Sadness/Anger/Frustration, Joy/Humor/Sarcasm, and Gratitude/Relief. Given this data and the goal of the paper, we aim to answer the following questions: (1) Can a framework be …

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 …

Hhl Algorithm On The Honeywell H1 Quantum Computer, Adrik B. Herbert, Eric A. F. Reinhardt

Discovery Undergraduate Interdisciplinary Research Internship

The quantum algorithm for linear systems of equations (HHL algorithm) provides an efficient tool for finding solutions to systems of functions with a large number of variables and low sensitivity to changes in inputs (i.e. low error rates). For complex problems, such as matrix inversion, HHL requires exponentially less computational time as compared with classical computation methods. HHL can be adapted to current quantum computing systems with limited numbers of qubits (quantum computation bits) but a high reusability rate such as the Honeywell H1 quantum computer. Some methods for improving HHL have been proposed through the combination of quantum and …

A Self-Regulating System For Assessing Scientific Predictive Power, Ted C. Rogers

Physics Faculty Publications

I propose a method for tracking and assessing scientific progress using a prediction consensus algorithm designed for the purpose. The protocol obviates the need for centralized referees to generate scientific questions, gather predictions, and assess the accuracy or success of those predictions. It relies instead on crowd wisdom and a system of checks and balances for all tasks. It is intended to take the form of a web-based, searchable database. I describe a prototype implementation that I call Ex Quaerum. The main purpose of the present document is to motivate the project, to explain it's underlying philosophy, to explain the …

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 …

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.

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. …

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 …

Simulating Polistes Dominulus Nest-Building Heuristics With Deterministic And Markovian Properties, Benjamin Pottinger

Undergraduate Honors Theses

European Paper Wasps (Polistes dominula) are social insects that build round, symmetrical nests. Current models indicate that these wasps develop colonies by following simple heuristics based on nest stimuli. Computer simulations can model wasp behavior to imitate natural nest building. This research investigated various building heuristics through a novel Markov-based simulation. The simulation used a hexagonal grid to build cells based on the building rule supplied to the agent. Nest data was compared with natural data and through visual inspection. Larger nests were found to be less compact for the rules simulated.

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. …

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 Executive’S Guide To Getting Ai Wrong, Jerrold Soh

Asian Management Insights

This article explores how we see AI and argues that we mostly get it wrong. In the process, it explains the reasons backed by social science research on why we tend to get AI wrong and illustrates the dangers of doing so from a managerial and law-making perspective. Some readers may also find the article useful as a guide on how and when to manipulate portrayals of AI in your favour.