Monte Carlo Applications in Clinical Three-Dimensional Dosimetry

Author(s):  
Indrin J. Chetty ◽  
Joanna E. Cygler
2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Naoya Takahashi ◽  
Shinji Toda

AbstractExamining the regularity in slip over seismic cycles leads to an understanding of earthquake recurrence and provides the basis for probabilistic seismic hazard assessment. Systematic analysis of three-dimensional paleoseismic trenches and analysis of offset markers along faults reveal slip history. Flights of displaced terraces have also been used to study slips of paleoearthquakes when the number of earthquakes contributing to the observed displacement of a terrace is known. This study presents a Monte Carlo-based approach to estimating slip variability using displaced terraces when a detailed paleoseismic record is not available. First, we mapped fluvial terraces across the Kamishiro fault, which is an intra-plate reverse fault in central Japan, and systematically measured the cumulative dip slip of the mapped terraces. By combining these measurements with the age of the paleoearthquakes, we estimated the amount of dip slip for the penultimate event (PE) and antepenultimate event (APE) to be 1.6 and 3.4 m, respectively. The APE slip was nearly three times larger than the most recent event of 2014 (Mw 6.2): 1.2 m. This suggests that the rupture length of the APE was much longer than that of the 2014 event and the entire Kamishiro fault ruptured with adjacent faults during the APE. Thereafter, we performed the Monte Carlo simulations to explore the possible range of the coefficient of variation for slip per event (COVs). The simulation considered all the possible rupture histories in terms of the number of events and their slip amounts. The resulting COVs typically ranged between 0.3 and 0.54, indicating a large variation in the slip per event of the Kamishiro fault during the last few thousand years. To test the accuracy of our approach, we performed the same simulation to a fault whose slip per event was well constrained. The result showed that the error in the COVs estimate was less than 0.15 in 86% of realizations, which was comparable to the uncertainty in COVs derived from a paleoseismic trenching. Based on the accuracy test, we conclude that the Monte Carlo-based approach should help assess the regularity of earthquakes using an incomplete paleoseismic record.


2017 ◽  
Vol 14 (5) ◽  
pp. 172988141773275 ◽  
Author(s):  
Francisco J Perez-Grau ◽  
Fernando Caballero ◽  
Antidio Viguria ◽  
Anibal Ollero

This article presents an enhanced version of the Monte Carlo localization algorithm, commonly used for robot navigation in indoor environments, which is suitable for aerial robots moving in a three-dimentional environment and makes use of a combination of measurements from an Red,Green,Blue-Depth (RGB-D) sensor, distances to several radio-tags placed in the environment, and an inertial measurement unit. The approach is demonstrated with an unmanned aerial vehicle flying for 10 min indoors and validated with a very precise motion tracking system. The approach has been implemented using the robot operating system framework and works smoothly on a regular i7 computer, leaving plenty of computational capacity for other navigation tasks such as motion planning or control.


2006 ◽  
Vol 128 (9) ◽  
pp. 945-952 ◽  
Author(s):  
Sandip Mazumder

Two different algorithms to accelerate ray tracing in surface-to-surface radiation Monte Carlo calculations are investigated. The first algorithm is the well-known binary spatial partitioning (BSP) algorithm, which recursively bisects the computational domain into a set of hierarchically linked boxes that are then made use of to narrow down the number of ray-surface intersection calculations. The second algorithm is the volume-by-volume advancement (VVA) algorithm. This algorithm is new and employs the volumetric mesh to advance the ray through the computational domain until a legitimate intersection point is found. The algorithms are tested for two classical problems, namely an open box, and a box in a box, in both two-dimensional (2D) and three-dimensional (3D) geometries with various mesh sizes. Both algorithms are found to result in orders of magnitude gains in computational efficiency over direct calculations that do not employ any acceleration strategy. For three-dimensional geometries, the VVA algorithm is found to be clearly superior to BSP, particularly for cases with obstructions within the computational domain. For two-dimensional geometries, the VVA algorithm is found to be superior to the BSP algorithm only when obstructions are present and are densely packed.


Sign in / Sign up

Export Citation Format

Share Document