Modelling a network of heterogeneous e-learning systems

In recent years emerged several initiatives promoted by educational organizations to adapt Service Oriented Architectures (SOA) to e-learning. These initiatives commonly named eLearning Frameworks share a common goal: to create flexible learning environments by integrating heterogeneous systems already available in many educational institutions. However, these frameworks were designed for integration of systems participating in business like processes rather than on complex pedagogical processes as those related to automatic evaluation. Consequently, their knowledge bases lack some fundamental components that are needed to model pedagogical processes. The objective of the research described in this paper is to study the applicability of eLearning frameworks for modelling a network of heterogeneous eLearning systems, using the automatic evaluation of programming exercises as a case study. The paper surveys the existing eLearning frameworks to justify the selection of the e-Framework. This framework is described in detail and identified the necessary components missing from its knowledge base, more precisely, a service genre, expression and usage model for an evaluation service. The extensibility of the framework is tested with the definition of this service. A concrete model for evaluation of programming exercises is presented as a validation of the proposed approach.

Aplicação da filosofia Lean a um caso de estudo para otimização de processos de construção na pré-fabricação de peças de betão

Dissertação de Natureza Científica para obtenção do grau de Mestre em Engenharia Civil, perfil de Edificações

Estudo sobre as diferenças interativas e comunicativas de educadores e educadoras com crianças em idade pré escolar

Dissertação apresentada na Escola Superior de Educação de Lisboa para obtenção do grau de Mestre em Ciências da Educação - Especialidade Intervenção Precoce

A influência do contexto educativo nas aprendizagens das crianças em educação pré-escolar

Dissertação apresentada à Escola Superior de Educação de Lisboa para obtenção do grau de Mestre em Ciências da Educação Especialidade Intervenção Precoce

Capacidade diagnóstica dos biomarcadores de rastreio Pré-natal

Introdução: Algumas anomalias fetais podem colocar sérios riscos para a saúde materna ou estar associadas a uma diminuição acentuada da qualidade de vida do novo ser em formação, ou ainda, ser incompatíveis com a vida do mesmo. O Rastreio Pré-natal (RPN) é um teste que se destina a seleccionar gravidezes com um risco aumentado de apresentarem um feto com malformações. O desenvolvimento de métodos de rastreio pré-natal de anomalias cromossómicas teve grande impacto no diagnóstico pré-natal (DPN). Tradicionalmente, a idade materna era vista como o principal teste de rastreio, pelo que todas as mulheres com idade igual ou superior a 35 anos são aconselhadas a realizar amniocentese. Actualmente maioria das amniocenteses já não são realizadas exclusivamente com base na idade materna, mas com base nos resultados dos teste de rastreio actualmente recomendados, devem-se oferecer a todas as grávidas a possibilidade de efectuarem os testes de rastreio pré-natal uma vez que estes são universais, pois aconselhar a amniocentese a todas as mulheres com idade igual ou superior a 35 anos, apresenta baixa capacidade diagnóstica, uma vez que quer neste estudo, quer noutros estudos publicados, apresentam evidência de malformações fetais em mulheres com idade inferior aos 35 anos. Novos testes de rastreio pré-natal, assim a sua combinação, possibilita a determinação do risco de desenvolver um feto com estas anomalias com elevada probabilidade. As malformações genéticas estão associadas a elevada morbilidade e mortalidade. Os testes de rastreio pré-natal assumem especial importância, uma vez que, permitem a sua detecção, ainda numa fase precoce. O objectivo deste estudo foi avaliar a capacidade diagnóstica dos marcadores bioquímicos analisando os resultados dos diferentes métodos de rastreio pré-natal numa amostra de grávidas que realizaram amniocentese. A população deste estudo foi os registos das amniocenteses, das mulheres grávidas do Serviço de Obstetrícia do Hospital de Santo António -CHP. Resultados: Foram recolhidos 722 registos de amniocenteses, 540 foram realizadas com base na idade materna, 144 no resultado positivo do rastreio bioquímico e 38 com base nos dados ecográficos. No total, 697 (96,5%) das amniocenteses foram negativas e 25 (3,5%) positivas. Relativamente aos testes bioquímicos de rastreio, verificamos que existe uma proporção de 7,64% (n=11) de verdadeiros positivos, e 92,36% (n=133) de falsos positivos. Conclusão: Não existem evidências para afirmar que os marcadores bioquímicos de rastreio pré-natal tenham capacidade diagnóstica, mas tem grande utilidade clínica na detecção do risco de malformações fetais, e por isso mesmo, segundo as ultimas recomendações de consenso, o RPN e o DPN devem estar disponíveis para todas as mulheres que iniciem a sua rotina pré-natal antes das 20 semanas de gestação, independentemente da sua idade.

