Distributed energy resources management with cyber-physical SCADA in the context of future smart grids

In the energy management of a small power system, the scheduling of the generation units is a crucial problem for which adequate methodologies can maximize the performance of the energy supply. This paper proposes an innovative methodology for distributed energy resources management. The optimal operation of distributed generation, demand response and storage resources is formulated as a mixed-integer linear programming model (MILP) and solved by a deterministic optimization technique CPLEX-based implemented in General Algebraic Modeling Systems (GAMS). The paper deals with a vision for the grids of the future, focusing on conceptual and operational aspects of electrical grids characterized by an intensive penetration of DG, in the scope of competitive environments and using artificial intelligence methodologies to attain the envisaged goals. These concepts are implemented in a computational framework which includes both grid and market simulation.

Demsi - a demand response simulator in the context of intensive use of distributed generation

Demand response can play a very relevant role in future power systems in which distributed generation can help to assure service continuity in some fault situations. This paper deals with the demand response concept and discusses its use in the context of competitive electricity markets and intensive use of distributed generation. The paper presents DemSi, a demand response simulator that allows studying demand response actions and schemes using a realistic network simulation based on PSCAD. Demand response opportunities are used in an optimized way considering flexible contracts between consumers and suppliers. A case study evidences the advantages of using flexible contracts and optimizing the available generation when there is a lack of supply.

Comparison between deterministic and meta-heuristic methods applied to ancillary services dispatch

This paper proposes two meta-heuristics (Genetic Algorithm and Evolutionary Particle Swarm Optimization) for solving a 15 bid-based case of Ancillary Services Dispatch in an Electricity Market. A Linear Programming approach is also included for comparison purposes. A test case based on the dispatch of Regulation Down, Regulation Up, Spinning Reserve and Non-Spinning Reserve services is used to demonstrate that the use of meta-heuristics is suitable for solving this kind of optimization problem. Faster execution times and lower computational resources requirements are the most relevant advantages of the used meta-heuristics when compared with the Linear Programming approach.

A probabilistic methodology for distributed generation location in isolated electrical service area

Distributed generation unlike centralized electrical generation aims to generate electrical energy on small scale as near as possible to load centers, interchanging electric power with the network. This work presents a probabilistic methodology conceived to assist the electric system planning engineers in the selection of the distributed generation location, taking into account the hourly load changes or the daily load cycle. The hourly load centers, for each of the different hourly load scenarios, are calculated deterministically. These location points, properly weighted according to their load magnitude, are used to calculate the best fit probability distribution. This distribution is used to determine the maximum likelihood perimeter of the area where each source distributed generation point should preferably be located by the planning engineers. This takes into account, for example, the availability and the cost of the land lots, which are factors of special relevance in urban areas, as well as several obstacles important for the final selection of the candidates of the distributed generation points. The proposed methodology has been applied to a real case, assuming three different bivariate probability distributions: the Gaussian distribution, a bivariate version of Freund’s exponential distribution and the Weibull probability distribution. The methodology algorithm has been programmed in MATLAB. Results are presented and discussed for the application of the methodology to a realistic case and demonstrate the ability of the proposed methodology for efficiently handling the determination of the best location of the distributed generation and their corresponding distribution networks.

Multi-apprentice learning for meta-heuristics parameter tuning in a multi agent scheduling system

The scheduling problem is considered in complexity theory as a NP-hard combinatorial optimization problem. Meta-heuristics proved to be very useful in the resolution of this class of problems. However, these techniques require parameter tuning which is a very hard task to perform. A Case-based Reasoning module is proposed in order to solve the parameter tuning problem in a Multi-Agent Scheduling System. A computational study is performed in order to evaluate the proposed CBR module performance.

Case-based reasoning for meta-heuristics self-parameterization in a multi-agent scheduling system

