VPP´s multi-level negotiation in smart grids and competitive electricity markets

The increase of distributed generation (DG) has brought about new challenges in electrical networks electricity markets and in DG units operation and management. Several approaches are being developed to manage the emerging potential of DG, such as Virtual Power Players (VPPs), which aggregate DG plants; and Smart Grids, an approach that views generation and associated loads as a subsystem. This paper presents a multi-level negotiation mechanism for Smart Grids optimal operation and negotiation in the electricity markets, considering the advantages of VPPs’ management. The proposed methodology is implemented and tested in MASCEM – a multiagent electricity market simulator, developed to allow deep studies of the interactions between the players that take part in the electricity market negotiations.

Dynamic power- and failure-aware cloud resources allocation for Sets of independent tasks

Cloud computing is increasingly being adopted in different scenarios, like social networking, business applications, scientific experiments, etc. Relying in virtualization technology, the construction of these computing environments targets improvements in the infrastructure, such as power-efficiency and fulfillment of users’ SLA specifications. The methodology usually applied is packing all the virtual machines on the proper physical servers. However, failure occurrences in these networked computing systems can induce substantial negative impact on system performance, deviating the system from ours initial objectives. In this work, we propose adapted algorithms to dynamically map virtual machines to physical hosts, in order to improve cloud infrastructure power-efficiency, with low impact on users’ required performance. Our decision making algorithms leverage proactive fault-tolerance techniques to deal with systems failures, allied with virtual machine technology to share nodes resources in an accurately and controlled manner. The results indicate that our algorithms perform better targeting power-efficiency and SLA fulfillment, in face of cloud infrastructure failures.

Interfaces inovadores para a aprendizagem musical

Mestrado em Engenharia Informática

A influência da massagem na sensação retardada de desconforto muscular

Introdução: Apesar dos muitos estudos sobre a temática da sensação retardada de desconforto muscular, atualmente, ainda se discute a explicação dos mecanismos subjacentes a esta condição clínica, bem como, a sua prevenção e tratamento. A literatura sugere a massagem como uma das formas de terapia, contudo, os estudos têm mostrado resultados controversos. Objetivo: Verificar se a massagem aplicada 2 horas após um protocolo de exercício excêntrico tem influência na sensação retardada de desconforto muscular, bem como, se o seu efeito varia dependendo do tempo de aplicação. Métodos: 21 participantes (23,62±1,32 anos; 76,95±12,17 kg; 174,71±4,78 cm; 25,25±4,26 Kg/m 2) foram divididos em três grupos. Foi avaliada a dor, força muscular e a perimetria antes, e 2h, 24h, 48h, e 72h após um protocolo de exercício constituído por três séries de dez repetições de contrações excêntricas dos isquiotibiais do membro dominante, com 80% da força máxima, a uma velocidade constante de 60º/s, numa amplitude entre 0º e 80º, utilizando o dinamómetro isocinético Biodex System 4. A massagem foi efetuada 2 horas após o exercício em dois grupos experimentais com durações diferentes, sendo o terceiro grupo de controlo. Para identificar diferenças entre os grupos no momento inicial e na variável diferença entre o momento inicial e os restantes momentos, recorreu-se ao teste de Kruskal-Wallis, seguido de uma análise Post-Hoc através do teste de Dunn com um nível de significância de 0,05. Resultados: Verificou-se que a massagem teve efeito na redução da dor e na perimetria. Relativamente à força não foram encontradas alterações significativas. Conclusão: Os resultados mostraram que a massagem aplicada 2 horas após o exercício excêntrico, independentemente da duração utilizada, teve efeito na redução da dor, mas não na força muscular. Na perimetria apesar de haver alterações, estas não foram consideradas relevantes.

Sistema de recomendação e personalização de televisão

Com a expansão da Televisão Digital e a convergência entre os meios de difusão convencionais e a televisão sobre IP, o número de canais disponíveis tem aumentado de forma gradual colocando o espectador numa situação de difícil escolha quanto ao programa a visionar. Sobrecarregados com uma grande quantidade de programas e informação associada, muitos espectadores desistem sistematicamente de ver um programa e tendem a efectuar zapping entre diversos canais ou a assistir sempre aos mesmos programas ou canais. Diante deste problema de sobrecarga de informação, os sistemas de recomendação apresentam-se como uma solução. Nesta tese pretende estudar-se algumas das soluções existentes dos sistemas de recomendação de televisão e desenvolver uma aplicação que permita a recomendação de um conjunto de programas que representem potencial interesse ao espectador. São abordados os principais conceitos da área dos algoritmos de recomendação e apresentados alguns dos sistemas de recomendação de programas de televisão desenvolvidos até à data. Para realizar as recomendações foram desenvolvidos dois algoritmos baseados respectivamente em técnicas de filtragem colaborativa e de filtragem de conteúdo. Estes algoritmos permitem através do cálculo da similaridade entre itens ou utilizadores realizar a predição da classificação que um utilizador atribuiria a um determinado item (programa de televisão, filme, etc.). Desta forma é possível avaliar o nível de potencial interesse que o utilizador terá em relação ao respectivo item. Os conjuntos de dados que descrevem as características dos programas (título, género, actores, etc.) são armazenados de acordo com a norma TV-Anytime. Esta norma de descrição de conteúdo multimédia apresenta a vantagem de ser especificamente vocacionada para conteúdo audiovisual e está disponível livremente. O conjunto de recomendações obtidas é apresentado ao utilizador através da interacção com uma aplicação Web que permite a integração de todos os componentes do sistema. Para validação do trabalho foi considerado um dataset de teste designado de htrec2011-movielens-2k e cujo conteúdo corresponde a um conjunto de filmes classificados por diversos utilizadores num ambiente real. Este conjunto de filmes possui, para além da classificações atribuídas pelos utilizadores, um conjunto de dados que descrevem o género, directores, realizadores e país de origem. Para validação final do trabalho foram realizados diversos testes dos quais o mais relevante correspondeu à avaliação da distância entre predições e valores reais e cujo objectivo é classificar a capacidade dos algoritmos desenvolvidos preverem com precisão as classificações que os utilizadores atribuiriam aos itens analisados.

