Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Adaptive resolution simulation of salt solutions

We present an adaptive resolution simulation of aqueous salt (NaCl) solutions at ambient conditions using the adaptive resolution scheme. Our multiscale approach concurrently couples the atomistic and coarse-grained models of the aqueous NaCl, where water molecules and ions change their resolution while moving from one resolution domain to the other. We employ standard extended simple point charge (SPC/E) and simple point charge (SPC) water models in combination with AMBER and GROMOS force fields for ion interactions in the atomistic domain. Electrostatics in our model are described by the generalized reaction field method. The effective interactions for water–water and water–ion interactions in the coarse-grained model are derived using structure-based coarse-graining approach while the Coulomb interactions between ions are appropriately screened. To ensure an even distribution of water molecules and ions across the simulation box we employ thermodynamic forces. We demonstrate that the equilibrium structural, e.g. radial distribution functions and density distributions of all the species, and dynamical properties are correctly reproduced by our adaptive resolution method. Our multiscale approach, which is general and can be used for any classical non-polarizable force-field and/or types of ions, will significantly speed up biomolecular simulation involving aqueous salt.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Adaptive machine learning for time-varying systems: low dimensional latent space tuning

Machine learning (ML) tools such as encoder-decoder convolutional neural networks (CNN) can represent incredibly complex nonlinear functions which map between combinations of images and scalars. For example, CNNs can be used to map combinations of accelerator parameters and images which are 2D projections of the 6D phase space distributions of charged particle beams as they are transported between various particle accelerator locations. Despite their strengths, applying ML to time-varying systems, or systems with shifting distributions, is an open problem, especially for large systems for which collecting new data for re-training is impractical or interrupts operations. Particle accelerators are one example of large time-varying systems for which collecting detailed training data requires lengthy dedicated beam measurements which may no longer be available during regular operations. We present a novel method of adaptive ML for time-varying systems. Our approach is to map very high (N ≈ 100k) dimensional inputs (a combination of scalar parameters and images) into the low dimensional (N ≈ 2) latent space at the output of the encoder section of an encoder-decoder CNN. We then actively tune the low dimensional latent space-based representation of complex system dynamics by the addition of an adaptively tuned feedback vector directly before the decoder sections builds back up to our image-based high-dimensional phase space density representations. This method allows us to learn correlations within and to quickly tune the characteristics of incredibly large parameter space systems and to track their evolution in real time based on feedback without massive new data sets for re-training. We demonstrate that our method can accurately predict and track the phase space of charged particle beams at various locations in a particle accelerator by adaptively adjusting in real-time while the unknown input beam distribution of the accelerator is changing in shape, charge, and offset and while the RF system of the accelerator itself is also changing in an unpredictable way. For FACET-II we demonstrate that such an approach has the potential to use transverse deflecting cavity and energy spread spectrum beam measurements to accurately predict 2D projections of the 6D phase space of the electron beam at the plasma wakefield acceleration interaction point where such diagnostics are unavailable.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Molecular mechanisms and environmental adaptations of flagellar loss and biofilm growth of Rhodanobacter under environmental stress

Biofilms aid bacterial adhesion to surfaces via direct and indirect mechanisms, and formation of biofilms is considered as an important strategy for adaptation and survival in suboptimal environmental conditions. However, the molecular underpinnings of biofilm formation in subsurface sediment/groundwater ecosystems where microorganisms often experience fluctuations in nutrient input, pH, and nitrate or metal concentrations are underexplored. Here, we examined biofilm formation under different nutrient, pH, metal, and nitrate regimens of 16 Rhodanobacter strains isolated from subsurface groundwater wells spanning diverse levels of pH (3.5 to 5) and nitrates (13.7 to 146 mM). Eight Rhodanobacter strains demonstrated significant biofilm growth under low pH, suggesting adaptations for survival and growth at low pH. Biofilms were intensified under aluminum stress, particularly in strains possessing fewer genetic traits associated with biofilm formation, findings warranting further investigation. Through random barcode transposon-site sequencing (RB-TnSeq), proteomics, use of specific mutants, and transmission electron microscopy analysis, we discovered flagellar loss under aluminum stress, indicating a potential relationship between motility, metal tolerance, and biofilm growth. Comparative genomic analyses revealed the absence of flagella and chemotaxis genes and the presence of a putative type VI secretion system in the highly biofilm-forming strain FW021-MT20. In this study we identified genetic determinants associated with biofilm growth under metal stress in a predominant environmental genus, Rhodanobacter, and identified traits aiding survival and adaptation to contaminated subsurface environments.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Adaptation strategies of giant viruses to low-temperature marine ecosystems

