Academic
Publications
Bounds on belief and plausibility of functionally propagated random sets

Bounds on belief and plausibility of functionally propagated random sets,10.1109/NAFIPS.2002.1018095,Cliff Joslyn,Jon C. Helton

Bounds on belief and plausibility of functionally propagated random sets   (Citations: 2)
BibTex | RIS | RefWorks Download
We are interested in improving risk and reliability analysis of complex systems where our knowledge of system performance is provided by large simulation codes, and where moreover input parameters are known only imprecisely. Such imprecision lends itself to interval representations of parameter values, and thence to quantifying our uncertainty through Dempster-Shafer or Probability Bounds representations on the input space. In this context, the simulation code acts as a large "black box" function f, transforming one input Dempster-Shafer structure on the line into an output random interval f(A). Our quantification of output uncertainty is then based on this output random interval.. If some properties of f are known, then some information about f(A) can be determined. But when f is a pure black box, we must resort to sampling approaches. We present the basic formalism of a Monte Carlo approach to sampling a functionally propagated general random set, as opposed to a random interval. We show that the results of straightforward formal definitions are mathematically coherent, in the sense that bounding and convergence properties are achieved.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: