Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptable”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Altered stoichiometry Escherichia coli Cascade complexes with shortened CRISPR RNA spacers are capable of interference and primed adaptation

The Escherichia coli type I-E CRISPR-Cas system Cascade effector is a multisubunit complex that binds CRISPR RNA (crRNA). Through its 32-nucleotide spacer sequence, Cascade-bound crRNA recognizes protospacers in foreign DNA, causing its destruction during CRISPR interference or acquisition of additional spacers in CRISPR array during primed CRISPR adaptation. Within Cascade, the crRNA spacer interacts with a hexamer of Cas7 subunits. We show that crRNAs with a spacer length reduced to 14 nucleotides cause primed adaptation, while crRNAs with spacer lengths of more than 20 nucleotides cause both primed adaptation and target interference in vivo. Shortened crRNAs assemble into altered-stoichiometry Cascade effector complexes containing less than the normal amount of Cas7 subunits. The results show that Cascade assembly is driven by crRNA and suggest that multi-subunit type I CRISPR effectors may have evolved from much simpler ancestral complexes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Dynamical mean field theory simulations with the adaptive sampling configuration interaction method

In the pursuit of accurate descriptions of strongly correlated quantum many-body systems, dynamical mean field theory (DMFT) has been an invaluable tool for elucidating the spectral properties and quantum phases of both phenomenological models and ab initio descriptions of real materials. Key to the DMFT process is the self-consistent map of the original system into an Anderson impurity model, the ground state of which is computed using an impurity solver. The power of the method is thus limited by the complexity of the impurity model the solver can handle. Simulating realistic systems generally requires many correlated sites. By adapting the recently proposed adaptive sampling configuration interaction (ASCI) method as an impurity solver, we enable much more efficient zero-temperature DMFT simulations. The key feature of the ASCI method is that it selects only the most relevant Hilbert space degrees of freedom to describe the ground state. This reduces the numerical complexity of the calculation, which will allow us to pursue future DMFT simulations with more correlated impurity sites than in previous works. Here, we present the ASCI-DMFT method and example calculations on the one- and two-dimensional Hubbard models that exemplify its efficient convergence and timing properties. We show that the ASCI approach is several orders of magnitude faster than the current best published ground-state DMFT simulations, which allows us to study the bath discretization error in simulations with small clusters, as well as to address cluster sizes beyond the current state of the art. Finally, our approach can also be adapted for other embedding methods such as density matrix embedding theory and self-energy embedding theory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements

The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parametrized quantum circuits that often contain substantially fewer gates than Trotter circuits. Here we report an improved version of the method, which we call AVQDS(T), by porting the tiling efficient trial circuits with rotations implemented simultaneously technique. The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. Here we perform benchmark noiseless AVQDS(T) simulations of quench dynamics in local spin models and compare with an alternative adaptive variational approach on quantum resource requirement. Quantum dynamical simulations implementing realistic noise channels are also reported. Finally, we propose a way to substantially alleviate the measurement overhead of AVQDS(T) while maintaining high accuracy by synergistically integrating quantum circuit calculations on quantum processing units with classical calculations using, e.g., tensor networks to evaluate the quantum geometric tensor. We showcase that this approach enables AVQDS(T) to deliver more accurate results than simulations using a fixed ansatz of comparable final depth for a significant time duration with fewer quantum resources.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Nonvariational ADAPT algorithm for quantum simulations

We explore a nonvariational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient measurements determine both the operators and the gate parameters in the quantum circuit construction. We compare this nonvariational algorithm with ADAPT-VQE and with feedback-based quantum algorithms in terms of the rate of energy reduction, the circuit depth, and the measurement cost in molecular simulation. We find that, despite using deeper circuits, this new algorithm reaches chemical accuracy at a similar measurement cost to ADAPT-VQE. Since it does not rely on a classical optimization subroutine, it may provide robustness against circuit parameter errors due to imperfect control or gate synthesis.

Tang'S, Ho Lun [Virginia Polytechnic Inst. and Sta↗
DOE OSTI2023

Spatiotemporally Adaptive Compression for Scientific Dataset with Feature Preservation – A Case Study on Simulation Data with Extreme Climate Events Analysis

