enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Probability box - Wikipedia

    en.wikipedia.org/wiki/Probability_box

    A p-box (probability box). A probability box (or p-box) is a characterization of uncertain numbers consisting of both aleatoric and epistemic uncertainties that is often used in risk analysis or quantitative uncertainty modeling where numerical calculations must be performed. Probability bounds analysis is used to make arithmetic and logical ...

  3. Applications of p-boxes and probability bounds analysis

    en.wikipedia.org/wiki/Applications_of_p-boxes...

    Analysis of species sensitivity distributions [3] Sensitivity analysis in aerospace engineering of the buckling load of the frontskirt of the Ariane 5 launcher [4] ODE models of chemical reactor dynamics [5] [6] Pharmacokinetic variability of inhaled VOCs [7] Groundwater modeling [8] Bounding failure probability for series systems [9]

  4. Probability bounds analysis - Wikipedia

    en.wikipedia.org/wiki/Probability_bounds_analysis

    The probability that an uncertain number represented by a p-box D is less than zero is the interval Pr(D < 0) = [F(0), F̅(0)], where F̅(0) is the left bound of the probability box D and F(0) is its right bound, both evaluated at zero. Two uncertain numbers represented by probability boxes may then be compared for numerical magnitude with the ...

  5. Box–Behnken design - Wikipedia

    en.wikipedia.org/wiki/Box–Behnken_design

    The design should be sufficient to fit a quadratic model, that is, one containing squared terms, products of two factors, linear terms and an intercept. The ratio of the number of experimental points to the number of coefficients in the quadratic model should be reasonable (in fact, their designs kept in the range of 1.5 to 2.6).

  6. Balls into bins problem - Wikipedia

    en.wikipedia.org/wiki/Balls_into_bins_problem

    The efficiency of accessing a key depends on the length of its list. If we use a single hash function which selects locations with uniform probability, with high probability the longest chain has (⁡ ⁡ ⁡) keys. A possible improvement is to use two hash functions, and put each new key in the shorter of the two lists.

  7. Ljung–Box test - Wikipedia

    en.wikipedia.org/wiki/Ljung–Box_test

    The Ljung–Box test (named for Greta M. Ljung and George E. P. Box) is a type of statistical test of whether any of a group of autocorrelations of a time series are different from zero. Instead of testing randomness at each distinct lag, it tests the "overall" randomness based on a number of lags, and is therefore a portmanteau test .

  8. Bertrand's box paradox - Wikipedia

    en.wikipedia.org/wiki/Bertrand's_box_paradox

    Bertrand's box paradox is a veridical paradox in elementary probability theory. It was first posed by Joseph Bertrand in his 1889 work Calcul des Probabilités. There are three boxes: a box containing two gold coins, a box containing two silver coins, a box containing one gold coin and one silver coin.

  9. Coupon collector's problem - Wikipedia

    en.wikipedia.org/wiki/Coupon_collector's_problem

    In probability theory, the coupon collector's problem refers to mathematical analysis of "collect all coupons and win" contests. It asks the following question: if each box of a given product (e.g., breakfast cereals) contains a coupon, and there are n different types of coupons, what is the probability that more than t boxes need to be bought ...