Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “S Codes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 649 records · Page 36

The MCNP ® 6 code: A decade of progress

After several years of effort involved in merging the Los Alamos National Laboratory MCNP5 and MCNPX codes, in 2013 the first production release of version 6 of the Monte Carlo N-Particle ® , or MCNP ® , code MCNP6.1 was distributed publicly. Since then, three significant releases have been issued: MCNP6.1.1beta in 2014, MCNP6.2 in 2018, and MCNP6.3 in 2023. While each release always contains new features, code enhancements, and bug fixes, each version has had a different primary focus, ranging from improved calculational efficiency to new powerful utilities and tools, to software modernization of the code base. With all that has been learned over the first decade of the MCNP6 code, continuous progress is being made toward a modernized, general-purpose Monte Carlo radiation transport code that remains a trusted resource for the global community of practitioners. This paper describes these first 10+ years of the MCNP6 code and its continually improving data libraries, and gives some insight into how the next decade is expected to unfold.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Numerical verification of Orbit and Nemato codes for magnetic topology diagnosis

We present the results of a benchmark study involving the Orbit and Nemato codes. The two codes have been used to compare magnetic structure in a reversed-field pinch (RFP), where conserved magnetic structures/islands appear both in the core (dominated by m = 1 modes) and in the edge (dominated by m = 0 modes). As input, a snapshot of a 3D nonlinear MHD visco-resistive simulation (produced by the SpeCyl code) has been used. The first test is given by the reconstruction via Poincaré surface of section plot of an island generated by a single mode. In this case, the magnetic field topology corresponds to a time-independent Hamiltonian and shows conserved flux-surfaces used as a reference. Both codes successfully yield field lines which follow the same flux surfaces, in both the m = 1 and m = 0 cases. The benchmark between the codes has then been extended to a more complex configuration with chaotic magnetic field, using as input a fully 3D multiple mode RFP condition, characterized by the typical chain of edge magnetic islands providing a transport barrier. Finally, a quantitative benchmark has been performed, using the same 3D input, by estimating the correlation length of the magnetic field line in a bounded stochastic domain. The conclusion is that both codes yield consistent Poincaré plot structure on one hand, and very good quantitative agreement in correlation length estimate. This gives confidence to the application of both codes to magnetic topology in the RFX-mod device, for which they are used routinely, as well as for a generic fusion device.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A verification of the gyrokinetic microstability codes GEM, GYRO, and GS2

A previous publication [R. V. Bravenec et al., Phys. Plasmas 18, 122505 (2011)] presented favorable comparisons of linear frequencies and nonlinear fluxes from the Eulerian gyrokinetic codes gyro[J. Candy and R. E. Waltz, J. Comput. Phys. 186, 545 (2003)] and gs2[W. Dorland et al., Phys. Rev. Lett. 85, 5579 (2000)]. The motivation was to verify the codes, i.e., demonstrate that they correctly solve the gyrokinetic-Maxwell equations. The premise was that it is highly unlikely for both codes to yield the same incorrect results. In this work, we add the Lagrangian particle-in-cell code gem[Y. Chen and S. Parker, J. Comput. Phys. 220, 839 (2007)] to the comparisons, not simply to add another code, but also to demonstrate that the codes' algorithms do not matter. We find good agreement of gem with gyro and gs2 for the plasma conditions considered earlier, thus establishing confidence that the codes are verified and that ongoing validation efforts for these plasma parameters are warranted.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A particle-in-cell code comparison for ion acceleration: EPOCH, LSP, and WarpX

There are now more Particle-in-Cell (PIC) codes than ever before that researchers use to simulate intense laser-plasma interactions. To date, there have been relatively few direct comparisons of these codes in the literature, especially for relativistic intensity lasers interacting with thin overdense targets. To address this we perform a code comparison of three PIC codes: EPOCH, LSP, and WarpX for the problem of laser-driven ion acceleration in a 2D(3v) geometry for a 10 20 W cm -2 intensity laser. We examine the plasma density, ion energy spectra, and laser-plasma coupling of the three codes and find strong agreement. We also run the same simulation 20 times with different random seeds to explore statistical fluctuations of the outputs. We then compare the execution times and memory usage of the codes (without “tuning” to improve performance) using between 1 and 48 processors on one node. We provide input files to encourage larger and more frequent code comparisons in this field.

