Air pollution is a major concern for public health and urban environments. Conventional air pollution monitoring systems install a few highly accurate, expensive stations at representative locations. Their sparse coverage and low spatial resolution are insufficient to quantify urban air pollution and its impacts on human health and environment. Advances in low-cost portable air pollution sensors have enabled air pollution monitoring deployments at scale to measure air pollution at high spatiotemporal resolution. However, it is challenging to ensure the accuracy of these low-cost sensor deployments because the sensors are more error-prone than high-end sensing infrastructures and they are often deployed in harsh environments. Sensor calibration has proven to be effective to improve the data quality of low-cost sensors and maintain the reliability of long-term, distributed sensor deployments. In this article, we review the state-of-the-art low-cost air pollution sensors, identify their major error sources, and comprehensively survey calibration models as well as network re-calibration strategies suited for different sensor deployments. We also discuss limitations of exiting methods and conclude with open issues for future sensor calibration research.

In this paper, we discuss the idea of incorporating preference information into evolutionary multi-objective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of his or her reference point consisting of desirable aspiration levels for objective functions. The information is used in an evolutionary algorithm to generate a new population by combining the fitness function and an achievement scalarizing function. In multi-objective optimization, achievement scalarizing functions are widely used to project a given reference point into the Pareto optimal set. In our approach, the next population is thus more concentrated in the area where more preferred alternatives are assumed to lie and the whole Pareto optimal set does not have to be generated with equal accuracy. The approach is demonstrated by numerical examples.

We present a novel graphical Gaussian modeling approach for reverse engineering of genetic regulatory networks with many genes and few observations. When applying our approach to infer a gene network for isoprenoid biosynthesis in Arabidopsis thaliana, we detect modules of closely connected genes and candidate genes for possible cross-talk between the isoprenoid pathways. Genes of downstream pathways also fit well into the network. We evaluate our approach in a simulation study and using the yeast galactose network.

Recently, there has been a substantial interest in the design of systems that receive their energy from regenerative sources such as solar cells. In contrast to approaches that attempt to minimize the power consumption we are concerned with adapting parameters of the application such that a maximal utility is obtained while respecting the limited and time-varying amount of available energy. Instead of solving the optimization problem on-line which may be prohibitively complex in terms of running time and energy consumption, we propose a parameterized specification and the computation of a corresponding optimal on-line controller. The efficiency of the new approach is demonstrated by experimental results and measurements on a sensor node