Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “functions and mappings”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Neural networks to learn protein sequence–function relationships from deep mutational scanning data

Understanding the relationship between protein sequence and function is necessary to design new and useful proteins with applications in bioenergy, medicine, and agriculture. The mapping from sequence to function is tremendously complex because it involves thousands of molecular interactions that are coupled over multiple lengths and timescales. We show that neural networks can learn the sequence–function mapping from large protein datasets. Neural networks are appealing for this task because they can learn complicated relationships from data, make few assumptions about the nature of the sequence–function relationship, and can learn general rules that apply across the length of the protein sequence. We demonstrate that learned models can be applied to design new proteins with properties that exceed natural sequences.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

A comprehensive and fair comparison of two neural operators (with practical extensions) based on $\mathrm{FAIR}$ data

Neural operators can learn nonlinear mappings between function spaces and offer a new simulation paradigm for real-time prediction of complex dynamics for realistic diverse applications as well as for system identification in science and engineering. Herein, we investigate the performance of two neural operators, which have shown promising results so far, and we develop new practical extensions that will make them more accurate and robust and importantly more suitable for industrial-complexity applications. The first neural operator, DeepONet, was published in 2019 (Lu et al., 2019), and its original architecture was based on the universal approximation theorem of Chen & Chen (1995). The second one, named Fourier Neural Operator or FNO, was published in 2020, and it is based on parameterizing the integral kernel in the Fourier space. DeepONet is represented by a summation of products of neural networks (NNs), corresponding to the branch NN for the input function and the trunk NN for the output function; both NNs are general architectures, e.g., the branch NN can be replaced with a CNN or a ResNet. According to Kovachki et al. (2021), FNO in its continuous form can be viewed conceptually as a DeepONet with a specific architecture of the branch NN and a trunk NN represented by a trigonometric basis. In order to compare FNO with DeepONet computationally for realistic setups, we develop several extensions of FNO that can deal with complex geometric domains as well as mappings where the input and output function spaces are of different dimensions. We also develop an extended DeepONet with special features that provide inductive bias and accelerate training, and we present a faster implementation of DeepONet with cost comparable to the computational cost of FNO, which is based on the Fast Fourier Transform. Here we consider 16 different benchmarks to demonstrate the relative performance of the two neural operators, including instability wave analysis in hypersonic boundary layers, prediction of the vorticity field of a flapping airfoil, porous media simulations in complex-geometry domains, etc. We follow the guiding principles of FAIR (Findability, Accessibility, Interoperability, and Reusability) for scientific data management and stewardship. The performance of DeepONet and FNO is comparable for relatively simple settings, but for complex geometries the performance of FNO deteriorates greatly. We also compare theoretically the two neural operators and obtain similar error estimates for DeepONet and FNO under the same regularity assumptions.

42 ENGINEERING↗
DOE OSTI2021

Artificial Neural Networks as Mappings between Proton Potentials, Wave Functions, Densities, and Energy Levels

We report artificial neural networks (ANNs) have become important in quantum chemistry. Herein, applications to nuclear quantum effects, such as zero-point energy, vibrationally excited states, and hydrogen tunneling, are explored. ANNs are used to solve the time-independent Schrödinger equation for single- and double-well potentials representing hydrogen-bonded molecular systems capable of proton transfer. ANN mappings are trained to predict the lowest five proton vibrational energies, wave functions, and densities from the proton potentials and to predict the excited state proton vibrational energies and densities from the proton ground state density. For the inverse problem, ANN mappings are trained to predict the proton potential from the proton vibrational energy levels or the proton ground state density. This latter mapping is theoretically justified by the first Hohenberg-Kohn theorem establishing a one-to-one correspondence between the external potential and the ground state density. ANNs for two- and three-dimensional systems are also presented to illustrate the straightforward extension to higher dimensions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Multifidelity multiobjective optimization for wake-steering strategies

