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

Advanced multi-modal mass spectrometry imaging reveals functional differences of placental villous compartments at microscale resolution

The placenta is a complex and heterogeneous organ that links the mother and fetus, playing a crucial role in nourishing and protecting the fetus throughout pregnancy. Integrative spatial multi-omics approaches can provide a systems-level understanding of molecular changes underlying the mechanisms leading to the histological variations of the placenta during healthy pregnancy and pregnancy complications. Herein, we advance our metabolome-informed proteome imaging (MIPI) workflow to include lipidomic imaging, while also expanding the molecular coverage of metabolomic imaging by incorporating on-tissue chemical derivatization (OTCD). The improved MIPI workflow advances biomedical investigations by leveraging state-of-the-art molecular imaging technologies. Lipidome imaging identifies molecular differences between two morphologically distinct compartments of a placental villous functional unit, syncytiotrophoblast (STB) and villous core. Next, our advanced metabolome imaging maps villous functional units with enriched metabolomic activities related to steroid and lipid metabolism, outlining distinct molecular distributions across morphologically different villous compartments. Complementary proteome imaging on these villous functional units reveals a plethora of fatty acid- and steroid-related enzymes uniquely distributed in STB and villous core compartments. Integration across our advanced MIPI imaging modalities enables the reconstruction of active biological pathways of molecular synthesis and maternal-fetal signaling across morphologically distinct placental villous compartments with micrometer-scale resolution.

60 APPLIED LIFE SCIENCES↗
NASA NTRS2002

Fine Sun Sensor Field of View Calibration

The fine Sun sensor (FSS) used on many spacecraft consists of two independent single-axis sensors, nominally mounted perpendicularly, that detect Sun angle across a typical field of view of +/- 32 degrees. The nonlinear function that maps the measured counts into an observed angle is called the transfer function. The FSS transfer function provided by the manufacturer consists of nine parameters for each of the two sensitive axes. An improved transfer function has been previously reported that achieves a significant accuracy improvement across the entire field of view. This new function expands the parameter set to 12 coefficients per axis and includes cross terms combining counts from both axes. To make best use of the FSS for spacecraft attitude determination, it must be calibrated after launch. We are interested in simplifying the postlaunch calibration procedure for estimating improvements to the 24 parameters in the transfer function. This paper discusses how to recombine the terms of the transfer function to reduce their redundancy without decreasing its accuracy and then presents an attitude dependent procedure for estimating the parameters. The end result is a calibration algorithm that is easier to use and does not sacrifice accuracy. Results of calibration using on-orbit data are presented.

Sedlak, Joseph E.↗
DOE OSTI2023

Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti’s Theorem for Markov Chains

Conformal prediction is a widely used method to quantify uncertainty in settings where the data is independent and identically distributed (IID), or more generally, exchangeable. Conformal prediction takes in a pre-trained classifier and a calibration dataset as inputs, and returns a function which maps feature vectors to subsets of classes. The output of the returned function for a new feature vector is guaranteed to contain the true class with a pre-specified confidence. Despite its success and usefulness in IID settings, extending conformal prediction to non-exchangeable (e.g., Markovian) data in a manner that provably preserves all desirable theoretical properties has largely remained an open problem. As a solution, we extend conformal prediction to the setting of a Hidden Markov Model (HMM) with unknown parameters. The key idea behind the proposed method is to partition the non-exchangeable Markovian data from the HMM into exchangeable blocks by exploiting the de Finetti’s Theorem for Markov Chains discovered by Diaconis and Freedman (1980). The permutations of the exchangeable blocks are then viewed as randomizations of the observed Markovian data from the HMM. The proposed method provably retains all desirable theoretical guarantees offered by the classical conformal prediction framework and is general enough to be useful in many sequential prediction problems.

Nettasinghe, Don Buddhika Wijayantha↗
DOE OSTI2023

Phase retrieval using Gaussian basis functions

A wavefront map of arbitrary aperture can be represented by a sum of Gaussian basis functions. Its performance is compared here to other representation methods such as orthonormal polynomials and Fourier modes. Gaussian basis functions can be applied to phase retrieval of high-frequency wavefront maps. Experiments show good agreement with direct measurements by a wavefront sensor. Finally, optimum measurement conditions are discussed based on the statistics of wavefront properties.

