Abstract
This paper proposes a novel hybrid particle swarm optimization methodology to solve the problem of optimal participation in multiple electricity markets. The decision time is usually very important when planning the participation in electricity markets. This environment is characterized by the time available to take action, since different electricity markets have specific rules, which requires participants to be able to adapt and plan their decisions in a short time. Using metaheuristic optimization, participants' time problems can be resolved, because these methods enable problems to be solved in a short time and with good results. This paper proposes a hybrid resolution method, which is based on the particle swarm optimization metaheuristic. An exact mathematical method, which solves a simplified, linearized, version of the problem, is used to generate the initial solution for the metaheuristic approach, with the objective of improving the quality of results without representing a significant increase of the execution time.

Abstract
There exist many dataflow applications with timing constraints that require real-time guarantees on safe execution without violating their deadlines. Extraction of timing parameters (offsets, deadlines, periods) from these applications enables the use of real-time scheduling and analysis techniques, and provides guarantees on satisfying timing constraints. However, existing extraction techniques require the transformation of the dataflow application from highly expressive dataflow computational models, for example, Synchronous Dataflow (SDF) and Cyclo-Static Dataflow (CSDF) to Homogeneous Synchronous Dataflow (HSDF). This transformation can lead to an exponential increase in the size of the application graph that significantly increases the runtime of the analysis. In this article, we address this problem by proposing an offline heuristic algorithm called slack-based merging. The algorithm is a novel graph reduction technique that helps in speeding up the process of timing parameter extraction and finding a feasible real-time schedule, thereby reducing the overall design time of the real-time system. It uses two main concepts: (a) the difference between the worst-case execution time of the SDF graph's firings and its timing constraints (slack) to merge firings together and generate a reducedsize HSDF graph, and (b) the novel concept of merging called safe merge, which is a merge operation that we formally prove cannot cause a live HSDF graph to deadlock. The results show that the reduced graph (1) respects the throughput and latency constraints of the original application graph and (2) typically speeds up the process of extracting timing parameters and finding a feasible real-time schedule for real-time dataflow applications. They also show that when the throughput constraint is relaxed with respect to the maximal throughput of the graph, the merging algorithm is able to achieve a larger reduction in graph size, which in turn results in a larger speedup of the real-time scheduling algorithms.

Abstract
This paper addresses the topic of target detection and tracking using a team of UAVs for maritime border surveillance. We present a novel method on how to integrate the perception into the control loop using two distinct teams of UAVs that are cooperatively tracking the same target. We demonstrate and evaluate the effectiveness of our approach in a simulation environment.

Abstract
AbstractMicroorganisms evolved adaptive responses that enable them to survive stressful challenges in ever changing environments by adjusting metabolism through the modulation of gene expression, protein levels and activity, and flow of metabolites. More frequent challenges allow natural selection ampler opportunities to select from a larger number of phenotypes that are compatible with survival. Understanding the causal relationships between physiological and metabolic requirements that are needed for cellular stress adaptation and gene expression changes that are used by organisms to achieve those requirements may have a significant impact in our ability to interpret and/or guide evolution.Here, we study those causal relationships during heat shock adaptation in the yeastSaccharomyces cerevisiae. We do so by combining dozens of independent experiments measuring whole genome gene expression changes during stress response with a nonlinear simplified kinetic model of central metabolism.This combination is used to create a quantitative, multidimensional, genotype-to-phenotype mapping of the metabolic and physiological requirements that enable cell survival to the feasible changes in gene expression that modulate metabolism to achieve those requirements. Our results clearly show that the feasible changes in gene expression that enable survival to heat shock are specific for this stress. In addition, they suggest that genetic programs for adaptive responses to desiccation/rehydration and to pH shifts might be selected by physiological requirements that are qualitatively similar, but quantitatively different to those for heat shock adaptation. In contrast, adaptive responses to other types of stress do not appear to be constrained by the same qualitative physiological requirements. Our model also explains at the mechanistic level how evolution might find different sets of changes in gene expression that lead to metabolic adaptations that are equivalent in meeting physiological requirements for survival. Finally, our results also suggest that physiological requirements for heat shock adaptation might be similar between unicellular ascomycetes that live in similar environments. Our analysis is likely to be scalable to other adaptive response and might inform efforts in developing biotechnological applications to manipulate cells for medical, biotechnological, or synthetic biology purposes.

Abstract

Abstract
Several algorithms for clustering data streams based on k-Means have been proposed in the literature. However, most of them assume that the number of clusters, k, is known a priori by the user and can be kept fixed throughout the data analySis process. Besides the difficulty in choosing k, data stream clustering imposes several challenges to be addressed, such as addressing non-stationary, unbounded data that arrive in an online fashion. In this paper, we propose a Fast Evolutionary Algorithm for Clustering data streams (FEAC-Stream) that allows estimating k automatically from data in an online fashion. FEAC-Stream uses the Page-Hinkley Test to detect eventual degradation in the quality of the induced clusters, thereby triggering an evolutionary algorithm that re-estimates k accordingly. FEAC-Stream relies on the assumption that clusters of (partially unknown) data can provide useful information about the dynamics of the data stream. We illustrate the potential of FEAC-Stream in a set of experiments using both synthetic and real-world data streams, comparing it to four related algorithms, namely: CluStream-OMRk, CluStream-BkM, StreamKM++-OMRk and StreamKM++-BkM. The obtained results show that FEAC-Stream provides good data partitions and that it can detect, and accordingly react to, data changes.