Relevant bibliographies by topics / Probability bounds analysis

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Probability bounds analysis'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Probability bounds analysis.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Probability bounds analysis"

1

Enszer, Joshua A., D. Andrei Măceș, and Mark A. Stadtherr. "Probability bounds analysis for nonlinear population ecology models." Mathematical Biosciences 267 (September 2015): 97–108. http://dx.doi.org/10.1016/j.mbs.2015.06.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Enszer, Joshua A., Youdong Lin, Scott Ferson, George F. Corliss, and Mark A. Stadtherr. "Probability bounds analysis for nonlinear dynamic process models." AIChE Journal 57, no. 2 (January 10, 2011): 404–22. http://dx.doi.org/10.1002/aic.12278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cuesta, Juan A., and Carlos Matrán. "Conditional bounds and best L∞-approximations in probability spaces." Journal of Approximation Theory 56, no. 1 (January 1989): 1–12. http://dx.doi.org/10.1016/0021-9045(89)90128-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hughett, Paul. "Error Bounds for Numerical Inversion of a Probability Characteristic Function." SIAM Journal on Numerical Analysis 35, no. 4 (August 1998): 1368–92. http://dx.doi.org/10.1137/s003614299631085x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Feng, Geng. "Sensitivity Analysis for Systems under Epistemic Uncertainty with Probability Bounds Analysis." International Journal of Computer Applications 179, no. 31 (April 17, 2018): 1–6. http://dx.doi.org/10.5120/ijca2018915892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Jing, and Xin Geng. "Theoretical Analysis of Label Distribution Learning." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5256–63. http://dx.doi.org/10.1609/aaai.v33i01.33015256.

Full text
Abstract:
As a novel learning paradigm, label distribution learning (LDL) explicitly models label ambiguity with the definition of label description degree. Although lots of work has been done to deal with real-world applications, theoretical results on LDL remain unexplored. In this paper, we rethink LDL from theoretical aspects, towards analyzing learnability of LDL. Firstly, risk bounds for three representative LDL algorithms (AA-kNN, AA-BP and SA-ME) are provided. For AA-kNN, Lipschitzness of the label distribution function is assumed to bound the risk, and for AA-BP and SA-ME, rademacher complexity
APA, Harvard, Vancouver, ISO, and other styles
7

Aydın, Ata Deniz, and Aurelian Gheondea. "Probability Error Bounds for Approximation of Functions in Reproducing Kernel Hilbert Spaces." Journal of Function Spaces 2021 (April 30, 2021): 1–15. http://dx.doi.org/10.1155/2021/6617774.

Full text
Abstract:
We find probability error bounds for approximations of functions f in a separable reproducing kernel Hilbert space H with reproducing kernel K on a base space X , firstly in terms of finite linear combinations of functions of type K x i and then in terms of the projection π x n on span K x i i = 1 n , for random sequences of points x = x i i in X . Given a probability measure P , letting P K be the measure defined by d P K x = K x , x d P x , x ∈ X , our approach is based on the nonexpansive operator L 2 X ; P K ∋ λ ↦ L P , K λ ≔ ∫ X λ x K x d P x ∈ H , where the integral exists in the Bochner
APA, Harvard, Vancouver, ISO, and other styles
8

Block, Hentry W., Tim Costigan, and Allan R. Sampson. "Product-Type Probability Bounds of Higher Order." Probability in the Engineering and Informational Sciences 6, no. 3 (July 1992): 349–70. http://dx.doi.org/10.1017/s0269964800002588.

Full text
Abstract:
GIaz and Johnson [14] introduce ith-order product-type approximations, βi, i =1,…n − 1, for Pn = P(X1 ≤c1, X2 ≤ c2,…Xn≤ cn) and show that Pn≥ βn−1 ≥ βn−2 ≥… ≥ β2 ≥ β1 when X is MTP2. In this article, it is shown thatunder weaker positive dependence conditions. For multivariate normal distributions, these conditions reduce to cov(Xi,Xj) ≥ 0 for 1 ≤ i < j ≤ n and cov(Xi,Xj| Xj−1) ≥ 0 for 1 ≤ i < j − 1, j = 3,…,n. This is applied to group sequential analysis with bivariate normal responses. Conditions for Pn ≥ β3 ≥ β2 ≥β1 are also derived. Bound conditions are also obtained that ensure that
APA, Harvard, Vancouver, ISO, and other styles
9

