Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “automatic adaptivity”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification

SInkhorn Dynamic Domain Adaptation (SIDDA) supplements the experiments presented in 2501.14048, SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification with Equivariant Neural Networks. SIDDA introduces a semi-supervised, automatic domain adaptation method that leverages Sinkhorn divergences to dynamically adjust the regularization in the optimal transport plan and the weighting between classification and domain adaptation loss terms during training.

Pandya, Sneh [Fermi National Accelerator Laborator↗
DOE OSTI2026

Generalizable Web User Interface for Scalable and Streamlined Deployment of Building Energy Management Systems in Small and Medium-Sized Commercial Buildings

Small and medium-sized commercial buildings (SMCBs) comprise 94% of US commercial buildings yet face significant barriers to implementing building energy management systems despite advances in smart device technology. Existing solutions present critical limitations: cloud-based API solutions simplify deployment but create vendor lock-in constraints; commercial integrated software solutions ensure compatibility via standardized protocols but require substantial cost and technical expertise; open-source IoT platforms offer cost-effective vendor independence but provide insufficient standardized protocol support for commercial building automation. This research presents a generalizable web user interface framework that bridges the gap between evolving smart device capabilities and lagging software infrastructure for SMCBs. The proposed system integrates VOLTTRON open-source middleware with an automated configuration converter that transforms unified specifications written in YAML, a human-readable data-serialization format, into system-specific files, streamlining manual setup processes. The vendor-agnostic architecture supports industry-standard protocols (BACnet and Modbus) and semantic building models while providing adaptive web interfaces that dynamically adjust to various building configurations. Demonstrations through simulation-based testing and a field deployment show automatic interface adaptation across heterogeneous HVAC systems and multizone monitoring. The automated configuration converter also substantially reduces labor-intensive setup.

Chung, Jihoon [ORNL] (ORCID:0000000184880815)↗
DOE OSTI2023

Adaptive primal–dual control for distributed energy resource management

With the increased adoption of distributed energy resources (DERs) in distribution networks, their coordinated control with a DER management system (DERMS) that provides grid services (e.g., voltage regulation, virtual power plant) is becoming more necessary. One particular type of DERMS using primal–dual control has recently been found to be very effective at providing multiple grid services among an aggregation of DERs; however, the main parameter, the primal–dual step size, must be manually tuned for the DERMS to be effective, which can take a considerable amount of engineering time and labor. To this end, we design a simple method that self-tunes the step size(s) and adapts it to changing system conditions. Additionally, it gives the DER management operator the ability to prioritize among possibly competing grid services. Here we evaluate the automatic tuning method on a simulation model of a real-world feeder in Colorado with data obtained from an electric utility. Through a variety of scenarios, we demonstrate that the DERMS with automatically and adaptively tuned step sizes provides higher-quality grid services than a DERMS with a manually tuned step size.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗
DOE OSTI2025

Dynamic Low-Rank Training with Spectral Regularization: Achieving Robustness in Compressed Representations

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94\% compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2025

Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94 compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2023

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↗
DOE OSTI2020

Subtask 1.5 – CO2 Injection Monitoring with an Optimized Scalable, Automated, Semipermanent Seismic Array

The scalable, automated, semipermanent seismic array (SASSA) method is a flexible and relatively cost-effective surface geophysical method for regular time-lapse monitoring of the movement of injected carbon dioxide (CO2) in a reservoir for CO2 enhanced oil recovery (EOR) or geologic CO2 storage operations. It has the advantages of a low-environmental-footprint while monitoring regions of a reservoir from the surface without the need for a regular grid distribution of receivers. Automated data collection is possible. As only time-lapse amplitude changes at the reservoir level due to CO2 movement within the reservoir are monitored, the turnaround time to deliver results from the SASSA method can be short, without the need for long, time-consuming data-processing workflows. As data is collected and processed, incremental information can be provided to the field operator. The Energy & Environmental Research Center (EERC) conducted a SASSA field test from September 2018 to November 2020 in a portion of the Bell Creek Field in Montana, which implemented new CO2 EOR field activities during the study period. Lessons learned from a proof-of-concept study were incorporated to improve the data quality of the SASSA method and demonstrate the viability of the technology. The EERC implemented several enhancements to improve data quality, including 1) an iterative survey design, which allowed placing the receivers in strategic locations where the movement of the CO2 in the reservoir could be tracked with minimum interference by the cultural noise in the study area; 2) the use of powerful seismic sources in the form of surface orbital vibrators, and 3) data acquisition during optimal periods. History-matched reservoir simulation was performed to predict gas saturation and pressure response induced by CO2 injection in the study area. The results were compared with the SASSA-measured responses to CO2 injection as a partial validation technique. A match between the two methods was observed for most of the SASSA points predicted to have intersected a CO2 saturation change. The validated results provide confidence that the SASSA method can be used independently as a CO2 saturation monitoring technique. As data are collected and processed, incremental information can be provided to the field operator. The critical components of the SASSA workflow for a successful application of the method are the following: Iterative survey design with information about CO2 injection activities from the oilfield operator. A detailed CO2 injection plan is the key driver to select the strategic monitoring location of the SASSA sensors. After this information is incorporated in the initial distribution of sources and receivers in the study area, high-resolution satellite images are used to identify ground locations not affected by cultural noise sources, such as power lines, pipelines/flow lines, or roadways. In the next iteration of the survey design, a scouting trip to the study area is needed to understand more details of the noise sources identified in the previous step and the intensity of the field activities that can also generate noise during the monitoring. Integrating the information from the scouting trip into the survey design to select the optimum source and receiver locations is the final step. Noise attenuation. The variety of noise types during seismic monitoring of an oil field is enormous. Tailored noise characterization and processing at a node-by-node level can enhance the performance and sensitivity of the SASSA technique. Future advancements that could improve the efficiency and application of the SASSA technology include: Gaining a better understanding of the noise field produced by the seismic source to aid the choice of receiver location. Surface noise from the source can overwhelm the small signal changes due to CO2 that the SASSA method measures. Improved data-processing workflow to automatically analyze and adapt to dynamic noise conditions associated with industrial settings. This subtask was funded through the EERC–DOE Joint Program on Research and Development for Fossil Energy-Related Resources Cooperative Agreement No. DE- FE0024233.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Target Detection via Cognitive Radars Using Change-Point Detection, Learning, and Adaptation

Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements

42 ENGINEERING↗
DOE OSTI2022

Spatiotemporal Graph Convolutional Networks for Earthquake Source Characterization

Abstract Accurate earthquake location and magnitude estimation play critical roles in seismology. Recent deep learning frameworks have produced encouraging results on various seismological tasks (e.g., earthquake detection, phase picking, seismic classification, and earthquake early warning). Many existing machine learning earthquake location methods utilize waveform information from a single station. However, multiple stations contain more complete information for earthquake source characterization. Inspired by recent successes in applying graph neural networks (GNNs) in graph‐structured data, we develop a Spatiotemporal Graph Neural Network (STGNN) for estimating earthquake locations and magnitudes. Our graph neural network leverages geographical and waveform information from multiple stations to construct graphs automatically and dynamically by adaptive message passing based on graphs' edges. Using a recent graph neural network and a fully convolutional neural network as baselines, we apply STGNN to earthquakes recorded by the Southern California Seismic Network from 2000 to 2019 and earthquakes collected in Oklahoma from 2014 to 2015. STGNN yields more accurate earthquake locations than those obtained by the baseline models and performs comparably in terms of depth and magnitude prediction, though the ability to predict depth and magnitude remains weak for all tested models. Our work demonstrates the potential of using GNNs and multiple stations for better automatic estimation of earthquake epicenters.

58 GEOSCIENCES↗
DOE OSTI2024

Adaptive Narrowband Damping for Improving Harmonic Stability of Modular Multilevel Converter: Preprint

