Search NASA⌕ Search

SEARCH · Search NASA

Results for “class”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Data‐Efficient Generation of Synthetic Microstructures of Polymer‐Bonded Energetic Material With Fine‐Tuned Stable Diffusion

Among current deep learning approaches for synthetic image generation, diffusion-based models stand out in terms of algorithmic stability and ability to retain high-fidelity image features with detailed resolution. Here, in this work, we employ Dreambooth, a method for fine-tuning Stable Diffusion, on X-ray CT images of microstructure of the polymer-bonded form (PBX) of a commonly used high explosive, Pentaerythritol tetranitrate (PETN), which yields generative models for creating synthetic PBX images. The models developed here represent five classes (or ‘lots’) of microstructures and demonstrate successful generation of images of each class with high fidelity, as verified by computed classification accuracy of ∼ 94% or higher. Data augmentation afforded by such image synthesis can be used to more reliably decipher underlying statistics, build processing-structure correlations, recognize off-normal structural anomalies, and identify age-related changes. Ideas related to converting image data into appropriate density mapping and performing mesoscale simulation or surrogate modeling of detonation are also discussed.

Dreambooth↗
DOE OSTI2024

Modern chemical graph theory

Abstract Graph theory has a long history in chemistry. Yet as the breadth and variety of chemical data is rapidly changing, so too do graph encoding methods and analyses that yield qualitative and quantitative insights. Using illustrative cases within a basic mathematical framework, we showcase modern chemical graph theory's utility in Chemists' analysis and model development toolkit. The encoding of both experimental and simulation data is discussed at various levels of granularity of information. This is followed by a discussion of the two major classes of graph theoretical analyses: identifying connectivity patterns and partitioning methods. Measures, metrics, descriptors, and topological indices are then introduced with an emphasis upon enhancing interpretability and incorporation into physical models. Challenging data cases are described that include strategies for studying time dependence. Throughout, we incorporate recent advancements in computer science and applied mathematics that are propelling chemical graph theory into new domains of chemical study. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Structure and Mechanism > Computational Materials Science Structure and Mechanism > Molecular Structures

Leite, Leonardo S. G.↗
DOE OSTI2026

Updated constraints from electric dipole moments in the MSSM with R-parity violation

We revisit the electric dipole moments (EDMs) of quarks and leptons in the Minimal Supersymmetric Standard Model (MSSM) with trilinear R-parity violation (RPV). In this framework, EDMs are induced at the two-loop level via RPV interactions. We perform a comprehensive recalculation of several classes of Barr-Zee type diagrams in a general Rξ gauge. While we find general agreement with previous analytic results in the literature, our work provides a valuable independent cross-check of the complicated calculations. We also point out some subtleties in the intermediate steps and in the choice of the flavor basis for the numerical evaluation of the expressions. By confronting the theoretical predictions with the latest experimental limits on EDMs, we derive updated constraints on combinations of RPV couplings. We highlight an approximate, testable correlation between the proton and neutron EDM that emerges within the considered class of RPV models, offering a distinctive signature for future EDM experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

cymyc: $\underline{C}$alabi-$\underline{Y}$au $\underline{M}$etrics, $\underline{Y}$ukawas, and $\underline{C}$urvature

We introduce cymyc, a high-performance Python library for numerical investigation of the geometry of a large class of string compactification manifolds and their associated moduli spaces. We develop a well-defined geometric ansatz to numerically model tensor fields of arbitrary degree on a large class of Calabi-Yau manifolds. cymyc includes a machine learning component which incorporates this ansatz to model tensor fields of interest on these spaces by finding an approximate solution to the system of partial differential equations they should satisfy.

differential and algebraic geometry↗
DOE OSTI2026

NuGraph2 with context-aware inputs: physics-inspired improvements in semantic segmentation

Graph neural networks have recently shown strong promise for event reconstruction tasks in Liquid Argon Time Projection Chambers, yet their performance remains limited for underrepresented classes of particles, such as Michel electrons. In this work, we investigate physics-informed strategies to improve semantic segmentation within the NuGraph2 architecture. We explore three complementary approaches: (i) enriching the input representation with context-aware features derived from detector geometry and track continuity, (ii) introducing auxiliary decoders to capture class-level correlations, and (iii) incorporating energy-based regularization terms motivated by Michel electron energy distributions. Experiments on MicroBooNE public datasets show that physics-inspired feature augmentation yields the largest gains, particularly boosting Michel electron precision and recall by disentangling overlapping latent space regions. In contrast, auxiliary decoders and energy-regularization terms provided limited improvements, partly due to the hit-level nature of NuGraph2, which lacks explicit particle- or event-level representations. Our findings highlight that embedding physics context directly into node-level inputs is more effective than imposing task-specific auxiliary losses, and suggest that future hierarchical architectures such as NuGraph3, with explicit particle- and event-level reasoning, will provide a more natural setting for advanced decoders and physics-based regularization. The code for this work is publicly available on Github at https://github.com/vitorgrizzi/nugraph_phys/tree/main_phys.

