Multi-criteria short-term maintenance outage scheduling in smart distribution systems

Effective legislation and standards for the coordination procedures between consumers, producers and the system operator supports the advances in the technologies that lead to smart distribution systems. In short-term (ST) maintenance scheduling procedure, the energy producers in a distribution system access to the long-term (LT) outage plan that is released by the distribution system operator (DSO). The impact of this additional information on the decision-making procedure of producers in ST maintenance scheduling is studied in this paper. The final ST maintenance plan requires the approval of the DSO that has the responsibility to secure the network reliability and quality, and other players have to follow the finalized schedule. Maintenance scheduling in the producers’ layer and the coordination procedure between them and the DSO is modelled in this paper. The proposed method is applied to a 33-bus distribution system.

Study of distribution network demand response events in the Portuguese system

In competitive electricity markets with deep concerns for the efficiency level, demand response programs gain considerable significance. As demand response levels have decreased after the introduction of competition in the power industry, new approaches are required to take full advantage of demand response opportunities. Grid operators and utilities are taking new initiatives, recognizing the value of demand response for grid reliability and for the enhancement of organized spot markets’ efficiency. This paper proposes a methodology for the selection of the consumers that participate in an event, which is the responsibility of the Portuguese transmission network operator. The proposed method is intended to be applied in the interruptibility service implemented in Portugal, in convergence with Spain, in the context of the Iberian electricity market. This method is based on the calculation of locational marginal prices (LMP) which are used to support the decision concerning the consumers to be schedule for participation. The proposed method has been computationally implemented and its application is illustrated in this paper using a 937 bus distribution network with more than 20,000 consumers.

Particle swarm optimization applied to integrated demand response resources scheduling

The concept of demand response has a growing importance in the context of the future power systems. Demand response can be seen as a resource like distributed generation, storage, electric vehicles, etc. All these resources require the existence of an infrastructure able to give players the means to operate and use them in an efficient way. This infrastructure implements in practice the smart grid concept, and should accommodate a large number of diverse types of players in the context of a competitive business environment. In this paper, demand response is optimally scheduled jointly with other resources such as distributed generation units and the energy provided by the electricity market, minimizing the operation costs from the point of view of a virtual power player, who manages these resources and supplies the aggregated consumers. The optimal schedule is obtained using two approaches based on particle swarm optimization (with and without mutation) which are compared with a deterministic approach that is used as a reference methodology. A case study with two scenarios implemented in DemSi, a demand Response simulator developed by the authors, evidences the advantages of the use of the proposed particle swarm approaches.

ANN based support for distributed energy resources scheduling in smart grids

The future scenarios for operation of smart grids are likely to include a large diversity of players, of different types and sizes. With control and decision making being decentralized over the network, intelligence should also be decentralized so that every player is able to play in the market environment. In the new context, aggregator players, enabling medium, small, and even micro size players to act in a competitive environment, will be very relevant. Virtual Power Players (VPP) and single players must optimize their energy resource management in order to accomplish their goals. This is relatively easy to larger players, with financial means to have access to adequate decision support tools, to support decision making concerning their optimal resource schedule. However, the smaller players have difficulties in accessing this kind of tools. So, it is required that these smaller players can be offered alternative methods to support their decisions. This paper presents a methodology, based on Artificial Neural Networks (ANN), intended to support smaller players’ resource scheduling. The used methodology uses a training set that is built using the energy resource scheduling solutions obtained with a reference optimization methodology, a mixed-integer non-linear programming (MINLP) in this case. The trained network is able to achieve good schedule results requiring modest computational means.

Scheduling distributed energy resources in an isolated grid - an artificial neural network approach

Power Systems (PS), have been affected by substantial penetration of Distributed Generation (DG) and the operation in competitive environments. The future PS will have to deal with large-scale integration of DG and other distributed energy resources (DER), such as storage means, and provide to market agents the means to ensure a flexible and secure operation. Virtual power players (VPP) can aggregate a diversity of players, namely generators and consumers, and a diversity of energy resources, including electricity generation based on several technologies, storage and demand response. This paper proposes an artificial neural network (ANN) based methodology to support VPP resource schedule. The trained network is able to achieve good schedule results requiring modest computational means. A real data test case is presented.

Negotiation mechanism for self-organized scheduling system

This paper presents a negotiation mechanism for Dynamic Scheduling based on Swarm Intelligence (SI). Under the new negotiation mechanism, agents must compete to obtain a global schedule. SI is the general term for several computational techniques which use ideas and get inspiration from the social behaviors of insects and other animals. This work is concerned with negotiation, the process through which multiple selfinterested agents can reach agreement over the exchange of operations on competitive resources.

