SEARCH · Engineering Papers
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.
ENDF-6 formatted files were processed into A Compact ENDF (ACE) files using NJOY2016. Several validation tests were performed: (1) LANL Legacy Benchmark Suite (2) “Modern” Benchmark Suite (3) HEU Benchmark Suite (4) LEU Benchmark Suite (5) Mixed (U+Pu) Benchmark Suite (6) Pu Benchmark Suite (7) 233 U Benchmark Suite.
An analytic solution to a previously studied toy problem is derived and used as a code verification benchmark. Using various Random Number Generators (RNGs) in MCNP6, including the newest SFC64 RNG available in MCNP6.3.1, and their various properties (e.g., RNG stride), we show how these RNGs perform and how to correct or workaround potential issues with respect to the analytic benchmark problem.
Abstract not provided.
Abstract not provided.
Abstract not provided.
This is a build guide for the MCNP® code, version 6.3.1, that expands upon the README.md included with the source code. It covers compilers, dependencies, building, testing, and installing the code in one of its supported configurations.
Abstract not provided.
In the last decade, there has been a renaissance of fission research resulting in new high-precision experiments and advanced fission modeling. For instance, the Chi-Nu and CEA teams supplied, for the first time, the 239 Pu prompt fission neutron spectrum (PFNS) for broad ranges of incident and outgoing neutron energies. The CEA team also measured 239 Pu average prompt neutron multiplicities, ν ̄ p , with lower statistical uncertainties and a technique significantly different than the one used in the past. The NIFFTE collaboration provided 239 Pu( n ,f)/ 235 U( n ,f) cross section shape ratios with uncertainties below 1% utilizing a novel detector type. Advanced fission event generators were developed, among them CGMF, FIFRELIN, FREYA, and GEF, which calculate post-scission fission observables in a correlated manner. These new experimental data and more consistent fission models change the evaluated PFNS, ν ̄ p , and ( n ,f) cross sections, some only modestly, compared to ENDF/B-VIII.0. In turn, the individual new nuclear data distinctly change simulated effective neutron multiplication factors of fast critical assemblies, but their combined impact is small, while affecting the prediction of LLNL pulsed sphere neutron leakage spectra and reaction rates only within experimental uncertainties. Also, the parameters obtained from fitting to ν ̄ p reproduce various post-scission fission observables within the uncertainties of experimental data. This indicates that new differential experiments and consistent fission modeling reduce compensating errors present in ENDF/B-VIII.0.
This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.
Three essential capabilities for using exascale computing resources on next generation power grid applications are: generating large renewable energy datasets, modeling damage and operations during and after extreme events, and employing multi-stage optimization for infrastructure planning. Powerscenarios, developed as part of the ExaSGD project, addresses these capabilities by enabling users to build synthetic wind farms for large test systems using numerical weather prediction-based data sources. We share examples of using Powerscenarios to build out wind farms on the ACTIVSg2000 test system, to enable simulated operations and emergency asset allocation during a hurricane strike, and to compute multi-stage infrastructure buildouts.
Uranium Carbide (UC) is a nuclear fuel material which offers better neutron economy and lower fuel-cycle costs compared to conventional mixed-oxide fuels. UC’s lattice binding and dynamical properties impact thermal neutron scattering and low temperature epithermal resonance absorption. The Thermal Scattering Law (TSL) describes the scattering system available energy and momentum transfer states. There is no TSL evaluation for UC in the ENDF/B-VIII.0 database; herein, ab-initio lattice dynamics (AILD) techniques are invoked to calculate the phonon spectrum for UC using spin-orbit-coupling density functional theory (DFT). The TSLs, inelastic and elastic thermal scattering cross sections for Uranium and Carbon in UC, respectively, are calculated in FLASSH for use in higher fidelity reactor design calculations.
The R-Matrix code SAMMY is a widely used nuclear data evaluation code focused on the resolved range, which includes corrections for experimental effects. The code is still mostly written in Fortran 77, and uses a memory management system suitable for the time of its initial writing (1984). A modernization effort is under way to bring the code in-line with modern software development practices. A continuous-integration testing framework was added, automating the large existing set of test cases. It is run on every commit. The memory management was updated to current standard practices suitable for modern software analysis tools. The code can be obtained from https://code.ornl.gov/RNSD/SAMMY. The resonance parameters and covariance information are now stored in C++ objects shared by SAMMY and AMPX, the processing code that generates nuclear data libraries for SCALE. This allows for easier maintenance and access to the resonance parameters inside and outside of SAMMY. This feature is already used by accessing and changing parameters in memory in the Bayesian Monte Carlo Evaluation Framework for Cross Sections Nuclear Data and Integral Benchmark Experiments project, Further plans include the switch to the ENDF reading and writing routines in AMPX, as these routines are more robust, easier to maintain, and support more features. Of note here is support for the new GNDS format. Previously it wasn’t easy to share the full covariance matrix for evaluations containing more than one isotope due to limitations on the ENDF format; this is now supported in GNDS. The data are currently available in a binary SAMMY format and can be exported to GNDS to make them more widely available and sharable. The next step will be to use the same resonance processing code at 0K in AMPX and SAMMY as one of the available Reich-Moore R-Matrix formalism. The first step toward this goal is to isolate the reconstruction into a module that takes resonance parameters as its input and does not depend on SAMMY global parameters. This goal has been achieved and it should now be possible to more easily change the resonance formalism and add enhancements as the Phenomenological R-Matrix parameterization of direct, doorway, and compound nuclear reactions discussed elsewhere on this conference. This concerted modernization and enhancement effort provides multiple advantages to the nuclear data community. It will allow parameter optimization using enhanced formalisms, including experimental effects, that better match complex experimental data. Then those evaluated parameters can immediately be passed off to AMPX to be reconstructed with the exact same cross section model and be put into a data library for subsequent testing using SCALE and the Valid Benchmark suite or other suitable benchmark suites.
High-fidelity renewable energy scenarios and rare-event high-impact contingencies are essential for modeling operations and infrastructure expansion of the next generation power grids using exascale computing resources. As the ExaSGD project progressed, our capabilities for generating scenarios for modeling wind power output at multiple wind farms significantly improved, evolving from the use of independent random perturbations to importance sampling-based techniques capturing representative spatial-temporal relations. Contingency generation also improved, evolving from standard N-1 techniques to probabilistic models of infrastructure damage resulting from extreme weather events. We review the developments in the realistic intermittent-energy scenario forecasting and extreme-event contingency creation as the ExaSGD project progressed and discuss the future work in these areas.
Fast neutrons born from fission lose energy through scattering interactions in the process of slowing-down. As neutrons thermalize to the order of $k$ $b$ $T$ (where $k$ $b$ is the Boltzmann constant, and $T$ is the temperature of the medium), their de Broglie wavelength and energy approaches the order of inter-atomic spacing and quantized lattice vibrations, i.e., phonons. At thermal energies, the thermal scattering law (TSL), i.e., $S$($α, β$), captures crystal binding contributions to the total reaction rate, or cross section. This dimensionless material property describes the energy ($β$) and momentum ($α$) exchanges available in a medium. Currently, $S$($α, β$) is evaluated in the Full Law Analysis Scattering System Hub (FLASSH) code for discrete inputs and stored as ENDF/B File 7 for 0-phonon elastic (MT 2) and n-phonon inelastic (MT 4) processes. Further processing recasts $S$($α, β$) into cumulative distribution functions for sampling post-collision scattering kinematics. In practice, interpolation schemes are employed to access data between tabulated values. An improvement to this juncture of the nuclear data pipeline is supplying cross sections on-the-fly (OTF), as has been developed for the un-resolved resonance region to minimize non-physical interpolation errors. This capability may improve simulation accuracy for accident and transient analyses, where rapidly varying changes in temperature and pressure are difficult to predict beforehand. To do so, deep artificial neural networks (ANNs) can be employed which collapse non-linear, complex data into a lightweight dictionary of neural weights and biases. This has been successfully demonstrated for the hydrogen in light water $S$($α, β$) dataset in the form of a Neural Thermal Scattering (NeTS) module. In this work, the NeTS framework is extended to consider the impact of material-dependent dynamical features on optimal neural pre-processing and architecture design decisions, such as number of neurons per hidden layer, residual skip connections and neural depth. New NeTS modules for crystalline graphite and beryllium metal illuminate a novel correlation between dynamical nonlinearity and optimal neural parametrization when deploying $S$($α, β$) on-the-fly.
Explore the source record for details and available documents.
Tuning tensor program generation involves navigating a vast search space to find optimal program transformations and measurements for a program on the target hardware. The complexity of this process is further amplified by the exponential combinations of transformations, especially in heterogeneous environments. This research addresses these challenges by introducing a novel approach that learns the joint neural network and hardware features space, facilitating knowledge transfer to new, unseen target hardware. A comprehensive analysis is conducted on the existing state-of-the-art dataset, TenSet, including a thorough examination of test split strategies and the proposal of methodologies for dataset pruning. Leveraging an attention-inspired technique, we tailor the tuning of tensor programs to embed both neural network and hardware-specific features. Notably, our approach substantially reduces the dataset size by up to 53% compared to the baseline without compromising Pairwise Comparison Accuracy (PCA). Furthermore, our proposed methodology demonstrates competitive or improved mean inference times with only 25–40% of the baseline tuning time across various networks and target hardware. The attention-based tuner can effectively utilize schedules learned from previous hardware program measurements to optimize tensor program tuning on previously unseen hardware, achieving a top-5 accuracy exceeding 90%. This research introduces a significant advancement in autotuning tensor program generation, addressing the complexities associated with heterogeneous environments and showcasing promising results regarding efficiency and accuracy.
This lecture covers SCALE and NCSP. The talk begins with an introduction to the mission and elements of the NCSP Nuclear Criticality Safety Program. The talk provides a few highlights of the NCSP/SCALE 2022-2023 timeframe. Additionally covered is CSAS-Shift new K-eff estimators and USL comparison for four different methodologies. This lecture concludes with research and development topics.
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a mixed integer programming formulation to construct optimal decision trees of a prespecified size. We take the special structure of categorical features into account and allow combinatorial decisions (based on subsets of values of features) at each node. Our approach can also handle numerical features via thresholding. Here we show that very good accuracy can be achieved with small trees using moderately-sized training sets. The optimization problems we solve are tractable with modern solvers.