Abstract. Wake steering is an emerging wind power plant control strategy where upstream turbines are intentionally yawed out of perpendicular alignment with the incoming wind, thereby “steering” wakes away from downstream turbines. However, trade-offs between the gains in power production and fatigue loads induced by this control strategy are the subject of continuing investigation. In this study, we present a multifidelity multiobjective optimization approach for exploring the Pareto front of trade-offs between power and loading during wake steering. A large eddy simulation is used as the high-fidelity model, where an actuator line representation is used to model wind turbine blades and a rainflow-counting algorithm is used to compute damage equivalent loads. A coarser simulation with a simpler loads model is employed as a supplementary low-fidelity model. Multifidelity Bayesian optimization is performed to iteratively learn both a surrogate of the low-fidelity model and an additive discrepancy function, which maps the low-fidelity model to the high-fidelity model. Each optimization uses the expected hypervolume improvement acquisition function, weighted by the total cost of a proposed model evaluation in the multifidelity case. The multifidelity approach is able to capture the logit function shape of the Pareto frontier at a computational cost only 30 % that of the single-fidelity approach. Additionally, we provide physical insights into the vortical structures in the wake that contribute to the Pareto front shape.

17 WIND ENERGY↗
DOE OSTI2025

1 × 1 km maps of abundances of eight enzyme functional classes for soil C, N, and P cycling across the CONUS

This dataset includes eight 1 × 1 km maps of the abundances of eight enzyme functional classes (EFC) for soil C, N, and P cycling across the CONUS. These mappings are predicted by the machine learning model trained using metagenomics and the corresponding environmental data. This item corresponds to our article: Fan, C., Song, Y., Mishra, U., Gautam, S., & Mayes, M. A. (2025). Harnessing the Power of Machine Learning and Omics to Identify Environmental Regulation on Microbial Functional Composition for Soil C, N, and P Cycling. Journal of Geophysical Research: Biogeosciences, 130(10).

1 × 1 km↗
DOE OSTI2021

High Throughput Mapping of Single Molecules’ Redox Potentials on Electrode

By synchronizing electrochemical potential scanning with a single-molecule localization super-resolution fluorescence microscope, kinetic fluorescence changes of hundreds of single molecular redox events were tracked simultaneously with high throughput, and subsequent cross-correlation function analysis mapped single molecules’ redox potentials (times) out on the imaging area from site to site in unprecedented detail by extracting electrochemically induced fluorescence change from apparently random fluorescence on/off blinking. This work paves the way toward mapping redox states at single-molecule levels in high throughput in chemical and biological systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

An Atom-Precise Approach to Damp First-Order Phase Transitions and Its Implications for Neuromorphic Signal Processing

Neuromorphic computing inspired by mammalian intelligence aims to emulate the nonlinear dynamics of biological neurons and synapses to achieve fast, low-energy, and highly efficient information processing. Brain-inspired computing relies on the design and discovery of materials exhibiting nonlinear current–voltage profiles, frequently underpinned by electronic state transitions, to achieve spiking neurons and dynamically tunable synapses. A signature challenge in the design of artificial neurons is controlling the steepness of first-order transitions in active elements, as abrupt transitions are at risk of driving unstable voltage and temperature oscillations, which result in catastrophic device failure. A critical knowledge gap is the lack of structure–function correlations mapping the composition and atomistic structure of crystalline solids to nonlinear dynamical response characteristics. Here, we address the key question of how modification of atomistic structure correlates with alteration of neuron-like functionality. Constructing oscillator circuits from millimeter-scale single crystals enables high-resolution atomic structure solutions, which we use to demonstrate that the selective positioning of Pb cations modifies charge ordering along a one-dimensional CuxV2O5 framework even at low insertion stoichiometries, thereby providing an atom-precise design parameter for damping first-order transitions. We use temperature-variant X-ray diffraction and X-ray spectroscopy to elucidate the suppression of Cu-ion shuttling based on the precise positioning of Pb ions in seven-coordinated tunnel interstitial sites as the mechanistic basis for transition broadening, thus bridging a critical gap between statistical mechanics and quantum chemical descriptions of phase transitions. Such mechanistic understanding thus paves the way to site-selective modification strategies for modulating the sharpness of first-order transitions, with an exemplary demonstration here in tuning neuronal signal processing.