Harmonic instability events between modular multilevel converter (MMC) and ac systems have been widely reported in recent years. To resolve it, this paper proposes an adaptive narrowband damping control that automatically programs, adds and adjusts damping around the oscillation frequency when detect the oscillation. The paper first presents a low-pass filter design for MMC control loops, which pushes all negative damping of MMC impedance down to the medium frequency range (< approximately 1000 Hz). This makes narrowband damping can be more targeted and easier to design because multiple harmonic oscillations are avoided. An adaptive damping control that uses online oscillation detection is then proposed, which can automatically configure the narrowband damper to provide damping to the MMC at the detected oscillation frequency. In contrast to existing narrowband damping methods, the proposed adaptive narrowband damper adjusts the damping gain (e.g., to zero when system resonance disappears) and the width of the damping range automatically based on continuous monitoring of system resonance conditions. Electromagnetic transient (EMT) simulation results validate the efficacy of the proposed method in two typical MMC-based power systems.

active damping↗
DOE OSTI2024

Adaptive Narrowband Damping for Improving Harmonic Stability of Modular Multilevel Converter

Harmonic instability events between modular multilevel converter (MMC) and ac systems have been widely reported in recent years. To damp harmonic resonance, this paper proposes an adaptive narrowband damping control that automatically programs, adds, and adjusts the damping around the oscillation frequency when an oscillation is detected. First, the paper presents a low-pass filter design for MMC control loops that pushes all negative damping of the MMC impedance down to the medium-frequency range (< ~ 1000 Hz). Then, an adaptive damping control that uses online oscillation detection is proposed, which can automatically configure the narrowband damper to provide positive damping to the MMC around the detected oscillation frequency. In contrast to existing narrowband damping methods, the proposed adaptive narrowband damper dynamically adjusts the damping gain and the width of the damping range based on continuous monitoring of system resonance conditions (e.g., adjust damping gain to zero when the system resonance disappears). Electromagnetic transient simulation results validate the efficacy of the proposed method in two typical MMC-based power systems.

active damping↗
DOE OSTI2025

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↗
DOE OSTI2020

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Bayesian tensorized neural networks with automatic rank selection

Tensor decomposition is an effective approach to compress over-parameterized neural networks and to enable their deployment on resource-constrained hardware platforms. However, directly applying tensor compression in the training process is a challenging task due to the difficulty of choosing a proper tensor rank. In order to address this challenge, this paper proposes a low-rank Bayesian tensorized neural network. Our Bayesian method performs automatic model compression via an adaptive tensor rank determination. We also present approaches for posterior density calculation and maximum a posteriori (MAP) estimation for the end-to-end training of our tensorized neural network. Here, we provide experimental validation on a two-layer fully connected neural network, a 6-layer CNN and a 110-layer residual neural network where our work produces 7.4x to 137x more compact neural networks directly from the training while achieving high prediction accuracy.

Low-rank tensor↗
DOE OSTI2023

Enabling attractive-repulsive potentials in binary-collision-approximation monte-carlo codes for ion-surface interactions

Abstract Binary Collision Approximation (BCA) codes for ion-material interactions, such as SRIM, Tridyn, F-TRIDYN, and SDtrimSP, have historically been limited to screened Coulomb potentials even at low energies due to the difficulty in numerically solving the Distance of Closest Approach (DOCA) problem for attractive-repulsive potentials. Techniques such as direct n-body simulation or modifications to Newton’s method are either prohibitively costly or not guaranteed to work for all potentials. Advanced rootfinding techniques, such as companion matrix solvers, offer a solution. For many attractive-repulsive potentials, however, a companion matrix cannot be used directly, because there is no way to put the associated functions into a monomial basis form. A complementary technique is proxy rootfinding—by finding the best-fit polynomial approximant of a function, the zeros of the approximant can be guaranteed to be close to the zeros of the function. Using the Chebyshev basis and grid offers additional guarantees with regards to the quality of the approximation, the speed of convergence, and the avoidance of Runge’s phenomenon. By finding Chebyshev interpolants and using the Chebyshev-Frobenius companion matrix, the zeros of any real function on a bounded domain can be found. Here we show that using an Adaptive Chebyshev Proxy Rootfinder with Automatic Subdivision (ACPRAS) with appropriate scaling functions, numerical issues presented by attractive-repulsive potentials, including those of scale, can be handled. Using these techniques, we show that it is possible to include any physically reasonable interatomic potential in a BCA code, and to guarantee correctness of the resulting scattering angle calculations.

Materials Science↗