A hybrid MLS technique for room impulse response estimation

The measurement of room impulse response (RIR) when there are high background noise levels frequently means one must deal with very low signal-to-noise ratios (SNR). if such is the case, the measurement might yield unreliable results, even when synchronous averaging techniques are used. Furthermore, if there are non-linearities in the apparatus or system time variances, the final SNR can be severely degraded. The test signals used in RIR measurement are often disturbed by non-stationary ambient noise components. A novel approach based on the energy analysis of ambient noise - both in the time and in frequency - was considered. A modified maximum length sequence (MLS) measurement technique. referred to herein as the hybrid MLS technique, was developed for use in room acoustics. The technique consists of reducing the noise energy of the captured sequences before applying the averaging technique in order to improve the overall SNRs and frequency response accuracy. Experiments were conducted under real conditions with different types of underlying ambient noises. Results are shown and discussed. Advantages and disadvantages of the hybrid MLS technique over standard MLS technique are evaluated and discussed. Our findings show that the new technique leads to a significant increase in the overall SNR. (C) 2008 Elsevier Ltd. All rights reserved.

ECG denoising based on adaptive signal processing technique

An Electrocardiogram (ECG) monitoring system deals with several challenges related with noise sources. The main goal of this text was the study of Adaptive Signal Processing Algorithms for ECG noise reduction when applied to real signals. This document presents an adaptive ltering technique based on Least Mean Square (LMS) algorithm to remove the artefacts caused by electromyography (EMG) and power line noise into ECG signal. For this experiments it was used real noise signals, mainly to observe the di erence between real noise and simulated noise sources. It was obtained very good results due to the ability of noise removing that can be reached with this technique. A recolha de sinais electrocardiogr a cos (ECG) sofre de diversos problemas relacionados com ru dos. O objectivo deste trabalho foi o estudo de algoritmos adaptativos para processamento digital de sinal, para redu c~ao de ru do em sinais ECG reais. Este texto apresenta uma t ecnica de redu c~ao de ru do baseada no algoritmo Least Mean Square (LMS) para remo c~ao de ru dos causados quer pela actividade muscular (EMG) quer por ru dos causados pela rede de energia el ectrica. Para as experiencias foram utilizados ru dos reais, principalmente para aferir a diferen ca de performance do algoritmo entre os sinais reais e os simulados. Foram conseguidos bons resultados, essencialmente devido as excelentes caracter sticas que esta t ecnica tem para remover ru dos.

Development of triplet repeat primed PCR (TP-PCR) technique as a support of molecular test in Machado-Joseph disease

Dissertação de Mestrado, Ciências Biomédicas, 3 de Fevereiro de 2016, Universidade dos Açores.

Parallel implementation of vertex component analysis for hyperspectral endmember extraction

International Conference with Peer Review 2012 IEEE International Conference in Geoscience and Remote Sensing Symposium (IGARSS), 22-27 July 2012, Munich, Germany

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.

Does diaphragmatic breathing technique really improve its range of motion? An objective assessment

Purpose - To verify the results of a diaphragmatic breathing technique (DBT) on diaphragmatic range of motion in healthy subjects. Methods - A total of 51 healthy subjects (10 male; 41 female), mean age 20 years old and a body mass index (BMI) ranging from 15.6 to 34.9 kg/m2, were enrolled in this study. Diaphragmatic range of motion was assessed by M-mode ultrasound imaging. Measurements were made before and after the DBT implementation in a standard protocol, based on 3 seconds of inspiration starting from a maximum expiration. Differences between assessments were analyzed by descriptive statistics and t-test (p < 0.05). Results - Mean value range of motion before DBT was 55.3 ± 13.4 mm and after DBT was 63.8 ± 13.2 mm showing a significant improvement of 8.5 ± 14.7 mm (p < 0.001). A strong correlation between the slope and the range of motion was found (r = 0.71, p < 0.001). Conclusions - Based on ultrasound measurements, it has been proved that DBT really contributes to a higher diaphragmatic range of motion. Future studies are needed in order to understand the influence of protocol parameters (e.g. inspiration time). Clinical implications - In the contest of evidence-based practice in physiotherapy, it has been showed by objective measurements that DBT improves the diaphragm range of motion, translating into a more efficient ventilatory function and thus can be used in clinical setting. To our knowledge this is the first study to assess the effects of DBT on range of motion of diaphragm muscle with ultrasound imaging.

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.

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.

Parallel real-time support for distributed adaptive embedded applications

Real-time embedded applications require to process large amounts of data within small time windows. Parallelize and distribute workloads adaptively is suitable solution for computational demanding applications. The purpose of the Parallel Real-Time Framework for distributed adaptive embedded systems is to guarantee local and distributed processing of real-time applications. This work identifies some promising research directions for parallel/distributed real-time embedded applications.

A framework for the development of parallel and distributed real-time embedded systems

Embedded real-time applications increasingly present high computation requirements, which need to be completed within specific deadlines, but that present highly variable patterns, depending on the set of data available in a determined instant. The current trend to provide parallel processing in the embedded domain allows providing higher processing power; however, it does not address the variability in the processing pattern. Dimensioning each device for its worst-case scenario implies lower average utilization, and increased available, but unusable, processing in the overall system. A solution for this problem is to extend the parallel execution of the applications, allowing networked nodes to distribute the workload, on peak situations, to neighbour nodes. In this context, this report proposes a framework to develop parallel and distributed real-time embedded applications, transparently using OpenMP and Message Passing Interface (MPI), within a programming model based on OpenMP. The technical report also devises an integrated timing model, which enables the structured reasoning on the timing behaviour of these hybrid architectures.

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.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

A parallel programming model for ada

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.

Parallel hyperspectral unmixing on GPUs

This letter presents a new parallel method for hyperspectral unmixing composed by the efficient combination of two popular methods: vertex component analysis (VCA) and sparse unmixing by variable splitting and augmented Lagrangian (SUNSAL). First, VCA extracts the endmember signatures, and then, SUNSAL is used to estimate the abundance fractions. Both techniques are highly parallelizable, which significantly reduces the computing time. A design for the commodity graphics processing units of the two methods is presented and evaluated. Experimental results obtained for simulated and real hyperspectral data sets reveal speedups up to 100 times, which grants real-time response required by many remotely sensed hyperspectral applications.