Crystal structure↗
DOE OSTI2025

Genetic variation at transcription factor binding sites largely explains phenotypic heritability in maize

Abstract Comprehensive maps of functional variation at transcription factor (TF) binding sites (cis-elements) are crucial for elucidating how genotype shapes phenotype. Here, we report the construction of a pan-cistrome of the maize leaf under well-watered and drought conditions. We quantified haplotype-specific TF footprints across a pan-genome of 25 maize hybrids and mapped over 200,000 variants, genetic, epigenetic, or both (termed binding quantitative trait loci (bQTL)), linked tocis-element occupancy. Three lines of evidence support the functional significance of bQTL: (1) coincidence with causative loci that regulate traits, includingvgt1,ZmTRE1and the MITE transposon nearZmNAC111under drought; (2) bQTL allelic bias is shared between inbred parents and matches chromatin immunoprecipitation sequencing results; and (3) partitioning genetic variation across genomic regions demonstrates that bQTL capture the majority of heritable trait variation across ~72% of 143 phenotypes. Our study provides an auspicious approach to make functionalcis-variation accessible at scale for genetic studies and targeted engineering of complex traits.

Genetics & Heredity↗
DOE OSTI2023

Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems

We explore using neural operators, or neural network representations of nonlinear maps between function spaces, to accelerate infinite-dimensional Bayesian inverse problems (BIPs) with models governed by nonlinear parametric partial differential equations (PDEs). Neural operators have gained significant attention in recent years for their ability to approximate the parameter-to-solution maps defined by PDEs using as training data solutions of PDEs at a limited number of parameter samples. The computational cost of BIPs can be drastically reduced if the large number of PDE solves required for posterior characterization are replaced with evaluations of trained neural operators. However, reducing error in the resulting BIP solutions via reducing the approximation error of the neural operators in training can be challenging and unreliable. We provide an a priori error bound result that implies certain BIPs can be ill-conditioned to the approximation error of neural operators, thus leading to inaccessible accuracy requirements in training. To reliably deploy neural operators in BIPs, we consider a strategy for enhancing the performance of neural operators: correcting the prediction of a trained neural operator by solving a linear variational problem based on the PDE residual. We show that a trained neural operator with error correction can achieve a quadratic reduction of its approximation error, all while retaining substantial computational speedups of posterior sampling when models are governed by highly nonlinear PDEs. The strategy is applied to two numerical examples of BIPs based on a nonlinear reaction–diffusion problem and deformation of hyperelastic materials. We demonstrate that posterior representations of the two BIPs produced using trained neural operators are greatly and consistently enhanced by error correction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep Neural Network.

Neural operators have recently become popular tools for designing solution maps between function spaces in the form of neural networks. Differently from classical scientific machine learning approaches that learn parameters of a known partial differential equation (PDE) for a single instance of the input parameters at a fixed resolution, neural operators approximate the solution map of a family of PDEs [6, 7]. Despite their success, the uses of neural operators are so far restricted to relatively shallow neural networks and confined to learning hidden governing laws. In this work, we propose a novel nonlocal neural operator, which we refer to as nonlocal kernel network (NKN), that is resolution independent, characterized by deep neural networks, and capable of handling a variety of tasks such as learning governing equations and classifying images. Our NKN stems from the interpretation of the neural network as a discrete nonlocal diffusion reaction equation that, in the limit of infinite layers, is equivalent to a parabolic nonlocal equation, whose stability is analyzed via nonlocal vector calculus. The resemblance with integral forms of neural operators allows NKNs to capture long-range dependencies in the feature space, while the continuous treatment of node-to-node interactions makes NKNs resolution independent. The resemblance with neural ODEs, reinterpreted in a nonlocal sense, and the stable network dynamics between layers allow for generalization of NKN’s optimal parameters from shallow to deep networks. This fact enables the use of shallow-to-deep initialization techniques [8]. Our tests show that NKNs outperform baseline methods in both learning governing equations and image classification tasks and generalize well to different resolutions and depths.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

From Machine Learning to Machine Reasoning: A Model-based Approach to Analyze Equipment Reliability Data

