Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, 2022 Phenikaa University

#### Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai

*Research Collection School Of Computing and Information Systems*

We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each customer chooses among all available facilities according to a random utility maximization model. We employ the generalized extreme value (GEV) family of discrete choice models and show that the objective function in this context is monotonic and submodular. This finding implies that a simple greedy heuristic can always guarantee a (1−1/e) approximation solution. We further develop a new algorithm combining a greedy heuristic, …

Variational Graph Author Topic Modeling, 2022 Singapore Management University

#### Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw

*Research Collection School Of Computing and Information Systems*

While Variational Graph Auto-Encoder (VGAE) has presented promising ability to learn representations for documents, most existing VGAE methods do not model a latent topic structure and therefore lack semantic interpretability. Exploring hidden topics within documents and discovering key words associated with each topic allow us to develop a semantic interpretation of the corpus. Moreover, documents are usually associated with authors. For example, news reports have journalists specializing in writing certain type of events, academic papers have authors with expertise in certain research topics, etc. Modeling authorship information could benefit topic modeling, since documents by the same authors tend to reveal …

Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, 2022 Singapore Management University

#### Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen

*Research Collection School Of Computing and Information Systems*

We propose a framework, called neural-progressive hedging (NP), that leverages stochastic programming during the online phase of executing a reinforcement learning (RL) policy. The goal is to ensure feasibility with respect to constraints and risk-based objectives such as conditional value-at-risk (CVaR) during the execution of the policy, using probabilistic models of the state transitions to guide policy adjustments. The framework is particularly amenable to the class of sequential resource allocation problems since feasibility with respect to typical resource constraints cannot be enforced in a scalable manner. The NP framework provides an alternative that adds modest overhead during the online phase. …

2-Dimensional String Problems: Data Structures And Quantum Algorithms, 2022 Louisiana State University

#### 2-Dimensional String Problems: Data Structures And Quantum Algorithms, Dhrumilkumar Patel

*LSU Master's Theses*

The field of stringology studies algorithms and data structures used for processing strings efficiently. The goal of this thesis is to investigate 2-dimensional (2D) variants of some fundamental string problems, including \textit{Exact Pattern Matching} and \textit{Longest Common Substring}.

In the 2D pattern matching problem, we are given a matrix $\M[1\dd n,1\dd n]$ that consists of $N = n \times n$ symbols drawn from an alphabet $\Sigma$ of size $\sigma$. The query consists of a $ m \times m$ square matrix $\PP[1\dd m, 1\dd m]$ drawn from the same alphabet, and the task is to find all the locations of $\PP$ …

A Nature-Inspired Approach For Scenario-Based Validation Of Autonomous Systems, 2022 Embry-Riddle Aeronautical University

#### A Nature-Inspired Approach For Scenario-Based Validation Of Autonomous Systems, Quentin Goss, Mustafa Akbas

*Beyond: Undergraduate Research Journal*

Scenario-based approaches are cost and time effective solutions to autonomous cyber-physical system testing to identify bugs before costly methods such as physical testing in a controlled or uncontrolled environment. Every bug in an autonomous cyber-physical system is a potential safety risk. This paper presents a scenario-based method for finding bugs and estimating boundaries of the bug profile. The method utilizes a nature-inspired approach adapting low discrepancy sampling with local search. Extensive simulations demonstrate the performance of the approach with various adaptations.

On The Total Set Chromatic Number Of Graphs, 2022 Ateneo de Manila University

#### On The Total Set Chromatic Number Of Graphs, Mark Anthony C. Tolentino, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz

*Theory and Applications of Graphs*