McCormick, William P., and You Sung Park. "Asymptotic analysis of extremes from autoregressive negative binomial processes." Journal of Applied Probability 29, no. 4 (December 1992): 904–20. http://dx.doi.org/10.2307/3214723.

Full text
Abstract:
It is well known that most commonly used discrete distributions fail to belong to the domain of maximal attraction for any extreme value distribution. Despite this negative finding, C. W. Anderson showed that for a class of discrete distributions including the negative binomial class, it is possible to asymptotically bound the distribution of the maximum. In this paper we extend Anderson's result to discrete-valued processes satisfying the usual mixing conditions for extreme value results for dependent stationary processes. We apply our result to obtain bounds for the distribution of the maxim
APA, Harvard, Vancouver, ISO, and other styles
10

Chib, Siddhartha, and Ram C. Tiwari. "Extreme Bounds Analysis in the Kalman Filter." American Statistician 45, no. 2 (May 1991): 113. http://dx.doi.org/10.2307/2684370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Probability bounds analysis"

1

Ling, Jay Michael. "Managing Information Collection in Simulation-Based Design." Thesis, Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11504.

Full text
Abstract:
An important element of successful engineering design is the effective management of resources to support design decisions. Design decisions can be thought of as having two phasesa formulation phase and a solution phase. As part of the formulation phase, engineers must decide how much information to collect and which models to use to support the design decision. Since more information and more accurate models come at a greater cost, a cost-benefit trade-off must be made. Previous work has considered such trade-offs in decision problems when all aspects of the decision problem can be repres
APA, Harvard, Vancouver, ISO, and other styles
2

Dankwah, Charles O. "Investigating an optimal decision point for probability bounds analysis models when used to estimate remedial soil volumes under uncertainty at hazardous waste sites." ScholarWorks, 2010. https://scholarworks.waldenu.edu/dissertations/776.

Full text
Abstract:
Hazardous waste site remediation cost estimation requires a good estimate of the contaminated soil volume. The United States Environmental Protection Agency (U.S. EPA) currently uses deterministic point values to estimate soil volumes but the literature suggests that probability bounds analysis (PBA) is the more accurate method to make estimates under uncertainty. The underlying statistical theory is that they are more accurate than deterministic estimates because probabilistic estimates account for data uncertainties. However, the literature does not address the problem of selecting an optima
APA, Harvard, Vancouver, ISO, and other styles
3

Dixon, William J., and bill dixon@dse vic gov au. "Uncertainty in Aquatic Toxicological Exposure-Effect Models: the Toxicity of 2,4-Dichlorophenoxyacetic Acid and 4-Chlorophenol to Daphnia carinata." RMIT University. Biotechnology and Environmental Biology, 2005. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20070119.163720.

Full text
Abstract:
Uncertainty is pervasive in risk assessment. In ecotoxicological risk assessments, it arises from such sources as a lack of data, the simplification and abstraction of complex situations, and ambiguities in assessment endpoints (Burgman 2005; Suter 1993). When evaluating and managing risks, uncertainty needs to be explicitly considered in order to avoid erroneous decisions and to be able to make statements about the confidence that we can place in risk estimates. Although informative, previous approaches to dealing with uncertainty in ecotoxicological modelling have been found to b
APA, Harvard, Vancouver, ISO, and other styles
4

Gobard, Renan. "Fluctuations dans des modèles de boules aléatoires." Thesis, Rennes 1, 2015. http://www.theses.fr/2015REN1S025/document.