Scientific discoveries are increasingly constrained by limited storage space and I/O capacities. For time-series simulations and experiments, their data often need to be decimated over timesteps to accommodate storage and I/O limitations. In this paper, we propose a technique that addresses storage costs while improving post-analysis accuracy through spatiotemporal adaptive, error-controlled lossy compression. We investigate the trade-off between data precision and temporal output rates, revealing that reducing data precision and increasing timestep frequency lead to more accurate analysis outcomes. Additionally, we integrate spatiotemporal feature detection with data compression and demonstrate that performing adaptive error-bounded compression in higher dimensional space enables greater compression ratios, leveraging the error propagation theory of a transformation-based compressor. To evaluate our approach, we conduct experiments using the well-known E3SM climate simulation code and apply our method to compress variables used for cyclone tracking. Our results show a significant reduction in storage size while enhancing the quality of cyclone tracking analysis, both quantitatively and qualitatively, in comparison to the prevalent timestep decimation approach. Compared to three state-of-the-art lossy compressors lacking feature preservation capabilities, our adaptive compression framework improves perfectly matched cases in TC tracking by 26.4-51.3% at medium compression ratios and by 77.3-571.1% at large compression ratios, with a merely 5–11% computational overhead.

Gong, Qian↗
DOE OSTI2019

A Framework for Self-Adaptive Dispersal of Computing Services

Modern networking architectures are making it increasingly possible to disperse services not just across servers but into intermediate network devices as well. Here we introduce the Misson-oriented Adaptive Placement (MAP) architecture, which synthesizes prior work on middleware, load-balancing, constraint solving, and aggregate programming into a framework for self-adaptive management of dispersed services. We provide a first evaluation of the efficacy and resilience that can be provided through this approach: results in simulation demonstrating that MAP can autonomously change the deployment of services to adapt to changing needs and failures.

Paulos, Aaron↗
DOE OSTI2018

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗
DOE OSTI2023

Adaptive Path-Following Control for Ground Vehicles Using a Switching Non-Quadratic Lyapunov Function

The application of adaptive control techniques in the development of control systems for intelligent vehicles, especially for ground vehicle path-following controllers, has gained popularity due to their ability to handle large-scale parametric uncertainties. However, the use of a standard quadratic Lyapunov function in existing adaptive control-based path-following controllers can lead to poor transient performance, such as slow convergence and/or large overshoot. To address this limitation, this study proposes the use of a switching non-quadratic Lyapunov function to design a model reference adaptive path-following controller that aims to provide superior transient performance. The stability and signal convergence of the closed-loop system are demonstrated through a Lyapunov-like analysis. Through dSPACE ASM simulation, the effectiveness of the proposed controller is illustrated, which confirms improved tracking performance over a baseline solution.

Zhou, Xingyu↗
DOE OSTI2024

DC Microgrid Reliability Enhancement with Adaptive Converter Thermal Management

Due to the different device selections, aging levels, and thermal dissipation performance, some converters may take additional thermal stress on switching devices than others in paralleled converter systems, which will reduce system reliability. To address this problem, this paper proposes a power-sharing strategy with adaptive thermal management. First, the temperature-based power loss model and electrical-thermal model are established. Based on that, a high-accuracy IGBT junction temperature estimate considering the power loss-temperature coupling can be achieved. Further, the thermal-sharing for all the switching devices in paralleled converters can be achieved with the proposed adaptive thermal management strategy. The proposed strategy can change the power-sharing ratio adaptively according to the system operation conditions, which will contribute to the system reliability enhancement. The effectiveness of the proposed strategy is verified through PLECS thermal simulation and joint real-time simulation with Dspace and RT-box.

DC microgrid↗
DOE OSTI2019

Large Scale Unsupervised Domain Adaptation of Segmentation Networks with Adversarial Learning

