نتایج جستجو برای: geometrical probability

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

Journal: :civil engineering infrastructures journal 0
farzad shahabian academic staff sidi mohammed elachachi academic staff denys breysse academic staff

this study aims to undertake a statistical study to evaluate the accuracy of nine models that have been previously proposed for estimating the ultimate resistance of plate girders subjected to patch loading. for each model, mean errors and standard errors, as well as the probability of underestimating or overestimating patch load resistance, are estimated and the resultant values are compared o...

1992
K. M. Hanson

A new approach to Bayesian reconstruction is proposed that endows the prior probability distribution with an inherent geometrical flexibility, which is achieved through a transformation of the coordinate system of the prior distribution or model into that of the reconstruction. With this warping, prior morphological information regarding the object that is being reconstructed may be adapted to ...

Journal: :Discrete Applied Mathematics 2015
Sueli I. Rodrigues Costa Sandra A. Santos João Strapasson

This paper is a strongly geometrical approach to the Fisher distance, which is a measure of dissimilarity between two probability distribution functions. The Fisher distance, as well as other divergence measures, are also used in many applications to establish a proper data average. The main purpose is to widen the range of possible interpretations and relations of the Fisher distance and its a...

1999
A. PÁZMAN

In a nonlinear regression model with a given prior distribution, the estimator maximizing the posterior probability density is considered (a certain kind of Bayes estimator). It is shown that the prior influences essentially, but in a comprehensive way, the geometry of the model, including the intrinsic curvature measure of nonlinearity which is derived in the paper. The obtained geometrical re...

2005
Bhupendra Verma Sanjeev Jain Amit Phadikar

A new spatial domain probability based watermarking scheme for color Images is proposed. The blue channel of the color image has been used for watermark embedding. Host image is divided into 8x8 blocks and each bit of the binary encoded watermark is embedded in each such block. For each inserted bit, intensity of all the pixels in the block is modified according to the embedding algorithm. Non-...

2010
F. Alberto GRÜNBAUM Mizan RAHMAN

We give a hypergeometric proof involving a family of 2-variable Krawtchouk polynomials that were obtained earlier by Hoare and Rahman [SIGMA 4 (2008), 089, 18 pages] as a limit of the 9− j symbols of quantum angular momentum theory, and shown to be eigenfunctions of the transition probability kernel corresponding to a “poker dice” type probability model. The proof in this paper derives and make...

2009
Philippe Delanoë

We give an account on Otto’s geometrical heuristics for realizing, on a compact Riemannian manifold M , the L Wasserstein distance restricted to smooth positive probability measures, as a Riemannian distance. The Hilbertian metric discovered by Otto is obtained as the base metric of a Riemannian submersion with total space, the group of diffeomorphisms of M equipped with the Arnol’d metric, and...

2017
Anirban Bhowal Rakhesh S. Kshetrimayum

In this paper, relay based mobile to mobile (M2M) system employing amplify and forward (AF) protocol has been considered and its end to end performance over N-α-μ fading channels has been explored. The closed form expressions for probability density function (PDF), cumulative distribution function (CDF) of cascaded α-μ fading channels and lower bound on average symbol error probability (ASEP) h...

2014
Yuli Chen

To analyze the detection probability of shipborne AIS (automatic identification system) signal from space, a mathematical model dependent upon three factors of message collision avoidance, power of signal received by satellite and interference ratio of signal received is presented in the paper. The altitude and footprint area of the AIS satellite are discussed to overcome the collision of messa...

1990
Dimitris J. Bertsimas

Given n uniformly and independently distributed points in a ball of unit volume in dimension d, it is well established that the length of several combinatorial optimization problems (including the minimum spanning tree (MST), the minimum matching (M), the traveling salesman problem (TSP), etc.) on these n points is asymptotic to P(d) n(d-1)/d, where the constant B(d) depends on the dimension d ...

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

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