Contributos para a compreensão das dimensões e características do Capital Intelectual valorizadas por uma Empresa líder no Sector dos Seguros em Portugal

Mestrado em Gestão e Empreendedorismo

TimeMesh: an educational historical game

The TIMEMESH game, developed in the scope of the European Project SELEAG, is an educational game for learning history, culture and social relations. It is supported by an extensible, online, multi-language, multi-player, collaborative and social platform for sharing and acquiring knowledge of the history of European regions. The game has been already used, with remarkable success, in different European countries like Portugal, Spain, England, Slovenia, Estonia and Belgium.

TimeMesh – a serious game for european citizenship

Serious games are games where the entertainment aspect is not the most relevant motivation or objective. TimeMesh is an online, multi-language, multiplayer, collaborative and social game platform for sharing and acquiring knowledge of the history of European regions. As such it is a serious game with educational characteristics. This article evaluates the use of TimeMesh with students of 13 and 14 years-old. It shows that this game is already a significant learning tool about European citizenship.

A semantic approach for learning objects repositories with knowledge reuse

In this paper we discuss how the inclusion of semantic functionalities in a Learning Objects Repository allows a better characterization of the learning materials enclosed and improves their retrieval through the adoption of some query expansion strategies. Thus, we started to regard the use of ontologies to automatically suggest additional concepts when users are filling some metadata fields and add new terms to the ones initially provided when users specify the keywords with interest in a query. Dealing with different domain areas and having considered impractical the development of many different ontologies, we adopted some strategies for reusing ontologies in order to have the knowledge necessary in our institutional repository. In this paper we make a review of the area of knowledge reuse and discuss our approach.

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.

Traditional knowledge for promotion of socioeconomic inclusion of local communities

This paper discusses the key role played by public research institutes for promoting socioeconomic inclusion of local communities based on traditional knowledge and traditional medicine. Nongovernmental organizations and cooperatives have had an important role in raising financial resources, being involved with advocacy of local communities and advancing legislation changes. But strict best manufacturing practices regulations imposed by the Brazilian National Health Surveillance Agency on the requirements for approval and commercialization of drugs based on herbal medicine products call for the involvement of strong public research institutes capable of supporting community-based pharmacies. Thus, public research institutes are pivotal as they can conduct scientific research studies to evidence the efficacy of herbal medicine products and help building the capacity of local communities to comply with current regulations.

Comunidades de prática nas organizações de saúde: proposta de modelo numa organização hospitalar

Mestrado em Intervenção Sócio-Organizacional na Saúde - Ramo de especialização: Políticas de Administração e gestão de Serviços de Saúde

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.

Gestão do conhecimento : estudo de caso Orquestra Juvenil de Guitarras do Algarve

Mestrado em Gestão e Empreendedorismo

A gestão do conhecimento como estratégia de internacionalização da marca wines of Portugal

Mestrado em Gestão e Empreendedorismo

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.