Abstract Microbes in marine ecosystems have evolved their gene content to thrive successfully in the cold. Although this process has been reasonably well studied in bacteria and selected eukaryotes, less is known about the impact of cold environments on the genomes of viruses that infect eukaryotes. Here, we analyzed cold adaptations in giant viruses (Nucleocytoviricota and Mirusviricota) from austral marine environments and compared them with their Arctic and temperate counterparts. We recovered giant virus metagenome-assembled genomes (98 Nucleocytoviricota and 12 Mirusviricota MAGs) from 61 newly sequenced metagenomes and metaviromes from sub-Antarctic Patagonian fjords and Antarctic seawater samples. When analyzing our data set alongside Antarctic and Arctic giant viruses MAGs already deposited in the Global Ocean Eukaryotic Viral database, we found that Antarctic and Arctic giant viruses predominantly inhabit sub-10°C environments, featuring a high proportion of unique phylotypes in each ecosystem. In contrast, giant viruses in Patagonian fjords were subject to broader temperature ranges and showed a lower degree of endemicity. However, despite differences in their distribution, giant viruses inhabiting low-temperature marine ecosystems evolved genomic cold-adaptation strategies that led to changes in genetic functions and amino acid frequencies that ultimately affect both gene content and protein structure. Such changes seem to be absent in their mesophilic counterparts. The uniqueness of these cold-adapted marine giant viruses may now be threatened by climate change, leading to a potential reduction in their biodiversity.

Environmental Sciences & Ecology↗
DOE OSTI2022

Kingdom-Wide Analysis of Fungal Protein-Coding and tRNA Genes Reveals Conserved Patterns of Adaptive Evolution

Protein-coding genes evolved codon usage bias due to the combined but uneven effects of adaptive and nonadaptive influences. Studies in model fungi agree on codon usage bias as an adaptation for fine-tuning gene expression levels; however, such knowledge is lacking for most other fungi. Our comparative genomics analysis of over 450 species supports codon usage and transfer RNAs (tRNAs) as coadapted for translation speed and this is most likely a realization of convergent evolution. Rather than drift, phylogenetic reconstruction inferred adaptive radiation as the best explanation for the variation of interspecific codon usage bias. Although the phylogenetic signals for individual codon and tRNAs frequencies are lower than expected by genetic drift, we found remarkable conservation of highly expressed genes being codon optimized for translation by the most abundant tRNAs, especially by inosine-modified tRNAs. As an application, we present a sequence-to-expression neural network that uses codons to reliably predict highly expressed transcripts. The kingdom Fungi, with over a million species, includes many key players in various ecosystems and good targets for biotechnology. Collectively, our results have implications for better understanding the evolutionary success of fungi, as well as informing the biosynthetic manipulation of fungal genes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Comparative transcriptomics elucidates adaptive phenol tolerance and utilization in lipid-accumulating Rhodococcus opacus PD630

Lignin-derived (e.g. phenolic) compounds can compromise the bioconversion of lignocellulosic biomass to fuels and chemicals due to their toxicity and recalcitrance. The lipid-accumulating bacterium Rhodococcus opacus PD630 has recently emerged as a promising microbial host for lignocellulose conversion to value-added products due to its natural ability to tolerate and utilize phenolics. To gain a better understanding of its phenolic tolerance and utilization mechanisms, we adaptively evolved R. opacus over 40 passages using phenol as its sole carbon source (up to 373% growth improvement over wild-type), and extensively characterized two strains from passages 33 and 40. The two adapted strains showed higher phenol consumption rates (~20 mg/l/h) and ~2-fold higher lipid production from phenol than the wild-type strain.Whole-genome sequencing and comparative transcriptomics identified highly-upregulated degradation pathways and putative transporters for phenol in both adapted strains, highlighting the important linkage between mechanisms of regulated phenol uptake, utilization, and evolved tolerance. Our study shows that the R. opacus mutants are likely to use their transporters to import phenol rather than export them, suggesting a new aromatic tolerance mechanism. The identified tolerance genes and pathways are promising candidates for future metabolic engineering in R. opacus for improved lignin conversion to lipid-based products.

59 BASIC BIOLOGICAL SCIENCES↗
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↗