Search NASA⌕ Search

SEARCH · Search NASA

Results for “software tasks”

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.

450 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

System Modeling Frameworks for Wind Turbines and Plants: Review and Requirements Specifications

System modeling frameworks for wind turbines and plants are used by research groups and industry to design wind energy systems that take into account key trade-offs across performance, cost, and reliability at both the turbine and plant level. The frameworks are exercised using a variety of multi-disciplinary design, analysis and optimization (MDAO) methods. To improve inter-operability and foster collaboration, this report proposes a classification system for the frameworks along dimensions of model fidelity and scope. The classification system is first motivated with reviews the state-of-the-art in the development of software frameworks for integrated wind turbine and plant simulation. Within each major wind turbine and power plant subsystem, a matrix is developed for the disciplines used and the fidelity levels with which each discipline can be modeled. The existing frameworks are then classified according to the matrix. Next, an ontology is proposed that will allow for standardizing how data is transferred between the most common discipline-fidelity combinations used in the frameworks. A common representation of data creates the ability to 1) share system descriptions and analysis results, supporting more transparent benchmarks and comparison, and 2) integrate models together into workflows within and across organizations for improving the efficiency and performance of wind turbine and power plant design processes. Ultimately, this integration leads to better overall wind energy system designs with high performance and low costs.

17 WIND ENERGY↗
DOE OSTI2024

IRIS: A Performance-Portable Framework for Cross-Platform Heterogeneous Computing

From edge to exascale, computer architectures are becoming more heterogeneous and complex. The systems typically have fat nodes, with multicore CPUs and multiple hardware accelerators such as GPUs, FPGAs, and DSPs. This complexity is causing a crisis in programming systems and performance portability. Several programming systems are working to address these challenges, but the increasing architectural diversity is forcing software stacks and applications to be specialized for each architecture. As we show, all of these approaches critically depend on their software framework for discovery, execution, scheduling, and data orchestration. To address this challenge, we believe that a more agile and proactive software framework is essential to increase performance portability and improve user productivity. To this end, we have designed and implemented IRIS: a performance-portable framework for cross-platform heterogeneous computing. IRIS can discover available resources, manage multiple diverse programming platforms (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, OpenMP) simultaneously in the same execution, respect data dependencies, orchestrate data movement proactively, and provide for user-configurable scheduling. To simplify data movement, IRIS introduces a shared virtual device memory with relaxed consistency among different heterogeneous devices. IRIS also adds an automatic kernel workload partitioning technique using the polyhedral model so that it can resize kernels for a wide range of devices. Our evaluation on three architectures, ranging from Qualcomm Snapdragon to a Summit supercomputer node, shows that IRIS improves portability across a wide range of diverse heterogeneous architectures with negligible overhead.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Parallel quantum computing simulations via quantum accelerator platform virtualization

Quantum circuit execution is a central task in quantum computation. Due to inherent quantum-mechanical constraints, quantum computing workflows often involve a considerable number of independent measurements over a large set of slightly different quantum circuits. Here we discuss a simple model for parallelizing such quantum circuit executions that is based on introducing a large array of virtual quantum processing units (mapped to HPC nodes in our case) as a parallel quantum computing platform. Implemented within the XACC framework, the model can readily take advantage of its backend-agnostic features, enabling parallel quantum computing/simulation over any target backend supported by XACC. We illustrate the performance of this approach by demonstrating strong scaling in two pertinent domain science problems, namely in computing the gradients for the multi-contracted variational quantum eigensolver and in data-driven quantum circuit learning, where we vary the number of qubits and the number of circuit layers. Here, the latter simulation leverages the cuQuantum library to run efficiently on GPU-accelerated HPC platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Automatic Qubit Characterization and Gate Optimization with QubiC

As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to tune up qubits and gates, which cannot easily expand to the large-scale quantum systems. We develop a concise and automatic calibration protocol to characterize qubits and optimize gates using QubiC, which is an open source FPGA (field-programmable gate array) based control and measurement system for superconducting quantum information processors. We propose multi-dimensional loss-based optimization of single-qubit gates and full XY-plane measurement method for the two-qubit CNOT gate calibration. We demonstrate the QubiC automatic calibration protocols are capable of delivering high-fidelity gates on the state-of-the-art transmon-type processor operating at the Advanced Quantum Testbed at Lawrence Berkeley National Laboratory. Finally, the single-qubit and two-qubit Clifford gate infidelities measured by randomized benchmarking are of 4.9(1.1) × 10 -4 and 1.4(3) × 10 -2 , respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Integrate FARM with PID controllers: IES Simulation Ecosystem Control System Development