Solução doméstica para televisão digital

Mestrado em Engenharia Electrotécnica e de Computadores

Avaliação energética de uma escola

Mestrado em Engenharia Química

Monitorização de desreguladores endócrinos em águas

Da crescente necessidade de alimentos e da necessidade de travar a destruição de culturas por animais e insectos foram sintetizados os pesticidas. Por entre uma vasta gama de pesticidas alguns são desreguladores endócrinos o que se traduz num perigo para a saúde humana pois pode despoletar alterações nos seres vivos mesmo em concentrações muito baixas. Devido a diversos factores nomeadamente a lixiviação, ventos e outros agentes ambientais assim como a presença de terrenos agrícolas junto a diversos rios, estes encontram-se contaminados com pesticidas desreguladores endócrinos. O objectivo deste trabalho foi avaliar quais os pesticidas desreguladores endócrinos presentes nas águas de rios da região Norte. Neste trabalho utilizou-se a técnica de microextracção em fase sólida recorrendo a uma fibra de PDMS (100 μm). Para tal as condições de optimização foram testadas nomeadamente a quantidade de NaCl, quantidade de metanol, temperatura do injector e tempo de exposição. Os parâmetros obtidos óptimos foram 0 % de NaCl, tempo de exposição de 45 min, temperatura do injector de 260 ºC e 2,5 % de metanol. Conseguiu-se a separação de todos os pesticidas desreguladores endócrinos com a seguinte programação temperaturas: inicio a 60ºC por um minuto seguido de um aumento de 20 °C/min até aos 200 °C onde permanece por um minuto e de seguida um aumento de 5 °C/min até aos 245 °C onde permanece por 40 min. Fizeram-se curvas de calibração entre 0,01 μg/L e 10 μg/L. Constatou-se no entanto uma falta de reprodutibilidade entre as injecções utilizando esta técnica. Os rios analisados foram o Rio Douro, Rio Tâmega, Ria de Aveiro, Rio Lima, Rio Minho, Rio Sousa, Rio Águeda, Rio Cávado e Rio Leça. No Rio Tâmega foram encontrados os seguintes pesticidas: diazinão, α-HCH, β-HCH, δ-HCH, lindano, HCB, simazina/ atrazina, vinclozolina, alacloro, 2,4-D, malatião, aldrina, bifentrina, metoxicloro e fenvalerato. No rio Douro estão presentes HCB, simazina/ atrazina, vinclozolina, 2,4-D, malatião, aldrina, fenvalerato e deltametrina. No rio Lima encontra-se diazinão, α-HCH, δ-HCH, 2,4-D, HCB, vinclozolina, lindano, simazina/atrazina, alacloro, malatião, aldrina, fenvalerato e deltametrina. No rio Sousa os pesticidas encontrados foram: diazinão, HCB, aldrina, α-HCH, β-HCH, δ-HCH, lindano, simazina/ atrazina, 2,4-D, cipermetrina, alacloro, fenvalerato e malatião. No rio Cávado estão presentes o diazinão, α-HCH, β-HCH, δ-HCH, lindano, HCB, 2,4-D, malatião, metoxicloro, cipermetrina e o fenvalerato. Na ria de Aveiro encontrou-se o diazinão, α-HCH, β-HCH, δ-HCH, lindano, HCB, simazina/atrazina, 2,4-D, Malatião e aldrina. No rio Águeda estão presentes o diazinão, HCB, 2,4-D, aldrina e malatião. E por último no rio Leça esta presente o diazinão, 2,4-D, alacloro, malatião, aldrina, cipermetrina e fenvalerato. A importância deste trabalho reside na demonstração da presença destes pesticidas, desreguladores endócrinos nas águas superficiais da região Norte.

Supporting intra-task parallelism in real-time multiprocessor systems

