Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “likelihood function”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Search for low mass dark matter in DarkSide-50: the bayesian network approach

Abstract We present a novel approach for the search of dark matter in the DarkSide-50 experiment, relying on Bayesian Networks. This method incorporates the detector response model into the likelihood function, explicitly maintaining the connection with the quantity of interest. No assumptions about the linearity of the problem or the shape of the probability distribution functions are required, and there is no need to morph signal and background spectra as a function of nuisance parameters. By expressing the problem in terms of Bayesian Networks, we have developed an inference algorithm based on a Markov Chain Monte Carlo to calculate the posterior probability. A clever description of the detector response model in terms of parametric matrices allows us to study the impact of systematic variations of any parameter on the final results. Our approach not only provides the desired information on the parameter of interest, but also potential constraints on the response model. Our results are consistent with recent published analyses and further refine the parameters of the detector response model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Combining biomarker and virus phylogenetic models improves HIV-1 epidemiological source identification

To identify and stop active HIV transmission chains new epidemiological techniques are needed. Here, we describe the development of a multi-biomarker augmentation to phylogenetic inference of the underlying transmission history in a local population. HIV biomarkers are measurable biological quantities that have some relationship to the amount of time someone has been infected with HIV. To train our model, we used five biomarkers based on real data from serological assays, HIV sequence data, and target cell counts in longitudinally followed, untreated patients with known infection times. The biomarkers were modeled with a mixed effects framework to allow for patient specific variation and general trends, and fit to patient data using Markov Chain Monte Carlo (MCMC) methods. Subsequently, the density of the unobserved infection time conditional on observed biomarkers were obtained by integrating out the random effects from the model fit. This probabilistic information about infection times was incorporated into the likelihood function for the transmission history and phylogenetic tree reconstruction, informed by the HIV sequence data. To critically test our methodology, we developed a coalescent-based simulation framework that generates phylogenies and biomarkers given a specific or general transmission history. Testing on many epidemiological scenarios showed that biomarker augmented phylogenetics can reach 90% accuracy under idealized situations. Under realistic within-host HIV-1 evolution, involving substantial within-host diversification and frequent transmission of multiple lineages, the average accuracy was at about 50% in transmission clusters involving 5–50 hosts. Realistic biomarker data added on average 16 percentage points over using the phylogeny alone. Using more biomarkers improved the performance. Shorter temporal spacing between transmission events and increased transmission heterogeneity reduced reconstruction accuracy, but larger clusters were not harder to get right. More sequence data per infected host also improved accuracy. We show that the method is robust to incomplete sampling and that adding biomarkers improves reconstructions of real HIV-1 transmission histories. The technology presented here could allow for better prevention programs by providing data for locally informed and tailored strategies.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Bayesian inference of Stochastic reaction networks using Multifidelity Sequential Tempered Markov Chain Monte Carlo

Stochastic reaction network models are often used to explain and predict the dynamics of gene regulation in single cells.These models usually involve several parameters, such as the kinetic rates of chemical reactions, that are not directly measurable and must be inferred from experimental data. Bayesian inference provides a rigorous probabilistic frame-work for identifying these parameters by finding a posterior parameter distribution that captures their uncertainty.Traditional computational methods for solving inference problems such as Markov Chain Monte Carlo methods based on classical Metropolis-Hastings algorithm involve numerous serial evaluations of the likelihood function, which in turn requires expensive forward solutions of the chemical master equation (CME). We propose an alternate approach based on a multifidelity extension of the Sequential Tempered Markov Chain Monte Carlo (ST-MCMC) sampler. This algorithm is built upon Sequential Monte Carlo and solves the Bayesian inference problem by decomposing it into a sequence of efficiently solved subproblems that gradually increase both model fidelity and the influence of the observed data. We reformulate the finite state projection (FSP) algorithm, a well-known method for solving the CME, to produce a hierarchy of surrogate master equations to be used in this multifidelity scheme. To determine the appropriate fidelity, we introduce a novel information-theoretic criteria that seeks to extract the most information about the ultimate Bayesian posterior from each model in the hierarchy without inducing significant bias. This novel sampling scheme is tested with high performance computing resources using biologically relevant problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Calibration of the Diffusivity Predictions of Centipede Using Approximate Bayesian Computation and Applications in Nyx (Engineering Scale) and Xolotl-MARMOT (Meso-Scale) Simulations

