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,531 records · Page 85

A Scalable Graph Analytics Framework for Programming with Big Data in R (pbdR)

Many disciplines such as biology, economics, engineering, physics, and the social sciences represent their data as graphs to capture patterns, trends, and associations. There are are many commercially available graph libraries in different programming languages to analyze these complex graphs. But there is no distributed graph library package in R - the popular statistical programming language to analyze graphs that bigger than a single machine's memory. Many domain experts prefer R over the numerous other alternatives. Towards this, we present a distributed graph analytics framework for R called programming with big graph using R (pBGR.) Our proposed framework leverages the Programming with Big Data in R (pbdR) ecosystem that provides scalable R packages for distributed computing in data science. We present an early prototype implementation of this framework using the distributed-memory parallel graph library CombBLAS and evaluate the framework's performance on leadership class computing platforms. Our experimental results demonstrate that the proposed framework is capable of performing large-scale parallel graph mining through the easyto-use R language. This enhanced graph processing capability coupled with other statistical tools already available in R, should be valuable to many domain experts.

Hasan, S M Shamimul↗

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

Assessment of health-care waste disposal methods using a VIKOR-based fuzzy multi-criteria decision making method

Highlights: • Propose a VIKOR-based fuzzy MCDM technique for evaluating HCW disposal methods. • Linguistic variables are used to assess the ratings and weights for the criteria. • The OWA operator is utilized to aggregate individual opinions of decision makers. • A case study is given to illustrate the procedure of the proposed framework. - Abstract: Nowadays selection of the appropriate treatment method in health-care waste (HCW) management has become a challenge task for the municipal authorities especially in developing countries. Assessment of HCW disposal alternatives can be regarded as a complicated multi-criteria decision making (MCDM) problem which requires consideration of multiple alternative solutions and conflicting tangible and intangible criteria. The objective of this paper is to present a new MCDM technique based on fuzzy set theory and VIKOR method for evaluating HCW disposal methods. Linguistic variables are used by decision makers to assess the ratings and weights for the established criteria. The ordered weighted averaging (OWA) operator is utilized to aggregate individual opinions of decision makers into a group assessment. The computational procedure of the proposed framework is illustrated through a case study in Shanghai, one of the largest cities of China. The HCW treatment alternatives considered in this study include “incineration”, “steam sterilization”, “microwave” and “landfill”. The results obtained using the proposed approach are analyzed in a comparative way.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Extending the Concept of Component Interfaces: Experience with the Integrated Plasma Simulator

In the component approach, components are said to interact through well-defined interfaces. Conventionally, these interfaces are based on method signatures which define the syntax, if not the semantics of the interface. However in many cases, this does not encompass all of the interactions a component has with its peers. In the Integrated Plasma Simulator (IPS), a framework for coupled simulation of fusion plasmas developed by the Center for Simulation of RF Wave Interactions with Magnetohydrodynamics (SWIM), we find that components interact through files and through an event service in addition to the usual method calls. In this report, we discuss the motivations for the design of the IPS and our experience with it. We further consider whether the concept of a component interface needs to be extended, and how it might be done. Component-based software engineering (CBSE) has allowed applications to grow in size, scale and power, by coupling components along well-defined interfaces. Many groups have come together to provide rules and standards for component and interface definitions. General purpose component architectures have been designed for business, and scientific computing, while domain specific component frameworks have been created in many domains, including climate modeling, rocket simulation, and engineering. In each architecture, component interfaces, typically implemented as method invocations, are the only ways that are mentioned for components to interact with each other and the outside world. However, components may not always communicate over their interfaces. They can interact with software entities in many other ways including sharing files and publish/subscribe systems. In this paper we consider two ways in which components interact without method invocation in a component framework, how the component interface can be extended to describe these interactions, and the implications on the greater component community. The rest of the paper continues as follows: first we briefly describe the fusion simulation framework that serves as the basis for the discussion (Sec. 2), followed by a description of non-interface interactions (Sec. 3), a discussion of how to extend to the component interface (Sec. 4) and finally some conclusions (Sec. 5).

