Related papers: A computational systems biology study of the lambd…
We investigate the $\Lambda$-Seed-Bank-Wright-Fisher process, a model describing allele frequency dynamics in populations exhibiting both skewed offspring distributions and dormancy. By performing a change of measure, we condition this…
Switching dynamical systems provide a powerful, interpretable modeling framework for inference in time-series data in, e.g., the natural sciences or engineering applications. Since many areas, such as biology or discrete-event systems, are…
We introduce and study the mutating contact process, a variant of the multitype contact process, where one type mutates at a constant rate to the other type. We prove that on $\mathbb{Z}$ a single mutant cannot survive while on…
A $(K,\Lambda)$ shift-modulation invariant space is a subspace of $L^2(G)$, that is invariant by translations along elements in $K$ and modulations by elements in $\Lambda$. Here $G$ is a locally compact abelian group, and $K$ and $\Lambda$…
In the field of evolutionary computation, one of the most challenging topics is algorithm selection. Knowing which heuristics to use for which optimization problem is key to obtaining high-quality solutions. We aim to extend this research…
Propagation of transition fronts in models of coupled oscillators with non-degenerate on-site potential is usually considered in terms of travelling waves. We show that the system dynamics can be reformulated as an implicit map structure,…
Formal modelling of Multi-Agent Systems (MAS) is a challenging task due to high complexity, interaction, parallelism and continuous change of roles and organisation between agents. In this paper we record our research experience on formal…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
We study the stability of switched systems where the dynamic modes are described by systems of higher-order linear differential equations not necessarily sharing the same state space. Concatenability of trajectories at the switching…
We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point representation after each step (i.e., stored as a…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…
In real-world systems, phase transitions often materialize abruptly, making it difficult to design appropriate controls that help uncover underlying processes. Some agent-based computational models display transformations similar to phase…
In this paper, we study stabilizability of discrete-time switched linear systems where the switching signal is considered as an arbitrary disturbance (and not a control variable). We characterize feedback stabilization via necessary and…
Mutation testing is the state-of-the-art technique for assessing the fault detection capacity of a test suite. Unfortunately, a full mutation analysis is often prohibitively expensive. The CppCheck project for instance, demands a build time…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
This paper deals with stabilization of discrete-time switched linear systems when explicit knowledge of the state-space models of their subsystems is not available. Given the set of admissible switches between the subsystems, the admissible…
In this paper, we analyse the behaviour of a buck converter network that contains arbitrary, up to mild regularity assumptions, loads. Our analysis of the network begins with the study of the current dynamics; we propose a novel Lyapunov…
In this book we promote logical computational linguistics as opposed to statistical computational linguistics. In particular, we provide a logical semantic interface. This book assembles more than twenty years of research work on type…
Spatio-temporal dynamics of a deterministic three-level cellular automaton (TLCA) of Zykov-Mikhailov type (Sov. Phys. - Dokl., 1986, Vol.31, No.1, P.51) is studied numerically. Evolution of spatial structures is investigated both for the…
We propose a new test case prioritization technique that combines both mutation-based and diversity-based approaches. Our diversity-aware mutation-based technique relies on the notion of mutant distinguishment, which aims to distinguish one…