Other Experiments↗
DOE OSTI2024

Open-closed string duality, branes, and topological recursion

We consider matrix models exhibiting open-closed string duality in two-dimensional string theories with various amounts of supersymmetry. In particular, a relationship between matrix models in the β = 2 Wigner-Dyson class and models in the (1 + 2Γ, 2) Altland-Zirnbauer class relates the perturbative solutions of the two systems’ string equations. Point-like operator insertions in the closed string theory are mapped to the topological expansion of the free energy in the open string theory. We compute correlation functions of macroscopic loop operators and FZZT branes in a general topological gravity background. The relationship between the topological recursion of moduli space volumes and branes is discussed by analyzing the Virasoro conditions in the matrix models.

2D Gravity↗
DOE OSTI2024

On the symmetry TFT of Yang-Mills-Chern-Simons theory

Three-dimensional Yang-Mills-Chern-Simons theory has the peculiar property that its one-form symmetry defects have nontrivial braiding, namely they are charged under the same symmetry they generate, which is then anomalous. This poses a few puzzles in describing the corresponding Symmetry TFT in a four-dimensional bulk. First, the braiding between lines at the boundary seems to be ill-defined when such lines are pulled into the bulk. Second, the Symmetry TFT appears to be too trivial to allow for topological boundary conditions encoding all the different global variants. We show that both of these puzzles can be solved by including endable (tubular) surfaces in the class of bulk topological operators one has to consider. In this way, we are able to reproduce all global variants of the theory, with their symmetries and their anomalies. We check the validity of our proposal also against a top-down holographic realization of the same class of theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Analytic bounds on late-time axion-scalar cosmologies

The cosmological dynamics of multiple scalar/pseudoscalar fields are difficult to solve, especially when the field-space metric is curved. This presents a challenge in determining whether a given model can support cosmic acceleration, without solving for the on-shell solution. In this work, we present bounds on late-time FLRW-cosmologies in classes of theories that involve arbitrary numbers of scalar and pseudoscalar fields coupled both kinetically (leading to a curved field space metric) and through scalar potentials. Such bounds are proven analytically, independently of initial conditions, with no approximation in the field equations and without referring to explicit solutions. Besides their broad applications to cosmological model building, our bounds can be applied to studying asymptotic cosmologies of certain classes of string compactifications.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Exact Ground State of Interacting Electrons in Magic Angle Graphene

One of the most remarkable theoretical findings in magic angle twisted bilayer graphene (TBG) is the emergence of ferromagnetic Slater determinants as exact ground states for the interacting Hamiltonian at the chiral limit. This discovery provides an explanation for the correlated insulating phase which has been experimentally observed at half filling. This work is the first mathematical study of interacting models in magic angle graphene systems. These include not only TBG but also TBG-like systems featuring four flat bands per valley, and twisted trilayer graphene systems with equal twist angles. We identify symmetries of the chiral limit of the Bistritzer-MacDonald Hamiltonian that are responsible for characterizing the Hartree-Fock ground states as zero energy many-body ground states. Furthermore, for a general class of Hamiltonian, we establish criteria that the ferromagnetic Slater determinants are the unique ground states within the class of uniformly half-filled, translation invariant Slater determinants. We then demonstrate that these criteria can be explicitly verified for TBG and TBG-like systems at the chiral limit, using properties of Jacobi-θ$${\theta }$$ and Weierstrass-℘$${\wp }$$ functions.

Becker, Simon↗
DOE OSTI2025

Heterogeneous Mixtures of Dictionary Functions to Approximate Subspace Invariance in Koopman Operators: Why Deep Koopman Operators Work

