The method of types is one of the most popular techniques in information theory and combinatorics. Two sequences of equal length have the same type if they have identical empirical distributions. In this paper, we focus on Markov types, that is, sequences generated by a Markov source (of order one). We note that sequences having the same Markov type share the same so called balanced frequency m...

When selecting a long-term silvicultural management policy for a forest, a number of stochastic events can be taken into account in order to improve the management of the forest and thereby increase its value. A stochastic event that has recently been given a lot of attention to is the damage to forests due to windstorms. This is an important event to take into consideration as recent studies s...

in this article, decisions about price and stock allocation for a seller with multiple customer classes are analyzed. with each customer arrival, the seller needs to decide about accepting or rejecting the customer’s demand by considering the stock on hand. in the case of acceptance, one needs to decide about the selling price. after any change in the inventory level, decision about continuing ...

Author Contributions 15 BE, JO and PK designed the study. BE and KH recorded and analyzed the data. BE, JO and PK 16 wrote and revised the manuscript. 17 18. CC-BY 4.0 International license peer-reviewed) is the author/funder. It is made available under a The copyright holder for this preprint (which was not. ABSTRACT 19 Modern theories of cognition place an emphasis on the (un)certainty of ava...

We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...

Probabilistic roadmaps (PRMs) are a commonly used approach to path planning in continuous spaces with obstacles. We examine the case where the obstacle locations are not known with certainty but can be observed during execution of the plan. We abstract the problem to one of traversing a graph where some edges (referred to as uncertain edges) may or may not be present, and where noisy observatio...

Nowadays the great interest of researchers in the problem of processing the interrelated data arrays including images is retained. In the classical theory of machine learning objects for recognition are examined independently. In the modern theory of machine learning, the problem of image processing is often viewed as a problem in the field of graph models. Image pixels constitute a unique arra...

The sure thing principle and the law of total probability are basic laws in classic probability theory. A disjunction fallacy leads to the violation of these two classical laws. In this paper, an Evidential Markov (EM) decision making model based on Dempster-Shafer (D-S) evidence theory and Markov modelling is proposed to address this issue and model the real human decision-making process. In a...

This study aimed at presenting a method for formulating optimal production, repair and replacement policies. The system was based on the production rate of defective parts and machine repairs and then was set up to optimize maintenance activities and related costs. The machine is either repaired or replaced. The machine is changed completely in the replacement process, but the productio...