Search NASA⌕ Search

SEARCH · Search NASA

Results for “ADAPTATION”

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 145 records · Page 8

Enabling Scale-Up Through Multi-Fidelity Adaptive Computing

We present ideas from our ongoing work in adaptive computing - an optimization framework that allows us to strategically deploy various fidelity level experiments and simulations to guide decision making. The framework aims to enable uncertainty quantified scale-up of simulations and experiments, which causes increased complexity. A key feature of the framework is the integration of user-specified local model trustworthiness estimates. Adaptive sampling strategies allow us to optimally exploit the multiple fidelity level information and trustworthiness measures to arrive at the best decisions within a highly limited budget of objective function evaluations.

adaptive sampling↗

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗

Boosting efficiency and reducing graph reliance: Basis adaptation integration in Bayesian multi-fidelity networks

The computational cost of high-fidelity numerical models makes outer-loop analysis, which requires repeated interrogation of the model such as uncertainty quantification, computationally demanding. Multi-fidelity methods, which construct a surrogate model using data from an ensemble of models of varying cost and accuracy, can substantially reduce the cost of outer-loop analysis. However, these methods can be difficult to apply when the model ensemble does not admit a clear hierarchy a priori and the correlations between models are low. Consequently, in this paper, we present a multi-fidelity method that leverages dimension reduction to enhance the correlation between models, thereby reducing the amount of data needed to train a surrogate from an unordered ensemble of models. Our method utilizes basis adaptation to build low-dimensional polynomial chaos expansions of each model and employs Multi-fidelity Networks to encode the relationships among models. We show that the resulting method exhibit two notable advantages over its counterpart: (1) enhanced accuracy (both reduced bias and variance); and (2) reduced dependency on the graph structure encoding relationships among models. We demonstrate the approach on an analytical test problem and a challenging finite element model for a spent nuclear fuel. Our method produces a surrogate model that is significantly more accurate than either a single-fidelity surrogate or a multi-fidelity surrogate constructed without basis adaptation.

42 ENGINEERING↗

Adaptive Interface-PINNs (AdaI-PINNs) for transient diffusion: Applications to forward and inverse problems in heterogeneous media

We model transient diffusion in heterogeneous materials using a novel physics-informed neural networks framework (PINNs) termed Adaptive interface physics-informed neural networks or AdaI-PINNs (Roy et al. arXiv preprint arXiv:2406.04626, 2024). AdaI-PINNs utilize different activation functions with trainable slopes tailored to each material region within the computational domain, allowing for a fully automated and adaptive PINNs approach to model interface problems with strongly and weakly discontinuous solutions. To enhance its performance in highly heterogeneous transient diffusion systems, we prescribe a suite of robust practices, including appropriate non-dimensionalization of equations, a biased sampling method, Glorot initialization, and the hard enforcement of boundary and initial conditions. Here we evaluate the efficacy of the proposed method on several benchmark forward and inverse problems. Comparative studies on one-dimensional and two-dimensional benchmark problems reveal that the modified AdaI-PINNs outperform its unmodified counterpart, achieving root-mean-square errors that are at least two orders of magnitude better in forward problems. For inverse problems, the maximum errors in the approximated diffusion coefficients by modified AdaI-PINNs are four orders of magnitude better than those of the unmodified version. Additionally, modified AdaI-PINNs demonstrate improved stability in problems with large material mismatches.

42 ENGINEERING↗

Adaptive Interface-PINNs (AdaI-PINNs) for inverse problems: Determining material properties for heterogeneous systems

Here, we determine spatially varying discontinuous material properties using a domain-decomposition based physics-informed neural networks (PINNs) framework named the Adaptive Interface-PINNs or AdaI-PINNs (Roy et al., 2024). We propose the use of distinct neural networks for the field variables and material properties within each material, utilizing adaptive activation functions. While the neural networks across different materials share the same weights and biases, their activation functions are uniquely tailored using a hyperparameter that influences the slope of the activation function. The proposed framework is tested on several one-dimensional and two-dimensional benchmark examples, and its performance is compared with conventional PINNs and existing domain-decomposition PINNs frameworks, namely, the Multi-domain physics-informed neural network (M-PINN), and the eXtended physics-informed neural networks (XPINNs). The results demonstrate that the proposed approach can determine randomly distributed discontinuous material properties with an L 2 error of $\mathscr{O}$ (10 -3 ) for the material property and the root-mean-square error of $\mathscr{O}$ (10 -3 ) for the primary variable while the other approaches yield errors that are approximately two orders of magnitude larger (that is, $\mathscr{O}$ (10 -1 )). Moreover, the spatial distribution of material properties obtained using the proposed framework is in close agreement with the true distribution, whereas the other approaches fare much worse. Additionally, the proposed approach is approximately 40% faster than its competitors, indicating its potential as a robust alternative for solving inverse problems in heterogeneous materials.

