Search NASA⌕ Search

SEARCH · Search NASA

Results for “combinatorial data”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Geometric GNNs for charged particle tracking at GlueX

Nuclear physics experiments are aimed at uncovering the fundamental building blocks of matter. The experiments involve high-energy collisions that produce complex events with many particle trajectories. Tracking charged particles resulting from collisions in the presence of a strong magnetic field is critical to enable the reconstruction of particle trajectories and precise determination of interactions. It is traditionally achieved through combinatorial approaches that scale worse than linearly as the number of hits grows. Since particle hit data naturally form a point cloud and can be structured as graphs, graph neural networks (GNNs) emerge as an intuitive and effective choice for this task. In this study, we evaluate the GNN model for track finding on the data from the GlueX experiment at Jefferson Lab. We use simulation data to train the model and test on both simulation and real GlueX measurements. We demonstrate that GNN-based track finding outperforms the currently used traditional method at GlueX in terms of segment-based efficiency at a fixed purity while providing faster inferences. We show that the GNN model can achieve significant speedup by processing multiple events in batches, which exploits the parallel computation capability of graphical processing units (GPUs). Finally, we compare the GNN implementation on GPU and field-programmable gate array and describe the trade-off.

batched GNN pipeline↗
DOE OSTI2022

Accelerated Discovery of Solar Thermochemical Hydrogen Production Materials via High-Throughput Computational and Experimental Methods

In this project, combinatorial synthesis and testing methods were combined with high-throughput materials theory calculations to greatly accelerate the discovery of thermodynamically suitable candidates for green hydrogen production via a two-stage solar thermochemical water splitting (STCH) process. Over the course of the project, more than 8000 quinary and higher oxide compositions were computationally screened for STCH viability, and detailed stability calculations were performed for more than 30 of the most promising identified compositional archetypes. As a result, three new STCH capable compositional families were discovered and experimentally verified. The first, Ce x Sr 2-x MnO 4 (CSM), represents the first known Ruddlesden-Popper compound to show STCH activity, and thus demonstrates that perovskite-related structures may hold promise for this application. The second family, Sr 1-x Ce x MnO 3 (SCM), is the simple perovskite sister-analog to CSM. Sr 0.7 Ce 0.3 MnO 3 (SCM30), a member of this compositional family, was found to produce the highest hydrogen yields of any compound tested in this project, exceeding the end of project milestone target of > 150 μmol H 2 /gram oxide at a reduction temperature of 1350 °C, although only at steam-to-hydrogen ratios greater than 1000:1. Finally, we proved that a third novel Sr-and Mn-containing family, Sr 1-x Ca x Ti 1-y Mn y O 3 (SCTM), which was identified by Materials Project tools, also splits water. The behavior of the SCTM system was found to be similar to the previously discovered Sr 1-x La x Al 1-y Mn y O 3 (SLMA) family, albeit with lower H 2 yields. Across the three thrusts of the project (computational, combinatorial, and bulk testing), five journal articles were published. As part of Program End Analysis and Data Dissemination, relevant data used for the publications was uploaded to the HydroGEN Data Hub for public access, and in certain cases, results were added to public materials databases.

08 HYDROGEN↗
DOE OSTI2022

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Deducing subnanometer cluster size and shape distributions of heterogeneous supported catalysts

Abstract Infrared (IR) spectra of adsorbate vibrational modes are sensitive to adsorbate/metal interactions, accurate, and easily obtainable in-situ or operando. While they are the gold standards for characterizing single-crystals and large nanoparticles, analogous spectra for highly dispersed heterogeneous catalysts consisting of single-atoms and ultra-small clusters are lacking. Here, we combine data-based approaches with physics-driven surrogate models to generate synthetic IR spectra from first-principles. We bypass the vast combinatorial space of clusters by determining viable, low-energy structures using machine-learned Hamiltonians, genetic algorithm optimization, and grand canonical Monte Carlo calculations. We obtain first-principles vibrations on this tractable ensemble and generate single-cluster primary spectra analogous to pure component gas-phase IR spectra. With such spectra as standards, we predict cluster size distributions from computational and experimental data, demonstrated in the case of CO adsorption on Pd/CeO 2 (111) catalysts, and quantify uncertainty using Bayesian Inference. We discuss extensions for characterizing complex materials towards closing the materials gap.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2009

Parametric Analysis of a Hover Test Vehicle using Advanced Test Generation and Data Analysis