36 MATERIALS SCIENCE↗

$κ$monty: a Monte Carlo Compton scattering code including non-thermal electrons

Low-luminosity active galactic nuclei are strong sources of X-ray emission produced by Compton scattering originating from the accretion flows surrounding their supermassive black holes. The shape and energy of the resulting spectrum depend on the shape of the underlying electron distribution function (DF). In this work, we present an extended version of the GRMONTY code, called ΚMONTY. The GRMONTY code previously only included a thermal Maxwell–Jütner electron DF. We extend the GRMONTY code with non-thermal electron DFs, namely the κ and power-law DFs, implement Cartesian Kerr–Schild coordinates, accelerate the code with MPI, and couple the code to the non-uniform adaptive mesh refinement grid data from the general relativistic magnetohydrodynamics code BHAC. For the Compton scattering process, we derive two sampling kernels for both DFs. Finally, we present a series of code tests to verify the accuracy of our schemes. The implementation of non-thermal DFs opens the possibility of studying the effect of non-thermal emission on previously developed black hole accretion models.

79 ASTRONOMY AND ASTROPHYSICS↗

Achievable Rates for Concatenated Square Gottesman-Kitaev-Preskill Codes

The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure-loss channels, which establishes theoretical foundations for its optimality. However, such optimal rates are only known to be achieved at a discrete set of noise strengths with the current self-dual symplectic lattice construction. In this work, we develop a new coding strategy using concatenated continuous variable-discrete variable encodings to go beyond past results and establish GKP’s optimal rate over all noise strengths. In particular, for displacement noise, the rate is obtained through a constructive approach by concatenating GKP codes with a quantum polar code and analog decoding. For a pure-loss channel, we prove the existence of capacity-achieving GKP codes through a random coding approach. These results highlight the capability of concatenation-based GKP codes and provides new methods for constructing good GKP lattices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance and Achievable Rates of the Gottesman-Kitaev-Preskill Code for Pure-Loss and Amplification Channels

Quantum error-correction codes protect information from realistic noisy channels and lie at the heart of quantum computation and communication tasks. Understanding the optimal performance and other information-theoretic properties, such as the achievable rates, of a given code is crucial, as these factors determine the fundamental limits imposed by the encoding in conjunction with the noise channel. Here, we use the transpose channel to analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill (GKP) code under pure loss and pure amplification. We present rigorous connections between GKP code’s near-optimal performance and its dual lattice geometry and average input energy. With no energy constraint, we show that when |𝜏/(1−𝜏)| is an integer, specific families of GKP codes simultaneously achieve the loss and amplification capacity. 𝜏 is the transmissivity (gain) for loss (amplification). Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.

Zheng, Guo [Univ. of Chicago, IL (United States)] ↗

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Furthermore, our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

