A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

Supporting parallelism in server-based multiprocessor systems

Developing an efficient server-based real-time scheduling solution that supports dynamic task-level parallelism is now relevant to even the desktop and embedded domains and no longer only to the high performance computing market niche. This paper proposes a novel approach that combines the constantbandwidth server abstraction with a work-stealing load balancing scheme which, while ensuring isolation among tasks, enables a task to be executed on more than one processor at a given time instant.

A hybrid genetic algorithm for the multi-mode resource-constrained project scheduling

A construction project is a group of discernible tasks or activities that are conduct-ed in a coordinated effort to accomplish one or more objectives. Construction projects re-quire varying levels of cost, time and other resources. To plan and schedule a construction project, activities must be defined sufficiently. The level of detail determines the number of activities contained within the project plan and schedule. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. In this context, the well-known Resource Constrained Project Scheduling Problem (RCPSP) has been studied during the last decades. In the RCPSP the activities of a project have to be scheduled such that the makespan of the project is minimized. So, the technological precedence constraints have to be observed as well as limitations of the renewable resources required to accomplish the activities. Once started, an activity may not be interrupted. This problem has been extended to a more realistic model, the multi-mode resource con-strained project scheduling problem (MRCPSP), where each activity can be performed in one out of several modes. Each mode of an activity represents an alternative way of combining different levels of resource requirements with a related duration. Each renewable resource has a limited availability for the entire project such as manpower and machines. This paper presents a hybrid genetic algorithm for the multi-mode resource-constrained pro-ject scheduling problem, in which multiple execution modes are available for each of the ac-tivities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme. It is evaluated the quality of the schedules and presents detailed comparative computational re-sults for the MRCPSP, which reveal that this approach is a competitive algorithm.

A genetic algorithm for project scheduling with multi-modes and renewable resources

This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.

Formative assessment and motivation in higher education: a successful approach in mechanical engineer thermodynamics

Between 2000/01 and 2006/07, the approval rate of a Thermodynamics course in a Mechanical Engineer graduation was 25%. However, a careful analysis of the results showed that 41% of the students chosen not to attend or dropped out, missing the final examination. Thus, a continuous assessment methodology was developed, whose purpose was to reduce drop out, motivating students to attend this course, believing that what was observed was due, not to the incapacity to pass, but to the anticipation of the inevitability of failure by the students. If, on one hand, motivation is defined as a broad construct pertaining to the conditions and processes that account for the arousal, direction, magnitude, and maintenance of effort, on the other hand, assessment is one of the most powerful tools to change the will that students have to learn, motivating them to learn in a quicker and permanent way. Some of the practices that were implemented, included: promoting learning goal orientation rather than performance goal orientation; cultivating intrinsic interest in the subject and put less emphasis on grades but make grading criteria explicit; emphasizing teaching approaches that encourage collaboration among students and cater for a range of teaching styles; explaining the reasons for, and the implications of, tests; providing feedback to students about their performance in a form that is non-egoinvolving and non-judgemental and helping students to interpret it; broadening the range of information used in assessing the attainment of individual students. The continuous assessment methodology developed was applied in 2007/08 and 2008/09, having found an increase in the approval from 25% to 55% (30%), accompanied by a decrease of the drop out from 41% to 23,5% (17,5%). Flunking with a numerical grade lowered from 34,4% to 22,0% (12,4%). The perception by the students of the continuous assessment relevance was evaluated with a questionnaire. 70% of the students that failed the course respond that, nevertheless, didn’t repent having done the continuous assessment.

Automated synthesis procedure of RF discrete tuning differential capacitance circuits

The paper presents a RFDSCA automated synthesis procedure. This algorithm determines several RFDSCA circuits from the top-level system specifications all with the same maximum performance. The genetic synthesis tool optimizes a fitness function proportional to the RFDSCA quality factor and uses the epsiv-concept and maximin sorting scheme to achieve a set of solutions well distributed along a non-dominated front. To confirm the results of the algorithm, three RFDSCAs were simulated in SpectreRF and one of them was implemented and tested. The design used a 0.25 mum BiCMOS process. All the results (synthesized, simulated and measured) are very close, which indicate that the genetic synthesis method is a very useful tool to design optimum performance RFDSCAs.

