Abstract
A cost-effective, accurate, and robust leak detection method is essential in gas network management in order to reduce inspection time and to increase reliability in the system. This work presents a model-based leakage detection method; the gas dynamics are described by a linearized system of partial differential equations that is further reduced to a one-dimensional spatial model. By using an electrical analogy, a pipeline can be represented by a two-port network, where mass flow behaves like current and pressure like voltage. Four transfer function quadripole models are then established to describe the gas pipeline dynamics, depending on the variables of interest at the pipeline boundaries. A leak detection method is devised by employing mass flow data at boundaries and pressure data at some point of the pipeline, as well as by assessing the effects of the leakage on the pressure and mass flow along the pipeline. A case study has been built from operational data supplied by REN Gasodutos (the Portuguese gas company) to show the advantages of the proposed models. © Springer International Publishing AG 2017.

Abstract

Abstract
Meta-Heuristics (MH) are the most used optimization techniques to approach Complex Combinatorial Problems (COPs). Their ability to move beyond the local optimums make them an especially attractive choice to solve complex computational problems, such as most scheduling problems. However, the knowledge of what Meta-Heuristics perform better in certain problems is based on experiments. Classic MH, as the Simulated Annealing (SA) has been deeply studied, but newer MH, as the Discrete Artificial Bee Colony (DABC) still need to be examined in more detail. In this paper DABC has been compared with SA in 30 academic benchmark instances of the weighted tardiness problem (1 parallel to Sigma w(j)T(j)). Both MH parameters were fine-tuned with Taguchi Experiments. In the computational study DABC performed better and the subsequent statistical study demonstrated that DABC is more prone to find near-optimum solutions. On the other hand SA appeared to be more efficient.

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.