Given a vertex coloring *c* of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring *c* is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χ_{s}(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings; that is, we study set colorings of the total graph of graphs. Given a graph *G* = (*V*, …

Intuitr: A Theorem Prover For Intuitionistic Propositional Logic, 2022 University of Minnesota - Morris

#### Intuitr: A Theorem Prover For Intuitionistic Propositional Logic, Erik Rauer

*Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal*

A constructive proof proves the existence of a mathematical object by giving the steps necessary to construct said object. Proofs of this type can be interpreted as an algorithm for creating such an object. Intuitionistic Propositional Logic (IPL) is a propositional logic system wherein all valid proofs are constructive. intuitR is a theorem prover for IPL, that is, it determines whether a given formula is valid in IPL or not. In this paper, we describe how intuitR determines the validity of a formula and review its performance. When compared on a benchmark set of problems, intuitR was determined to solve …

Filling Gaps On The Pareto Front In Multi- And Many-Objective Optimization, 2022 University of Minnesota - Morris

#### Filling Gaps On The Pareto Front In Multi- And Many-Objective Optimization, Richard Lussier

*Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal*

Pareto fronts offer insight into the best found solutions of a given problem. Several algorithms have been developed to help maintain a well-distributed Pareto front and therefore offer a wide variety of solutions. However, in real-world problems, the Pareto front isn’t necessarily a continuous surface and may contain holes and/or discontinuous lines. These irregular areas on the Pareto front are considered gaps. These gaps can either be natural or artificial. In their research, Pellicer, Escudero, Alzueta, and Deb suggest a three-step procedure to find, validate, and fill these gaps. First, they developed an algorithm to generate gap points. Second, they …

Review Of Some Existing Qml Frameworks And Novel Hybrid Classical-Quantum Neural Networks Realising Binary Classification For The Noisy Datasets, 2022 Singapore Management University

#### Review Of Some Existing Qml Frameworks And Novel Hybrid Classical-Quantum Neural Networks Realising Binary Classification For The Noisy Datasets, N. Schetakis, D. Aghamalyan, Paul Robert Griffin, M. Boguslavsky

*Research Collection School Of Computing and Information Systems*

One of the most promising areas of research to obtain practical advantage is Quantum Machine Learning which was born as a result of cross-fertilisation of ideas between Quantum Computing and Classical Machine Learning. In this paper, we apply Quantum Machine Learning (QML) frameworks to improve binary classification models for noisy datasets which are prevalent in financial datasets. The metric we use for assessing the performance of our quantum classifiers is the area under the receiver operating characteristic curve AUC-ROC. By combining such approaches as hybrid-neural networks, parametric circuits, and data re-uploading we create QML inspired architectures and utilise them for …

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, 2022 Singapore Management University

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

Techniques To Enhance A Qubo Solver For Permutation-Based Combinatorial Optimization, 2022 Singapore Management University

#### Techniques To Enhance A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Jianyuan Bo, Sabrish Gopalakrishnan, Hoong Chuin Lau

*Research Collection School Of Computing and Information Systems*

Many combinatorial optimization problems can be formulated as a problem to determine the order of sequence or to find a corresponding mapping of the objects. We call such problems permutation-based optimization problems. Many such problems can be formulated as a quadratic unconstrained binary optimization (QUBO) or Ising model by introducing a penalty coefficient to the permutation constraint terms. While classical and quantum annealing approaches have been proposed to solve QUBOs to date, they face issues with optimality and feasibility. Here we treat a given QUBO solver as a black box and propose techniques to enhance its performance. First, to ensure …

Scalable Data Analytics For Relational Databases, Graphs And Videos, 2022 University of Massachusetts Amherst

#### Scalable Data Analytics For Relational Databases, Graphs And Videos, Fubao Wu

*Doctoral Dissertations*

Data analytics is to analyze raw data and mine insights, trends, and patterns from them. Due to the dramatic increase in data volume and size in recent years with the development of big data and cloud storage, big data analytics algorithms and techniques have been faced with more challenges. Moreover, there are various types of data formats, such as relational databases, text data, audio data, and image/video data. It is challenging to generate a unified framework or algorithm for data analytics on various data formats. Different data formats still need refined and scalable algorithms. In this dissertation, we explore three …

Space-Efficient Algorithms And Verification Schemes For Graph Streams, 2022 Dartmouth College

#### 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, 2022 Rose-Hulman Institute of Technology

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

Coded Distributed Function Computation, 2022 The Graduate Center, City University of New York

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

Legislative Language For Success, 2022 California Polytechnic State University, San Luis Obispo

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

Deep Learning For Anomaly Detection, 2022 Singapore Management University

#### 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, 2022 Singapore Management University

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

Missing Value Estimation Using Clustering And Deep Learning Within Multiple Imputation Framework, 2022 Tennessee State University

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

A Novel Method For Sensitivity Analysis Of Time-Averaged Chaotic System Solutions, 2022 Mississippi State University

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