Search NASA⌕ Search

SEARCH · Search NASA

Results for “local 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 163 records · Page 9

Sub-pixel high-resolution imaging of high-energy x-rays inspired by sub-wavelength optical imaging

We have developed and demonstrated an image super-resolution method—XR-UNLOC: X-Ray UNsupervised particle LOCalization—for hard x-rays measured with fast-frame-rate detectors that is an adaptation of the principle of photo-activated localization microscopy (PALM) and stochastic optical reconstruction microscopy (STORM), which enabled biological fluorescence imaging at sub-optical-wavelength scales. We demonstrate the approach on experimental coherent Bragg diffraction data measured with 52 keV x-rays from a nanocrystalline sample. From this sample, we resolve the fine fringe detail of a high-energy x-ray Bragg coherent diffraction pattern to an upsampling factor of 16 of the native pixel pitch of 30 μ m of a charge-integrating fastCCD detector. This was accomplished by analysis of individual photon locations in a series of “nearly-dark” instances of the diffraction pattern that each contain only a handful of photons. Central to our approach was the adaptation of the UNLOC photon fitting routine for PALM/STORM to the hard x-ray regime to handle much smaller point spread functions, which required a different statistical test for photon detection and for sub-pixel localization. A comparison to a photon-localization strategy used in the x-ray community (“droplet analysis”) showed that XR-UNLOC provides significant improvement in super-resolution. We also developed a metric by which to estimate the limit of reliable upsampling with XR-UNLOC under a given set of experimental conditions in terms of the signal-to-noise ratio of a photon detection event and the size of the point spread function for guiding future x-ray experiments in many disciplines where detector pixelation limits must be overcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration

The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.

complexity theory↗

Adaptive Time Step Control for Multirate Infinitesimal Methods

Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.

97 MATHEMATICS AND COMPUTING↗

Conformal Hierarchical Simulation-Based Inference with Local Validity

Trustworthy and interpretable uncertainty quantification is a long-standing challenge in artificial intelligence. Simulation-based inference (SBI) comprises a broad swath of approaches for estimating latent parameters with uncertainties. Although flexible neural density estimators in SBI can be remark- ably expressive capturing highly structured, high-dimensional posteriors their credible regions can be badly mis-calibrated and are often only accompanied by heuristic coverage checks. We present the first SBI framework that delivers finite-sample local valid coverage guarantees that hold in the neighborhood of each observation. Our framework can couple any off-the-shelf hierarchical SBI engine with a confor- mal Bayesian post-processing step that operates on the posterior predictive density. A kernel-weighted conformity score adapts the conformal quantile to the local geometry of the data, yielding prediction sets that are simultaneously (i) marginally calibrated, (ii) locally valid, and (iii) hierarchical, handling global and observation-specific parameters in a single pass. Through experiments on synthetic data and benchmarks from neuroscience and physics, we show that our approach attains 1 − α coverage, where prior SBI methods under- or over-cover. Our approach also maintains a competitive, credible set size with minimal computational overhead. Finally, our approach can be used to make predictions on real data and give valid credible regions modulo weight-initialization-based model mis-specification.

Trivedi, Shubhendu [Fermilab]↗

Random adaptive tool path for zonal optics fabrication

Deterministic optics fabrication using sub-aperture tools has been vital for manufacturing precision optical surfaces. The fabrication process requires the tool influence function and the tool path to calculate the dwell time that guides the tool to bring surface quality within tight design tolerances. Widely used spiral and raster paths may leave excess waviness from the tool path, and the unavoidable constant removal layer is added to obtain positive dwell time. This waviness can be removed by either using smaller tools sequentially or randomizing the tool path. However, the existing tool-path solutions can hardly adapt to different surface aperture shapes and localized surface errors. Process efficiency and accuracy are also not well considered in tool-path planning. We propose an innovative zonal Random Adaptive Path (RAP) to solve these problems in this study. Firstly, RAP can be flexibly adapted to different surface aperture shapes by introducing part boundary. Secondly, an average threshold strategy is used in the RAP planning to improve efficiency, enabling the surface errors to be selectively corrected. Finally, the threshold is performed in several passes within one processing cycle, each with its RAP, until the desired residual is achieved. The performance of the proposed RAP is studied by comparing it with the conventional tool paths. The results demonstrated that RAP takes the least processing time and achieves the best surface quality, which verifies the effectiveness of RAP in deterministic optics fabrication.

36 MATERIALS SCIENCE↗

ASDFL: An adaptive super‐pixel discriminative feature‐selective learning for vehicle matching

