Knowledge extraction from medium voltage load diagrams to support the definition of electrical tariffs

With the electricity market liberalization, distribution and retail companies are looking for better market strategies based on adequate information upon the consumption patterns of its electricity customers. In this environment all consumers are free to choose their electricity supplier. A fair insight on the customer´s behaviour will permit the definition of specific contract aspects based on the different consumption patterns. In this paper Data Mining (DM) techniques are applied to electricity consumption data from a utility client’s database. To form the different customer´s classes, and find a set of representative consumption patterns, we have used the Two-Step algorithm which is a hierarchical clustering algorithm. Each consumer class will be represented by its load profile resulting from the clustering operation. Next, to characterize each consumer class a classification model will be constructed with the C5.0 classification algorithm.

Optimization model for medium term natural gas commitment

In this paper we study the optimal natural gas commitment for a known demand scenario. This study implies the best location of GSUs to supply all demands and the optimal allocation from sources to gas loads, through an appropriate transportation mode, in order to minimize total system costs. Our emphasis is on the formulation and use of a suitable optimization model, reflecting real-world operations and the constraints of natural gas systems. The mathematical model is based on a Lagrangean heuristic, using the Lagrangean relaxation, an efficient approach to solve the problem. Computational results are presented for Iberian and American natural gas systems, geographically organized in 65 and 88 load nodes, respectively. The location model results, supported by the computational application GasView, show the optimal location and allocation solution, system total costs and suggest a suitable gas transportation mode, presented in both numerical and graphic supports.

Efficient implementation of a dominance protocol for wireless medium access

Mestrado em Engenharia Electrotécnica e de Computadores

Produção de hidrogénio através da gasificação da biomassa

A procura de uma forma limpa de combustível, aliada à crescente instabilidade de preços dos combustíveis fósseis verificada nos mercados faz com que o hidrogénio se torne num combustível a considerar devido a não resultar qualquer produto poluente da sua queima e de se poder utilizar, por exemplo, desperdícios florestais cujo valor de mercado não está inflacionado por não pertencer à cadeia alimentar humana. Este trabalho tem como objetivo simular o processo de gasificação de biomassa para produção de hidrogénio utilizando um gasificador de leito fluidizado circulante. O oxigénio e vapor de água funcionam como agentes gasificantes. Para o efeito usou-se o simulador de processos químicos ASPEN Plus. A simulação desenvolvida compreende três etapas que ocorrem no interior do gasificador: pirólise, que foi simulada por um bloco RYIELD, combustão de parte dos compostos voláteis, simulada por um bloco RSTOIC e, por fim, as reações de oxidação e gasificação do carbonizado “char”, simuladas por um bloco RPLUG. Os valores de rendimento dos compostos após a pirólise, obtidos por uma correlação proposta por Gomez-Barea, et al. (2010), foram os seguintes: 20,33% “char”, 22,59% alcatrão, 36,90% monóxido de carbono, 16,05%m/m dióxido de carbono, 3,33% metano e 0,79% hidrogénio (% em massa). Como não foi possível encontrar valores da variação da composição do gás à saída do gasificador com a variação da temperatura, para o caso de vapor de água e oxigénio, optou-se por utilizar apenas vapor na simulação de forma a comparar os seus valores com os da literatura. Às temperaturas de 700, 770 e 820ºC, para um “steam-to-biomass ratio”, (SBR) igual a 0,5, os valores da percentagem molar de monóxido de carbono foram, respetivamente, 56,60%, 55,84% e 53,85%, os valores de hidrogénio foram, respetivamente, 17,83%, 18,25% e 19,31%, os valores de dióxido de carbono foram, respetivamente, 16,40%, 16,85% e 17,93% e os valores de metano foram, respetivamente, 9,00%, 8,95% e 8,83%. Os valores da composição à saída do gasificador, à temperatura de 820ºC, para um SBR de 0,5 foram: 53,85% de monóxido de carbono, 19,31% de hidrogénio, 17,93% de dióxido de carbono e 8,83% de metano (% em moles). Para um SBR de 0,7 a composição à saída foi de 54,45% de monóxido de carbono, 19,01% de hidrogénio, 17,59% de dióxido de carbono e 8,87% de metano. Por fim, quando SBR foi igual a 1 a composição do gás à saída foi de 55,08% de monóxido de carbono, 18,69% de hidrogénio, 17,24% de dióxido de carbono e 8,90% de metano. Os valores da composição obtidos através da simulação, para uma mistura de ar e vapor de água, ER igual a 0,26 e SBR igual a 1, foram: 34,00% de monóxido de carbono, 14,65% de hidrogénio, 45,81% de dióxido de carbono e 5,41% de metano. A simulação permitiu-nos ainda dimensionar o gasificador e determinar alguns parâmetros hidrodinâmicos do gasificador, considerando que a reação “water-gas shift” era a limitante, e que se pretendia obter uma conversão de 95%. A velocidade de operação do gasificador foi de 4,7m/s e a sua altura igual a 0,73m, para um diâmetro de 0,20m.

Integração energética unidades 0300 e 0400 da Fábrica de Aromáticos Refinaria de Matosinhos

Mestrado em Engenharia Química - Ramo optimização energética na indústria química

Short- and medium-term effects of manual therapy on cervical active range of motion and pressure pain sensitivity in latent myofascial pain of the upper trapezius muscle: a randomized controlled trial