33 ADVANCED PROPULSION SYSTEMS↗

Information Power Grid: Distributed High-Performance Computing and Large-Scale Data Management for Science and Engineering

The term "Grid" refers to distributed, high performance computing and data handling infrastructure that incorporates geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. The vision for NASN's Information Power Grid - a computing and data Grid - is that it will provide significant new capabilities to scientists and engineers by facilitating routine construction of information based problem solving environments / frameworks that will knit together widely distributed computing, data, instrument, and human resources into just-in-time systems that can address complex and large-scale computing and data analysis problems. IPG development and deployment is addressing requirements obtained by analyzing a number of different application areas, in particular from the NASA Aero-Space Technology Enterprise. This analysis has focussed primarily on two types of users: The scientist / design engineer whose primary interest is problem solving (e.g., determining wing aerodynamic characteristics in many different operating environments), and whose primary interface to IPG will be through various sorts of problem solving frameworks. The second type of user if the tool designer: The computational scientists who convert physics and mathematics into code that can simulate the physical world. These are the two primary users of IPG, and they have rather different requirements. This paper describes the current state of IPG (the operational testbed), the set of capabilities being put into place for the operational prototype IPG, as well as some of the longer term R&D tasks.

Johnston, William E.↗

artG4: A Generic Framework for Geant4 Simulations

A small experiment must devote its limited computing expertise to writing physics code directly applicable to the experiment. A software 'framework' is essential for providing an infrastructure that makes writing the physics-relevant code easy. In this paper, we describe a highly modular and easy to use framework for writing Geant4 based simulations called 'artg4'. This framework is a layer on top of the art framework.

Arvanitis, Tasha↗

Ion-Electron Coupling-Driven Redox Behavior in Metal–Organic Frameworks

Redox-active metal–organic frameworks (MOFs) have long been proposed as electronic transport platforms, yet the microscopic origin of their conductivity remains debated. A theoretical demonstration reveals charge transport in a Zn(pyrazole–naphthalene diimide (NDI)) MOF arising not from delocalized band-like states but from redox hopping between discrete linker sites. Using ab initio molecular dynamics simulations combined with electronic structure analysis, we established a direct link among electron injection, structural reorganization, and transport. Electron accumulation proceeds sequentially and site-selectively from imide and carbonyl groups of the NDI core progressively involving pyrazole N atoms at higher reduction states, through a hierarchy of redox-active sites. In contrast, Zn nodes remain essentially redox-inactive, which confirms their structural role. Density-of-states analysis corroborates a transport regime dominated by linker-centered states with evolving p-character upon reduction, resulting in dynamically reconfigured conduction networks. Real-time trajectories reveal anisotropic linker-to-linker electron transfer modulated by counterion coordination. This cooperative ion–electron regime emerges from potential energy surface collapse into a single low-barrier transition (ΔG ‡ ≈ 45 meV), where ionic and electronic motions evolve adiabatically on the same free-energy landscape. Elucidating redox conductivity in Zn(pyrazole–NDI) MOFs provides a theoretical framework for use in neuromorphic computing and related technologies.

Charge transfer↗

A High Performance Computing Approach to Tree Cover Delineation in 1-m NAIP Imagery Using a Probabilistic Learning Framework

Tree cover delineation is a useful instrument in deriving Above Ground Biomass (AGB) density estimates from Very High Resolution (VHR) airborne imagery data. Numerous algorithms have been designed to address this problem, but most of them do not scale to these datasets, which are of the order of terabytes. In this paper, we present a semi-automated probabilistic framework for the segmentation and classification of 1-m National Agriculture Imagery Program (NAIP) for tree-cover delineation for the whole of Continental United States, using a High Performance Computing Architecture. Classification is performed using a multi-layer Feedforward Backpropagation Neural Network and segmentation is performed using a Statistical Region Merging algorithm. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on Conditional Random Field, which helps in capturing the higher order contextual dependencies between neighboring pixels. Once the final probability maps are generated, the framework is updated and re-trained by relabeling misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates. The tree cover maps were generated for the whole state of California, spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles. The framework produced true positive rates of around 88% for fragmented forests and 74% for urban tree cover areas, with false positive rates lower than 2% for both landscapes. Comparative studies with the National Land Cover Data (NLCD) algorithm and the LiDAR canopy height model (CHM) showed the effectiveness of our framework for generating accurate high-resolution tree-cover maps.

