Educação alimentar infantil: potencialidades de estudantes de educação de infância

Resumo: Na promoção de comportamentos alimentares saudáveis ao longo da vida. que deve iniciar-se o mais precocemente possível, a educação alimentar é um elemento chave. O jardim-de-infância é um espaço efectivo na implementação de projectos de educação alimentar, onde os educadores de infância são actores imprescindíveis. Este estudo teve como objectivo desenvolver uma metodologia apropriada para identificar as capacidades de estudantes de educação de infância e avaliar as suas aptidões no contexto da educação alimentar infantil. A população alvo do estudo foram estudantes do 4ºano da licenciatura em educação de infância de instituições públicas e privadas da área metropolitana de Lisboa (n=287). Construiu-se um videograma, integrador dos domínios da aprendizagem (cognitivo e afectivo) e dos factores associados aos comportamentos em saúde (predisponentes, capacitadores e de esforço). A construção dos questionários estruturou-se em: conhecimentos-atitudes-comportamentos.Pretendia-se que os estudantes transmitissem a sua opinião, de acordo com os questionários.Os estudantes manifestaram conhecimentos, no âmbito da alimentação infantil e da utilidade e aplicabilidade da educação alimentar.Nenhum estudante apresentou conhecimentos negativos, numa escala de zero a 18 valores, 86,9% obtiveram uma classificação entre 11 e 17 valores e 13,1% a classificação máxima.A atitude dos estudantes revelou-se consensual com o desejável, 98,5% apresentaram atitudes positivas face aos aspectos estruturadores das actividades de educação alimentar.No domínio do "saber fazer" 51,0% dos estudantes demonstraram fragilidades no seu desempenho/comportamento. Em conclusão, a utilização do questionário demonstrou ser apropriado para a medição dos conhecimentos, das atitudes e como forma de os estudantes, após visionarem o videograma, espelharem o seu desempenho/comportamento face à representação do educador de infância. A taxa de resposta nunca foi inferior a 98,9% (n=284). No domínio dos conhecimentos, os estudantes manifestaram concepções positivas no campo da alimentação infantil e da educação alimentar. As atitudes enfatizaram-se no domínio afectivo, nos aspectos relacionais e comunicacionais. No domínio dos comportamentos, 91,8% dos estudantes apresentaram dificuldades na identificação dos aspectos menos correctos do desempenho dos actores do video, o que pode sugerir lacunas no âmbito do "saber fazer". Abstract:Nutrition education is key element to promote lifelong healthy eating behaviours and it must begin since early stages of life. Nursery schools are an effective space in the implementation of nutrition education projects, where the nursery teachers are indispensable actors. The aim of this study was to develop an appropriate methodology to identify nursery education student´s skills and evaluate their attitudes in the childhood nutrition education's context. The study's population were students of the 4th degree in private and public nursery education universities in Lisbon metropolitan area (n=287). A video integrator of learning domains (cognitive and affective) and of factors associated with health behaviours (predisposing, enabling and reinforcing) was developed. Questionnaire´s construction was structured in: knowledge-attitudes-behaviours.According to the questionnaires students were asked to transmit their opinion. Students revealed knowledge, in the scope of the childhood nutrition and in utility and applicability of nutrition education. No students presented negative results in knowledge ina zero - 18 scale; 86,9% students obtained a classification between 11 and 17 and the maximum classification was obtained by 13.1% students. Student's attitude was according to win the desirable, 98,5% student´s revealed positive attitudes in the nutrition education's structure aspects of chilhood activities.In the domain of the "know to do" 51,0% of students showed fragilities in their performance/behaviour. In conclusion, the questionnaire´s utilization confirm to be appropriated in measurement knowledge and attitudes and also, after watching the video, as a way for students reflect their performance/behaviour face to the nursery teacher´s representation. Answer´s rate was never lower than 98.9% (n=284). In the knowledge's domain students demonstrated positive conceptions in the childhood nutrition and nutrition education's fields. Attitudes were emphasized in the effective domain in the communication and relational aspects. In behaviour's domain 91.8% students presented difficulties in identifying the less correct aspects of the video actor's performance what may suggest gaps in the "know to do" scope.

Algorithms and methodologies for decision support in energy efficiency on buildings

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

Reactores a tório: o futuro da energia nuclear de fissão

Dissertação para a obtenção do grau de mestre em Engenharia Electrotécnica Ramo de Energia

Convergence to the European Energy Policy in European countries: case studies and comparison

Purpose – Our paper aims at analyzing how different European countries cope with the European Energy Policy, which proposes a set of measures (free energy market, smart meters, energy certificates) to improve energy utilization and management in Europe. Design/methodology/approach – The paper first reports the general vision, regulations and goals set up by Europe to implement the European Energy Policy. Later on, it performs an analysis of how some European countries are coping with the goals, with financial, legal, economical and regulatory measures. Finally, the paper draws a comparison between the countries to present a view on how Europe is responding to the emerging energy emergency of the modern world. Findings – Our analysis on different use cases (countries) showed that European countries are converging to a common energy policy, even though some countries appear to be later than others In particular, Southern European countries were slowed down by the world financial and economical crisis. Still, it appears that contingency plans were put into action, and Europe as a whole is proceeding steadily towards the common vision. Research limitations/implications – European countries are applying yet more cuts to financing green technologies, and it is not possible to predict clearly how each country will evolve its support to the European energy policy. Practical implications – Different countries applied the concepts and measures in different ways. The implementation of the European energy policy has to cope with the resulting plethora of regulations, and a company proposing enhancement regarding energy management still has to possess robust knowledge of the single country, before being able to export experience and know-how between European countries. Originality/Value – Even though a few surveys on energy measures in Europe are already part of the state-of-the-art, organic analysis diagonal to the different topics of the European Energy Policy is missing. Moreover, this paper highlights how European countries are converging on a common view, and provides some details on the differences between the countries, thus facilitating parties interesting into cross-country export of experience and technology for energy management.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.

Race-to-halt energy saving strategies

Energy consumption is one of the major issues for modern embedded systems. Early, power saving approaches mainly focused on dynamic power dissipation, while neglecting the static (leakage) energy consumption. However, technology improvements resulted in a case where static power dissipation increasingly dominates. Addressing this issue, hardware vendors have equipped modern processors with several sleep states. We propose a set of leakage-aware energy management approaches that reduce the energy consumption of embedded real-time systems while respecting the real-time constraints. Our algorithms are based on the race-to-halt strategy that tends to run the system at top speed with an aim to create long idle intervals, which are used to deploy a sleep state. The effectiveness of our algorithms is illustrated with an extensive set of simulations that show an improvement of up to 8% reduction in energy consumption over existing work at high utilization. The complexity of our algorithms is smaller when compared to state-of-the-art algorithms. We also eliminate assumptions made in the related work that restrict the practical application of the respective algorithms. Moreover, a novel study about the relation between the use of sleep intervals and the number of pre-emptions is also presented utilizing a large set of simulation results, where our algorithms reduce the experienced number of pre-emptions in all cases. Our results show that sleep states in general can save up to 30% of the overall number of pre-emptions when compared to the sleep-agnostic earliest-deadline-first algorithm.

An optimal boundary fair scheduling

Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.

Gestão de projetos audiovisuais: a experiência na RTP

Relatório de estágio apresentado à Escola Superior de Comunicação Social como parte dos requisitos para obtenção de grau de mestre em Audiovisual e Multimédia.

A many-core co-processor for embedded parallel computing on FPGA

Single processor architectures are unable to provide the required performance of high performance embedded systems. Parallel processing based on general-purpose processors can achieve these performances with a considerable increase of required resources. However, in many cases, simplified optimized parallel cores can be used instead of general-purpose processors achieving better performance at lower resource utilization. In this paper, we propose a configurable many-core architecture to serve as a co-processor for high-performance embedded computing on Field-Programmable Gate Arrays. The architecture consists of an array of configurable simple cores with support for floating-point operations interconnected with a configurable interconnection network. For each core it is possible to configure the size of the internal memory, the supported operations and number of interfacing ports. The architecture was tested in a ZYNQ-7020 FPGA in the execution of several parallel algorithms. The results show that the proposed many-core architecture achieves better performance than that achieved with a parallel generalpurpose processor and that up to 32 floating-point cores can be implemented in a ZYNQ-7020 SoC FPGA.

Risk assessment in open innovation networks

Innovation is considered crucial for enterprises survival and current economic environment demands the best ways of achieving it. However, the development of complex products and services require the utilization of diverse know-how and technology, which enterprises may not hold. An effective strategy for achieving them is to rely in open innovation. Still, open innovation projects may fail for many causes, e.g. due to the dynamics of collaboration between partners. To effectively benefit from open innovation, it is recommended the utilization of adequate risk models. For achieving such models, a preliminary conceptualization of open innovation and risk is necessary, which includes modeling experiments with existing risk models, such as the FMEA.