SEARCH · Search NASA

Results for “explorations”

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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Exploring thermal equilibria of the Fermi-Hubbard model with variational quantum algorithms

Here, this study investigates the thermal properties of the repulsive Fermi-Hubbard model with chemical potential using variational quantum algorithms, crucial in comprehending particle behaviour within lattices at heightened temperatures in condensed matter systems. Conventional computational methods encounter challenges, especially in managing chemical potential, prompting exploration into Hamiltonian approaches. Despite the promise of quantum algorithms, their efficacy is hampered by coherence limitations when simulating extended imaginary time evolution sequences. To overcome these constraints, this research focuses on optimizing variational quantum algorithms to probe the thermal properties of the Fermi-Hubbard model. Physics-inspired circuit designs are tailored to alleviate coherence constraints, facilitating a more comprehensive exploration of materials at elevated temperatures. Our study demonstrates the potential of variational algorithms in simulating the thermal properties of the Fermi-Hubbard model while acknowledging limitations stemming from error sources in quantum devices and encountering barren plateaus.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2021

Exploring origins for correlations between flow harmonics and transverse momentum in small collision systems

High statistics data sets from experiments at the Relativistic Heavy Ion Collider (RHIC) and the Large Hadron Collider (LHC) with small and large collision species have enabled a wealth of new flow measurements, including the event-by-event correlation between observables. One exciting such observable $ρ(v^2_n, [p_T])$ gauges the correlation between the mean transverse momentum of particles in an event and the various flow coefficients (v n ) in the same event [P. Bozek, Phys. Rev. C 93, 044908 (2016)]. Recently it has been proposed that very low multiplicity events may be sensitive to initial-state glasma correlations [G. Giacalone, B. Schenke, and C. Shen, Phys. Rev. Lett. 125, 192301 (2020)] rather than flow-related dynamics. We find utilizing the ip-jazma framework that the color domain explanation for the glasma results are incomplete. We then explore predictions from pythia8, and the version for including nuclear collisions called pythia-angantyr, which have only nonflow correlations, and from the ampt model which has both nonflow and flow-type correlations. We find that pythia-angantyr has nonflow contributions to $ρ(v^2_n, [p_T])$ in p + O, p + Pb, and O + O collisions that are positive at low multiplicity and comparable to the glasma correlations. It is striking that in pythia8 in p + p collisions there is actually a sign change from positive to negative $ρ(v^2_n, [p_T])$ as a function of multiplicity. The ampt results match the experimental data general trends in Pb+Pb collisions at the LHC, except at low multiplicity where ampt has the opposite sign. In p + Pb collisions, ampt has the opposite sign from experimental data and we explore this within the context of parton geometry. Predictions for p + O, O + O, and Xe + Xe are also presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Graph reinforcement learning for exploring model spaces beyond the standard model

We present a methodology for performing scans of beyond the standard model (BSM) parameter spaces with reinforcement learning. We identify a novel procedure using graph neural networks that is capable of exploring spaces of models without the user specifying a fixed particle content, allowing broad classes of BSM models to be explored—in theory, the technique is applicable to nearly any model space with a prespecified gauge group. We provide a generic procedure by which a suitable graph grammar can be developed for any BSM model that features user-specified symmetry groups and a finite number of different possible particle species, the use of which is applicable to a variety of machine learning tasks over the actions of BSM theories beyond our particular reinforcement learning use case. As a proof of concept, we construct the graph grammar for theories with vectorlike leptons that may or may not be charged under a dark U ( 1 ) group, inspired by portal matter extensions of the sub-GeV vector portal/kinetic mixing simplified dark matter models. We then use this graph grammar to create a reinforcement learning environment tasked with creating models with these vectorlike leptons that are consistent with a list of a variety of precision observables. The reinforcement learning agent succeeds in developing models that can address the observed muon anomalous magnetic moment discrepancy while remaining consistent with flavor violation and electroweak precision observables, including both constructions that have previously been studied as well as new models that have not, to our knowledge, previously been identified. By inspecting the resulting ensembles of models that the agent produces and experimenting with different configurations for our reinforcement learning environment and graph grammar, we also infer various lessons about the development of these environments that can be transferable to reinforcement learning scans of more complicated model spaces and comment on future directions for the development of this technique into a more mature tool. Published by the American Physical Society 2025

Wojcik, George N.↗

DOE OSTI2024

Crystallographic map: A general lattice and basis formalism enabling efficient and discretized exploration of crystallographic phase space

Three-dimensional lattices are fundamental to solid-state physics. The description of a lattice with an atomic basis constitutes the necessary information to predict solid phase properties and evolution. Here, we present an algorithm for systematically exploring crystallographic phase space. Further, coupled with ab initio techniques, such as density functional theory, this algorithm offers an approach for exploring and tuning materials behavior, with a broad range of potential applications: particularly martensitic phase transformations and materials stability.