Large complex aerospace systems are generally validated in regions local to anticipated operating points rather than through characterization of the entire feasible operational envelope of the system. This is due to the large parameter space, and complex, highly coupled nonlinear nature of the different systems that contribute to the performance of the aerospace system. We have addressed the factors deterring such an analysis by applying a combination of technologies to the area of flight envelop assessment. We utilize n-factor (2,3) combinatorial parameter variations to limit the number of cases, but still explore important interactions in the parameter space in a systematic fashion. The data generated is automatically analyzed through a combination of unsupervised learning using a Bayesian multivariate clustering technique (AutoBayes) and supervised learning of critical parameter ranges using the machine-learning tool TAR3, a treatment learner. Covariance analysis with scatter plots and likelihood contours are used to visualize correlations between simulation parameters and simulation results, a task that requires tool support, especially for large and complex models. We present results of simulation experiments for a cold-gas-powered hover test vehicle.

Gundy-Burlet, Karen↗
DOE OSTI2024

Multi-Agent Graph-Attention Deep Reinforcement Learning for Post-Contingency Grid Emergency Voltage Control

Grid emergency voltage control (GEVC) is paramount in electric power systems to improve voltage stability and prevent cascading outages and blackouts in case of contingencies. While most deep reinforcement learning (DRL)-based paradigms perform single agents in a static environment, real-world agents for GEVC are expected to cooperate in a dynamically shifting grid. Moreover, due to high uncertainties from combinatory natures of various contingencies and load consumption, along with the complexity of dynamic grid operation, the data efficiency and control performance of the existing DRL-based methods are challenged. To address these limitations, we propose a multi-agent graph-attention (GATT)-based DRL algorithm for GEVC in multi-area power systems. Here, we develop graph convolutional network (GCN)-based agents for feature representation of the graph-structured voltages to improve the decision accuracy in a data-efficient manner. Furthermore, a cutting-edge attention mechanism concentrates on effective information sharing among multiple agents, synergizing different-sized subnetworks in the grid for cooperative learning. We address several key challenges in the existing DRL-based GEVC approaches, including low scalability and poor stability against high uncertainties. Test results in the IEEE benchmark system verify the advantages of the proposed method over several recent multi-agent DRL-based algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗
DOE OSTI2025

CAML: Commutative Algebra Machine Learning─A Case Study on Protein–Ligand Binding Affinity Prediction

Recently, Suwayyid and Wei introduced commutative algebra as an emerging paradigm for machine learning and data science. In this work, we propose commutative algebra machine learning (CAML) for the prediction of protein−ligand binding affinities. Specifically, we apply persistent Stanley−Reisner theory, a key concept in combinatorial commutative algebra, to the affinity predictions of protein−ligand binding and metalloprotein−ligand binding. We present three new algorithms, i.e., element-specific commutative algebra, category-specific commutative algebra, and commutative algebra on bipartite complexes, to tackle the complexity of data involved in (metallo) protein−ligand complexes. We show that the proposed CAML outperforms other state-of-theart methods in (metallo) protein−ligand binding affinity predictions, indicating the great potential of commutative algebra learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

On the intermediate Jacobian of M5-branes

Abstract We study Euclidean M5-branes wrapping vertical divisors in elliptic Calabi-Yau fourfold compactifications of M/F-theory that admit a Sen limit. We construct these Calabi-Yau fourfolds as elliptic fibrations over coordinate flip O3/O7 orientifolds of toric hypersurface Calabi-Yau threefolds. We devise a method to analyze the Hodge structure (and hence the dimension of the intermediate Jacobian) of vertical divisors in these fourfolds, using only the data available from a type IIB compactification on the O3/O7 Calabi-Yau orientifold. Our method utilizes simple combinatorial formulae (that we prove) for the equivariant Hodge numbers of the Calabi-Yau orientifolds and their prime toric divisors, along with a formula for the Euler characteristic of vertical divisors in the corresponding elliptic Calabi-Yau fourfold. Our formula for the Euler characteristic includes a conjectured correction term that accounts for the contributions of pointlike terminal ℤ 2 singularities corresponding to perturbative O3-planes. We check our conjecture in a number of explicit examples and find perfect agreement with the results of direct computations.

Physics↗
NASA NTRS2022

SatNet: A Benchmark for Satellite Scheduling Optimization

Satellites provide essential services such as networking and weather tracking, and the number of near-earth and deep space satellites are expected to grow rapidly in the coming years. Communications with terrestrial ground stations is one of the critical functionalities of any space mission. Satellite scheduling is a problem that has been scientifically investigated since the 1970s. A central aspect of this problem is the need to consider resource contention and satellite visibility constraints as they require line of sight. Due to the combinatorial nature of the problem, prior solutions such as linear programs and evolutionary algorithms require extensive compute capabilities to output a feasible schedule for each scenario. Machine learning based scheduling can provide an alternative solution by training a model with historical data and generating a schedule quickly with model inference. We present SatNet, a benchmark for satellite scheduling optimization based on historical data from the NASA Deep Space Network. We propose formulation of the satellite scheduling problem as a Markov Decision Process and use reinforcement learning (RL) policies to generate schedules. The nature of constraints imposed by SatNet differ from other combinatorial optimization problems such as vehicle routing studied in prior literature. Our initial results indicate that RL is an alternative optimization approach that can generate candidate solutions of comparable quality to existing state-of-the-practice results. However, we also find that RL policies overfit to the training dataset and do not generalize well to new data, thereby necessitating continued research on reusable and generalizable agents.

Wilson, Brian↗
DOE OSTI2024

Circumventing data imbalance in magnetic ground state data for magnetic moment predictions

Abstract Magnetic materials play a crucial role in the transition to more sustainable forms of energy and electric vehicles. There is an anticipated shortage in magnetic materials in the future, and as a result there is an urgent need to discover and design new magnetic materials. Computational magnetic material design using density functional theory is daunting because of the challenge in identifying magnetic ground states from a combinatorially large set of possibilities. Machine learning offers a path forward by enabling efficient surrogate models that can more readily enumerate these states, but there is a dearth of training data available, and what is available tends to be imbalanced with too much non-magnetic data. In this work we show that the discrete and previously tackled data imbalance that exists at the level of the magnetic ordering leads to an imbalanced continuous distribution with many zeros when the data is unraveled at the atomic magnetic moment level, which subsequently leads to models with low accuracy for magnetic properties. We mitigate this by using a two-part model framework. Our scheme is able to classify atoms into magnetic and non-magnetic with an F1 score and Matthew’s correlation coefficient (MCC) of ~91% and then to provide an implicit embedding representation that maps directly onto the magnitude of the magnetic moment with a mean absolute error of 0.1 μ B . Beyond screening for new magnetic materials, we demonstrate an additional practical use case of our scheme: the provision of good initial guesses for magnetic moments in first-principles electronic relaxations. Such initialization is shown to lead to faster convergence to configurations that lie closer to the ground state.

Computer Science↗
DOE OSTI2019

Accelerated Machine Learning as a Service for Particle Physics Computing

Accelerated Machine Learning as a Service for Particle Physics Computing: • Amount and complexity of high-energy physics data increases dramatically from 2025 onward • Traditional algorithms will require too much CPU time • Machine learning can solve combinatorially-scaling problems in constant time, but must be fast enough

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Universal machine learning framework for defect predictions in zinc blende semiconductors

Our article introduces a universal predictive framework for point defect formation energies and charge transition levels in a wide chemical space of zinc blende semiconductors and possible impurity atoms selected from across the periodic table. This framework was developed by leveraging high-throughput quantum mechanical simulations benchmarked using some experimental data from the literature, as well as machine learning (ML)-based regressions techniques that map unique materials descriptors to computed defect properties and yield optimized and generalizable models. Furthermore, the power and utility of these models is revealed through quick predictions for thousands of new defects and screening of low-energy impurities, which may tune the equilibrium conductivity in the semiconductor. This work presents, to our knowledge, the largest density functional theory (DFT) dataset of defect properties in semiconductors and the largest DFT+ML-based screening of point defects in semiconductors to date.

36 MATERIALS SCIENCE↗
DOE OSTI2021

An Open Combinatorial Diffraction Dataset Including Consensus Human and Machine Learning Labels with Quantified Uncertainty for Training New Machine Learning Models

Modern machine learning and autonomous experimentation schemes in materials science rely on accurate analysis of the data ingested by these models. Unfortunately, accurate analysis of the underlying data can be difficult, even for domain experts, complicating the training of the models intended to drive experiments. This is especially true when the goal is to identify the presence of weak signatures in diffraction or spectroscopic datasets. In this work, we examine a set of as-obtained diffraction data that track the phase transition from monoclinic to tetragonal in a Nb-doped VO2 film as a function of temperature and dopant concentration. We then task a set of domain experts and a set of machine learning experts with identifying which phase is present in each diffraction pattern manually and algorithmically, respectively; in both cases, the labels can vary dramatically, especially at the phase boundaries. We use the mode of the labels and the Shannon entropy as a method to capture, preserve and propagate consensus labels and their variance. Further we use the expert labels as a benchmark and demonstrate the use of Shannon entropy weighted scoring to test the performance of machine learning generated labels. Finally, we propose a material data challenge centered around generating improved labeling algorithms. This real-world dataset curated with expert labels can act as test bed for new algorithms. The raw data, annotations and code used in this study are all available online at data.gov and the interested reader is encouraged to replicate and improve the existing models

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Data-driven design of novel halide perovskite alloys

The great tunability of the properties of halide perovskites presents new opportunities for optoelectronic applications as well as significant challenges associated with exploring combinatorial chemical spaces. Here, in this work, we develop a framework powered by high-throughput computations and machine learning for the design and prediction of mixed cation halide perovskite alloys. In a chemical space of ABX 3 perovskites with a selected set of options for A, B, and X species, pseudo-cubic structures with B-site mixing are simulated using density functional theory (DFT) and several properties are computed, including stability, lattice constant, band gap, vacancy formation energy, refractive index, and optical absorption spectrum, using both semi-local and hybrid functionals. Neural networks (NN) are used to train predictive models for every property using tabulated elemental properties of A, B, and X site species as descriptors. Starting from a DFT dataset of 229 points, we use the trained NN models to predict the structural, energetic, electronic, and optical properties of an extensive dataset of 17955 compounds, and perform high-throughput screening in terms of stability, band gap, and defect tolerance, to obtain 392 promising compounds that are ranked as potential absorbers according to their photovoltaic figure of merit. Compositional trends in the screened set of attractive mixed cation halide perovskites are revealed and additional computations are performed on selected compounds. The data-driven design framework developed here is promising for designing novel mixed compositions and can be extended to a wider perovskite chemical space in terms of A, B, and X species, different kinds of mixing at the A, B, or X sites, non-cubic phases, and other properties of interest.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Quantum Computing in Next-Generation Transportation Optimization

We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time, data-rich environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are presented and new formulations are proposed to demonstrate how emerging quantum algorithms, including quantum annealing and the Quantum Approximation Optimization Algorithm, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss recent trends that indicate when QC may become a viable tool for transportation applications. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2019

Fibers add flavor. Part I. Classification of 5d SCFTs, flavor symmetries and BPS states

We propose a graph-based approach to 5d superconformal field theories (SCFTs) based on their realization as M-theory compactifications on singular elliptic Calabi–Yau threefolds. Fieldtheoretically, these 5d SCFTs descend from 6d N = (1, 0) SCFTs by circle compactification and mass deformations. We derive a description of these theories in terms of graphs, so-called Combined Fiber Diagrams, which encode salient features of the partially resolved Calabi–Yau geometry, and provides a combinatorial way of characterizing all 5d SCFTs that descend from a given 6d theory. Remarkably, these graphs manifestly capture strongly coupled data of the 5d SCFTs, such as the superconformal flavor symmetry, BPS states, and mass deformations. The capabilities of this approach are demonstrated by deriving all rank one and rank two 5d SCFTs. The full potential, however, becomes apparent when applied to theories with higher rank. Starting with the higher rank conformal matter theories in 6d, we are led to the discovery of previously unknown flavor symmetry enhancements and new 5d SCFTs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Transformative Materials for High-Efficiency Thermochemical Production of Solar Fuels (Final Report)

Metal oxide-based two-step solar thermochemical (STC) H 2 O and CO 2 -splitting cycles are a promising route to convert solar thermal energy into fuels. The metal oxide materials are reduced at high temperatures (Step 1), and then at low (but still elevated) temperatures, the reduced oxide is used to split H 2 O or CO 2 (Step 2). However, current applications of these cycles are limited by the efficiency of the metal oxide materials. A lower temperature for reduction is desirable, but that brings a concomitant reduction in the driving force for gas splitting. So, designing novel, high-efficiency materials is challenging. Here, we devised and performed a joint computational-experimental project, combined with materials design strategies and high-throughput approaches with the goal to quickly discover and demonstrate novel thermochemical materials with superior properties. Our approach involves an active feedback loop between experimental and computational research. We have use our previously developed materials design map, to efficiently screen results from high-throughput first- principles computation to predict new compositions and subsequently to experimentally study the properties of novel, predicted materials. Experimental measurements of the thermodynamic properties of selected materials serve as a critical benchmark, not only in evaluating the STCH properties of synthesized compounds, but also serving as a validation dataset for computational approaches. We experimentally explored a set of predicted ABO3 perovskites and focus on obtaining high quality thermodynamic properties for validation of computational prediction of enthalpy and entropy of reduction. These thermodynamic quantities play a major role in designing materials with reduced temperatures of reduction but sufficient gas-splitting rates. Finding good validation between experimental and computational data for enthalpies of reduction, we turn to promising ABO3 materials modified by A and B site substitutions, opening an enormous combinatorial space of materials. We use our high-throughput approach to “tune in” the desired solar thermochemical (STC) properties for STC. This vast composition space can only be reasonably explored using the high-throughput approaches, both computational and experimental, of this proposal. Several promising novel oxide materials have been predicted, synthesized, and verified using our materials design approach.

08 HYDROGEN↗