Theory and Algorithms Commons^™

Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Solving the multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is challenging due to its non-deterministic property and conflicting objectives. Most multi -objective evolutionary algorithm dealing with this problem update current population without any guidance from previous searching experience. In this paper, a multi -objective evolutionary algorithm based on artificial neural networks is proposed to tackle the MO-VRPSD. Particularly, during the evolutionary process, a radial basis function net-work (RBFN) is exploited to learn the potential knowledge of individuals, generate hypoth-esis and instantiate hypothesis. The RBFN evaluates individuals with different scores and generates new individuals with higher quality while taking into …

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Quadratic unconstrained binary optimization (QUBO) models have garnered growing interests as a strong alternative modelling framework for solving combinatorial optimization problems. A wide variety of optimization problems that are usually studied using conventional Operations Research approaches can be formulated as QUBO problems. However, QUBO solvers do not guarantee optimality when solving optimization problems. Instead, obtaining high quality solutions using QUBO solvers entails tuning of multiple parameters. Here in our work, we conjecture that the initial states adjustment method used in QUBO solvers can be improved, where careful tuning will yield overall better results. We propose a data-driven multi-start algorithm that …

Space-Efficient Algorithms And Verification Schemes For Graph Streams, Prantar Ghosh

Dartmouth College Ph.D Dissertations

Structured data-sets are often easy to represent using graphs. The prevalence of massive data-sets in the modern world gives rise to big graphs such as web graphs, social networks, biological networks, and citation graphs. Most of these graphs keep growing continuously and pose two major challenges in their processing: (a) it is infeasible to store them entirely in the memory of a regular server, and (b) even if stored entirely, it is incredibly inefficient to reread the whole graph every time a new query appears. Thus, a natural approach for efficiently processing and analyzing such graphs is reading them as …

Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng

Mathematical Sciences Technical Reports (MSTR)

In 2012, Guedes, Assis, and Lula proposed a quantum attack on a pseudorandom number generator named the Blum-Micali Pseudorandom number generator. They claimed that the quantum attack can outperform classical attacks super-polynomially. However, this paper shows that the quantum attack cannot get the correct seed and provides another corrected algorithm that is in exponential time but still faster than the classical attack. Since the original classical attacks are in exponential time, the Blum-Micali pseudorandom number generator would be still quantum resistant.

Legislative Language For Success, Sanjana Gundala

Master's Theses

Legislative committee meetings are an integral part of the lawmaking process for local and state bills. The testimony presented during these meetings is a large factor in the outcome of the proposed bill. This research uses Natural Language Processing and Machine Learning techniques to analyze testimonies from California Legislative committee meetings from 2015-2016 in order to identify what aspects of a testimony makes it successful. A testimony is considered successful if the alignment of the testimony matches the bill outcome (alignment is "For" and the bill passes or alignment is "Against" and the bill fails). The process of finding what …

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 …

Deep Learning For Anomaly Detection, Guansong Pang, Charu Aggarwal, Chunhua Shen, Nicu Sebe

Research Collection School Of Computing and Information Systems

A nomaly detection aims at identifying data points which are rare or significantly different from the majority of data points. Many techniques are explored to build highly efficient and effective anomaly detection systems, but they are confronted with many difficulties when dealing with complex data, such as failing to capture intricate feature interactions or extract good feature representations. Deep-learning techniques have shown very promising performance in tackling different types of complex data in a broad range of tasks/problems, including anomaly detection. To address this new trend, we organized this Special Issue on Deep Learning for Anomaly Detection to cover the …

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 …

Do-Gan: A Double Oracle Framework For Generative Adversarial Networks, Aye Phyu Phye Aung, Xinrun Wang, Runsheng Yu, Bo An, Senthilnath Jayavelu, Xiaoli Li

Research Collection School Of Computing and Information Systems

In this paper, we propose a new approach to train Gen-erative Adversarial Networks (GANs) where we deploy a double-oracle framework using the generator and discrim-inator oracles. GAN is essentially a two-player zero-sum game between the generator and the discriminator. Training GANs is challenging as a pure Nash equilibrium may not exist and even finding the mixed Nash equilibrium is difficult as GANs have a large-scale strategy space. In DO-GAN, we extend the double oracle framework to GANs. We first generalize the players' strategies as the trained models of generator and discriminator from the best response or-acles. We then compute the …

Learning To Solve Routing Problems Via Distributionally Robust Optimization, Jiang Yuan, Yaoxin Wu, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Recent deep models for solving routing problems always assume a single distribution of nodes for training, which severely impairs their cross-distribution generalization ability. In this paper, we exploit group distributionally robust optimization (group DRO) to tackle this issue, where we jointly optimize the weights for different groups of distributions and the parameters for the deep model in an interleaved manner during training. We also design a module based on convolutional neural network, which allows the deep model to learn more informative latent pattern among the nodes. We evaluate the proposed approach on two types of wellknown deep models including GCN …

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 …

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 …

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 …