Search NASA⌕ Search

SEARCH · Search NASA

Results for “domain of applicability”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

CFD-Based Frequency Domain Method for Dynamic Stability Derivative Estimation with Application to Transonic Truss-Braced Wing

This paper presents a dynamic stability estimation technique obtained from high-fidelity CFD simulations of the Mach 0.8 Transonic Truss-Braced Wing (TTBW). A series of unsteady RANS CFD simulations in FUN3D is performed on the TTBW in pitch and plunge oscillations at various reduced frequencies. The time-domain data are transformed into the frequency-domain data by Fourier series. Transfer functions of the dynamic stability derivatives are then estimated by a frequency-domain regression. The dynamic stability derivatives with respect to the angle of attack are determined by the regression of the unsteady aerodynamic coefficients for the plunge motion. The dynamic stability derivatives with respect to the pitch rate are deter-mined by the regression of the differential unsteady aerodynamic coefficients for the pitch motion upon the removal of the angle of attack contribution by the plunge motion. The steady-state stability derivatives are then compared to the results obtained from a stability analysis code VSPAERO as well as steady-state FUN3D simulations. The comparison of the steady-state stability derivatives shows excellent agreement.

Dynamic Stability Derivatives↗
NASA NTRS2012

Autonomous Information Unit for Fine-Grain Data Access Control and Information Protection in a Net-Centric System

As communication and networking technologies advance, networks will become highly complex and heterogeneous, interconnecting different network domains. There is a need to provide user authentication and data protection in order to further facilitate critical mission operations, especially in the tactical and mission-critical net-centric networking environment. The Autonomous Information Unit (AIU) technology was designed to provide the fine-grain data access and user control in a net-centric system-testing environment to meet these objectives. The AIU is a fundamental capability designed to enable fine-grain data access and user control in the cross-domain networking environments, where an AIU is composed of the mission data, metadata, and policy. An AIU provides a mechanism to establish trust among deployed AIUs based on recombining shared secrets, authentication and verify users with a username, X.509 certificate, enclave information, and classification level. AIU achieves data protection through (1) splitting data into multiple information pieces using the Shamir's secret sharing algorithm, (2) encrypting each individual information piece using military-grade AES-256 encryption, and (3) randomizing the position of the encrypted data based on the unbiased and memory efficient in-place Fisher-Yates shuffle method. Therefore, it becomes virtually impossible for attackers to compromise data since attackers need to obtain all distributed information as well as the encryption key and the random seeds to properly arrange the data. In addition, since policy can be associated with data in the AIU, different user access and data control strategies can be included. The AIU technology can greatly enhance information assurance and security management in the bandwidth-limited and ad hoc net-centric environments. In addition, AIU technology can be applicable to general complex network domains and applications where distributed user authentication and data protection are necessary. AIU achieves fine-grain data access and user control, reducing the security risk significantly, simplifying the complexity of various security operations, and providing the high information assurance across different network domains.

Chow, Edward T.↗
NASA NTRS1993

Domain decomposition methods for nonconforming finite element spaces of Lagrange-type

In this article, we consider the application of three popular domain decomposition methods to Lagrange-type nonconforming finite element discretizations of scalar, self-adjoint, second order elliptic equations. The additive Schwarz method of Dryja and Widlund, the vertex space method of Smith, and the balancing method of Mandel applied to nonconforming elements are shown to converge at a rate no worse than their applications to the standard conforming piecewise linear Galerkin discretization. Essentially, the theory for the nonconforming elements is inherited from the existing theory for the conforming elements with only modest modification by constructing an isomorphism between the nonconforming finite element space and a space of continuous piecewise linear functions.

Cowsar, Lawrence C.↗
DOE OSTI2023

Mechanical Actuation via Homeomorphic Transformations of Topological Solitons within Polymer Coatings

Abstract Topological solitons are currently under investigation for their exotic properties, especially in nonlinear physics, optics, and material sciences. However, challenges of robust generation and limited stability over time have hindered their practical uses. To address this issue, an approach is developed to form structured arrays of solitons in films of polymerizable liquid crystals. Their complex molecular architecture is preserved by in situ photopolymerization forming a stable liquid crystal network. Most excitingly, their properties are advanced to include responsiveness functions. When thermally actuated, these topological solitons mediate the reconfiguration of surface topographies. Complex shape changes occur depending on the intrinsic complex spatial distribution of the director, which may even lead to full shape inversion and topographical changes as high as ≈40% of the initial thickness. Conversely, the shape changes provide information on the initial director profile, which is consistent with the mathematical model. The soliton‐containing polymer coatings are applicable in multiple domains, ranging from tunable optics to haptics, and from shape‐coupled sensing systems to temperature‐coupled heat management.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Computer Vision Pipeline for Image Analysis for Freeze‐Fracture Electron Microscopy: Rosette Cellulose Synthase Complexes Case