Fission gas evolution and release in UO 2 nuclear fuel are important fuel performance metrics and occur in several distinct stages: 1) nucleation, growth and resolution of intra-granular bubbles, 2) diffusion to grain boundaries and 3) nucleation and growth of bubbles at grain boundaries, which eventually form a connected network (percolation) enabling release of gas from grain boundaries through connections to triple junctions, grain edges or free surfaces. The NE-SciDAC project is developing several computational tools to model this problem, which are connected in a hierarchical multi-scale framework. The information transfer in the multi-scale framework is a critical step that, in addition to best-estimates, should include uncertainty quantification. Despite taking a first-principles multi-scale approach, there is a need to perform parameter calibration to ensure consistency with available experimental data. In the present study, uncertainty quantification (UQ) and parameter calibration is demonstrated for one of the lower length scale codes in the multi-scale framework (Centipede) and then the results, including instances of the propagated uncertainties, are used in other codes within the framework, specifically Nyx and Xolotl-MARMOT. We calibrated the model parameters in Centipede, a computer code used to predict diffusivities of uranium (U) and xenon (Xe) in the context of the simulation of fission gas in uranium oxide (UO 2 ) nuclear fuel. The Centipede code depends on 183 parameters, all of which are subject to uncertainty. The three data sets used in our calibration effort are taken from the literature. This data is available as a set of measurements, including measurement errors. Our goal is to calibrate a statistical model that predicts both the value of the measurement and the uncertainty associated with the measurement. We perform a Bayesian calibration of the model parameters using a dedicated approximate Bayesian computation (ABC) likelihood function. To avoid excessive computational costs, we replace the expensive Centipede simulation code by a higher-order surrogate model, constructed using only the 9 most important parameters. These important parameters are identified by a preliminary global sensitivity analysis (GSA) study. Among the important parameters are T0 (the temperature at which UO 2 is perfectly stoichiometric) and Hf_pO2 (the temperature dependence of the oxygen (O) partial pressure) that should be considered as operating conditions to be estimated along with the other parameters. We consider two different cases: one where we define one set of these operating conditions for all data sets, and one where we define distinct operating condition parameters for each data set. The Xe diffusivities predicted by the latter case show distinct features that could not be observed in the former. Next, we use the diffusivity predictions by Centipede as input to Nyx, a reduced order fuel performance code focused on gas behavior alone, in order to estimate quantities associated with inter-granular bubble formation at conditions specified by the experiments. Finally, the diffusivities obtained from the calibrated Centipede runs were used in coupled Xolotl-MARMOT simulations of intra- and inter-granular gas evolution. The results are compared to simulations using the baseline diffusivities from Turnbull et al.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Simulating Continuum-based Redshift Measurement in the Roman’s High Latitude Spectroscopic Survey

We investigate the capability of the Nancy Grace Roman Space Telescope’s (Roman) Wide-Field Instrument G150 slitless grism to detect red, quiescent galaxies based on the current reference survey. We simulate dispersed images for Roman reference High-Latitude Spectroscopic Survey (HLSS) and analyze two-dimensional spectroscopic data using the grism Redshift and Line Analysis (Grizli) software. This study focus on assessing Roman grism’s capability for continuum-level redshift measurement for a redshift range of 0.5 ≤ z ≤ 2.5. The redshift recovery is assessed by setting three requirements of: σ z = $\frac{|z–z_{true}|}{1+z}$ ≤ 0.01, signal-to-noise ratio≥ 5 and the presence of a single dominant peak in redshift likelihood function. We find that, for quiescent galaxies, the reference HLSS can reach a redshift recovery completeness of ≥50% for F158 magnitude brighter than 20.2 mag. We also explore how different survey parameters, such as exposure time and the number of exposures, influence the accuracy and completeness of redshift recovery, providing insights that could optimize future survey strategies and enhance the scientific yield of the Roman in cosmological research.

Astronomical simulations↗
DOE OSTI2020

Constraining the Dense Matter Equation of State with Joint Analysis of NICER and LIGO/Virgo Measurements