Uma metaheurística para a programação de projectos com multi-modos e recursos limitados

Este artigo apresenta uma nova abordagem (MM-GAV-FBI), aplicável ao problema da programação de projectos com restrições de recursos e vários modos de execução por actividade, problema conhecido na literatura anglo-saxónica por MRCPSP. Cada projecto tem um conjunto de actividades com precedências tecnológicas definidas e um conjunto de recursos limitados, sendo que cada actividade pode ter mais do que um modo de realização. A programação dos projectos é realizada com recurso a um esquema de geração de planos (do inglês Schedule Generation Scheme - SGS) integrado com uma metaheurística. A metaheurística é baseada no paradigma dos algoritmos genéticos. As prioridades das actividades são obtidas a partir de um algoritmo genético. A representação cromossómica utilizada baseia-se em chaves aleatórias. O SGS gera planos não-atrasados. Após a obtenção de uma solução é aplicada uma melhoria local. O objectivo da abordagem é encontrar o melhor plano (planning), ou seja, o plano que tenha a menor duração temporal possível, satisfazendo as precedências das actividades e as restrições de recursos. A abordagem proposta é testada num conjunto de problemas retirados da literatura da especialidade e os resultados computacionais são comparados com outras abordagens. Os resultados computacionais validam o bom desempenho da abordagem, não apenas em termos de qualidade da solução, mas também em termos de tempo útil.

Licensing in an international triopoly

We study the effects of entry of two foreign firms on domestic welfare in the presence of licensing, when the incumbent is technologically superior to the entrants. We consider two different situations: (i) the cost-reducing innovation is licensed to both entrants; (ii) the cost- reducing innovation is licensed to just one of the entrants. We analyse three kind of license: (lump- sum) fixed-fee; (per-unit) royalty; and two-part tariff, that is a combination of a fixed-fee and a royalty. We prove that a two part tariff is never an optimal licensing scheme for the incumbent. Moreover, (i) when the technology is licensed to the two entrants, the optimal contract consists of a licensing with only output royalty; and (ii) when the technology is licensed to just one of the entrants, the optimal contract consists of a licensing with only a fixed-fee.

Aplicação de advergames no contexto do Ensino Superior

As novas tecnologias, e a Internet em particular, criaram novas formas de transmissão de informação para o público e alteraram a forma como as pessoas comunicam. Isto abriu portas a novas formas de publicidade e ao aparecimento de um novo género de jogos, os advergames, aproveitando o facto dos jogos online contarem já com milhões de jogadores a nível mundial, um número que continua em constante crescimento. O conceito é relativamente recente mas apresenta resultados bastante positivos, com muitos especialistas a defender que os advergames são o futuro da publicidade, em grande parte devido aos custos inferiores e ao tempo de exposição do produto, quando comparado com os métodos mais tradicionais de publicidade. Os Jogos Sérios e, em especial, os advergames são o tema principal desta tese, com uma análise detalhada das suas vantagens e desvantagens, origens e oportunidade de desenvolvimento no futuro. São também analisados alguns casos de advergames de sucesso. A componente prática da tese tem como objetivo a criação de um advergame com o propósito principal de auxiliar os novos alunos do ISEP no seu processo de integração. O jogo consiste num formato de labirinto em duas dimensões, com objetivos que consistem na captura de certos objetos e entrega dos mesmos em pontos de destino pré-definidos, sempre dentro de um tempo limite e evitando outros perigos e obstáculos. Os resultados obtidos com a aplicação deste jogo demonstram que a transmissão de informação é bastante eficaz junto do seu público-alvo, devido em parte à abordagem mais dinâmica e interativa que um advergame tem com os seus utilizadores. A simplicidade da interface e facilidade de utilização proporcionada pelo jogo permitem uma exposição alargada da mensagem a passar, aumentando a motivação do jogador para se manter em contacto com o mesmo. Isto apresenta perspetivas bastante otimistas para o futuro da utilização de advergames no meio Universitário.