Most current state-of-the-art methods for semantic segmentation on remote sensing imagery require large labeled data, which is scarcely available. Due to the distribution shifting phenomenon inherent in remote sensing imagery, the reuse of pre-trained models on new areas of interest rarely yield satisfactory results. In this paper, we approach this problem from an adversarial learning perspective toward unsupervised domain adaptation. The core concept is to infuse fully convolutional neural networks and adversarial networks for semantic segmentation assuming the structures in the scene and objects of interest are similar in two set of images. Models are trained on a source dataset where ground truth is available and adapted to new target dataset iteratively via a adversarial loss on unlabeled samples. We use two real large scale datasets to validate the framework: 1) cross city road extraction and 2) cross country building extraction. The preliminary results show the usefulness of considering adversarial learning for indirect re-use of the pre-trained models. Experimental validation suggests significant benefits over models without adaptation.

Deng, Xueqing↗
DOE OSTI2021

Entropy and Boundary Based Adversarial Learning for Large Scale Unsupervised Domain Adaptation

Supervised semantic segmentation methods provide state-of-the-art performance, but their performance is limited by the amount of quality labeled data they need for training. Scarcity of labeled data and non-transferablity of models, due to cross-domain discrepancy makes it a bigger challenge for remote sensing imagery analysis. In this work, we approach this problem through adversarial learning, driven by entropy and boundary of region-of-interest for unsupervised domain adaptation. This concept helps with better boundary prediction and encourages target domain entropy maps (probability/uncertainty maps) to be similar to source domains. In particular, we showed that deriving informative entropy through the adversarial learning is essential to enable the adaptation. We used a large scale cross country building extraction dataset to validate the framework. The experimental results show the usefulness of considering boundary and entropy driven adversarial learning for adaptation.

Makkar, Nikhil↗
DOE OSTI2023

Convergence Rate of Model Reference Adaptive Control with Application to Building HVAC Systems

Model reference adaptive control (MRAC) has been studied for decades and successfully applied in multiple areas, including heating, ventilation, and air conditioning (HVAC) systems for buildings. MRAC is efficient in capturing the time-varying characteristics of buildings' indoor temperatures and outdoor weather environments. In this paper, the rate of convergence of MRAC is investigated, where a direct adaptive control with temperature set point reference tracking is used to regulate the indoor temperatures for buildings. Numerical results show that by controlling the HVAC systems of residential buildings using MRAC, the indoor temperatures converge Q-sublinearly to the desired temperature set points. In addition, the rate of convergence for MRAC is compared with a baseline adaptive model-free control method.

Wu, Tumin↗
DOE OSTI2024

Verification of Adaptive Protection in Hardware in the Loop for Coordination with Solar Variability

As inverter-based resources continue to be installed at all levels of the electric grid, the fixed protection schemes used at the distribution level will continue to be stressed until they no longer ensure the protection of the grid. Adaptive protection has been proposed as a solution with the ability to update the protection schemes in near real-time to ensure reliability and increase the resilience of the grid. However, weather variability poses a significant challenge to the ability of these methods to keep the selectivity and reliability of these schemes coordinated. If the ramp rates, due to solar variability, of the inverter-based resources change faster than the adaptive protection can issue new settings, the protection system could be uncoordinated, with the wrong device responding to a system fault. The proposed adaptive protection method ensures that due to solar variability, communication, and protection calculation latency, it can issu e coordinated protection settings promptly, in one minute or less. The hardware-in-the-loop results show the protection settings being issued and maintaining system coordination in under a minute.

Summers, Adam↗
DOE OSTI2022

A Multi-Branch Decoder Network Approach to Adaptive Temporal Data Selection and Reconstruction for Big Scientific Simulation Data

A key challenge in scientific simulation is that the simulation outputs often require intensive I/O and storage space to store the results for effective post hoc analysis. This article focuses on a quality-aware adaptive temporal data selection and reconstruction problem where the goal is to adaptively select simulation data samples at certain key timesteps in situ and reconstruct the discarded samples with quality assurance during post hoc analysis. This problem is motivated by the limitation of current solutions that a significant amount of simulation data samples are either discarded or aggregated during the sampling process, leading to inaccurate modeling of the simulated phenomena. Two unique challenges exist: 1) the sampling decisions have to be made in situ and adapted to the dynamics of the complex scientific simulation data; 2) the reconstruction error must be strictly bounded to meet the application requirement. To address the above challenges, we develop DeepSample , an error-controlled convolutional neural network framework, that jointly integrates a set of coherent multi-branch deep decoders to effectively reconstruct the simulation data with rigorous quality assurance. The results on two real-world scientific simulation applications show that DeepSample significantly outperforms other state-of-the-art methods on both sampling efficiency and reconstructed simulation data quality.

