Search NASA⌕ Search

SEARCH · Search NASA

Results for “Performance Benchmarking”

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 1,279 records · Page 71

In situ investigation of ion irradiation-induced amorphization of (Ge 2 Sb 2 Te 5 ) 1−x C x [0 ≤ x ≤ 0.12]

Chalcogenide thin films that undergo reversible phase changes show promise for use in next-generation nanophotonics, microelectronics, and other emerging technologies. One of the many studied compounds, Ge2Sb2Te5, has demonstrated several useful properties and performance characteristics. However, the efficacy of benchmark Ge2Sb2Te5 is restricted by amorphous phase thermal stability below ∼150 °C, limiting its potential use in high-temperature applications. In response, previous studies have added a fourth species (e.g., C) to sputter-deposited Ge2Sb2Te5, demonstrating improved thermal stability. Our current research confirms reported thermal stability enhancements and assesses the effects of carbon on crystalline phase radiation response. Through in situ transmission electron microscope irradiation studies, we examine the effect of C addition on the amorphization behavior of initially cubic and trigonal polycrystalline films irradiated using 2.8 MeV Au to various doses up to 1 × 1015 cm −2 . It was found that increased C content reduces radiation tolerance of both cubic and trigonal phases.

36 MATERIALS SCIENCE↗

A Python Tool for Aqueous Plutonium Nitrate Density Law Input Preprocessing in MCNP6

Here, this work develops a predictive density tool in Python, named Plutonium Nitrate Solutions (PuNS), to reduce bias and uncertainty in nuclear criticality safety calculations for plutonium nitrate systems. The Pitzer method and an empirical method were implemented into the PuNS tool to generate atom densities for use in MCNP6 material cards. These material cards are directly prepared into an MCNP6 input text file and are calculated based on customizable user inputs of plutonium content, nitric acid content, temperature, and plutonium isotope weight percentages. The PuNS tool is validated and verified against the International Criticality Safety Benchmark Evaluation Project Handbook experiments and is observed to predict densities within a root mean square error of 0.89% for the Pitzer method and 1.82% for the empirical method. These errors in density lead to up to 1569 pcm difference in MCNP6 calculated k eff for the Pitzer method and up to a 1751 pcm difference for the empirical method when compared to experimental benchmarks. Simultaneous work is also being performed at Los Alamos National Laboratory and the University of New Mexico to create a similar tool for plutonium chloride solutions, named Plutonium Chloride Solution, which aims to provide the accreditation of the chlorine absorption. These capabilities will not only provide more accurate models but also facilitate an improved understanding of solution systems and a potential relaxation in the conservatism of current aqueous plutonium processing criticality safety limits.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Single-ion addressing via trap potential modulation in global optical fields

To date, individual addressing of ion qubits has relied primarily on local Rabi or transition frequency differences between ions created via electromagnetic field spatial gradients or via ion transport operations. Alternatively, it is possible to synthesize arbitrary local one-qubit gates by leveraging local phase differences in a global driving field. Here we report individual addressing of 40 Ca + ions in a two-ion crystal using axial potential modulation in a global gate laser field. We characterize the resulting gate performance via one-qubit randomized benchmarking, applying different random sequences to each co-trapped ion. We identify the primary error sources and compare the results with single-ion experiments to better understand our experimental limitations. These experiments form a foundation for the universal control of two ions, confined in the same potential well, with a single gate laser beam.

quantum computing↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Output-weighted sampling for multi-armed bandits with extreme payoffs

We present a new type of acquisition function for online decision-making in multi-armed and contextual bandit problems with extreme payoffs. Specifically, we model the payoff function as a Gaussian process and formulate a novel type of upper confidence bound acquisition function that guides exploration towards the bandits that are deemed most relevant according to the variability of the observed rewards. This is achieved by computing a tractable likelihood ratio that quantifies the importance of the output relative to the inputs and essentially acts as an attention mechanism that promotes exploration of extreme rewards. Our formulation is supported by asymptotic zero-regret guarantees, and its performance is demonstrated across several synthetic benchmarks, as well as two realistic examples involving noisy sensor network data. Finally, we provide a JAX library for efficient bandit optimization using Gaussian processes.

Science & Technology - Other Topics↗

Efficient and accurate numerical integration of exchange-correlation density functionals

We present a method for efficient calculation of exchange correlation in a density-functional theory calculation with Gaussian basis functions. It seamlessly combines the treatments of smooth (low-energy cutoff) and nonsmooth parts of the electron density such that computational performance can be maximized without approximation. Benchmark calculations show that the scheme can speed up the calculation of the exchange-correlation by as much as ten times or more without error.

