Abstract
Nowadays, microarray has become a fairly common tool for simultaneously inspecting the behavior of thousands of genes. Researchers have employed this technique to understand various biological phenomena. One straightforward use of such technology is identifying the class membership of the tissue samples based on their gene expression profiles. This task has been handled by a number of computational methods. In this paper, we provide a comprehensive evaluation of 7 commonly used algorithms over 6S publicly available gene expression datasets. The focus of the study was on comparing the performance of the algorithms in an efficient and sound manner, supporting the prospective users on how to proceed to choose the most adequate classification approach according to their investigation goals.

Abstract
Silica based nanostructured composite materials doped with luminol and cobalt(II) ion were synthesized and characterized, resulting in a highly chemiluminescent material in the presence of hydrogen peroxide. A detection system with the CL light guided from the reaction tube to the photomultiplier tube using a one millimeter glass optical fiber was developed and assessed. A linear response was observed using a semi-logarithm calibration between 50-2000M hydrogen peroxide with 1M as the limit of detection.

Abstract
In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK. It was previously known that PSPACE, and hence BPP is Turing-reducible to RK. The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial length using the set RK as oracle. Our new non-adaptive result relies on a new fundamental fact about the set RK, namely each initial segment of the characteristic sequence of RK has high Kolmogorov complexity. As a partial converse to our claim we show that strings of very high Kolmogorov-complexity when used as advice are not much more useful than randomly chosen strings. © 2010 IEEE.

Abstract
GRASP with path-relinking (GRASP+PR) is a metaheuristic for finding optimal or near-optimal solutions of combinatorial optimization problems. This paper proposes a new automatic parameter tuning procedure for GRASP+PR heuristics based on a biased random-key genetic algorithm (BRKGA). Given a GRASP+PR heuristic with n input parameters; the tuning procedure makes use of a BRKGA in a first phase to explore the parameter space and set the parameters with which the GRASP+PR heuristic will run in a second phase. The procedure is illustrated with a GRASP+PR for the generalized quadratic assignment problem with n = 30 parameters. Computational results show that the resulting hybrid heuristic is robust.

Abstract
Modern greenhouse climate controllers are based on models in order to simulate and predict the greenhouse environment behaviour. These models must be able to describe indoor climate process dynamics, which are a function of both the control actions taken and the outside climate. Moreover, if predictive or feedforward control techniques are to be applied, it is necessary to employ models to describe and predict the weather. From all the climate variables, solar radiation is the one with greater impact in the greenhouse heat load. Hence, making good predictions of this physical quantity is of extreme importance. In this paper, the solar radiation is represented as a time-series and a support vector regression model is used to make long term predictions. Results are compared with the ones achieved by using other type of models, both linear and non-linear.

Abstract
Serious Games are growing into a significant area spurred by the growth in the use of video games and of new methods for their development. They have important applications in several distinct areas such as: military, health, government, and education. The design of computer games can offer valuable contributions to develop effective games in the rehabilitation area. This paper presents fundamental concepts relating to Serious Games followed by a survey of relevant work and applications on Serious Games for Rehabilitation. We propose a classification designed to properly distinguish and compare Serious Games for Rehabilitation systems in what concerns their fundamental characteristics. We also describe a particular Serious Game for Rehabilitation, RehaCom, as a case study. Finally, the paper presents some challenges and research opportunities in this area.