Optimization of variance reduction techniques used in EGSnrc Monte Carlo Codes
Bibliographic record
Abstract
Monte Carlo (MC) simulations are often used in calculations of radiation transport to enable accurate prediction of radiation-dose, even though the computation is relatively time-consuming. In a typical MC simulation, significant computation time is allocated to following non-important events. To address this issue, variance reduction techniques (VRTs) have been suggested for reducing the statistical variance for the same computation time. Among the available MC simulation codes, electron gamma shower (National Research Council of Canada) (EGSnrc) is a general-purpose coupled electron-photon transport code that also features an even-handed, rich set of VRTs. The most well-known VRTs are the photon splitting, Russian roulette (RR), and photon cross-section enhancement (XCSE) techniques. The objective of this work was to determine the optimal combination of VRTs that increases the simulation speed and the efficiency of simulation, without compromising its accuracy. Selection of VRTs was performed using EGSnrc MC User codes, such as cavity and egs_chamber, for simulating various ion chamber geometries using 6 MV photon beams and 1.25 MeV<sup>60</sup>Co photon beams. The results show that the combination of XCSE and RR yields the highest efficiency for ion-chamber dose calculations inside a 30 cm × 30 cm × 30 cm water phantom. Hence, properly selecting a different VRT without altering the underlying physics increases the efficiency of MC simulations for ion-chamber dose calculation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".