Kobayashi, Ryohei [Institute for Advanced Study, P↗

Entanglement-assisted quantum convolutional coding

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary classical binary convolutional codes. The rate and error-correcting properties of the classical convolutional codes directly determine the corresponding properties of the resulting entanglement-assisted quantum convolutional code. We explain how to encode our CSS entanglement-assisted quantum convolutional codes starting from a stream of information qubits, ancilla qubits, and shared entangled bits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗

Subspace-Aware Index Codes

In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications (e.g., multimedia), the data to be transmitted may lie (or can be well approximated) in a low-dimensional subspace. We exploit this low-dimensional structure of the data using an algebraic framework to solve the index coding problem (referred to as subspace-aware index coding) as opposed to the traditional index coding problem which is subspace-unaware. Also, we propose an efficient algorithm based on the alternating minimization approach to obtain near optimal index codes for both subspace-aware and -unaware cases. In conclusion, our simulations indicate that under certain conditions, a significant throughput gain (about 90%) can be achieved by subspace-aware index codes over conventional subspace-unaware index codes.

97 MATHEMATICS AND COMPUTING↗

Material Properties of Non-Irradiated Zircaloy 4 in Support of ASME Code Acceptance for Pressure Vessel Design

A program underway at Oak Ridge National Laboratory (ORNL) to support private industry design of a system for production of 99Mo includes review of Zircaloy-4 (Zry-4) properties as a potential material for a primary vessel in the system. Because Zry-4 is not a material specified in the ASME Boiler and Pressure Vessel Code, a review has been performed to obtain the necessary data in the non-irradiated condition from the literature and from additional testing of Zry-4 to enable creation of tables of material properties required for ASME Code Section III Article ND-3000 design. A strategy for an in-vessel surveillance program is also recommended for early detection of potential corrosion and irradiation degradation issues during operational life of the vessel. Additionally, the ASME Code Section II, Part D was reviewed to ascertain the requirements for proposing a new material for Code approval. A plate of Zry-4 procured by ORNL was used to obtain tensile properties that were used as the basis for determining the maximum allowable stresses applicable to the vessel design. The materials properties of primary interest for ASME Code application are tensile properties, fracture toughness, fatigue, and five specific physical properties required by the Code for approval of a new material. The literature review revealed that all reported experimental data showed tensile strengths to substantially exceed the minimum specifications in ASTM B352. Sufficient fracture toughness and fatigue data are available to conclude that Zry-4 has sufficient fracture and fatigue resistance in the unirradiated condition for vessel design and operation. Of the physical properties reviewed, only thermal conductivity revealed a discrepancy that is recommended for further review. A surveillance program plan has been developed that is probably the maximum that would need to be implemented for the specific vessel design considered. Once adequate non-irradiated and irradiated data are available from preproduction testing of the Zry-4 and weld metal and HAZ materials, the program could be reduced to reflect that either initial properties are very good and/or the effects of embrittlement appear to be minimal. However, the overall design of a surveillance program is, of course, also dependent on the ASME Code design class for the pressure vessel.

Nanstad, Randy↗

Physical models, cross sections, and numerical approximations used in MCNP and GEANT4 Monte Carlo codes for photon and electron absorbed fraction calculation

Purpose: Radiopharmaceutical applications in nuclear medicine require a detailed dosimetry estimate of the radiation energy delivered to the human tissues. Over the past years, several publications addressed the problem of internal dose estimate in volumes of several sizes considering photon and electron sources. Most of them used Monte Carlo radiation transport codes. Despite the widespread use of these codes due to the variety of resources and potentials they offered to carry out dose calculations, several aspects like physical models, cross sections, and numerical approximations used in the simulations still remain an object of study. Accurate dose estimate depends on the correct selection of a set of simulation options that should be carefully chosen. This article presents an analysis of several simulation options provided by two of the most used codes worldwide: MCNP and GEANT4. Methods: For this purpose, comparisons of absorbed fraction estimates obtained with different physical models, cross sections, and numerical approximations are presented for spheres of several sizes and composed as five different biological tissues. Results: Considerable discrepancies have been found in some cases not only between the different codes but also between different cross sections and algorithms in the same code. Maximum differences found between the two codes are 5.0% and 10%, respectively, for photons and electrons.Conclusion: Even for simple problems as spheres and uniform radiation sources, the set of parameters chosen by any Monte Carlo code significantly affects the final results of a simulation, demonstrating the importance of the correct choice of parameters in the simulation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-T-180: Fano Cavity Test of Proton Transport in Monte Carlo Codes Running On GPU and Xeon Phi

Purpose: In proton dose calculation, clinically compatible speeds are now achieved with Monte Carlo codes (MC) that combine 1) adequate simplifications in the physics of transport and 2) the use of hardware architectures enabling massive parallel computing (like GPUs). However, the uncertainties related to the transport algorithms used in these codes must be kept minimal. Such algorithms can be checked with the so-called “Fano cavity test”. We implemented the test in two codes that run on specific hardware: gPMC on an nVidia GPU and MCsquare on an Intel Xeon Phi (60 cores). Methods: gPMC and MCsquare are designed for transporting protons in CT geometries. Both codes use the method of fictitious interaction to sample the step-length for each transport step. The considered geometry is a water cavity (2×2×0.2 cm{sup 3}, 0.001 g/cm{sup 3}) in a 10×10×50 cm{sup 3} water phantom (1 g/cm{sup 3}). CPE in the cavity is established by generating protons over the phantom volume with a uniform momentum (energy E) and a uniform intensity per unit mass I. Assuming no nuclear reactions and no generation of other secondaries, the computed cavity dose should equal IE, according to Fano's theorem. Both codes were tested for initial proton energies of 50, 100, and 200 MeV. Results: For all energies, gPMC and MCsquare are within 0.3 and 0.2 % of the theoretical value IE, respectively (0.1% standard deviation). Single-precision computations (instead of double) increased the error by about 0.1% in MCsquare. Conclusion: Despite the simplifications in the physics of transport, both gPMC and MCsquare successfully pass the Fano test. This ensures optimal accuracy of the codes for clinical applications within the uncertainties on the underlying physical models. It also opens the path to other applications of these codes, like the simulation of ion chamber response.