The Neutron Star Interior Composition Explorer collaboration recently published a joint estimate of the mass and the radius of PSR J0030+0451, derived via X-ray pulse-profile modeling. Raaijmakers et al. explored the implications of this measurement for the dense matter equation of state (EOS) using two parameterizations of the high-density EOS: a piecewise-polytropic model, and a model based on the speed of sound in neutron stars (NSs). In this work we obtain further constraints on the EOS following this approach, but we also include information about the tidal deformability of NSs from the gravitational wave signal of the compact binary merger GW170817. Further, we compare the constraints on the EOS to those set by the recent measurement of a 2.14 Me pulsar, included as a likelihood function approximated by a Gaussian, and find a small increase in information gain. To show the flexibility of our method, we also explore the possibility that GW170817 was a NS–black hole merger, which yields weaker constraints on the EOS.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1972

Signal sequence detection given noisy, common background image sets.

The optimum processing (likelihood functional) is found for a set of M images, each the sum of a member of a signal sequence due to an object to be detected and its parameters estimated, a sample function of a noise field, and a sample function of a common background field. The noise fields are independent, zero mean, white Gaussian fields, all independent of the background field. The latter is assumed to be either (1) completely unknown or of known mean and covariance functions with (2) a certain fluctuation property or (3) Gaussian. Three equivalent forms of the optimum processing are found: (1) a summation of generalized matched filterings of the images, (2) a summation of matched filtering of certain generalized differences of the images, and (3) a summation of 'estimator-correlator' type filterings. The detection performance and optimum signal/image selection under the Neyman-Pearson criterion is given, and is shown that optimum processor and signal design can completely eliminate any effect of the background on detectability.

Harger, R. O.↗
NASA NTRS1974

A square root formulation for the combined state-parameter estimator with application to the identification of sailplane performance

A square root formulation is presented for the discrete combined state parameter estimation problem with linear plant dynamics, Gaussian random disturbances, and constant but uncertain parameters. The estimator is a combination of the classical Kalman filter and a maximum likelihood algorithm which maximizes the parameter log-likelihood function using a first order search routine.

Froidevaux, M. R.↗
NASA NTRS1974

Ambiguity resolution in systems using Omega for position location

The lane ambiguity problem prevents the utilization of the Omega system for many applications such as locating buoys and balloons. The method of multiple lines of position introduced herein uses signals from four or more Omega stations for ambiguity resolution. The coordinates of the candidate points are determined first through the use of the Newton iterative procedure. Subsequently, a likelihood function is generated for each point, and the ambiguity is resolved by selecting the most likely point. The method was tested through simulation.

Frenkel, G.↗
NASA NTRS1975

UHMLE: Program description user guide

A program which computes maximum likelihood estimates for the general normal mixture is introduced. The program allows the user to fix any subsets of the mixture parameters; this fixed set may be redefined at various times in the iteration process. There is considerable time saved in computing the likelihoods if the diagonal form is specified. Hence, in the early iterations the diagonal assumption might be used, changing over to the full covariance mode later in the iteration process for a more refined solution. This flexibility allows the user to choose the sequence of parameter configurations in the iteration process which he feels will optimize the computation time required as well as possibly avoid convergence to suboptimal local maxima of the likelihood function.

Cobely, W. A.↗
NASA NTRS1976

Classification improvement by optimal dimensionality reduction when training sets are of small size

A computer simulation was performed to test the conjecture that, when the sizes of the training sets are small, classification in a subspace of the original data space may give rise to a smaller probability of error than the classification in the data space itself; this is because the gain in the accuracy of estimation of the likelihood functions used in classification in the lower dimensional space (subspace) offsets the loss of information associated with dimensionality reduction (feature extraction). A number of pseudo-random training and data vectors were generated from two four-dimensional Gaussian classes. A special algorithm was used to create an optimal one-dimensional feature space on which to project the data. When the sizes of the training sets are small, classification of the data in the optimal one-dimensional space is found to yield lower error rates than the one in the original four-dimensional space.

Starks, S. A.↗
NASA NTRS1976

Geologic mapping using LANDSAT data