Abstract Koopman operators model nonlinear dynamics as a linear dynamic system acting on a nonlinear function as the state. This nonstandard state is often called a Koopman observable and is usually approximated numerically by a superposition of functions drawn from a dictionary . In a widely used algorithm, extended dynamic mode decomposition (EDMD), the dictionary functions are drawn from a fixed class of functions. Deep learning combined with EDMD has been used to learn novel dictionary functions in an algorithm called deep dynamic mode decomposition (deepDMD). The learned representation both (1) accurately models and (2) scales well with the dimension of the original nonlinear system. In this paper, we analyze the learned dictionaries from deepDMD and explore the theoretical basis for their strong performance. We explore State-Inclusive Logistic Lifting (SILL) dictionary functions to approximate Koopman observables. Error analysis of these dictionary functions show they satisfy a property of subspace approximation, which we define as uniform finite approximate closure. Typically, a Koopman dictionary’s nonlinear functions are homogeneous. In this paper, we discover that structured mixing of heterogeneous dictionary functions drawn from different classes of nonlinear functions achieve the same accuracy and dimensional scaling as the deep-learning-based deepDMD algorithm Yeung et al. ( In: 2019 American Control Conference (ACC), 2019). We specifically show this by building a heterogeneous dictionary comprised of SILL functions and conjunctive radial basis functions (RBFs). This mixed dictionary achieves similar accuracy and dimensional scaling to deepDMD with an order of magnitude reduction in parameters, while maintaining geometric interpretability. These results strengthen the viability of dictionary-based Koopman models to solving high-dimensional nonlinear learning problems.

Johnson, Charles A.↗
DOE OSTI2026

Attention-based 3D – convolutional neural network model for mechanical property predictions using visible light images in metal additive manufacturing

Additive manufacturing (AM), while commonly used for rapid prototyping and creating components with complex geometries, has not been widely adopted for critical applications across the aerospace, automotive, defense, energy, and medical industries. This is, in part, due to the challenges of controlling flaws and uncertainty in the mechanical behavior of additively manufactured components. In recent years, there has been an increase in research aimed at predicting the final mechanical properties of additively manufactured components during the printing process. To address these issues, a 3D-CNN model was trained using low-cost in situ visible-light camera data, anomaly classifications, and the chosen process parameters to predict the ultimate tensile strength (UTS), yield strength (YS), total elongation (TE), and uniform elongation (UE). The 3D-CNN layers of the model employed attention mechanisms to prioritize features in the data, thereby improving prediction accuracy. Furthermore, the effect of each process parameter and anomaly class is investigated using attention-based dynamic sigmoid weighted gates to interpret the influence each class has on the final prediction. Different combinations of the in situ data were fed into the 3D-CNN, with varying amounts of image layers, to determine the ideal combination for predicting mechanical properties in situ. Here, the 3D-CNN model achieved mean absolute percentage errors (MAPE) below 5% for both UTS and YS while using only a single camera input and under half of the available image layers.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Queue wait time prediction in high performance computing (HPC) systems

High Performance Computing (HPC) systems are critical enablers for groundbreaking scientific research across various domains. Efficient resource allocation, facilitated by job scheduling, is paramount for maximizing the utilization of HPC systems. However, the variability in wait times for queued jobs poses challenges for users, necessitating accurate job wait time estimation. This paper explores the influence of job characteristics, including job size (the number of nodes requested and walltime), the queue to which the job is submitted and other resource requirements, on job wait times in leadership-class HPC systems. Focusing on the Theta Cray XC40 and Polaris machines at Argonne National Laboratory, the study evaluates the performance of different supervised learning algorithms in predicting job wait times. It also evaluates the impact of data preprocessing, including outlier detection, Principal Component Analysis (PCA), and feature selection, on the performance of wait time prediction models. The findings reveal insights into the relationship between job characteristics and wait times, offering a foundation for optimizing resource allocation and enhancing user experience. The methodologies and tools developed in this study are adaptable to other leadership-class HPC systems, providing a valuable contribution to the broader HPC community aiming to improve job scheduling efficiency and user satisfaction.

Okafor, Nwamaka↗
DOE OSTI2024

Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimension. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Furthermore, our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Use of Fisher's Ratio assisted multivariate curve resolution- alternating least squares for discovery-based analysis using ultrahigh pressure liquid chromatography-high resolution mass spectrometry

Non-targeted analysis of complex chemical mixtures can be difficult considering the convoluted nature of the matrix and the potential unknown chemical differences between samples or classes of samples. Ultrahigh pressure liquid chromatography coupled to quadrupole time-of-flight mass spectrometry (UHPLC-QTOF) is an ideal technique to probe chemical differences for a wide variety of samples. While UHPLC-QTOF can discover minute chemical differences down to low part per billion (ppb) concentrations with a high degree of confidence, the application of high-resolution mass spectrometry can yield massive amounts of information (∼ 10 gb per sample) that cannot be analyzed manually. Therefore, the application of chemometric techniques is mandatory for the interrogation of complex samples. Fisher's ratio (FR) assisted multivariate curve resolution-alternating least squares (MCR-ALS) was used to the discover and identify the chemical differences between two classes of materials: 1) a pond water matrix and 2) the matrix spiked with a pharmaceutical standard mix containing 17 compounds. Thirteen of the seventeen spiked compounds were discovered using FR analysis, and then five were successfully deconvoluted using MCR-ALS wherein the number of curves chosen were automatically determined using singular value decomposition (SVD). In conclusion, the use of an automated FR assisted MCR-ALS will aid in discovering trace levels of chemical components without the need for the researcher to provide potentially biased input which will aid in non-targeted workflow.

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

Fast meta-solvers for 3D complex-shape scatterers using neural operators trained on a non-scattering problem

Three-dimensional target identification using scattering techniques requires high accuracy solutions and very fast computations for real-time predictions in some critical applications. We first train a deep neural operator (DeepONet) to solve wave propagation problems described by the Helmholtz equation in a domain without scatterers but at different wavenumbers and with a complex absorbing boundary condition. We then design two classes of fast meta-solvers by combining DeepONet with either relaxation methods, such as Jacobi and Gauss-Seidel, or with Krylov methods, such as GMRES and BiCGStab, using the trunk basis of DeepONet as a coarse-scale preconditioner. We leverage the spectral bias of neural networks to account for the lower part of the spectrum in the error distribution while the upper part is handled inexpensively using relaxation methods or fine-scale preconditioners. The meta-solvers are then applied to solve scattering problems with different shape of scatterers, at no extra training cost. We first demonstrate that the resulting meta-solvers are shape-agnostic, fast, and robust, whereas the standard standalone solvers may even fail to converge without the DeepONet. We then apply both classes of meta-solvers to scattering from a submarine, a complex three-dimensional problem. We achieve very fast solutions, especially with the DeepONet-Krylov methods, which require orders of magnitude fewer iterations than any of the standalone solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parallel sorting algorithm classification: is manual instrumentation necessary?

Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. In conclusion, we demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Algorithm Classification↗
DOE OSTI2024

The crystal structure of Grindelia robusta 7,13-copalyl diphosphate synthase reveals active site features controlling catalytic specificity

Diterpenoid natural products serve critical functions in plant development and ecological adaptation and many diterpenoids have economic value as bioproducts. The family of class II diterpene synthases catalyzes the committed reactions in diterpenoid biosynthesis, converting a common geranylgeranyl diphosphate precursor into different bicyclic prenyl diphosphate scaffolds. Enzymatic rearrangement and modification of these precursors generate the diversity of bioactive diterpenoids. We report the crystal structure of Grindelia robusta 7,13-copalyl diphosphate synthase, GrTPS2, at 2.1 Å of resolution. GrTPS2 catalyzes the committed reaction in the biosynthesis of grindelic acid, which represents the signature metabolite in species of gumweed (Grindelia spp., Asteraceae). Grindelic acid has been explored as a potential source for drug leads and biofuel production. The GrTPS2 crystal structure adopts the conserved three-domain fold of class II diterpene synthases featuring a functional active site in the γβ-domain and a vestigial α-domain. Substrate docking into the active site of the GrTPS2 apo protein structure predicted catalytic amino acids. Biochemical characterization of protein variants identified residues with impact on enzyme activity and catalytic specificity. Specifically, mutagenesis of Y457 provided mechanistic insight into the position-specific deprotonation of the intermediary carbocation to form the characteristic 7,13 double bond of 7,13-copalyl diphosphate.

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

Reassessing early-age strength development of high-volume fly ash concretes for precast buildings

Increasing beneficial use of fresh or landfilled fly ash as a replacement for Portland cement can be more challenging for the construction of precast buildings or similar applications requiring rapid strength development. Therefore, the framework presented in this paper aims to reassess high-volume fly ash concretes but in the context of facilitating more sustainable precast buildings. More specifically, the framework was used to characterize strength development of concrete mixes with a target minimum 24-hour compressive strength of 24.1 MPa (3500 psi), selected as an example strength development metric to demonstrate the framework, and comprised of 40% Class C, Class F, and landfilled (harvested) fly ash – as a high-volume replacement of Type III or Type IL cement. High-early strength was driven by optimized dosages of commercial grade gypsum and accelerating admixtures, in addition to optimal aggregate packing and mix proportioning strategies. Early-age mechanical properties including compressive strength, modulus of rupture, and modulus of elasticity were reevaluated within 24 hours of batching with respect to common precast production demands. Simple data analyses were then used to highlight cases where currently accepted design provisions for the aforementioned properties are either overly-conservative or unconservative with respect to test data. Furthermore, the framework and demonstration of example mixes presented herein aim to promote confidence for using larger fractions of fresh or landfilled fly ashes for precast buildings to further enhance environmental benefits without sacrificing pertinent early-age structural performance.

42 ENGINEERING↗