Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Domain 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 487 records · Page 27

Least-Squares Frequency-Acquisition Algorithm

Algorithm finds frequency and phase of sinudoidal signal in presence of noise. Algorithm is special case of more-general, adaptive-paramenter-estimation techniques. Computational requirements of algorithm comparable to corresponding fast-Fourier-transform (FFT) algorithm. Algorithm works directly in time domain, whereas FFT algorithm transforms data into frequency domain for estimation and detection and requires secondary algorithm to interpolate between frequencies.

Kumar, Rajendra↗

Modeling Gravitational Radiation Waveforms from Black Hole Mergers

Gravitational radiation from merging binary black hole systems is anticipated as a key source for gravitational wave observations. Ground-based instruments, such as the Laser Interferometer Gravitational-wave Observatory (LIGO) may observe mergers of stellar-scale black holes, while the space-based Laser Interferometer Space Antenna (LISA) observatory will be sensitive to mergers of massive galactic-center black holes over a broad range of mass scales. These cataclysmic events may emit an enormous amount of energy in a brief time. Gravitational waves from comparable mass mergers carry away a few percent of the system's mass-energy in just a few wave cycles, with peak gravitational wave luminosities on the order of 10^23 L_Sun. Optimal analysis and interpretation of merger observation data will depend on developing a detailed understanding, based on general relativistic modeling, of the radiation waveforms. We discuss recent progress in modeling radiation from equal mass mergers using numerical simulations of Einstein's gravitational field equations, known as numerical relativity. Our simulations utilize Adaptive Mesh Refinement (AMR) to allow high-resolution near the black holes while simultaneously keeping the outer boundary of the computational domain far from the black holes, and making it possible to read out gravitational radiation waveforms in the weak-field wave zone. We discuss the results from simulations beginning with the black holes orbiting near the system's innermost stable orbit, comparing the recent simulations with earlier "Lazarus" waveform estimates based on an approximate hybrid numerical/perturbative technique.

Baker, J. G.↗

Axion Mass Prediction from Adaptive Mesh Refinement Cosmological Lattice Simulations

The quantum chromodynamics (QCD) axion arises as the pseudo-Goldstone mode of a spontaneously broken Abelian Peccei-Quinn (PQ) symmetry. If the scale of PQ symmetry breaking occurs below the inflationary reheat temperature and the domain wall number is unity, then there is a unique axion mass that gives the observed dark matter (DM) abundance. Computing this mass has been the subject of intensive numerical simulations for decades since the mass prediction informs laboratory experiments. Axion strings develop below the PQ symmetry-breaking temperature, and as the string network evolves, it emits axions that go on to become the DM. A key ingredient in the axion mass prediction is the spectral index of axion radiation emitted by the axion strings. We compute this index in this Letter using the most precise and accurate large-scale simulations to date of the axion-string network leveraging adaptive mesh refinement to achieve the precision that would, otherwise, require a static lattice with 262,144 3 lattice sites. We find a scale-invariant axion radiation spectrum to within 1% precision and find no evidence that the spectral index of radiation evolves with time. Accounting for axion production from strings prior to the QCD phase transition leads us to predict that the axion mass should be approximately 𝑚 𝑎 ∈ (45, 65) μ ⁢eV. However, we provide preliminary evidence that axions are produced in greater quantities from the string-domain-wall network collapse during the QCD phase transition, potentially increasing the mass prediction to as much as 300 μ ⁢eV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adaptive grid methods for RLV environment assessment and nozzle analysis

Rapid access to highly accurate data about complex configurations is needed for multi-disciplinary optimization and design. In order to efficiently meet these requirements a closer coupling between the analysis algorithms and the discretization process is needed. In some cases, such as free surface, temporally varying geometries, and fluid structure interaction, the need is unavoidable. In other cases the need is to rapidly generate and modify high quality grids. Techniques such as unstructured and/or solution-adaptive methods can be used to speed the grid generation process and to automatically cluster mesh points in regions of interest. Global features of the flow can be significantly affected by isolated regions of inadequately resolved flow. These regions may not exhibit high gradients and can be difficult to detect. Thus excessive resolution in certain regions does not necessarily increase the accuracy of the overall solution. Several approaches have been employed for both structured and unstructured grid adaption. The most widely used involve grid point redistribution, local grid point enrichment/derefinement or local modification of the actual flow solver. However, the success of any one of these methods ultimately depends on the feature detection algorithm used to determine solution domain regions which require a fine mesh for their accurate representation. Typically, weight functions are constructed to mimic the local truncation error and may require substantial user input. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. These weight functions can then be used to construct blending functions for algebraic redistribution, interpolation functions for unstructured grid generation, forcing functions to attract/repel points in an elliptic system, or to trigger local refinement, based upon application of an equidistribution principle. The popularity of solution-adaptive techniques is growing in tandem with unstructured methods. The difficultly of precisely controlling mesh densities and orientations with current unstructured grid generation systems has driven the use of solution-adaptive meshing. Use of derivatives of density or pressure are widely used for construction of such weight functions, and have been proven very successful for inviscid flows with shocks. However, less success has been realized for flowfields with viscous layers, vortices or shocks of disparate strength. It is difficult to maintain the appropriate mesh point spacing in the various regions which require a fine spacing for adequate resolution. Mesh points often migrate from important regions due to refinement of dominant features. An example of this is the well know tendency of adaptive methods to increase the resolution of shocks in the flowfield around airfoils, but in the incorrect location due to inadequate resolution of the stagnation region. This problem has been the motivation for this research.

Thornburg, Hugh J.↗

Approaches for the Simulation of Coupled Processes in Evolving Fractured Porous Media Enabled by Exascale Computing

Models have historically represented fractured porous media with continuum descriptions that characterize the media using bulk parameters. The impact of small-scale features is not captured in these models, although they may be controlling the performance of subsurface applications. Pore-scale models can simulate processes in small-scale features by representing the pore space geometry explicitly but are computationally expensive for large domains. The alternative multiscale approach entails the combination of pore-scale and continuum-scale descriptions in a single framework. We use Chombo-Crunch, a computational capability that discretizes complex geometries with an adaptive, embedded boundary method to contrast these two approaches. Chombo-Crunch takes advantage of recent computational performance and memory bandwidth improvements resulting from the emergence of exascale computing resources. These combined improvements enable the efficient simulation of reactive transport in fractured media with a high degree of fidelity and the ability to capture the control small-scale processes exert on the overall medium evolution.

42 ENGINEERING↗

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗

Resource-Adaptive Federated Text Generation with Differential Privacy

In cross-silo federated learning (FL), sensitive text datasets remain confined to local organizations due to privacy regulations, making repeated training for each downstream task both communication-intensive and privacy-demanding. A promising alternative is to generate differentially private (DP) synthetic datasets that approximate the global distribution and can be reused across tasks. However, pretrained large language models (LLMs) often fail under domain shift, and federated finetuning is hindered by computational heterogeneity: only resource-rich clients can update the model, while weaker clients are excluded, amplifying data skew and the adverse effects of DP noise. We propose a flexible participation framework that adapts to client capacities. Strong clients perform DP federated finetuning, while weak clients contribute through a lightweight DP voting mechanism that refines synthetic text. To ensure the synthetic data mirrors the global dataset, we apply control codes (e.g., labels, topics, metadata) that represent each client’s data proportions and constrain voting to semantically coherent subsets. This two-phase approach requires only a single round of communication for weak clients and integrates contributions from all participants. Experiments show that our framework improves distribution alignment and downstream robustness under DP and heterogeneity.

Wang, Jiayi [ORNL]↗

An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations

A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a different formulation of the viscous terms are shown to be necessary. A hybrid Cartesian/body-fitted grid generation approach is demonstrated. In addition, a grid-generation procedure based on body-aligned cell cutting coupled with a viscous stensil-construction procedure based on quadratic programming is presented.

Coirier, William John↗

Adaptive mesh based combustion simulations of direct fuel injection effects in a supersonic cavity flame-holder

Here, we present high-fidelity reacting simulations of a supersonic cavity flame-holder configuration. The focus of this work is on flame stabilization brought about by varying the location of fuel injection in a cavity stabilized supersonic flow of air. Central to our approach is a compressible multi-species reacting flow solver that uses adaptive-mesh-refinement (AMR), enabling the resolution of flame, shock-waves, boundary-layers, and small-scale structures in the computational domain. Our analysis indicates that fuel injection closer to the ramp at the aft end of the cavity allows for greater mixing and lower peak temperatures compared to fuel injection upstream that is closer to the backward facing step of the cavity. This difference is mainly due to greater turbulent fluctuations generated from the shear-layer towards the cavity ramp, thereby enhancing the mixing of fuel and air. A low frequency oscillatory behaviour in heat-release and pressure was also observed for the upstream injection case while a much higher-frequency phenomena was observed in the near-ramp injection case. By identifying the important physical determinants of the combustion processes, this study illustrates a promising pathway to design and optimize direct fuel injection strategies in supersonic cavity flame-holders that can improve flame stability, combustion efficiency, and reduce emissions.

42 ENGINEERING↗

Using output to evaluate and refine rules in rule-based expert systems

The techniques described provide an effective tool which knowledge engineers and domain experts can utilize to help in evaluating and refining rules. These techniques have been used successfully as learning mechanisms in a prototype adaptive diagnostic expert system and are applicable to other types of expert systems. The degree to which they constitute complete evaluation/refinement of an expert system depends on the thoroughness of their use.

St.clair, D. C.↗

Input preshaping with frequency domain information for flexible-link manipulator control

The application of an input preshaping scheme to flexible manipulators is considered. The resulting control corresponds to a feedforward term that convolves in real-time the desired reference input with a sequence of impulses and produces a vibration free output. The robustness of the algorithm with respect to injected disturbances and modal frequency variations is not satisfactory and can be improved by convolving the input with a longer sequence of impulses. The incorporation of the preshaping scheme to a closed-loop plant, using acceleration feedback, offers satisfactory disturbance rejection due to feedback and cancellation of the flexible mode effects due to the preshaping. A frequency domain identification scheme is used to estimate the modal frequencies on-line and subsequently update the spacing between the impulses. The combined adaptive input preshaping scheme provides the fastest possible slew that results in a vibration free output.

Tzes, Anthony↗

Recent developments in learning control and system identification for robots and structures

This paper reviews recent results in learning control and learning system identification, with particular emphasis on discrete-time formulation, and their relation to adaptive theory. Related continuous-time results are also discussed. Among the topics presented are proportional, derivative, and integral learning controllers, time-domain formulation of discrete learning algorithms. Newly developed techniques are described including the concept of the repetition domain, and the repetition domain formulation of learning control by linear feedback, model reference learning control, indirect learning control with parameter estimation, as well as related basic concepts, recursive and non-recursive methods for learning identification.

Phan, M.↗

Considerations of open-loop, closed-loop, and adaptive multicyclic control systems

Four different types of self-tuning regulators were studied for multicyclic control of helicopter vibration. A numerical simulation of the helicopter is made, using a multivariable frequency-domain model, in terms of transfer function with six input control harmonics and six output harmonics. The model characteristics vary with flight speed. An off-line identification of model characteristics is made, using the least-squared-error method and using a succession of input and output measurements. The on-line identification of model characteristics is made using the Kalman filter solution. The optimal controls are calculated from the minimization of quadratic performance function based on response and multicyclic inputs. The performance of various regulators or controllers is judged from the stability, transient response, convergence time, and amplitude of the steady state.

