Algorithms for partially robust team formation

In one of its simplest forms, Team Formation involves deploying the least expensive team of agents while covering a set of skills. While current algorithms are reasonably successful in computing the best teams, the resilience to change of such solutions remains an important concern: Once a team has been formed, some of the agents considered...

Efficient Super-Resolution Two-Dimensional Harmonic Retrieval with Multiple Measurement Vectors

This paper develops an efficient solution for super-resolution two-dimensional (2D) harmonic retrieval from multiple measurement vectors (MMV). Given the sample covariance matrix constructed from the MMV, a gridless compressed sensing approach is proposed based on the atomic norm minimization (ANM). In the approach, our key step is to perform...

A Fully Homomorphic Encryption Scheme for Real-Time Safe Control

Fully Homomorphic Encryption (FHE) has made it possible to perform addition and multiplication operations on encrypted data. Using FHE in control thus has the advantage that control effort for a plant can be calculated remotely without ever decrypting the exchanged information. FHE in its current form is however not practically applicable for...

The complexity of the vertex-minor problem

A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades and have found applications in other fields such as quantum information theory. Therefore it is natural to...

An Improved Greedy Algorithm for Subset Selection in Linear Estimation

In this paper, we consider a subset selection problem in a spatial field where we seek to find a set of k locations whose observations provide the best estimate of the field value at a finite set of prediction locations. The measurements can be taken at any location in the continuous field, and the covariance between the field values at...

On the structural target controllability of undirected networks

In this article, we study the target controllability problem of networked dynamical systems,in which we are tasked to steer a subset of network nodes toward a desired objective. More specifically, we derive necessary and sufficient conditions for the structural target controllability of linear time-invariant (LTI) systems with symmetric state...

Development of a quasi-linear parameter varying model for a tiltrotor aircraft

The research presented in this paper focuses on the development of a quasi-Linear Parameter Varying (qLPV) model for the XV-15 tiltrotor aircraft. The specific category of qLPV modeling technique, known as the model stitching technique, is employed to model the time-varying dynamics of XV-15 tiltrotor aircraft over the entire flight envelope....

Distributing tasks in committees: An algorithmic research in a cooperative game theory problem

Cooperative game theory studies multi-agent environments where agents are able to make binding agreements. A lot has been written about dividing goods or other positive gains among the agents. This study investigates ways to distribute tasks with a negative utility in a strategyproof way. The intended application is a group of people or...

Hardness and ease of curing the sign problem for two-local qubit Hamiltonians

We examine the problem of determining whether a multiqubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard. This is shown by constructing a class of Hamiltonians for which performing this task is equivalent to...

Computing graph gonality is hard

There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree of a finite harmonic morphism from a refinement of G to a tree, as defined by Cornelissen, Kato and Kool....

Local multi-qubit Clifford equivalence of graph states

In the range of applications opened by quantum technology, often a highly entangled source state is needed as an input for a protocol (target state). The easiest example of such an application is QKD, other examples are quantum secret sharing and measurement based quantum computing. Generating a non-local entangled state is however not trivial....

Transforming graph states using single-qubit operations

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements...

Higher order exponential splittings for the fast Non-linear Fourier Transform of the Korteweg-De Vries equation

Non-linear Fourier Transforms (NFTs) enable the analysis of signals governed by certain non-linear evolution equations in a way that is analogous to how the conventional Fourier transform is used to analyse linear wave equations. Recently, fast numerical algorithms have been derived for the numerical computation of certain NFTs. In this paper,...

Noise minimization on houses around airports

This thesis was a combined project of the CWI (the national research institute for mathematics and computer science in the Netherlands) and the NLR (National Aerospace Laboratory of the Netherlands). In this thesis we examine noise pollution around airports. Given an airport we will consider the problem maximizing the number of flights, while...

The Navigational Power of Web Browsers

We investigate the computational capabilities of Web browsers, when equipped with a standard finite automaton. We observe that Web browsers are Turingcomplete. We introduce the notion of a navigational problem, and investigate the complexity of solving Web queries and navigational problems by Web browsers, where complexity is measured by the...

Efficient Identification of Timed Automata: Theory and practice

This thesis contains a study in a subfield of artificial intelligence, learning theory, machine learning, and statistics, known as system (or language) identification. System identification is concerned with constructing (mathematical) models from observations. Such a model is an intuitive description of a complex system. One of the main nice...

Distributed Task Allocation in Social Networks

This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NPhard. Moreover, it is not approximable within some factor. We develop an algorithm based on the contract-net...