In current nuclear power plants (NPPs) a large amount of condition-based data which can be used to assess and monitor component health and performance. Assessing component health from such data can be performed with a large variety of methods. While the analysis of numeric data can be performed with several methods, the extraction of information from textual data remains a challenge. Currently employed natural language processing (NLP) methods do not really provide quantitative information that might be contained in IRs. In addition, the integration of numeric and textual data to identify possible causal relationships between data elements is still an unresolved challenge. This paper presents an approach to extract information from textual (e.g., incident or maintenance reports) and numeric data that relies on model based system engineer (MBSE) models. MBSE are diagrams designed to represent system and component dependencies (from both a form and functional point of view). In our approach, MBSE models emulate system engineer knowledge about component/system architecture. NLP methods are employed to perform syntactic and semantic analyses. Syntactic analysis analyzes the grammatical structure of a sentence while semantic analysis is designed to analyze the logic structure of a sentence. An innovative element of our approach is that semantic analysis uses MBSE models to identify links between textual elements. Similarly, numeric data is directly linked to elements of the MBSE models in order to map which functions are being monitored.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A generalized and adaptable tensor-contraction-based cluster expansion formalism for multicomponent solids

Density functional theory (DFT)-based simulations of materials have first-principles accuracy, but are very computationally expensive. For simulating various properties of multi-component alloys, the cluster expansion (CE) technique has served as the standard workaround to improve computational efficiency. However, the standard CE technique is difficult to extend to exotic and/or low-symmetry lattices, often implemented via iteration over particular cluster types, which must be enumerated per lattice structure. In this work, we introduce the tensor cluster expansion (TCE), implemented in the open-source code tce-lib, which maps correlation functions to mixed tensor contractions, eliminating the need to iterate over cluster types and additionally making the calculation of correlation functions well-suited for massively parallel architectures like GPUs. We show that local interaction energies are an immediate consequence of the TCE formalism, yielding nearly $\mathcal{O}$(1) energy difference calculations. We then use this formalism to fit CE models for the TaW and CoNiCrFeMn systems, and use these models to respectively compute the enthalpy of mixing curve and Cowley short-range order parameters, showing excellent agreement with ground truth data.

Cluster expansion↗
DOE OSTI2026

Development of male-sterile lines of Setaria viridis to accelerate C 4 model plant genetics

Setaria viridis is a diploid C 4 grass in the Poaceae family, notable for its rapid life cycle of 6–8 weeks from sowing to seed—much shorter than the 4–5 months required by crops such as Zea mays and Sorghum bicolor . This fast growth makes S. viridis a valuable model for C 4 crop research. Genetic crosses are essential for studying gene function, but manual crossing is labor-intensive and time-consuming. Here, to address this, we developed a male-sterile line by targeting the S. viridis ortholog of Setaria italica NO POLLEN 1 ( SiNP1 ), which encodes a glucose–methanol–choline oxidoreductase required for pollen exine formation. Using Cas9 and TREX2 -mediated genome editing, we generated SiNP1 knockouts in both the S. viridis ME034V and A10.1 backgrounds that were fully male-sterile. Backcrossing T 0 male-sterile plants to ME034V wild-type followed by selfing yielded a stable BC 1 F 2 line homozygous for a 59 bp deletion in the S. viridis NO POLLEN 1 gene, easily genotyped by PCR and maintained by heterozygous siblings. Using this line, we developed a simple and efficient crossing protocol that eliminates the need for emasculation. This method enables a single person to perform up to 100 crosses per day—compared to 15 using traditional methods—and yields 20–32 F 1 hybrid seeds per panicle with 100% genetic purity. We also quantified pollen flow and outcrossing frequencies under greenhouse conditions to develop optimal bagging strategies and prevent unintended pollination. This resource accelerates genetic research in S. viridis , enhancing its utility as a premier C 4 model for mapping and functional genomics.

C4 research↗
DOE OSTI2021

Solving the 2D SUSY Gross-Neveu-Yukawa model with conformal truncation