Soil sampling design and sampling techniques for soil properties monitoring – common difficulties related to forest soils

Mathematical models and statistical analysis are key instruments in soil science scientific research as they can describe and/or predict the current state of a soil system. These tools allow us to explore the behavior of soil related processes and properties as well as to generate new hypotheses for future experimentation. A good model and analysis of soil properties variations, that permit us to extract suitable conclusions and estimating spatially correlated variables at unsampled locations, is clearly dependent on the amount and quality of data and of the robustness techniques and estimators. On the other hand, the quality of data is obviously dependent from a competent data collection procedure and from a capable laboratory analytical work. Following the standard soil sampling protocols available, soil samples should be collected according to key points such as a convenient spatial scale, landscape homogeneity (or non-homogeneity), land color, soil texture, land slope, land solar exposition. Obtaining good quality data from forest soils is predictably expensive as it is labor intensive and demands many manpower and equipment both in field work and in laboratory analysis. Also, the sampling collection scheme that should be used on a data collection procedure in forest field is not simple to design as the sampling strategies chosen are strongly dependent on soil taxonomy. In fact, a sampling grid will not be able to be followed if rocks at the predicted collecting depth are found, or no soil at all is found, or large trees bar the soil collection. Considering this, a proficient design of a soil data sampling campaign in forest field is not always a simple process and sometimes represents a truly huge challenge. In this work, we present some difficulties that have occurred during two experiments on forest soil that were conducted in order to study the spatial variation of some soil physical-chemical properties. Two different sampling protocols were considered for monitoring two types of forest soils located in NW Portugal: umbric regosol and lithosol. Two different equipments for sampling collection were also used: a manual auger and a shovel. Both scenarios were analyzed and the results achieved have allowed us to consider that monitoring forest soil in order to do some mathematical and statistical investigations needs a sampling procedure to data collection compatible to established protocols but a pre-defined grid assumption often fail when the variability of the soil property is not uniform in space. In this case, sampling grid should be conveniently adapted from one part of the landscape to another and this fact should be taken into consideration of a mathematical procedure.

Fast mobility support in low-power wireless networks: smart-HOP over RPL/6LoWPAN

With the emergence of low-power wireless hardware new ways of communication were needed. In order to standardize the communication between these low powered devices the Internet Engineering Task Force (IETF) released the 6LoWPAN stand- ard that acts as an additional layer for making the IPv6 link layer suitable for the lower-power and lossy networks. In the same way, IPv6 Routing Protocol for Low- Power and Lossy Networks (RPL) has been proposed by the IETF Routing Over Low power and Lossy networks (ROLL) Working Group as a standard routing protocol for IPv6 routing in low-power wireless sensor networks. The research performed in this thesis uses these technologies to implement a mobility process. Mobility management is a fundamental yet challenging area in low-power wireless networks. There are applications that require mobile nodes to exchange data with a xed infrastructure with quality-of-service guarantees. A prime example of these applications is the monitoring of patients in real-time. In these scenarios, broadcast- ing data to all access points (APs) within range may not be a valid option due to the energy consumption, data storage and complexity requirements. An alternative and e cient option is to allow mobile nodes to perform hand-o s. Hand-o mechanisms have been well studied in cellular and ad-hoc networks. However, low-power wireless networks pose a new set of challenges. On one hand, simpler radios and constrained resources ask for simpler hand-o schemes. On the other hand, the shorter coverage and higher variability of low-power links require a careful tuning of the hand-o parameters. In this work, we tackle the problem of integrating smart-HOP within a standard protocol, speci cally RPL. The simulation results in Cooja indicate that the pro- posed scheme minimizes the hand-o delay and the total network overhead. The standard RPL protocol is simply unable to provide a reliable mobility support sim- ilar to other COTS technologies. Instead, they support joining and leaving of nodes, with very low responsiveness in the existence of physical mobility.