In materials science, plant biology, agriculture, and environmental research, the automated analysis of high-magnification, complex microscopy images, such as those generated by freeze-fracture electron microscopy (FF-TEM), remains a critical challenge that limits the scalability of data interpretation. We present a deep learning computer vision pipeline for high-throughput detection and morphological characterization analysis of cellulose synthase complexes (CSCs, or rosettes) in FF-TEM images. The pipeline integrates preprocessing, detection, human-in-the-loop verification, and semantic segmentation to quantify features such as rosette diameter and inter-lobe spacing. The approach was trained and tested on a curated dataset of high-resolution FF-TEM micrographs of Physcomitrium patens, expanded via strategic tiling and augmentation to over 650 images. We compare YOLOv8 and YOLOv9 architectures and demonstrate that YOLOv9 achieves superior performance in both localization accuracy (mAP50-95 = 0.854) and inference speed. The resulting distributions revealed biological variability consistent with prior manual studies, validating the approach for high-throughput applications. Our results show that the pipeline achieves human-expert level accuracy while dramatically reducing analysis time, enabling scalable, reproducible structural characterization of intramembrane protein complexes. The pipeline is broadly applicable to other domains requiring precise interpretation of complex microscopy data and establishes a foundation for future artificial intelligence (AI)-assisted workflows in biological imaging.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

MimicGAN: Robust Projection onto Image Manifolds with Corruption Mimicking

In the past few years, Generative Adversarial Networks (GANs) have dramatically advanced our ability to represent and parameterize high-dimensional, non-linear image manifolds. As a result, they have been widely adopted across a variety of applications, ranging from challenging inverse problems like image completion, to problems such as anomaly detection and adversarial defense. A recurring theme in many of these applications is the notion of projecting an image observation onto the manifold that is inferred by the generator. In this context, Projected Gradient Descent (PGD) has been the most popular approach, which essentially optimizes for a latent vector that minimizes the discrepancy between a generated image and the given observation. However, PGD is a brittle optimization technique that fails to identify the right projection (or latent vector) when the observation is corrupted, or perturbed even by a small amount. Such corruptions are common in the real world, for example images in the wild come with unknown crops, rotations, missing pixels, or other kinds of non-linear distributional shifts which break current encoding methods, rendering downstream applications unusable. To address this, we propose corruption mimicking—a new robust projection technique, that utilizes a surrogate network to approximate the unknown corruption directly at test time, without the need for additional supervision or data augmentation. The proposed method is significantly more robust than PGD and other competing methods under a wide variety of corruptions, thereby enabling a more effective use of GANs in real-world applications. Finally, more importantly, we show that our approach produces state-of-the-art performance in several GAN-based applications—anomaly detection, domain adaptation, and adversarial defense, that benefit from an accurate projection.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

CFD modeling of turbulent air flow in self-heated gyroid TPMS structures: Thermal-hydraulic performance and validation

The application of mathematically derived geometries, such as triply periodic minimal surface (TPMS) lattices, has garnered significant interest across various fields, including the nuclear sector, due to their superior thermal-hydraulic characteristics for heat transfer compared to traditional plain or finned tubes. Here, this study validates a computational fluid dynamics (CFD) model, evaluates different turbulence models and CFD model settings, and performs uncertainty quantification to provide a comprehensive analysis. Despite extensive research on CFD modeling of TPMS lattices, such as gyroid and diamond geometries, there is a notable lack of publicly available literature providing comprehensive details on numerical analysis aspects, including convergence and methodological best practices. This study embarks on a benchmark analysis of a gyroid geometry to evaluate its thermal-hydraulic performance under turbulent flow conditions and scrutinize various CFD model configurations. The main contributions of this work include validating the CFD model, assessing and comparing different turbulence models, and enhancing pressure drop and temperature prediction capabilities. The results aim to support the development of methodologies needed to benchmark and enhance numerical analysis techniques for TPMS lattices. This work seeks to complement the existing body of knowledge, support the development of TPMS reactor concepts, and improve best practices for CFD modeling of TPMS lattices, ultimately advancing methodologies to support future applications in this domain.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Reinforcement learning building control approach harnessing imitation learning

Reinforcement learning (RL) has shown significant success in sequential decision making in fields like autonomous vehicles, robotics, marketing and gaming industries. This success has attracted the attention to the RL control approach for building energy systems which are becoming complicated due to the need to optimize for multiple, potentially conflicting, goals like occupant comfort, energy use and grid interactivity. However, for real world applications, RL has several drawbacks like requiring large training data and time, and unstable control behavior during the early exploration process making it infeasible for an application directly to building control tasks. To address these issues, an imitation learning approach is utilized herein where the RL agents starts with a policy transferred from accepted rule based policies and heuristic policies. This approach is successful in reducing the training time, preventing the unstable early exploration behavior and improving upon an accepted rule-based policy - all of these make RL a more practical control approach for real world applications in the domain of building controls.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Efficient distributed continual learning for steering experiments in real-time