36 MATERIALS SCIENCE↗

DOE OSTI2021

NeuralCubes: Deep Representations for Visual Data Exploration

Visual exploration of large multi-dimensional datasets has seen tremendous progress in recent years, allowing users to express rich data queries that produce informative visual summaries, all in real time. Techniques based on data cubes are some of the most promising approaches. However, these techniques usually require a large memory footprint for large datasets. To tackle this problem, we present NeuralCubes: neural networks that predict results for aggregate queries, similar to data cubes. NeuralCubes learns a function that takes as input a given query, for instance, a geographic region and temporal interval, and outputs the result of the query. The learned function serves as a real-time, low-memory approximator for aggregation queries. Our models are small enough to be sent to the client side (e.g. the web browser for a web-based application) for evaluation, enabling data exploration of large datasets without database/network connection. Here, we demonstrate the effectiveness of NeuralCubes through extensive experiments on a variety of datasets and discuss how NeuralCubes opens up opportunities for new types of visualization and interaction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Blending Machine Learning and Interaction Design in Audio Explorer

The results of machine learning models can often be difficult to interpret, especially for domain experts. Audio Explorer, the winning entry of the 2018 VAST Challenge, is an interactive data exploration tool that effectively communicates machine learning results, using coordinated geospatial, temporal, and auditory visualizations to promote information discovery.

Visual analytics, VAST Challenge↗

DOE OSTI2024

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using highperformance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. Finally, we evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A Novel Active Optimization Approach for Rapid and Efficient Design Space Exploration Using Ensemble Machine Learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) that fits high-level information about the response surface and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected for evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. Additionally, this methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface and, subsequently, to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to conventional optimization techniques, such as particle swarm and genetic algorithm-based optimization techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

A novel active optimization approach for rapid and efficient design space exploration using ensemble machine learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) which fits high-level information about the response surface, and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner, is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected to be evaluated using expensive function evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. This methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface. The performance of the new active learning approach is compared with traditional global optimization methods, namely micro-genetic algorithm (pGA) and particle swarm optimization (PSO). It is demonstrated that the new optimizer is able to reach the global optimum much faster with a significantly fewer number of function evaluations. Subsequently, the new optimizer is also applied to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is again found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to particle swarm and genetic algorithm-based optimization techniques.

Machine learning, active learning, design optimiza↗

DOE OSTI2022

Reflections on Cyanobacterial Chromatic Acclimation: Exploring the Molecular Bases of Organismal Acclimation and Motivation for Rethinking the Promotion of Equity in STEM

Cyanobacteria are photosynthetic organisms that exhibit characteristic acclimation and developmental responses to dynamic changes in the external light environment. Photomorphogenesis is the tuning of cellular physiology, development, morphology, and metabolism in response to external light cues. The tuning of photosynthetic pigmentation, carbon fixation capacity, and cellular and filament morphologies to changes in the prevalent wavelengths and abundance of light have been investigated to understand the regulation and fitness implications of different aspects of cyanobacterial photomorphogenesis. Chromatic acclimation (CA) is the most common form of photomorphogenesis that has been explored in cyanobacteria. Multiple types of CA in cyanobacteria have been reported, and insights gained into the regulatory pathways and networks controlling some of these CA types. I examine the recent expansion of CA types that occur in nature and provide an overview of known regulatory factors involved in distinct aspects of cyanobacterial photomorphogenesis. Additionally, I explore lessons for cultivating success in scientific communities that can be drawn from a reflection on existing knowledge of and approaches to studying CA.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗

DOE OSTI2026

Exploring the QCD phase diagram through correlations and fluctuations

The exploration of the Quantum Chromodynamics (QCD) phase diagram is a central goal of relativistic heavy-ion collision experiments. This review focuses on the role of fluctuations and correlations as sensitive probes of the phase structure. We discuss theoretical advancements and experimental methodologies employed to map the QCD phase diagram, highlighting constraints derived from both lattice QCD calculations and existing experimental data. Key observables such as cumulants and factorial cumulants of conserved charges (e.g., net-proton, net-charge) are explored as promising signatures of phase transitions and the QCD critical point. We discuss how these quantities are measured experimentally and compared with theoretical predictions, addressing challenges and best practices for meaningful comparisons. Special attention is given to predictions and current experimental results at high baryon density, including recent findings from the STAR collaboration at RHIC. Finally, we identify open issues and future directions for fluctuation and correlation studies at lower collision energies, relevant for future measurements, for example by the CBM experiment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Exploring Architectural-Aware Affinity Policies in Modern HPC Runtimes

Modern commodity and High-Performance Computing (HPC) systems are evolving with complex CPU architectures. These architectures now feature higher core and NUMA domain counts and implement features such as hyperthreading. When considering significant differences in hardware configurations, library availability, and hardware-tailored system/software stacks, which could substantially vary from one system to another, performance portability is hard to achieve. Throughout the years, this trend resulted in an increasingly high burden on application developers to fine-tune their workloads for each architecture. This work explores how hardware-dependent aspects such as locality/process/thread affinity affect performance in modern CPU architectures. We focus our study on the Global Memory and Threading (GMT) distributed runtime system as a representative of Partitioned Global Address Space (PGAS) software stacks commonly adopted for productivity. In particular, to appreciate performance implications, we evaluate GMT’s thread affinity policies, and, introduce two new ones which exploit architectural awareness. Finally, we explore alternative NUMA configurations via different process bindings and perform a scalability study on three HPC clusters with varying CPU architectures and NUMA layouts. Our analysis indicates that more complex architectures are more affected by affinity and binding policies and highlights the importance of setting proper runtime configurations to achieve superior performance.

Di Dio Lavore, Ian↗

DOE OSTI2026

BrickQA: Bridging the Semantic Gap in Building Operations with Dynamic Graph Exploration

While standardized ontologies like the Brick schema address data heterogeneity in Building Automation Systems (BAS), accessing this semantic data remains a challenge as domain experts often lack the expertise to formulate complex SPARQL queries. To bridge this gap, we present BrickQA, a Large Language Model (LLM)-based framework that translates natural language into executable SPARQL queries through structured query decomposition, dynamic schema exploration, and inline validation. BrickQA utilizes an iterative reasoning agent to actively navigate graph topology through dynamic exploration actions without requiring exhaustive context injection or model fine-tuning. This approach effectively mitigates hallucinations, particularly in large-scale building knowledge graphs. Empirical evaluation on BuildingQA, a standardized benchmark, demonstrates that BrickQA significantly outperforms ReAct baselines, delivering a 0.291–0.355 absolute F1 improvement while achieving 3 × –12.7 × higher token cost-efficiency. Beyond these metrics, the framework maintains structural fidelity across heterogeneous buildings and remains resilient to ambiguous queries without requiring site-specific fine-tuning. Furthermore, a case study on operational analytics validates the framework’s capability to handle temporal and aggregation constraints, effectively transforming abstract semantic models into actionable facility management insights.1

Ko, Yun-Dam↗

DOE OSTI2021

Transformer eXplainability and eXploration

The Transformer eXplainability and eXploration library is intended to aid in the explorability and explainability of transformer classification networks, or transformer language models with sequence classification heads. The basic function of this library is to take a trained transformer and test/train dataset and produce an ipywidget dashboard which can be displayed in a jupyter notebook or in jupyter lab.

Martindale, Nathan [Oak Ridge National Lab. (ORNL)↗

DOE OSTI2021

DXT Explorer v0.1

DTX Explorer is a tool to generate interactive data visualizations of Darshan I/O traces collected from HPC applications. Its goal is to provide an easy and interactive way for researchers and developers to explore their application's I/O behavior and detect possible I/O bottlenecks that are impacting performance.

Bez, Jean Luca↗

DOE OSTI2022

DXT Explorer v2.0

Bez, JeanLuca↗

DOE OSTI2023

Exploring Randomly Wired Neural Networks for Climate Model Emulation

Exploring the climate impacts of various anthropogenic emissions scenarios is key to making informed decisions for climate change mitigation and adaptation. State-of-the-art Earth system models can provide detailed insight into these impacts but have a large associated computational cost on a per-scenario basis. This large computational burden has driven recent interest in developing cheap machine learning models for the task of climate model emulation. In this paper, we explore the efficacy of randomly wired neural networks for this task. We describe how they can be constructed and compare them with their standard feedforward counterparts using the ClimateBench dataset. Specifically, we replace the serially connected dense layers in multilayer perceptrons, convolutional neural networks, and convolutional long short-term memory networks with randomly wired dense layers and assess the impact on model performance for models with 1 million and 10 million parameters. We find that models with less-complex architectures see the greatest performance improvement with the addition of random wiring (up to 30.4% for multilayer perceptrons). Furthermore, of 24 different model architecture, parameter count, and prediction task combinations, only one had a statistically significant performance deficit in randomly wired networks relative to their standard counterparts, with 14 cases showing statistically significant improvement. We also find no significant difference in prediction speed between networks with standard feedforward dense layers and those with randomly wired layers. These findings indicate that randomly wired neural networks may be suitable direct replacements for traditional dense layers in many standard models.

54 ENVIRONMENTAL SCIENCES↗