Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random variables”

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 127 records · Page 7

Probability techniques for reliability analysis of composite materials

Traditional design approaches for composite materials have employed deterministic criteria for failure analysis. New approaches are required to predict the reliability of composite structures since strengths and stresses may be random variables. This report will examine and compare methods used to evaluate the reliability of composite laminae. The two types of methods that will be evaluated are fast probability integration (FPI) methods and Monte Carlo methods. In these methods, reliability is formulated as the probability that an explicit function of random variables is less than a given constant. Using failure criteria developed for composite materials, a function of design variables can be generated which defines a 'failure surface' in probability space. A number of methods are available to evaluate the integration over the probability space bounded by this surface; this integration delivers the required reliability. The methods which will be evaluated are: the first order, second moment FPI methods; second order, second moment FPI methods; the simple Monte Carlo; and an advanced Monte Carlo technique which utilizes importance sampling. The methods are compared for accuracy, efficiency, and for the conservativism of the reliability estimation. The methodology involved in determining the sensitivity of the reliability estimate to the design variables (strength distributions) and importance factors is also presented.

Wetherhold, Robert C.↗

A Probabilistic Framework for the Validation and Certification of Computer Simulations

The paper presents a methodology for quantifying, propagating, and managing the uncertainty in the data required to initialize computer simulations of complex phenomena. The purpose of the methodology is to permit the quantitative assessment of a certification level to be associated with the predictions from the simulations, as well as the design of a data acquisition strategy to achieve a target level of certification. The value of a methodology that can address the above issues is obvious, specially in light of the trend in the availability of computational resources, as well as the trend in sensor technology. These two trends make it possible to probe physical phenomena both with physical sensors, as well as with complex models, at previously inconceivable levels. With these new abilities arises the need to develop the knowledge to integrate the information from sensors and computer simulations. This is achieved in the present work by tracing both activities back to a level of abstraction that highlights their commonalities, thus allowing them to be manipulated in a mathematically consistent fashion. In particular, the mathematical theory underlying computer simulations has long been associated with partial differential equations and functional analysis concepts such as Hilbert spares and orthogonal projections. By relying on a probabilistic framework for the modeling of data, a Hilbert space framework emerges that permits the modeling of coefficients in the governing equations as random variables, or equivalently, as elements in a Hilbert space. This permits the development of an approximation theory for probabilistic problems that parallels that of deterministic approximation theory. According to this formalism, the solution of the problem is identified by its projection on a basis in the Hilbert space of random variables, as opposed to more traditional techniques where the solution is approximated by its first or second-order statistics. The present representation, in addition to capturing significantly more information than the traditional approach, facilitates the linkage between different interacting stochastic systems as is typically observed in real-life situations.

Ghanem, Roger↗

Scale Mixtures of Frechet Distributions as Asymptotic Approximations of Extreme Precipitation

This paper is a further development of the results of [20] where, based on the negative binomial model for the duration of wet periods measured in days [16], an asymptotic approximation was proposed for the distribution of the maximum daily precipitation volume within a wet period. This approximation has the form of a scale mixture of the Fr´echet distribution with the gamma mixing distribution and coincides with the distribution of a positive power of a random variable having the Snedecor–Fisher distribution. Here we extend this result to the mth extremes, m ∈ ℕ, and sample quantiles. The proof of this result is based on the representation of the negative binomial distribution as a mixed geometric (and hence, mixed Poisson) distribution [17] and limit theorems for extreme order statistics in samples with random sizes having mixed Poisson distributions [10]. Some analytic properties of the obtained limit distribution are described. In particular, it is demonstrated that under certain conditions the limit distribution of the maximum precipitation is mixed exponential and hence, is infinitely divisible. It is shown that under the same conditions this limit distribution can be represented as a scale mixture of stable or Weibull or Pareto or folded normal laws. The corresponding product representations for the limit random variable can be used for its computer simulation. The results of fitting this distribution to real data are presented illustrating high adequacy of the proposed model. It is also shown that the limit distribution of sample quantiles is the well-known Student distribution. Several methods are proposed for the estimation of the parameters of the asymptotic distributions. The obtained mixture representations for the limit laws and the corresponding asymptotic approximations provide better insight into the nature of mixed probability (“Bayesian”) models.

97 MATHEMATICS AND COMPUTING↗

Probabilistic evaluation of fuselage-type composite structures

