Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimal estimation”

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,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Optimal and suboptimal methods of satellite surveillance for traffic control of transoceanic flights.

Description of a system which uses two synchronous equatorial satellites. Aircraft location is determined by measuring the range of the aircraft to each satellite as well as aircraft altitude, and transmitting this information periodically to a ground station. There, the aircraft's geographic position at the time of transmission is computed. This information is then combined with past position measurements in a suboptimal filter to determine aircraft position and velocity (the velocity being used to estimate aircraft position between transmissions). The suboptimal filter is a simplification of the optimal Kalman filter. Except for altitude information, the system is independent of the aircraft navigation system.

Winter, H.↗
NASA NTRSDate not supplied

Optimal Communication Topology Construction and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach with no estimation feedback to sensors selection and communication network topology computation for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes maximum airspace coverage with minimal resources, minimum communication time and power consumption while guaranteeing the system observability and providing in-time high quality information to both stationary and mobile users. The developed algorithms use multi-objective optimization strategy taking into account trade-offs between conflicting objectives and are implemented using off-the-shelf computational tools. The algorithms are validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace and parameters of a notional wireless communication network.

Distributed sensing↗
DOE OSTI2020

Data Assimilative Optimization of WSA Source Surface and Interface Radii using Particle Filtering

TheWang-Sheeley-Arge (WSA) model estimates solar wind speed and interplanetary magnetic field polarity in the inner heliosphere using global photospheric magnetic field maps. WSA employs the Potential Field Source Surface (PFSS) and Schatten Current Sheet (SCS) models to determine the Sun's global coronal magnetic field. The PFSS and SCS models are connected through two radial parameters, the source surface and interface radii, which specify the overlap region between the inner SCS and outer PFSS models. Though both radii values are adjustable, they have typically been fixed to 2.5 solar radii. Our work highlights how solar wind predictions improve when the radii are allowed to vary over time. Data assimilation using particle filtering (sequential Monte Carlo) is used to infer optimal values over a fixed time window. Solar wind model predictions and satellite observations are compared with a newly developed quality-of-agreement prediction metric. The agreement metric between the model and observations is assumed to correspond to the probability of the two key WSA model parameters, the source surface and interface radii, where the highest metric value implies the optimal radii.We find that the optimal particle filter values of solar radii can perform twice as well as standard values for an exploratory period during Carrington Rotation 1901, with these values also reducing nonphysical kinking effects seen in solar magnetic field lines. Data assimilation choices of input realization and time frame have implications for variation in the solar wind over time. We present this work's theoretical context and practical applications for prediction accuracy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Optimizing pixel tracklet searches for shorter lifetimes

Pixel tracklets, disappearing tracks reconstructed with only pixel hits, have proven to be a promising technique in LHC analyses to search for dark matter candidates at the LHC that belong to a nearly-degenerate electroweak multiplet. However, a Pseudo-Dirac electroweak doublet fermion, arguably the most interesting such possibility, has a shorter lifetime and therefore existing tracklet searches are less sensitive in this case. We assess the performance of a tracklet search optimized for shorter lifetimes by requiring only three pixel hits for the tracklet reconstruction, and by demanding an accompanying soft track for suppressing backgrounds. We estimate how far the sensitivity of existing searches can be extended into the region of parameter space with this optimized search.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Optimal Twirling Depth for Classical Shadows in the Presence of Noise

The classical shadows protocol is an efficient strategy for estimating properties of an unknown state p using a small number of state copies and measurements. In its original form, it involves twirling the state with unitaries from some ensemble and measuring the twirled state in a fixed basis. It was recently shown that for computing local properties, optimal sample complexity (copies of the state required) is remarkably achieved for unitaries drawn from shallow depth circuits composed of local entangling gates, as opposed to purely local (zero depth) or global twirling (infinite depth) ensembles. Here, we consider the sample complexity as a function of the depth of the circuit, in the presence of noise. We find that this noise has important implications for determining the optimal twirling ensemble. Under fairly general conditions, we (i) show that any single-site noise can be accounted for using a depolarizing noise channel with an appropriate damping parameter f, (ii) compute thresholds f th at which optimal twirling reduces to local twirling for Pauli operators, (iii) nth order Renyi entropies (n ≥2), and (iv) provide a meaningful upper bound t max on the optimal circuit depth for any finite noise strength f, which applies to observables and entanglement entropy measurements. In conclusion, these thresholds strongly constrain the search for optimal strategies to implement shadow tomography and are easily tailored to the experimental system at hand.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2020

Instrument Offset Optimization Technique for Airborne Doppler Wind Lidar Profiling Algorithm