Abstract There are a large number of cameras in modern transportation system that capture numerous vehicle images continuously. Therefore, automatic analysis of these vehicle images is helpful for traffic flow management, criminal investigations and vehicle inspections. Vehicle matching, which aims to determine whether two input images depict an identical vehicle, is one of the core tasks in vehicle analysis. Recent relevant studies have focused on local feature extraction instead of global extraction, since local details can provide crucial cues to distinguish between cars. However, these methods do not select local features; that is, they do not assign weights to local features. Therefore, in this research, we systematically study the vehicle matching task, and present a novel annotation‐free local‐based deep learning method called Adaptive super‐pixel discriminative feature‐selective learning (ASDFL) to address this issue. In ASDFL, vehicle images are segmented into clusters of super‐pixels of similar size by considering the location and colour similarities of pixels without using any component‐level annotation. These super‐pixels are deemed to be the virtual components of vehicles. Moreover, a convolutional neural network is used to extract the deep features of these virtual components. Thereafter, an instance‐specific mask generation module driven by the extracted global features is enhanced to produce a mask to select the most distinctive virtual components of each vehicle image pair in the feature space. Finally, the vehicle matching task is accomplished by classifying the selected virtual component features of each imaged vehicle pair. Extensive experiments on two popular vehicle identification benchmarks demonstrate that our method is 1.57% and 0.8% more accurate than the previous baselines in a vehicle matching task on the VeRi and VehicleID datasets, respectively, which demonstrates the effectiveness of our method.

Qin, Rong↗

Adaptive Quantum Generative Training using an Unbounded Loss Function

We propose a generative quantum learning algorithm using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum Rényi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art adaptive algorithms by learning random two-local thermal states. We perform numerical experiments of up to 12 qubits comparing our method learning algorithms that use linear objective functions and show that Rényi-ADAPT is capable of constructing shallow quantum circuits competitive with existing methods, while the gradients remain favorable resulting from the maximal Rényi divergence loss function.

quantum algorithms, quantum machine learning, quan↗

"Traffic Control via Connected and Automated Vehicles: An Open-Road Field Experiment with 100 CAVs"

The CIRCLES project aims to reduce instabilities in traffic flow, which are naturally occurring phenomena due to human driving behavior. These "phantom jams" or "stop-and-go waves,"are a significant source of wasted energy. Toward this goal, the CIRCLES project designed a control system referred to as the MegaController by the CIRCLES team, that could be deployed in real traffic. Our field experiment leveraged a heterogeneous fleet of 100 longitudinally-controlled vehicles as Lagrangian traffic actuators, each of which ran a controller with the architecture described in this paper. The MegaController is a hierarchical control architecture, which consists of two main layers. The upper layer is called Speed Planner, and is a centralized optimal control algorithm. It assigns speed targets to the vehicles, conveyed through the LTE cellular network. The lower layer is a control layer, running on each vehicle. It performs local actuation by overriding the stock adaptive cruise controller, using the stock on-board sensors. The Speed Planner ingests live data feeds provided by third parties, as well as data from our own control vehicles, and uses both to perform the speed assignment. The architecture of the speed planner allows for modular use of standard control techniques, such as optimal control, model predictive control, kernel methods and others, including Deep RL, model predictive control and explicit controllers. Depending on the vehicle architecture, all onboard sensing data can be accessed by the local controllers, or only some. Control inputs vary across different automakers, with inputs ranging from torque or acceleration requests for some cars, and electronic selection of ACC set points in others. The proposed architecture allows for the combination of all possible settings proposed above. Most configurations were tested throughout the ramp up to the MegaVandertest.

Lee, Jonathan↗

Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits

Hadron wave packets are prepared and time evolved in the Schwinger model using 112 qubits of IBM’s 133-qubit Heron quantum computer ibm_torino. The initialization of the hadron wave packet is performed in two steps. First, the vacuum is prepared across the whole lattice using the recently developed SC-ADAPT-VQE algorithm and workflow. SC-ADAPT-VQE is then extended to the preparation of localized states, and used to establish a hadron wave packet on top of the vacuum. This is done by adaptively constructing low-depth circuits that maximize the overlap with an adiabatically prepared hadron wave packet. Due to the localized nature of the wavepacket, these circuits can be determined on a sequence of small lattices using classical computers, and then robustly scaled to prepare wave packets on large lattices for simulations using quantum computers. Time evolution is implemented with a second-order Trotterization. To reduce both the required qubit connectivity and circuit depth, an approximate quasilocal interaction is introduced. This approximation is made possible by the emergence of confinement at long distances, and converges exponentially with increasing distance of the interactions. Using multiple error-mitigation strategies, up to 14 Trotter steps of time evolution are performed, employing 13,858 two-qubit gates (with a CNOT depth of 370). The propagation of hadrons is clearly identified, with results that compare favorably with Matrix Product State simulations. Finally, prospects for a near-term quantum advantage in simulations of hadron scattering are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adaptive immersed isogeometric level-set topology optimization

Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.

36 MATERIALS SCIENCE↗

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗

CFD simulations of electric motor end ring cooling for improved thermal management

Proper thermal management of an electric motor for vehicle applications extends its operating range. One cooling approach is to impinge Automatic Transmission Fluid (ATF) onto the rotor end ring. Increased ATF coverage correlates to enhanced heat transfer. Computational Fluid Dynamics (CFD) analytical tools provide a mechanism to assess motor thermal management prior to hardware fabrication. The complexity of the fluid flow (e.g., jet atomization, interface tracking, wall impingement) and heat transfer makes these simulations challenging. Computational costs are high when solving these flows on high-speed rotating meshes. Typically, a Volume-of Fluid (VOF) technique (i.e., two-fluid system) is used to resolve ATF dynamics within this rotating framework. Suitable numerical resolution of the relevant physics for thin films under strong inertial forces at high rotor speeds is computationally expensive, further increasing the run times. In this work, a numerical study of rotor-ring cooling by ATF is presented using a patent automated Cartesian cut-cell based method coupled with Automatic Mesh Refinement (AMR). This approach automatically creates the Cartesian mesh on-the-fly and can effectively handle complex rotating geometries by adaptively refining the mesh based on local gradients in the flow field which results in better resolution of the air-ATF interface. A Single non-inertial Reference Frame (SRF) approach is used to account for the rotating geometry and to further improve the overall computational efficiency. Quasi-steady state conditions are targeted in the analysis of the results. Important physics such as ATF jet structure, velocity detail near the air-jet interface, ATF coverage/accumulation on the ring surface, and cooling capacity are presented for a low-resolution Reynolds averaged Navier-Stokes (RANS), high-resolution RANS, and high-resolution Large-Eddy Simulation (LES) models. Computations are scaled over hundreds of cores on a supercomputer to maximize turnaround time. Each numerical approach is shown to capture the general trajectory of the oil jet prior to surface impingement. The high-resolution LES simulation, however, is superior in capturing small scale details and heat transfer between the free jet and surrounding air.

42 ENGINEERING↗

Predicting climate change impacts on poikilotherms using physiologically guided species abundance models

Poikilothermic animals comprise most species on Earth and are especially sensitive to changes in environmental temperatures. Species conservation in a changing climate relies upon predictions of species responses to future conditions, yet predicting species responses to climate change when temperatures exceed the bounds of observed data is fraught with challenges. We present a physiologically guided abundance (PGA) model that combines observations of species abundance and environmental conditions with laboratory-derived data on the physiological response of poikilotherms to temperature to predict species geographical distributions and abundance in response to climate change. The model incorporates uncertainty in laboratory-derived thermal response curves and provides estimates of thermal habitat suitability and extinction probability based on site-specific conditions. We show that temperature-driven changes in distributions, local extinction, and abundance of cold, cool, and warm-adapted species vary substantially when physiological information is incorporated. Notably, cold-adapted species were predicted by the PGA model to be extirpated in 61% of locations that they currently inhabit, while extirpation was never predicted by a correlative niche model. Failure to account for species-specific physiological constraints could lead to unrealistic predictions under a warming climate, including underestimates of local extirpation for cold-adapted species near the edges of their climate niche space and overoptimistic predictions of warm-adapted species.

54 ENVIRONMENTAL SCIENCES↗

MPC-Based Local Voltage Control Strategy of DGs in Active Distribution Networks

The increasing penetration of distributed generators (DGs) exacerbates the voltage violations in active distribution networks (ADNs). The commonly used centralized voltage control may aggravate the burden of computation and communication. Local voltage control can realize fast response to frequent voltage fluctuations. However, effective local control for DGs still needs to be further investigated. In this paper, a model predictive control (MPC)-based local voltage control strategy of DGs is proposed to cope with voltage violation problems and enhance the adaptation to the DG volatility. DGs are regulated with local Q-V control curves to respond to voltage fluctuations rapidly. Based on the dynamic network partition, a unified control curve for DGs is set in the same area to realize efficient operation. To further improve the performance of voltage control, the parameter tuning of control curves is regularly conducted based on decentralized inter-area coordination with the rolling of the control horizon. Finally, case study is verified on the modified IEEE 33-node distribution system. The proposed local control strategy of DGs can effectively improve the voltage profile and reduce power losses of the whole network without high computation and communication burden.

