Benchmarks for Parity Games (extended version)

We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from https://github.com/jkeiren/paritygame-generator. This is an extended version of the paper that has been accepted for FSEN 201

Toy amphiphiles on the computer: What can we learn from generic models?

Generic coarse-grained models are designed such that they are (i) simple and (ii) computationally efficient. They do not aim at representing particular materials, but classes of materials, hence they can offer insight into universal properties of these classes. Here we review generic models for amphiphilic molecules and discuss applications in studies of self-assembling nanostructures and the local structure of bilayer membranes, i.e. their phases and their interactions with nanosized inclusions. Special attention is given to the comparison of simulations with elastic continuum models, which are, in some sense, generic models on a higher coarse-graining level. In many cases, it is possible to bridge quantitatively between generic particle models and continuum models, hence multiscale modeling works on principle. On the other side, generic simulations can help to interpret experiments by providing information that is not accessible otherwise.Comment: Invited feature article, to appear in Macromolecular Rapid Communication

Artificial Immune Systems - Models, algorithms and applications

Copyright © 2010 Academic Research Publishing Agency.This article has been made available through the Brunel Open Access Publishing Fund.Artificial Immune Systems (AIS) are computational paradigms that belong to the computational intelligence family and are inspired by the biological immune system. During the past decade, they have attracted a lot of interest from researchers aiming to develop immune-based models and techniques to solve complex computational or engineering problems. This work presents a survey of existing AIS models and algorithms with a focus on the last five years.This article is available through the Brunel Open Access Publishing Fun

Discrete-Query Quantum Algorithm for NAND Trees

This is a comment on the article “A Quantum Algorithm for the Hamiltonian NAND Tree” by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann, Theory of Computing 4 (2008) 169--190. That paper gave a quantum algorithm for evaluating NAND trees with running time O(√N) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using N^[1/2 + o(1)] queries in the conventional (discrete) quantum query model

A guided tour of asynchronous cellular automata

Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field. We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat