Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 91 records · Page 5

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↗

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↗

On microscopic theory of radiative nuclear reaction characteristics

A survey of some results in the modern microscopic theory of properties of nuclear reactions with gamma rays is given. First of all, we discuss the impact of Phonon Coupling (PC) on the Photon Strength Function (PSF) because it represents the most natural physical source of additional strength found for Sn isotopes in recent experiments that could not be explained within the standard HFB + QRPA approach. The self-consistent version of the Extended Theory of Finite Fermi Systems in the Quasiparticle Time Blocking Approximation is applied. It uses the HFB mean field and includes both the QRPA and PC effects on the basis of the SLy4 Skyrme force. With our microscopic E1 PSFs, the following properties have been calculated for many stable and unstable even–even semi-magic Sn and Ni isotopes as well as for double-magic {sup 132}Sn and {sup 208}Pb using the reaction codes EMPIRE and TALYS with several Nuclear Level Density (NLD) models: (1) the neutron capture cross sections; (2) the corresponding neutron capture gamma spectra; (3) the average radiative widths of neutron resonances. In all the properties considered, the PC contribution turned out to be significant, as compared with the standard QRPA one, and necessary to explain the available experimental data. The results with the phenomenological so-called generalized superfluid NLD model turned out to be worse, on the whole, than those obtained with the microscopic HFB + combinatorial NLD model. The very topical question about the M1 resonance contribution to PSFs is also discussed.Finally, we also discuss the modern microscopic NLD models based on the self-consistent HFB method and show their relevance to explain the experimental data as compared with the phenomenological models. The use of these self-consistent microscopic approaches is of particular relevance for nuclear astrophysics, but also for the study of double-magic nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

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↗

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↗

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↗

Unsupervised phase mapping of X-ray diffraction data by nonnegative matrix factorization integrated with custom clustering

Abstract Analyzing large X-ray diffraction (XRD) datasets is a key step in high-throughput mapping of the compositional phase diagrams of combinatorial materials libraries. Optimizing and automating this task can help accelerate the process of discovery of materials with novel and desirable properties. Here, we report a new method for pattern analysis and phase extraction of XRD datasets. The method expands the Nonnegative Matrix Factorization method, which has been used previously to analyze such datasets, by combining it with custom clustering and cross-correlation algorithms. This new method is capable of robust determination of the number of basis patterns present in the data which, in turn, enables straightforward identification of any possible peak-shifted patterns. Peak-shifting arises due to continuous change in the lattice constants as a function of composition and is ubiquitous in XRD datasets from composition spread libraries. Successful identification of the peak-shifted patterns allows proper quantification and classification of the basis XRD patterns, which is necessary in order to decipher the contribution of each unique single-phase structure to the multi-phase regions. The process can be utilized to determine accurately the compositional phase diagram of a system under study. The presented method is applied to one synthetic and one experimental dataset and demonstrates robust accuracy and identification abilities.

36 MATERIALS SCIENCE↗

Optimizing Irregular Applications for Energy and Performance on the Tilera Many-core Architecture

Optimizing applications simultaneously for energy and performance is a complex problem. High performance, parallel, irregular applications are notoriously hard to optimize due to their data-dependent memory accesses, lack of structured locality and complex data structures and code patterns. Irregular kernels are growing in importance in applications such as machine learning, graph analytics and combinatorial scientific computing. Performance- and energy-efficient implementation of these kernels on modern, energy efficient, multicore and many-core platforms is therefore an important and challenging problem. We present results from optimizing two irregular applications { the Louvain method for community detection (Grappolo), and high-performance conjugate gradient (HPCCG) { on the Tilera many-core system. We have significantly extended MIT's OpenTuner auto-tuning framework to conduct a detailed study of platform-independent and platform-specific optimizations to improve performance as well as reduce total energy consumption. We explore the optimization design space along three dimensions: memory layout schemes, compiler-based code transformations, and optimization of parallel loop schedules. Using auto-tuning, we demonstrate whole node energy savings of up to 41% relative to a baseline instantiation, and up to 31% relative to manually optimized variants.

irregular applications, energy opttimization, many↗

Optimization of an individual re-identification modeling process using biometric features

We present results from the optimization of a re-identification process using two sets of biometric data obtained from the Civilian American and European Surface Anthropometry Resource Project (CAESAR) database. The datasets contain real measurements of features for 2378 individuals in a standing (43 features) and seated (16 features) position. A genetic algorithm (GA) was used to search a large combinatorial space where different features are available between the probe (seated) and gallery (standing) datasets. Results show that optimized model predictions obtained using less than half of the 43 gallery features and data from roughly 16% of the individuals available produce better re-identification rates than two other approaches that use all the information available.

CAESAR↗

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↗

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↗

ElectroCat: DOE's approach to PGM-free catalyst and electrode R&D

The successful development of high-performance, durable platinum group metal-free (PGM-free) electrocatalysts and electrodes for polymer electrolyte membrane fuel cells (PEMFCs) will ultimately improve the cost-competiveness of fuel cells in a wide range of applications. This is considered to be a critical development especially for automotive fuel cell applications in order to bring the system cost of an automotive fuel cell system down to the $30/kW cost target set by the U.S. Department of Energy (DOE). The platinum group metal (PGM) electrocatalysts are a major contributor to the system cost. Addressing the technical challenges to PGM-free electrocatalyst and electrode development, therefore, represents one of DOE's most pressing research and development (R&D) priorities. ElectroCat was formed by the DOE as part of the Energy Materials Network (EMN) in early 2016, and shares with other EMN consortia the goal of decreasing the time to market for advanced materials related to clean energy technologies, in the context of increasing U.S. fuel cell electric vehicle (FCEV) manufacturing competitiveness. To accomplish this, the consortium performs core research and development and provides universities and companies streamlined access to the unique, world-class set of tools and expertise relevant to early-stage applied PGM-free catalyst R&D of the member national laboratories. Moreover, ElectroCat fosters a systematic methodology by which prospective catalysts and electrodes are prepared and analyzed rapidly and comprehensively using high-throughput, combinatorial methods. Catalyst discovery is augmented by theory as well as foundational electrocatalysis and materials knowledge at the participating national laboratories. Furthermore, ElectroCat has developed a data sharing framework, requisite of all EMN consortia, for disseminating its findings to the public via a searchable database, to further expedite incorporation of PGM-free electrocatalysts into next-generation fuel cells by advancing the general understanding of the PGM-free electrocatalyst field.

Thompson, Simon T.↗

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↗

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↗

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↗

Micellar Surfactant Association in the Presence of a Glucoside-based Amphiphile Detected via High-Throughput Small Angle X-ray Scattering

The interactions of mixtures of anionic and amphoteric surfactants with sugar amphiphiles were studied via high throughput small angle x-ray scattering (SAXS). The sugar amphiphile was composed of Caprate, Caprylate, and Oleate mixed ester of methyl glucoside, MeGCCO. Optimal surfactant interactions are sought which have desirable physical properties, which must be identified in a cost effective manner that can access the large phase space of possible molecular combinations. X-ray scattering patterns obtained via high throughput SAXS can probe a combinatorial sample space and reveal the incorporation of MeGCCO into the micelles and the molecular associations between surfactant molecules. Such data make it possible to efficiently assess the effects of the new amphiphiles in the formulation. A specific finding of this study is that formulations containing comparatively monodisperse and homogeneous surfactant mixtures can be reliably tuned by addition of NaCl, which swells the surfactant micelles with a monotonic dependence on salt concentration. In contrast, the presence of multiple different surfactants destroys clear correlations with NaCl concentration, even in otherwise similar series of formulations.

36 MATERIALS SCIENCE↗

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↗