Implementação de um sistema de previsão e controlo para operação otimizada de um sistema de recolha e armazenamento de água pluvial

Dissertação de mestrado integrado em Engenharia Civil

Relacionamentos em MMORPGs: online e offline

Dissertação de mestrado em Comunicação, Arte e Cultura

"Quando sair, só quero trabalhar como aqui": perspetivas em torno da Reinserção Social das mulheres ciganas no pós-reclusão

Dissertação de mestrado em Crime, Diferença e Desigualdade

O Calcolítico e a Idade do Bronze na bacia do rio Neiva, NW de Portugal

Relatório de estágio de mestrado em Arqueologia

Newtonize this!: um jogo de computador para auxiliar os alunos do Ensino Básico e Secundário no estudo da Mecânica

Relatório da atividade profissional de mestrado em Ciências - Formação Contínua de Professores (área de especialização em Física e Química)

Intervenção de grupo em crianças com fendas lábio-palatinas: perspetiva clínica e perspetiva familiar

Dissertação de mestrado em Educação Especial (área de especialização em Intervenção Precoce)

Dentro e fora da sala de aula: espaços articulados de promoção da oralidade

Relatório de estágio de mestrado em Ensino de Inglês e de Espanhol no 3º Ciclo do Ensino Básico e no Ensino Secundário

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

Population genetic structure of brown crab (Cancer pagurus) in Irish waters

The brown crab (Cancer pagurus) fishery in Ireland is one of the most important financially and socio-economically, with the species worth approximately €15m per year in the first half of the decade. Only mackerel (Scomber scombrus) and Dublin Bay prawn (Nephrops norvegicus) are of greater value. Despite this, very little research has been conducted to describe the stock structure of brown crab on a national scale. In this study a country-wide assessment of genetic population structure was carried out. Sampling was conducted from commercial fishing boats from 11/06 to 04/08 at seven sample sites representing the central Irish brown crab fisheries, with one sample site from the UK also included in the study. Six microsatellite markers, specifically developed for brown crab, were used to assess genetic diversity and estimate population differentiation parameters. Significant genetic structuring was found using F-statistics (Fst = 0.007) and exact tests, but not with Bayesian methods. Samples from the UK and Wexford were found to be genetically distinct from all other populations. Three northern populations from Malm Head and Stanton Bank were genetically similar with Fst estimates suggesting connectivity between them. Also, Stanton Bank, again on the basis of Fst estimates, appeared to be connected to populations down the west coast of Ireland, as far south as Kerry. Two Galway samples, one inside and one outside of Galway Bay, were genetically differentiated despite their close geographic proximity. It is hypothesised that a persistent northerly summer current could transport pelagic larvae from populations along the southwest and west coasts of Ireland towards Stanton Bank in the North, resulting in the apparent connectivity observed in this study.

Multivariate Analysis for Animal Selection in Experimental Research

Background: Several researchers seek methods for the selection of homogeneous groups of animals in experimental studies, a fact justified because homogeneity is an indispensable prerequisite for casualization of treatments. The lack of robust methods that comply with statistical and biological principles is the reason why researchers use empirical or subjective methods, influencing their results. Objective: To develop a multivariate statistical model for the selection of a homogeneous group of animals for experimental research and to elaborate a computational package to use it. Methods: The set of echocardiographic data of 115 male Wistar rats with supravalvular aortic stenosis (AoS) was used as an example of model development. Initially, the data were standardized, and became dimensionless. Then, the variance matrix of the set was submitted to principal components analysis (PCA), aiming at reducing the parametric space and at retaining the relevant variability. That technique established a new Cartesian system into which the animals were allocated, and finally the confidence region (ellipsoid) was built for the profile of the animals’ homogeneous responses. The animals located inside the ellipsoid were considered as belonging to the homogeneous batch; those outside the ellipsoid were considered spurious. Results: The PCA established eight descriptive axes that represented the accumulated variance of the data set in 88.71%. The allocation of the animals in the new system and the construction of the confidence region revealed six spurious animals as compared to the homogeneous batch of 109 animals. Conclusion: The biometric criterion presented proved to be effective, because it considers the animal as a whole, analyzing jointly all parameters measured, in addition to having a small discard rate.

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.

Algorithm engineering for expression dag based number types

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

Nest site selection by Hypsiboas faber(Anura, Hylidae) in Southern Brazil

ABSTRACT Male gladiator frogs of Hypsiboas Wagler, 1830 build nests on available substrate surrounding ponds and streams where female spawn eggs during the breeding period. Although gladiator frogs seem to show plasticity in the way they construct their nests, there is no study reporting if these species present preferences about microhabitat conditions for nest-building (mainly under subtropical climate). Predation pressure and environmental conditions have been considered major processes shaping the great diversity of reproductive strategies performed by amphibians, but microhabitat conditions should explain where to build a nest as well as how nest looks. This study aimed to test nest site selection for nest-building by Hypsiboas faber(Wied-Neuwied, 1821), determining which factors are related to nest site selection and nest features. The survey was conducted at margins of two permanent ponds in Southern Brazil. Habitat factors were evaluated in 18 plots with nest and 18 plots in the surrounding without nest (control), describing vegetation structure and heterogeneity, and substrate characteristics. Water temperature was measured inside the nest and in its adjacency. Nest features assessed were area, depth and temperature. Habitat characteristics differed between plots with and without nest. Microhabitat selected for nest-building was characterized by great vegetation cover and height, as well as shallower water and lower cover of organic matter in suspension than in plots without nest. Differences between temperature inside nest and in its adjacency were not observed. No relationship between nest features and habitat descriptors was evidenced. Results revealed that Hypsiboas faber does not build nests anywhere. Males seem to prefer more protected habitats, probably avoiding predation, invasion of conspecific males and inclement weather. Lack of differences between temperature inside- and outside-nest suggest that nest do not improve this condition for eggs and tadpole development. Nest architecture was not related to habitat characteristics, which may be determined by other factors, as nest checking by females before amplexus. Nest site selection should increase offspring survival as well the breeding success of Hypsiboas faber.

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.