This paper presents the instrument offset optimization technique for the Doppler Aerosol Wind Lidar (DAWN) profiling algorithm at NASA Langley Research Center (LaRC). The 2 um Doppler wind Lidar system at LaRC has a long history of research development and airborne campaigns. The core of the wind Lidar data processing is Airborne Wind Profiling Algorithm for Doppler Wind Lidar (APOLO), which was developed at LaRC. The extraction of wind parameters from the airborne Doppler wind Lidar data is challenging due to many factors such as the speed of aircraft, and the errors in instrument installation and calibration. It is unavoidable to prevent the adverse impact of calibration error and instrument installation offset on the performance of wind parameter estimation in the algorithm. Due to the unsteady environment where the data are collected, even a small offset will result in nonsensical results in the parameter estimation process. A brief introduction of APOLO and the overview of the optimization techniques are presented in this paper.

Wind profile↗
NASA NTRS2005

Optimizing observing sequence design for periodic and non-periodic phenomena : a Bayesian approach

In this paper we report on our progress on addressing these issues. We have developed an approximate expression for the uniformity of phase coverage that can be used when scheduling to assess candidate sample times. We describe the results obtained using this estimator, and compare them with detailed simulations. We describe our progress and plans for integrating optimizing criteria for both periodic and non-periodic observations into a single observation sequence.

Bayesian↗
NASA NTRS1985

Optimal Sensor Locations for Structural Identification

The optimum sensor location problem, OSLP, may be thought of in terms of the set of systems, S, the class of input time functions, I, and the identification algorithm (estimator) used, E. Thus, for a given time history of input, the technique of determining the OSL requires, in general, the solution of the optimization and the identification problems simultaneously. A technique which uncouples the two problems is introduced. This is done by means of the concept of an efficient estimator for which the covariance of the parameter estimates is inversely proportional to the Fisher Information Matrix.

Udwadia, F. E.↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Model-based estimation of wind fields over the ocean from wind scatterometer measurements. I - Development of the wind field model. II - Model parameter estimation

Techniques for the determination of near-surface mesoscale ocean wind fields on the basis of satellite scatterometer data are developed and demonstrated. The derivation of normal-boundary and parameterized-boundary-condition (PBC) wind-field models is outlined, and results from a simulation performed to estimate the model errors are presented in tables. It is shown that the PBC model provides accurate results while minimizing the number of unknowns. After a review of the principles of scatterometry and an analysis of scatterometer measurement noise, an objective function for the measurement parameters is developed and optimized on the basis of gradient search with initial values computed from pointwise wind estimates. The model is then applied to data from a simulation of the NASA Scatterometer (Li et al., 1984), and the results are presented in extensive graphs. The feasibility of model-based wind-field estimation and the appropriateness of the PBC model are demonstrated.

Long, David G.↗
NASA NTRS2020

Genetic Algorithm for Optimization of Neural Networks for Bayesian Inference of Model Uncertainty

The objective of this work was to develop a genetic optimization algorithm that can design a neural network capable of producing uncertainty estimates along with predictions. This algorithm is necessary because the inclusion of uncertainty modeling in a neural network greatly complicates the network’s design space, making the development of a converging model extremely difficult and time consuming. The genetic algorithm presented in this work uses a number of value ranges for various configurable neural network parameters to create a randomly generated population of network architectures. The initially generated population is then evolved over the course of several generations, with the best performing models breeding to produce novel network configurations. Mutations are randomly applied to the network designs to facilitate the development of adaptations beneficial to the task being performed. An experiment was conducted to validate the proposed algorithm, in which the genetic optimizer was tasked with producing a neural network capable of predicting the sound pressure level (SPL) resulting from jet-surface interaction (JSI) noise. The data used for this task was generated at the NASA Glenn Research Center in the Aero-Acoustic Propulsion Laboratory. Starting with an initial population size of 35 randomly generated networks, and evolved over the course of 10 generations, the genetic algorithm produced a design able to predict SPL as a result of JSI noise within 0.272 dB, on average.

Genetic algorithm↗
DOE OSTI2024

Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs

Abstract Gromov–Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov–Hausdorff distance is equivalent to solving an NP-hard optimization problem, deeming the notion impractical for applications. In this paper we propose a polynomial algorithm for estimating the so-called modified Gromov–Hausdorff (mGH) distance, a relaxation of the standard Gromov–Hausdorff (GH) distance with similar topological properties. We implement the algorithm for the case of compact metric spaces induced by unweighted graphs as part of Python library , and demonstrate its performance on real-world and synthetic networks. The algorithm finds the mGH distances exactly on most graphs with the scale-free property. We use the computed mGH distances to successfully detect outliers in real-world social and computer networks.

Oles, Vladyslav (ORCID:0000000188727463)↗
DOE OSTI2023

Evaluation of dual-weighted residual and machine learning error estimation for projection-based reduced-order models of steady partial differential equations

Projection-based reduced-order models (pROMs) show great promise as a means to accelerate many-query applications such as forward error propagation, solving inverse problems, and design optimization. In order to deploy pROMs in the context of high-consequence decision making, accurate error estimates are required to determine the region(s) of applicability in the parameter space. The following paper considers the dual-weighted residual (DWR) error estimate for pROMs and compares it to another promising pROM error estimate, machine learned error models (MLEM). Here, we show how DWR can be applied to ROMs and then evaluate DWR on two partial differential equations (PDEs): a two-dimensional linear convection–reaction–diffusion equation, and a three-dimensional static hyper-elastic beam. It is shown that DWR is able to estimate errors for pROMs extrapolating outside of their training set while MLEM is best suited for pROMs used to interpolate within the pROM training set.