Full text
Abstract:
Dans ce travail de thèse, nous étudions les fluctuations macroscopiques dans un modèle de boules aléatoires. Un modèle de boules aléatoires est une agrégation de boules dans Rd dont les centres et les rayons sont aléatoires. On marque également chaque boule par un poids aléatoire. On considère la masse M induite par le système de boules pondérées sur une configuration μ de Rd. Pour réaliser l’étude macroscopique des fluctuations de M, on réalise un "dézoom" sur la configuration de boules. Mathématiquement cela revient à diminuer le rayon moyen tout en augmentant le nombre m
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Probability bounds analysis"

1

Kalashnikov, Vladimir Vi͡acheslavovich. Geometric sums, bounds for rare events with applications: Risk analysis, reliability, queueing. Dordrecht: Kluwer Academic, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kalashnikov, Vladimir. Geometric Sums: Bounds for Rare Events with Applications: Risk Analysis, Reliability, Queueing. Dordrecht: Springer Netherlands, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rüschendorf, Ludger. Mathematical Risk Analysis: Dependence, Risk Bounds, Optimal Allocations and Portfolios. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

1975-, Sims Robert, and Ueltschi Daniel 1969-, eds. Entropy and the quantum II: Arizona School of Analysis with Applications, March 15-19, 2010, University of Arizona. Providence, R.I: American Mathematical Society, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rüschendorf, Ludger. Mathematical Risk Analysis: Dependence, Risk Bounds, Optimal Allocations and Portfolios. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rüschendorf, Ludger. Mathematical Risk Analysis: Dependence, Risk Bounds, Optimal Allocations and Portfolios. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ashby, F. Gregory, and Fabian A. Soto. Multidimensional Signal Detection Theory. Edited by Jerome R. Busemeyer, Zheng Wang, James T. Townsend, and Ami Eidels. Oxford University Press, 2015. http://dx.doi.org/10.1093/oxfordhb/9780199957996.013.2.

Full text
Abstract:
Multidimensional signal detection theory is a multivariate extension of signal detection theory that makes two fundamental assumptions, namely that every mental state is noisy and that every action requires a decision. The most widely studied version is known as general recognition theory (GRT). General recognition theory assumes that the percept on each trial can be modeled as a random sample from a multivariate probability distribution defined over the perceptual space. Decision bounds divide this space into regions that are each associated with a response alternative. General recognition th
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Probability bounds analysis"

1

Kwon, Joong Sung, and Ronald Pyke. "Probability Bounds for Product Poisson Processes." In Athens Conference on Applied Probability and Time Series Analysis, 137–58. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0749-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zheng, Kailiang, Helen H. Lou, and Yinlun Huang. "Sustainability Under Severe Uncertainty: A Probability-Bounds-Analysis-Based Approach." In Treatise on Sustainability Science and Engineering, 51–66. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-6229-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grous, Ammar. "Analysis Elements for Determining the Probability of Rupture by Simple Bounds." In Fracture Mechanics 2, 69–86. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118580028.ch2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moosbrugger, Marcel, Ezio Bartocci, Joost-Pieter Katoen, and Laura Kovács. "Automated Termination Analysis of Polynomial Probabilistic Programs." In Programming Languages and Systems, 491–518. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_18.

Full text
Abstract:
AbstractThe termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs. Positive almost sure termination (PAST) focuses on termination in a finite expected number of steps. This paper presents a fully automated approach to the termination analysis of probabilistic while-programs whose guards and expressions are polynomial expressions. As proving (positive) AST is undecidable in general, existing proof rules typically provide sufficient conditions. These conditions mostly involve constraints on supermartingales. We consider four proof rules from the literature and extend these with generalizations of existing proof rules for (P)AST. We automate the resulting set of proof rules by effectively computing asymptotic bounds on polynomials over the program variables. These bounds are used to decide the sufficient conditions – including the constraints on supermartingales – of a proof rule. Our software tool Amber can thus check AST, PAST, as well as their negations for a large class of polynomial probabilistic programs, while carrying out the termination reasoning fully with polynomial witnesses. Experimental results show the merits of our generalized proof rules and demonstrate that Amber can handle probabilistic programs that are out of reach for other state-of-the-art tools.
APA, Harvard, Vancouver, ISO, and other styles
5

