Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational framework”

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 1,639 records · Page 91

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗

LQCD workflow execution framework: Models, provenance and fault-tolerance

Large computing clusters used for scientific processing suffer from systemic failures when operated over long continuous periods for executing workflows. Diagnosing job problems and faults leading to eventual failures in this complex environment i s difficult, specifically when the success of an entire workflow might be affected by a single job failure. In this paper, we introduce a model-based, hierarchical, reliable execution framework that encompass workflow specification, data provenance, execu tion tracking and online monitoring of each workflow task, also referred to as participants. The sequence of participants is described in an abstract parameterized view, which is translated into a concrete data dependency based sequence of participants wi th defined arguments. As participants belonging to a workflow are mapped onto machines and executed, periodic and on-demand monitoring of vital health parameters on allocated nodes is enabled according to pre-specified rules. These rules specify condition s that must be true pre-execution, during execution and post-execution. Monitoring information for each participant is propagated upwards through the reflex and healing architecture, which consists of a hierarchical network of decentralized fault manageme nt entities, called reflex engines. They are instantiated as state machines or timed automatons that change state and initiate reflexive mitigation action(s) upon occurrence of certain faults. We describe how this cluster reliability framework is combined with the workflow execution framework using formal rules and actions specified within a structure of first order predicate logic that enables a dynamic management design that reduces manual administrative workload, and increases cluster-productivity.

Piccoli, Luciano↗

Hybrid Symbolic-Numerical Modeling and Parametric Stability Analysis of DC–AC Power Systems

Hybrid DC-AC power systems integrating diverse inverter-based resources (IBRs) and multi-terminal high-voltage direct current (MTDC) networks represent a promising architecture for future power grids, while introducing challenges for modeling, stability analysis, and control design. This paper develops a hybrid symbolic-numerical modeling framework and tool to characterize the parametric small-signal stability of DC-AC coupled power systems. The proposed approach constructs parametric state-space models to enable efficient representation of system dynamics under varying control parameters and network configurations, with target parameters retained as symbolic variables and the remainder treated numerically. The stability analysis framework covers eigenvalue, sensitivity, and stability boundary and region characterization. Enhanced linear matrix inequality (LMI) techniques are proposed to directly certify small-signal stability over regions of parameter space while also reducing the conservativeness and computational burden. The resulting tools and frameworks enable rapid parametric model construction across diverse grid conditions, thereby facilitating stability-informed control and operation in complex DC–AC power systems.

DC–AC power systems↗

A Deep Generative Model for Non-Intrusive Identification of EV Charging Profiles

The proliferation of electric vehicles (EVs) brings environmental benefits and technical challenges to power grids. An identification algorithm which can accurately extract individual EV charging profiles out of widely available smart meter measurements has attracted great interests. This paper proposes a non-intrusive identification framework for EV charging profile extraction, which is driven by deep generative models (DGM). First, the proposed DGM is designed as a representation layer embedded into the Markov process and used to model the joint probability distribution of available time-series data. A novel contribution is to approximate posterior distributions by neural networks whose parameters are obtained by variational inference and supervised learning. Second, the EV charging status is inferred from the DGM via dynamic programming. Lastly, the desired EV charging profile can be reconstructed by the rated power of EV models and inferred status. Compared with the benchmark Hidden Markov Models, the proposed framework can better handle noise in data with less computational complexity and better overall accuracy performances with smaller recall. The proposed framework is validated by numerical experiments on the Pecan Street dataset.

33 ADVANCED PROPULSION SYSTEMS↗

Master of Puppets: Cooperative Multitasking for In Situ Processing

Modern scientific and engineering simulations track the time evolution of billions of elements. For such large runs, storing most time steps for later analysis is not a viable strategy. It is far more efficient to analyze the simulation data while it is still in memory. Here, we present a novel design for running multiple codes in situ: using coroutines and position-independent executables we enable cooperative multitasking between simulation and analysis, allowing the same executables to post-process simulation output, as well as to process it on the fly, both in situ and in transit. We present Henson, an implementation of our design, and illustrate its versatility by tackling analysis tasks with different computational requirements. This design differs significantly from the existing frameworks and offers an efficient and robust approach to integrating multiple codes on modern supercomputers. The techniques we present can also be integrated into other in situ frameworks.

97 MATHEMATICS AND COMPUTING↗

A quality assurance framework for the fully automated and objective evaluation of image quality in cone-beam computed tomography

Purpose: Thousands of cone-beam computed tomography (CBCT) scanners for vascular, maxillofacial, neurological, and body imaging are in clinical use today, but there is no consensus on uniform acceptance and constancy testing for image quality (IQ) and dose yet. The authors developed a quality assurance (QA) framework for fully automated and time-efficient performance evaluation of these systems. In addition, the dependence of objective Fourier-based IQ metrics on direction and position in 3D volumes was investigated for CBCT. Methods: The authors designed a dedicated QA phantom 10 cm in length consisting of five compartments, each with a diameter of 10 cm, and an optional extension ring 16 cm in diameter. A homogeneous section of water-equivalent material allows measuring CT value accuracy, image noise and uniformity, and multidimensional global and local noise power spectra (NPS). For the quantitative determination of 3D high-contrast spatial resolution, the modulation transfer function (MTF) of centrally and peripherally positioned aluminum spheres was computed from edge profiles. Additional in-plane and axial resolution patterns were used to assess resolution qualitatively. The characterization of low-contrast detectability as well as CT value linearity and artifact behavior was tested by utilizing sections with soft-tissue-equivalent and metallic inserts. For an automated QA procedure, a phantom detection algorithm was implemented. All tests used in the dedicated QA program were initially verified in simulation studies and experimentally confirmed on a clinical dental CBCT system. Results: The automated IQ evaluation of volume data sets of the dental CBCT system was achieved with the proposed phantom requiring only one scan for the determination of all desired parameters. Typically, less than 5 min were needed for phantom set-up, scanning, and data analysis. Quantitative evaluation of system performance over time by comparison to previous examinations was also verified. The maximum percentage interscan variation of repeated measurements was less than 4% and 1.7% on average for all investigated quality criteria. The NPS-based image noise differed by less than 5% from the conventional standard deviation approach and spatially selective 10% MTF values were well comparable to subjective results obtained with 3D resolution pattern. Determining only transverse spatial resolution and global noise behavior in the central field of measurement turned out to be insufficient. Conclusions: The proposed framework transfers QA routines employed in conventional CT in an advanced version to CBCT for fully automated and time-efficient evaluation of technical equipment. With the modular phantom design, a routine as well as an expert version for assessing IQ is provided. The QA program can be used for arbitrary CT units to evaluate 3D imaging characteristics automatically.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A machine learning framework for elastic constants predictions in multi-principal element alloys

On the one hand, multi-principal element alloys (MPEAs) have created a paradigm shift in alloy design due to large compositional space, whereas on the other, they have presented enormous computational challenges for theory-based materials design, especially density functional theory (DFT), which is inherently computationally expensive even for traditional dilute alloys. In this paper, we present a machine learning framework, namely PREDICT (PRedict properties from Existing Database In Complex alloys Territory), that opens a pathway to predict elastic constants in large compositional space with little computational expense. The framework only relies on the DFT database of binary alloys and predicts Voigt–Reuss–Hill Young’s modulus, shear modulus, bulk modulus, elastic constants, and Poisson’s ratio in MPEAs. We show that the key descriptors of elastic constants are the A–B bond length and cohesive energy. The framework can predict elastic constants in hypothetical compositions as long as the constituent elements are present in the database, thereby enabling property exploration in multi-compositional systems. We illustrate predictions in a FCC Ni-Cu-Au-Pd-Pt system.

Linton, Nathan (ORCID:0000000315485613)↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗

Adaptive Computing for Scale-Up Problems

Adaptive Computing is an application-agnostic outer loop framework to strategically deploy simulations and experiments to guide decision making for scale-up analysis. Resources are allocated over successive batches, which makes the allocation adaptive to some objective such as optimization or model training. The framework enables the characterization and management of uncertainties associated with predictive models of complex systems when scale-up questions lead to significant model extrapolation. A key advancement of this framework is its integration of multi-fidelity surrogate modeling, uncertainty management, and automated orchestration of various computing and experimentation resources into a single integrated software package. This enables efficient multi-fidelity modeling across multiple computing resources by incorporating real-world constraints such as relative queue times and throughput on individual machines into the multi-fidelity sampling decision. We discuss applications of this framework to problems in the renewable energy space, including biofuels production, material synthesis, perovskite crystal growth, and building electrical loads.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Repositioning Quantum Cellular Automata for Dependable Quantum-Classical Systems

Quantum Cellular Automata (QCA) provides a structured model of distributed quantum computation with inherent locality and regularity properties that are suited to dependable execution. However, QCA remain largely absent from discussions on reproducibility, fault management, and orchestration in heterogeneous quantum-classical systems. We propose a dual-axis framework that situates QCA within both computation and physical realizability, revealing regions where robust, scalable, and hardware-constrained quantum dynamics may reside. By revisiting prior results through the lens of reproducibility and architecture resilience, we suggest that QCA offers a potential substrate for benchmarking and system-level co-design.

Stapleton, Nicholas [ORNL] (ORCID:0000000335305325↗

Computational Optimization of Room Temperature Usable Capacity for Hydrogen Storage in MFU-4-Type Metal–Organic Frameworks via Pairwise Metal Substitutions

The efficient storage of hydrogen is a critical challenge in the quest for sustainable energy solutions. Current adsorbent-based methods achieve satisfactory storage densities predominantly under cryogenic temperatures and/or high pressures, which imposes problems with cost-efficient and safe implementation of this technology. Materials that can bind hydrogen gas reversibly at ambient temperatures and more moderate pressures could play a pivotal role in enabling hydrogen-powered technologies. In this study, we use reliable computational modeling to investigate two synthetically feasible paths for tuning the enthalpy of H2 binding in MFU-4-type metal–organic frameworks (MOFs), aiming to maximize usable capacity. This study examines MIM4 IICl3(bta)6 (bta– = benzotriazolate) Kuratowski-type clusters as a model for strong binding sites in MFU-4l frameworks. We systematically evaluate the impact of separately tuning the central MII metal ion (which plays a structural role) and the peripheral MI metal ion (which binds the substrate) on the energetics of H2 binding. Our computational study reveals that H2 binding at an MI site mostly follows the trend AgI < CuI < NiI < CoI < AuI while a larger central MII site generally weakens the H2 binding at a MI site. Importantly, we have identified three new combinations of MI and MII to achieve high fractional usable capacities of the total H2 adsorbed under a pressure swing from 5 to 100 bar at room temperature. Additionally, we examine the nature of the binding interaction between the peripheral metal atom and the hydrogen molecule. While charge transfer predominantly induces this interaction, for several atom combinations, a change in the polarization (associated with variations in the ionic radius of the MI binding atom) is another important factor for adjusting the strength of the interaction. We suggest that the proposed compositions of Kuratowski-type clusters are highly desirable synthetic targets for future laboratory study.

Tkachenko, Nikolay V↗

SA-GAT-SR: self-adaptable graph attention networks with symbolic regression for high-fidelity material property prediction

Recent advances in machine learning have demonstrated an enormous utility of deep learning approaches, particularly Graph Neural Networks (GNNs) for materials science. These methods have emerged as powerful tools for high-throughput prediction of material properties, offering a compelling enhancement and alternative to traditional first-principles calculations. While the community has predominantly focused on developing increasingly complex and universal models to enhance predictive accuracy, such approaches often lack physical interpretability and insights into materials behavior. Here, we introduce a novel computational paradigm—Self-Adaptable Graph Attention Networks integrated with Symbolic Regression (SA-GAT-SR)—that synergistically combines the predictive capability of GNNs with the interpretative power of symbolic regression. Our framework employs a self-adaptable encoding algorithm that automatically identifies and adjust attention weights so as to screen critical features from an expansive 180-dimensional feature space while maintaining O(n) computational scaling. The integrated SR module subsequently distills these features into compact analytical expressions that explicitly reveal quantum-mechanically meaningful relationships, achieving 23 × acceleration compared to conventional SR implementations that heavily rely on first-principle calculations-derived features as input. This work suggests a new framework in computational materials science, bridging the gap between predictive accuracy and physical interpretability, offering valuable physical insights into material behavior.

36 MATERIALS SCIENCE↗

Computational chaos in massively parallel neural networks

A fundamental issue which directly impacts the scalability of current theoretical neural network models to massively parallel embodiments, in both software as well as hardware, is the inherent and unavoidable concurrent asynchronicity of emerging fine-grained computational ensembles and the possible emergence of chaotic manifestations. Previous analyses attributed dynamical instability to the topology of the interconnection matrix, to parasitic components or to propagation delays. However, researchers have observed the existence of emergent computational chaos in a concurrently asynchronous framework, independent of the network topology. Researcher present a methodology enabling the effective asynchronous operation of large-scale neural networks. Necessary and sufficient conditions guaranteeing concurrent asynchronous convergence are established in terms of contracting operators. Lyapunov exponents are computed formally to characterize the underlying nonlinear dynamics. Simulation results are presented to illustrate network convergence to the correct results, even in the presence of large delays.

Barhen, Jacob↗

Quantum Computing for AI-based Design and Optimization of Electric Motors

Knowledge-based artificial intelligence and hierarchical fuzzy logic offer an interpretable framework for electricvehicle motor preliminary design, but their computational burden grows with linguistic granularity and coupled design-space size. This paper presents a reduced quantum reformulation of the hierarchical fuzzy inference of air-gap flux density, a representative level-one motor-design parameter. Starting from the published electric-vehicle motor-design framework, a three-term fuzzy prototype is constructed from the original inference structure. The reduced model is then reformulated as a modular quantum register-oracle system, in which each hierarchical subrelation is encoded as a block oracle and evaluated through superpositionbased candidate-label testing. The proposed modular quantum formulation reproduces the reduced classical prototype after block fusion. A resource analysis shows that the reduced modular system requires seven qubits per block and twenty-two qubits in a straightforward four-block implementation. Finally, a crossovercomplexity model is derived to identify the regime in which quantum candidate search may become favorable relative to hierarchical fuzzy inference. The results show that no quantum advantage should be claimed for the present one-output reduced benchmark, but that a plausible crossover emerges for larger joint candidate spaces and higher linguistic granularity. The work therefore establishes a technically consistent starting point for future quantum-assisted electric-vehicle motor-design optimization.

Kumar, Praveen [ORNL] (ORCID:0000000291877857)↗