36 MATERIALS SCIENCE↗

Trajectory Shaper: A Solution for Disrupted Cooperative Adaptive Cruise Control

Cooperative adaptive cruise control (CACC) can effectively reduce energy consumption, alleviate traffic congestion, and enhance safety. However, communication-related constraints and uncooperative vehicle users can disrupt CACC during real-world operations, significantly undermining the putative benefits of CACC. To alleviate the negative impacts of disrupted CACC, this study develops the trajectory shaper (TS) methods as backup solutions for two scenarios: (i) communication between vehicles is infeasible, and vehicles execute adaptive cruise control (ACC) using local sensor measurements; (ii) follower vehicles reject forming a cooperative platoon and execute their local distributed controllers using the information attained via communication. When communication is infeasible, a distributed TS is devised on each vehicle to modify the sensor measurements, enabling safe and efficient ACC operations. When communication is available but uncooperative agents are involved, the lead vehicle of the platoon executes a centralized TS to modify the information shared with uncooperative agents, achieving optimal platoon-level performance. The centralized and distributed TSs are implemented based on the model predictive control algorithms to yield optimal modifications on input information. Robustness is also factored to tackle model uncertainties during TS operations to ensure safety and efficiency. Numerical experiments validate the control performance of the proposed TSs.

Zhou, Anye [ORNL] (ORCID:0000000301455579)↗

Adaptive Algebraic Derivative Estimation for Battery Electric Buses Energy Consumption Forecasting

The limited service life of onboard batteries for EVs is a challenge, underscoring the need for real-time battery usage prediction. This paper proposes an adaptive Algebraic Derivative Estimation (ADE) approach for forecasting the energy consumption of battery electric buses. By dynamically adjusting the sliding window length, the adaptive ADE retains the fixed-length ADE’s key advantage—namely, operating online without reliance on extensive historical datasets—while substantially bolstering forecast accuracy by actively trading estimation bias off estimation variance. Comparative experiments against both the conventional ADE with a fixed length and a representative machine learning algorithm, XGBoost, were conducted, with performance evaluated via root mean square error, mean absolute error, and the coefficient of determination. The results demonstrate that the proposed approach significantly outperforms baseline methods.

Cui, Tianyang [The University of Texas at Dallas]↗

Unsupervised domain adaptation for radioisotope identification in gamma spectroscopy

Training machine learning models for radioisotope identification using gamma spectroscopy remains an elusive challenge for many practical applications, largely stemming from the difficulty of acquiring and labeling large, diverse experimental datasets. Simulations can mitigate this challenge, but the accuracy of models trained on simulated data can deteriorate substantially when deployed to an out-of-distribution operational environment. In this study, we demonstrate that unsupervised domain adaptation (UDA) can improve the ability of a model trained on synthetic data to generalize to a new testing domain, provided unlabeled data from the target domain are available. Conventional supervised techniques are unable to utilize this data because the absence of isotope labels precludes defining a supervised classification loss. Instead, we first pretrain a spectral classifier using labeled synthetic data and subsequently leverage unlabeled target data to align the learned feature representations between the source and target domains. We compare a range of different UDA techniques, finding that minimizing the maximum mean discrepancy (MMD) between source and target feature vectors yields the most consistent improvement to testing scores. For instance, using a custom transformer-based neural network, we achieved a testing accuracy of $0.904 \pm 0.022$ on an experimental LaBr test set after performing unsupervised feature alignment via MMD minimization, compared to $0.754 \pm 0.014$ before alignment. Overall, our results highlight the potential of using UDA to adapt a radioisotope classifier trained on synthetic data for real-world deployment.

Lalor, Peter W.↗

A bioinspired approach for adaptive solid-solid phase change material coatings with optimized surface features for passive thermal regulation