74 ATOMIC AND MOLECULAR PHYSICS↗

Linear response strength functions with iterative Arnoldi diagonalization

We report on an implementation of a new method to calculate random phase approximation (RPA) strength functions with iterative non-Hermitian Arnoldi diagonalization method, which does not explicitly calculate and store the RPA matrix. We discuss the treatment of spurious modes, numerical stability, and how the method scales as the used model space is enlarged. We perform the particle-hole RPA benchmark calculations for double magic nucleus {sup 132}Sn and compare the resulting electromagnetic strength functions against those obtained within the standard RPA.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Combined search for neutrinos from dark matter self-annihilation in the Galactic Center with ANTARES and IceCube

In this work, we present the results of the first combined dark matter search targeting the Galactic Centre using the ANTARES and IceCube neutrino telescopes. For dark matter particles with masses from 50 to 1000 GeV, the sensitivities on the self-annihilation cross section set by ANTARES and IceCube are comparable, making this mass range particularly interesting for a joint analysis. Dark matter self-annihilation through the $\tau^+\tau^-$, $\mu^+\mu^-$, $b\bar{b}$ and $W^+W^-$ channels is considered for both the Navarro-Frenk-White and Burkert halo profiles. In the combination of 2,101.6 days of ANTARES data and 1,007 days of IceCube data, no excess over the expected background is observed. Limits on the thermally-averaged dark matter annihilation cross section $\langle\sigma_A\upsilon\rangle$ are set. These limits present an improvement of up to a factor of two in the studied dark matter mass range with respect to the individual limits published by both collaborations. When considering dark matter particles with a mass of 200 GeV annihilating through the $\tau^+\tau^-$ channel, the value obtained for the limit is $7.44 \times 10^{-24} \text{cm}^{3}\text{s}^{-1}$ for the Navarro-Frenk-White halo profile. For the purpose of this joint analysis, the model parameters and the likelihood are unified, providing a benchmark for forthcoming dark matter searches performed by neutrino telescopes.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparative Study of Large Language Model Architectures on Frontier

Large language models (LLMs) have garnered significant attention in both the AI community and beyond. Among these, the Generative Pre-trained Transformer (GPT) has emerged as the dominant architecture, spawning numerous variants. However, these variants have undergone pre-training under diverse conditions, including variations in input data, data preprocessing, and training methodologies, resulting in a lack of controlled comparative studies. Here we meticulously examine two prominent open-sourced GPT architectures, GPT-NeoX and LLaMA, leveraging the computational power of Frontier, the world’s first Exascale supercomputer. Employing the same materials science text corpus and a comprehensive end-to-end pipeline, we conduct a comparative analysis of their training and downstream performance. Our efforts culminate in achieving state-of-the-art performance on a challenging materials science benchmark. Furthermore, we investigate the computation and energy efficiency, and propose a computationally efficient method for architecture design. To our knowledge, these pre-trained models represent the largest available for materials science. Our findings provide practical guidance for building LLMs on HPC platforms.

Yin, Junqi↗

Implementing High-Performance Geometric Multigrid Solver with Naturally Grained Messages

Structured-grid linear solvers often require manually packing and unpacking of communication data to achieve high performance.Orchestrating this process efficiently is challenging, labor-intensive, and potentially error-prone.In this paper, we explore an alternative approach that communicates the data with naturally grained messagesizes without manual packing and unpacking. This approach is the distributed analogue of shared-memory programming, taking advantage of the global addressspace in PGAS languages to provide substantial programming ease. However, its performance may suffer from the large number of small messages. We investigate theruntime support required in the UPC ++ library for this naturally grained version to close the performance gap between the two approaches and attain comparable performance at scale using the High-Performance Geometric Multgrid (HPGMG-FV) benchmark as a driver.

97 MATHEMATICS AND COMPUTING↗

TU-AB-BRC-02: Accuracy Evaluation of GPU-Based OpenCL Carbon Monte Carlo Package (goCMC) in Biological Dose and Microdosimetry in Comparison to FLUKA Simulations