Os sistemas de tempo real modernos geram, cada vez mais, cargas computacionais pesadas e dinâmicas, começando-se a tornar pouco expectável que sejam implementados em sistemas uniprocessador. Na verdade, a mudança de sistemas com um único processador para sistemas multi- processador pode ser vista, tanto no domínio geral, como no de sistemas embebidos, como uma forma eficiente, em termos energéticos, de melhorar a performance das aplicações. Simultaneamente, a proliferação das plataformas multi-processador transformaram a programação paralela num tópico de elevado interesse, levando o paralelismo dinâmico a ganhar rapidamente popularidade como um modelo de programação. A ideia, por detrás deste modelo, é encorajar os programadores a exporem todas as oportunidades de paralelismo através da simples indicação de potenciais regiões paralelas dentro das aplicações. Todas estas anotações são encaradas pelo sistema unicamente como sugestões, podendo estas serem ignoradas e substituídas, por construtores sequenciais equivalentes, pela própria linguagem. Assim, o modo como a computação é na realidade subdividida, e mapeada nos vários processadores, é da responsabilidade do compilador e do sistema computacional subjacente. Ao retirar este fardo do programador, a complexidade da programação é consideravelmente reduzida, o que normalmente se traduz num aumento de produtividade. Todavia, se o mecanismo de escalonamento subjacente não for simples e rápido, de modo a manter o overhead geral em níveis reduzidos, os benefícios da geração de um paralelismo com uma granularidade tão fina serão meramente hipotéticos. Nesta perspetiva de escalonamento, os algoritmos que empregam uma política de workstealing são cada vez mais populares, com uma eficiência comprovada em termos de tempo, espaço e necessidades de comunicação. Contudo, estes algoritmos não contemplam restrições temporais, nem outra qualquer forma de atribuição de prioridades às tarefas, o que impossibilita que sejam diretamente aplicados a sistemas de tempo real. Além disso, são tradicionalmente implementados no runtime da linguagem, criando assim um sistema de escalonamento com dois níveis, onde a previsibilidade, essencial a um sistema de tempo real, não pode ser assegurada. Nesta tese, é descrita a forma como a abordagem de work-stealing pode ser resenhada para cumprir os requisitos de tempo real, mantendo, ao mesmo tempo, os seus princípios fundamentais que tão bons resultados têm demonstrado. Muito resumidamente, a única fila de gestão de processos convencional (deque) é substituída por uma fila de deques, ordenada de forma crescente por prioridade das tarefas. De seguida, aplicamos por cima o conhecido algoritmo de escalonamento dinâmico G-EDF, misturamos as regras de ambos, e assim nasce a nossa proposta: o algoritmo de escalonamento RTWS. Tirando partido da modularidade oferecida pelo escalonador do Linux, o RTWS é adicionado como uma nova classe de escalonamento, de forma a avaliar na prática se o algoritmo proposto é viável, ou seja, se garante a eficiência e escalonabilidade desejadas. Modificar o núcleo do Linux é uma tarefa complicada, devido à complexidade das suas funções internas e às fortes interdependências entre os vários subsistemas. Não obstante, um dos objetivos desta tese era ter a certeza que o RTWS é mais do que um conceito interessante. Assim, uma parte significativa deste documento é dedicada à discussão sobre a implementação do RTWS e à exposição de situações problemáticas, muitas delas não consideradas em teoria, como é o caso do desfasamento entre vários mecanismo de sincronização. Os resultados experimentais mostram que o RTWS, em comparação com outro trabalho prático de escalonamento dinâmico de tarefas com restrições temporais, reduz significativamente o overhead de escalonamento através de um controlo de migrações, e mudanças de contexto, eficiente e escalável (pelo menos até 8 CPUs), ao mesmo tempo que alcança um bom balanceamento dinâmico da carga do sistema, até mesmo de uma forma não custosa. Contudo, durante a avaliação realizada foi detetada uma falha na implementação do RTWS, pela forma como facilmente desiste de roubar trabalho, o que origina períodos de inatividade, no CPU em questão, quando a utilização geral do sistema é baixa. Embora o trabalho realizado se tenha focado em manter o custo de escalonamento baixo e em alcançar boa localidade dos dados, a escalonabilidade do sistema nunca foi negligenciada. Na verdade, o algoritmo de escalonamento proposto provou ser bastante robusto, não falhando qualquer meta temporal nas experiências realizadas. Portanto, podemos afirmar que alguma inversão de prioridades, causada pela sub-política de roubo BAS, não compromete os objetivos de escalonabilidade, e até ajuda a reduzir a contenção nas estruturas de dados. Mesmo assim, o RTWS também suporta uma sub-política de roubo determinística: PAS. A avaliação experimental, porém, não ajudou a ter uma noção clara do impacto de uma e de outra. No entanto, de uma maneira geral, podemos concluir que o RTWS é uma solução promissora para um escalonamento eficiente de tarefas paralelas com restrições temporais.

Response of high-risk of recurrence/progression bladder tumours expressing sialyl-Tn and sialyl-6-T to BCG immunotherapy