Chopra, I.↗

Markov Modeling of Component Fault Growth over a Derived Domain of Feasible Output Control Effort Modifications

This paper introduces a novel Markov process formulation of stochastic fault growth modeling, in order to facilitate the development and analysis of prognostics-based control adaptation. A metric representing the relative deviation between the nominal output of a system and the net output that is actually enacted by an implemented prognostics-based control routine, will be used to define the action space of the formulated Markov process. The state space of the Markov process will be defined in terms of an abstracted metric representing the relative health remaining in each of the system s components. The proposed formulation of component fault dynamics will conveniently relate feasible system output performance modifications to predictions of future component health deterioration.

Bole, Brian↗

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Foundation Models for Zero-Shot Segmentation of Scientific Images without AI-Ready Data

Zero-shot and prompt-based models have excelled at visual reasoning tasks by leveraging large-scale natural image corpora, but they often fail on sparse and domain-specific scientific image data. We introduce Zenesis, a no-code interactive computer vision platform designed to reduce data readiness bottlenecks in scientific imaging workflows. Zenesis integrates lightweight multimodal adaptation for zero-shot inference on raw scientific data, human-in-the-loop refinement, and heuristic-based temporal enhancement. We validate our approach on Focused Ion Beam Scanning Electron Microscopy (FIB-SEM) datasets of catalyst-loaded membranes. Zenesis outperforms baselines, achieving an average accuracy of 0.947, Intersection over Union (IoU) of 0.858, and Dice score of 0.923 on amorphous catalyst samples; and 0.987 accuracy, 0.857 IoU, and 0.923 Dice on crystalline samples. These results represent a significant performance gain over conventional methods such as Otsu thresholding and standalone models like the Segment Anything Model (SAM). Zenesis enables effective image segmentation in domains where annotated datasets are limited, offering a scalable solution for scientific discovery.

Mukherjee, Shubhabrata↗

Robust Path-following Controller for Multirotor Vehicles in Uncertain Wind Conditions

This paper presents simulations of L1 adaptive controller on a multirotor vehicle for compensation of convective winds. There are increasing efforts to utilize unmanned vehicles for fighting wildfires, but such vehicles need to be able to compensate for convective updrafts and other uncertainties (e.g., wind shear and turbulence) caused by the wildfire. Other application domains, such as urban air mobility, also must account for convective or uncertain winds present in urban microclimates. Geometric controllers have great tracking performance properties in environments without uncertainties, but the tracking performance degrades when wind disturbances and external loads are present in the environment. Introducing L1 adaptive control into the controller architecture compensates for these wind disturbances and reduces the tracking error caused by such disturbances. The controller architecture is implemented on a small quadrotor. The simulations demonstrate the advantages of the L1 adaptive augmentation for a sample figure-eight trajectory while encountering unknown variable wind conditions with an external load.

John L Bullock↗

Robust Path-following Controller for Multirotor Vehicles in Uncertain Wind Conditions

This paper presents simulations of L1 adaptive controller on a multirotor vehicle for compensation of convective winds. There are increasing efforts to utilize unmanned vehicles for fighting wildfires, but such vehicles need to be able to compensate for convective updrafts and other uncertainties (e.g., wind shear and turbulence) caused by the wildfire. Other application domains, such as urban air mobility, also must account for convective or uncertain winds present in urban microclimates. Geometric controllers have great tracking performance properties in environments without uncertainties, but the tracking performance degrades when wind disturbances and external loads are present in the environment. Introducing L1 adaptive control into the controller architecture compensates for these wind disturbances and reduces the tracking error caused by such disturbances. The controller architecture is implemented on a small quadrotor. The simulations demonstrate the advantages of the L1 adaptive augmentation for a sample figure-eight trajectory while encountering unknown variable wind conditions with an external load.

John Bullock↗