A novel agent-based approach to Meta-Heuristics self-configuration is proposed in this work. Meta-heuristics are examples of algorithms where parameters need to be set up as efficient as possible in order to unsure its performance. This paper presents a learning module for self-parameterization of Meta-heuristics (MHs) in a Multi-Agent System (MAS) for resolution of scheduling problems. The learning is based on Case-based Reasoning (CBR) and two different integration approaches are proposed. A computational study is made for comparing the two CBR integration perspectives. In the end, some conclusions are reached and future work outlined.

Auto-parametrização de meta-heurísticas para escalonamento dinâmico

Este artigo aborda o problema da parametrização de Técnicas de Optimização Inspiradas na Biologia (BIT - Biological Inspired Optimization Techniques), também conhecidas como Meta-heurísticas, considerando a importância que estas técnicas têm na resolução de situações de mundo real, sujeitas a perturbações externas. É proposto um módulo de aprendizagem com o objectivo de permitir que um Sistema Multi-Agente (SMA) para Escalonamento seleccione automaticamente uma Metaheurística e escolha a parametrização a usar no processo de optimização. Para o módulo de aprendizagem foi usado o Raciocínio baseado em Casos (RBC), permitindo ao sistema aprender a partir da experiência acumulada na resolução de problemas similares. Através da análise dos resultados obtidos é possível concluir acerca das vantagens da sua utilização.

Meta-heuristics tunning using CBR for dynamic scheduling

This paper addresses the problem of Biological Inspired Optimization Techniques (BIT) parameterization, considering the importance of this issue in the design of BIT especially when considering real world situations, subject to external perturbations. A learning module with the objective to permit a Multi-Agent Scheduling System to automatically select a Meta-heuristic and its parameterization to use in the optimization process is proposed. For the learning process, Casebased Reasoning was used, allowing the system to learn from experience, in the resolution of similar problems. Analyzing the obtained results we conclude about the advantages of its use.

Self-optimizing through CBR learning

In this paper, we foresee the use of Multi-Agent Systems for supporting dynamic and distributed scheduling in Manufacturing Systems. We also envisage the use of Autonomic properties in order to reduce the complexity of managing systems and human interference. By combining Multi-Agent Systems, Autonomic Computing, and Nature Inspired Techniques we propose an approach for the resolution of dynamic scheduling problem, with Case-based Reasoning Learning capabilities. The objective is to permit a system to be able to automatically adopt/select a Meta-heuristic and respective parameterization considering scheduling characteristics. From the comparison of the obtained results with previous results, we conclude about the benefits of its use.

Distributed Model Predictive Control for Housing with Hourly Auction of Available Energy

This paper presents a distributed model predictive control (DMPC) for indoor thermal comfort that simultaneously optimizes the consumption of a limited shared energy resource. The control objective of each subsystem is to minimize the heating/cooling energy cost while maintaining the indoor temperature and used power inside bounds. In a distributed coordinated environment, the control uses multiple dynamically decoupled agents (one for each subsystem/house) aiming to achieve satisfaction of coupling constraints. According to the hourly power demand profile, each house assigns a priority level that indicates how much is willing to bid in auction for consume the limited clean resource. This procedure allows the bidding value vary hourly and consequently, the agents order to access to the clean energy also varies. Despite of power constraints, all houses have also thermal comfort constraints that must be fulfilled. The system is simulated with several houses in a distributed environment.

A denoising approach for iterative side information creation in distributed video coding

In distributed video coding, motion estimation is typically performed at the decoder to generate the side information, increasing the decoder complexity while providing low complexity encoding in comparison with predictive video coding. Motion estimation can be performed once to create the side information or several times to refine the side information quality along the decoding process. In this paper, motion estimation is performed at the decoder side to generate multiple side information hypotheses which are adaptively and dynamically combined, whenever additional decoded information is available. The proposed iterative side information creation algorithm is inspired in video denoising filters and requires some statistics of the virtual channel between each side information hypothesis and the original data. With the proposed denoising algorithm for side information creation, a RD performance gain up to 1.2 dB is obtained for the same bitrate.

