File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이덕중

Lee, Deokjung
Computational Reactor physics & Experiment Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Performance analysis of random sampling algorithms on GNU Octave

Author(s)
Bin Yazid, M.S.Lemaire, MMohd Sies, M.B.Lee, Deokjung
Issued Date
2018-11-23
DOI
10.1088/1757-899X/555/1/012003
URI
https://scholarworks.unist.ac.kr/handle/201301/80372
Fulltext
https://iopscience.iop.org/article/10.1088/1757-899X/555/1/012003
Citation
International Nuclear Science, Technology and Engineering Conference 2018, iNuSTEC 2018
Abstract
This paper presents the performance analysis of two random sampling algorithms, the inverse-transform method and the Vose aliasing method, on GNU Octave. The Monte Carlo code MCS developed by UNIST uses random sampling methods to simulate the physics of neutron and photon transport [1]. The goal is to optimize the sampling time of MCS for cases when the probability density function is a constant function throughout the simulation. For this purpose, the runtime of the inverse-transform method and Vose aliasing method are compared for increasing input size with scripts developed on GNU Octave. To compare the execution time, the initialization and generation time of both methods are determined and discussed.
Publisher
Institute of Physics Publishing
ISSN
1757-8981

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.