Wyniki wyszukiwania - BazTech

1

Reliability evaluation for multi-state repairable systems with hybridization the markov stochastic process and the universal generating function

Mohamed Amara, Abdelkader Zeblah, Mohamed Mostefai

Przegląd Elektrotechniczny

|

2021

|

R. 97, nr 1

109--114

EN

Multistate reliability models are generally complicated and the state space has a large number of states. Evaluating the performance distribution of complex series parallel to the repairable multi-state system with dependent linear components. They are much more complex and present major difficulties in defining the system and the performance of the MSS multistate reliability assessment system. A new approach is introduced to extend the classical theory of reliability based on the binary hypothesis to the repairable multi-state system (MSS). Generally, some of the stochastic processes of traditional methods did not provide an assessment of the reliability of the MSS system due to the enormous states of the system. This article is based on the hybridization of the Markov stochastic process and the universal generation function technology (UGF) which deals with the most sophisticated and realistic models ranging from perfect operation to complete failure in which components and systems can take many states. We consider the case where the performance and probability distributions of certain components depend on the linear of another component or group of components.

PL

Zaprezentowano nowa metodę rozszerzająca klasyczną teorię niezawodności bazującą na hipotezie naprawialnych systemów wielostanowych MSS. Artykuł bazuje na hybrydyzacji stochastycznego procesu Markova i technologii uniwersalnej funkcji UGF. Rozważono przypadek kiedy gęstość prawdopodobieństwa pewnych składowych zależy liniowo od innych składowych.

2

The limit properties diffusion process in a semi-Markov environment

Chabanyuk Y., Rosa W.

Journal of Applied Mathematics and Computational Mechanics

|

2018

|

Vol. 17, nr 1

5--14

EN

In this paper we consider the stochastic diffusion process with semi-Markov switchings in an averaging scheme. We present results and conditions on convergence to the classic diffusion process, in case with semi-Markov process perturbation is uniformly ergodic. We used small parameter scheme to get the main result.

3

Future generation of railway control systems for regional lines including new telematic solutions

Lewiński A., Łukasik Z., Perzyński T., Ukleja P.

Archives of Transport System Telematics

|

2014

|

Vol. 7, iss. 3

13--16

EN

The paper deals with implementation problem of new generation of railway control and management systems dedicated for regional lines. The special infrastructure of such lines gives the possibility of application the new telematic technologies including the open radio transmission standards to control and monitoring the dissipated railway objects. In the paper the efficiency and safety analyses are presented based on stochastic process approach according to UE standards and recommendations.

4

Learning Automata based Algorithms for Finding Optimal Policies in Fully Cooperative Markov Games

Masoumi B., Meybodi M.R., Abtahi F.

Przegląd Elektrotechniczny

|

2012

|

R. 88, nr 6

280-289

EN

Markov games, as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi-agent systems. In this paper, several learning automata based multi-agent system algorithms for finding optimal policies in fully-cooperative Markov Games are proposed. In the proposed algorithms, Markov problem is described as a directed graph in which the nodes are the states of the problem, and the directed edges represent the actions that result in transition from one state to another. Each state of the environment is equipped with a variable structure learning automata whose actions are moving to different adjacent states of that state. Each agent moves from one state to another and tries to reach the goal state. In each state, the agent chooses its next transition with help of the learning automaton in that state. The actions taken by learning automata along the path traveled by the agent is then rewarded or penalized based on the value of the traveled path according to a learning algorithm. In the second group of the proposed algorithms, the concept of entropy has been imported into learning automata based multi-agent systems to drive the magnitude of the reinforcement signal given to the LA and improve the performance of the algorithms. The results of experiments have shown that the proposed algorithms perform better than the existing learning automata based algorithms in terms of speed and the accuracy of reaching the optimal policy.

PL

Zaprezentowano szereg automatów uczących bazujących na algorytmach systemów typu multi-agent w celu poszukiwania optymalnej polityki w kooperatywnej grze Markova. Proces Markova jest opisany w postaci grafów których węzły opisują stan problemu, a krawędzie reprezentują akcje.

5

Multiple hypotheses optimal testing for Markov chains and identification subject to the reliability criterion

Navaei L.

Journal of Mathematics and Applications

|

2010

|

Vol. 33

79-90

EN

The problem of many (L > 2)hypotheses testing on distributions of a finite state Markov chain is studied. We apply large deviation techniques (LDT). It is demonstrated that this method of investigation in solving the problem of logarithmically asymptotically optimal (LAO) hypotheses testing is easier, compared with the procedure introduced by Haroutunian. The matrix of exponents [formula/wzór], of error probabilities of the LAO test [formula/wzór] is the probability to accept the hypothesis l, when the hypothesis m is true, is determined. Moreover, the identification of distributions for one object and two independent objects via simple homogeneous stationary Markov chains with finite number of states is discussed in the present paper.

6

Modele symulacyjne w zasosowaniach wojskowych. Cz. 1, Miejsce metod Monte Carlo w symulacjach numerycznych

Spustek H., Krakowski K.

Zeszyty Naukowe AON

|

2004

|

nr 2(55)

253-263

EN

The article presents the problem of applying computer simulation methods to military problems. Stochastic processes have been discussed, general information relating to the structure of random numbers generators has been given and the algorithm of Monte Carlo method has been described. The algorithm of Monte Carlo method has been presented in a descriptive version (12 steps reduced to 6 steps) and in a graphic way. Monte Carlo methods have been used in computer simulations for many years. Remembering them is to show how topical they are.