نتایج جستجو برای: uncertainty propagation

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

2008
Julien Billeter Levente Simon Graeme Puxty Konrad Hungerbühler

Article history: A novel method is presente Received 28 February 2008 Received in revised form 24 April 2008 Accepted 5 May 2008 Available online 11 May 2008

Journal: :Int. J. Approx. Reasoning 2004
Helen M. Regan Scott Ferson Daniel Berleant

In this paper we compare four methods for the reliable propagation of uncertainty through calculations involving the binary operations of addition, multiplication, subtraction and division. The methods we investigate are: (i) dependency bounds convolution; (ii) Distribution Envelope Determination; (iii) interval probabilities; and (iv) Dempster–Shafer belief functions. We show that although eac...

2017
Silvia Bozzi Diego Gallo Raffaele Ponzini Giovanna Rizzo Umberto Morbiducci Giuseppe Passoni

Journal: :IJGHPC 2010
S. Kotwal Shekhar Verma G. S. Tomar Raj Abrol

This paper presents distance and angle measurements based Multi-Hop Adaptive and Iterative Localization algorithm for localization of unknown nodes in wireless sensor networks (WSNs). The present work determines uncertainty region of unknown nodes with respect to known (anchor) nodes using noisy distance and angle measurements. This node transmits its uncertainty region to other unknown nodes t...

Journal: :J. Comput. Physics 2013
Peng Chen Nicholas Zabaras

Article history: Received 10 December 2012 Accepted 8 May 2013 Available online 31 May 2013

2000
G D Agostini M Raso

Starting from considerations about meaning and subsequent use of asymmetric uncertainty intervals of experimental results, we review the issue of uncertainty propagation. We show that, using a probabilistic approach (the so-called Bayesian approach), all sources of uncertainty can be included in a logically consistent way. Practical formulae for the rst moments of the probability distribution a...

2003
Adriaan J. van Wijngaarden Kees A. Schouhamer Immink

A framework for the analysis of error propagation for high rate runlength-limited codes is developed. The susceptibility to errors of capacity approaching code constructions, the enumerative and sequence replacement technique and bit stuffing, are analyzed in detail. It is shown that the first two techniques experience low error propagation and that they are superior to the popular bit-stuffing...

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

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