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.

On international cost-sharing of pharmaceutical R&D

Ramsey pricing has been proposed in the pharmaceutical industry as a principle to price discriminate among markets while allowing to recover the (fixed) R&D cost. However, such analyses neglect the presence of insurance or the fund raising costs for most of drug reimbursement. By incorporating these new elements, we aim at providing some building blocks towards an economic theory incorporating Ramsey pricing and insurance coverage. We show how coinsurance affects the optimal prices to pay for the R&D investment. We also show that under certain conditions, there is no strategic incentive by governments to set coinsurance rates in order to shift the financial burden of R&D. This will have important implications to the application of Ramsey pricing principles to pharmaceutical products across countries.

The simple economics of risk-sharing agreements between the NHS and the pharmaceutical industry

The Janssen-Cilag proposal for a risk-sharing agreement regarding bortezomib received a welcome signal from NICE. The Office of Fair Trading report included risk-sharing agreements as an available tool for the National Health Service. Nonetheless, recent discussions have somewhat neglected the economic fundamentals underlying risk-sharing agreements. We argue here that risk-sharing agreements, although attractive due to the principle of paying by results, also entail risks. Too many patients may be put under treatment even with a low success probability. Prices are likely to be adjusted upward, in anticipation of future risk-sharing agreements between the pharmaceutical company and the third-party payer. An available instrument is a verification cost per patient treated, which allows obtaining the first-best allocation of patients to the new treatment, under the risk sharing agreement. Overall, the welfare effects of risk-sharing agreements are ambiguous, and care must be taken with their use.

Design and implementation of an autonomous, proactive, and reactive software infrastructure to help improving the management level of projects

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Sharing best practices in introducing and teaching ethics principles to public administration employees : research report

O projeto, financiado pelo Programa Aprendizagem ao Longo da Vida, decorreu entre 1 de agosto de 2011 e 31 de julho de 2013 e foi coordenado pelo Instituto de Administração Pública de Praga, tendo como parceiros a Escola de Economia e Direito de Berlim, a Escola Nacional de Administração Pública da Polónia e o INA, de Portugal. A coordenação portuguesa do estudo esteve a cargo da Prof. Doutora Helena Rato e da Dra. Matilde Gago, com a colaboração do Prof. Doutor César Madureira e da Dra. Margarida Quintela, ex investigadores do INA, atualmente na DGAEP.

Expatriates’ influence on knowledge sharing: an empirical study with International portuguese companies

Despite the abundant literature in knowledge management, few empirical studies have explored knowledge management in connection with international assignees. This phenomenon has a special relevance in the Portuguese context, since (a) there are no empirical studies concerning this issue that involves international Portuguese companies; (b) the national business reality is incipient as far as internationalisation is concerned, and; (c) the organisational and national culture presents characteristics that are distinctive from the most highly studied contexts (e.g., Asia, USA, Scandinavian countries, Spain, France, The Netherlands, Germany, England and Russia). We examine the role of expatriates in transfer and knowledge sharing within the Portuguese companies with operations abroad. We focus specifically on expatriates’ role on knowledge sharing connected to international Portuguese companies and our findings take into account organizational representatives’ and expatriates’ perspectives. Using a comparative case study approach, we examine how three main dimensions influence the role of expatriates in knowledge sharing among headquarters and their subsidiaries (types of international assignment, reasons for using expatriation and international assignment characteristics). Data were collected using semi‐structured interviews to 30 Portuguese repatriates and 14 organizational representatives from seven Portuguese companies. The findings suggest that the reasons that lead Portuguese companies to expatriating employees are connected to: (1) business expansion needs; (2) control of international operations and; (3) transfer and knowledge sharing. Our study also shows that Portuguese companies use international assignments in order to positively respond to the increasingly decaying domestic market in the economic areas in which they operate. Evidence also reveals that expatriation is seen as a strategy to fulfill main organizational objectives through their expatriates (e.g., business internationalization, improvement of the coordination and control level of the units/subsidiaries abroad, replication of aspects of the home base, development and incorporation of new organizational techniques and processes). We also conclude that Portuguese companies have developed an International Human Resources Management strategy, based on an ethnocentric approach, typically associated with companies in early stages of internationalization, i.e., the authority and decision making are centered in the home base. Expatriates have a central role in transmitting culture and technical knowledge from company’s headquarters to the company’s branches. Based on the findings, the article will discuss in detail the main theoretical and managerial implications. Suggestions for further research will also be presented.

Sharing of antigens between Plasmodium falciparum and Anopheles albimanus

The presence of common antigens between Plasmodium falciparum and Anopheles albimanus was demonstrated. Different groups of rabbits were immunized with: crude extract from female An. albimanus (EAaF), red blood cells infected with Plasmodium falciparum (EPfs), and the SPf66 synthetic malaria vaccine. The rabbit's polyclonal antibodies were evaluated by ELISA, Multiple Antigen Blot Assay (MABA), and immunoblotting. All extracts were immunogenic in rabbits according to these three techniques, when they were evaluated against the homologous antigens. Ten molecules were identified in female mosquitoes and also in P. falciparum antigens by the autologous sera. The electrophoretic pattern by SDS-PAGE was different for the three antigens evaluated. Cross-reactions between An. albimanus and P. falciparum were found by ELISA, MABA, and immunoblotting. Anti-P. falciparum and anti-SPf66 antibodies recognized ten and five components in the EAaF crude extract, respectively. Likewise, immune sera against female An. albimanus identified four molecules in the P. falciparum extract antigen. As far as we know, this is the first work that demonstrates shared antigens between anophelines and malaria parasites. This finding could be useful for diagnosis, vaccines, and the study of physiology of the immune response to malaria.

Proactive services ecosystem framework

Dissertation presented to obtain the degree of Doctor in Electrical and Computer Engineering, specialization on Collaborative Enterprise Networks