with recent developments in communication technologies, it is possible to access information any time and in any place; however, mobile environments bring forward certain requirements and exclusive challenges including low connection speeds and bandwidth limitations. thus, we need to consider mobile limitations when using web services. providing services and limited resource allocation to users...

Methods using gambling teams and martingales are developed and applied to find formulas for the expected value and the generating function of the waiting time until observes one of the elements of a finite collection of patterns in a sequence which is generated by a two-state Markov chain. (Keywords: Gambling, teams, waiting times, patterns, success runs, failure runs, Markov chains, martingale...

growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. in this paper, sensitivity and specificity of the first and second markov chains for prediction of genes was evaluated using the complete double stranded  dna virus. there were two approaches for prediction of each markov model parameter,...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

in this paper at rst, a history of mathematical models is given.next, some basic information about random variables, stochastic processesand markov chains is introduced. as follows, the entropy for a discrete timemarkov process is mentioned. after that, the entropy for sis stochastic modelsis computed, and it is proved that an epidemic will be disappeared after a longtime.

Although keyword auctions are often studied in the context of a single keyword in the literature, firms generally have to participate in multiple keyword auctions at the same time. Advertisers purchase a variety of keywords that can be categorized as generic-relevant, focal-brand, and competingbrand keywords. At the same time, firms also have to choose how the keywords can be matched to search ...

In this paper an approximation for entropy rate of an ergodic Markov chain via sample path simulation is calculated. Although there is an explicit form of the entropy rate here, the exact computational method is laborious to apply. It is demonstrated that the estimated entropy rate of Markov chain via sample path not only converges to the correct entropy rate but also does it exponential...

We derive the transition structure of a Markovian lumping of Kingman’s n-coalescent [1, 2]. Lumping a Markov chain is meant in the sense of [3, def. 6.3.1]. The lumped Markov process, referred as the unlabeled n-coalescent, is a continuous-time Markov chain on the set of all integer partitions of the sample size n. We derive the backwardtransition, forward-transition, state-specific, and sequen...