Implementação de um sistema para simulação por Monte Carlo da passagem de fotões através do olho humano mediante a utilização da plataforma GEANT4 - I

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Implementação de um sistema para simulação por Monte Carlo da passagem de fotões através do olho humano mediante a utilização da plataforma GEANT4 – II

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Simulações Monte Carlo da redução da dose no cristalino e na tiroide em exames de tomografia computorizada utilizando proteções de bismuto

A presente dissertação foi desenvolvida com colaboração do Campus Tecnológico e Nuclear e do Hospital de São José

Probabilistic constraint reasoning with Monte Carlo integration to robot localization

This work studies the combination of safe and probabilistic reasoning through the hybridization of Monte Carlo integration techniques with continuous constraint programming. In continuous constraint programming there are variables ranging over continuous domains (represented as intervals) together with constraints over them (relations between variables) and the goal is to find values for those variables that satisfy all the constraints (consistent scenarios). Constraint programming “branch-and-prune” algorithms produce safe enclosures of all consistent scenarios. Special proposed algorithms for probabilistic constraint reasoning compute the probability of sets of consistent scenarios which imply the calculation of an integral over these sets (quadrature). In this work we propose to extend the “branch-and-prune” algorithms with Monte Carlo integration techniques to compute such probabilities. This approach can be useful in robotics for localization problems. Traditional approaches are based on probabilistic techniques that search the most likely scenario, which may not satisfy the model constraints. We show how to apply our approach in order to cope with this problem and provide functionality in real time.

Monte Carlo valuation of worst-of auto-callable equity swaps

This thesis proposes a Monte Carlo valuation method for Worst-of Auto-callable equity swaps. The valuation of this type of swap usually requires complex numerical methods which are implemented in “black-box” valuation systems. The method proposed is an alternative benchmark tool that is relatively simple to implement and customize. The performance of the method was evaluated according to the variance and bias of the output and to the accuracy when compared to a leading valuation system in the market.

Parallelization of kinetic Monte Carlo algorithm to simulate AL3Sc precipitation

The present paper reports the precipitation process of Al3Sc structures in an aluminum scandium alloy, which has been simulated with a synchronous parallel kinetic Monte Carlo (spkMC) algorithm. The spkMC implementation is based on the vacancy diffusion mechanism. To filter the raw data generated by the spkMC simulations, the density-based clustering with noise (DBSCAN) method has been employed. spkMC and DBSCAN algorithms were implemented in the C language and using MPI library. The simulations were conducted in the SeARCH cluster located at the University of Minho. The Al3Sc precipitation was successfully simulated at the atomistic scale with the spkMC. DBSCAN proved to be a valuable aid to identify the precipitates by performing a cluster analysis of the simulation results. The achieved simulations results are in good agreement with those reported in the literature under sequential kinetic Monte Carlo simulations (kMC). The parallel implementation of kMC has provided a 4x speedup over the sequential version.

Influência das características mamárias na cintilografia miocárdica pelo método Monte Carlo

FUNDAMENTO: Pela redução da especificidade associada à perda de informação, a influência da atenuação das mamas é de fundamental importância em estudos de perfusão do miocárdio. Entretanto, apesar de vários estudos terem sido realizados ao longo dos últimos anos, pouco se tem evoluído para determinar com acurácia a influência das características das mamas sobre a qualidade da cintilografia miocárdica, evitando exposições adicionais de radiação às pacientes. OBJETIVO: O objetivo deste estudo é quantificar a atenuação de fótons pelas mamas, em estudos de perfusão do miocárdio com 99mTc, de acordo com diferentes tamanhos e composições. MÉTODOS: Cada mama foi assumida como sendo um cubo composto de tecido adiposo e fibroglandular. Os dados referentes aos fótons de 99mTc foram analisados em um modelo de Monte Carlo. Variamos a espessura e a composição das mamas e analisamos as interferências na atenuação. Foi empregado o software EGS 4 para as simulações. RESULTADOS: Fixando a espessura de uma mama, a variação da sua composição acarreta um acréscimo máximo de 2,3% no número de fótons atenuados. Em contrapartida, mantendo-se uma composição do tecido mamário fixa, a diferença na atenuação de fótons foi de 45,0%, sendo em média de 6,0% para cada acréscimo de centímetro na espessura da mama. CONCLUSÃO: A simulação por Monte Carlo demonstrou que a influência das espessuras das mamas na atenuação de fótons em cintilografias do miocárdio com 99mTc é muito maior do que a influência das suas composições.

