Algoritmo paralelo para determinação de autovalores de matrizes hermitianas

Dissertação (mestrado)–Universidade de Brasília, Universidade UnB de Planaltina, Programa de Pós-Graduação em Ciência de Materiais, 2015.

Clasificación lineal mediante algoritmo de perceptrón difuso

La clasificación es una de las herramientas necesarias para llevar a cabo un buen reconocimiento de patrones,las redes de neuronas artificiales (RNA), como una sección del área de Inteligencia Artificial (IA), dispone del perceptrón que es un método simple y eficiente para aprender a través de ejemplos a realizar clasificaciones lineales.

Implementação do algoritmo (RTM) para processamento sísmico em arquiteturas não convencionais

With the growth of energy consumption worldwide, conventional reservoirs, the reservoirs called "easy exploration and production" are not meeting the global energy demand. This has led many researchers to develop projects that will address these needs, companies in the oil sector has invested in techniques that helping in locating and drilling wells. One of the techniques employed in oil exploration process is the reverse time migration (RTM), in English, Reverse Time Migration, which is a method of seismic imaging that produces excellent image of the subsurface. It is algorithm based in calculation on the wave equation. RTM is considered one of the most advanced seismic imaging techniques. The economic value of the oil reserves that require RTM to be localized is very high, this means that the development of these algorithms becomes a competitive differentiator for companies seismic processing. But, it requires great computational power, that it still somehow harms its practical success. The objective of this work is to explore the implementation of this algorithm in unconventional architectures, specifically GPUs using the CUDA by making an analysis of the difficulties in developing the same, as well as the performance of the algorithm in the sequential and parallel version

Sviluppo di un algoritmo di Object Detection per la privacy in ambito industriale

In questa tesi è descritto il lavoro svolto presso un'azienda informatica locale, allo scopo di ricerca ed implementazione di un algoritmo per individuare ed offuscare i volti presenti all'interno di video di e-learning in ambito industriale, al fine di garantire la privacy degli operai presenti. Tale algoritmo sarebbe stato poi da includere in un modulo software da inserire all'interno di un applicazione web già esistente per la gestione di questi video. Si è ricercata una soluzione ad hoc considerando le caratteristiche particolare del problema in questione, studiando le principali tecniche della Computer Vision per comprendere meglio quale strada percorrere. Si è deciso quindi di implementare un algoritmo di Blob Tracking basato sul colore.

Implementazione e benchmarking dell'algoritmo QDANet PRO per l'analisi di big data genomici

Dato il recente avvento delle tecnologie NGS, in grado di sequenziare interi genomi umani in tempi e costi ridotti, la capacità di estrarre informazioni dai dati ha un ruolo fondamentale per lo sviluppo della ricerca. Attualmente i problemi computazionali connessi a tali analisi rientrano nel topic dei Big Data, con databases contenenti svariati tipi di dati sperimentali di dimensione sempre più ampia. Questo lavoro di tesi si occupa dell'implementazione e del benchmarking dell'algoritmo QDANet PRO, sviluppato dal gruppo di Biofisica dell'Università di Bologna: il metodo consente l'elaborazione di dati ad alta dimensionalità per l'estrazione di una Signature a bassa dimensionalità di features con un'elevata performance di classificazione, mediante una pipeline d'analisi che comprende algoritmi di dimensionality reduction. Il metodo è generalizzabile anche all'analisi di dati non biologici, ma caratterizzati comunque da un elevato volume e complessità, fattori tipici dei Big Data. L'algoritmo QDANet PRO, valutando la performance di tutte le possibili coppie di features, ne stima il potere discriminante utilizzando un Naive Bayes Quadratic Classifier per poi determinarne il ranking. Una volta selezionata una soglia di performance, viene costruito un network delle features, da cui vengono determinate le componenti connesse. Ogni sottografo viene analizzato separatamente e ridotto mediante metodi basati sulla teoria dei networks fino all'estrapolazione della Signature finale. Il metodo, già precedentemente testato su alcuni datasets disponibili al gruppo di ricerca con riscontri positivi, è stato messo a confronto con i risultati ottenuti su databases omici disponibili in letteratura, i quali costituiscono un riferimento nel settore, e con algoritmi già esistenti che svolgono simili compiti. Per la riduzione dei tempi computazionali l'algoritmo è stato implementato in linguaggio C++ su HPC, con la parallelizzazione mediante librerie OpenMP delle parti più critiche.

Development of a Coupling Model for Fluid-Structure Interaction using the Mesh-free Finite Element Method and the Lattice Boltzmann Method

In the presented thesis work, the meshfree method with distance fields was coupled with the lattice Boltzmann method to obtain solutions of fluid-structure interaction problems. The thesis work involved development and implementation of numerical algorithms, data structure, and software. Numerical and computational properties of the coupling algorithm combining the meshfree method with distance fields and the lattice Boltzmann method were investigated. Convergence and accuracy of the methodology was validated by analytical solutions. The research was focused on fluid-structure interaction solutions in complex, mesh-resistant domains as both the lattice Boltzmann method and the meshfree method with distance fields are particularly adept in these situations. Furthermore, the fluid solution provided by the lattice Boltzmann method is massively scalable, allowing extensive use of cutting edge parallel computing resources to accelerate this phase of the solution process. The meshfree method with distance fields allows for exact satisfaction of boundary conditions making it possible to exactly capture the effects of the fluid field on the solid structure.

Investigating the mesh dependency and upscaling of 3D grain-based models for the simulation of brittle fracture processes in low-porosity crystalline rock

The application of 3D grain-based modelling techniques is investigated in both small and large scale 3DEC models, in order to simulate brittle fracture processes in low-porosity crystalline rock. Mesh dependency in 3D grain-based models (GBMs) is examined through a number of cases to compare Voronoi and tetrahedral grain assemblages. Various methods are used in the generation of tessellations, each with a number of issues and advantages. A number of comparative UCS test simulations capture the distinct failure mechanisms, strength profiles, and progressive damage development using various Voronoi and tetrahedral GBMs. Relative calibration requirements are outlined to generate similar macro-strength and damage profiles for all the models. The results confirmed a number of inherent model behaviors that arise due to mesh dependency. In Voronoi models, inherent tensile failure mechanisms are produced by internal wedging and rotation of Voronoi grains. This results in a combined dependence on frictional and cohesive strength. In tetrahedral models, increased kinematic freedom of grains and an abundance of straight, connected failure pathways causes a preference for shear failure. This results in an inability to develop significant normal stresses causing cohesional strength dependence. In general, Voronoi models require high relative contact tensile strength values, with lower contact stiffness and contact cohesional strength compared to tetrahedral tessellations. Upscaling of 3D GBMs is investigated for both Voronoi and tetrahedral tessellations using a case study from the AECL’s Mine-by-Experiment at the Underground Research Laboratory. An upscaled tetrahedral model was able to reasonably simulate damage development in the roof forming a notch geometry by adjusting the cohesive strength. An upscaled Voronoi model underestimated the damage development in the roof and floor, and overestimated the damage in the side-walls. This was attributed to the discretization resolution limitations.

Size selectivity of diamond and square mesh cod ends for four by-catch species in the crustacean fishery off the Portuguese south coast

The effects of an increase in cod end mesh size from 55 to 60 and 70 mm and a change of mesh configuration from 55 mm diamond to 55 turn square mesh on the size selectivity of four by-catch species (the red shrimp Aristeus antennatus, the European hake Merluccius merluccius, the horse mackerel Trachurus trachurus and the blue whiting Micromesistius poutassou) commonly captured in the crustacean fishery off the Portuguese south coast, were evaluated. Selectivity parameters for blue whiting, the most abundant species in the catches, were estimated taking into account between-haul variation, while for the remaining species, captured in much lower quantities, the selectivity estimates were based on pooled data by length class for all hauls within the same cod end. Length at 50% retention, L-50, was found to increase with mesh size and with the change in mesh configuration for all the studied species. For blue whiting trawling depth and cod end catch were found to play a role in between-haul variation by increasing L-50 as well. The results suggest that an increase in the current minimum mesh size of 55-70 mm would be advisable to be compatible with the minimum landing sizes (MLSs) of 29 mm carapace length and 27 cm total length for red shrimp and hake, respectively, while it would greatly reduce the amount of discards, particularly those for blue whiting, that accounted for approximately 50% of the total catch weight. Horse mackerel was the only species for which the use of a larger mesh size would result in a significant escapement of individuals above the MLS of 15 cm. (C) 2002 Elsevier Science B.V. All rights reserved.