Purpose: One of the most accurate methods for radiation transport is Monte Carlo (MC) simulation. Long computation time prevents its wide applications in clinic. We have recently developed a fast MC code for carbon ion therapy called GPU-based OpenCL Carbon Monte Carlo (goCMC) and its accuracy in physical dose has been established. Since radiobiology is an indispensible aspect of carbon ion therapy, this study evaluates accuracy of goCMC in biological dose and microdosimetry by benchmarking it with FLUKA. Methods: We performed simulations of a carbon pencil beam with 150, 300 and 450 MeV/u in a homogeneous water phantom using goCMC and FLUKA. Dose and energy spectra for primary and secondary ions on the central beam axis were recorded. Repair-misrepair-fixation model was employed to calculate Relative Biological Effectiveness (RBE). Monte Carlo Damage Simulation (MCDS) tool was used to calculate microdosimetry parameters. Results: Physical dose differences on the central axis were <1.6% of the maximum value. Before the Bragg peak, differences in RBE and RBE-weighted dose were <2% and <1%. At the Bragg peak, the differences were 12.5% caused by small range discrepancy and sensitivity of RBE to beam spectra. Consequently, RBE-weighted dose difference was 11%. Beyond the peak, RBE differences were <20% and primarily caused by differences in the Helium-4 spectrum. However, the RBE-weighted dose agreed within 1% due to the low physical dose. Differences in microdosimetric quantities were small except at the Bragg peak. The simulation time per source particle with FLUKA was 0.08 sec, while goCMC was approximately 1000 times faster. Conclusion: Physical doses computed by FLUKA and goCMC were in good agreement. Although relatively large RBE differences were observed at and beyond the Bragg peak, the RBE-weighted dose differences were considered to be acceptable.

60 APPLIED LIFE SCIENCES↗

Least-cost Optimal Distribution Grid Expansion (LODGE) v1

LODGE finds the least-cost portfolio of traditional distribution system upgrades to integrate new loads and behind-the-meter DERs in combination with advanced non-wire alternative (NWA) planning solutions, such as utility-owned storage and distributed PV. Working with a set of least-cost solutions per feeder/substation allows us to benchmark and compare techno-economic performance of different traditional and NWA planning solutions. An important aspect of the LODGE model is that it includes power flow operation constraints. This means that the least-cost planning solutions delivered by LODGE are technically feasible. Available projects in LODGE portfolio include: 1) feeder reconductoring; 2) transformers upgrades; 3) non-wire alternatives, such as strategic siting and sizing of storage and distributed PV; 4) voltage regulators.

Heleno, Miguel↗

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗

Generalizable, fast, and accurate DeepQSPR with fastprop

Abstract Quantitative Structure–Property Relationship studies (QSPR), often referred to interchangeably as QSAR, seek to establish a mapping between molecular structure and an arbitrary target property. Historically this was done on a target-by-target basis with new descriptors being devised to specifically map to a given target. Today software packages exist that calculate thousands of these descriptors, enabling general modeling typically with classical and machine learning methods. Also present today are learned representation methods in which deep learning models generate a target-specific representation during training. The former requires less training data and offers improved speed and interpretability while the latter offers excellent generality, while the intersection of the two remains under-explored. This paper introduces , a software package and general Deep-QSPR framework that combines a cogent set of molecular descriptors with deep learning to achieve state-of-the-art performance on datasets ranging from tens to tens of thousands of molecules. provides both a user-friendly Command Line Interface and highly interoperable set of Python modules for the training and deployment of feedforward neural networks for property prediction. This approach yields improvements in speed and interpretability over existing methods while statistically equaling or exceeding their performance across most of the tested benchmarks. is designed with Research Software Engineering best practices and is free and open source, hosted at github.com/jacksonburns/fastprop.

Burns, Jackson W. (ORCID:0000000206579426)↗

Sensitivity Calculations for Systems with Polyethylene Reflector Materials Using CLUTCH

The SCALE 6.2.4 code package contains four sequences for calculating $k_{eff}$ sensitivity coefficients. Two of these sequences use deterministic transport solvers: a one-dimensional (1D) capability based on XSDRN, and a two-dimensional (2D) capability based on NEWT. These sequences are restricted to the multigroup (MG) treatment of neutron energy. The three-dimensional (3D) sequences use the KENO V.a or KENO-VI Monte Carlo transport codes and can be used to calculate sensitivity coefficients with either MG or continuous-energy (CE) transport. The 3D sensitivities are ultimately reported in an MG structure, regardless of the method used in the transport calculations. If desired, the sensitivity coefficients can be reported with very fine energy resolution from a CE calculation, but they are calculated only in the MG library structure in the MG mode. CE TSUNAMI methods are available in SCALE starting in SCALE version 6.2. Sensitivity coefficients were generated using the 3D sequences as part of the generation of the SCALE 6.2.2 Validation Report; difficulties encountered when using the CLUTCH method for thick, fissionable-material reflectors were discussed and investigated as documented in a previous paper. This paper discusses the difficulties encountered in generating accurate sensitivity coefficients using the CLUTCH technique for polyethylene reflectors for two fast spectrum benchmarks. Direct perturbation (DP) calculations were performed to confirm the accuracy of the total sensitivity coefficient for important isotopes with large sensitivities in the system. Discrepancies were detected for CLUTCH-calculated sensitivity coefficients in the reflector of a critical experiment with a radial polyethylene reflector. A simple polyethylene-reflected plutonium sphere was then used to further investigate the discrepancy. Calculations performed using the iterated fission probability (IFP) method generated accurate sensitivity coefficients in both cases. The results of this study emphasize the need to confirm CLUTCH sensitivity results with DP calculations. IFP calculations are generally less efficient but more reliable than CLUTCH calculations. Improvements to the CLUTCH methodology that retain the greater efficiency but address identified difficulties are therefore potentially useful to analysts.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Bayesian inference of structured latent spaces from neural population activity with the orthogonal stochastic linear mixing model

