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.

Evaluation of IMRT and VMAT techniques with and without flattening filter using pareto optimal fronts

Mestrado em Radiações Aplicadas às Tecnologias da Saúde.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Derivative-free nonlinear optimization filter simplex

The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence is not necessary: direct search methods or derivative-free methods are examples of such techniques. In this work we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of simplex and filter methods. This method neither computes nor approximates derivatives, penalty constants or Lagrange multipliers.

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.

Optical Filter Design Using Background Wavelength Processing Techniques

Amorphous SiC tandem heterostructures are used to filter a specific band, in the visible range. Experimental and simulated results are compared to validate the use of SiC multilayered structures in applications where gain compensation is needed or to attenuate unwanted wavelengths. Spectral response data acquired under different frequencies, optical wavelength control and side irradiations are analyzed. Transfer function characteristics are discussed. Color pulsed communication channels are transmitted together and the output signal analyzed under different background conditions. Results show that under controlled wavelength backgrounds, the device sensitivity is enhanced in a precise wavelength range and quenched in the others, tuning or suppressing a specific band. Depending on the background wavelength and irradiation side, the device acts either as a long-, a short-, or a band-rejection pass filter. An optoelectronic model supports the experimental results and gives insight on the physics of the device.

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.

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.

Principles of communication and negotiation

In this chapter we outline the fundamentals of communication and negotiation in a group of people. Being aware of these generic principals greatly contributes to improve the effectiveness and the outcome of the meetings that MUTW students will be engaged in.

Sistema de localização de um veículo autónomo terrestre

Mestrado em Engenharia Electrotécnica e de Computadores.

Working in and on groups: an illustration of the principles of exploratory practice in an esp classroom

Neste artigo, descrevo e analiso uma actividade de trabalho em grupo desenvolvida para uma aula da disciplina de Língua Inglesa VI das turmas do 3º ano do Curso de Línguas e Secretariado do Instituto Superior de Contabilidade e Administração do Porto (ISCAP). No enquadramento teórico, abordam-se questões relacionadas com o trabalho em grupo numa aula de língua estrangeira, nomeadamente a dimensão social da sala de aula em geral e da interacção aluno-aluno em particular. Apresentam-se então os princípios da Exploratory Practice, com ênfase na possibilidade preconizada por esta abordagem de se poder transformar uma actividade de reflexão e discussão sobre o processo de ensino/aprendizagem numa unidade pedagógica. Segue-se a apresentação da proposta didáctica, respectivo plano de aula e alguns exemplos dos textos produzidos pelos alunos. O artigo termina com a apresentação de alguns comentários críticos, realçando-se a contribuição da Exploratory Practice para o desenvolvimento de uma maior consciencialização por parte dos alunos do seu processo de aprendizagem.

Studying the development of an online course on Curriculum : implications for the students' workload in light of the Bologna principles

ECER 2014 "The Past, the Present and Future of Educational Research in Europe" will take place at the University of Porto from 1 - 5 September 2014.

A Educação Positiva aplicada à Técnica de Dança Clássica do 3ºAno B da Escola de Dança do Conservatório Nacional

Relatório Final de Estágio apresentado à Escola Superior de Dança, com vista à obtenção do grau de Mestre em Ensino de Dança.

Determination of ametryn in soils via microwave-assisted solvent extraction coupled to anodic stripping voltammetry with a gold ultramicroelectrode

An extraction-anodic adsorptive stripping voltammetric procedure using microwave-assisted solvent extraction and a gold ultramicroelectrode was developed for determining the pesticide ametryn in soil samples. The method is based on the use of acetonitrile as extraction solvent and on controlled adsorptive accumulation of the herbicide at the potential of 0.50 V (vs. Ag/AgCl) in the presence of Britton-Robinson buffer (pH 3.3). Soil sample extracts were analysed directly after drying and redissolution with the supporting electrolyte but without other pre-treatment. The limit of detection obtained for a 10 s collection time was 0.021 µg g-1. Recovery experiments for the global procedure, at the 0.500 µg g-1 level, gave satisfactory mean and standard deviation results which were comparable to those obtained by HPLC with UV detection.