The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM was designed to support the HERON software module in the solution of the optimal dispatch problem for IES units. As the result of HERON-FARM dispatch simulation, the set-point trajectories are optimized to meet constraints on both the production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and the process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.) at a coarse time resolution (every 10 or 100 seconds) over long time horizons (several days or weeks). In case the operational constraints need to be met at finer time resolution, the computational burden of HERON-FARM would linearly increase with the sampling rate, and sub-optimal solutions might be obtained. System responses characterized by overshoots and damped oscillations temporarily violating the imposed constraints might occur during abrupt power transients. In this report, a hierarchical control system architecture for the operation of the Dynamic Energy Technology and Integration Laboratory (DETAIL) facility constructed at INL was proposed. First, the preliminary studies on the proposed control strategy for operating the facility and the designed PI controllers were reviewed. In particular, the current approach for generating the set-point trajectories was studied, and its limits were identified. To this aim, the inclusion of a Supervisory Control layer embedding a modified version of the FARM algorithm for preserving the system safe operation over both long and real-time horizons was proposed. In this way, FARM would be applied twice, i.e., the original version (“FARM Validator”) aiding the solution of the power dispatch problem, and the modified version (“FARM Supervisory” coordinating the PI controllers to address the real-time control tasks. Despite the kernel of the two modules is the same algorithm, their roles, tasks, and capabilities are quite different. A detailed description of the role of FARM at addressing low-level control tasks is provided, along with tentative operational procedures for training the models embedded into the algorithm by using the collected experimental data.

42 ENGINEERING↗
DOE OSTI2021

Integrated Heat Exchanger-Phase Change Material Thermal Energy Storage System

The purpose of this study is to experimentally investigate the thermal performance of an innovative thermal energy storage (TES) system that combines the advantages of the phase-change material (PCM)/graphite foam latent heat TES medium developed at Argonne National Laboratory (Argonne) and the internally supported plate-fin (ISPE) cell architecture heat transfer fluid (HTF) flow channels developed at Brayton Energy (Brayton). Several essential tasks were accomplished: (1) Thermal property characterization. Thermal properties of the graphite foam were characterized, providing necessary data for experimental result analysis and numerical simulation. (2) Design and optimization of lab-scale test module. Based on Brayton’s full-scale heat exchanger (HX)-TES system, the experimental test module was designed, optimized, and fabricated. (3) Thermal performance testing and data analysis. Five cycle tests were successfully conducted—including one with approximately 3.5 psig of pressure applied to the diaphragms—to investigate the thermal performance of the experimental test module for charging and discharging. Temperature profiles were generated for each charging test and discharging test as a function of time. The temperature profiles clearly show three TES stages: sensible heat (temperature increase), latent heat (melting), and sensible heat (temperature increase) for the charging process. Similarly, the temperature profiles clearly show three thermal energy release stages: sensible heat (temperature decrease), latent heat (solidification), and sensible heat (temperature decrease). Melting and solidification of the PCM generally occurred in relatively narrow temperature ranges, indicated by the flattened temperature regions in the temperature profiles. These phase changes ranged approximately 3°C for melting and 3.5°C for solidification. The charging and discharging temperature profiles were similar for similar experimental parameter tests whether or not pressure was applied to the diaphragm to eliminate the gap between the HX surface and the TES subsystem. This indicates that the effect of a small gap between the HX surface and the TES subsystem is insignificant for charging and discharging. (4) Comparison of experimental data and simulation results. We compared the experimental data to the numerical simulation results. Numerical simulations were conducted by using the ANSYS FLUENT 2019 R3 commercial computational fluid dynamics software. The predicted phase-change times agreed reasonably well with those from the experimental data. In most cases, the estimated time differences between the relative phase changes were within 16%. The predicted start and end times for the charging process agreed well with those from the experimental data. However, the simulation results showed earlier start and end times than the experimental data for the discharging process. Overall, the experimental data and its comparison with the simulation predictions verified the technical viability of the integrated ISPF HX-PCM/graphite foam latent-heat TES system.

25 ENERGY STORAGE↗
DOE OSTI2022

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Enabling Scalable and Extensible Memory-mapped Datastores in Userspace

Exascale workloads are expected to incorporate data-intensive processing in close coordination with traditional physics simulations. These emerging scientific, data-analytics and machine learning applications need to access a wide variety of datastores in flat files and structured databases. Programmer productivity is greatly enhanced by mapping datastores into the application process's virtual memory space to provide a unified “in-memory” interface. Currently, memory mapping is provided by system software primarily designed for generality and reliability. However, scalability at high concurrency is a formidable challenge on exascale systems. Also, there is a need for extensibility to support new datastores potentially requiring HPC data transfer services. In this article, we present UMap , a scalable and extensible userspace service for memory-mapping datastores. Furthermore, through decoupled queue management, concurrency aware adaptation, and dynamic load balancing, UMap enables application performance to scale even at high concurrency. We evaluate UMap in data-intensive applications, including sorting, graph traversal, database operations, and metagenomic analytics. Our results show that UMap as a userspace service outperforms an optimized kernel-based service across a wide range of intra-node concurrency by 1.22-1.9 × . We performed two case studies to demonstrate UMap 's extensibility. First, a new datastore residing in remote memory is incorporated into UMap as an application-specific plugin. Second, we present a persistent memory allocator Metall built atop UMap for unified storage/memory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

STITCHES: a Python package to amalgamate existing Earth system model output into new scenario realizations

Understanding the interaction between humans and the Earth system is a computationally daunting task, with many possible approaches depending on resources available and questions of interest. For example, state-of-the-art impact models require decade-long time series of relatively high frequency, spatially resolved and often multiple variables representing climatic impact-drivers (Ruane et al., 2022). Most commonly these are derived from the outputs of detailed, computationally expensive Earth System Models (ESMs) run according to a standard, limited set of future scenarios, the latest being the SSP-RCPs run under CMIP6/ScenarioMIP (Eyring et al., 2016; O’Neill et al., 2016). At the time of writing, O’Neill et al. (2016) has been cited more than 1750 times and Eyring et al. (2016) more than 5000 times, highlighting the broad, general applications of this data. Often, however, impact modeling seeks to explore new scenarios that were not part of the ScenarioMIP protocol, and/or needs a larger set of initial condition ensemble members than are typically available to quantify the effects of ESM internal variability. In addition, the recognition that the human and Earth systems are fundamentally intertwined, and may feature potentially significant feedback loops, is making integrated, simultaneous modeling of the coupled human-Earth system increasingly necessary, if computationally challenging with most existing tools (Thornton et al., 2017). For impact modelers, climate model emulators can be the answer to meet both the needs of: 1) creating realizations for novel scenarios and 2) achieving a simplified, computationally tractable representation of ESM behavior in a coupled human-Earth system modeling framework. We proposed a new, comprehensive approach to such emulation of gridded, multivariate ESM outputs for novel scenarios without the computational cost of a full ESM, STITCHES (Tebaldi et al., 2022). The approach outlined in Tebaldi et al. (2022) should be extensible to future CMIP eras, although the STITCHES software at present is strictly focused on CMIP6/ScenarioMIP data hosted on Pangeo (https://gallery.pangeo.io/repos/pangeo-gallery/cmip6/). The corresponding STITCHES Python package uses existing archives of ESMs’ scenario experiments from CMIP6/ScenarioMIP to construct gridded, multivariate realizations of new scenarios provided by reduced complexity climate models (Hartin et al., 2015; Meinshausen et al., 2011; Smith et al., 2018), or to enrich existing initial condition ensembles. Its output provides the same characteristics as the emulated ESM output: multivariate (spanning potentially all variables that the ESM has saved), spatially resolved (down to the native grid of the ESM), and preserving the same high frequency as the original data. A new realization of multiple variables can be generated on the order of minutes with STITCHES, rather than the hours or sometimes days that ESMs require.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

"Soiling, Cleaning, and Abrasion: The Results of the Five-Year Photovoltaic Glass Coating Field Study" [Slides]

External contamination ("soiling") of the incident surface is a major limiting factor for solar technologies. A 5-year field glass coupon study was conducted to better understand external contamination and its effects; compare cleaning methods and the use of preventative coatings; and explore the abrasion resulting from cleaning to advise on accelerated abrasion testing. Test sites included the cities of Dubai (UAE), Kuwait City (Kuwait), Mesa (AZ), Mumbai (India), and Sacramento (CA). Through the 5-year cumulative study, dry brush, water spray, and wet sponge and squeegee cleaning methods were compared to no cleaning. Optical microscopy was used to obtain images, including representative color images, grayscale images for object analysis, and oblique images for coating integrity assessment. A thresholding protocol was developed to analyze and distinguish specimens using the ImageJ software. Optical performance was quantified using a spectrophotometer, including comprehensive optical characterization (transmittance, reflectance, and absorptance in addition to forward- and back-scattering). Atomic force microscopy was used to verify the abrasion damage morphology, including the width and depth of surface scratches. Analysis of the results included correlation of optical performance and particle area coverage, rank order (by coating or location), and the acceleration factor for abrasion damage. The efficacy of external cleaning was more readily distinguished from the effectiveness of antisoiling coatings. The acceleration factor for dry brush cleaning of a porous silica coating was found to be on the order of unity.

14 SOLAR ENERGY↗
DOE OSTI2024

Retrofitting Holcim Ste. Genevieve Cement Plant with CO2 Capture Plant Using Air Liquide Cryocap™ FG Technology

The global cement manufacturing industry is a major contributor to carbon dioxide emissions. The International Energy Agency's "Net Zero Emissions by 2050 Scenario" identifies CCS as a major strategy for meeting that goal. This project is among the first attempts to transfer capture technology developed at coal-fired power plants to the cement industry. The main objective of the project is to execute and complete a front-end engineering and design (FEED) studies for commercial-scale, carbon capture projects that separates 95% of the total CO2 emissions at the Holcim (US) Ste. Genevieve cement manufacturing facility using Air Liquide’s Pressure Swing Adsorption system (PSA) assisted Cryocap™ technology. The Holcim Ste. Genevieve cement plant in Missouri, US, boasts one of the largest single cement production lines in the world, with a capacity of approximately 12,000 t/day. The plant currently uses traditional fuels, namely coal and petcoke. The captured CO2 will be pipeline and geological storage grade. The industrial host site emits approximately 3.0 million tonne CO2/yr. Air Liquide’s Cryocap™ technology has been developed over the last 18+ years for CO2 capture applications. It has been shown to be applicable to a variety of industrial applications (e.g., steel, cement, SMR, Fluidized Catalytic Crackers (FCCs)). Cryocap™ FG consists of a Pressure Swing Adsorption (PSA) unit coupled with a Cryogenic System. The PSA pre-concentrates the CO2 from the flue gas, while the cryogenic unit enables the CO2 purity to be increased to the desired level. The project team is led by the Prairie Research Institute at the University of Illinois at Urbana-Champaign. The tasks include: complete FEED study for retrofitting the industrial facility with a carbon capture system to support developing a detailed cost estimate; business case analysis outlining the anticipated revenue and credits if projects was built and operated; technoeconomic analysis (TEA) outlining how capture system achieves DOE capture goals; and life cycle (LCA) analysis demonstrating zero net carbon emissions. The FEED study was successfully completed. This includes completing the process basis of design; preliminary engineering; outside battery limits (OSBL) detailed engineering including a Zero Liquid Discharge (ZLD) wastewater treatment system; inside battery limits (ISBL) detailed engineering [1]. An overall project capital cost estimate within a -20%/+30% accuracy was developed. The major contributors to the Total Plant Cost (TPC), by system, are the costs associated with the Outside Battery Limit (OSBL) section of the plant which includes a new river water intake structure and a Zero Liquid Discharge (ZLD) system. By cost category, the major contributors to the TPC are equipment and subcontractor costs, followed closely by engineering, construction management, home office and contractor fees. The TEA has been created to reflect the findings of the project. It analyzes the economic performance of the Cryocap™ technology by reviewing the estimated capital costs, operating cost, and revenue. The Cost of Capture (COC) associated with the Cryocap™ technology for 95% CO2 capture, when considering NETL 2018 economic assumptions (42/58 debt/equity ratio, 5.15% interest on debt and 1.42% return on equity in real dollars) and 2022 economic assumptions (42/58 debt/equity ratio, 8.82% interest on debt and 4.90% return on equity in real dollars) was found to be much lower than that for the DOE-NETL’s base-line cases. The highest contributors to the COC are annualized capital expenditures (CAPEX) and electricity consumption which can be offset by using lower cost renewable sources. The LCA was conducted using OpenLCA which is an open-source software that is recommended by NETL. The database utilized for this study was a modified version of TRACI 2.1 (developed by the US. Environmental Protection Agency’s National Risk Management Research Laboratory and modified by NETL). The Cryocap™ FG technology does not consume fuels in significant quantities and does not utilize specialized chemical solvents subject to decomposition, such as those utilized in amine-based carbon capture systems. The Cryocap™ FG technology mainly utilizes electricity as its energy input; hence, its calculated emissions are mainly associated with the generation of electricity offsite and are dependent on the energy matrix of the grid at the time of project implementation. The water consumption impact of the Cryocap™ FG is mostly for makeup of the water lost by evaporation in the cooling tower; however, the carbon capture plant will be equipped with a ZLD system to avoid effluent streams and minimize water consumption. The successful construction and operation of this plant based on this study results will provide a means to demonstrate an economically attractive and transformational capture technology that can be used to retrofit existing plants and be deployed at new plants.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2020

Pahute Mesa-Oasis Valley Hydrostratigraphic Framework Model for Corrective Action Units 101 and 102: Central and Western Pahute Mesa, Nye County, Nevada (Rev. 0)

A new, revised three-dimensional (3-D) hydrostratigraphic framework model (HFM) for the Central and Western Pahute Mesa Corrective Action Units 101 and 102 was completed in 2019. The initial (Phase I) model was completed in 2002 and was documented in A Hydrostratigraphic Model and Alternatives for the Groundwater Flow and Contaminant Transport Model of Corrective Action Units 101 and 102: Central and Western Pahute Mesa, Nye County, Nevada (BN, 2002). Subsequent flow and transport modeling revealed the need to collect additional data to reduce uncertainties. The Phase II data collection and characterization effort included extensive well drilling and testing activities, and rebuilding of the Phase I 3-D HFM, resulting in the Phase II HFM (NSTec, 2014). Further drilling (Well ER-20-12), data collection, and interpretive work (e.g., Thirsty Canyon Lineament [Wurtz and Day, 2018]) were incorporated into the Pahute Mesa-Oasis Valley (PM-OV) HFM. The PM-OV HFM incorporates the area of interest from the Phase II HFM and adds additional areas, primarily to the north and west with minor additions to the south and east. The new, expanded area matches the PM-OV groundwater basin as defined in Fenelon et al. (2016) and includes Pahute Mesa, a former nuclear testing area at the Nevada National Security Site; and Oasis Valley, a groundwater discharge area downgradient from contaminant source areas on Pahute Mesa. The data and information necessary to build the PM-OV HFM are provided in Navarro (2019). The PM-OV HFM will be used by hydrologic modelers who are tasked with developing a model to determine how contaminants are transported by groundwater flow in an area of complex geology. The model area is large (more than 6,250 square kilometers) and geologically complex, including Paleozoic- to Mesozoic-age structures (e.g., thrust faults, Thirsty Canyon Lineament), at least seven Tertiary-age calderas, several intrusive bodies, and many relatively recent basin-and-range normal faults. Investigators from the U.S. Geological Survey; National Security Technologies, LLC; National Laboratories; and U.S. Department of Energy contractors have organized the more than 300 volcanic units and other rocks in the model area into 77 hydrostratigraphic units (HSUs). The volcanic rocks are subdivided into 42 aquifers, 11 confining units, and 9 composite units (containing both aquifer and confining unit rocks). The underlying pre-Tertiary rocks were divided into 5 HSUs, comprising 2 aquifers and 3 confining units. The model also includes 1 alluvial aquifer unit, 8 intrusive confining units, and 1 granite confining unit. The model depicts the thickness, extent, and geometric relationships of these HSUs (“layers” in the model) along with all the major structural features that control them, including calderas and faults. The most substantive differences between the Phase II HFM and the PM-OVHFM include (1) addition of the new data and resulting revised interpretations from the additional area encompassed by the PM-OV groundwater basin; (2) incorporation of 16 new faults; (3) 12 boreholes from the northern extension; (4) 2 additional caldera-collapse collars; and (5) correlation of the simulated faulting and hydrostratigraphy in the eastern part of the model domain with the delineations represented in the neighboring Rainier Mesa-Shoshone Mountain HFM-Prime and Yucca Flat-Climax Mine HFM. All PM-OV HFM delineations were based on published and unpublished data from geophysical investigations, surface geologic maps, and drill-hole records. Phase II approached model uncertainty using the model-building software to test model configurations and hydrologic consequences using a range of values for parameters such as fault offset amounts and HSU elevations. The PM-OV HFM expands on this approach to encompass the entire PM-OV groundwater basin.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Learning Global Proliferation Expertise Evolution Using AI-Driven Analytics and Public Information

Detecting and anticipating global proliferation expertise and capability evolution from unstructured, noisy, and incomplete public data streams is a highly desired, but extremely challenging task. Here, in this article, we present our pioneering data-driven approach to support the non-proliferation mission to detect and explain the evolution of proliferation expertise and capability development globally from terabytes of publicly available information (PAI), focusing on our knowledge extraction pipeline and descriptive analytics. We first discuss how we fuse nine open-source data streams, including multilingual data, to convert 4 TB of unstructured data to structured knowledge and encode dynamically evolving proliferation expertise representations—content and context graphs. For this, we rely on natural language processing (NLP) and deep learning (DL) models to perform information extraction, topic modeling, and distributed text representation (aka embedding) learning. We then present interactive, usable, and explainable descriptive analytics to refine domain knowledge and present it in a human-understandable form. Finally, we introduce future work avenues that will leverage our dynamic knowledge representations and descriptive analytics to enable predictive and prescriptive inferences to achieve real-time domain understanding and contextual reasoning about global proliferation expertise and capability evolution.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2025

GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning

Large language models (LLMs) are increasingly adapted to downstream tasks via reinforcement learning (RL) methods like Group Relative Policy Optimization (GRPO), which often require thousands of rollouts to learn new tasks. We argue that the interpretable nature of language often provides a much richer learning medium for LLMs, compared to policy gradients derived from sparse, scalar rewards. To test this, we introduce GEPA (Genetic-Pareto), a prompt optimizer that thoroughly incorporates natural language reflection to learn high-level rules from trial and error. Given any AI system containing one or more LLM prompts, GEPA samples trajectories (e.g., reasoning, tool calls, and tool outputs) and reflects on them in natural language to diagnose problems, propose and test prompt updates, and combine complementary lessons from the Pareto frontier of its own attempts. As a result of GEPA's design, it can often turn even just a few rollouts into a large quality gain. Across six tasks, GEPA outperforms GRPO by 6% on average and by up to 20%, while using up to 35x fewer rollouts. GEPA also outperforms the leading prompt optimizer, MIPROv2, by over 10% (e.g., +12% accuracy on AIME-2025), and demonstrates promising results as an inference-time search strategy for code optimization. We release our code at https://github.com/gepa-ai/gepa.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Encoding integers and rationals on neuromorphic computers using virtual neuron

Abstract Neuromorphic computers emulate the human brain while being extremely power efficient for computing tasks. In fact, they are poised to be critical for energy-efficient computing in the future. Neuromorphic computers are primarily used in spiking neural network–based machine learning applications. However, they are known to be Turing-complete, and in theory can perform all general-purpose computation. One of the biggest bottlenecks in realizing general-purpose computations on neuromorphic computers today is the inability to efficiently encode data on the neuromorphic computers. To fully realize the potential of neuromorphic computers for energy-efficient general-purpose computing, efficient mechanisms must be devised for encoding numbers. Current encoding mechanisms (e.g., binning, rate-based encoding, and time-based encoding) have limited applicability and are not suited for general-purpose computation. In this paper, we present the virtual neuron abstraction as a mechanism for encoding and adding integers and rational numbers by using spiking neural network primitives. We evaluate the performance of the virtual neuron on physical and simulated neuromorphic hardware. We estimate that the virtual neuron could perform an addition operation using just 23 nJ of energy on average with a mixed-signal, memristor-based neuromorphic processor. We also demonstrate the utility of the virtual neuron by using it in some of the μ -recursive functions, which are the building blocks of general-purpose computation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Photometric redshifts for the S-PLUS Survey: Is machine learning up to the task?

The Southern Photometric Local Universe Survey (S-PLUS) is a novel project that aims to map the Southern Hemisphere using a twelve filter system, comprising five broad-band SDSS-like filters and seven narrow-band filters optimized for important stellar features in the local universe. In this paper we use the photometry and morphological information from the first S-PLUS data release (S-PLUS DR1) cross-matched to unWISE data and spectroscopic redshifts from Sloan Digital Sky Survey DR15. We explore three different machine learning methods (Gaussian Processes with GPz and two Deep Learning models made with TensorFlow) and compare them with the currently used template-fitting method in the S-PLUS DR1 to address whether machine learning methods can take advantage of the twelve filter system for photometric redshift prediction. Using tests for accuracy for both single-point estimates such as the calculation of the scatter, bias, and outlier fraction, and probability distribution functions (PDFs) such as the Probability Integral Transform (PIT), the Continuous Ranked Probability Score (CRPS) and the Odds distribution, we conclude that a deep-learning method using a combination of a Bayesian Neural Network and a Mixture Density Network offers the most accurate photometric redshifts for the current test sample. In conclusion, it achieves single-point photometric redshifts with scatter (σ NMAD ) of 0.023, normalized bias of -0.001, and outlier fraction of 0.64% for galaxies with r_auto magnitudes between 16 and 21.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Using a Large Language Model as a Building Block to Generate Usable Validation and Verification Suite for OpenMP

In the HPC area, both hardware and software move quickly. Often new hardware is developed and deployed, the corresponding software stack, including compilers and other tools, are under active development while leading edge software developers are working to port and tune their applications, all at the same time. While the software ecosystem is in flux, one of the key challenges for users is obtaining insight into the state of implementation of key features in the programming languages and models their applications are using – whether they have been implemented, and whether the implementation conforms to the specification, especially for newly implemented features (less tested by widespread use). OpenMP is one of the most prominent shared memory programming models used for on-node programming in HPC. With the shift towards accelerators (such as GPUs and FPGAs) and heterogeneous programming OpenMP features are getting more complex. It is natural to ask whether generative AI approaches, and large language models (LLMs) in particular, can help in producing validation and verification test suites to allow users better and faster insights into the availability and correctness of OpenMP features of interest. In this work, we explore the use of ChatGPT-4 to generate a suite of tests for OpenMP features. We have chosen a set of directives and clauses, a total of 78 combinations, which first appeared in OpenMP 3.0 (released in May 2008) but are also relevant for accelerators. We prompted ChatGPT to generate tests in the C and Fortran languages, for both host (CPU) and device (accelerator). On the Summit super-computer using the GNU implementation, we found that, of the 78 generated tests 67 C tests and 43 Fortran tests compiled successfully and fewer than those executed to completion. On further analysis we show that not all generated tests are valid. We document the process, results, and provide detailed analysis regarding the quality of tests generated. With the aim of providing input to a production quality validation and verification suite, we manually implement the corrections required to make the tests valid according to the current OpenMP specification. We quantify this effort as small, medium, or large, and record the lines of code changed to correct the invalid tests. With the corrected tests we validate recent implementations from HPE, AMD, and GNU on the Frontier supercomputer. Our experiment and subsequent analysis show that although LLMs are capable of producing HPC specific codes, they are limited by their understanding of the deeper semantics and restrictions of programming models such as OpenMP. Unsurprisingly more commonly used features have better support, while some OpenMP 3.0 directives such as sections and tasking are not universally supported on accelerators. We demonstrate that successful compilation and execution to completion are inadequate metrics for evaluating generated code and that, at this time, commodity LLMs require expert intervention for code verification. This points to gaps in the training data that is currently available for HPC. We demonstrate that with "small" effort 37% of generated invalid C tests and 63% of generated invalid Fortran tests could be corrected. This improves productivity of test generation as we circumvent writing from scratch and the common programming errors associated with it.

Pophale, Swaroop [ORNL] (ORCID:0000000185446367)↗