The brain produces diverse functions, from perceiving sounds to producing arm reaches, through the collective activity of populations of many neurons. Determining if and how the features of these exogenous variables (e.g., sound frequency, reach angle) are reflected in population neural activity is important for understanding how the brain operates. Often, high-dimensional neural population activity is confined to low-dimensional latent spaces. However, many current methods fail to extract latent spaces that are clearly structured by exogenous variables. This has contributed to a debate about whether or not brains should be thought of as dynamical systems or representational systems. Here, we developed a new latent process Bayesian regression framework, the orthogonal stochastic linear mixing model (OSLMM) which introduces an orthogonality constraint amongst time-varying mixture coefficients, and provide Markov chain Monte Carlo inference procedures. We demonstrate superior performance of OSLMM on latent trajectory recovery in synthetic experiments and show superior computational efficiency and prediction performance on several real-world benchmark data sets. We primarily focus on demonstrating the utility of OSLMM in two neural data sets: μ ECoG recordings from rat auditory cortex during presentation of pure tones and multi-single unit recordings form monkey motor cortex during complex arm reaching. We show that OSLMM achieves superior or comparable predictive accuracy of neural data and decoding of external variables (e.g., reach velocity). Most importantly, in both experimental contexts, we demonstrate that OSLMM latent trajectories directly reflect features of the sounds and reaches, demonstrating that neural dynamics are structured by neural representations. Together, these results demonstrate that OSLMM will be useful for the analysis of diverse, large-scale biological time-series datasets.

59 BASIC BIOLOGICAL SCIENCES↗

Development of Gamma Background Radiation Digital Twin with Machine Learning Algorithms: Application of Unsupervised Machine Learning to Detection of Anomalies and Nuisances in Gamma Background Radiation Environmental Screening Data

Environmental screening of gamma radiation consists of detecting weak nuisance and anomaly signal in the presence of strong and highly varying background. In a typical scenario, a mobile detector-spectrometer continuously measures gamma radiation spectra in short, e.g., one-second, signal acquisition intervals. The measurement data is a 2D matrix, where one dimension is gamma ray energy, and the other dimension is the number of measurements or total time. In principle, gamma radiation sources can be detected and identified from the measured data by their unique spectral lines. Detecting sources from data measured in a search scenario is difficult due to the highly varying background because of naturally occurring radioactive material (NORM), and low signal-to-noise ratio (S/N) of spectral signal measured during one-second acquisition intervals. The objective of this work is to explore unsupervised machine learning (ML) algorithms for development of a digital twin of gamma radiation background, and for detection and identification of weak nuisances and anomalies events in the presence of highly fluctuating background. In one segment of work, we developed a gamma background estimation model using a Longshort term memory (LSTM) network for one-step CPS time series prediction. The LSTM model was validated with two data sets of measurements from two independent NaI detectors positioned on a mobile platform. The data sets contained background radiation only and no orphan isotope sources. The LSTM model was constructed and tested using data from one of the detectors. Performance of the LSTM model was validate through one-step prediction of CPS time series of another NaI detector without re-training. This approach allows to create a digital twin for nuclear background estimation. Using LSTM, it could be possible to detect a source through subtraction of the estimated counts from the measured background. In another segment of work, we investigated detection of gamma emitting sources in the presence of complex background using unsupervised machine learning. Spectral lines of isotopes are difficult to observe in one-second measurements. Averaging over the entire measurement campaign data set reveals spectral lines of most common background isotopes. Spectral lines of orphan sources, which might appear only in a few measurements during the campaign, will be washed out if averaging is performed over the entire measurement data set. The approach we have explored consists of extracting one-second measurements containing weak spectral features through data clustering. Averaging one-second spectra in a cluster should reveal the presence of anomaly sources. We created two ML models using K-means clustering and Neural Network Self-organizing Map (SOM). Performance of these ML models was benchmarked using search data. One data set contained 137 Cs source, and another dataset contained 131 I source.

54 ENVIRONMENTAL SCIENCES↗