983 resultados para File sharing applications
Resumo:
Nos últimos anos têm existido bastantes pesquisas e um grande investimento quer na área da educação à distância quer ao nível das tecnologias móveis. A dada altura percebeu-se que cada vez mais poderiam ser utilizados dispositivos móveis no contexto da educação e de que estes já seriam capazes de responder às exigências necessárias para que fosse possível criar ou melhorar cenários com recursos educativos. Este trabalho tem como objetivo propor um modelo que facilite a aprendizagem em dispositivos móveis. Nesse sentido, decidiu-se que seria uma mais-valia adicionar a este projeto, a utilização da Realidade Aumentada como potenciador de melhorias no processo de aprendizagem. A Realidade Aumentada, a par do que acontece com a educação à distância e com as tecnologias móveis, é uma área alvo de constantes investigações e inovação. Apresenta como principal capacidade a interação do utilizador com vários modelos virtuais incluídos numa cena real. Esta capacidade proporciona experiências que podem contribuir para o aumento da motivação e da perceção por parte dos alunos. A forma como o utilizador interage com as aplicações móveis é vista com extrema importância, principalmente na área da educação. Aliar uma boa interação à utilização da Realidade Aumentada, é parte integrante deste trabalho. Foram estudados exemplos de interações e formas como o utilizador vive a experiência durante a utilização de aplicações que partilham o mesmo tipo de tecnologias utilizadas neste projeto. O objetivo final foca-se na criação de uma aplicação, capaz de fornecer uma experiência enriquecedora no âmbito do ensino, ligado ao tema história e que consiga fundamentar a criação de um modelo que facilite a aprendizagem utilizando plataformas móveis. Os objetivos são corroborados por um conjunto de testes efetuados à aplicação e pelos resultados obtidos através de um questionário feito a um grupo de pessoas que testaram o protótipo.
Resumo:
Text file evaluation is an emergent topic in e-learning that responds to the shortcomings of the assessment based on questions with predefined answers. Questions with predefined answers are formalized in languages such as IMS Question & Test Interoperability Specification (QTI) and supported by many e-learning systems. Complex evaluation domains justify the development of specialized evaluators that participate in several business processes. The goal of this paper is to formalize the concept of a text file evaluation in the scope of the E-Framework – a service oriented framework for development of e-learning systems maintained by a community of practice. The contribution includes an abstract service type and a service usage model. The former describes the generic capabilities of a text file evaluation service. The later is a business process involving a set of services such as repositories of learning objects and learning management systems.
Resumo:
Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica
Resumo:
IEEE International Symposium on Circuits and Systems, pp. 2713 – 2716, Seattle, EUA
Resumo:
Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica
Resumo:
Dissertação de Doutoramento em Matemática: Processos Estocásticos
Resumo:
Reconfigurable computing experienced a considerable expansion in the last few years, due in part to the fast run-time partial reconfiguration features offered by recent SRAM-based Field Programmable Gate Arrays (FPGAs), which allowed the implementation in real-time of dynamic resource allocation strategies, with multiple independent functions from different applications sharing the same logic resources in the space and temporal domains. However, when the sequence of reconfigurations to be performed is not predictable, the efficient management of the logic space available becomes the greatest challenge posed to these systems. Resource allocation decisions have to be made concurrently with system operation, taking into account function priorities and optimizing the space currently available. As a consequence of the unpredictability of this allocation procedure, the logic space becomes fragmented, with many small areas of free resources failing to satisfy most requests and so remaining unused. A rearrangement of the currently running functions is therefore necessary, so as to obtain enough contiguous space to implement incoming functions, avoiding the spreading of their components and the resulting degradation of system performance. A novel active relocation procedure for Configurable Logic Blocks (CLBs) is herein presented, able to carry out online rearrangements, defragmenting the available FPGA resources without disturbing functions currently running.
Resumo:
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática
Resumo:
Mestrado em Radiações Aplicadas às Tecnologias da Saúde
Resumo:
An experimental and numerical investigation into the shear strength behaviour of adhesive single lap joints (SLJs) was carried out in order to understand the effect of temperature on the joint strength. The adherend material used for the experimental tests was an aluminium alloy in the form of thin sheets, and the adhesive used was a high-strength high temperature epoxy. Tensile tests as a function of temperature were performed and numerical predictions based on the use of a bilinear cohesive damage model were obtained. It is shown that at temperatures below Tg, the lap shear strength of SLJs increased, while at temperatures above Tg, a drastic drop in the lap shear strength was observed. Comparison between the experimental and numerical maximum loads representing the strength of the joints shows a reasonably good agreement.
Resumo:
The preliminary results from a bipolar industrial solidstate based Marx generator, developed for the food industry, capable of delivering 25 kV/250 A positive and negative pulses with 12 kW average power, are presented and discussed. This modular topology uses only four controlled switches per cell, 27 cells in total that can be charged up to 1000V each, the two extra cells are used for droop compensation. The triggering signals for all the switches are generated by a FPGA. Considering that biomaterials are similar to resistive type loads, experimental results from this new bipolar 25 kV modulator into resistive loads are presented and discussed.
Resumo:
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.