Size selectivity of diamond and square mesh cod ends for rose shrimp (Parapenaeus longirostris) and Norway lobster (Nephrops norvegicus) off the Portuguese south coast

The effects of an increase in cod end mesh size from 55 to 60 and 70 mm and a change of mesh configuration from diamond to square mesh on the size selectivity for rose shrimp Parapenaeus longirostris and Norway lobster Nephrops norvegicus captured off the Portuguese south coast were evaluated. The results were analysed taking into account between-haul variation in selectivity, and indicate a significant increase in L-50 for rose shrimp with an increase in mesh size or with the use of a square mesh cod end, while for Norway lobster only mesh configuration was found to affect this parameter. Two other important external variables were identified; the trawling depth and the cod end catch, which influence between-haul variation, by increasing the selection range for rose shrimp and Norway lobster, respectively. The results obtained suggest that an increase in the current minimum mesh size of 55 mm would be advisable for rose shrimp in order to respect the minimum landing size of 24 mm carapace length presently established for this species. Moreover, trawling for rose shrimp should be avoided at depths above 200 m, in order to avoid catches consisting almost exclusively of juveniles. Such an increase in mesh size would have a minor impact in terms of losses of individuals above the minimum landing size for Norway lobster and would contribute to reducing the amount of discards in this fishery. (C) 2002 Elsevier Science B.V. All rights reserved.

A novel two-stage discrete crack method based on the screened Poisson equation and local mesh refinement

We propose an alternative crack propagation algo- rithm which effectively circumvents the variable transfer procedure adopted with classical mesh adaptation algo- rithms. The present alternative consists of two stages: a mesh-creation stage where a local damage model is employed with the objective of defining a crack-conforming mesh and a subsequent analysis stage with a localization limiter in the form of a modified screened Poisson equation which is exempt of crack path calculations. In the second stage, the crack naturally occurs within the refined region. A staggered scheme for standard equilibrium and screened Poisson equa- tions is used in this second stage. Element subdivision is based on edge split operations using a constitutive quantity (damage). To assess the robustness and accuracy of this algo- rithm, we use five quasi-brittle benchmarks, all successfully solved.

Algoritmo para mapeamento de áreas de produção agropecuária com subdivisões.

Áreas de produção agropecuária podem ser mapeadas com o uso de receptores GPS, pela medida da posição geográfica de pontos. A coleta de pontos a campo geralmente não segue uma ordem que permita o traçado direto das áreas. O trabalho descreve um algoritmo desenvolvido para ordenar os pontos medidos, usando apenas a identificação da área e setor a qual cada ponto pertence, permitindo criar um mapa das áreas de produção e suas subdivisões (setores de produção contíguos). O algoritmo foi implementado na forma de um programa em linguagem C, sendo testado e validado em mais de 600 propriedades vitícolas.

Implementação de algoritmo para avaliação genética de grandes populações de animais de interesse agropecuário.

Apresentamos uma versão inicial da solução em desenvolvimento para estimação dos efeitos desejados através do modelo animal univariado, utilizando duas abordagens distintas para a obtenção do melhor estimador linear não viesado (BLUP) dos parâmetros do modelo.

Implementación de un algoritmo genético para la asignación de aulas en un centro de estudio (ING)

The genetic algorithm is a very efficient tool to solve optimization problems. On the other hand, the classroom assignation in any education center, particularly those that does not have enough quantity of classrooms for the courseʼs demand converts it in an optimization problem. In the Department of Computer Science (Universidad de Costa Rica) this work is carried out manually every six months. Besides, at least two persons of the department are dedicated full time to this labor for one week or more. The present article describes an automatic solution that not only reduces the response time to seconds but it also finds an optimal solution in the majority of the cases. In addition gives flexibility in using the program when the information involved with classroom assignation has to be updated. The interface is simple an easy to use.