The necessity to reduce global energy consumption calls for innovative strategies in building thermal management. Passive thermal regulation, particularly through bio-inspired designs, offers a promising avenue by mimicking nature's efficient control of optical properties. This research introduces a novel, climate-responsive coating that integrates optimized bio-inspired surface features with a solid-solid phase change material (SS-PCM) to dynamically manage solar absorptivity without adding additional thickness, enabling both heating and cooling as needed. Drawing on the photonic architectures of the Saharan silver ant and Morpho Didius butterfly, we employed a modeling and multi-objective optimization framework to tailor these surface features. Simulations reveal that surface texture, rather than the intrinsic phase transition of the SS PCM, dominates optical control. Relative to a flat SS PCM coating, optimized isotropic random roughness and broader range features yielded the highest passive heating power increase of about 144 % and 319 % respectively suitable for cold climates. Saharan ant-inspired features enhanced passive cooling for hot climates, achieving a 21.8 % improvement. For moderate climates, Butterfly-wing-inspired surface features provided a balanced enhancement of 19 % for heating and 7 % for cooling. Across all cases, the optimized surface features reduced combined heating and cooling energy demand more effectively than the baseline coating, while preserving material thickness. These findings demonstrate that climate-adaptive, optimized bio-inspired surface features can unlock the full potential of SS PCM coatings, providing a versatile pathway to significant energy savings in buildings and other applications. The methodology establishes a framework for designing next-generation adaptive envelopes that leverage natural photonic principles for high-impact, low-cost thermal regulation.

36 MATERIALS SCIENCE↗

Covariance operator estimation via adaptive thresholding

This paper studies sparse covariance operator estimation for nonstationary processes with sharply varying marginal variance and small correlation lengthscale. We introduce a covariance operator estimator that adaptively thresholds the sample covariance function using an estimate of the variance component. Building on recent results from empirical process theory, we derive an operator norm bound on the estimation error in terms of the sparsity level of the covariance and the expected supremum of a normalized process. Furthermore, our theory and numerical simulations demonstrate the advantage of adaptive threshold estimators over universal threshold and sample covariance estimators in nonstationary settings.

Al-Ghattas, Omar [University of Chicago, IL (Unite↗

Rapid Adaptation of Chemical Named Entity Recognition Using Few-Shot Learning and LLM Distillation

Named entity recognition (NER) has been widely used in chemical text mining for the automatic identification and extraction of chemical entities. However, existing chemical NER systems primarily focus on scenarios with abundant training data, requiring significant human effort on annotations. This poses challenges for applications in the chemical field, such as catalysis, where many advancements have traditionally relied on trial-and-error investigations and incremental adjustment of variables. This hinders catalysis science and technology progress in addressing emerging energy and environmental crises. In this work, we propose a few-shot NER model that can quickly adapt to extract new types of chemical entities by using only a limited number of annotated examples. Our model employs a metric-learning approach to transfer entity similarity knowledge from high-resource chemical domains (with abundant annotations) to enable effective entity recognition in low-resource specialized domains (limited annotation). We validate the effectiveness of our model on a few-shot chemical NER benchmark built based on six existing chemical NER data sets. Experiments show that the proposed few-shot NER model can achieve reasonable performance with only 5 examples per entity type and shows consistent improvement as the number of examples increases. Furthermore, we demonstrate how the proposed model can be trained with large language model (LLM) annotated data, opening a new pathway for rapid adaptation of NER systems. Furthermore, our approach leverages the knowledge broadness of large language models for chemistry while distilling this knowledge into a lightweight model suitable for efficient and in-house use.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive Variational Quantum Computing Approaches for Green’s Functions and Nonlinear Susceptibilities

Here, we present and benchmark quantum computing approaches for calculating real-time single-particle Green’s functions and nonlinear susceptibilities of Hamiltonian systems. The approaches leverage adaptive variational quantum algorithms for state preparation and propagation. Using automatically generated compact circuits, the dynamical evolution is performed over sufficiently long times to achieve adequate frequency resolution of the response functions. We showcase accurate Green’s function calculations using a statevector simulator on classical hardware for Fermi-Hubbard chains of 4 and 6 sites, with maximal ansatz circuit depths of 65 and 424 layers, respectively, and for the molecule LiH with a maximal ansatz circuit depth of 81 layers. Additionally, we consider an antiferromagnetic quantum spin-1 model that incorporates the Dzyaloshinskii-Moriya interaction to illustrate calculations of the third-order nonlinear susceptibilities, which can be measured in two-dimensional coherent spectroscopy experiments. These results demonstrate that real-time approaches using adaptive parametrized circuits to evaluate linear and nonlinear response functions can be feasible with near-term quantum processors.

97 MATHEMATICS AND COMPUTING↗

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

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

36 MATERIALS SCIENCE↗

Adaptive optical correction for in vivo two-photon fluorescence microscopy with neural fields

Adaptive optics restore ideal imaging performance in complex samples by measuring and correcting optical aberrations but often require custom-built microscopes with carefully aligned wavefront sensing/shaping devices and can be susceptible to sample motion. Here we describe NeAT, a computational framework using neural fields for adaptive optics two-photon fluorescence microscopy. NeAT estimates wavefront aberration and recovers sample structure from a 3D image stack without requiring external datasets for training. Incorporating motion correction in learning and correcting conjugation errors commonly found in commercial microscopes, NeAT is designed for deployment in biological laboratories for in vivo imaging. We validate NeAT’s performance using a custom-built microscope with a wavefront sensor under varying signal-to-noise ratios, aberration and motion conditions. With a commercial microscope, we demonstrate real-time aberration correction for in vivo morphological and functional imaging in the living mouse brain, with NeAT improving the signal and accuracy of glutamate and calcium imaging of synapses and neurons.

Kang, Iksung↗

Reinforcement Learning‐Based Adaptation of Grid Following Inverter's Internal Controller to Networked Microgrids' Strengths

The varying topological configurations, generator commitments and dispatches, and dynamic load demand lead to changing system's strengths during the operations of networked microgrids. When the system's strengths significantly change, the fixed control gains at large devices may result in unsatisfactory system performance; this necessitates the tuning of the control gains at large devices to adapt to the changing system's strengths. In this paper, observer-based reinforcement learning (RL) is utilised to automatically tune the proportional-integral (PI) gains of phase lock loop (PLL) controller of grid-following (GFL) inverters to adapt to the changing strengths of microgrids and networked microgrids. The RL agent in this framework augments an observer predicting system's strengths, from which the RL control policy will adjust accordingly to tune the PLL controller's gains towards the system's strengths. Also, to enhance the control performance, the recently introduced Barrier function-based RL framework is leveraged for the design of reward function to prevent the high frequency nadir. An operational 26 kV electric distribution system, which is modelled as networked microgrids, is used to illustrate the need and effectiveness of the proposed RL-tuned control.

frequency response↗

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗

RANGE: A robust adaptive nature-inspired global explorer of potential energy surfaces

With the growing demand for realistic representations of chemical structures and the advent of exascale computing, the intelligent sampling of potential energy surfaces and efficient identification of global minima have become more essential but also more feasible. Building on prior studies demonstrating the efficiency of the Artificial Bee Colony (ABC) swarm intelligence algorithm, we report a hybrid metaheuristic framework that integrates the adaptive exploration capabilities of ABC coupled with the exploitation strengths of genetic algorithms (GA) in a scalable, Python-based implementation. The resulting tool, RANGE (Robust Adaptive Nature-inspired Global Explorer), provides seamless interfaces to multiple potential energy evaluators, either directly or via widely used Python libraries, and is designed for high-performance computing environments. We describe the implementation details of RANGE and evaluate its performance, relative to ABC- or GA-alone based algorithms, on a variety of chemical systems, including molecular clusters and heterogeneous surfaces. In conclusion, our results demonstrate RANGE’s efficiency, robustness, and broad applicability in addressing challenging global optimization problems in computational chemistry and materials science.

Algorithms and data structure↗

Adapting Nuclear Forensics from Light Water to Molten Salt Reactors: A Survey of Emerging Needs

Rising interest in molten salt reactors for commercial power production presents an opportunity to evaluate the techniques used to characterize materials of nuclear forensic interest. Since extensive research has been performed to identify and develop signatures of light water reactor (LWR) materials (e.g. uranium ore concentrates and uranium dioxide fuel pellets), we use this as a basis to explore possibilities for molten salt signature development. Through this comparative method, nuclear forensic signatures used today to identify the provenance of nuclear materials found out of regulatory control are adapted to molten salt reactor (MSR) fuel cycle materials. Radiological, elemental composition, isotopic composition, and model age signatures will likely not need large adaptations before being applied to MSR materials but may need to expand to be applicable to both thorium- and uranium-fueled systems. The liquid nature of molten salt fuel may erase signatures related to production and irradiation history that are informative for typical LWR materials. However, it may also lead to opportunities for new signatures, such as cooling rate–controlled morphology. Targets identified for further research include radiological attributes of fuel salts; elemental, chemical, and isotopic analysis of salts with differing production routes; morphological effects of various thermodynamic environments; and relevant fuel cycle radiochronometers. Additionally, the comparative nature of the proposed signatures implies a need for MSR-relevant databases and the production of salt standard reference materials.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