Segments↗

Assessing Two Approaches for Enhancing the Range of Simulated Scales in the E3SMv1 and the Impact on the Character of Hourly US Precipitation

Abstract Improving the representation of precipitation in Earth system models is essential for understanding and projecting water cycle changes across scales. Progress has been hampered by persistent deficiencies in representing precipitation frequency, intensity, and timing in current models. Here, we analyze simulated US precipitation in the low‐resolution (LR) configuration of the Energy Exascale Earth System Model (E3SMv1) and assess the effect of two approaches to enhance the range of explicitly resolved scales: high‐resolution (HR) and multiscale modeling framework (MMF), which incur similar computational expense. Both E3SMv1‐MMF and E3SMv1‐HR capture more intense and less frequent precipitation on hourly and daily timescales relative to E3SMv1‐LR. E3SMv1‐HR improves the intensity over the Eastern and Northwestern US during winter, while E3SMv1‐MMF improves the intensity over the Eastern US and summer diurnal timing over the Central US. These results indicate that both methods may be needed to improve simulations of different storm types, seasons, and regions.

58 GEOSCIENCES↗

HPC-EPIC for High Resolution Simulations of Environmental and Sustainability Assessment

Multiple concerns over the impact of wide scale changes in land management have motivated comprehensive analyses of environmental sustainability of food and biofuel production. These call for high-resolution land management tools that enable comprehensive analyses of natural resources for decision-making. The agroecosystem simulation models with the most biophysical detail are point models, which often have a user interface that allows users to provide inputs and examine results for agricultural field scale analyses. These are not able to meet the needs of high-resolution regional or national simulations. We describe an efficient computational approach for deployment of the Environmental Policy Integrated Climate (EPIC) model at high-resolution spatial scales using high performance computing (HPC) techniques. We developed an integrated procedure for executing the millions of simulations required for high-resolution, regional studies, and also address building databases for model initialization, model forcing data, and model outputs. We first ported EPIC from Windows to an HPC platform and validated output from both platforms. We then developed methods of packaging simulations for efficient, unattended parallel execution on the HPC cluster. The job queuing system, Portable Batch System (PBS) is employed to control job submission. Simulation outputs are extracted to PostgreSQL database for analysis. In a case study covering four counties in central Wisconsin using HPC-EPIC, we finished over 140 K simulations in a total of 10 h on an HPC cluster using 20 nodes. This is a speedup of 40 times. More nodes could be used to achieve larger speedups. The HPC-EPIC model developed in this study is anticipated to provide information useful for high-resolution land use management and decision making. The framework for high-performance computing can be extended to other traditional, point-based biophysical simulation models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Prediction of hydrogen adsorption in nanoporous materials from the energy distribution of adsorption sites

We present a fast and accurate, semi-analytical method for predicting hydrogen adsorption in nanoporous materials. For any temperature and pressure, the adsorbed amount is calculated as an integral over the energy density of adsorption sites (guest-host interactions) plus an average guest-guest term. The guest-host interaction energy is calculated using a classical force field with hydrogen modelled as a single-site probe. The guest-guest interaction energy is approximated using an average coordination number, which is regressed using Gaussian Process Regression (GPR). Local adsorption at each site is then modelled using a Langmuir isotherm, which when weighted with its probability density gives an accurate description of hydrogen adsorption. The method is tested on 933 metal-organic frameworks (MOFs) from the Computation-Ready Experimental (CoRE) MOF database at 77 K from 10 –5 to 100 bar, and the results are compared against GCMC predictions. To demonstrate the utility of the method, we calculated hydrogen adsorption isotherms for 12,914 existing MOF structures, at two different temperatures at a speed about 100 times that of GCMC simulations and analyzed the results. Here, we found 13 MOFs with predicted deliverable capacities exceeding the DOE target of 50 g/L for adsorption at 100 bar, 77 K and desorption at 5 bar, 160 K.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Leveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms

Qubit loss errors constitute a dominant source of noise in many quantum hardware systems, particularly in neutral-atom quantum computers. We develop a theoretical framework to effectively detect and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering general quantum error correction codes and logical circuits, we introduce a delayed-erasure decoder for experimentally motivated error models which leverages information from delayed loss detection to accurately correct loss errors, even when the precise moment of the error is unknown. Using this decoder, we identify strategies for detecting and correcting loss errors based on the logical circuit structure. For deep circuits prior to logical measurement, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise and hardware capabilities. In contrast, we find that many key algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits with no additional experimental overhead. We simulate this setting using a toy model algorithm for small-angle synthesis and find a significant performance improvement as the loss fraction increases. These results provide a path forward for advancing large-scale fault-tolerant quantum computation in systems with loss error detection.

atoms↗

ZeoNet: 3D convolutional neural networks for predicting adsorption in nanoporous zeolites

Zeolites are one of the most widely used materials in the chemical industry due to their nanometer-sized pores that can adsorb and react upon molecules selectively. With hundreds of known framework topologies and hundreds of thousands of computationally predicted structures, the ability to rapidly predict zeolite performance allows researchers to prioritize their efforts on the most promising structures for a given application. Although the accuracy of forcefield-based atomistic simulations has advanced significantly in the past two decades, these simulations can be computationally expensive, especially for long-chain, complex molecules. Here, we present ZeoNet, a representation learning framework using convolutional neural networks (ConvNets) and 3D volumetric representations for predicting adsorption in zeolites. ZeoNet was trained on the task of predicting Henry's constants for adsorption, k H , of n-octadecane in more than 330 000 known and predicted zeolite materials. Employing a 3D grid based on the distances to solvent-accessible surfaces, a volumetric representation that can be generated efficiently, the best-performing ZeoNet achieved a correlation coefficient r 2 = 0.977 and a mean-squared error MSE = 3.8 in ln k H , which corresponds to an error of 9.3 kJ mol -1 in adsorption free energy. In comparison, a model based on hand-designed geometric features has values of r 2 = 0.783 and MSE = 35.7. ZeoNet is also relatively efficient and can process ≈8 structures per second on an Nvidia RTX 2080TI GPU, orders of magnitude faster than forcefield-based simulations. A systematic analysis was conducted to investigate how the choice of ConvNet architectures, the linear dimension (L) and spatial resolution (Δd) of the distance grids, batch size, optimizer, and learning rate impact the model performance. We found that ConvNets based on the ResNet architecture offer the best tradeoff between expressiveness and efficiency. The performance for all models reaches a plateau at L = 30–45 Å and depends less sensitively on grid resolution, with a small benefit around Δd = 0.30–0.45 Å. Finally, saliency maps were visualized to identify which regions of the materials contributed the most to model predictions. It was found, interestingly, that the predictions are driven primarily by the accessible pore volume rather than the region occupied by the framework atoms.

36 MATERIALS SCIENCE↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Framework for optimization of long-term, multi-period investment planning of integrated urban energy systems