active distribution network (ADN)↗

Symmetry-mode analysis for local structure investigations using pair distribution function data

Symmetry-adapted distortion modes provide a natural way of describing distorted structures derived from higher-symmetry parent phases. Structural refinements using symmetry-mode amplitudes as fit variables have been used for at least ten years in Rietveld refinements of the average crystal structure from diffraction data; more recently, this approach has also been used for investigations of the local structure using real-space pair distribution function (PDF) data. Here, the value of performing symmetry-mode fits to PDF data is further demonstrated through the successful application of this method to two topical materials: TiSe2, where a subtle but long-range structural distortion driven by the formation of a charge-density wave is detected, and MnTe, where a large but highly localized structural distortion is characterized in terms of symmetry-lowering displacements of the Te atoms. Here, the analysis is performed using fully open-source code within the DiffPy framework via two packages developed for this work: isopydistort, which provides a scriptable interface to the ISODISTORT web application for group theoretical calculations, and isopytools, which converts the ISODISTORT output into a DiffPy-compatible format for subsequent fitting and analysis. These developments expand the potential impact of symmetry-adapted PDF analysis by enabling high-throughput analysis and removing the need for any commercial software.

36 MATERIALS SCIENCE↗

Protonation Dynamics of Confined Ethanol–Water Mixtures in H-ZSM-5 from Machine Learning-Driven Metadynamics

Zeolites are indispensable heterogeneous catalysts in industrial chemical processes, valued for their strong Brønsted acidity, well-defined microporous frameworks, and tunable pore structures. Their catalytic activity arises primarily from Brønsted acid sites (BAS), typically present as bridging hydroxyl groups (Si–OH–Al). Under aqueous reaction conditions, these protons interact dynamically with water and alcohol molecules, leading to complex solvation and protonation behavior within confined pores. In this study, we investigate the protonation equilibrium occurring between ethanol and water at the BAS of acidic zeolites under varying hydration levels, i.e., C2H5OH–(H2O)n, n=1–4. Local structure was analyzed through an adaptive-learning global optimization algorithm, while enhanced sampling molecular dynamics simulations with Well-Tempered Metadynamics (WMetaD) and machine learning interatomic potentials (MLPs) provide free-energy surfaces (FES) at variable hydration levels. The results reveal a strong dependence of proton localization on the degree of hydration. At low hydration (1 water molecule), the proton resides predominantly on ethanol; with 2 water molecules, it shifts toward water, and at higher hydration (3 or more water molecules), it becomes extensively delocalized over the water cluster. These findings underscore the critical role of solvation in modulating acid site behavior and suggest that a minimum of three water molecules is necessary to fully stabilize the proton on water within the zeolite framework. This solvation threshold has significant implications for catalytic processes, particularly in biomass conversion reactions where alcohol protonation is a key step in dehydration mechanisms.

machine learning↗

Towards a unified nonlocal, peridynamics framework for the coarse-graining of molecular dynamics data with fractures

Molecular dynamics (MD) has served as a powerful tool for designing materials with reduced reliance on laboratory testing. However, the use of MD directly to treat the deformation and failure of materials at the mesoscale is still largely beyond reach. In this work, we propose a learning framework to extract a peridynamics model as a mesoscale continuum surrogate from MD simulated material fracture data sets. Firstly, we develop a novel coarse-graining method, to automatically handle the material fracture and its corresponding discontinuities in the MD displacement data sets. Inspired by the weighted essentially non-oscillatory (WENO) scheme, the key idea lies at an adaptive procedure to automatically choose the locally smoothest stencil, then reconstruct the coarse-grained material displacement field as the piecewise smooth solutions containing discontinuities. Then, based on the coarse-grained MD data, a two-phase optimization-based learning approach is proposed to infer the optimal peridynamics model with damage criterion. In the first phase, we identify the optimal nonlocal kernel function from the data sets without material damage to capture the material stiffness properties. Then, in the second phase, the material damage criterion is learnt as a smoothed step function from the data with fractures. As a result, a peridynamics surrogate is obtained. As a continuum model, our peridynamics surrogate model can be employed in further prediction tasks with different grid resolutions from training, and hence allows for substantial reductions in computational cost compared with MD. We illustrate the efficacy of the proposed approach with several numerical tests for the dynamic crack propagation problem in a single-layer graphene. Our tests show that the proposed data-driven model is robust and generalizable, in the sense that it is capable of modeling the initialization and growth of fractures under discretization and loading settings that are different from the ones used during training.

97 MATHEMATICS AND COMPUTING↗