نتایج جستجو برای: tainty

تعداد نتایج: 71  

1998
Ghulam Rasool Chaudhry Hossein Ghodosi Jennifer Seberry

Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares

Uncertainty inherent in the financial market was usually consid- ered to be random. However, randomness is only one special type of uncer- tainty and appropriate when describing objective information. For describing subjective information it is preferred to assume that uncertainty is fuzzy. This paper defines the expected payoof trading strategies in a fuzzy financial market within the framewor...

1994
Petr Hájek Dagmar Harmancová Francesc Esteva Pere Garcia-Calvés Lluis Godo

Within the possibilistic approach to uncer­ tainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We re­ late this qualitative modal logic to the many­ valued analogues MVS5 and MVKD45 of the well known modal logics of knowledge and be­ lief 55 and KD45 respectively. Completeness ...

2018
Markus Wahlsten Jan Nordström Oskar Ålund

A technique for coupling an intrusive and non-intrusive uncertainty quantification method is proposed. The intrusive approach uses a combination of polynomial chaos and stochastic Galerkin projection. The non-intrusive method uses numerical integration by combining quadrature rules and the probability density functions of the prescribed uncertainties. A strongly stable coupling procedure betwee...

Journal: :Heart, lung & circulation 2010

C tainty regarding the risks of stent thrombosis in individual patients, and in particular how to balance this risk against that of surgical complications if antiplatelet therapy is continued throughout the perioperative period. This guideline provides consensus advice regarding (RACS), the Australian and New Zealand College of Anaesthetists (ANZCA), the Royal Australasian College of Dental Sur...

Journal: :Technometrics 2003
Daniel W. Apley Hyun Cheol Lee

Residual-based control charts are popular methods for statistical process control of autocorrelated processes. To implement these methods, a time series model of the process is required. The model must be estimated from data, in practice, and model estimation errors can cause the actual in-control average run length to differ substantially from the desired value. This article develops a method ...

1995
Paul J. Krause John Fox Philip N. Judson

Classically, risk is characterised by a point value probability indicating the likelihood of occur­ rence of an adverse effect. However, there are domains where the attainability of objective numerical risk characterisations is increasingly being questioned. This paper reviews the argu­ ments in favour of extending classical techniques of risk assessment to incorporate meaningful qualitative an...

1997
Judy Goldsmith Michael L. Littman Martin Mundhenk

We examine the computational complexity of testing and finding small plans in prob­ abilistic planning domains with succinct rep­ resentations. We find that many problems of interest are complete for a variety of com­ plexity classes: NP, co-NP, PP, NPPP, co­ NPPP, and PSPACE. Of these, the proba­ bilistic classes PP and NPPP are likely to be of special interest in the field of uncer­ tainty in...

Journal: :iranian journal of fuzzy systems 2011
zhongfeng qin xiang li

uncertainty inherent in the financial market was usually consid- ered to be random. however, randomness is only one special type of uncer- tainty and appropriate when describing objective information. for describing subjective information it is preferred to assume that uncertainty is fuzzy. this paper defines the expected payoof trading strategies in a fuzzy financial market within the framewor...

2004
Shichao Zhang Chengqi Zhang

The complexity of probabilistic reasoning with Bayesian networks has recently been proven to be NP complete So reducing the complexity of such networks is an active issue in uncer tainty reasoning Much work on such as compressing the probabilistic information for Bayesian networks and optimal approximation algorithm for Bayesian inference has been suggested In this paper we study a class of tra...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید