The influence of the blood pressure on the venous cerebral flow measured by magnetic susceptibility (SWI) technique

Susceptibility Weighted Image (SWI) is a Magnetic Resonance Imaging (MRI) technique that combines high spatial resolution and sensitivity to provide magnetic susceptibility differences between tissues. It is extremely sensitive to venous blood due to its iron content of deoxyhemoglobin. The aim of this study was to evaluate, through the SWI technique, the differences in cerebral venous vasculature according to the variation of blood pressure values. 20 subjects divided in two groups (10 hypertensive and 10 normotensive patients) underwent a MRI system with a Siemens® scanner model Avanto of 1.5T using a synergy head coil (4 channels). The obtained sequences were T1w, T2w-FLAIR, T2* and SWI. The value of Contrast-to-Noise Ratio (CNR) was assessed in MinIP (Minimum Intensity Projection) and Magnitude images, through drawing free hand ROIs in venous structures: Superior Sagittal Sinus (SSS) Internal Cerebral Vein (ICV) and Sinus Confluence (SC). The obtained values were presented in descriptive statistics-quartiles and extremes diagrams. The results were compared between groups. CNR shown higher values for normotensive group in MinIP (108.89 ± 6.907) to ICV; (238.73 ± 18.556) to SC and (239.384 ± 52.303) to SSS. These values are bigger than images from Hypertensive group about 46 a.u. in average. Comparing the results of Magnitude and MinIP images, there were obtained lower CNR values for the hypertensive group. There were differences in the CNR values between both groups, being these values more expressive in the large vessels-SSS and SC. The SWI is a potential technique to evaluate and characterize the blood pressure variation in the studied vessels adding a physiological perspective to MRI and giving a new approach to the radiological vascular studies.

Dominant set approach to ECG biometrics

Electrocardiographic (ECG) signals are emerging as a recent trend in the field of biometrics. In this paper, we propose a novel ECG biometric system that combines clustering and classification methodologies. Our approach is based on dominant-set clustering, and provides a framework for outlier removal and template selection. It enhances the typical workflows, by making them better suited to new ECG acquisition paradigms that use fingers or hand palms, which lead to signals with lower signal to noise ratio, and more prone to noise artifacts. Preliminary results show the potential of the approach, helping to further validate the highly usable setups and ECG signals as a complementary biometric modality.

Sistema de treino para pilotos de parapente

Mestrado em Engenharia Electrotécnica – Sistemas Eléctricos de Energia

Six thinking hats for electricity markets simulation: adapting meeting tools to agent decision

In almost all industrialized countries, the energy sector has suffered a severe restructuring that originated a greater complexity in market players’ interactions. The complexity that these changes brought made way for the creation of decision support tools that facilitate the study and understanding of these markets. MASCEM – “Multiagent Simulator for Competitive Electricity Markets” arose in this context providing a framework for evaluating new rules, new behaviour, and new participants in deregulated electricity markets. MASCEM uses game theory, machine learning techniques, scenario analysis and optimisation techniques to model market agents and to provide them with decision-support. ALBidS is a multiagent system created to provide decision support to market negotiating players. Fully integrated with MASCEM it considers several different methodologies based on very distinct approaches. The Six Thinking Hats is a powerful technique used to look at decisions from different perspectives. This tool’s goal is to force the thinker to move outside his habitual thinking style. It was developed to be used mainly at meetings in order to “run better meetings, make faster decisions”. This dissertation presents a study about the applicability of the Six Thinking Hats technique in Decision Support Systems, particularly with the multiagent paradigm like the MASCEM simulator. As such this work’s proposal is of a new agent, a meta-learner based on STH technique that organizes several different ALBidS’ strategies and combines the distinct answers into a single one that, expectedly, out-performs any of them.

Optimization of QuEChERS procedure coupled to GC-ECD for organochlorine pesticide determination in carrot samples

An optimised version of the Quick, Easy, Cheap, Effective, Rugged and Safe (QuEChERS) method for simultaneous determination of 14 organochlorine pesticides in carrots was developed using gas chromatography coupled with electron-capture detector (GC-ECD) and confirmation by gas chromatography tandem mass spectrometry (GC-MS/MS). A citrate-buffered version of QuEChERS was applied for the extraction of the organochlorine pesticides, and for the extract clean-up, primary secondary amine, octadecyl-bonded silica (C18), magnesium sulphate (MgSO4) and graphitized carbon black were used as sorbents. The GC-ECD determination of the target compounds was achieved in less than 20 min. The limits of detection were below the EUmaximum residue limits (MRLs) for carrots, 10–50 μg kg−1, while the limit of quantification did exceed 10 μg kg−1 for hexachlorobenzene (HCB). The introduction of a sonication step was shown to improve the recoveries. The overall average recoveries in carrots, at the four tested levels (60, 80, 100 and 140 μg kg−1), ranged from 66 to 111% with relative standard deviations in the range of 2– 15 % (n03) for all analytes, with the exception of HCB. The method has been applied to the analysis of 21 carrot samples from different Portuguese regions, and β-HCH was the pesticide most frequently found, with concentrations oscillating between less than the limit of quantification to 14.6 μg kg−1. Only one sample had a pesticide residue (β-HCH) above the MRL, 14.6 μg kg−1. This methodology combines the advantages of both QuEChERS and GC-ECD, producing a very rapid, sensitive and reliable procedure which can be applied in routine analytical laboratories.

Precursors’ order effect on the properties of sulfurized Cu2ZnSnS4 thin films

A dc magnetron sputtering-based method to grow high-quality Cu2ZnSnS4 (CZTS) thin films, to be used as an absorber layer in solar cells, is being developed. This method combines dc sputtering of metallic precursors with sulfurization in S vapour and with post-growth KCN treatment for removal of possible undesired Cu2−xS phases. In this work, we report the results of a study of the effects of changing the precursors’ deposition order on the final CZTS films’ morphological and structural properties. The effect of KCN treatment on the optical properties was also analysed through diffuse reflectance measurements. Morphological, compositional and structural analyses of the various stages of the growth have been performed using stylus profilometry, SEM/EDS analysis, XRD and Raman Spectroscopy. Diffuse reflectance studies have been done in order to estimate the band gap energy of the CZTS films. We tested two different deposition orders for the copper precursor, namely Mo/Zn/Cu/Sn and Mo/Zn/Sn/Cu. The stylus profilometry analysis shows high average surface roughness in the ranges 300–550 nm and 230–250 nm before and after KCN treatment, respectively. All XRD spectra show preferential growth orientation along (1 1 2) at 28.45◦. Raman spectroscopy shows main peaks at 338 cm−1 and 287 cm−1 which are attributed to Cu2ZnSnS4. These measurements also confirm the effectiveness of KCN treatment in removing Cu2−xS phases. From the analysis of the diffuse reflectance measurements the band gap energy for both precursors’ sequences is estimated to be close to 1.43 eV. The KCN-treated films show a better defined absorption edge; however, the band gap values are not significantly affected. Hot point probe measurements confirmed that CZTS had p-type semiconductor behaviour and C–V analysis was used to estimate the majority carrier density giving a value of 3.3 × 1018 cm−3.

Nonmonotone hybrid tabu search for inequalities and equalities: an experimental study

The main goal of this paper is to analyze the behavior of nonmono- tone hybrid tabu search approaches when solving systems of nonlinear inequalities and equalities through the global optimization of an appro- priate merit function. The algorithm combines global and local searches and uses a nonmonotone reduction of the merit function to choose the local search. Relaxing the condition aims to call the local search more often and reduces the overall computational e ort. Two variants of a perturbed pattern search method are implemented as local search. An experimental study involving a variety of problems available in the lit- erature is presented.

Melhoria da eficiência de amplificadores de potência para sinais RF com envolvente variável

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Electrónica e Telecomunicações

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Combining RTSJ with Fork/Join: a priority-based model

This paper discusses the increased need to support dynamic task-level parallelism in embedded real-time systems and proposes a Java framework that combines the Real-Time Specification for Java (RTSJ) with the Fork/Join (FJ) model, following a fixed priority-based scheduling scheme. Our work intends to support parallel runtimes that will coexist with a wide range of other complex independently developed applications, without any previous knowledge about their real execution requirements, number of parallel sub-tasks, and when those sub-tasks will be generated.

Reabilitação de um imóvel industrial em Marvila: projeto de investimento

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

A multi-objective approach for the motion planning of redundant manipulators

Kinematic redundancy occurs when a manipulator possesses more degrees of freedom than those required to execute a given task. Several kinematic techniques for redundant manipulators control the gripper through the pseudo-inverse of the Jacobian, but lead to a kind of chaotic inner motion with unpredictable arm configurations. Such algorithms are not easy to adapt to optimization schemes and, moreover, often there are multiple optimization objectives that can conflict between them. Unlike single optimization, where one attempts to find the best solution, in multi-objective optimization there is no single solution that is optimum with respect to all indices. Therefore, trajectory planning of redundant robots remains an important area of research and more efficient optimization algorithms are needed. This paper presents a new technique to solve the inverse kinematics of redundant manipulators, using a multi-objective genetic algorithm. This scheme combines the closed-loop pseudo-inverse method with a multi-objective genetic algorithm to control the joint positions. Simulations for manipulators with three or four rotational joints, considering the optimization of two objectives in a workspace without and with obstacles are developed. The results reveal that it is possible to choose several solutions from the Pareto optimal front according to the importance of each individual objective.

Entity localization and tracking: a sensor fusion-based mechanism in WSNs

Knowing exactly where a mobile entity is and monitoring its trajectory in real-time has recently attracted a lot of interests from both academia and industrial communities, due to the large number of applications it enables, nevertheless, it is nowadays one of the most challenging problems from scientific and technological standpoints. In this work we propose a tracking system based on the fusion of position estimations provided by different sources, that are combined together to get a final estimation that aims at providing improved accuracy with respect to those generated by each system individually. In particular, exploiting the availability of a Wireless Sensor Network as an infrastructure, a mobile entity equipped with an inertial system first gets the position estimation using both a Kalman Filter and a fully distributed positioning algorithm (the Enhanced Steepest Descent, we recently proposed), then combines the results using the Simple Convex Combination algorithm. Simulation results clearly show good performance in terms of the final accuracy achieved. Finally, the proposed technique is validated against real data taken from an inertial sensor provided by THALES ITALIA.