In order to achieve stringent greenhouse gas emission reductions, a transition of our entire energy system from fossil to renewable resources needs to be designed. Such an energy transition brings two main challenges: most renewables generate variable electric energy, yet most demand is currently not electric (carrier mismatch) and does not always manifest at the same time as supply (temporal mismatch). Integrating multiple energy infrastructures can address both challenges by using the synergy between different energy carriers; building on existing infrastructure, while allowing a robust and flexible integration of the new. This paper proposes an optimization framework for long-term, multi-period investment planning of urban energy systems in an integrated manner. We formulate it as a mixed-integer linear program, combining a capacitated facility location with a multi-dimensional, capacitated network design problem. It includes generation and network expansion planning as well as interconnections between networks and storage infrastructure for each energy system. It can incorporate pathway effects like techno-economic developments, policy measures, and weather variations. The intended use is to support urban decision makers with long-term investment planning, though it can be tailored to fit other geographical or temporal scales. We demonstrate the model using two cases based on an average city in The Netherlands, which wants to reduce its CO 2 -emissions with 95% by 2050. In the first case, we include explicit carbon-emission constraints to study the effects of the carrier mismatch. In the second case, we implement interannual weather variations to analyze the temporal mismatch. The results give valuable insights into the energy transition design strategy for urban decision makers. They also show the future potential, as well as the computational challenges of the optimization framework.

24 POWER TRANSMISSION AND DISTRIBUTION↗

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗

A multi‐variable framework for selecting WRF physics configurations at convection‐permitting scales: An Amazon wet‐season case study

Tropical convection over rainforests modulates atmospheric circulation and the energy and hydrological cycles across multiple scales. However, the scarcity of observations still limits our understanding of these processes. Although numerical models are utilized to investigate atmospheric physical processes, their performance depends on the choice of parameterizations and grid resolution. Here, in this work, we introduce and apply a multi‐variable, multi‐physics framework to evaluate and rank the Advanced Research Weather Research and Forecasting (WRF–ARW) configurations at 1‐km resolution over the central Amazon during the wet season. A 48‐member ensemble combines three land‐surface models (LSMs), four planetary boundary layer (PBL), and four microphysics (MP) schemes. Model performance for seven convection‐related near‐surface and boundary‐layer variables is assessed using Taylor diagrams and the Taylor skill score (TSS), analysis of variance (ANOVA)‐based sensitivity metrics, and non‐parametric rank tests. We then construct a combined, weighted TSS to identify configurations that are comparatively robust across variables. Results showed that most configurations reproduce near‐surface temperature, sensible and latent heat fluxes, and boundary‐layer height reasonably well, whereas humidity and rainfall remain challenging. LSM choice has the strongest impact on the surface fluxes and a secondary influence on near‐surface temperature and humidity, PBL schemes dominate boundary‐layer height, and MP schemes exert the largest control on rainfall. No single configuration is optimal for all variables, but the combination of Noah (LSM), Yonsei University (PBL), and Morrison (MP) emerges as the most robust configuration for this case, with the WRF single‐moment six‐class scheme (WSM6) providing a competitive, computationally cheaper MP alternative. The framework is general and can be applied to other regions, seasons, and convective regimes.

Amazon rainforest↗

Computational Homogenization of Polycrystals

This paper reviews the current state of the art in the simulation of the mechanical behavior of polycrystalline materials by means of computational homogenization. The key ingredients of this modeling strategy are presented in detail starting with the parameters needed to describe polycrystalline microstructures and the digital representation of such microstructures in a suitable format to perform computational homogenization. The different crystal plasticity frameworks that can describe the physical mechanisms of deformation in single crystals (dislocation slip and twinning) at the microscopic level are presented next. This is followed by the description of computational homogenization methods based on mean-field approximations by means of the viscoplastic self-consistent approach, or on the full-field simulation of the mechanical response of a representative polycrystalline volume element by means of the finite element method or the fast Fourier transform-based method. Multiscale frameworks based on the combination of mean-field homogenization and the finite element method are presented next to model the plastic deformation of polycrystalline specimens of arbitrary geometry under complex mechanical loading. Examples of application to predict the strength, fatigue life, damage, and texture evolution under different conditions are presented to illustrate the capabilities of the different models. Lastly, current challenges and future research directions in this field are summarized.

36 MATERIALS SCIENCE↗