نتایج جستجو برای: metropolis of ahvaz

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

2016
Seyed Mahmoud Latifi Majid Karandish Hajieh Shahbazian Leila Hardani Pasand

Background. The present study is the fourth cohort study conducted in the Middle East on the evaluation of prediabetes and type 2 diabetes, implemented in Ahvaz, Iran. Methodology. The individuals aged over twenty years who had participated in a study on the prevalence of metabolic syndrome in 2009 (Phase 1) in Ahvaz were invited again in 2014. The questionnaires were completed via interview, a...

2016
Mehrnoosh Jasemzadeh Nematallah Jaafarzadeh Morteza Abdullatif Khafaie Amal Saki Malehi Marzieh Araban

INTRODUCTION Air pollution is one of the most important problems of metropolitan cities. The level of air pollution in the city of Ahvaz is so much higher than the standard level, that it can create risks, particularly for pregnant women in the area. The aim of the study was to examine the predictors of self-care behavior of pregnant women against air pollution according to Extended Parallel Pr...

Journal: :Statistics and Computing 1998
Paul Gustafson

The random walk Metropolis algorithm is a simple Markov chain Monte Carlo scheme which is frequently used in Bayesian statistical problems. We propose a guided walk Metropolis algorithm which suppresses some of the random walk behavior in the Markov chain. This alternative algorithm is no harder to implement than the random walk Metropolis algorithm, but empirical studies show that it performs ...

2007
Alistair Sinclair Yanlei Diao Xiaofeng Ren

The Metropolis process is an extremely general recipe for constructing a Markov chain which has any desired stationary distribution π on a finite set Ω. Moreover, this distribution can be specified just by a weight function w : Ω → R, so that π(x) = w(x) Z where Z is an unknown normalizing factor. The Metropolis process is named after one of its inventors [MR+53]. To specify the Metropolis proc...

1995
Luke Tierney

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

2005
Alexei Bazavov Bernd A. Berg Urs M. Heller

For SU(2) lattice gauge theory with the fundamental-adjoint action an efficient heat-bath algorithm is not known so that one had to rely on Metropolis simulations supplemented by overrelaxation. Implementing a novel biased Metropolis-heat-bath algorithm for this model, we find improvement factors in the range 1.45 to 2.06 over conventionally optimized Metropolis simulations. If one optimizes fu...

2017
Sina Ebrahimi Alireza Ghoreifi Behnam Shakiba Arash Azaripour Hamid Deldadeh Amir Reza Elahian Mazaher Hadi Parvin Emadi Hamed Rajaee Mehdi Dehghani Lily Nosraty

Sina Ebrahimi, Alireza Ghoreifi, Behnam Shakiba, Arash Azaripour, Hamid Deldadeh, Amir Reza Elahian, Mazaher Hadi, Parvin Emadi, Hamed Rajaee, Mehdi Dehghani, Lily Nosraty. Ahvaz Jundishapur University of Medical Sciences, Ahvaz, Iran; Urology Department, Mashhad University of Medical Sciences, Mashhad, Iran; Students’ Scientific Research Center, Tehran University of Medical Sciences, Tehran, I...

Journal: :CoRR 1998
A. Yamaguchi

A hybrid algorithm is proposed for pure SU(N) lattice gauge theory based on Genetic Algorithms (GA)s and the Metropolis method. We apply the hybrid GA to pure SU(2) gauge theory on a 2-dimensional lattice and find the action per plaquette and Wilson loops being consistent with those given by the Metropolis and Heatbath methods. The thermalization of this newly proposed Hybrid GA is quite faster...

2009
JEAN-FRANÇOIS DELMAS

The waste-recycling Monte Carlo (WRMC) algorithm introduced by physicists is a modification of the (multi-proposal) Metropolis–Hastings algorithm, which makes use of all the proposals in the empirical mean, whereas the standard (multi-proposal) Metropolis–Hastings algorithm uses only the accepted proposals. In this paper we extend the WRMC algorithm to a general control variate technique and ex...

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

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