The feasibility of automated classification for lithologic mapping with LANDSAT digital data was evaluated using three classification algorithms. The two supervised algorithms analyzed, a linear discriminant analysis algorithm and a hybrid algorithm which incorporated the Parallelepiped algorithm and the Bayesian maximum likelihood function, were comparable in terms of accuracy; however, classification was only 50 per cent accurate. The linear discriminant analysis algorithm was three times as efficient as the hybrid approach. The unsupervised classification technique, which incorporated the CLUS algorithm, delineated the major lithologic boundaries and, in general, correctly classified the most prominent geologic units. The unsupervised algorithm was not as efficient nor as accurate as the supervised algorithms. Analysis of spectral data for the lithologic units in the 0.4 to 2.5 microns region indicated that a greater separability of the spectral signatures could be obtained using wavelength bands outside the region sensed by LANDSAT.

Siegal, B. S.↗
NASA NTRS1975

Regions of constrained maximum likelihood parameter identifiability

This paper considers the parameter identification problem of general discrete-time, nonlinear, multiple-input/multiple-output dynamic systems with Gaussian-white distributed measurement errors. Knowledge of the system parameterization is assumed to be known. Regions of constrained maximum likelihood (CML) parameter identifiability are established. A computation procedure employing interval arithmetic is proposed for finding explicit regions of parameter identifiability for the case of linear systems. It is shown that if the vector of true parameters is locally CML identifiable, then with probability one, the vector of true parameters is a unique maximal point of the maximum likelihood function in the region of parameter identifiability and the CML estimation sequence will converge to the true parameters.

Lee, C.-H.↗
NASA NTRS1977

Bayesian estimation of crack initiation times from service data

Lockheed C-130 Hercules aircraft have during their service life been periodically inspected and growing cracks around rivet holes were recorded. This record has recently been used to determine the statistical distributions of crack initiation times and the distribution of initial crack sizes. When crack initiation times are calculated from such cracks, by backward extrapolation of the growth relation, the resulting distribution of crack initiation times will indicate a preponderance of short times to crack initiation. If however, such distributions are combined with the reliability of the inspection procedure, the statistical distribution of missed initiation times can be estimated. The method used is based on Bayes theorem which permits the calculation of the 'prior' distribution (initiation times before inspection) from a knowledge of the 'posterior' distribution (initiation times obtained from the inspection) and a 'likelihood function' (reliability of the inspection) procedure. The results indicate that during an early inspection a large percentage of initiation times will be missed and that the fraction of located initiation times increases during later inspections.

Heller, R. A.↗
NASA NTRS1976

Maximum likelihood identifier refinements for F-8C adaptive control

Design refinement is described for baseline F-8C adaptive flight test control laws which consist of simplified quadratic-optimal model-following control structures in the pitch and lateral directional axes. The variable gains of both axes are adjusted adaptively by an explicit on-line maximum likelihood parameter identifier. The identifier, consisting of five parallel computing channels which evaluate the likelihood functions at discrete points in parameter space, operates in pitch only, using pitch rate, normal acceleration, and elevator position measurements.

Stein, G.↗
NASA NTRS1976

Specific failure identification algorithms for the F-8

Analytical redundancy is applied to the pitch axis of an aircraft to enhance sensor fault detection. Three different designs based on monitoring Kalman filter residuals or likelihood functions were developed. Sensor failures were simulated to evaluate the performance of the algorithms on a nonlinear simulation of an F-8C aircraft. Based on requirements for sensor fault detection and preliminary simulator performance it is concluded that these algorithms have the potential for reducing the level of sensor redundancy in a digital flight control system without compromising performance.

Hartmann, G. L.↗
NASA NTRS1980

Maximum likelihood method for estimating airplane stability and control parameters from flight data in frequency domain

A frequency domain maximum likelihood method is developed for the estimation of airplane stability and control parameters from measured data. The model of an airplane is represented by a discrete-type steady state Kalman filter with time variables replaced by their Fourier series expansions. The likelihood function of innovations is formulated, and by its maximization with respect to unknown parameters the estimation algorithm is obtained. This algorithm is then simplified to the output error estimation method with the data in the form of transformed time histories, frequency response curves, or spectral and cross-spectral densities. The development is followed by a discussion on the equivalence of the cost function in the time and frequency domains, and on advantages and disadvantages of the frequency domain approach. The algorithm developed is applied in four examples to the estimation of longitudinal parameters of a general aviation airplane using computer generated and measured data in turbulent and still air. The cost functions in the time and frequency domains are shown to be equivalent; therefore, both approaches are complementary and not contradictory. Despite some computational advantages of parameter estimation in the frequency domain, this approach is limited to linear equations of motion with constant coefficients.

Klein, V.↗