Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling

This paper presents a state transition based formal framework for a new search method, called Evolutionary Ruin and Stochastic Recreate, which tries to learn and adapt to the changing environments during the search process. It improves the performance of the original Ruin and Recreate principle by embedding an additional phase of Evolutionary Ruin to mimic the survival-of-the-fittest mechanism within single solutions. This method executes a cycle of Solution Decomposition, Evolutionary Ruin, Stochastic Recreate and Solution Acceptance until a certain stopping condition is met. The Solution Decomposition phase first uses some problem-specific knowledge to decompose a complete solution into its components and assigns a score to each component. The Evolutionary Ruin phase then employs two evolutionary operators (namely Selection and Mutation) to destroy a certain fraction of the solution, and the next Stochastic Recreate phase repairs the “broken” solution. Last, the Solution Acceptance phase selects a specific strategy to determine the probability of accepting the newly generated solution. Hence, optimisation is achieved by an iterative process of component evaluation, solution disruption and stochastic constructive repair. From the state transitions point of view, this paper presents a probabilistic model and implements a Markov chain analysis on some theoretical properties of the approach. Unlike the theoretical work on genetic algorithm and simulated annealing which are based on state transitions within the space of complete assignments, our model is based on state transitions within the space of partial assignments. The exam timetabling problems are used to test the performance in solving real-world hard problems

Ranking relations using analogies in biological and information networks

Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to relational learning which, given a set of pairs of objects $\mathbf{S}=\{A^{(1)}:B^{(1)},A^{(2)}:B^{(2)},\ldots,A^{(N)}:B ^{(N)}\}$, measures how well other pairs A:B fit in with the set $\mathbf{S}$. Our work addresses the following question: is the relation between objects A and B analogous to those relations found in $\mathbf{S}$? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest. There are many ways in which objects can be related, making the task of measuring analogies very challenging. Our approach combines a similarity measure on function spaces with Bayesian analysis to produce a ranking. It requires data containing features of the objects of interest and a link matrix specifying which relationships exist; no further attributes of such relationships are necessary. We illustrate the potential of our method on text analysis and information networks. An application on discovering functional interactions between pairs of proteins is discussed in detail, where we show that our approach can work in practice even if a small set of protein pairs is provided.Comment: Published in at http://dx.doi.org/10.1214/09-AOAS321 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Realtime Profiling of Fine-Grained Air Quality Index Distribution using UAV Sensing

Given significant air pollution problems, air quality index (AQI) monitoring has recently received increasing attention. In this paper, we design a mobile AQI monitoring system boarded on unmanned-aerial-vehicles (UAVs), called ARMS, to efficiently build fine-grained AQI maps in realtime. Specifically, we first propose the Gaussian plume model on basis of the neural network (GPM-NN), to physically characterize the particle dispersion in the air. Based on GPM-NN, we propose a battery efficient and adaptive monitoring algorithm to monitor AQI at the selected locations and construct an accurate AQI map with the sensed data. The proposed adaptive monitoring algorithm is evaluated in two typical scenarios, a two-dimensional open space like a roadside park, and a three-dimensional space like a courtyard inside a building. Experimental results demonstrate that our system can provide higher prediction accuracy of AQI with GPM-NN than other existing models, while greatly reducing the power consumption with the adaptive monitoring algorithm

Database Driven Updatable Hydraulic Model for Decision Making

AbstractDuring Feb 2011 – Dec 2012 Tallinn Water Company (AS Tallinna Vesi) took a target to improve the previous hydraulic model creation procedures that can be updated through the available geographic information system (GIS), client information system (Navision), supervisory control and data acquisition system (SCADA). The Phase 1 was finished in May 2012. The current phase, Phase 2, started in summer 2012 and included pressure measurement point selections, data validation and model calibration

RunMC - an object-oriented analysis framework for Monte Carlo simulation of high-energy particle collisions

RunMC is an object-oriented framework aimed to generate and to analyse high-energy collisions of elementary particles using Monte Carlo simulations. This package, being based on C++ adopted by CERN as the main programming language for the LHC experiments, provides a common interface to different Monte Carlo models using modern physics libraries. Physics calculations (projects) can easily be loaded and saved as external modules. This simplifies the development of complicated calculations for high energy physics in large collaborations.This desktop program is open-source licensed and is available on the LINUX and Windows/Cygwin platforms.Comment: 15 pages, 1 eps figure, accepted by Comp. Phys. Commu

The EM Algorithm and the Rise of Computational Biology

In the past decade computational biology has grown from a cottage industry with a handful of researchers to an attractive interdisciplinary field, catching the attention and imagination of many quantitatively-minded scientists. Of interest to us is the key role played by the EM algorithm during this transformation. We survey the use of the EM algorithm in a few important computational biology problems surrounding the "central dogma"; of molecular biology: from DNA to RNA and then to proteins. Topics of this article include sequence motif discovery, protein sequence alignment, population genetics, evolutionary models and mRNA expression microarray data analysis.Comment: Published in at http://dx.doi.org/10.1214/09-STS312 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org