Monte Carlo method with heuristic adjustment for irregularly shaped food product volume measurement.
Ontology highlight
ABSTRACT:
SUBMITTER: Siswantoro J
PROVIDER: S-EPMC4032738 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Vertical tanks are commonly used appliances for liquids, and its capacity is very important for quantitative liquid ratio and liquid trade. In order to measure the capacity of vertical tanks more conveniently, this paper proposes a vertical tank capacity measurement method based on Monte Carlo Method. The method arranges a plurality of sensor points on the inner surface of the tank, and then performs Monte Carlo tests by generating a large number of random sample points, and finally calculates the capacity by counting the sample points that meet the criterion. The criterion for whether a sample point is located in the tank, which is the core issue, is established with the coordinates of sensor points and the distance between different sensor points along the surface of the tank. The results show that the absolute error of the measurement results of the proposed method does not exceed ±0.0003[m3], and the absolute error of capacity per unit volume has a linear relationship with the height of the vertical tank, and has little effect with the radial size of the vertical tank.
| S-EPMC8051814 | biostudies-literature
Project description:Evaluating the marginal likelihood in Bayesian analysis is essential for model selection. Estimators based on a single Markov chain Monte Carlo sample from the posterior distribution include the harmonic mean estimator and the inflated density ratio estimator. We propose a new class of Monte Carlo estimators based on this single Markov chain Monte Carlo sample. This class can be thought of as a generalization of the harmonic mean and inflated density ratio estimators using a partition weighted kernel (likelihood times prior). We show that our estimator is consistent and has better theoretical properties than the harmonic mean and inflated density ratio estimators. In addition, we provide guidelines on choosing optimal weights. Simulation studies were conducted to examine the empirical performance of the proposed estimator. We further demonstrate the desirable features of the proposed estimator with two real data sets: one is from a prostate cancer study using an ordinal probit regression model with latent variables; the other is for the power prior construction from two Eastern Cooperative Oncology Group phase III clinical trials using the cure rate survival model with similar objectives.
| S-EPMC5967857 | biostudies-literature
Project description:A computational method is developed to carry out explicit solvent simulations of complex molecular systems under conditions of constant pH. In constant-pH simulations, preidentified ionizable sites are allowed to spontaneously protonate and deprotonate as a function of time in response to the environment and the imposed pH. The method, based on a hybrid scheme originally proposed by H. A. Stern (J. Chem. Phys. 2007, 126, 164112), consists of carrying out short nonequilibrium molecular dynamics (neMD) switching trajectories to generate physically plausible configurations with changed protonation states that are subsequently accepted or rejected according to a Metropolis Monte Carlo (MC) criterion. To ensure microscopic detailed balance arising from such nonequilibrium switches, the atomic momenta are altered according to the symmetric two-ends momentum reversal prescription. To achieve higher efficiency, the original neMD-MC scheme is separated into two steps, reducing the need for generating a large number of unproductive and costly nonequilibrium trajectories. In the first step, the protonation state of a site is randomly attributed via a Metropolis MC process on the basis of an intrinsic pKa; an attempted nonequilibrium switch is generated only if this change in protonation state is accepted. This hybrid two-step inherent pKa neMD-MC simulation method is tested with single amino acids in solution (Asp, Glu, and His) and then applied to turkey ovomucoid third domain and hen egg-white lysozyme. Because of the simple linear increase in the computational cost relative to the number of titratable sites, the present method is naturally able to treat extremely large systems.
| S-EPMC4535364 | biostudies-literature
Project description:SignificanceContinuous glucose monitors (CGMs) are increasingly utilized as a way to provide healthcare to the over 10% of Americans that have diabetes. Fully insertable and optically transduced biosensors are poised to further improve CGMs by extending the device lifetime and reducing cost. However, optical modeling of light propagation in tissue is necessary to ascertain device performance.AimMonte Carlo modeling of photon transport through tissue was used to assess the luminescent output of a fully insertable glucose biosensor that uses a multimodal Förster resonance energy transfer competitive binding assay and a phosphorescence lifetime decay enzymatic assay.ApproachA Monte Carlo simulation framework of biosensor luminescence and tissue autofluorescence was built using MCmatlab. Simulations were first validated against previous research and then applied to predict the response of a biosensor in development.ResultsOur results suggest that a diode within the safety standards for light illumination on the skin, with far-red excitation, allows the luminescent biosensor to yield emission strong enough to be detectable by a common photodiode.ConclusionsThe computational model showed that the expected fluorescent power output of a near-infrared light actuated barcode was five orders of magnitude greater than a visible spectrum excited counterpart biosensor.
| S-EPMC9064117 | biostudies-literature
Project description:The use of Monte-Carlo (MC) p$$ p $$ -values when testing the significance of a large number of hypotheses is now commonplace. In large-scale hypothesis testing, we will typically encounter at least some p$$ p $$ -values near the threshold of significance, which require a larger number of MC replicates than p$$ p $$ -values that are far from the threshold. As a result, some incorrect conclusions can be reached due to MC error alone; for hypotheses near the threshold, even a very large number (eg, 106$$ 1{0}^6 $$ ) of MC replicates may not be enough to guarantee conclusions reached using MC p$$ p $$ -values. Gandy and Hahn (GH)6-8 have developed the only method that directly addresses this problem. They defined a Monte-Carlo error rate (MCER) to be the probability that any decisions on accepting or rejecting a hypothesis based on MC p$$ p $$ -values are different from decisions based on ideal p$$ p $$ -values; their method then makes decisions by controlling the MCER. Unfortunately, the GH method is frequently very conservative, often making no rejections at all and leaving a large number of hypotheses "undecided". In this article, we propose MERIT, a method for large-scale MC hypothesis testing that also controls the MCER but is more statistically efficient than the GH method. Through extensive simulation studies, we demonstrate that MERIT controls the MCER while making more decisions that agree with the ideal p$$ p $$ -values than GH does. We also illustrate our method by an analysis of gene expression data from a prostate cancer study.
| S-EPMC10909586 | biostudies-literature
Project description:Nonlinear state-space models are powerful tools to describe dynamical structures in complex time series. In a streaming setting where data are processed one sample at a time, simultaneous inference of the state and its nonlinear dynamics has posed significant challenges in practice. We develop a novel online learning framework, leveraging variational inference and sequential Monte Carlo, which enables flexible and accurate Bayesian joint filtering. Our method provides an approximation of the filtering posterior which can be made arbitrarily close to the true filtering distribution for a wide class of dynamics models and observation models. Specifically, the proposed framework can efficiently approximate a posterior over the dynamics using sparse Gaussian processes, allowing for an interpretable model of the latent dynamics. Constant time complexity per sample makes our approach amenable to online learning scenarios and suitable for real-time applications.
| S-EPMC10082974 | biostudies-literature
Project description:We evaluated the potential of mesh-based Monte Carlo (MC) method for widefield time-gated fluorescence molecular tomography, aiming to improve accuracy in both shape discretization and photon transport modeling in preclinical settings. An optimized software platform was developed utilizing multithreading and distributed parallel computing to achieve efficient calculation. We validated the proposed algorithm and software by both simulations and in vivo studies. The results establish that the optimized mesh-based Monte Carlo (mMC) method is a computationally efficient solution for optical tomography studies in terms of both calculation time and memory utilization. The open source code, as part of a new release of mMC, is publicly available at http://mcx.sourceforge.net/mmc/.
| S-EPMC3569407 | biostudies-literature
Project description:In this work, we present a robust and powerful method for the verification, with arbitrary accuracy, of Monte Carlo codes for simulating random walks in complex media. Such random walks are typical of photon propagation in turbid media, scattering of particles, i.e., neutrons in a nuclear reactor or animal/humans' migration. Among the numerous applications, Monte Carlo method is also considered a gold standard for numerically "solving" the scalar radiative transport equation even in complex geometries and distributions of the optical properties. In this work, we apply the verification method to a Monte Carlo code which is a forward problem solver extensively used for typical applications in the field of tissue optics. The method is based on the well-known law of average path length invariance when the entrance of the entities/particles in a medium obeys to a simple cosine law, i.e., Lambertian entrance, and annihilation of particles inside the medium is absent. By using this law we achieve two important points: (1) the invariance of the average path length guarantees that the expected value is known regardless of the complexity of the medium; (2) the accuracy of a Monte Carlo code can be assessed by simple statistical tests. We will show that we can reach an arbitrary accuracy of the estimated average pathlength as the number of simulated trajectories increases. The method can be applied in complete generality versus the scattering and geometrical properties of the medium, as well as in presence of refractive index mismatches in the optical case. In particular, this verification method is reliable to detect inaccuracies in the treatment of boundaries of finite media. The results presented in this paper, obtained by a standard computer machine, show a verification of our Monte Carlo code up to the sixth decimal digit. We discuss how this method can provide a fundamental tool for the verification of Monte Carlo codes in the geometry of interest, without resorting to simpler geometries and uniform distribution of the scattering properties.
| S-EPMC8484597 | biostudies-literature
Project description:Dosimetry in kilovoltage cone beam computed tomography (CBCT) is a challenge due to the limitation of physical measurements. To address this, we used a Monte Carlo (MC) method to estimate the CT dose index (CTDI) and the dose length product (DLP) for a commercial CBCT system. As Dixon and Boone showed that CTDI concept can be applicable to both CBCT and conventional CT, we evaluated weighted CT dose index (CTDI(w)) and DLP for a commercial CBCT system. Two extended CT phantoms were created in our BEAMnrc/EGSnrc MC system. Before the simulations, the beam collimation of a Varian On-Board Imager (OBI) system was measured with radiochromic films (model: XR-QA). The MC model of the OBI X-ray tube, validated in a previous study, was used to acquire the phase space files of the full-fan and half-fan cone beams. Then, DOSXYZnrc user code simulated a total of 20 CBCT scans for the nominal beam widths from 1 cm to 10 cm. After the simulations, CBCT dose profiles at center and peripheral locations were extracted and integrated (dose profile integral, DPI) to calculate the CTDI per each beam width. The weighted cone-beam CTDI (CTDI(w,l)) was calculated from DPI values and mean CTDI(w,l) (CTDI(w,l)) and DLP were derived. We also evaluated the differences of CTDI(w) values between MC simulations and point dose measurements using standard CT phantoms. In results, it was found that CTDI(w,600) was 8.74 ± 0.01 cGy for head and CTDI(w,900) was 4.26 ± 0.01 cGy for body scan. The DLP was found to be proportional to the beam collimation. We also found that the point dose measurements with standard CT phantoms can estimate the CTDI within 3% difference compared to the full integrated CTDI from the MC method. This study showed the usability of CTDI as a dose index and DLP as a total dose descriptor in CBCT scans.
| S-EPMC5718669 | biostudies-literature
Project description:An important issue in statistical inference for semiparametric models is how to provide reliable and consistent variance estimation. Brown and Wang (2005. Standard errors and covariance matrices for smoothed rank estimators. Biometrika 92: , 732-746) proposed a variance estimation procedure based on an induced smoothing for non-smooth estimating functions. Herein a Monte Carlo version is developed that does not require any explicit form for the estimating function itself, as long as numerical evaluation can be carried out. A general convergence theory is established, showing that any one-step iteration leads to a consistent variance estimator and continuation of the iterations converges at an exponential rate. The method is demonstrated through the Buckley-James estimator and the weighted log-rank estimators for censored linear regression, and rank estimation for multiple event times data.
| S-EPMC4288129 | biostudies-literature