The Analysis of interval censoring and double censoring via Markov chain Monte Carlo methods

L'Anàlisi de la supervivència s'utilitza en diferents camps per analitzar el temps transcorregut entre dos esdeveniments. El que distingeix l'anàlisi de la supervivència d'altres àrees de l'estadística és que les dades normalment estan censurades. La censura en un interval apareix quan l'esdeveniment final d'interès no és directament observable i només se sap que el temps de fallada està en un interval concret. Un esquema de censura més complex encara apareix quan tant el temps inicial com el temps final estan censurats en un interval. Aquesta situació s'anomena doble censura. En aquest article donem una descripció formal d'un mètode bayesà paramètric per a l'anàlisi de dades censurades en un interval i dades doblement censurades així com unes indicacions clares de la seva utilització o pràctica. La metodologia proposada s'ilustra amb dades d'una cohort de pacients hemofílics que es varen infectar amb el virus VIH a principis dels anys 1980's.

Estimation of the probability of congestion using Monte Carlo method in OPS networks

In networks with small buffers, such as optical packet switching based networks, the convolution approach is presented as one of the most accurate method used for the connection admission control. Admission control and resource management have been addressed in other works oriented to bursty traffic and ATM. This paper focuses on heterogeneous traffic in OPS based networks. Using heterogeneous traffic and bufferless networks the enhanced convolution approach is a good solution. However, both methods (CA and ECA) present a high computational cost for high number of connections. Two new mechanisms (UMCA and ISCA) based on Monte Carlo method are proposed to overcome this drawback. Simulation results show that our proposals achieve lower computational cost compared to enhanced convolution approach with an small stochastic error in the probability estimation

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Error and complexity of random walk Monte Carlo radiosity

The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown

A Monte Carlo method for accelerating the computation of animated radiosity sequences

Realistic rendering animation is known to be an expensive processing task when physically-based global illumination methods are used in order to improve illumination details. This paper presents an acceleration technique to compute animations in radiosity environments. The technique is based on an interpolated approach that exploits temporal coherence in radiosity. A fast global Monte Carlo pre-processing step is introduced to the whole computation of the animated sequence to select important frames. These are fully computed and used as a base for the interpolation of all the sequence. The approach is completely view-independent. Once the illumination is computed, it can be visualized by any animated camera. Results present significant high speed-ups showing that the technique could be an interesting alternative to deterministic methods for computing non-interactive radiosity animations for moderately complex scenarios

Biblioteca de l'heurística constructiva Clarke and Wright combinada amb simulació Monte Carlo per resoldre el problema d'adreçament de vehicles

En aquesta recerca es presenta una biblioteca de programari lliure basada en l'heurística constructiva de Clarke & Wright combinada amb simulació Monte Carlo que permet, de manera simple, generar solucions al problema d'adreçament de vehicles. Aquesta metodologia construeix solucions competents en poc temps i sense necessitat d'ajustar o configurar paràmetres previs. La biblioteca pot integrar-se fàcilment en projectes que resolguin variants del VRP amb canvis mínims sobre el codi. Aquest es troba ben documentat i accessible de manera lliure a través de la xarxa. Els resultats computacionals indiquen que es resolen instàncies VRP en temps i costos significativament inferiors a altres propostes de la mateixa família.

Analysis and Monte Carlo simulations of a model for the spread of infectious diseases in heterogeneous metapopulations

We present a study of the continuous-time equations governing the dynamics of a susceptible infected-susceptible model on heterogeneous metapopulations. These equations have been recently proposed as an alternative formulation for the spread of infectious diseases in metapopulations in a continuous-time framework. Individual-based Monte Carlo simulations of epidemic spread in uncorrelated networks are also performed revealing a good agreement with analytical predictions under the assumption of simultaneous transmission or recovery and migration processes