Here we are implanted a way of image based search method to get the information from server. Here searching process has done on automatic annotation image retrieval method and it have some keywords for each and every image independently, user can send his search request to the server in Markov method it will retrieve the data from the server based on its characteristics and its textual informat...

In networking applications, one often wishes to obtain estimates about the number of objects at different parts of the network (e.g., the number of cars at an intersection of a road network or the number of packets expected to reach a node in a computer network) by monitoring the traffic in a small number of network nodes or edges. We formalize this task by defining the Markov Chain Monitoring ...

This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...

We investigate the importance sampling (IS) simulation for the sample average of an output sequence from an irreducible Markov chain. The optimal Markov chain used in simulation is known to be a twisted Markov chain, however, the proofs in [2], [3] are very complicated and do not give us a good perspective. We give a simple and natural proof for the optimality of the simulation Markov chain in ...

agricultural drought in iran is considered as a natural disaster especially for the farmers. although nobody can stop drought, but if its nature and its characteristics are studied, it can be predicted and the results can be reduced. this article studies drought in the province of sistaan and balouchestaan and the drought predictability in the province has been done base on a model that is made...

The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots of cost function H by varying the parameters like q (Number of colors that can be used in coloring) and c (Average node degree). The results are obtained by using simulated annealing scheme, where the temperature (inve...

There are a lot of intensive researches on handwritten character recognition (HCR) for almost past four decades. The research has been done on some of popular scripts such as Roman, Arabic, Chinese and Indian. In this paper we present a review on HCR work on the four popular scripts. We have summarized most of the published paper from 2005 to recent and also analyzed the various methods in crea...

background: hepatitis b (hb) is a major global mortality. accurately predicting the trend of the disease can provide an appropriate view to make health policy disease prevention. this paper aimed to apply three different to predict monthly incidence rates of hb. methods: this historical cohort study was conducted on the hb incidence data of hamadan province, the west of iran, from 2004 to 2012....

One of the simplest and most powerful practical uses of the ergodic theory of Markov chains is in Markov chain Monte Carlo (MCMC). Suppose we wish to simulate from a probability density π (which will be called the target density) but that direct simulation is either impossible or practically infeasible (possibly due to the high dimensionality of π). This generic problem occurs in diverse scient...