Design and performance of a novel low-density parity-check code for distributed video coding

Low-density parity-check (LDPC) codes are nowadays one of the hottest topics in coding theory, notably due to their advantages in terms of bit error rate performance and low complexity. In order to exploit the potential of the Wyner-Ziv coding paradigm, practical distributed video coding (DVC) schemes should use powerful error correcting codes with near-capacity performance. In this paper, new ways to design LDPC codes for the DVC paradigm are proposed and studied. The new LDPC solutions rely on merging parity-check nodes, which corresponds to reduce the number of rows in the parity-check matrix. This allows to change gracefully the compression ratio of the source (DCT coefficient bitplane) according to the correlation between the original and the side information. The proposed LDPC codes reach a good performance for a wide range of source correlations and achieve a better RD performance when compared to the popular turbo codes.

Treatment outcomes in pulmonary tuberculosis and associated factors worldwide: a systematic review and meta-analysis

Introduction - The increasing of TB burden is usually related to inadequate case detection, diagnosis and cure. Global targets for TB control, adopted by the World Health Organization (WHO), are to detect 70% of the estimated incidence of sputum smear-positive TB and to cure 85% of newly detected cases of sputum smear-positive TB. Factors associated with unsuccessful treatment outcomes are closely related to TB risk factors. Objectives - To describe treatment success rates in pulmonary TB cases and to identify factors associated with unsuccessful treatment outcomes, according to ad-hoc studies.

Distributed process execution in collaborative networks

Processes are a central entity in enterprise collaboration. Collaborative processes need to be executed and coordinated in a distributed Computational platform where computers are connected through heterogeneous networks and systems. Life cycle management of such collaborative processes requires a framework able to handle their diversity based on different computational and communication requirements. This paper proposes a rational for such framework, points out key requirements and proposes it strategy for a supporting technological infrastructure. Beyond the portability of collaborative process definitions among different technological bindings, a framework to handle different life cycle phases of those definitions is presented and discussed. (c) 2007 Elsevier Ltd. All rights reserved.

The evidence of conventional physiotherapeutic interventions after exercise-induced muscle damage: systematic review and meta-analysis

Abstract Introduction: Exhaustive and/or unaccustomed exercise, mainly those involving eccentric muscle actions, induces temporary muscle damage, evidenced by Delayed Onset Muscle Soreness. Different strategies to recover the signs and symptoms of this myogenic condition have been studied by researchers, as a result a significant number of articles on this issue have been published. Purpose: A systematic review was conducted to assess the evidence of the physiotherapeutic interventions of exercise-induced muscle damage. Methods: The electronic data bases were searched, including MEDLINE (1996-2011), CINHAL (1982- 2011), EMBASE (1988-2011), PEDro (1950-2011), and SPORTDiscus (1985-2011). Systematic review was limited to randomized control trials (RCTs) studies, written in English or Portuguese, which included physiotherapeutic interventions, namely massage, cryotherapy, stretching and low-intensity exercise, on adult human subjects (18-60 years old) of either gender. Studies were excluded when the intervention could not be assessed independently. The methodological quality of RCTs was independently assessed with the PEDro Scale by three reviewers. Results: Thirty-three studies were included in the systematic review; eight analyzed the effects of the massage, ten analyzed the effects of the cryotherapy, eight the effect of stretching and seventeen focused low-intensity exercise intervention. The results suggest that massage is the most effective intervention and that there is inconclusive evidence to support the use of cryotherapy; whereas the other conventional, namely stretching and low-intensity exercise, there is no evidence to prove their efficacy. Conclusion: The results allow the conclusion that massage is the physiotherapeutic intervention that demonstrated to be the most effective in the relief of symptoms and signs of exercise-induced muscle damage, as a result, massage should still be used in the muscular recovery after sports activities.