Sensitivity of the Amazon biome to high resolution climate change projections

ABSTRACT: Despite the reduction in deforestation rate in recent years, the impact of global warming by itself can cause changes in vegetation cover. The objective of this work was to investigate the possible changes on the major Brazilian biome, the Amazon Rainforest, under different climate change scenarios. The dynamic vegetation models may simulate changes in vegetation distribution and the biogeochemical processes due to climate change. Initially, the Inland dynamic vegetation model was forced with initial and boundary conditions provided by CFSR and the Eta regional climate model driven by the historical simulation of HadGEM2-ES. These simulations were validated using the Santarém tower data. In the second part, we assess the impact of a future climate change on the Amazon biome by applying the Inland model forced with regional climate change projections. The projections show that some areas of rainforest in the Amazon region are replaced by deciduous forest type and grassland in RCP4.5 scenario and only by grassland in RCP8.5 scenario at the end of this century. The model indicates a reduction of approximately 9% in the area of tropical forest in RCP4.5 scenario and a further reduction in the RCP8.5 scenario of about 50% in the eastern region of Amazon. Although the increase of CO2 atmospheric concentration may favour the growth of trees, the projections of Eta-HadGEM2-ES show increase of temperature and reduction of rainfall in the Amazon region, which caused the forest degradation in these simulations.

Aceleración de Algoritmos en Procesadores Multicore, GPGPU y FPGA. Algorithm Acceleration with Multicore, GPGPU and FPGA Processors.

El avance en la potencia de cómputo en nuestros días viene dado por la paralelización del procesamiento, dadas las características que disponen las nuevas arquitecturas de hardware. Utilizar convenientemente este hardware impacta en la aceleración de los algoritmos en ejecución (programas). Sin embargo, convertir de forma adecuada el algoritmo en su forma paralela es complejo, y a su vez, esta forma, es específica para cada tipo de hardware paralelo. En la actualidad los procesadores de uso general más comunes son los multicore, procesadores paralelos, también denominados Symmetric Multi-Processors (SMP). Hoy en día es difícil hallar un procesador para computadoras de escritorio que no tengan algún tipo de paralelismo del caracterizado por los SMP, siendo la tendencia de desarrollo, que cada día nos encontremos con procesadores con mayor numero de cores disponibles. Por otro lado, los dispositivos de procesamiento de video (Graphics Processor Units - GPU), a su vez, han ido desarrollando su potencia de cómputo por medio de disponer de múltiples unidades de procesamiento dentro de su composición electrónica, a tal punto que en la actualidad no es difícil encontrar placas de GPU con capacidad de 200 a 400 hilos de procesamiento paralelo. Estos procesadores son muy veloces y específicos para la tarea que fueron desarrollados, principalmente el procesamiento de video. Sin embargo, como este tipo de procesadores tiene muchos puntos en común con el procesamiento científico, estos dispositivos han ido reorientándose con el nombre de General Processing Graphics Processor Unit (GPGPU). A diferencia de los procesadores SMP señalados anteriormente, las GPGPU no son de propósito general y tienen sus complicaciones para uso general debido al límite en la cantidad de memoria que cada placa puede disponer y al tipo de procesamiento paralelo que debe realizar para poder ser productiva su utilización. Los dispositivos de lógica programable, FPGA, son dispositivos capaces de realizar grandes cantidades de operaciones en paralelo, por lo que pueden ser usados para la implementación de algoritmos específicos, aprovechando el paralelismo que estas ofrecen. Su inconveniente viene derivado de la complejidad para la programación y el testing del algoritmo instanciado en el dispositivo. Ante esta diversidad de procesadores paralelos, el objetivo de nuestro trabajo está enfocado en analizar las características especificas que cada uno de estos tienen, y su impacto en la estructura de los algoritmos para que su utilización pueda obtener rendimientos de procesamiento acordes al número de recursos utilizados y combinarlos de forma tal que su complementación sea benéfica. Específicamente, partiendo desde las características del hardware, determinar las propiedades que el algoritmo paralelo debe tener para poder ser acelerado. Las características de los algoritmos paralelos determinará a su vez cuál de estos nuevos tipos de hardware son los mas adecuados para su instanciación. En particular serán tenidos en cuenta el nivel de dependencia de datos, la necesidad de realizar sincronizaciones durante el procesamiento paralelo, el tamaño de datos a procesar y la complejidad de la programación paralela en cada tipo de hardware. Today´s advances in high-performance computing are driven by parallel processing capabilities of available hardware architectures. These architectures enable the acceleration of algorithms when thes ealgorithms are properly parallelized and exploit the specific processing power of the underneath architecture. Most current processors are targeted for general pruposes and integrate several processor cores on a single chip, resulting in what is known as a Symmetric Multiprocessing (SMP) unit. Nowadays even desktop computers make use of multicore processors. Meanwhile, the industry trend is to increase the number of integrated rocessor cores as technology matures. On the other hand, Graphics Processor Units (GPU), originally designed to handle only video processing, have emerged as interesting alternatives to implement algorithm acceleration. Current available GPUs are able to implement from 200 to 400 threads for parallel processing. Scientific computing can be implemented in these hardware thanks to the programability of new GPUs that have been denoted as General Processing Graphics Processor Units (GPGPU).However, GPGPU offer little memory with respect to that available for general-prupose processors; thus, the implementation of algorithms need to be addressed carefully. Finally, Field Programmable Gate Arrays (FPGA) are programmable devices which can implement hardware logic with low latency, high parallelism and deep pipelines. Thes devices can be used to implement specific algorithms that need to run at very high speeds. However, their programmability is harder that software approaches and debugging is typically time-consuming. In this context where several alternatives for speeding up algorithms are available, our work aims at determining the main features of thes architectures and developing the required know-how to accelerate algorithm execution on them. We look at identifying those algorithms that may fit better on a given architecture as well as compleme

Controlled resolution reconstruction of one-dimensional permittivity profiles

Electromagnetic scattering inverse problems, microwave imaging, reconstruction of dielectric media, remote sensing, tomography

A Novel Algorithm to Quantify Coronary Remodeling Using Inferred Normal Dimensions

Background:Vascular remodeling, the dynamic dimensional change in face of stress, can assume different directions as well as magnitudes in atherosclerotic disease. Classical measurements rely on reference to segments at a distance, risking inappropriate comparison between dislike vessel portions.Objective:to explore a new method for quantifying vessel remodeling, based on the comparison between a given target segment and its inferred normal dimensions.Methods:Geometric parameters and plaque composition were determined in 67 patients using three-vessel intravascular ultrasound with virtual histology (IVUS-VH). Coronary vessel remodeling at cross-section (n = 27.639) and lesion (n = 618) levels was assessed using classical metrics and a novel analytic algorithm based on the fractional vessel remodeling index (FVRI), which quantifies the total change in arterial wall dimensions related to the estimated normal dimension of the vessel. A prediction model was built to estimate the normal dimension of the vessel for calculation of FVRI.Results:According to the new algorithm, “Ectatic” remodeling pattern was least common, “Complete compensatory” remodeling was present in approximately half of the instances, and “Negative” and “Incomplete compensatory” remodeling types were detected in the remaining. Compared to a traditional diagnostic scheme, FVRI-based classification seemed to better discriminate plaque composition by IVUS-VH.Conclusion:Quantitative assessment of coronary remodeling using target segment dimensions offers a promising approach to evaluate the vessel response to plaque growth/regression.

Wideband impedance spectrum analyzer with arbitry fine frequency resolution for in situ sensor applications

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2009

Analysis of the European Union's performance as an international mediator in the South Caucasus with respect to peace building in the region : ENP and conflict resolution in the South Caucasus

Magdeburg, Univ., Fak. für Geistes-, Sozial- und Erziehungswiss., Diss., 2009

Algorithm engineering for expression dag based number types

Magdeburg, Univ., Fak. für Informatik, Diss., 2015

Ultra-high resolution imaging of the functional anatomy and plasticity of the human hippocampal-entorhinal circuitry

Magdeburg, Univ., Fak. für Naturwiss., Diss., 2015

A model-based cortical parcellation scheme for high-resolution 7 Tesla MRI data

Magdeburg, Univ., Fak. für Informatik, Diss., 2015

A note on parallelizing the parameterized expectations algorithm

The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.

Creating the Gorizia-Goriska euroregion: an European cross-border administrative model for integrated socio-economic development in the upper adriatic. Crossborder co-operation as a tool for trans-national integration and conflict resolution

Contribució al Seminari: "Les Euroregions: Experiències i aprenatges per a l’Euroregió Pirineus-Mediterrània", 15-16 de desembre de 2005

High-resolution magnetic resonance imaging quantitatively detects individual pancreatic islets.

OBJECTIVE-We studied whether manganese-enhanced high-field magnetic resonance (MR) imaging (MEHFMRI) could quantitatively detect individual islets in situ and in vivo and evaluate changes in a model of experimental diabetes.RESEARCH DESIGN AND METHODS-Whole pancreata from untreated (n = 3), MnCl(2) and glucose-injected mice (n = 6), and mice injected with either streptozotocin (STZ; n = 4) or citrate buffer (n = 4) were imaged ex vivo for unambiguous evaluation of islets. Exteriorized pancreata of MnCl(2) and glucose-injected mice (n = 6) were imaged in vivo to directly visualize the gland and minimize movements. In all cases, MR images were acquired in a 14.1 Testa scanner and correlated with the corresponding (immuno)histological sections.RESULTS-In ex vivo experiments, MEHFMRI distinguished different pancreatic tissues and evaluated the relative abundance of islets in the pancreata of normoglycemic mice. MEHFMRI also detected a significant decrease in the numerical and volume density of islets in STZ-injected mice. However, in the latter measurements the loss of beta-cells was undervalued under the conditions tested. The experiments on the externalized pancreata confirmed that MEHFMRI could visualize native individual islets in living, anesthetized mice.CONCLUSIONS-Data show that MEHFMRI quantitatively visualizes individual islets in the intact mouse pancreas, both ex vivo and in vivo. Diabetes 60:2853-2860, 2011

Modelo de un grupo de robots colaboradores cazadores

El nombre d'aplicacions dels microrobots en biomedicina creix a mesura que el seu desenvolupament avança. Entre elles hi ha les consistents a examinar cèl·lules amb microrobots cooperants. En aquest treball es presenta un prototip a escala d'aquest problema, convenientment simplificat: dos robots tracten d'agafar una pilota que representa la cèl·lula que s'examina. Com a resultat, s'ha obtingut un algorisme deliberatiu per a la resolució d'aquest problema amb robots homogenis.