Related papers: Using hierarchical octrees in Monte Carlo radiativ…
Decision diagrams for classification have some notable advantages over decision trees, as their internal connections can be determined at training time and their width is not bound to grow exponentially with their depth. Accordingly,…
In a cyclotron-based proton therapy facility, the energy changes are performed by means of a degrader of variable thickness. The interaction of the proton beam with the degrader creates energy tails and increases the beam emittance. A…
We propose a graph-based clustering method based on Cluster Catch Digraphs (CCDs) that extends their applicability to moderate-dimensional data settings. Existing CCD variants, such as RK-CCDs, rely on spatial randomness tests based on…
In this paper and a companion paper we present the DIRTY model, a Monte Carlo radiative transfer code, self-consistently including dust heating and emission, and accounting for the effects of the transient heating of small grains. The code…
We tackle the problem of goal-directed graph construction: given a starting graph, a budget of modifications, and a global objective function, the aim is to find a set of edges whose addition to the graph achieves the maximum improvement in…
Online 3D Bin Packing (3D-BP) with robotic arms is crucial for reducing transportation and labor costs in modern logistics. While Deep Reinforcement Learning (DRL) has shown strong performance, it often fails to adapt to real-world…
We describe a general radiative equilibrium and temperature correction procedure for use in Monte Carlo radiation transfer codes with sources of temperature-independent opacity, such as astrophysical dust. The technique utilizes the fact…
We present a new dust extension to the Monte Carlo radiative transfer code crash, which enables it to simulate the propagation of ionizing radiation through mixtures of gas and dust. The new code is applied to study the impact of dust…
Monte Carlo (MC) neutron transport provides detailed estimates of radiological quantities within fission reactors. This involves tracking individual neutrons through a computational geometry. CPU-based MC codes use multiple polymorphic…
Monte Carlo radiative transfer, which has been demonstrated as a successful algorithm for modeling radiation transport through the astrophysical medium, relies on sampling of scattering phase functions. We review several classic sampling…
The open source SKIRT Monte Carlo radiative transfer code has been used for more than 15 years to model the interaction between radiation and dust in various astrophysical systems. In this work, we present version 9 of the code, which has…
We analyze the line radiative transfer in protoplanetary disks using several approximate methods and a well-tested Accelerated Monte Carlo code. A low-mass flaring disk model with uniform as well as stratified molecular abundances is…
We introduce a deep recursive octree network for the compression of 3D voxel data. Our network compresses a voxel grid of any size down to a very small latent space in an autoencoder-like network. We show results for compressing 32, 64 and…
To find deterministic solutions to the transient discrete-ordinates neutron-transport equation, source iterations (SI) are typically used to lag the scattering (and fission) source terms from subsequent iterations. For Cartesian geometries…
We present SKIRT, a three-dimensional Monte Carlo radiative transfer code developed to study dusty galaxies. We discuss SKIRT's most important characteristics and present a number of applications. In particular, we focus on the kinematical…
Monte Carlo criticality simulations are widely used in nuclear safety demonstrations, as they offer an arbitrarily precise estimation of global and local tallies while making very few assumptions. However, since the inception of such…
A common way to simulate the transport and spread of pollutants in the atmosphere is via stochastic Lagrangian dispersion models. Mathematically, these models describe turbulent transport processes with stochastic differential equations…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
Global optimization is an active area of research in atomistic simulations, and many algorithms have been proposed to date. A prominent example is basin hopping Monte Carlo, which performs a modified Metropolis Monte Carlo search to explore…
In this work, we investigate the fidelity of orbital optimization in variational Monte Carlo to improve diffusion Monte Carlo results on correlated magnetic systems, using CrSBr as a model system. We compare the performance of different…