Space-time monitoring of prescribed burnt soils performance – an effective tool for forest management

Among the most important measures to prevent wild forest fires is the use of prescribed and controlled burning actions in order to reduce the availability of fuel mass. However, the impact of these activities on soil physical and chemical properties varies according to the type of both soil and vegetation and is not fully understood. Therefore, soil monitoring campaigns are often used to measure these impacts. In this paper we have successfully used three statistical data treatments - the Kolmogorov-Smirnov test followed by the ANOVA and the Kruskall-Wallis tests – to investigate the variability among the soil pH, soil moisture, soil organic matter and soil iron variables for different monitoring times and sampling procedures.

Efficient Legendre spectral tau algorithm for solving two-sided space-time Caputo fractional advection-dispersion equation

In this paper we present the operational matrices of the left Caputo fractional derivative, right Caputo fractional derivative and Riemann–Liouville fractional integral for shifted Legendre polynomials. We develop an accurate numerical algorithm to solve the two-sided space–time fractional advection–dispersion equation (FADE) based on a spectral shifted Legendre tau (SLT) method in combination with the derived shifted Legendre operational matrices. The fractional derivatives are described in the Caputo sense. We propose a spectral SLT method, both in temporal and spatial discretizations for the two-sided space–time FADE. This technique reduces the two-sided space–time FADE to a system of algebraic equations that simplifies the problem. Numerical results carried out to confirm the spectral accuracy and efficiency of the proposed algorithm. By selecting relatively few Legendre polynomial degrees, we are able to get very accurate approximations, demonstrating the utility of the new approach over other numerical methods.

A Real-Time Optimization for 2R Manipulators

This work proposes a real-time algorithm to generate a trajectory for a 2 link planar robotic manipulator. The objective is to minimize the space/time ripple and the energy requirements or the time duration in the robot trajectories. The proposed method uses an off line genetic algorithm to calculate every possible trajectory between all cells of the workspace grid. The resultant trajectories are saved in several trees. Then any trajectory requested is constructed in real-time, from these trees. The article presents the results for several experiments.

Videovigilância, compressão e criptografia

Mestrado em Engenharia Electrotécnica e de Computadores

Contraste e alteridade na viagem contemporânea

No mundo contemporâneo globalizado, definido pela sua qualidade essencialmente fluida e instável, o carácter distintivo da viagem parece dissolver-se face à contracção do planeta, à economia das ―trocas simbólicas‖ e a um alegado processo de diluição das diferenças e de homogeneização cultural. Com efeito, a mediatização da sociedade e a proliferação icónica contemporâneas produzem um aparente estado de saturação da geografia real e de multiplicação de lugares enquanto representações e imagens, permitindo pôr em causa a própria necessidade e urgência de deslocação, bem como admitir a abolição do ―estatuto de privilégio‖ de certos lugares e a derradeira quebra no conceito aurático das férias e das viagens, tradicionalmente assente em antinomias cruciais entre o quotidiano/familiar e o diferente/extraordinário. O presente artigo propõe-se abordar o paradigma da mobilidade contemporânea, nomeadamente no que diz respeito à traumática aniquilação do espaço e do tempo e ao seu impacto fortemente disruptivo sobre a dimensão ontológica de uma prática cultural cujo poder aurático se encontra tradicionalmente relacionado com a conquista de distâncias, a percepção de diferenças e a experiência de alteridade. O artigo pretende, por outro lado, refutar a declaração pós-moderna de que a familiarização com o outro conduz a uma diminuição do potencial de choque cultural no turismo contemporâneo, discutindo a relevância e a prevalência da busca de contraste e formas de vivência de alteridade no complexo novelo de motivações da viagem turística contemporânea.

Planeamento da construção repetitiva e não repetitiva – Caso de estudo comparativo

O planeamento da construção tem sido considerado como uma mera burocracia e utilizado essencialmente como uma orientação temporal do desenvolvimento da obra, que se reflete, frequentes vezes, na utilização inadequada das técnicas de planeamento. Com esta dissertação pretende-se oferecer uma nova perspectiva sobre as técnicas e softwares de planeamento e a sua melhor utilização. Contudo, focalizando-se mais nos métodos CPM e LOB, efetua-se o seu planeamento nos softwares Microsoft Project e CCS- Candy respetivamente. Inicia-se este trabalho com uma breve descrição acerca do estado da arte das metodologias e softwares de planeamento da construção. Seguidamente efetua-se a demonstração do planeamento de dois casos de estudo, sendo o primeiro caso de estudo referente ao planeamento da construção de uma ponte com recurso ao Microsoft Project. Realiza-se o cálculo dos rendimentos, dimensionamentos das equipas de trabalho e análise dos diagramas de planeamento fornecido pelo Microsoft Project. No segundo caso de estudo, demonstra-se o planeamento da estrutura de dois edifícios no software CCS - Candy. Efetua-se igualmente o cálculo dos rendimentos, dimensionamento das equipas de trabalho e análise, essencialmente, do Gráfico Espaço/Tempo (LOB). Após a realização do planeamento dos dois casos de estudo, realiza-se uma pequena comparação das duas metodologias, CPM e LOB, referenciando as vantagens e desvantagens da sua utilização no planeamento de obras, seguido de uma breve conclusão. Termina-se esta dissertação com a apresentação das conclusões gerais e das propostas para trabalhos futuros.

Multidimensional scaling visualization of earthquake phenomena

Earthquakes are associated with negative events, such as large number of casualties, destruction of buildings and infrastructures, or emergence of tsunamis. In this paper, we apply the Multidimensional Scaling (MDS) analysis to earthquake data. MDS is a set of techniques that produce spatial or geometric representations of complex objects, such that, objects perceived to be similar/distinct in some sense are placed nearby/distant on the MDS maps. The interpretation of the charts is based on the resulting clusters since MDS produces a different locus for each similarity measure. In this study, over three million seismic occurrences, covering the period from January 1, 1904 up to March 14, 2012 are analyzed. The events, characterized by their magnitude and spatiotemporal distributions, are divided into groups, either according to the Flinn–Engdahl seismic regions of Earth or using a rectangular grid based in latitude and longitude coordinates. Space-time and Space-frequency correlation indices are proposed to quantify the similarities among events. MDS has the advantage of avoiding sensitivity to the non-uniform spatial distribution of seismic data, resulting from poorly instrumented areas, and is well suited for accessing dynamics of complex systems. MDS maps are proven as an intuitive and useful visual representation of the complex relationships that are present among seismic events, which may not be perceived on traditional geographic maps. Therefore, MDS constitutes a valid alternative to classic visualization tools, for understanding the global behavior of earthquakes.

Relatório de Estágio de Qualificação Profissional

No âmbito do Mestrado em Educação Pré-Escolar e Ensino do 1.ºCiclo do Ensino Básico, desenvolveu-se o presente relatório de qualificação profissional, em que será analisada de forma reflexiva a Prática Pedagógica Supervisionada da mestranda, em contexto da Educação Pré-Escolar. O objetivo fulcral da desta intervenção em contexto educativo consistiu em promover a construção de aprendizagens que permitissem uma tomada de consciência do compromisso e responsabilidade atribuída ao Educador de Infância. A formanda teve oportunidade de desenvolver um perfil próprio enquanto futura Educadora de Infância, tendo como base as Orientações Curriculares para a Educação Pré-Escolar, num processo ativo de investigação-ação. Comparando a ação educativa da formanda em momentos iniciais do estágio, com momentos já mais avançados neste processo, reconhece-se uma evolução nas dimensões da observação, planificação, ação, reflexão e avaliação, que compõem o ciclo reflexivo da metodologia supracitada, evolução essa que resultou num progressivo desenvolvimento de competência profissionais. Durante a intervenção no contexto educativo, a formanda recorreu a estratégias e instrumentos de reflexão, nomeadamente os guiões de pré- observação, as planificações, as narrativas colaborativas, os diários de formação, as notas de campo e as reuniões com o Supervisor Institucional, a Educadora Cooperante e a díade de formação. A organização do ambiente educativo consistiu numa das preocupações da formanda, que procurou atender à necessidade de organizar de forma flexível o espaço, tempo e grupo.

On-line defragmentation for run-time partially reconfigurable FPGAs

Dynamically reconfigurable systems have benefited from a new class of FPGAs recently introduced into the market, which allow partial and dynamic reconfiguration at run-time, enabling multiple independent functions from different applications to share the same device, swapping resources as needed. When the sequence of tasks to be performed is not predictable, resource allocation decisions have to be made on-line, fragmenting the FPGA logic space. A rearrangement may be necessary to get enough contiguous space to efficiently implement incoming functions, to avoid spreading their components and, as a result, degrading their performance. This paper presents a novel active replication mechanism for configurable logic blocks (CLBs), able to implement on-line rearrangements, defragmenting the available FPGA resources without disturbing those functions that are currently running.

Run-time defragmentation for dynamically reconfigurable hardware

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.

Fractional State Space Analysis of Temperature Time Series

Atmospheric temperatures characterize Earth as a slow dynamics spatiotemporal system, revealing long-memory and complex behavior. Temperature time series of 54 worldwide geographic locations are considered as representative of the Earth weather dynamics. These data are then interpreted as the time evolution of a set of state space variables describing a complex system. The data are analyzed by means of multidimensional scaling (MDS), and the fractional state space portrait (fSSP). A centennial perspective covering the period from 1910 to 2012 allows MDS to identify similarities among different Earth’s locations. The multivariate mutual information is proposed to determine the “optimal” order of the time derivative for the fSSP representation. The fSSP emerges as a valuable alternative for visualizing system dynamics.

Fractional dynamics of genetic algorithms using hexagonal space tessellation

The paper formulates a genetic algorithm that evolves two types of objects in a plane. The fitness function promotes a relationship between the objects that is optimal when some kind of interface between them occurs. Furthermore, the algorithm adopts an hexagonal tessellation of the two-dimensional space for promoting an efficient method of the neighbour modelling. The genetic algorithm produces special patterns with resemblances to those revealed in percolation phenomena or in the symbiosis found in lichens. Besides the analysis of the spacial layout, a modelling of the time evolution is performed by adopting a distance measure and the modelling in the Fourier domain in the perspective of fractional calculus. The results reveal a consistent, and easy to interpret, set of model parameters for distinct operating conditions.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

SPARTS: simulator for power aware and real-time systems

Real-time systems demand guaranteed and predictable run-time behaviour in order to ensure that no task has missed its deadline. Over the years we are witnessing an ever increasing demand for functionality enhancements in the embedded real-time systems. Along with the functionalities, the design itself grows more complex. Posed constraints, such as energy consumption, time, and space bounds, also require attention and proper handling. Additionally, efficient scheduling algorithms, as proven through analyses and simulations, often impose requirements that have significant run-time cost, specially in the context of multi-core systems. In order to further investigate the behaviour of such systems to quantify and compare these overheads involved, we have developed the SPARTS, a simulator of a generic embedded real- time device. The tasks in the simulator are described by externally visible parameters (e.g. minimum inter-arrival, sporadicity, WCET, BCET, etc.), rather than the code of the tasks. While our current implementation is primarily focused on our immediate needs in the area of power-aware scheduling, it is designed to be extensible to accommodate different task properties, scheduling algorithms and/or hardware models for the application in wide variety of simulations. The source code of the SPARTS is available for download at [1].

Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known realtime scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.