Monte Carlo evaluations and the source normalisation problem.

P Neuhold

doi:10.1093/rpd/nci271

Home/Archive/PubMed

PubMed · 16381726

Monte Carlo evaluations and the source normalisation problem.

P Neuhold

View original source ↗Export metadata ↓

Abstract

It is well known that Transport Theory calculations give results which are immediately intelligible, as they take into account the source explicitly. Monte Carlo evaluations on the contrary are given per source particle, and they have to be normalized according to the actual source to be completely intelligible. Unfortunately in MC evaluations sometimes one can be led, to reach good results from a statistic point of view (that is low variance values), to manipulate somehow the source instead of sharply define it, in order either to fully exploit the features of his own code or to bypass and simplify actual physical difficulties, but on the other hand this procedure strongly increases the complexity of the source normalization process, which becomes (or can become) the true problem indeed. Two examples will be analyzed: a shielding problem of a transportation cask which will be investigated by means of MCNP, and a shielding problem of a proton beam which will be investigated by means of FLUKA. In both the problems a correct, sharply defined description of the source leads to hardly manageable situations, when "tricky" adjustments on the source instead lead smoothly to statistically good results while the source normalizations are anyway solved without too much complexity.

Explore related subjects

Computer Simulation Equipment Failure Analysis Hospitals, General Models, Chemical Models, Statistical Monte Carlo Method Radiation Dosage Radiation Monitoring Radiation Protection Risk Assessment Risk Factors Evaluation Study Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

P Neuhold. 2005. Monte Carlo evaluations and the source normalisation problem.. https://doi.org/10.1093/rpd%2Fnci271

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2025

Generating correlated data for omics simulation.

Simulation of realistic omics data is a key input for benchmarking studies that help users obtain optimal computational pipelines. Omics data involves large numbers of measured features on each sample and these measures are generally correlated with each other. However, simulation too often ignores these correlations, perhaps due to computational and statistical hurdles of doing so. To alleviate this, we describe three approaches for generating omics-scale data with correlated measures which mimic real datasets. These approaches are all based on a Gaussian copula approach with a covariance matrix that decomposes into a diagonal part and a low-rank part. This decomposition allows for extremely efficient simulation, overcoming a hurdle for adoption of past methods. We use these approaches to demonstrate the importance of including correlation in two benchmarking applications. First, we show that variance of results from the popular DESeq2 method increases when dependence is included. Second, we demonstrate that CYCLOPS, a method for inferring circadian time of collection from transcriptomics, improves in performance when given gene-gene dependencies in some circumstances. We provide an R package, dependentsimr, that has efficient implementations of these methods and can generate dependent data with arbitrary marginal distributions, including discrete (binary, ordered categorical, Poisson, negative binomial), continuous (normal), or with an empirical distribution.

Computer Simulation↗

PubMed2017

Addressing current challenges in cancer immunotherapy with mathematical and computational modelling.

The goal of cancer immunotherapy is to boost a patient's immune response to a tumour. Yet, the design of an effective immunotherapy is complicated by various factors, including a potentially immunosuppressive tumour microenvironment, immune-modulating effects of conventional treatments and therapy-related toxicities. These complexities can be incorporated into mathematical and computational models of cancer immunotherapy that can then be used to aid in rational therapy design. In this review, we survey modelling approaches under the umbrella of the major challenges facing immunotherapy development, which encompass tumour classification, optimal treatment scheduling and combination therapy design. Although overlapping, each challenge has presented unique opportunities for modellers to make contributions using analytical and numerical analysis of model outcomes, as well as optimization algorithms. We discuss several examples of models that have grown in complexity as more biological information has become available, showcasing how model development is a dynamic process interlinked with the rapid advances in tumour-immune biology. We conclude the review with recommendations for modellers both with respect to methodology and biological direction that might help keep modellers at the forefront of cancer immunotherapy development.

Computer Simulation↗

PubMed2007

Increasing the sample size during clinical trials with t-distributed test statistics without inflating the type I error rate.

In clinical trials with t-distributed test statistics the required sample size depends on the unknown variance. Taking estimates from previous studies often leads to a misspecification of the true value of the variance. Hence, re-estimation of the variance based on the collected data and re-calculation of the required sample size is attractive. We present a flexible method for extensions of fixed sample or group-sequential trials with t-distributed test statistics. The method can be applied at any time during the course of the trial and does not require the necessity to pre-specify a sample size re-calculation rule. All available information can be used to determine the new sample size. The advantage of our method when compared with other adaptive methods is maintenance of the efficient t-test design when no extensions are actually made. We show that the type I error rate is preserved.

Computer Simulation↗