Rede de Calor – Uma Solução a Biomassa para um Complexo de Hóteis

O recurso às energias renováveis é na actualidade um tema que atinge um grau de importância primordial face á crescente preocupação com o meio ambiente e o impacto negativo, que a produção de energia com base em combustíveis fósseis tem. Esta importância aliada a uma tendência cada vez maior para a criação de soluções de produção sustentável de energia, tem obrigado ao desenvolvimento desta vertente do sector energético e ao estudo e consequentemente implementação de soluções integradas que permitam uma economia competitiva. Os hotéis, sendo estabelecimentos comerciais que desenvolvem uma actividade que envolve, na generalidade, um nível de consumo energético considerável para garantir os seus serviços básicos de acomodação e lazer, tornam-se por excelência alvos primordiais no que concerne ao seu elevado potencial de poupança de energia. O ramo da hotelaria, dada a sua especificidade e a natureza dos edifícios que comporta, torna-os em excelentes candidatos para análise e optimização energética, e como tal um alvo de negócio para as empresas de comercialização de poupanças energéticas. As empresas dedicadas aos serviços de energia são conhecidas por ESCO (Energy Service Company ou Energy Savings Company). A sua actividade tem por base apresentar soluções de energia, nomeadamente a implementação de projectos de poupança energética que podem englobar produção, conservação e fornecimento de energia, bem como gestão de risco associada. O objectivo principal é apresentar soluções de optimização e eficiência energética levando á sua implementação em casos reais de exploração em edifícios ou sectores específicos, rentabilizando o investimento e partilhando o lucro dessa rentabilização com os clientes. No caso específico dos hotéis, mais concretamente um complexo de hotéis, como o estudado neste trabalho, esta análise pretende elaborar uma caracterização das necessidades energéticas do sector e apresentar um conjunto de soluções energéticas adequadas à realidade hoteleira. É também objecto de análise, toda a aproximação de um modelo de negócio energético a explorar por uma ESCO. O presente trabalho, realizado no âmbito da parceria entre a Gebio e a Confraria do Bom Jesus, tem por objectivo demonstrar as bases do contracto de performance entre uma empresa ESCO (Gebio – empresa concessionária do projecto) e um complexo de hotéis (constituído pelo Hotel do Lago, Hotel do Parque e Hotel do Templo), com vista a optimizar os consumos energéticos para a produção de energia térmica capaz de corresponder às necessidades do complexo. Foi desenvolvido um estudo completo das necessidades térmicas do complexo, com vista a projectar uma solução integrada de produção de energia térmica, com recurso a uma caldeira de biomassa, para os hotéis. Foi realizado um levantamento extensivo dos consumos e custos energético do complexo, nomeadamente para as águas quentes sanitárias. Desta análise obtiveram-se os custos reais do sistema e com os mesmos foi possível, numa primeira fase, elaborar os diversos projectos, hidráulico, eléctricos e civil, de forma a se definir a solução base e quais os orçamentos previstos para a instalação de um sistema de produção a biomassa, e numa segunda fase foi estudada a viabilidade da assinatura de um contracto de performance entre a ESCO e o complexo de hotéis.

Knowledge sharing and learning processes: case study of portuguese technological schools and higher education institutions

Paper to be presented at the ESREA Conference Learning to Change? The Role of Identity and Learning Careers in Adult Education, 7-8 December, 2006, Université Catholique Louvain, Louvain–la-Neuve, Belgium

Alianças estratégicas: análise do sector exportador de produtos português

Dissertação de Mestrado em Finanças Empresariais

Advances in smart grids - benefits on sharing background experiences from Portugal, Central Europe and Brazil

This paper presents ELECON - Electricity Consumption Analysis to Promote Energy Efficiency Considering Demand Response and Non-technical Losses, an international research project that involves European and Brazilian partners. ELECON focuses on energy efficiency increasing through consumer´s active participation which is a key area for Europe and Brazil cooperation. The project aims at significantly contributing towards the successful implementation of smart grids, focussing on the use of new methods that allow the efficient use of distributed energy resources, namely distributed generation, storage and demand response. ELECON puts together researchers from seven European and Brazilian partners, with consolidated research background and evidencing complementary competences. ELECON involves institutions of 3 European countries (Portugal, Germany, and France) and 4 Brazilian institutions. The complementary background and experience of the European and Brazilian partners is of main relevance to ensure the capacities required to achieve the proposed goals. In fact, the European Union (EU) and Brazil have very different resources and approaches in what concerns this area. Having huge hydro and fossil resources, Brazil has not been putting emphasis on distributed renewable based electricity generation. On the contrary, EU has been doing huge investments in this area, taking into account environmental concerns and also the economic EU external dependence dictated by huge requirements of energy related products imports. Sharing these different backgrounds allows the project team to propose new methodologies able to efficiently address the new challenges of smart grids.

E-sharing: development and use of learning objects repository

— In the new learning environments, built width digital technologies, the need to promote quality of education resources, commonly known as Learning Objects, which can support formal and informal distance learning, emerge as one of the biggest challenge that educational institutions will have to face. Due to the fact that is expensive, the reuse and sharing became very important issue. This article presents a Learning Object Repository which aims to store, to disseminate and maintain accessible Learning Objects.

Capacity sharing and stealing in serverbased real-time systems

A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

Provably good multiprocessor scheduling with resource sharing

We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.

A capacity sharing and stealing strategy for open real-time systems

This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.

Capacity sharing and stealing in dynamic server-based real-time systems

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

Cournot competition between a non-profit firm and a for-profit firm with uncertainty

In this paper, we consider a Cournot competition between a nonprofit firm and a for-profit firm in a homogeneous goods market, with uncertain demand. Given an asymmetric tax schedule, we compute explicitly the Bayesian-Nash equilibrium. Furthermore, we analyze the effects of the tax rate and the degree of altruistic preference on market equilibrium outcomes.