Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computing methodologies”

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

Urban building energy modeling (UBEM) tools: A state-of-the-art review of bottom-up physics-based approaches

Regulations corroborate the importance of retrofitting existing building stocks or constructing new energy-efficient districts. There is, thus, a need for modeling tools to evaluate energy scenarios to better manage and design cities, and numerous methodologies and tools have been developed. Among them, Urban Building Energy Modelling (UBEM) tools allow the energy simulation of buildings at large scales. Choosing an appropriate UBEM tool, balancing the level of complexity, accuracy, usability, and computing needs, remains a challenge for users. The review focuses on the main bottom-up physics-based UBEM tools, comparing them from a user-oriented perspective. Five categories are used: (i) the required inputs, (ii) the reported outputs, (iii) the exploited workflow, (iv) the applicability of each tool, and (v) the potential users. Moreover, a critical discussion is proposed, focusing on interests and trends in research and development. The results highlighted major differences between UBEM tools that must be considered to choose the proper one for an application. Finally, barriers of adoption of UBEM tools include the needs of a standardized ontology, a common three-dimensional city model, a standard procedure to collect data, and a standard set of test cases. This feeds into future development of UBEM tools to support cities’ sustainability goals.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Predicting the Conformational Variability of Abl Tyrosine Kinase using Molecular Dynamics Simulations and Markov State Models

Understanding protein conformational variability remains a challenge in drug discovery. The issue arises in protein kinases, whose multiple conformational states can affect the binding of small-molecule inhibitors. To overcome this challenge, we propose a comprehensive computational framework based on Markov state models (MSMs). Our framework integrates the information from explicit-solvent molecular dynamics simulations to accurately rank-order the accessible conformational variants of a target protein. We tested the methodology using Abl kinase with a reference and blind-test set. Only half of the Abl conformational variants discovered by our approach are present in the disclosed X-ray structures. We report the approach successfully identified a protein conformational state not previously observed in public structures but evident in a retrospective analysis of Lilly in-house structures: the X-ray structure of Abl with WHI-P154. Using a MSM-derived model, the free energy landscape and kinetic profile of Abl was analyzed in detail highlighting opportunities for targeting the unique metastable states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Vibrational infrared and Raman spectra of polypeptides: Fragments-in-fragments within molecular tailoring approach

The present work reports the calculation of vibrational infrared (IR) and Raman spectra of large molecular systems employing molecular tailoring approach (MTA). Further, it extends the grafting procedure for the accurate evaluation of IR and Raman spectra of large molecular systems, employing a new methodology termed as Fragments-in-Fragments (FIF), within MTA. Unlike the previous MTA-based studies, the accurate estimation of the requisite molecular properties is achieved without performing any full calculations (FC). The basic idea of the grafting procedure is implemented by invoking the nearly basis-set-independent nature of the MTA-based error vis-à-vis the respective FCs. FIF has been tested out for the estimation of the above molecular properties for three isomers, viz., β-strand, 3{sub 10}- and α-helix of acetyl(alanine){sub n}NH{sub 2} (n = 10, 15) polypeptides, three conformers of doubly protonated gramicidin S decapeptide and trpzip2 protein (PDB id: 1LE1), respectively, employing BP86/TZVP, M06/6-311G**, and M05-2X/6-31G** levels of theory. For most of the cases, a maximum difference of 3 cm{sup −1} is achieved between the grafted-MTA frequencies and the corresponding FC values. Further, a comparison of the BP86/TZVP level IR and Raman spectra of α-helical (alanine){sub 20} and its N-deuterated derivative shows an excellent agreement with the existing experimental spectra. In view of the requirement of only MTA-based calculations and the ability of FIF to work at any level of theory, the current methodology provides a cost-effective solution for obtaining accurate spectra of large molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Orbital breathing effects in the computation of x-ray d -ion spectra in solids by ab initio wave-function-based methods

In existing theoretical approaches to core-level excitations of transition-metal ions in solids relaxation and polarization effects due to the inner core hole are often ignored or described phenomenologically. Here, we set up an ab initio computational scheme that explicitly accounts for such physics in the calculation of x-ray absorption and resonant inelastic x-ray scattering spectra. Good agreement is found with experimental transition-metal L-edge data for the strongly correlated d 9 cuprate Li 2 CuO 2 , for which we also determine the absolute scattering intensities. The newly developed methodology opens the way for the investigation of even more complex d n electronic structures of group VI B to VIII B correlated oxide compounds.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Pseudo-fragment approach for extended systems derived from linear-scaling DFT

We present a computational approach which is tailored for reducing the complexity of the description of extended systems at the density functional theory level. We define a recipe for generating a set of localized basis functions which arc optimized either for the accurate description of pristine, bulk-like Wannier functions, or for the in situ treatment of deformations induced by defective constituents such as boundaries or impurities. Our method enables one to identify the regions of an extended system which require dedicated optimization of the Kohn-Sham degrees of freedom, and provides the user with a reliable estimation of the errors-if any-induced by the locality of the approach. Such a method facilitates on the one hand an effective reduction of the computational degrees of freedom needed to simulate systems at the nanoscale, while in turn providing a description that can be straightforwardly put in relation to effective models, like tight binding Hamiltonians. In conclusion, we present our methodology with SiC nanotube-like cages as a test bed. Nonetheless, the wavelet-based method employed in this paper makes possible calculation of systems with different dimensionalities, including slabs and fully periodic systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Exascale Workload Characterization and Architecture Implications

We use a hybrid methodology based on binary instrumentation and performance counters to characterize a set of proxy applications (mini-apps and PETSc applications) representative of a broad range of scientific applications (and particularly DOE's future high performance computing workloads). From this empirical basis, we create statistical models that extrapolate application properties (instruction mix, memory size, and memory bandwidth) as a function of problem size. We validate them and project the first quantitative characterization of an exascale computing workload. Finally, the exascale workload is used to evaluate a radical new exascale architecture, stacked DRAM with processor under memory (PUM). Of the two projections, one shows major potential benefits in using PUM. However, the second, more conservative projection suggests that only a small number of exascale applications are likely to be memory-bandwidth limited, but even these are fundamentally memory-capacity limited.

Balaprakash, Prasanna↗

Vision Foundation Models in Remote Sensing: A survey

Artificial intelligence (AI) technologies have profoundly transformed the field of remote sensing (RS), revolutionizing data collection, processing, and analysis. Traditionally reliant on manual interpretation and task-specific models, RS research has been significantly enhanced by the advent of foundation models (FMs)—large-scale pretrained AI models capable of performing a wide array of tasks with unprecedented accuracy and efficiency. This article provides a comprehensive survey of FMs in the RS domain. We categorize these models based on their architectures, pretraining datasets, and methodologies. Through detailed performance comparisons, we highlight emerging trends and the significant advancements achieved by those FMs. Additionally, we discuss technical challenges, practical implications, and future research directions, addressing the need for high-quality data, computational resources, and improved model generalization. Our research also finds that pretraining methods, particularly self-supervised learning (SSL) techniques like contrastive learning (CL) and masked autoencoders (MAEs), remarkably enhance the performance and robustness of FMs. This survey aims to serve as a resource for researchers and practitioners by providing a panorama of advances and promising pathways for the continued development and application of FMs in RS.

data models↗

A Hierarchical Multi-Agent Based Anomaly Detection for Wide-Area Protection in Smart Grid

Future smart grid capabilities provide assurance to expand the advanced information and communication technologies to evolve into densely interconnected cyber physical system. Remedial Action Scheme (RAS), widely used for wide-area protection, relies on the interconnected networks and data sharing devices, which are exposed to the multitude of vulnerabilities. This paper presents our proposed approach to developing multi-agent based RAS scheme against the system-aware stealthy cyber-attacks. Specifically, we propose the two-level hierarchical architecture which consists of distributed local RAS controllers (RAScs) as local agents, operating at different zones/ areas, which are constantly monitored by an overseer, the central agent. The local controllers receive local and randomly changing outside zonal measurements and cyclically forwards to the overseer. The overseer identifies the corrupted controller using the anomaly detection algorithm which processes the measurements coming from the local controllers, compute measurement errors using local and outside zonal measurements, perform validation checks, and finally detect anomalies based on the two-step verification. Next, as a proof of concept, we have implemented and validated the proposed methodology in cyber physical environment at Iowa State’s PowerCyber testbed. We have also implemented the coordinated attack vectors which involve corrupting the local controller and later performing stealthy attacks on the system’s generator. We have evaluated its performance during the online testing in terms of detection rate and Iatency. The experimental results show that it is efficient in detecting different classes of attacks, including ramp and pulse attacks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Conditions for Small-signal Stability of Power Grids and Local Control Design

Operating modern power grids with stability guarantees is markedly important. Typical methods for analyzing and certifying power grid stability are largely centralized relying on the ability of the system operator to gather network-wide information and accurately compute the system's eigenvalues. These methods are oftentimes not privacy-preserving and computationally burdensome. They are therefore, not well-suited to modern power grids where small-signal stability has to be evaluated timely, efficiently and in a privacy-preserving fashion. Herein, we introduce a distributed methodology for certifying small-signal stability of power grids and designing the local controllers. First, we analytically derive distributed conditions for network-wide stability that bus agents can inspect using local information. By leveraging these conditions, we then introduce a distributed control design algorithm (DCDA) that can guide the local control design so that stability of the interconnected system is guaranteed. The agents that adopt the proposed distributed algorithm are responsible for tuning their local controllers, producing their local control commands and ensuring that their local stability condition is met. The system operator is only responsible for verifying network-wide stability upon receiving affirmative responses from all agents and, announcing, that the overall system is stable. The proposed DCDA algorithm is numerically validated via simulations using the IEEE 39-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

tesuract v.1.0

SAND2021-14370 O Tesuract (tensor surrogate approximation and computation) provides Python tools to build machine learning regressors that include polynomial chaos expansions. The software also offers methods for creation regressors for tensor outputs such as spatially varying fields and using a reduced order modeling methodology. The library is built on and compatible with the scikit-learn API, which allows integration with one of the most ubiquitous machine learning Python libraries out there. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Chowdhary, Kamaljit↗

Integration of Kokkos into MonteRay [Slides]

Monte Carlo Neutron Transport codes are C++-based and simulate interaction of nuclear particles with materials. MonteRay is a library for accelerating Monte Carlo ray-casting tallies with GPUs. Kokkos is commonly used to write performance portable applications for HPC platforms. A goal is to implement Kokkos into the Expected Path Length file that uses Cuda as a backend. The methodology and results are summarized.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Influence of Standard Image Processing of 3D X-ray Microscopy on Morphology, Topology and Effective Properties

Estimating porous media properties is a vital component of geosciences and the physics of porous media. Until now, imaging techniques have focused on methodologies to match image-derived flows or geomechanical parameters with experimentally identified values. Less emphasis has been placed on the compromise between image processing techniques and the consequences on topological and morphological characteristics and on computed properties such as permeability. The effects of some of the most popular image processing techniques (filtering and segmentation) available in open source on 3D X-ray Microscopy (micro-XRM) images are qualitatively and quantitatively discussed. We observe the impacts of various filters such as erosion-dilation and compare the efficiency of Otsu’s method of thresholding and the machine-learning-based software Ilastik for segmentation.

58 GEOSCIENCES↗

The Swan: Data-driven Inference of Stellar Surface Gravities for Cool Stars from Photometric Light Curves

Stellar light curves are well known to encode physical stellar properties. Precise, automated, and computationally inexpensive methods to derive physical parameters from light curves are needed to cope with the large influx of these data from space-based missions such as Kepler and TESS. Here we present a new methodology that we call “The Swan,” a fast, generalizable, and effective approach for deriving stellar surface gravity (logg) for main-sequence, subgiant, and red giant stars from Kepler light curves using local linear regression on the full frequency content of Kepler long-cadence power spectra. With this inexpensive data-driven approach, we recover logg to a precision of ~0.02 dex for 13,822 stars with seismic logg values between 0.2 and 4.4 dex and ~0.11 dex for 4646 stars with Gaia-derived logg values between 2.3 and 4.6 dex. We further develop a signal-to-noise metric and find that granulation is difficult to detect in many cool main-sequence stars (T {sub eff} ≲ 5500 K), in particular K dwarfs. By combining our logg measurements with Gaia radii, we derive empirical masses for 4646 subgiant and main-sequence stars with a median precision of ~7%. Finally, we demonstrate that our method can be used to recover logg to a similar mean absolute deviation precision for a TESS baseline of 27 days. Our methodology can be readily applied to photometric time series observations to infer stellar surface gravities to high precision across evolutionary states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel Multi-cycle LES of an Optical Pent-roof DISI Engine Under Motored Operating Conditions

The use of Large-eddy Simulations (LES) has increased due to their ability to resolve the turbulent fluctuations of engine flows and capture the resulting cycle-to-cycle variability. One drawback of LES, however, is the requirement to run multiple engine cycles to obtain the necessary cycle statistics for full validation. The standard method to obtain the cycles by running a single simulation through many engine cycles sequentially can take a long time to complete. Recently, a new strategy has been proposed by our research group to reduce the amount of time necessary to simulate the many engine cycles by running individual engine cycle simulations in parallel. With modern large computing systems this has the potential to reduce the amount of time necessary for a full set of simulated engine cycles to finish by up to an order of magnitude. In this paper, the Parallel Perturbation Methodology (PPM) is used to simulate up to 35 engine cycles of an optically accessible, pent-roof Directinjection Spark-ignition (DISI) engine at two different motored engine operating conditions, one throttled and one un-throttled. Comparisons are made against corresponding sequential-cycle simulations to verify the similarity of results using either methodology. Mean results from the PPM approach are very similar to sequential-cycle results with less than 0.5% difference in pressure and a magnitude structure index (MSI) of 0.95. Differences in cycle-to-cycle variability (CCV) predictions are larger, but close to the statistical uncertainty in the measurement for the number of cycles simulated. PPM LES results were also compared against experimental data. Mean quantities such as pressure or mean velocities were typically matched to within 5- 10%. Pressure CCVs were under-predicted, mostly due to the lack of any perturbations in the pressure boundary conditions between cycles. Velocity CCVs for the simulations had the same average magnitude as experiments, but the experimental data showed greater spatial variation in the root-mean-square (RMS). Conversely, circular standard deviation results showed greater repeatability of the flow directionality and swirl vortex positioning than the simulations.

I.C. Engines↗

Sensitivity/Uncertainty Comparison Study: Oak Ridge National Laboratory Results

Various methods and tools have been developed over the years to assist Nuclear Criticality Safety practitioners in determining a safe upper subcritical limit (USL) for an application of interest. The Nuclear Criticality Safety Program has funded a task to compare calculated USL methods developed at three laboratories—Oak Ridge National Laboratory (ORNL), Los Alamos National Laboratory (LANL), and the Institute for Radiological Protection and Nuclear Safety (IRSN)—on a small set of benchmark problems. The purpose of this paper is to present the ORNL results using the Tools for Sensitivity Uncertainty Analysis Methodology Implementation (TSUNAMI) from the SCALE 6.2.3 code suite.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Kernel principal component analysis for stochastic input model generation

Highlights: {yields} KPCA is used to construct a reduced order stochastic model of permeability. {yields} A new approach is proposed to solve the pre-image problem in KPCA. {yields} Polynomial chaos is used to provide a parametric stochastic input model. {yields} Flow in porous media with channelized permeability is considered. - Abstract: Stochastic analysis of random heterogeneous media provides useful information only if realistic input models of the material property variations are used. These input models are often constructed from a set of experimental samples of the underlying random field. To this end, the Karhunen-Loeve (K-L) expansion, also known as principal component analysis (PCA), is the most popular model reduction method due to its uniform mean-square convergence. However, it only projects the samples onto an optimal linear subspace, which results in an unreasonable representation of the original data if they are non-linearly related to each other. In other words, it only preserves the first-order (mean) and second-order statistics (covariance) of a random field, which is insufficient for reproducing complex structures. This paper applies kernel principal component analysis (KPCA) to construct a reduced-order stochastic input model for the material property variation in heterogeneous media. KPCA can be considered as a nonlinear version of PCA. Through use of kernel functions, KPCA further enables the preservation of higher-order statistics of the random field, instead of just two-point statistics as in the standard Karhunen-Loeve (K-L) expansion. Thus, this method can model non-Gaussian, non-stationary random fields. In this work, we also propose a new approach to solve the pre-image problem involved in KPCA. In addition, polynomial chaos (PC) expansion is used to represent the random coefficients in KPCA which provides a parametric stochastic input model. Thus, realizations, which are statistically consistent with the experimental data, can be generated in an efficient way. We showcase the methodology by constructing a low-dimensional stochastic input model to represent channelized permeability in porous media.

97 MATHEMATICS AND COMPUTING↗

Adaptive polynomial chaos techniques for uncertainty quantification of a gas cooled fast reactor transient

Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing high accuracy at affordable computational cost. This paper presents such polynomial chaos (PC) methods using adaptive sparse grids and adaptive basis set construction, together with an application to a Gas Cooled Fast Reactor transient. Comparison is made between a new sparse grid algorithm and the traditionally used technique proposed by Gerstner. An adaptive basis construction method is also introduced and is proved to be advantageous both from an accuracy and a computational point of view. As a demonstration the uncertainty quantification of a 50% loss of flow transient in the GFR2400 Gas Cooled Fast Reactor design was performed using the CATHARE code system. The results are compared to direct Monte Carlo sampling and show the superior convergence and high accuracy of the polynomial chaos expansion. Since PC techniques are easy to implement, they can offer an attractive alternative to traditional techniques for the uncertainty quantification of large scale problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Flexible Reservation Algorithm for Advance Network Provisioning

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

97 MATHEMATICS AND COMPUTING↗