Sustainable blended-learning in HEI: developing and implementing multi-level interventions

This chapter aims to demonstrate how PAOL - Unit for Innovation in Education, a project from ISCAP - School of Accounting and Administration of Oporto ....

A B-learning strategy for Therapeutics at the Bachelor Level

Background Information:The incorporation of distance learning activities by institutions of higher education is considered an important contribution to create new opportunities for teaching at both, initial and continuing training. In Medicine and Nursing, several papers illustrate the adaptation of technological components and teaching methods are prolific, however, when we look at the Pharmaceutical Education area, the examples are scarce. In that sense this project demonstrates the implementation and assessment of a B-Learning Strategy for Therapeutics using a “case based learning” approach. Setting: Academic Pharmacy Methods:This is an exploratory study involving 2nd year students of the Pharmacy Degree at the School of Allied Health Sciences of Oporto. The study population consists of 61 students, divided in groups of 3-4 elements. The b-learning model was implemented during a time period of 8 weeks. Results:A B-learning environment and digital learning objects were successfully created and implemented. Collaboration and assessment techniques were carefully developed to ensure the active participation and fair assessment of all students. Moodle records show a consistent activity of students during the assignments. E-portfolios were also developed using Wikispaces, which promoted reflective writing and clinical reasoning. Conclusions:Our exploratory study suggests that the “case based learning” method can be successfully combined with the technological components to create and maintain a feasible online learning environment for the teaching of therapeutics.

Efficacy of low-level laser therapy on scar tissue

Background: Physiotherapy has a very important role in the maintenance of the integumentary system integrity. There is very few evidence in humans. Nevertheless, there are some studies about tissue regeneration using low-level laser therapy (LLLT). Aim: To analyze the effectiveness of LLLT on scar tissue. Methods: Seventeen volunteers were stratified by age of their scars, and then randomly assigned to an experimental group (EG) — n = 9 – and a placebo group (PG) – n = 8. Fifteen sessions were conducted to both the groups thrice a week. However, in the PG, the laser device was switched off. Scars’ thickness, length, width, macroscopic aspect, pain threshold, pain perception, and itching were measured. Results: After 5 weeks, there were no statistically significant differences in any variable between both the groups. However, analyzing independently each group, EG showed a significant improvement in macroscopic aspect (p = 0.003) using LLLT. Taking into account the scars’ age, LLLT showed a tendency to decrease older scars’ thickness in EG. Conclusion: The intervention with LLLT appears to have a positive effect on the macroscopic scars’ appearance, and on old scars’ thickness, in the studied sample. However, it cannot be said for sure that LLLT has influence on scar tissue.

Local fractional variational iteration and decomposition methods for wave equation on cantor sets within local fractional operators

We perform a comparison between the fractional iteration and decomposition methods applied to the wave equation on Cantor set. The operators are taken in the local sense. The results illustrate the significant features of the two methods which are both very effective and straightforward for solving the differential equations with local fractional derivative.

Systems of Navier-Stokes equations on cantor sets

We present systems of Navier-Stokes equations on Cantor sets, which are described by the local fractional vector calculus. It is shown that the results for Navier-Stokes equations in a fractal bounded domain are efficient and accurate for describing fluid flow in fractal media.

From simulation to statistical analysis: timeliness assessment of ethernet/IP-based distributed systems

A number of characteristics are boosting the eagerness of extending Ethernet to also cover factory-floor distributed real-time applications. Full-duplex links, non-blocking and priority-based switching, bandwidth availability, just to mention a few, are characteristics upon which that eagerness is building up. But, will Ethernet technologies really manage to replace traditional Fieldbus networks? Ethernet technology, by itself, does not include features above the lower layers of the OSI communication model. In the past few years, it is particularly significant the considerable amount of work that has been devoted to the timing analysis of Ethernet-based technologies. It happens, however, that the majority of those works are restricted to the analysis of sub-sets of the overall computing and communication system, thus without addressing timeliness at a holistic level. To this end, we are addressing a few inter-linked research topics with the purpose of setting a framework for the development of tools suitable to extract temporal properties of Commercial-Off-The-Shelf (COTS) Ethernet-based factory-floor distributed systems. This framework is being applied to a specific COTS technology, Ethernet/IP. In this paper, we reason about the modelling and simulation of Ethernet/IP-based systems, and on the use of statistical analysis techniques to provide usable results. Discrete event simulation models of a distributed system can be a powerful tool for the timeliness evaluation of the overall system, but particular care must be taken with the results provided by traditional statistical analysis techniques.

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

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.

Dynamic QoS adaptation of inter- dependent task sets in cooperative embedded systems

Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.