42 ENGINEERING↗
DOE OSTI2021

Sensitivity of the NEXT experiment to Xe-124 double electron capture

Double electron capture by proton-rich nuclei is a second-order nuclear process analogous to double beta decay. Despite their similarities, the decay signature is quite different, potentially providing a new channel to measure the hypothesized neutrinoless mode of these decays. The Standard-Model-allowed two-neutrino double electron capture (2$\nu$EC EC) has been predicted for a number of isotopes, but only observed in 78 Kr, 130 Ba and, recently, 124 Xe. The sensitivity to this decay establishes a benchmark for the ultimate experimental goal, namely the potential to discover also the lepton-number-violating neutrinoless version of this process, 0$\nu$EC EC. Here we report on the current sensitivity of the NEXT-White detector to 124 Xe 2$\nu$EC EC and on the extrapolation to NEXT-100. Using simulated data for the 2$\nu$EC EC signal and real data from NEXT-White operated with 124 Xe-depleted gas as background, we define an optimal event selection that maximizes the NEXT-White sensitivity. We estimate that, for NEXT-100 operated with xenon gas isotopically enriched with 1 kg of 124 Xe and for a 5-year run, a sensitivity to the 2$\nu$EC EC half-life of 6 × 10 22 y (at 90% confidence level) or better can be reached.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Analysis of the weighted shifted boundary method for the Poisson and Stokes problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. Accuracy is maintained by properly shifting the location and values of the boundary conditions. This avoids integration over cut cells and the associated implementation issues. Recently, the Weighted SBM (WSBM) was proposed for the Navier-Stokes equations with free surfaces and the Stokes flow with moving boundaries. The attribute “weighted” in the name WSBM stems from the fact that its variational form is weighted with the elemental volume fraction of active fluid. The motivation for the development of the WSBM was the preservation of the volume of active fluid to a higher degree of accuracy, which in turn resulted in improved stability and robustness characteristics in moving-boundary, time-dependent simulations. In this article, we present the numerical analysis of the WSBM formulations for the Poisson and Stokes problems. We give mathematical conditions under which the bilinear forms defining the discrete variational formulations are uniformly coercive (Poisson problem) or inf-sup stable (Stokes problem). By these results, stability and optimal convergence is proven in the natural norm; L2-error estimates can also be derived.

Approximate domain boundaries↗
DOE OSTI2022

A single-cell Arabidopsis root atlas reveals developmental trajectories in wild-type and cell identity mutants

In all multicellular organisms, transcriptional networks orchestrate organ development. The Arabidopsis root, with its simple structure and indeterminate growth, is an ideal model to investigate the spatiotemporal transcriptional signatures underlying developmental trajectories. To map gene expression dynamics across root cell types and developmental time, we built a comprehensive, organ-scale atlas at single cell resolution. In addition to estimating developmental progressions in pseudotime, we employed the mathematical concept of optimal transport to infer developmental trajectories and identify their underlying regulators. To demonstrate the utility of the atlas to interpret new datasets, we profiled mutants for two key transcriptional regulators at single cell resolution, shortroot and scarecrow. We report transcriptomic and in vivo evidence for tissue trans-differentiation underlying a mixed cell identity phenotype in scarecrow. Our results support the atlas as a rich community resource for unraveling the transcriptional programs that specify and maintain cell identity to regulate spatiotemporal organ development.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Feature engineering for machine learning enabled early prediction of battery lifetime

Accurate battery lifetime estimates enable accelerated design of novel battery materials and determination of optimal use protocols for longevity in deployments. Unfortunately, traditional battery testing may take years to reach thousands of cycles. Recent studies have shown that machine learning (ML) tools can predict lithium-ion battery lifetimes from 100 or fewer preliminary cycles, representing only a few weeks of cycling. Until now, conclusions about the efficacy and broad applicability of these predictions across a variety of cathode chemistries have been limited by available experimental information. In this work, we leverage a battery cycling dataset representing six cathode chemistries (NMC111, NMC532, NMC622, NMC811, HE5050, and 5Vspinel), multiple electrolyte/anode compositions, and 300 total carefully prepared pouch batteries to explore feature selection and battery chemistry's role in ML battery lifetime predictions. Here, a mean absolute error (MAE) of 78 cycles in prediction was seen for a chemistry-spanning test set from 100 preliminary cycles. Furthermore, an MAE of 103 cycles was seen when using only the first cycle. This study represents an in-depth investigation of strategies for feature selection for battery lifetime prediction, ML models' generalization across multiple battery chemistries, and predictions beyond the training set in the chemical space.

25 ENERGY STORAGE↗