Objective: The purpose of this study was to investigate effects of different manual techniques on cervical ranges of 17 motion and pressure pain sensitivity in subjects with latent trigger point of the upper trapezius muscle. 18 Methods: One hundred seventeen volunteers, with a unilateral latent trigger point on upper trapezius due to computer 19 work, were randomly divided into 5 groups: ischemic compression (IC) group (n = 24); passive stretching group (n = 20 23); muscle energy technique group (n = 23); and 2 control groups, wait-and-see group (n = 25) and placebo group 21 (n = 22). Cervical spine range of movement was measured using a cervical range of motion instrument as well as 22 pressure pain sensitivity by means of an algometer and a visual analog scale. Outcomes were assessed pretreatment, 23 immediately, and 24 hours after the intervention and 1 week later by a blind researcher. A 4 × 5 mixed repeated- 24 measures analysis of variance was used to examine the effects of the intervention and Cohen d coefficient was used. 25 Results: A group-by-time interaction was detected in all variables (P b .01), except contralateral rotation. The 26 immediate effect sizes of the contralateral flexion, ipsilateral rotation, and pressure pain threshold were large for 3 27 experimental groups. Nevertheless, after 24 hours and 1 week, only IC group maintained the effect size. 28 Conclusions: Manual techniques on upper trapezius with latent trigger point seemed to improve the cervical range of 29 motion and the pressure pain sensitivity. These effects persist after 1 week in the IC group. (J Manipulative Physiol 301 Ther 2013;xx:1-10)

Using a prioritized medium access control protocol for incrementally obtaining an interpolation of sensor readings

This paper addresses sensor network applications which need to obtain an accurate image of physical phenomena and do so with a high sampling rate in both time and space. We present a fast and scalable approach for obtaining an approximate representation of all sensor readings at high sampling rate for quickly reacting to critical events in a physical environment. This approach is an improvement on previous work in that after the new approach has undergone a startup phase then the new approach can use a very small sampling period.

Dynamics of a backlash chain

This paper studies the dynamical properties of a system with distributed backlash and impact phenomena. This means that it is considered a chain of masses that interact with each other solely by means of backlash and impact phenomena. It is observed the emergence of non-linear phenomena resembling those encountered in the Fermi-Pasta-Ulam problem.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.

WiDom: a dominance protocol for wireless medium access

In this paper, we address the problem of sharing a wireless channel among a set of sporadic message streams where a message stream issues transmission requests with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements static-priority scheduling, supports a large number of priority levels and is fully distributed. It is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But, unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. The evaluation of the protocol with real embedded computing platforms is presented to show that the proposed protocol is in fact collision-free and prioritized. We measure the response times of our implementation and show that the response-time analysis developed for the protocol offers an upper bound on the response times.

Delay-bounded medium access for unidirectional wireless links

Consider a wireless network where links may be unidirectional, that is, a computer node A can broadcast a message and computer node B will receive this message but if B broadcasts then A will not receive it. Assume that messages have deadlines. We propose a medium access control (MAC) protocol which replicates a message in time with carefully selected pauses between replicas, and in this way it guarantees that for every message at least one replica of that message is transmitted without collision. The protocol ensures this with no knowledge of the network topology and it requires neither synchronized clocks nor carrier sensing capabilities. We believe this result is significant because it is the only MAC protocol that offers an upper bound on the message queuing delay for unidirectional links without relying on synchronized clocks.

Preliminary discussion on globally prioritized medium access for multi-channel wireless systems

We discuss the development of a simple globally prioritized multi-channel medium access control (MAC) protocol for wireless networks. This protocol provides “hard” pre-run-time real-time guarantees to sporadic message streams, exploits a very large fraction of the capacity of all channels for “hard” real-time traffic and also makes it possible to fully utilize the channels with non real-time traffic when hard real-time messages do not request to be transmitted. The potential of such protocols for real-time applications is discussed and a schedulability analysis is also presented.

Implementation of a dominance protocol for wireless medium access

Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (MAC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We implement and evaluate it to find that the implementation indeed is collision-free and prioritized. This allows us to develop schedulability analysis for the implementation. We measure the response times of messages in our implementation and find that our new response-time analysis indeed offers an upper bound on the response times. This enables a new class of wireless real-time systems with timeliness guarantees for sporadic messages and it opens-up a new research area: schedulability analysis for wireless networks.

Collision-free prioritized medium access in the presence of hidden nodes without relying on out-of-band signaling

Consider the problem of sharing a wireless channel between a set of computer nodes. Hidden nodes exist and there is no base station. Each computer node hosts a set of sporadic message streams where a message stream releases messages with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements staticpriority scheduling. The MAC protocol allows multiple masters and is fully distributed. It neither relies on synchronized clocks nor out-of-band signaling; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. Our protocol has the key feature of not only being prioritized and collision-free but also dealing successfully with hidden nodes. This key feature enables schedulability analysis of sporadic message streams in multihop networks.

Collision-free prioritized medium access control in wireless networks with hidden nodes

We propose a collision-free medium access control (MAC) protocol, which implements static-priority scheduling and works in the presence of hidden nodes. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to sense the channel while transmitting to the channel. Our protocol is collision-free even in the presence of hidden nodes and it achieves this without synchronized clocks or out-of-band busy tones. In addition, the protocol is designed to ensure that many non-interfering nodes can transmit in parallel and it functions for both broadcast and unicast transmissions.