Da liderança ao bullying: estratégias a adotar numa sala de pré-escolar para promover o desenvolvimento social e moral

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

A importância das histórias na educação pré-escolar

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

Arte rupestre do Vale do Tejo. Um ciclo artístico-cultural pré e proto-histórico

Dissertação apresentada para cumprimento dos requisitos necessários à obtenção do grau de Doutor em História, especialidade Arqueologia

Greener Selective Cycloalkane Oxidations with Hydrogen Peroxide Catalyzed by Copper-5-(4-pyridyl)tetrazolate Metal-Organic Frameworks

Microwave assisted synthesis of the Cu(I) compound [Cu(µ4-4-ptz)]n [1, 4-ptz = 5-(4-pyridyl)tetrazolate] has been performed by employing a relatively easy method and within a shorter period of time compared to its sister compounds. The syntheses of the Cu(II) compounds [Cu3(µ3-4-ptz)4(µ2-N3)2(DMF)2]n∙(DMF)2n (2) and [Cu(µ2-4-ptz)2(H2O)2]n (3) using a similar method were reported previously by us. MOFs 1-3 revealed high catalytic activity toward oxidation of cyclic alkanes (cyclopentane, -hexane and -octane) with aqueous hydrogen peroxide, under very mild conditions (at room temperature), without any added solvent or additive. The most efficient system (2/H2O2) showed, for the oxidation of cyclohexane, a turnover number (TON) of 396 (TOF of 40 h−1), with an overall product yield (cyclohexanol and cyclohexanone) of 40% relative to the substrate. Moreover, the heterogeneous catalytic systems 1–3 allowed an easy catalyst recovery and reuse, at least for four consecutive cycles, maintaining ca. 90% of the initial high activity and concomitant high selectivity.

Oxidovanadium complexes with tridentate aroylhydrazone as catalyst precursors for solvent-free microwave-assisted oxidation of alcohols

Aroylhydrazone oxidovanadium compounds, viz, the oxidoethoxidovanadium(V) [VO(OEt)L1] (1) (H2L =salicylaldehyde-2-hydroxybenzoylhydrazone), the salt like dioxidovanadium(V) (NH3CH2CH2OH)(+) [VO2L](-) (2), the mixed-ligand oxidovanadium(V) [VO(hq)L](Hhq = 8-hydroxyquinoline) (3) and the vanadium(IV) [VO(phen)L] (phen=1,10-phenanthroline) (4) complexes (3 and 4 obtained by the first time), have been tested as catalysts for solvent-free microwave-assisted oxidation of aromatic and alicyclic secondary alcohols with tert-butylhydroperoxide. A facile, efficient and selective solvent-free synthesis of ketones was achieved with yields up to 99% (TON= 497, TOF= 993 h(-1) for 3) and 58% (TON =291, TOF= 581 h(-1) for 2) for acetophenone and cyclohexanone, respectively, after 30 min under low power (25W) microwave irradiation. (C) 2015 Elsevier B.V. All rights reserved.

Ansiedade pré-cirúrgica em crianças : avaliação da eficácia de um programa cognitivo-comportamental para a sua redução

Este estudo teve como objectivo avaliar a eficácia de uma sessão de informação a propósito de uma intervenção cirúrgica com anestesia geral na redução da ansiedade em jovens com idades compreendidas entre os 6 e os 12 anos. A amostra foi constituída por 125 jovens, 62 do sexo masculino e 63 do sexo feminino. Foram constituídos dois grupos, em que ao grupo experimental foi administrado um programa de informação sobre procedimentos cirúrgicos com anestesia geral, utilizando técnicas de modelagem, e em que ao grupo de controlo apenas foi aplicada a sessão avaliativa. Os resultados obtidos permitiram concluir que a eficácia da sessão informativa a propósito de uma intervenção cirúrgica com anestesia geral na redução da ansiedade, nas crianças, foi comprovada. The aim of this study was to evaluate the efficacy of an information session about cirurgy, with general anesthesia induction, in reducing anxiety in children from 6 to 12 years undergoing cirurgy. Our sample was constituted by 125 children, 62 boys and 63 girls divided in two groups: the experimental group had an information session about chirurgical procedures with general anesthesia and had anxiety evaluated pre and post session, as the control group had only one anxiety evaluation. The results show that the session was effective on reducing pre-operatory anxiety in children.

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.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.

Projeto de execução de um viaduto rodoviário em betão armado pré-esforçado

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia Civil

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.