Mitochondria are the main source and one of the targets of Pb (lead)-induced oxidative stress in the yeast Saccharomyces cerevisiae

The yeast Saccharomyces cerevisiae is a useful model organism for studying lead (Pb) toxicity. Yeast cells of a laboratory S. cerevisiae strain (WT strain) were incubated with Pb concentrations up to 1,000 μmol/l for 3 h. Cells exposed to Pb lost proliferation capacity without damage to the cell membrane, and they accumulated intracellular superoxide anion (O2 .−) and hydrogen peroxide (H2O2). The involvement of the mitochondrial electron transport chain (ETC) in the generation of reactive oxygen species (ROS) induced by Pb was evaluated. For this purpose, an isogenic derivative ρ0 strain, lacking mitochondrial DNA, was used. The ρ0 strain, without respiratory competence, displayed a lower intracellular ROS accumulation and a higher resistance to Pb compared to the WT strain. The kinetic study of ROS generation in yeast cells exposed to Pb showed that the production of O2 .− precedes the accumulation of H2O2, which is compatible with the leakage of electrons from the mitochondrial ETC. Yeast cells exposed to Pb displayed mutations at the mitochondrial DNA level. This is most likely a consequence of oxidative stress. In conclusion, mitochondria are an important source of Pb-induced ROS and, simultaneously, one of the targets of its toxicity.

CPMD-mindful task assignment for NPS-F

The multiprocessor scheduling scheme NPS-F for sporadic tasks has a high utilisation bound and an overall number of preemptions bounded at design time. NPS-F binpacks tasks offline to as many servers as needed. At runtime, the scheduler ensures that each server is mapped to at most one of the m processors, at any instant. When scheduled, servers use EDF to select which of their tasks to run. Yet, unlike the overall number of preemptions, the migrations per se are not tightly bounded. Moreover, we cannot know a priori which task a server will be currently executing at the instant when it migrates. This uncertainty complicates the estimation of cache-related preemption and migration costs (CPMD), potentially resulting in their overestimation. Therefore, to simplify the CPMD estimation, we propose an amended bin-packing scheme for NPS-F allowing us (i) to identify at design time, which task migrates at which instant and (ii) bound a priori the number of migrating tasks, while preserving the utilisation bound of NPS-F.

Dynamical Stability and Predictability of Football Players: The Study of One Match

The game of football demands new computational approaches to measure individual and collective performance. Understanding the phenomena involved in the game may foster the identification of strengths and weaknesses, not only of each player, but also of the whole team. The development of assertive quantitative methodologies constitutes a key element in sports training. In football, the predictability and stability inherent in the motion of a given player may be seen as one of the most important concepts to fully characterise the variability of the whole team. This paper characterises the predictability and stability levels of players during an official football match. A Fractional Calculus (FC) approach to define a player’s trajectory. By applying FC, one can benefit from newly considered modeling perspectives, such as the fractional coefficient, to estimate a player’s predictability and stability. This paper also formulates the concept of attraction domain, related to the tactical region of each player, inspired by stability theory principles. To compare the variability inherent in the player’s process variables (e.g., distance covered) and to assess his predictability and stability, entropy measures are considered. Experimental results suggest that the most predictable player is the goalkeeper while, conversely, the most unpredictable players are the midfielders. We also conclude that, despite his predictability, the goalkeeper is the most unstable player, while lateral defenders are the most stable during the match.

PEC e a vertente empresarial: impacto na gestão de tesouraria das PME

Dissertação de Mestrado apresentada ao Instituto de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Contabilidade e Finanças, sob orientação de Cláudia Maria Pereira Esta versão contém as críticas e sugestões dos elementos do júri.