A methodology is developed to computationally simulate the uncertain behavior of composite structures. The uncertain behavior includes buckling loads, natural frequencies, displacements, stress/strain etc., which are the consequences of the random variation (scatter) of the primitive (independent random) variables in the constituent, ply, laminate and structural levels. This methodology is implemented in the IPACS (Integrated Probabilistic Assessment of Composite Structures) computer code. A fuselage-type composite structure is analyzed to demonstrate the code's capability. The probability distribution functions of the buckling loads, natural frequency, displacement, strain and stress are computed. The sensitivity of each primitive (independent random) variable to a given structural response is also identified from the analyses.

Shiao, Michael C.↗

Probabilistic Evaluation of Fuselage-Type Composite Structures

A methodology is developed to simulate computationally the uncertain behavior of composite structures. The uncertain behavior includes buckling loads, natural frequencies, displacements, stress/strain, etc., which are the consequences of the random variation (scatter) of the primitive (independent random) variables in the constituent, plv. laminate and structural levels. This methodology is implemented in a computer code integrated probabilistic assessment of composite structures (IPACS). A fuselage-type composite structure is analyzed to demonstrate the code's capability . The probability distribution functions of the buckling loads, natural frequency, displacement, strain and stress are computed. The sensitivity of each primitive (independent random) variable to a given structural response is also identified from the analyses.

Shiao, Michael C.↗

Learning planar Ising models

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.

97 MATHEMATICS AND COMPUTING↗

A data based random number generator for a multivariate distribution (using stochastic interpolation)

Let X be a K-dimensional random variable serving as input for a system with output Y (not necessarily of dimension k). given X, an outcome Y or a distribution of outcomes G(Y/X) may be obtained either explicitly or implicity. The situation is considered in which there is a real world data set X sub j sub = 1 (n) and a means of simulating an outcome Y. A method for empirical random number generation based on the sample of observations of the random variable X without estimating the underlying density is discussed.

Thompson, J. R.↗

A stringy mechanism for a small cosmological constant — multi-moduli cases

Based on the properties of probability distributions of functions of random variables, we proposed earlier a simple stringy mechanism that prefers the meta-stable vacua with a small cosmological constant Λ. As an illustration of this approach, we study in this paper particularly simple but non-trivial models of the Kähler uplift in the large volume flux compactification scenario in Type IIB string theory, where all parameters introduced in the model are treated either as fixed constants motivated by physics, or as random variables with some given uniform probability distributions. We determine the value w{sub 0} of the superpotential W{sub 0} at the supersymmetric minima, and find that the resulting probability distribution P(w{sub 0}) peaks at w{sub 0} = 0; furthermore, this peaking behavior strengthens as the number of complex structure moduli increases. The resulting probability distribution P(Λ) for meta-stable vacua also peaks as Λ → 0, for both positive and negative Λ. This peaking/divergent behavior of P(Λ) strengthens as the number of moduli increases. In some scenarios for Λ > 0, the likely value of Λ decreases exponentially as the number of moduli increases. The light cosmological moduli issue accompanying a very small Λ is also mentioned.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational methods for efficient structural reliability and reliability sensitivity analysis

This paper presents recent developments in efficient structural reliability analysis methods. The paper proposes an efficient, adaptive importance sampling (AIS) method that can be used to compute reliability and reliability sensitivities. The AIS approach uses a sampling density that is proportional to the joint PDF of the random variables. Starting from an initial approximate failure domain, sampling proceeds adaptively and incrementally with the goal of reaching a sampling domain that is slightly greater than the failure domain to minimize over-sampling in the safe region. Several reliability sensitivity coefficients are proposed that can be computed directly and easily from the above AIS-based failure points. These probability sensitivities can be used for identifying key random variables and for adjusting design to achieve reliability-based objectives. The proposed AIS methodology is demonstrated using a turbine blade reliability analysis problem.

Wu, Y.-T.↗

Learning planar ising models

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus our attention on the class of planar Ising models, for which inference is tractable using techniques of statistical physics [Kac and Ward; Kasteleyn]. Based on these techniques and recent methods for planarity testing and planar embedding [Chrobak and Payne], we propose a simple greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. We present the results of numerical experiments evaluating the performance of our algorithm.

36 MATERIALS SCIENCE↗

Scaling exponents for ordered maxima