Deep learning has emerged as a powerful method for extracting valuable information from large volumes of data. However, when new training data arrives continuously (i.e., is not fully available from the beginning), incremental training suffers from catastrophic forgetting (i.e., new patterns are reinforced at the expense of previously acquired knowledge). Training from scratch each time new training data becomes available would result in extremely long training times and massive data accumulation. Rehearsal-based continual learning has shown promise for addressing the catastrophic forgetting challenge, but research to date has not addressed performance and scalability. To fill this gap, we propose an approach based on a distributed rehearsal buffer that efficiently complements data-parallel training on multiple GPUs to achieve high accuracy, short runtime, and scalability. It leverages a set of buffers (local to each GPU) and uses several asynchronous techniques for updating these local buffers in an embarrassingly parallel fashion, all while handling the communication overheads necessary to augment input minibatches using unbiased, global sampling. We further propose a generalization of rehearsal buffers to support both classification and generative learning tasks, as well as more advanced rehearsal strategies (notably Dark Experience Replay, leveraging knowledge distillation). We illustrate this approach with a real-life HPC streaming application from the domain of ptychographic image reconstruction. Furthermore, we run extensive experiments on up to 128 GPUs of the ThetaGPU supercomputer to compare our approach with baselines representative of training-from-scratch (the upper bound in terms of accuracy) and incremental training (the lower bound). Results show that rehearsal-based continual learning achieves a top-5 validation accuracy close to the upper bound, while simultaneously exhibiting a runtime close to the lower bound.

Asynchronous data management↗
DOE OSTI2025

Dynamics of McMillan mappings I. McMillan multipoles

In this article, we consider two dynamical systems: the McMillan sextupole and octupole integrable mappings, originally proposed by Edwin McMillan. Both represent the simplest symmetric McMillan maps, characterized by a single intrinsic parameter. While these systems find numerous applications across various domains of mathematics and physics, some of their dynamical properties remain unexplored. We aim to bridge this gap by providing a comprehensive description of all stable trajectories, including the parametrization of invariant curves, Poincaré rotation numbers, and canonical action–angle variables. In the second part, we establish connections between these maps and general chaotic maps in standard form. Our investigation reveals that the McMillan sextupole and octupole serve as first-order approximations of the dynamics around the fixed point, akin to the linear map and quadratic invariant (known as the Courant–Snyder invariant in accelerator physics), which represents zeroth-order approximations (referred to as linearization). Furthermore, we propose a novel formalism for nonlinear Twiss parameters, which accounts for the dependence of rotation number on amplitude. This stands in contrast to conventional betatron phase advance used in accelerator physics, which remains independent of amplitude. Notably, in the context of accelerator physics, this new formalism demonstrates its capability in predicting dynamical aperture around low-order resonances for flat beams, a critical aspect in beam injection/extraction scenarios.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

PCAfold 2.0—Novel tools and algorithms for low-dimensional manifold assessment and optimization

We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Multiscale Deep Learning Model for Soil Moisture Integrating Satellite and In Situ Data

Deep learning (DL) models trained on hydrologic observations can perform extraordinarily well, but they can inherit deficiencies of the training data, such as limited coverage of in situ data or low resolution/accuracy of satellite data. In this work, we propose a novel multiscale DL scheme learning simultaneously from satellite and in situ data to predict 9 km daily soil moisture (5 cm depth). Based on spatial cross-validation over sites in the conterminous United States, the multiscale scheme obtained a median correlation of 0.901 and root-mean-square error of 0.034 m 3 /m 3 . It outperformed the Soil Moisture Active Passive satellite mission's 9 km product, DL models trained on in situ data alone, and land surface models. Our 9 km product showed better accuracy than previous 1 km satellite downscaling products, highlighting limited impacts of improving resolution. Not only is our product useful for planning against floods, droughts, and pests, our scheme is generically applicable to geoscientific domains with data on multiple scales, breaking the confines of individual data sets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Experimental discovery of structure–property relationships in ferroelectric materials via active learning

Emergent functionalities of structural and topological defects in ferroelectric materials underpin an extremely broad spectrum of applications ranging from domain wall electronics to high dielectric and electromechanical responses. Many of these functionalities have been discovered and quantified via local scanning probe microscopy methods. However, the search has until now been based on either trial and error, or using auxiliary information such as the topography or domain wall structure to identify potential objects of interest on the basis of the intuition of operator or pre-existing hypotheses, with subsequent manual exploration. Here we report the development and implementation of a machine learning framework that actively discovers relationships between local domain structure and polarization-switching characteristics in ferroelectric materials encoded in the hysteresis loop. The hysteresis loops and their scalar descriptors such as nucleation bias, coercive bias and the hysteresis loop area (or more complex functionals of hysteresis loop shape) and corresponding uncertainties are used to guide the discovery of these relationships via automated piezoresponse force microscopy and spectroscopy experiments. As such, this approach combines the power of machine learning methods to learn the correlative relationships between high-dimensional data, as well as human-based physics insights encoded into the acquisition function. For ferroelectric materials, this automated workflow demonstrates that the discovery path and sampling points of on- and off-field hysteresis loops are largely different, indicating that on- and off-field hysteresis loops are dominated by different mechanisms. Here, the proposed approach is universal and can be applied to a broad range of modern imaging and spectroscopy methods ranging from other scanning probe microscopy modalities to electron microscopy and chemical imaging.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Reconstructions from randomly generated longitudinal electron bunch profiles with Gaussian envelopes using the Gerchberg–Saxton algorithm

Knowledge of longitudinal electron bunch profiles is vital to optimize the performance of plasma wakefield accelerators and x-ray free electron laser linacs. Because of their importance to these novel applications, noninvasive frequency domain techniques are often employed to reconstruct longitudinal bunch profiles from coherent synchrotron, transition, or undulator radiation measurements. In this paper, we detail several common reconstruction techniques involving the Kramers–Kronig phase relationship and Gerchberg–Saxton algorithm. Additionally, through statistical analysis, we draw general conclusions about the accuracy of these reconstruction techniques and the most suitable candidate for reconstructing well-isolated longitudinal bunch profiles from spectroscopic data.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

CaloChallenge 2022: a community challenge for fast calorimeter simulation

Here, we present the results of the ‘Fast Calorimeter Simulation Challenge 2022’—the CaloChallenge. We study state-of-the-art generative models on four calorimeter shower datasets of increasing dimensionality, ranging from a few hundred voxels to a few tens of thousand voxels. The 31 individual submissions span a wide range of current popular generative architectures, including variational autoencoders (VAEs), generative adversarial networks (GANs), normalizing flows, diffusion models, and models based on conditional flow matching. We compare all submissions in terms of quality of generated calorimeter showers, as well as shower generation time and model size. To assess the quality we use a broad range of different metrics including differences in one-dimensional histograms of observables, KPD/FPD scores, AUCs of binary classifiers, and the log-posterior of a multiclass classifier. The results of the CaloChallenge provide the most complete and comprehensive survey of cutting-edge approaches to calorimeter fast simulation to date. In addition, our work provides a uniquely detailed perspective on the important problem of how to evaluate generative models. As such, the results presented here should be applicable for other domains that use generative AI and require fast and faithful generation of samples in a large phase space.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Time and Frequency Analysis of Load Profile Data

Technology advancements and integration of modern advanced metering systems can monitor, forecast, inform, control, and operate the building's mechanical, electrical, and plumbing (MEP) systems. They offer a higher level of information, which can contribute to making smart buildings more energy efficient and to making them closer to becoming grid-interactive energy efficient buildings (GEB). This paper builds on the ongoing research on variability analysis of a case study building with a 1-minute load profile and examines the Discrete Wavelet Transform (DWT) process in the frequency domain to quantify the signal's energy in each bandwidth, with respect to each end-use category. Moreover, the amount of variability in the total variability is not similar among the end-use categories. This information is needed to understand the behavior of the variability in the frequency domain for future applications, such as generating synthetic load profiles with a similar frequency spectrum as the measured signal.

decomposition↗
DOE OSTI2022

Interactively Assessing Disentanglement in GANs

Abstract Generative adversarial networks (GAN) have witnessed tremendous growth in recent years, demonstrating wide applicability in many domains. However, GANs remain notoriously difficult for people to interpret, particularly for modern GANs capable of generating photo‐realistic imagery. In this work we contribute a visual analytics approach for GAN interpretability, where we focus on the analysis and visualization of GAN disentanglement. Disentanglement is concerned with the ability to control content produced by a GAN along a small number of distinct, yet semantic, factors of variation. The goal of our approach is to shed insight on GAN disentanglement, above and beyond coarse summaries, instead permitting a deeper analysis of the data distribution modeled by a GAN. Our visualization allows one to assess a single factor of variation in terms of groupings and trends in the data distribution, where our analysis seeks to relate the learned representation space of GANs with attribute‐based semantic scoring of images produced by GANs. Through use‐cases, we show that our visualization is effective in assessing disentanglement, allowing one to quickly recognize a factor of variation and its overall quality. In addition, we show how our approach can highlight potential dataset biases learned by GANs.

Jeong, Sangwon↗