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

Galaxy bulges and their massive black holes: a review

With references to both key and oft-forgotten pioneering works, this article starts by presenting a review into how we came to believe in the existence of massive black holes at the centres of galaxies. It then presents the historical development of the near-linear (black hole)-(host spheroid) mass relation, before explaining why this has recently been dramatically revised. Past disagreement over the slope of the (black hole)-(velocity dispersion) relation is also explained, and the discovery of sub-structure within the (black hole)-(velocity dispersion) diagram is discussed. As the search for the fundamental connection between massive black holes and their host galaxies continues, the competing array of additional black hole mass scaling relations for samples of predominantly inactive galaxies are presented.Comment: Invited (15 Feb. 2014) review article (submitted 16 Nov. 2014). 590 references, 9 figures, 25 pages in emulateApJ format. To appear in "Galactic Bulges", E. Laurikainen, R.F. Peletier, and D.A. Gadotti (eds.), Springer Publishin

Sequencing batch reactor (SBR) treatment of wastewaters

Environmental Sanitation Reviews28-ENSR

Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms

Development and deployment of interactive evolutionary multiobjective optimization algorithms (EMOAs) have recently gained broad interest. In this study, first steps towards a theory of interactive EMOAs are made by deriving bounds on the expected number of function evaluations and queries to a decision maker. We analyze randomized local search and the (1+1)-EA on the biobjective problems LOTZ and COCZ under the scenario that the decision maker interacts with these algorithms by providing a subjective preference whenever solutions are incomparable. It is assumed that this decision is based on the decision maker's internal utility function. We show that the performance of the interactive EMOAs may dramatically worsen if the utility function is non-linear instead of linear. © 2012 Springer-Verlag.SCOPUS: cp.kinfo:eu-repo/semantics/publishe

Worst-case and Average-case Approximations by Simple Randomized Search Heuristics

Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact deterministic algorithms, little is known about the average-case behavior of randomized search heuristics (RSHs). In this paper, two simple RSHs are studied on a simple scheduling problem. While it turns out that in the worst case, both RSHs need exponential time to create solutions being significantly better than 4/3-approximate, an average-case analysis for two input distributions reveals that one RSH is convergent to optimality in polynomial time. Moreover, it is shown that for both RSHs, parallel runs yield a PRAS.