نتایج جستجو برای: random closed sets

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

Khalil Shafie mojtaba Khazaei

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

2006
Hung T. Nguyen Yukio Ogura Santi Tasena Hien D. Tran

This note aims at presenting the most general framework for a class U of random upper semicontinuous functions, namely random elements whose sample paths are upper semicontinuous (u.s.c.) functions, defined on some locally compact, Hausdorff and second countable base space, extending Matheron’s framework for random closed sets. It is shown that while the natural embedding process does not provi...

Journal: :journal of optimization in industrial engineering 2010
mojtaba khazaei khalil shafie

in order to study the relationship between random boolean sets and some explanatory variables, this paper introduces a propagation model. this model can be applied when corresponding poisson process of the boolean model is related to explanatory variables and the random grains are not affected by these variables. an approximation for the likelihood is used to find pseudo-maximum likelihood esti...

Journal: :int. journal of mining & geo-engineering 2015
farnoosh basaligheh ali keyhani

one of the conventional methods for temporary support of tunnels is to use steel sets with shotcrete. the nature of a temporary support system demands a quick installation of its structures. as a result, the spacing between steel sets is not a fixed amount and it can be considered as a random variable. hence, in the reliability analysis of these types of structures, the selection of an appropri...

Journal: :Proceedings of the Edinburgh Mathematical Society 1983

2007
Douglas A. Cenzer Paul Brodhead

We investigate the connection between measure and capacity for the space C of nonempty closed subsets of 2N. For any computable measure μ∗, a computable capacity T may be defined by letting T (Q) be the measure of the family of closed sets K which have nonempty intersection with Q. We prove an effective version of the Choquet’s theorem by showing that every computable capacity may be obtained f...

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

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