Optimal management of distance-based location registration using embedded Markov chain
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولAn Embedded Markov Chain Modeling Method for Movement-Based Location Update Scheme
—In this paper, an embedded Markov chain model is proposed to analyze the signaling cost of the Movement-Based Location Update (MBLU) scheme under which a Location Update (LU) occurs whenever the number of cells crossed reaches a threshold, called movement threshold. Compared with existing literature, this paper has the following advantages. 1) This paper proposes an embedded Markov chain mode...
متن کاملDistance Management of SMEs Using ICT Solutions
The paper contains a description of a research conducted in collaboration with some Erasmus for Young Entrepreneurs program Romanian students, concerning the use and implementation of ICT (Information and Telecommunication Technology), especially in distance managing Small and Medium Enterprises (SMEs). The paper is a response to the nature of contemporary business management, with the constant...
متن کاملMarkov Chain Sampling for Non-linear State Space Models Using Embedded Hidden Markov Models
Abstract. I describe a new Markov chain method for sampling from the distribution of the state sequences in a non-linear state space model, given the observation sequence. This method updates all states in the sequence simultaneously using an embedded Hidden Markov model (HMM). An update begins with the creation of a “pool” of K states at each time, by applying some Markov chain update to the c...
متن کاملOptimal Facility Location under Various Distance Functions
We present e cient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the rst we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we nd a location that minimizes the sum (or sum of the squares) of the distances of k of the site...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2020
ISSN: 1550-1477,1550-1477
DOI: 10.1177/1550147720904611