Search NASA⌕ Search

SEARCH · Search NASA

Results for “random variable”

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 541 records · Page 30

A Convex Optimization Approach to Improving Suboptimal Hyperparameters of Sliced Normal Distributions

Sliced Normal (SN) distributions are a generalization of Gaussian distributions where the quadratic argument of the exponential is replaced with a sum of squares polynomial. SNs may be used to represent the distribution of a diverse set of random variables including multi-modal, non-symmetric, and skewed distributions. Unfortunately, the likelihood function of a SN includes a normalization constant and the inclusion of this normalization constant makes the likelihood a non-convex function of the hyperparameters which define the SN. In previous work, suboptimal fitting of the hyperparameters was performed by transforming the given data into a higher dimensional monomial basis and selecting the optimal hyperparameters of a Gaussian fit in this space. However, this approach did not account for the effect of lifting on the normalization constant. Indeed, it was observed that as the number of monomials is increased the likelihood of the Sliced Normal can decrease. In this paper, we increase the likelihood of Sliced Normals found using the previous method by developing a convex formulation which scales the covariance matrix of the Gaussian fit such that the likelihood of the Sliced Normal is maximized. The result is significant improvements of the log likelihood of fitted SN distributions, including a significant increase, especially for problems with 500+ monomials.

Convex optimization approach to improving suboptim↗

Galaxy Correlation Function and Local Density from Photometric Redshifts Using the Stochastic Order Redshift Technique (SORT)

The stochastic order redshift technique (SORT) is a simple, efficient, and robust method to improve cosmological redshift measurements. The method relies upon having a small (∼10 per cent) reference sample of high-quality redshifts. Within pencil- beam-like sub-volumes surrounding each galaxy, we use the precise dN/dz distribution of the reference sample to recover new redshifts and assign them one-to-one to galaxies such that the original rank order of redshifts is preserved. Preserving the rank order is motivated by the fact that random variables drawn from Gaussian probability density functions with different means but equal standard deviations satisfy stochastic ordering. This process is repeated for sub-volumes surrounding each galaxy in the survey. This results in every galaxy being assigned multiple ‘recovered’ redshifts from which a new redshift estimate is determined. An earlier paper applied SORT to a mock Sloan Digital Sky Survey at z 0.2 and accurately recovered the two-point correlation function (2PCF) on scales > 4 h−1Mpc. In this paper, we test the performance of SORT in surveys spanning the redshift range 0.75 < z < 2.25. We used two mock surveys extracted from the Small MultiDark–Planck and Bolshoi–Planck N-body simulations with dark matter haloes that were populated by the Santa Cruz semi-analytic model. We find that SORT overall improves redshift estimates, accurately recovers the redshift-space 2PCF ξ (s) on scales > 2.5 h−1Mpc, and provides improved local density estimates in regions of average or higher density, which may allow for improved understanding of how galaxy properties relate to their environments.

James Kakos↗

Extended Kalman Filter Performance on the Artemis-1 Mission

The Artemis Program is NASA’s campaign to explore the Moon and beyond. Artemis-1, the uncrewed exoLEO test flight of the Orion spacecraft, was completed in 2022. There were four navigation Extended Kalman Filters (EKFs) that are part of the Orion navigation system. The Atmospheric Extended Kalman Filter (ATMEKF) estimates the vehicle position, velocity, and attitude (referred to as the vehicle state) during the ascent and entry phases of flight. Once Orion is outside of Earths atmosphere, the Earth Orbit Extended Kalman Filter (EOEKF) and CisLunar Extended Kalman Filter (CLEKF) estimate the translational states, depending on the phase of flight, while the Attitude Extended Kalman Filter (ATTEKF) estimates the rotational state of the vehicle. The Kalman filters propagate the vehicle state forward in time using a combination of dynamics models and the output data from the Inertial Measurement Unit (IMU). The filters update the vehicle states and associated uncertainties, in the form of the covariance matrix, using pseudorange measurements from GPS (in ATMEKF/EOEKF), optical navigation measurements of the Earth or Moon (in CLEKF), and star tracker measurements (in ATTEKF). Simultaneously, the Kalman filters estimate error sources in the sensors, which are included in the state vectors as Exponentially Correlated Random Variables (ECRVs). This paper will summarize the performance of these filters during the Artemis-1 mission.

Artemis-1↗

Romie: A Domain-Independent Tool for Computer-Aided Robust Operations Management

Romie is a decision support tool based on AI's latest advances in the domain of robust scheduling. Unlike all its predecessors, the tool allows to (i) visually model the operational problem and context entirely (ii) optimize to find near-optimal schedules while taking uncertainty into account and deals with (iii) a combination of various {key performance indicators (KPIs). It comes with a web user interface. Part or all of the modelled activities may be associated to random variables describing their stochastic durations, in order to produce schedules that are robust w.r.t. temporal uncertainty. Hence, depending on the pursued KPIs, the schedules maximize a combination of the following terms: the probability of satisfying the problem constraints, the expected return/efficiency, the expected outcome quality, and even the operators' wellness by minimizing its expected extra-hours. Initially developed for spatial exploration and demonstration in the context of Mars analog missions, this versatile tool is here applied to operations management in both biotechnology manufacturing and robots parametrization in a cave exploration context.

Chien, Steve A.↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

Higher-Order Statistical Moments of Predicted Sonic Boom Waveforms Through Turbulence

Sonic booms generated by supersonic aircraft are affected by turbulence in the atmospheric boundary layer through which they propagate. Turbulence effects lead to random variability of the sonic boom waveforms measured on the ground, complicating the prediction of such waveforms. As an initial effort to predict the waveform variability, the solution of the coherent or mean sonic boom waveform has previously been formulated by the author. The current paper extends the formulation to derive an expression of the second-order statistical moment necessary to calculate the variance of the spectral amplitudes. Since the derivation uses a full wave equation, results using the derived expression will be compared with those obtained using a parabolic approximation. In order to fully quantify the uncertainty of our predictions, the higher order statistical moments are also formulated and are shown to be approximately zero. Consequently, the probability density function (pdf) of the spectral amplitudes is predicted to be Gaussian. The formulation is further extended to determine the pdf of the loudness of sonic booms and quantify the uncertainties associated with the loudness prediction. Results from the formulation are compared with available flight test data.

sonic booms↗

Evaluation of Finite Impulse Response Filters for Turbulence Effects on Sonic Booms

Turbulence effects on sonic booms lead to random variability of sonic boom waveforms measured on the ground, complicating the prediction of such waveforms using sonic boom propagation codes that do not account for turbulence effects. The NASA PCBoom software is one such code shown to accurately predict sonic booms above the atmospheric boundary layer but not those on the ground. Analyses of measured sonic booms show that, on average, the turbulence effects result in sonic boom loudness reduction, on average, that increases with propagation distance and turbulence strength. To efficiently account for such effects, a signal processing-based approach has been developed at NASA using finite impulse response filters derived from predicted waveforms by solving a nonlinear parabolic equation. Analyses indicate that the mean loudness reduction obtained using the filters does not increase with propagation distance or with increasing turbulence strength, in disagreement with flight test data. An alternative approach to the filters is currently under development employing the multiple scattering theory (MST) of wave propagation. Available results from the physics-based MST approach are used to evaluate the predictive capability of the filters, suggesting that the filters can severely underestimate the prediction of the MST approach.

sonic booms↗

Evaluation of Finite Impulse Response Filters for Turbulence Effects on Sonic Booms

Turbulence effects on sonic booms lead to random variability of sonic boom waveforms measured on the ground, complicating the prediction of such waveforms using sonic boom propagation codes that do not account for turbulence effects. The NASA PCBoom software is one such code shown to accurately predict sonic booms above the atmospheric boundary layer but not those on the ground. Analyses of measured sonic booms show that, on average, the turbulence effects result in sonic boom loudness reduction, on average, that increases with propagation distance and turbulence strength. To efficiently account for such effects, a signal processing-based approach has been developed at NASA using finite impulse response filters derived from predicted waveforms by solving a nonlinear parabolic equation. Analyses indicate that the mean loudness reduction obtained using the filters does not increase with propagation distance or with increasing turbulence strength, in disagreement with flight test data. An alternative approach to the filters is currently under development employing the multiple scattering theory (MST) of wave propagation. Available results from the physics-based MST approach are used to evaluate the predictive capability of the filters, suggesting that the filters can severely underestimate the prediction of the MST approach.

sonic booms↗

Data-free inference of the joint distribution of uncertain model parameters.

It is known that, in general, the correlation structure in the joint distribution of model parameters is critical to the uncertainty analysis of that model. Very often, however, studies in the literature only report nominal values for parameters inferred from data, along with confidence intervals for these parameters, but no details on the correlation or full joint distribution of these parameters. When neither posterior nor data are available, but only summary statistics such as nominal values and confidence intervals, a joint PDF must be chosen. Given the summary statistics it may not be reasonable nor necessary to assume the parameters are independent random variables. We demonstrate, using a Bayesian inference procedure, how to construct a posterior density for the parameters exhibiting self consistent correlations, in the absence of data, given (1) the fit-model, (2) nominal parameter values, (3) bounds on the parameters, and (4) a postulated statistical model, around the fit-model, for the missing data. Our approach ensures external Bayesian updating while marginalizing over possible data realizations. We then address the matching of given parameter bounds through the choice of hyperparameters, which are introduced in postulating the statistical model, but are not given nominal values. We discuss some possible approaches, including (1) inferring them in a separate Bayesian inference loop and (2) optimization. We also perform an empirical evaluation of the algorithm showing the posterior obtained with this data free inference compares well with the true posterior obtained from inference against the full data set.

