Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing frameworks”

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,045 records · Page 58

Accelerating uncertainty quantification in incremental dynamic analysis using dimension reduction-based surrogate modeling

We propose a surrogate modeling framework based on dimension reduction to facilitate the quantification of seismic risk of structural systems in performance-based earthquake engineering. The framework adopts incremental dynamic analysis (IDA) for addressing hazard variability, and promotes significant computational efficiency improvement for propagating epistemic uncertainties associated with the structural models. It utilizes both linear and nonlinear dimension reduction approaches, equipped with inverse mappings, to learn a functional between the input parameter space (e.g., the epistemic uncertainties of the structure) to the high-dimensional output space created through the IDA implementation across different ground motions and seismic intensity levels. Polynomial chaos expansion is adopted as the surrogate model to learn this functional in the reduced space. A nine-story steel moment-resisting frame with uncertain structural properties is used as a testbed. Furthermore, we select the seismic fragility curves as a measure of the structure’s seismic performance, since it provides an estimate of the probability of entering specified damage states for given levels of ground shaking.

42 ENGINEERING↗

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗

Roadmap and Benchmarking: Privacy in Federated Load Forecasting

Data-driven techniques for energy demand forecasting continue to emerge with promising impacts on distribution grid planning. However, the development of robust and generalizable machine learning models requires that representative high quality training data are available. Distributed energy resources have begun to embed intelligence, gathering large amounts of data on customer demand, behavior, and household devices that are connected to the grid. Though utilities aggregate meter-level demand data for load shaping, demand response, outage management, reliability planning, and billing applications, there lies an inherent privacy concern in sharing consumption data that may identify individual consumer behavioral patterns. Hence, while sharing the data is crucial, the private sensitive customer data must be safeguarded from being exposed or manipulated. In this study, we propose a roadmap for implementing a based privacy preserving framework to support the advancement of data-driven analytics in data-sensitive distributed energy resources environments. The roadmap incorporates federated learning–a distributed training framework, differential privacy–a statistical framework that provides guarantees to safeguard the leakage of sensitive data, secure multiparty computation and homomorphic encryption– techniques for encrypting model gradients and applying secure aggregation on the server. Moreover, we perform baseline experiments on the federated short-term load forecasting (STLF) task using open-source residential load profile datasets, offering insights into the challenges of integrating differential privacy into federated learning.