High risk of recurrence/progression bladder tumours is treated with Bacillus Calmette-Guérin (BCG) immunotherapy after complete resection of the tumour. Approximately 75% of these tumours express the uncommon carbohydrate antigen sialyl-Tn (Tn), a surrogate biomarker of tumour aggressiveness. Such changes in the glycosylation of cell-surface proteins influence tumour microenvironment and immune responses that may modulate treatment outcome and the course of disease. The aim of this work is to determine the efficiency of BCG immunotherapy against tumours expressing sTn and sTn-related antigen sialyl-6-T (s6T). METHODS: In a retrospective design, 94 tumours from patients treated with BCG were screened for sTn and s6T expression. In vitro studies were conducted to determine the interaction of BCG with high-grade bladder cancer cell line overexpressing sTn. RESULTS: From the 94 cases evaluated, 36 had recurrence after BCG treatment (38.3%). Treatment outcome was influenced by age over 65 years (HR=2.668; (1.344-5.254); P=0.005), maintenance schedule (HR=0.480; (0.246-0.936); P=0.031) and multifocality (HR=2.065; (1.033-4.126); P=0.040). sTn or s6T expression was associated with BCG response (P=0.024; P<0.0001) and with increased recurrence-free survival (P=0.001). Multivariate analyses showed that sTn and/or s6T were independent predictive markers of recurrence after BCG immunotherapy (HR=0.296; (0.148-0.594); P=0.001). In vitro studies demonstrated higher adhesion and internalisation of the bacillus to cells expressing sTn, promoting cell death. CONCLUSION: s6T is described for the first time in bladder tumours. Our data strongly suggest that BCG immunotherapy is efficient against sTn- and s6T-positive tumours. Furthermore, sTn and s6T expression are independent predictive markers of BCG treatment response and may be useful in the identification of patients who could benefit more from this immunotherapy.

Engineering real-time applications with WorldFIP: tools and analysis

WorldFIP is standardised as European Norm EN 50170 - General Purpose Field Communication System. Field communication systems (fieldbuses) started to be widely used as the communication support for distributed computer-controlled systems (DCCS), and are being used in all sorts of process control and manufacturing applications within different types of industries. There are several advantages in using fieldbuses as a replacement of for the traditional point-to-point links between sensors/actuators and computer-based control systems. Indeed they concern economical ones (cable savings) but, importantly, fieldbuses allow an increased decentralisation and distribution of the processing power over the field. Typically DCCS have real-time requirements that must be fulfilled. By this, we mean that process data must be transferred between network computing nodes within a maximum admissible time span. WorldFIP has very interesting mechanisms to schedule data transfers. It explicit distinguishes to types of traffic: periodic and aperiodic. In this paper we describe how WorldFIP handles these two types of traffic, and more importantly, we provide a comprehensive analysis for guaranteeing the real-time requirements of both types of traffic. A major contribution is made in the analysis of worst-case response time of aperiodic transfer requests.

Distributed computing for the factory-floor: a real-time approach using WorldFIP networks

Field communication systems (fieldbuses) are widely used as the communication support for distributed computer-controlled systems (DCCS) within all sort of process control and manufacturing applications. There are several advantages in the use of fieldbuses as a replacement for the traditional point-to-point links between sensors/actuators and computer-based control systems, within which the most relevant is the decentralisation and distribution of the processing power over the field. A widely used fieldbus is the WorldFIP, which is normalised as European standard EN 50170. Using WorldFIP to support DCCS, an important issue is “how to guarantee the timing requirements of the real-time traffic?” WorldFIP has very interesting mechanisms to schedule data transfers, since it explicitly distinguishes periodic and aperiodic traffic. In this paper, we describe how WorldFIP handles these two types of traffic, and more importantly, we provide a comprehensive analysis on how to guarantee the timing requirements of the real-time traffic.

Using WorldFIP networks to support periodic and sporadic real-time traffic

In this paper we address the ability of WorldFIP to cope with the real-time requirements of distributed computer-controlled systems (DCCS). Typical DCCS include process variables that must be transferred between network devices both in a periodic and sporadic (aperiodic) basis. The WorldFIP protocol is designed to support both types of traffic. WorldFIP can easily guarantee the timing requirements for the periodic traffic. However, for the aperiodic traffic more complex analysis must be made in order to guarantee its timing requirements. This paper describes work that is being carried out to extend previous relevant work, in order to include the actual schedule for the periodic traffic in the worst-case response time analysis of sporadic traffic in WorldFIP networks

Scheduling real-time communications with P-NET

In this paper we address the P-NET Medium Access Control (MAC) ability to schedule traffic according to its real-time requirements, in order to support real-time distributed applications. We provide a schedulability analysis based on the P-NET standard, and propose mechanisms to overcome priority inversion problems resulting from the use of FIFO outgoing buffers