Zhang, Yang↗
DOE OSTI2022

Learning and Fast Adaptation for Grid Emergency Control via Deep Meta Reinforcement Learning

As power systems are undergoing a significant transformation with more uncertainties, less inertia and closer to operation limits, there is increasing risk of large outages. Thus, there is an imperative need to enhance grid emergency control to maintain system reliability and security. Towards this end, great progress has been made in developing deep reinforcement learning (DRL) based grid control solutions in recent years. However, existing DRL-based solutions have two main limitations: 1) they cannot handle well with a wide range of grid operation conditions, system parameters, and contingencies; 2) they generally lack the ability to fast adapt to new grid operation conditions, system parameters, and contingencies, limiting their applicability for real-world applications. Here, in this paper, we mitigate these limitations by developing a novel deep meta-reinforcement learning (DMRL) algorithm. The DMRL combines the meta strategy optimization together with DRL, and trains policies modulated by a latent space that can quickly adapt to new scenarios. We test the developed DMRL algorithm on the IEEE 300-bus system. We demonstrate fast adaptation of the meta-trained DRL polices with latent variables to new operating conditions and scenarios using the proposed method, which achieves superior performance compared to the state-of-the-art DRL and model predictive control (MPC) methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data

Adaptive mesh refinement (AMR) is a key technology for large-scale simulations that allows for adaptively changing the simulation mesh resolution, resulting in significant computational and storage savings. However, visualizing such AMR data poses a significant challenge due to the difficulties introduced by the hierarchical representation when reconstructing continuous field values. Here, we detail a comprehensive solution for interactive isosurface rendering of block-structured AMR data. We contribute a novel reconstruction strategy—the octant method—which is continuous, adaptive and simple to implement. Furthermore, we present a generally applicable hybrid implicit isosurface ray-tracing method, which provides better rendering quality and performance than the built-in sampling-based approach in OSPRay. Finally, we integrate our octant method and hybrid isosurface geometry into OSPRay as a module, providing the ability to create high-quality interactive visualizations combining volume and isosurface representations of BS-AMR data. Lastly, we evaluate the rendering performance, memory consumption and quality of our method on two gigascale block-structured AMR datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Differential early–life survival underlies the adaptive significance of temperature–dependent sex determination in a long–lived reptile

1. Many ectotherms rely on temperature cues experienced during development to determine offspring sex. The first descriptions of temperature-dependent sex determination (TSD) were made over 50 years ago, yet an understanding of its adaptive significance remains elusive, especially in long-lived taxa. 2. One novel hypothesis predicts that TSD should be evolutionarily favoured when two criteria are met—(a) incubation temperature influences annual juvenile survival and (b) sexes mature at different ages. Under these conditions, a sex-dependent effect of incubation temperature on offspring fitness arises through differences in age at sexual maturity, with the sex that matures later benefiting disproportionately from temperatures that promote juvenile survival. 3. The American alligator (Alligator mississippiensis) serves as an insightful model in which to test this hypothesis, as males begin reproducing nearly a decade after females. Here, through a combination of artificial incubation experiments and mark-recapture approaches, we test the specific predictions of the survival-to-maturity hypothesis for the adaptive value of TSD by disentangling the effects of incubation temperature and sex on annual survival of alligator hatchlings across two geographically distinct sites. 4. Hatchlings incubated at male-promoting temperatures (MPTs) consistently exhibited higher survival compared to those incubated at female-promoting temperatures. This pattern appears independent of hatchling sex, as females produced from hormone manipulation at MPT exhibit similar survival to their male counterparts. 5. Additional experiments show that incubation temperature may affect early-life survival primarily by affecting the efficiency with which maternally transferred energy resources are used during development. 6. Results from this study provide the first explicit empirical support for the adaptive value of TSD in a crocodilian and point to developmental energetics as a potential unifying mechanism underlying persistent survival consequences of incubation temperature.

59 BASIC BIOLOGICAL SCIENCES↗