47 OTHER INSTRUMENTATION↗
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↗
NASA NTRS1982

A grid spacing control technique for algebraic grid generation methods

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

Smith, R. E.↗
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↗
NASA NTRS2003

Improved Fine Sun Sensor Field of View Calibration

The fine Sun sensor used on many spacecraft consists of two independent single-axis sensor heads, nominally mounted perpendicularly. These detect the Sun angle over a field of view typically of +32 deg. (There is a trade-off between accuracy and size of the field of view that allows for much latitude in any numbers quoted.) The nonlinear "transfer" function that maps the telemetered counts into observed angles consists of 9 adjustable parameters for each axis (1 8 total). An augmented transfer function has previously been reported that achieves a significant accuracy improvement across the entire field of view. That function expands the parameter set to 12 coefficients per axis (24 total) and includes cross terms combining counts from both axes. To make the best use of the Sun sensor for attitude determination, it must be calibrated after launch. However, the large number of parameters and the nonlinearity of the problem make this a challenging task. The purpose of this paper is to examine ways to improve convergence of the parameter search algorithm. In particular, experience has shown that the problem should be broken down into several steps, solving for a selected subset of the parameters at each step. This approach has now been incorporated as an option in the calibration utility.

Sedlak, J.↗
NASA NTRS1978

Global color variations on the Martian surface

Spectral reflectance data from the Viking-II Orbiter vidicon cameras have provided a means of mapping and classifying Martian surface materials over about 65% of the planet. The imagery, acquired at three wavelengths, was processed to remove an average Martian photometric function; albedo maps at the three wavelengths were created. Analysis of the imagery showed that the dark region between the equator and about 30 deg S in the Martian highlands consists of ancient ridges, crater rims and rugged plateaus which are very red, and younger intercrater volcanic plains exhibiting mare ridges which are much less red. In addition probable eolian deposits were found in the intermediate and high albedo regions.

Soderblom, L. A.↗
NASA NTRS1988

The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems

Reliable broadcast protocols are important tools in distributed and fault-tolerant programming. They are useful for sharing information and for maintaining replicated data in a distributed system. However, a wide range of such protocols has been proposed. These protocols differ in their fault tolerance and delivery ordering characteristics. There is a tradeoff between the cost of a broadcast protocol and how much ordering it provides. It is, therefore, desirable to employ protocols that support only a low degree of ordering whenever possible. This dissertation presents techniques for deciding how strongly ordered a protocol is necessary to solve a given application problem. It is shown that there are two distinct classes of application problems: problems that can be solved with efficient, asynchronous protocols, and problems that require global ordering. The concept of a linearization function that maps partially ordered sets of events to totally ordered histories is introduced. How to construct an asynchronous implementation that solves a given problem if a linearization function for it can be found is shown. It is proved that in general the question of whether a problem has an asynchronous solution is undecidable. Hence there exists no general algorithm that would automatically construct a suitable linearization function for a given problem. Therefore, an important subclass of problems that have certain commutativity properties are considered. Techniques for constructing asynchronous implementations for this class are presented. These techniques are useful for constructing efficient asynchronous implementations for a broad range of practical problems.

Schmuck, Frank Bernhard↗
NASA NTRS2011

Temporal mapping and analysis

A compositing process for selecting spatial data collected over a period of time, creating temporal data cubes from the spatial data, and processing and/or analyzing the data using temporal mapping algebra functions. In some embodiments, the temporal data cube is creating a masked cube using the data cubes, and computing a composite from the masked cube by using temporal mapping algebra.

O'Hara, Charles G.↗
NASA NTRS1993

Functional approximation using artificial neural networks in structural mechanics

The artificial neural networks (ANN) methodology is an outgrowth of research in artificial intelligence. In this study, the feed-forward network model that was proposed by Rumelhart, Hinton, and Williams was applied to the mapping of functions that are encountered in structural mechanics problems. Several different network configurations were chosen to train the available data for problems in materials characterization and structural analysis of plates and shells. By using the recall process, the accuracy of these trained networks was assessed.

Alam, Javed↗
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↗