Metraipolis › archive › dc_df4252ba830e

Predicting Weight Windows for Duct-Streaming Shielding Geometries with a Convolutional Neural Network — arXiv:2610.40457

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40457
License (as archived)
CC0-1.0
Archived
2026-11-01T02:53:18.008Z
SHA-256 of the archived text
796e3b8eb0711b80410961292c5923f22a7b17befd924a7c6b4d96b8796fc31e
Stable URL of this page
https://metraipolis.com/documento/dc_df4252ba830e

How to cite

Predicting Weight Windows for Duct-Streaming Shielding Geometries with a Convolutional Neural Network — arXiv:2610.40457 — arXiv (en), https://arxiv.org/abs/2610.40457 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df4252ba830e (Metraipolis archive dc_df4252ba830e, sha256 796e3b8eb0711b80410961292c5923f22a7b17befd924a7c6b4d96b8796fc31e)
BibTeX
@misc{dcdf4252ba830e,
  title = {Predicting Weight Windows for Duct-Streaming Shielding Geometries with a Convolutional Neural Network — arXiv:2610.40457},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40457},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df4252ba830e; sha256 796e3b8eb0711b80410961292c5923f22a7b17befd924a7c6b4d96b8796fc31e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40457. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Forward-flux-based weight windows give global variance reduction for duct-streaming shielding problems, but each new geometry needs an iterative Monte Carlo calculation to build them. We report preliminary results on a convolutional neural network (CNN) that learns the map from a two-dimensional duct geometry and source position to the lower window bound of such an iteration, here the MAGIC generator in OpenMC, in milliseconds. A set of 250 random concrete ducts of three curved and rectangular families on the Protvino labyrinth bounding box was run in OpenMC with a Cf-252 point source and MAGIC generation, and a 1.9-million-parameter U-Net was trained on the logarithm of the lower bound. On held-out ducts the error in the cells that carry the flux is 0.14 to 0.51 decades; replicate MAGIC runs show this part of the map to be reproducible to a few hundredths of a decade, so the residual is model error, while below $10^{-6}$ the reference itself is noise. Applied without retraining to the rectangular Protvino labyrinth, the prediction correlates with MAGIC at 0.96. Used as weight windows there, with its deepest cells clamped at deployment, it gives an exit-detector figure of merit 54 times the analog value, 1.7 times that of the MAGIC generation run for the same geometry, and 0.80 of that of reused MAGIC windows whose construction it does not pay for. The run cost of any window set is shown to be set by its deepest cells and predictable from a population proxy.

Tema degli esploratori: fisica e astronomia (elenco arXiv physics.comp-ph, nuovi lavori del giorno).
Categorie arXiv: Computational Physics (physics.comp-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.40457 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:20:28.350Z dalla pagina https://arxiv.org/list/physics.comp-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).