60 APPLIED LIFE SCIENCES↗

SU-E-T-323: The FLUKA Monte Carlo Code in Ion Beam Therapy

Purpose: Monte Carlo (MC) codes are increasingly used in the ion beam therapy community due to their detailed description of radiation transport and interaction with matter. The suitability of a MC code demands accurate and reliable physical models for the transport and the interaction of all components of the mixed radiation field. This contribution will address an overview of the recent developments in the FLUKA code oriented to its application in ion beam therapy. Methods: FLUKA is a general purpose MC code which allows the calculations of particle transport and interactions with matter, covering an extended range of applications. The user can manage the code through a graphic interface (FLAIR) developed using the Python programming language. Results: This contribution will present recent refinements in the description of the ionization processes and comparisons between FLUKA results and experimental data of ion beam therapy facilities. Moreover, several validations of the largely improved FLUKA nuclear models for imaging application to treatment monitoring will be shown. The complex calculation of prompt gamma ray emission compares favorably with experimental data and can be considered adequate for the intended applications. New features in the modeling of proton induced nuclear interactions also provide reliable cross section predictions for the production of radionuclides. Of great interest for the community are the developments introduced in FLAIR. The most recent efforts concern the capability of importing computed-tomography images in order to build automatically patient geometries and the implementation of different types of existing positron-emission-tomography scanner devices for imaging applications. Conclusion: The FLUA code has been already chosen as reference MC code in many ion beam therapy centers, and is being continuously improved in order to match the needs of ion beam therapy applications. Parts of this work have been supported by the European FP7 project ENVISION (grant agreement no. 241851)

07 ISOTOPE AND RADIATION SOURCES↗

WE-AB-204-11: Development of a Nuclear Medicine Dosimetry Module for the GPU-Based Monte Carlo Code ARCHER

Purpose: To develop a nuclear medicine dosimetry module for the GPU-based Monte Carlo code ARCHER. Methods: We have developed a nuclear medicine dosimetry module for the fast Monte Carlo code ARCHER. The coupled electron-photon Monte Carlo transport kernel included in ARCHER is built upon the Dose Planning Method code (DPM). The developed module manages the radioactive decay simulation by consecutively tracking several types of radiation on a per disintegration basis using the statistical sampling method. Optimization techniques such as persistent threads and prefetching are studied and implemented. The developed module is verified against the VIDA code, which is based on Geant4 toolkit and has previously been verified against OLINDA/EXM. A voxelized geometry is used in the preliminary test: a sphere made of ICRP soft tissue is surrounded by a box filled with water. Uniform activity distribution of I-131 is assumed in the sphere. Results: The self-absorption dose factors (mGy/MBqs) of the sphere with varying diameters are calculated by ARCHER and VIDA respectively. ARCHER’s result is in agreement with VIDA’s that are obtained from a previous publication. VIDA takes hours of CPU time to finish the computation, while it takes ARCHER 4.31 seconds for the 12.4-cm uniform activity sphere case. For a fairer CPU-GPU comparison, more effort will be made to eliminate the algorithmic differences. Conclusion: The coupled electron-photon Monte Carlo code ARCHER has been extended to radioactive decay simulation for nuclear medicine dosimetry. The developed code exhibits good performance in our preliminary test. The GPU-based Monte Carlo code is developed with grant support from the National Institute of Biomedical Imaging and Bioengineering through an R01 grant (R01EB015478)

60 APPLIED LIFE SCIENCES↗

Machine Learning-enabled Scalable Performance Prediction of Scientific Codes

Hardware architectures become increasingly complex as the compute capabilities grow to exascale. Here, we present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input and predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, and (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks and present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs. We further extend PPT-AMMP to predict the performance of a scientific application code, namely, the radiation transport mini-app SNAP. To this end, we analyze multi-variate regression models that accurately predict the reuse profiles and the basic block counts. We validate predicted SNAP runtimes against actual measured times.

97 MATHEMATICS AND COMPUTING↗

ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads

The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