We use Lightcone Conformal Truncation to analyze the RG flow of the two-dimensional supersymmetric Gross-Neveu-Yukawa theory, i.e. the theory of a real scalar superfield with a $\mathbb{Z}$ 2 -symmetric cubic superpotential, aka the 2d Wess-Zumino model. The theory depends on a single dimensionless coupling $\overline{g}$, and is expected to have a critical point at a tuned value ${\overline{g}}_{\ast }$ where it flows in the IR to the Tricritical Ising Model (TIM); the theory spontaneously breaks the $\mathbb{Z}$ 2 symmetry on one side of this phase transition, and breaks SUSY on the other side. We calculate the spectrum of energies as a function of $\overline{g}$ and see the gap close as the critical point is approached, and numerically read off the critical exponent ν in TIM. Beyond the critical point, the gap remains nearly zero, in agreement with the expectation of a massless Goldstino. We also study spectral functions of local operators on both sides of the phase transition and compare to analytic predictions where possible. In particular, we use the Zamolodchikov C -function to map the entire phase diagram of the theory. Crucial to this analysis is the fact that our truncation is able to preserve supersymmetry sufficiently to avoid any additional fine tuning.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

QTL Mapping of Seed Fatty Acid Contents in Camelina sativa Under Heat Stress

Heat stress alters oil quality in oilseed crops, yet its genetic underpinnings in Camelina sativa remain unclear. This study investigated the genetic basis of heat-induced changes in seed fatty acids using a recombinant inbred line (RIL) population derived from a cross between two camelina varieties, Suneson and Pryzeth. Exposure to high temperature during reproductive growth led to increased proportions of saturated (C16:0, C18:0) and monounsaturated (C18:1) fatty acids, whereas polyunsaturated C18:3, total unsaturated fatty acids (UFA) and the PUFA/MUFA ratio were decreased, suggesting an inhibition of the C18:1 → C18:2 → C18:3 desaturation pathway. A high-density linkage map (4981 bins across 20 chromosomes) was built, and 25 QTLs for fatty acids were detected, with hotspots on chromosomes 1, 9, 12, 13, 16, and 20. A major QTL on chromosome 1 (~ 80 cM) explained the largest variance component for PUFA/MUFA under heat. Three desaturase genes (FAD2, FAD7, FAD8) were located within key QTL intervals, nominating them as candidates for modulating unsaturation under elevated temperature. These results provide a genetic basis for fine mapping and functional validation, supporting future molecular and breeding efforts to stabilize oil quality under warming conditions.

Camelina↗
DOE OSTI2026

Reducing systematic bias in machine learning applications to J/ψ signal extraction in high-energy nuclear physics

Machine learning techniques are increasingly used in high-energy nuclear physics because they can exploit multivariate correlations more efficiently than conventional cut-based analyses. A central challenge is the construction of training samples that faithfully reproduce the detector response observed in data. Signal samples are usually derived from detector simulations; therefore, mismatches between simulation and data can degrade classifier performance and introduce systematic biases. This work presents two practical correction procedures, namely cumulative distribution function (CDF) mapping and a shift-and-scale transformation, to align simulated signal features with those measured in data. Their performance is demonstrated with $J$/$\psi$ yield measurements in $\sqrt{s_{nn}}$ = 200 GeV Ru+Ru and Zr+Zr collisions recorded by STAR. A set of self-consistency tests shows that these procedures substantially suppress the systematic bias associated with data-simulation discrepancies in machine-learning-based signal extraction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Data reduction in deterministic neutron transport calculations using machine learning

Neutron cross section matrices for fission and scattering data are required for each material, temperature, and enrichment level to calculate the neutron transport equation accurately. Here, this information can be a limiting factor when using the multigroup discrete ordinates (S N ) method when the number of energy groups is large. Machine Learning (ML) can be used to replace the need for the cross section matrices by reproducing the function that maps the scalar flux to the scattering and fission sources. Through the use of autoencoders and Deep Jointly-Informed Neural Networks (DJINN), the data storage requirements are reduced by 94% of the original data for a 618 group problem. This is accomplished while preserving the scalar flux, maintaining generality, and decreasing wall clock times.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