Stavrakakis, P., and P. Valettas. "On the Geometry of Log-Concave Probability Measures with Bounded Log-Sobolev Constant." In Asymptotic Geometric Analysis, 359–80. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6406-8_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Spel, Jip, Sebastian Junges, and Joost-Pieter Katoen. "Finding Provably Optimal Markov Chains." In Tools and Algorithms for the Construction and Analysis of Systems, 173–90. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_10.

Full text
Abstract:
AbstractParametric Markov chains (pMCs) are Markov chains with symbolic (aka: parametric) transition probabilities. They are a convenient operational model to treat robustness against uncertainties. A typical objective is to find the parameter values that maximize the reachability of some target states. In this paper, we consider automatically proving robustness, that is, an $$\varepsilon $$ ε -close upper bound on the maximal reachability probability. The result of our procedure actually provides an almost-optimal parameter valuation along with this upper bound.We propose to tackle these ETR-hard problems by a tight combination of two significantly different techniques: monotonicity checking and parameter lifting. The former builds a partial order on states to check whether a pMC is (local or global) monotonic in a certain parameter, whereas parameter lifting is an abstraction technique based on the iterative evaluation of pMCs without parameter dependencies. We explain our novel algorithmic approach and experimentally show that we significantly improve the time to determine almost-optimal synthesis.
APA, Harvard, Vancouver, ISO, and other styles
7

Cardaliaguet, Pierre, François Delarue, Jean-Michel Lasry, and Pierre-Louis Lions. "Convergence of the Nash System." In The Master Equation and the Convergence Problem in Mean Field Games, 159–74. Princeton University Press, 2019. http://dx.doi.org/10.23943/princeton/9780691190716.003.0006.

Full text
Abstract:
This chapter talks about addressing the convergence problem, which is devoted to the convergence of the Nash system. It contains several results on the differential calculus on the space of probability measures together with an Itô's formula for functionals of a process taking values in the space of probability measures. For simplicity, most of the analysis provided in the chapter is on the torus, but the method is robust enough to accommodate the nonperiodic setting. The chapter also shows that monotonicity plays no role in the proofs of certain theorems. Basically, only the global Lipschitz properties of H and DpH, together with the nondegeneracy of the diffusions and the various bounds obtained for the solution of the master equation and its derivatives matter.
APA, Harvard, Vancouver, ISO, and other styles
8

Kaporis, Alexis C., and Lefteris M. Kirousis. "Proving Conditional Randomness using the Principle of Deferred Decisions." In Computational Complexity and Statistical Physics. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195177374.003.0016.

Full text
Abstract:
In order to prove that a certain property holds asymptotically for a restricted class of objects such as formulas or graphs, one may apply a heuristic on a random element of the class, and then prove by probabilistic analysis that the heuristic succeeds with high probability. This method has been used to establish lower bounds on thresholds for desirable properties such as satisfiability and colorability: lower bounds for the 3-SAT threshold were discussed briefly in the previous chapter. The probabilistic analysis depends on analyzing the mean trajectory of the heuristic—as we have seen in chapter 3—and in parallel, showing that in the asymptotic limit the trajectory’s properties are strongly concentrated about their mean. However, the mean trajectory analysis requires that certain random characteristics of the heuristic’s starting sample are retained throughout the trajectory. We propose a methodology in this chapter to determine the conditional that should be imposed on a random object, such as a conjunctive normal form (CNF) formula or a graph, so that conditional randomness is retained when we run a given algorithm. The methodology is based on the principle of deferred decisions. The essential idea is to consider information about the object as being stored in “small pieces,” in separate registers. The contents of the registers pertaining to the conditional are exposed, while the rest remain unexposed. Having separate registers for different types of information prevents exposing information unnecessarily. We use this methodology to prove various randomness invariance results, one of which answers a question posed by Molloy [402].
APA, Harvard, Vancouver, ISO, and other styles
9