We study extreme value statistics of multiple sequences of random variables. For each sequence with N variables, independently drawn from the same distribution, the running maximum is defined as the largest variable to date. We compare the running maxima of m independent sequences and investigate the probability S N that the maxima are perfectly ordered, that is, the running maximum of the first sequence is always larger than that of the second sequence, which is always larger than the running maximum of the third sequence, and so on. The probability S N is universal: it does not depend on the distribution from which the random variables are drawn. For two sequences, S N ~N –1/2 , and in general, the decay is algebraic, S N ~N –σm , for large N. We analytically obtain the exponent σ 3 ≅1.302931 as root of a transcendental equation. Moreover, the exponents σ m grow with m, and we show that σ m ~m for large m.

97 MATHEMATICS AND COMPUTING↗

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

97 MATHEMATICS AND COMPUTING↗

On the Use of the Beta Distribution in Probabilistic Resource Assessments

The triangular distribution is a popular choice when it comes to modeling bounded continuous random variables. Its wide acceptance derives mostly from its simple analytic properties and the ease with which modelers can specify its three parameters through the extremes and the mode. On the negative side, hardly any real process follows a triangular distribution, which from the outset puts at a disadvantage any model employing triangular distributions. At a time when numerical techniques such as the Monte Carlo method are displacing analytic approaches in stochastic resource assessments, easy specification remains the most attractive characteristic of the triangular distribution. The beta distribution is another continuous distribution defined within a finite interval offering wider flexibility in style of variation, thus allowing consideration of models in which the random variables closely follow the observed or expected styles of variation. Despite its more complex definition, generation of values following a beta distribution is as straightforward as generating values following a triangular distribution, leaving the selection of parameters as the main impediment to practically considering beta distributions. This contribution intends to promote the acceptance of the beta distribution by explaining its properties and offering several suggestions to facilitate the specification of its two shape parameters. In general, given the same distributional parameters, use of the beta distributions in stochastic modeling may yield significantly different results, yet better estimates, than the triangular distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data Driven Temperature Control of Heat Exchangers

The following poster presents a couple of approaches for temperature control at heat exchanger’s exit. One of the approaches is based on using n-step ahead neural network while the other approach utilizes a combination of control + learning module for temperature control. Designing robust controllers for typical heat exchangers is very challenging primarily because of complexities associated with the synthesis of dynamics of industrial heat exchangers. Even if a dynamics model is synthesized, the accuracy of it would be called into question as there can be lot of unmodeled system dynamics and random noise in input parameters. In many situations, the degree of uncertainty in the model of system being controlled limits the utility of optimal control design. Controller can be manually tuned on the field but it is very difficult to determine manual adjustments that result in overall improvement. These practical challenges call for learning based approaches for temperature control that would result in optimal heat exchanger performance. We utilize the existing mathematical model for air-water system synthesized by Underwood and Crawford for testing our algorithms. Underwood and Crawford developed a model of heating coil by fitting a second-order non-linear equations to measurements of air and water temperature and flow rates obtained from the actual coil. The uncertainties in the model include air and water inlet temperatures and air-flow rate. These uncertainties are modeled as random variables that are sampled from a uniform distribution. The control variable is the water flow rate which is controlled for regulating the air-outlet temperature. Neural networks are frequently used in various literatures for learning time-series. We propose a modified version of neural networks known as n-step ahead neural network that take the state variables and output at time t as input to successfully predict output at time t+n. The variable n is a hyper-parameter which can be optimized based on performance constraints. The n-step ahead neural network was then trained on training data generated from experimental model to high training accuracies. This trained model performed appreciably in its objective to regulate outlet temperature of a heat exchanger. The second approach uses a combination of control and learning module for temperature regulation. The control module used is a proportional controller while the learning module used is steady state neural network. The steady state neural network is used to learn the controller output as a function of random variables and temperature set-point. The proportional controller is then used to compensate for transient behavior of linearized system around various operating points. The algorithm works effectively for temperature regulation as neural network captures the non-linear input-output behavior of closed loop system leaving proportional controller to compensate for steady state errors of a linearized plant. The proposed algorithm’s performances were evaluated against the performance of a PI controller. Further, the robustness of the algorithms were also studied in great detail under small perturbations around tuned parameters of the proposed algorithms.

Sundar, Sreenath↗

Coarse-Grained Clustering Dynamics of Heterogeneously Coupled Neurons

The formation of oscillating phase clusters in a network of identical Hodgkin–Huxley neurons is studied, along with their dynamic behavior. The neurons are synaptically coupled in an all-to-all manner, yet the synaptic coupling characteristic time is heterogeneous across the connections. In a network of N neurons where this heterogeneity is characterized by a prescribed random variable, the oscillatory single-cluster state can transition—through (possibly perturbed) period-doubling and subsequent bifurcations—to a variety of multiple-cluster states. The clustering dynamic behavior is computationally studied both at the detailed and the coarse-grained levels, and a numerical approach that can enable studying the coarse-grained dynamics in a network of arbitrarily large size is suggested. Among a number of cluster states formed, double clusters, composed of nearly equal sub-network sizes are seen to be stable; interestingly, the heterogeneity parameter in each of the double-cluster components tends to be consistent with the random variable over the entire network: Given a double-cluster state, permuting the dynamical variables of the neurons can lead to a combinatorially large number of different, yet similar “fine” states that appear practically identical at the coarse-grained level. For weak heterogeneity we find that correlations rapidly develop, within each cluster, between the neuron’s “identity” (its own value of the heterogeneity parameter) and its dynamical state. For single- and double-cluster states we demonstrate an effective coarse-graining approach that uses the Polynomial Chaos expansion to succinctly describe the dynamics by these quickly established “identity-state” correlations. This coarse-graining approach is utilized, within the equation-free framework, to perform efficient computations of the neuron ensemble dynamics.

97 MATHEMATICS AND COMPUTING↗

Optimal Eco-Driving Control of Connected and Autonomous Vehicles Through Signalized Intersections

This article focuses on the speed planning problem for connected and automated vehicles (CAVs) communicating to traffic lights. The uncertainty of traffic signal timing for signalized intersections on the road is considered. The eco-driving problem is formulated as a data-driven chance-constrained robust optimization problem. Effective red-light duration (ERD) is defined as a random variable, and describes the feasible passing time through the signalized intersections. Usually, the true probability distribution for ERD is unknown. Consequently, a data-driven approach is adopted to formulate chance constraints based on empirical sample data. This incorporates robustness into the eco-driving control problem with respect to uncertain signal timing. Dynamic programming (DP) is employed to solve the optimization problem. The simulation results demonstrate that the proposed method can generate optimal speed reference trajectories with 40% less vehicle fuel consumption, while maintaining the arrival time at a similar level compared to a modified intelligent driver model (IDM). The proposed control approach significantly improves the controller's robustness in the face of uncertain signal timing, without requiring to know the distribution of the random variable a priori.

33 ADVANCED PROPULSION SYSTEMS↗

Statistically Appraising Process Quality of Affinity Isolation Experiments

Quality affinity isolation experiments are necessary to identify valid protein-protein interactions. Biological error, processing error, and random variability can reduce the quality of an experiment, and thus hinder the identification of protein interaction pairs. Appraising affinity isolation assay quality is essential to inferring protein associations. An important step of the assay is the mass spectrometric identification of proteins. To evaluate this step, a known mixture of proteins is processed through a mass spectrometer as a quality control mixture. If the mass spectrometer yields unexpected results, the process is currently qualitatively evaluated, tuned, and reset. Statistical quality control (SQC) procedures, including the use of cumulative sum, the individual measurement, and moving range charts are implemented to analyze the stability of the mass spectrometric analysis. The SQC measures presented here can assist in establishing preliminary control limits to identify an out-of-control process and investigate assignable causes for shifts in the process mean in real-time.

59 BASIC BIOLOGICAL SCIENCES↗

Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the influence of conformational uncertainty in biomolecular solvation

Biomolecules exhibit conformational fluctuations near equilibrium states, inducing uncertainty in various biological properties in a dynamic way. We have developed a general method to quantify the uncertainty of target properties induced by conformational fluctuations. Using a generalized polynomial chaos (gPC) expansion, we construct a surrogate model of the target property with respect to varying conformational states. We also propose a method to increase the sparsity of the gPC expansion by defining a set of conformational “active space” random variables. With the increased sparsity, we employ the compressive sensing method to accurately construct the surrogate model. We demonstrate the performance of the surrogate model by evaluating fluctuation-induced uncertainty in solvent-accessible surface area for the bovine trypsin inhibitor protein system and show that the new approach offers more accurate statistical information than standard Monte Carlo approaches. Further more, the constructed surrogate model also enables us to directly evaluate the target property under various conformational states, yielding a more accurate response surface than standard sparse grid collocation methods. In particular, the new method provides higher accuracy in high-dimensional systems, such as biomolecules, where sparse grid performance is limited by the accuracy of the computed quantity of interest. Our new framework is generalizable and can be used to investigate the uncertainty of a wide variety of target properties in biomolecular systems.

coarse graining↗