99 GENERAL AND MISCELLANEOUS↗

Data-free inference of uncertain model parameters.

It is known that, in general, the correlation structure in the joint distribution of model parameters is critical to the uncertainty analysis of that model. Very often, however, studies in the literature only report nominal values for parameters inferred from data, along with confidence intervals for these parameters, but no details on the correlation or full joint distribution of these parameters. When neither posterior nor data are available, but only summary statistics such as nominal values and confidence intervals, a joint PDF must be chosen. Given the summary statistics it may not be reasonable nor necessary to assume the parameters are independent random variables. We demonstrate, using a Bayesian inference procedure, how to construct a posterior density for the parameters exhibiting self consistent correlations, in the absence of data, given (1) the fit-model, (2) nominal parameter values, (3) bounds on the parameters, and (4) a postulated statistical model, around the fit-model, for the missing data. Our approach ensures external Bayesian updating while marginalizing over possible data realizations. We then address the matching of given parameter bounds through the choice of hyperparameters, which are introduced in postulating the statistical model, but are not given nominal values. We discuss some possible approaches, including (1) inferring them in a separate Bayesian inference loop and (2) optimization. We also perform an empirical evaluation of the algorithm showing the posterior obtained with this data free inference compares well with the true posterior obtained from inference against the full data set.

99 GENERAL AND MISCELLANEOUS↗

Uncertainty quantification in reacting flow.

Chemically reacting flow models generally involve inputs and parameters that are determined from empirical measurements, and therefore exhibit a certain degree of uncertainty. Estimating the propagation of this uncertainty into computational model output predictions is crucial for purposes of reacting flow model validation, model exploration, as well as design optimization. Recent years have seen great developments in probabilistic methods and tools for efficient uncertainty quantification (UQ) in computational models. These tools are grounded in the use of Polynomial Chaos (PC) expansions for representation of random variables. The utility and effectiveness of PC methods have been demonstrated in a range of physical models, including structural mechanics, transport in porous media, fluid dynamics, aeronautics, heat transfer, and chemically reacting flow. While high-dimensionality remains nominally an ongoing challenge, great strides have been made in dealing with moderate dimensionality along with non-linearity and oscillatory dynamics. In this talk, I will give an overview of UQ in chemical systems. I will cover both: (1) the estimation of uncertain input parameters from empirical data, and (2) the forward propagation of parametric uncertainty to model outputs. I will cover the basics of forward PC UQ methods with examples of their use. I will also highlight the need for accurate estimation of the joint probability density over the uncertain parameters, in order to arrive at meaningful estimates of model output uncertainties. Finally, I will discuss recent developments on the inference of this density given partial information from legacy experiments, in the absence of raw data.

99 GENERAL AND MISCELLANEOUS↗

Uncertainty quantification in reacting flow.

Chemically reacting flow models generally involve inputs and parameters that are determined from empirical measurements, and therefore exhibit a certain degree of uncertainty. Estimating the propagation of this uncertainty into computational model output predictions is crucial for purposes of reacting flow model validation, model exploration, as well as design optimization. Recent years have seen great developments in probabilistic methods and tools for efficient uncertainty quantification (UQ) in computational models. These tools are grounded in the use of Polynomial Chaos (PC) expansions for representation of random variables. The utility and effectiveness of PC methods have been demonstrated in a range of physical models, including structural mechanics, transport in porous media, fluid dynamics, aeronautics, heat transfer, and chemically reacting flow. While high-dimensionality remains nominally an ongoing challenge, great strides have been made in dealing with moderate dimensionality along with non-linearity and oscillatory dynamics. In this talk, I will give an overview of UQ in chemical systems. I will cover both: (1) the estimation of uncertain input parameters from empirical data, and (2) the forward propagation of parametric uncertainty to model outputs. I will cover the basics of forward PC UQ methods with examples of their use. I will also highlight the need for accurate estimation of the joint probability density over the uncertain parameters, in order to arrive at meaningful estimates of model output uncertainties. Finally, I will discuss recent developments on the inference of this density given partial information from legacy experiments, in the absence of raw data.

99 GENERAL AND MISCELLANEOUS↗

Eigenvalue analysis of uncertain ODE systems.

The Polynomial chaos expansion provides a means of representing any L2 random variable as a sum of polynomials that are orthogonal with respect to a chosen measure. Examples include the Hermite polynomials with Gaussian measure on the real line and the Legendre polynomials with uniform measure on an interval. Polynomial chaos can be used to reformulate an uncertain ODE system, using Galerkin projection, as a new, higher-dimensional, deterministic ODE system which describes the evolution of each mode of the polynomial chaos expansion. It is of interest to explore the eigenstructure of the original and reformulated ODE systems by studying the eigenvalues and eigenvectors of their Jacobians. In this talk, we study the distribution of the eigenvalues of the two Jacobians. We outline in general the location of the eigenvalues of the new system with respect to those of the original system, and examine the effect of expansion order on this distribution.

99 GENERAL AND MISCELLANEOUS↗

Simplifying Probability Elicitation and Uncertainty Modeling in Bayesian Networks

In this paper we contribute two methods that simplify the demands of knowledge elicitation for particular types of Bayesian networks. The first method simplify the task of providing probabilities when the states that a random variable takes can be described by a new, fully ordered state set in which a state implies all the preceding states. The second method leverages Dempster-Shafer theory of evidence to provide a way for the expert to express the degree of ignorance that they feel about the estimates being provided.

99 GENERAL AND MISCELLANEOUS↗

Classifying with confidence from incomplete information.

For this paper, we consider the problem of classifying a test sample given incomplete information. This problem arises naturally when data about a test sample is collected over time, or when costs must be incurred to compute the classification features. For example, in a distributed sensor network only a fraction of the sensors may have reported measurements at a certain time, and additional time, power, and bandwidth is needed to collect the complete data to classify. A practical goal is to assign a class label as soon as enough data is available to make a good decision. We formalize this goal through the notion of reliability—the probability that a label assigned given incomplete data would be the same as the label assigned given the complete data, and we propose a method to classify incomplete data only if some reliability threshold is met. Our approach models the complete data as a random variable whose distribution is dependent on the current incomplete data and the (complete) training data. The method differs from standard imputation strategies in that our focus is on determining the reliability of the classification decision, rather than just the class label. We show that the method provides useful reliability estimates of the correctness of the imputed class labels on a set of experiments on time-series data sets, where the goal is to classify the time-series as early as possible while still guaranteeing that the reliability threshold is met.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Delineating Facies Spatial Distribution by Integrating Ensemble Data Assimilation and Indicator Geostatistics with Level Set Transformation.

A new approach is developed to delineate the spatial distribution of discrete facies (geological units that have unique distributions of hydraulic, physical, and/or chemical properties) conditioned not only on direct data (measurements directly related to facies properties, e.g., grain size distribution obtained from borehole samples) but also on indirect data (observations indirectly related to facies distribution, e.g., hydraulic head and tracer concentration). Our method integrates for the first time ensemble data assimilation with traditional transition probability-based geostatistics. The concept of level set is introduced to build shape parameterization that allows transformation between discrete facies indicators and continuous random variables. The spatial structure of different facies is simulated by indicator models using conditioning points selected adaptively during the iterative process of data assimilation. To evaluate the new method, a two-dimensional semi-synthetic example is designed to estimate the spatial distribution and permeability of two distinct facies from transient head data induced by pumping tests. The example demonstrates that our new method adequately captures the spatial pattern of facies distribution by imposing spatial continuity through conditioning points. The new method also reproduces the overall response in hydraulic head field with better accuracy compared to data assimilation with no constraints on spatial continuity on facies.

97 MATHEMATICS AND COMPUTING↗

Karhunen-Loeve expansion analysis of uncertainties in cloud microphysical property retrievals

Here, this study proposes a methodology of quantifying uncertainties for cloud retrievals on model resolution to facilitate the comparison with model outputs. Primary component analysis is applied to reduce the dimension of random variables (up to a factor of 50) and reveal the cross correlations in the input data, making large sampling computationally feasible and uncertainty quantification accurate and reliable. Our approach has the capability of parameterizing input uncertainties and attributing the uncertainties in the retrieval output to each individual source, which allows sensitivity analysis of cloud retrieval algorithms and provides directions for improving observation instruments as well as strategies. We applied the method to characterize uncertainties in cloud ice water content (IWC) retrieved from the DOE Atmospheric Radiation Measurement (ARM) programs baseline cloud microphysical retrieval algorithm (MICROBASE). We test it with a selected ice cloud case observed on 9 March 2000 at the ARM Southern Great Plains site during its 2000 cloud intensive observing period. The test results indicate that (1) uncertainties in the output retrieved by MICROBASE are comparable amongst different retrievals; (2) The mean values obtained by our UQ method are closer to the aircraft data with less errors compared to the direct ensemble average; (3) Ice water path (IWP) generally incurred larger uncertainty in optically thin ice clouds and there was more variability in vertical in the retrieved IWC; and (4) Uncertainties in the output are mainly due to the interactions among different modes of ARM radar pro files.

54 ENVIRONMENTAL SCIENCES↗