Baker, John. "Meeting in the Shadow of Heroes? Personal Names and Assembly Places." In Power and Place in Europe in the Early Middle Ages, 37–63. British Academy, 2019. http://dx.doi.org/10.5871/bacad/9780197266588.003.0002.

Full text
Abstract:
This chapter examines the likelihood that celebrated individuals were commemorated in the names of assembly sites as part of a display of political authority or cultural affiliation. Focusing primarily on the names of Domesday hundreds, it draws comparisons with the personal names in other well-established Anglo-Saxon corpora (including charter bounds, narrative sources, Domesday Book and place-names), in order to assess the social context of those individuals commemorated in hundred-names. The chapter then evaluates the probability that such names could carry specific political or cultural resonance at the time of naming, and there are clear indications that this may sometimes have been the case, perhaps especially in the first half of the 10th century. While the evidence implies that the hundred-names arose in a number of different circumstances, the analysis suggests that reference to heroic figures may have been one motivating factor in the naming of sites of assembly.
APA, Harvard, Vancouver, ISO, and other styles
10

Porter, Theodore M. "The Errors of Art and Nature." In The Rise of Statistical Thinking, 1820-1900, 97–115. Princeton University Press, 2020. http://dx.doi.org/10.23943/princeton/9780691208428.003.0005.

Full text
Abstract:
This chapter analyzes the law of facility of errors. All the early applications of the error law could be understood in terms of a binomial converging to an exponential, as in Abrahan De Moivre's original derivation. All but Joseph Fourier's law of heat, which was never explicitly tied to mathematical probability except by analogy, were compatible with the classical interpretation of probability. Just as probability was a measure of uncertainty, this exponential function governed the chances of error. It was not really an attribute of nature, but only a measure of human ignorance—of the imperfection of measurement techniques or the inaccuracy of inference from phenomena that occur in finite numbers to their underlying causes. Moreover, the mathematical operations used in conjunction with it had a single purpose: to reduce the error to the narrowest bounds possible. With Adolphe Quetelet, all that began to change, and a wider conception of statistical mathematics became possible. When Quetelet announced in 1844 that the astronomer's error law applied also to the distribution of human features such as height and girth, he did more than add one more set of objects to the domain of this probability function; he also began to break down its exclusive association with error.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Probability bounds analysis"

1

Bin Hu and Peter Seiler. "Probability bounds for false alarm analysis of fault detection systems." In 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2013. http://dx.doi.org/10.1109/allerton.2013.6736633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Du, Xiaoping. "Interval Reliability Analysis." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34582.

Full text
Abstract:
Traditional reliability analysis uses probability distributions to calculate reliability. In many engineering applications, some nondeterministic variables are known within intervals. When both random variables and interval variables are present, a single probability measure, namely, the probability of failure or reliability, is not available in general; but its lower and upper bounds exist. The mixture of distributions and intervals makes reliability analysis more difficult. Our goal is to investigate computational tools to quantify the effects of random and interval inputs on reliability ass
APA, Harvard, Vancouver, ISO, and other styles
3

Aughenbaugh, Jason Matthew, Scott Duncan, Christiaan J. J. Paredis, and Bert Bras. "A Comparison of Probability Bounds Analysis and Sensitivity Analysis in Environmentally Benign Design and Manufacture." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99230.

Full text
Abstract:
There is growing acceptance in the design community that two types of uncertainty exist: inherent variability and uncertainty that results from a lack of knowledge, which variously is referred to as imprecision, incertitude, irreducible uncertainty, and epistemic uncertainty. There is much less agreement on the appropriate means for representing and computing with these types of uncertainty. Probability bounds analysis (PBA) is a method that represents uncertainty using upper and lower cumulative probability distributions. These structures, called probability boxes or just p-boxes, capture bot
APA, Harvard, Vancouver, ISO, and other styles
4

Aughenbaugh, Jason Matthew, and Christiaan J. J. Paredis. "Probability Bounds Analysis as a General Approach to Sensitivity Analysis in Decision Making Under Uncertainty." In SAE World Congress & Exhibition. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 2007. http://dx.doi.org/10.4271/2007-01-1480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Du, Xiaoping. "Uncertainty Analysis With Probability and Evidence Theories." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99078.

