Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “PROBABILITY DENSITY FUNCTIONS”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Size resolved particle hygroscopcity for 30, 60, and 90 nm particles collected at the EPCAPE Mount Soledad site from 04/20/2023 to 06/15/2023

Contains both the growth factor probability density function (probability is out of 200) and the average growth factors calculated by the Gysel inversion. The instrument measured three different diameters 30 nm, 60nm and 90nm each diameter was selected for an hour. During that hour, five 12-minute scans were taken scanning growth factors from 0.5-3.0. RH was consistently kept at 85%. Calibrations of the instrument with NaCl were performed on 4/26/2023 from 11:20 to 14:20, on 5/16/2023 from 11:40 to 16:00, and on 5/30/2023 from 10:20 to 14:20. Calibrations with (NH4)2SO4 were performed on 5/8/2023 from 11:45 to 14:40, on 5/23/2023 from 11:20 to 3:00, and on 6/14/2023 from 13:00 to 16:00. Time is recorded in seconds since 1/1/1904.

30 nm particle hygroscopicity↗
DOE OSTI2020

Bypassing the Energy Functional in Density Functional Theory: Direct Calculation of Electronic Energies from Conditional Probability Densities

Density functional calculations can fail for want of an accurate exchange-correlation approximation. The energy can instead be extracted from a sequence of density functional calculations of conditional probabilities (CP DFT). Simple CP approximations yield usefully accurate results for two-electron ions, the hydrogen dimer, and the uniform gas at all temperatures. CP DFT has no self-interaction error for one electron, and correctly dissociates H2, both major challenges. For warm dense matter, classical CP DFT calculations can overcome the convergence problems of Kohn-Sham DFT.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Fault isolation and fault-tolerant control for nonlinear stochastic distribution control systems with multiplicative faults

Here, in this paper, a fault isolation, diagnosis and fault tolerant control algorithm is proposed for nonlinear multiple multiplicative faults stochastic distribution control systems employing Takagi–Sugeno fuzzy system. To obtain the detailed fault information, a fault detection algorithm is introduced to discover the fault occurrence time. Then a fault isolation observer is built to produce the residual, and the error system is separated to subsystems affected only by disturbance and multiplicative faults. Moreover, a fault estimation scheme is presented to obtain the fault magnitude information. When faults occur, the system output probability density function will deviate from the desired distribution. So the model predictive control fault tolerant control scheme is needed to minimize the impact of faults as much as possible to make sure that the post fault output probability density function track the desired probability density function. The validity of the designed algorithm is demonstrated through a simulation example, where the fault tolerant control algorithm ensures that the system output probability density function still track the given output probability density function despite the complex case of multiple multiplicative faults occurring simultaneously.

42 ENGINEERING↗
DOE OSTI2025

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fault isolation and fault-tolerant control for Takagi-Sugeno fuzzy time-varying delay stochastic distribution systems

A fault isolation, estimation, and fault-tolerant control (FTC) scheme for nonlinear time-varying delay stochastic distribution control systems was presented in this paper. The Takagi-Sugeno fuzzy model was adopted to approach the nonlinear dynamics of time-varying delay systems. According to the output equivalence principle and Laplace transformation, an augmented state vector was given to solve the time-varying delay problem. When multiple actuator faults and interference occur simultaneously, fault detection, isolation and fault estimation was designed to obtained the fault information. To decouple faults and obtain the value and location information of the fault, the system was separated into two parts through the designed multiple conversion matrices, in which one subsystem was only affected by one actuator fault. This has simplified the design of fault isolation and estimation. A adaptive observer for fault estimation was given. Then, fault information such as the time, location, and size was determined. The observer gain matrices were calculated using linear matrix inequality (LMI). When a fault was detected and diagnosed, a FTC algorithm was devised using the proportional-integral control scheme to compensate the fault as much as possible. It has been shown that even if multiple faults actuator occurred simultaneously, the FTC controller still ensured the output probability density function of the system traced the desired probability density function when a fault occurred. Finally, the expected results were obtained through the simulation example, which confirmed the effectiveness of the method.

42 ENGINEERING↗
DOE OSTI2026

Distributions of Particles Accelerated by Strong Alfvénic Turbulence

This work presents a model for generating nonthermal power-law tails of particles’ energy probability density functions in turbulent collisionless plasmas, applicable to both nonrelativistic and relativistic scenarios. We propose that strong Alfvénic turbulence energizes plasma particles through curvature acceleration, particularly for particles with Larmor radii comparable to the scales of turbulence. When the energy density of the energized particles increases, the efficiency of the energy exchange process diminishes. As a result, the acceleration process saturates, leading to power-law distributions of particle momentum and energy. In the nonrelativistic case, the momentum probability density function scales as f(p)dp ∝ p −3 dp, while in the ultrarelativistic case, the energy probability density function scales as f(γ)dγ ∝ γ −3 dγ, where γ is the Lorentz factor. This model provides a unified framework for understanding particle acceleration in both energy regimes, complementing existing analytical approaches. The predicted scalings are consistent with available observations of energetic ion distributions in the heliosphere and with the findings from numerical simulations of ultrarelativistic particle acceleration in magnetically dominated plasma turbulence.

Alfven waves↗
DOE OSTI2022

Approximating Density Probability Distribution Functions Across Cosmologies

Using a suite of self-similar cosmological simulations, we measure the probability distribution functions (PDFs) of real-space density, redshift-space density, and their geometric mean. We find that the real-space density PDF is well-described by a function of two parameters: ns, the spectral slope, and σL, the linear rms density fluctuation. For redshift-space density and the geometric mean of real- and redshift-space densities, we introduce a third parameter, ${s}_{L}=\sqrt{\langle {\left({{dv}}_{\mathrm{pec}}^{L}/{dr}\right)}^{2}\rangle }/H$. We find that density PDFs for the LCDM cosmology is also well-parameterized by these three parameters. As a result, we are able to use a suite of self-similar cosmological simulations to approximate density PDFs for a range of cosmologies. We make the density PDFs publicly available and provide an analytical fitting formula for them.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Stochastic Modeling in a Multimaterial Continuum Mixture Shock Physics Code

Stochastic modelling approaches are presented to capture random effects at multiple time and length scales. Random processes that occur at the microscale produce nondeterministic effects at the macroscale. Here we present three stochastic modeling approaches that describe random processes at microscopic length scales and map these processes to the macroscopic length scale. The first stochastic modeling approach is based upon a particle based numerical technique to solve a Stochastic Differential Equation (SDE) using an arbitrary diffusion process to capture random processes at the microstructural level. The second approach prescribes a Probability Density Function (PDF) for the drift and diffusion of the random variable derived using the forward and backward Kolmogorov equations. This method requires mean and drift evolution PDF transport equations. The third approach is the coupling of multiple random variables which are dependent on each other. The relationship of the PDFs and a coupling function, known as a copula, produces a Joint Probability Density Function (JPDF). These stochastic modeling approaches are implemented into a Multiple Component (MC) shock physics computational code and used to model statistical fracture and reactive flow applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Modeling and Control Using Stochastic Distribution Control Theory for Intersection Traffic Flow

In this work, we investigated stochastic distribution control theory-based traffic signal optimization to achieve a smooth and uniform flow of vehicles through signalized intersections. In this context, the static and linear dynamic stochastic distribution models were developed to express the relationship between the signal timing and the traffic queue length together with its probability density function. Two stochastic distribution control algorithms were designed to control the signal timing at intersections such that the probability density function of the traffic queue of each intersection road segment is made as narrow and as small as possible. Also, a recursive input-output traffic queue estimation model was proposed, which is data-driven and dynamic in nature, to calculate real-time traffic queue length using traffic signal timings and loop-detector data. The control algorithms were evaluated for a one-signal corridor, two-signal corridor, and 2 x 2 network of signalized intersections. MATLAB simulation examples are provided to demonstrate the use of the proposed algorithms and comparison to the existing widely-used semi-actuated control has been made. Desired results were obtained.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Novel Data-based Stochastic Distribution Control for Non-Gaussian Stochastic Systems

In this note, we present a novel data-based approach to investigate the non-Gaussian stochastic distribution control problem. As the motivation of this note, the existing methods have been summarised regarding to the drawbacks, for example, neural network weights training for unknown stochastic distribution and so on. To overcome these disadvantages, a new transformation for dynamic probability density function is given by kernel density estimation using interpolation. Based upon this transformation, a representative model has been developed while the stochastic distribution control problem has been transformed into an optimisation problem. Then, data-based direct optimisation and identification-based indirect optimisation have been proposed. In addition, the convergences of the presented algorithms are analysed and the effectiveness of these algorithms has been evaluated by numerical examples. In summary, the contributions of this note are as follows: 1) a new data-based probability density function transformation is given; 2) the optimisation algorithms are given based on the presented model; and 3) a new research framework is demonstrated as the potential extensions to the existing stochastic distribution control.

42 ENGINEERING↗
DOE OSTI2023

Effects of baryonic feedback on the cosmic web

Here, we study the effect of baryons on the cosmic web—halos, filaments, walls, and voids. To do so, we apply a modified version of NEXUS, a cosmic web morphological analysis algorithm, to the IllustrisTNG simulations. We find that halos lose more than 10% of their mass due to baryons, mostly to filaments and a small portion to walls and voids. However, the mass transfer does not significantly shift the boundaries of structures, leaving the volume fractions of the cosmic structures largely unaffected. We quantify the effects of baryonic feedback on the power spectrum and the probability density function of the density field for individual cosmic structures. For the power spectrum, most suppression due to feedback can be accounted for by including M ≥ 10 12 M ⊙ /h halos, without considering other cosmic structures. However, when examining the probability density function of the density field, we find nearly 100% suppression of the emptiest regions and 10%-level effects (boost or suppression) in the remaining regions of filaments, walls, and voids. Our results indicate the importance of modeling the effects of baryons in the whole cosmic web, not just halos, for cosmological analysis beyond two-point statistics or field-based inferences.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Position-dependent matter density probability distribution function

Here, we introduce the position-dependent probability distribution function (PDF) of the smoothed matter field as a cosmological observable. In comparison to the PDF itself, the spatial variation of the position-dependent PDF is simpler to model and has distinct dependence on cosmological parameters. We demonstrate that the position-dependent PDF is characterized by variations in the local mean density, and we compute the linear response of the PDF to the local density using separate universe N-body simulations. The linear response of the PDF to the local density field can be thought of as the linear bias of regions of the matter field selected based on density. We provide a model for the linear response, which accurately predicts our simulation measurements. We also validate our results and test the separate universe consistency relation for the local PDF using global universe simulations. We find excellent agreement between the two, and we demonstrate that the separate universe method gives a lower variance determination of the linear response.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Robust scalable initialization for Bayesian variational inference with multi-modal Laplace approximations

Predictive modeling typically relies on Bayesian model calibration to provide uncertainty quantification. Variational inference utilizing fully independent (“mean-field”) Gaussian distributions are often used as approximate probability density functions. This simplification is attractive since the number of variational parameters grows only linearly with the number of unknown model parameters. However, the resulting diagonal covariance structure and unimodal behavior can be too restrictive to provide useful approximations of intractable Bayesian posteriors that exhibit highly non-Gaussian behavior, including multimodality. High-fidelity surrogate posteriors for these problems can be obtained by considering the family of Gaussian mixtures. Gaussian mixtures are capable of capturing multiple modes and approximating any distribution to an arbitrary degree of accuracy, while maintaining some analytical tractability. Unfortunately, variational inference using Gaussian mixtures with full-covariance structures suffers from a quadratic growth in variational parameters with the number of model parameters. The existence of multiple local minima due to strong nonconvex trends in the loss functions often associated with variational inference present additional complications, These challenges motivate the need for robust initialization procedures to improve the performance and computational scalability of variational inference with mixture models. In this work, we propose a method for constructing an initial Gaussian mixture model approximation that can be used to warm-start the iterative solvers for variational inference. The procedure begins with a global optimization stage in model parameter space. In this step, local gradient-based optimization, globalized through multistart, is used to determine a set of local maxima, which we take to approximate the mixture component centers. Around each mode, a local Gaussian approximation is constructed via the Laplace approximation. Finally, the mixture weights are determined through constrained least squares regression. The robustness and scalability of the proposed methodology is demonstrated through application to an ensemble of synthetic tests using high-dimensional, multimodal probability density functions. Here, the practical aspects of the approach are demonstrated with inversion problems in structural dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Conservative Estimation of Tail Probabilities from Limited Sample Data

Several sparse-sample uncertainty quantification (UQ) methods are compared for conservative but not overly conservative estimation of small tail probabilities involving responses that lay beyond specified thresholds in the tails of probability distributions. Sixteen very differently shaped distributions (or probability density functions, PDFs) and tail probability magnitudes ranging from 10 -5 to 10 -1 are considered in order for the study to be relevant to a wide range of risk analysis and quantification of margins and uncertainty (QMU) problems. The emphasis of the study is on limited data regimes ranging from N = 2 to 20 samples, reflective of most experimental and some expensive computational situations. Relatively simple sparse-sample UQ methods tested for this regime involve statistical tolerance interval "Equivalent Normal and related "Ensemble of Normals" and "Superdistribution (SD) approaches. (The independently derived SD is effectively equivalent to the Bayesian posterior predictive distribution given the assumptions of the derivation.) The performance of the methods was generally improved for N ≥ 5 samples with a generalized Jackknife resampling technique, which determines a tail probability estimate by averaging estimates from smaller sub-samples. Several quantitative metrics for method conservatism and accuracy of tail probability estimation are used to assess and rank the methods' performance over many random trials for each test PDF and probability magnitude. A variant of Bootstrap resampling was also tried, but did not significantly improve tail probability estimates in most cases. Detailed results are presented from over 100-million tests over the above factors that provide useful granular information on which methods or combination of methods perform best in various areas of the factor space.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Mesh-Sequenced Realizations for Evaluation of Subgrid-Scale Models for Turbulent Combustion

This paper develops a new approach for analysis of subgrid closures for turbulent combustion as modeled using direct quadrature (finite-rate chemistry) techniques. The approach, termed multiresolution analysis through mesh-sequenced realizations (MRA-MSR), conducts simultaneous, constrained large-eddy simulations on a set of hierarchically coarsened meshes. Furthermore, the availability of underlying fine-mesh (subgrid) data corresponding to coarse-mesh locations allows a clearer assessment of the effects of unresolved fluctuations on apparent reactivity. A key to MRA-MSR is the correlation of eddy structures at coarser mesh levels, which is facilitated by the transfer of filtered fine-mesh velocity information. A seven-mesh MRA-MSR hierarchy using three resolution levels is applied to one of the Sydney bluff-body stabilized methane–hydrogen flames. Analysis of the simultaneously evolved data at different resolution levels reveals several interesting trends. First, at high Damköhler numbers, there is clear evidence of attenuation of apparent reactivity due to the effects of unresolved fluctuations. Secondly, single-point, single-time filtered density functions of a normalized subgrid Damköhler number show a characteristic beta probability density function (PDF) form and display evidence of scale similarity. Interrogation of the MRA-MSR database also shows that the recently-proposed least-squares minimization (LSM) turbulence–chemistry interaction model can account for the observed diminishment in reactivity at high Damköhler numbers but cannot reduce scatter significantly. A new form of the LSM model, which makes use of the normalized subgrid Damköhler number beta PDF distribution, performs slightly better than the original model, illustrating the potential of MRA-MSR both in assessing existing closure concepts and in developing new ones.

42 ENGINEERING↗
DOE OSTI2020

Data-Driven Approach for Uncertainty Propagation and Reachability Analysis in Dynamical Systems

In this paper, we propose a data-driven approach for uncertainty propagation and reachability analysis in a dynamical system. The proposed approach relies on the linear lifting of a nonlinear system using linear Perron-Frobenius (P-F) and Koopman operators. Here, the uncertainty can be characterized in terms of the moments of a probability density function. We demonstrate how the P-F and Koopman operators are used for propagating the moments. Time-series data is used for the finite-dimensional approximation of the linear operators, thereby enabling data-driven approach for moment propagation. Simulation results are presented to demonstrate the effectiveness of the proposed method.

42 ENGINEERING↗
DOE OSTI2023

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