Abebe, Waqwoya [Oak Ridge National Laboratory (ORN↗

Efficient data-driven regression for reduced-order modeling of spatial pattern formation

We present an efficient data-driven regression approach for constructing reduced-order models (ROMs) of reaction-diffusion systems exhibiting pattern formation. The ROMs are learned non-intrusively from available training data of physically accurate numerical simulations. The method can be applied to general nonlinear systems through the use of polynomial model form, while not requiring knowledge of the underlying physical model, governing equations, or numerical solvers. The process of learning ROMs is posed as a low-cost least-squares problem in a reduced-order subspace identified via Proper Orthogonal Decomposition (POD). Numerical experiments on classical pattern-forming systems–including the Schnakenberg and Mimura–Tsujikawa models–demonstrate that higher-order surrogate models significantly improve prediction accuracy while maintaining low computational cost. The proposed method provides a flexible, non-intrusive model reduction framework, well suited for the analysis of complex spatio-temporal pattern formation phenomena.

Data-driven modeling↗

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗

Customizable wave tailoring nonlinear materials enabled by bilevel inverse design

Abstract Passive wave transformation via nonlinearity is ubiquitous in settings from acoustics to optics and electromagnetics. It is well known that different nonlinearities yield different effects on propagating signals, which raises the question of “what precise nonlinearity is the best for a given wave tailoring application?” In this work, considering a one-dimensional spring-mass chain connected by polynomial springs (a variant of the Fermi-Pasta-Ulam-Tsingou system), we introduce a bilevel inverse design method which couples the shape optimization of structures for tailored constitutive responses with reduced-order nonlinear dynamical inverse design. We apply it to two qualitatively distinct problems—minimization of peak transmitted kinetic energy from impact, and pulse shape transformation—demonstrating our method’s breadth of applicability. For the impact problem, we obtain two fundamental insights. First, small differences in nonlinearity can drastically change the dynamic response of the system, from severely under- to outperforming a comparative linear system. Second, the oft-used strategy of impact mitigation via “energy locking” bistability can be significantly outperformed by our optimal nonlinearity. We validate this case with impact experiments and find excellent agreement. This study establishes a framework for broader passive nonlinear mechanical wave tailoring material design, with applications to computing, signal processing, shock mitigation, and autonomous materials.

Science & Technology - Other Topics↗

NeuroCoreX: Brain-Inspired Computing from Code to Circuit

NeuroCoreX is an open-source codebase that enables the implementation of brain-inspired, energy-efficient neuromorphic computing models on FPGA hardware. Designed to support real-time learning, all-to-all neural connectivity, and flexible network architectures, NeuroCoreX offers a hands-on, accessible platform for exploring biologically inspired models of neural computation. It empowers researchers, students, and developers to implement and experiment with adaptive systems—bringing the power of neuromorphic computing to a broader community through a low-cost, scalable, and reconfigurable framework.

Gautam, Ashish [Oak Ridge National Laboratory (ORN↗

Nanoconfined Interfaces for Highly Selective Separation of Critical Rare Earth Elements

Industrial demand for rare earth elements (REEs) has surged over the past three decades due to their unique properties that support sustainable energy and new technologies. Separating individual REEs is challenging and hazardous, typically done through liquid-liquid extraction. There is an urgent need for environmentally friendly and efficient separation technologies for REEs. Porous materials offer promising advances for sustainable REE separation via ion-selective capture. We hypothesize that REE separation can be efficiently achieved in reactive nanopores, such as Zr(IV) and Cr(III) metal-organic frameworks (MOFs), through surface functionalization. By integrating material synthesis, interfacial chemistry experiments, theory, computation, and machine learning, we gained insights into the chemical factors controlling REE speciation and their competitive adsorption on MOFs. Our findings show that these materials’ selectivity can be tuned by surface functionalization. The machine learning component addressed ion-specific diffusion based on MOF topology and chemistry.

36 MATERIALS SCIENCE↗

Development of an Advanced Multiphysics Simulation Capability for Radiant's Microreactor Design

Argonne National Laboratory and Idaho National Laboratory, through a Department of Energy Gateway for Accelerated Innovation in Nuclear Voucher, supported key analysis needs of Radiant related to (i) air jacket thermal fluid performance, (ii) evaluation of decay heat source terms defining air jacket technical requirements, and (iii) assessment of modeling methodologies employed for core analysis. All of these activities center on numerical simulation of various aspects of Kaleidos using the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework, the Cardinal multiphysics application, the OpenMC Monte Carlo code, and the Nek5000 computational fluid dynamics (CFD) code. This project builds upon an earlier Nuclear Energy Advanced Modeling and Simulation (NEAMS) Thermal-Hydraulic (T/H) Center of Excellence (CoE) project focused on initial demonstration of Cardinal multiphysics simulation of High Temperature Gas Reactors (HTGRs) and now focuses on Radiant’s Kaleidos concept.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Idiomatic Correctness-Checking via Julienne in Fortran 2023

This paper presents a unified approach to unit testing and runtime assertion checking using Fortran 2023. The paper describes the support for our approach in the Julienne framework. Julienne leverages recent Fortran standards to implement object-oriented design patterns, support testing parallel programs, and implement functional programming patterns in order to craft idioms inspired by natural-language expressions. The presented idioms employ novel operators to write expressions that evaluate to a test-diagnosis object encapsulating two components: (1) the test outcome or assertion outcome and (2) an automatically generated diagnostic string. Two other novel aspects of the approach include (1) the ability to enforce assertions inside pure procedures and (2) the ability to output rich diagnostic information inside pure procedures during error termination when assertions fail. The latter capability mitigates against a reason that Fortran programmers commonly cite for not writing pure procedures: difficulty obtaining useful program output inside pure procedures when debugging code. This paper demonstrates how the adoption of the proposed idioms leads naturally to a unifying theme across two otherwise disparate technologies: unit testing and runtime assertion checking. Finally, this paper describes the usage of the Julienne testing framework for writing unit tests and assertions in the Matcha high-performance computing application and the Fiats deep learning library.

Rouson, Damian↗

Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients

In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.

convection–diffusion–reaction equation↗

A finite-difference program for stresses in anisotropic, layered plates in bending

The interlaminar stresses induced in a layered laminate that is bent into a cylindrical surface are studied. The laminate is modeled as a continuum, and the resulting elasticity equations are solved using the finite difference method. The report sets forth the mathematical framework, presents some preliminary results, and provides a listing and explanation of the computer program. Significant among the results are apparent symmetry relationships that will reduce the numerical size of certain problems and an interlaminar stress behavior having a sharp rise at the free edges.

Salamon, N. J.↗

Exploiting parallel computing with limited program changes using a network of microcomputers

Network computing and multiprocessor computers are two discernible trends in parallel processing. The computational behavior of an iterative distributed process in which some subtasks are completed later than others because of an imbalance in computational requirements is of significant interest. The effects of asynchronus processing was studied. A small existing program was converted to perform finite element analysis by distributing substructure analysis over a network of four Apple IIe microcomputers connected to a shared disk, simulating a parallel computer. The substructure analysis uses an iterative, fully stressed, structural resizing procedure. A framework of beams divided into three substructures is used as the finite element model. The effects of asynchronous processing on the convergence of the design variables are determined by not resizing particular substructures on various iterations.

Rogers, J. L., Jr.↗

TROJID: A portable software package for upper-stage trajectory optimization

Performance optimization for upper-stage exoatmospheric vehicles often is performed within the framework of a full capability trajectory simulation package requiring either a large mainframe computer or powerful work-station. Since these software packages tend to include capabilities providing for high-fidelity boost and reentry simulations, the programs usually are quite large and not very portable. The program TROJID is an attempt to provide an environment for the optimization of upper-stage trajectories within a small package capable of being run on a standard desktop microcomputer. Utilizing a state-of-the-art nonlinear programming algorithm and a trajectory simulator implementing impulsive burns and an analytic coast phase propagator, TROJID is capable of producing trajectories for optimal multi-burn upper-stage orbit transfers. The package has been designed to allow full generality in definition of both the trajectory simulator and the parameter optimization problem.

Hammes, Steven M.↗

Executing CLIPS expert systems in a distributed environment

This paper describes a framework for running cooperating agents in a distributed environment to support the Intelligent Computer Aided Design System (ICADS), a project in progress at the CAD Research Unit of the Design Institute at the California Polytechnic State University. Currently, the systems aids an architectural designer in creating a floor plan that satisfies some general architectural constraints and project specific requirements. At the core of ICADS is the Blackboard Control System. Connected to the blackboard are any number of domain experts called Intelligent Design Tools (IDT). The Blackboard Control System monitors the evolving design as it is being drawn and helps resolve conflicts from the domain experts. The user serves as a partner in this system by manipulating the floor plan in the CAD system and validating recommendations made by the domain experts. The primary components of the Blackboard Control System are two expert systems executed by a modified CLIPS shell. The first is the Message Handler. The second is the Conflict Resolver. The Conflict Resolver synthesizes the suggestions made by the domain experts, which can be either CLIPS expert systems, or compiled C programs. In DEMO1, the current ICADS prototype, the CLIPS domain expert systems are Acoustics, Lighting, Structural, and Thermal; the compiled C domain experts are the CAD system and the User Interface.

Taylor, James↗

Intelligent Agent Architectures: Reactive Planning Testbed

An Integrated Agent Architecture (IAA) is a framework or paradigm for constructing intelligent agents. Intelligent agents are collections of sensors, computers, and effectors that interact with their environments in real time in goal-directed ways. Because of the complexity involved in designing intelligent agents, it has been found useful to approach the construction of agents with some organizing principle, theory, or paradigm that gives shape to the agent's components and structures their relationships. Given the wide variety of approaches being taken in the field, the question naturally arises: Is there a way to compare and evaluate these approaches? The purpose of the present work is to develop common benchmark tasks and evaluation metrics to which intelligent agents, including complex robotic agents, constructed using various architectural approaches can be subjected.

Rosenschein, Stanley J.↗

The Density Matrix of H20 - N2 In the Coordinate Representation: A Monte Carlo Calculation of the Far-Wing Line Shape

The far-wing line shape theory within the binary collision and quasistatic framework has been developed using the coordinate representation. Within this formalism, the main computational task is the evaluation of multidimensional integrals whose variables are the orientational angles needed to specify the initial and final positions of the system during transition processes. Using standard methods, one is able to evaluate the 7-dimensional integrations required for linear molecular systems, or the 7-dimensional integrations for more complicated asymmetric-top (or symmetric-top) molecular systems whose interaction potential contains cyclic coordinates. In order to obviate this latter restriction on the form of the interaction potential, a Monte Carlo method is used to evaluate the 9-dimensional integrations required for systems consisting of one asymmetric-top (or symmetric-top) and one linear molecule, such as H20-N2. Combined with techniques developed previously to deal with sophisticated potential models, one is able to implement realistic potentials for these systems and derive accurate, converged results for the far-wing line shapes and the corresponding absorption coefficients. Conversely, comparison of the far-wing absorption with experimental data can serve as a sensitive diagnostic tool in order to obtain detailed information on the short-range anisotropic dependence of interaction potentials.

Ma, Q.↗

Reduced Vector Preisach Model

A new vector Preisach model, called the Reduced Vector Preisach model (RVPM), was developed for fast computations. This model, derived from the Simplified Vector Preisach model (SVPM), has individual components that like the SVPM are calculated independently using coupled selection rules for the state vector computation. However, the RVPM does not require the rotational correction. Therefore, it provides a practical alternative for computing the magnetic susceptibility using a differential approach. A vector version, using the framework of the DOK model, is implemented. Simulation results for the reduced vector Preisach model are also presented.

Patel, Umesh D.↗