Full text
Abstract:
Both aleatory and epistemic uncertainties exist in engineering applications. Aleatory uncertainty (objective or stochastic uncertainty) describes the inherent variation associated with a physical system or environment. Epistemic uncertainty, on the other hand, is derived from some level of ignorance or incomplete information about a physical system or environment. Aleatory uncertainty associated with parameters is usually modeled by probability theory and has been widely researched and applied by industry, academia, and government. The study of epistemic uncertainty in engineering has recently
APA, Harvard, Vancouver, ISO, and other styles
6

Marti, K. "Approximation and Derivatives of Probability Functions in Probabilistic Structural Analysis and Design." In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0048.

Full text
Abstract:
Abstract Yield stresses, allowable stresses, moment capacities (plastic moments), external loadings, manufacturing errors are not given fixed quantities in practice, but have to be modelled as random variables with a certain joint probability distribution. Hence, problems from limit (collapse) load analysis or plastic analysis and from plastic and elastic design of structures are treated in the framework of stochastic optimization. Using especially reliability-oriented optimization methods, the behavioral constraints are quantified by means of the corresponding probability ps of survival. Lowe
APA, Harvard, Vancouver, ISO, and other styles
7

Ferson, Scott. "Probability Bounds Analysis Solves the Problem of Incomplete Specification in Probabilistic Risk and Safety Assessments." In Ninth United Engineering Foundation Conference on Risk-Based Decisionmaking in Water Resources. Reston, VA: American Society of Civil Engineers, 2001. http://dx.doi.org/10.1061/40577(306)16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xu, Yanwen, and Pingfeng Wang. "Sequential Sampling Based Reliability Analysis for High Dimensional Rare Events With Confidence Intervals." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22146.

Full text
Abstract:
Abstract Analysis of rare failure events accurately is often challenging with an affordable computational cost in many engineering applications, and this is especially true for problems with high dimensional system inputs. The extremely low probabilities of occurrences for those rare events often lead to large probability estimation errors and low computational efficiency. Thus, it is vital to develop advanced probability analysis methods that are capable of providing robust estimations of rare event probabilities with narrow confidence bounds. Generally, confidence intervals of an estimator c
APA, Harvard, Vancouver, ISO, and other styles
9

Jie, Yongshi, Wei Wang, Xue Bai, and Yongxiang Li. "Uncertainty analysis based on probability bounds in probabilistic risk assessment of high microgravity science experiment system." In 2016 11th International Conference on Reliability, Maintainability and Safety (ICRMS). IEEE, 2016. http://dx.doi.org/10.1109/icrms.2016.8050109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gray, A., A. Wimbush, M. De Angelis, P. O. Hristov, E. Miralles-Dolz, D. Calleja, and R. Rocchetta. "Bayesian Calibration and Probability Bounds Analysis Solution to the Nasa 2020 UQ Challenge on Optimization under Uncertainty." In Proceedings of the 29th European Safety and Reliability Conference (ESREL). Singapore: Research Publishing Services, 2020. http://dx.doi.org/10.3850/978-981-14-8593-0_5520-cd.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Probability bounds analysis"

1

Oberkampf, William Louis, W. Troy Tucker, Jianzhong Zhang, Lev Ginzburg, Daniel J. Berleant, Scott Ferson, Janos Hajagos, and Roger B. Nelsen. Dependence in probabilistic modeling, Dempster-Shafer theory, and probability bounds analysis. Office of Scientific and Technical Information (OSTI), October 2004. http://dx.doi.org/10.2172/919189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mullahy, John. Individual Results May Vary: Elementary Analytics of Inequality-Probability Bounds, with Applications to Health-Outcome Treatment Effects. Cambridge, MA: National Bureau of Economic Research, July 2017. http://dx.doi.org/10.3386/w23603.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Probability bounds analysis' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography