Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Markov chain" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 55
Tytuł:
On effective algorithms solving regularity of Markov chains
Efektywne algorytmy rozstrzygania regularności łańcuchów Markowa
Autorzy:
Dańko, A.
Sawicka, A.
Dańko, W.
Powiązania:
https://bibliotekanauki.pl/articles/88396.pdf
Data publikacji:
2016
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
łańcuch Markowa
ergodyczny łańcuch Markowa
regularny łańcuch Markowa
Markov chain
ergodic Markov chain
regular Markov chain
Opis:
We propose algorithms deciding whether a Markov chain with an n_n transition matrix M is regular. The lowest complexity of such an algorithm can be not greater than O(n 3 ) and we argue that it cannot be essentially diminished.
W pracy proponujemy algorytmy rozstrzygające regularność łańcuchów Markowa o macierzy przejść rozmiaru n x n. Najniższa złożoność takiego algorytmu może być nie większa niż O(n 3 i podana jest argumentacja, że nie można jej istotnie obniżyć.
Źródło:
Advances in Computer Science Research; 2016, 13; 5-25
2300-715X
Pojawia się w:
Advances in Computer Science Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Markov Chains to analyse the AIS availability
Autorzy:
Jaskólski, K.
Powiązania:
https://bibliotekanauki.pl/articles/320723.pdf
Data publikacji:
2011
Wydawca:
Polskie Forum Nawigacyjne
Tematy:
AIS
availability
Markov chain
Opis:
Despite the initial objections, crew members and vessel traffic service staff use automatic identification system in their activities. In the phase of system implementation, inability to receive signals at scheduled time was raised, and evidenced. The research on AIS availability was conducted by the authors in 2006 and the results were presented in [Felski A., Jaskólski K, 2011]. This paper analyses the problem of AIS availability. Availability has been studied from the standpoint of the quality of data transmission channel. An attempt was made to assess the availability of the AIS service transmission channel. For this purpose, the theory of Markov processes defined on a discrete state space was applied. The Criterion of state system availability was adopted, stochastic matrix of probabilities of transitions between the states of the availability and accessibility of states limit the probability of AIS. In this paper, author proposed a model for the assessment of AIS Service availability. To meet the objective of the research, recorded data derived from the AIS Base Station HEL were used.
Źródło:
Annual of Navigation; 2011, 18; 5-16
1640-8632
Pojawia się w:
Annual of Navigation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two mutually rarefied renewal processes
Autorzy:
Kopocińska, Ilona
Powiązania:
https://bibliotekanauki.pl/articles/1340626.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
rarefied renewal process
Markov chain
Opis:
Let us consider two independent renewal processes generated by appropriate sequences of life times. We say that a renewal time is accepted if in the time between a signal and the preceding one, some signal of the second process occurs. Our purpose is to analyze the sequences of accepted renewals. For simplicity we consider continuous and discrete time separately. In the first case we mainly consider the renewal process rarefied by the Poisson process, in the second we analyze the process generated by the motion of draughtsmen moved by die tossing.
Źródło:
Applicationes Mathematicae; 1993-1995, 22, 2; 267-273
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On adaptive control of Markov chains using nonparametric estimation
Autorzy:
Drabik, Ewa
Stettner, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/1208175.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
controlled Markov chain
estimation
adaptive control
Opis:
Two adaptive procedures for controlled Markov chains which are based on a nonparametric window estimation are shown.
Źródło:
Applicationes Mathematicae; 2000, 27, 2; 143-152
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mathematical model of mixing in Rumen
Autorzy:
Szlenk, Wiesław
Powiązania:
https://bibliotekanauki.pl/articles/1339321.pdf
Data publikacji:
1996
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
ergodic
rumen
Markov chain
Baker Transformation
Opis:
A mathematical model of mixing food in rumen is presented. The model is based on the idea of the Baker Transformation, but exhibits some different phenomena: the transformation does not mix points at all in some parts of the phase space (and under some conditions mixes them strongly in other parts), as observed in ruminant animals.
Źródło:
Applicationes Mathematicae; 1996-1997, 24, 1; 87-95
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling CTMC with a standard programming language and using conventions from computer networking
Modelowanie łańcuchów Markowa z czasem ciągłym przy użyciu standardowego języka programowania i z zastosowaniem konwencji z dziedziny sieci komputerowych
Autorzy:
Rataj, A.
Nowak, M.
Pecka, P.
Powiązania:
https://bibliotekanauki.pl/articles/375742.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Markov chain
continuous time
model checking
Java
Opis:
Continuous time Markov chains (CTMC) are one of the formalisms for building models. This paper discusses expressing these models in a standard programming language – Java. Using such a language as a model description allows for a partially common implementation of the production software and of the description of the model, for a greater flexibility in comparison to model-checker specific languages that often do not employ features of an object-oriented programming. Using Java also makes the parsing of models relatively fast, using optimised Java runtime environment. Our approach aims at using typical mechanisms of the Java language when implementing the model, and at the same time, following closely the concepts from computer networking and from formalisms based on it, like the queueing systems. These assumption result in techniques like plain object fields constituting the state vector, or negotiation between nodes to decide if an event happens.
Łańcuchy Markowa czasu rzeczywistego są jednym z formalizmów używanych do budowy modeli. Artykuł ten omawia wyrażanie takich modeli w standardowym języku programowania - Javie. Użycie takiego języka umożliwia częściowo wspólną implementację oprogramowania użytkowego i opisu modelu, większą elastyczność w porównaniu do często nie używających obiektowych konwencji programistycznych języków stosowanych przez oprogramowanie weryfikujące, oraz szybką budowę modelu z użyciem zoptymalizowanego środowiska czasu wykonania Javy. Nasze podejście miało na celu wykorzystanie typowych mechanizmów języka Java przy opisie modelu i jednoczesnie trzymanie się konwencji z dziedziny sieci komputerowych i pokrewnych formalizmóm typu systemy kolejkowe. Dlatego używamy technik takich jak zastosowanie pól obiektów jako elementów wektora stanu czy negocjacja pomiędzy węzłami, czy dane zdarzenie ma mieć miejsce.
Źródło:
Theoretical and Applied Informatics; 2011, 23, 3-4; 229-243
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of Polish mutual funds performance: a Markovian approach
Autorzy:
Filip, Dariusz
Rogala, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/1363627.pdf
Data publikacji:
2021-03-03
Wydawca:
Główny Urząd Statystyczny
Tematy:
Markov chain
smart money effect
effectiveness
performance inertia
Opis:
The aim of this study is to determine whether mutual funds provide benefits for their clients. The performance of Polish mutual funds has been evaluated in terms of their efficiency, including their potential inertia over time. Moreover, the use of the phenomenon of economies of scale resulting from assets inflow to the fund by means of the Markovian framework has been examined. The results are consistent with the efficient market hypothesis. When assessing the market-adjusted returns, underperformance was noticed in both small and large funds. The smart money effect, recognised in the literature, is not confirmed here; however, there are some noticeable investor reactions, such as the phenomenon of chasing performance.
Źródło:
Statistics in Transition new series; 2021, 22, 1; 115-130
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of Markov chain model to the description of Hungarian market processes
Autorzy:
Lipták, Katalin
Powiązania:
https://bibliotekanauki.pl/articles/639694.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
discrete-time Markov chain
transition probability
labor market processes
Opis:
Different methods can be selected from the statistical mathematical toolbar to describe labor market processes. The paper applies Markov model, a method rarely used in regard to labor market. This method is popular in several disciplines including regional economics to manage income inequalities, sociology, microeconomics and public health. The advantage of the model is that it illustrates well the mobility in each status making it easier to generate predictions. The paper examines NUTS3 level unemployment data in Hungary over the period 1992–2009 using Markov chain model.
Źródło:
Zarządzanie Publiczne; 2011, 4(16); 133-149
2084-3968
Pojawia się w:
Zarządzanie Publiczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Testing the randomness of lithostratigraphic successions with the Markov Chain methods
Autorzy:
Doktor, M.
Krawczyk, A.
Mastej, W.
Powiązania:
https://bibliotekanauki.pl/articles/191918.pdf
Data publikacji:
2010
Wydawca:
Polskie Towarzystwo Geologiczne
Tematy:
Markov chain methods
Monte Carlo methods
coal-bearing successions
Opis:
The crucial role in the studies on layer successions in lithostratigraphic sections with the application of stochastic model of depositional processes represented by the Markov chain is played by correct estimation of the matrix of transition numbers between lithofacies expected in a random sequence. Methods known from the literature are iteration procedures, which do not ensure quick, general solution. Hence, we propose a universal method based upon the Monte Carlo simulation technique. This method enables the researcher to estimate precisely and reliably the expected matrix of facies transitions.
Źródło:
Annales Societatis Geologorum Poloniae; 2010, 80, No 2; 163-166
0208-9068
Pojawia się w:
Annales Societatis Geologorum Poloniae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pairs of successes in Bernoulli trials and a new n-estimator for the binomial distribution
Autorzy:
Kühne, Wolfgang
Neumann, Peter
Stoyan, Dietrich
Stoyan, Helmut
Powiązania:
https://bibliotekanauki.pl/articles/1340510.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
n-estimator
simulation
silicon wafer
Markov chain
binomial distribution
Opis:
The problem of estimating the number, n, of trials, given a sequence of k independent success counts obtained by replicating the n-trial experiment is reconsidered in this paper. In contrast to existing methods it is assumed here that more information than usual is available: not only the numbers of successes are given but also the number of pairs of consecutive successes. This assumption is realistic in a class of problems of spatial statistics. There typically k = 1, in which case the classical estimators cannot be used. The quality of the new estimator is analysed and, for k > 1, compared with that of a classical n-estimator. The theoretical basis for this is the distribution of the number of success pairs in Bernoulli trials, which can be determined by an elementary Markov chain argument.
Źródło:
Applicationes Mathematicae; 1993-1995, 22, 3; 331-337
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of the change of qualitative states of transportation system operation
Autorzy:
Muślewski, Ł
Knopik, L.
Woropay, M.
Powiązania:
https://bibliotekanauki.pl/articles/247633.pdf
Data publikacji:
2014
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
transport
system operation quality
model
Markov chain
semi-Markov process
expected coast
Opis:
This paper deals with the problems connected with evaluation of a technical system and its being later used for decision making in order to provide complex technical systems with appropriate operation quality. The research object is a real municipal transportation system. The assessment quality of the systems operation is based on the changes of the systems features values. The features describe the operation of the systems operators, controlled technical objects and the environment influence. The assessment and the support the demand quality of the systems operation from the safety, efficiency, economic and reliability point of view is the basic factor of the executed exploitation process. The notion of a system operation quality has been defined, a scheme of an assessment model has been presented and a random process, providing the basis for evaluation of a technical system, has been developed. On the basis of carried out experimental tests there have been distinguished four states of a system operation quality reflecting intervals of values of grades that were characteristic for given time moments. A model of system operation qualitative state changes, based on Markov chain, has been considered in this paper. A system of equations has been determined for a distinguished Markov chain on the basis of which a mathematical model for assessment and control of selected types of transportation systems will be developed.
Źródło:
Journal of KONES; 2014, 21, 3; 251-257
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The use of Markov chains of kth row in computer management of transport in a supply chain
Autorzy:
Topolski, M.
Powiązania:
https://bibliotekanauki.pl/articles/393723.pdf
Data publikacji:
2017
Wydawca:
Polskie Stowarzyszenie Telematyki Transportu
Tematy:
supply chain
internal transport
Markov chain
łańcuch dostaw
transport wewnętrzny
łańcuch Markowa
Opis:
At present a supply chain poses quite a challenge. The paper presents one the methods supporting decision makers in a supply chain, namely a Markov chain of kth row. This theory constitutes an important part of the law of probability and it is also associated with soft calculation methods e.g. fuzzy sets. It may be applied in numerous fields e.g. physics, genetics, meteorology and technical disciplines. The Markov chain method may be used when assumptions about independence of events and random variables cannot be made. Thanks to this method social-economic phenomena may be predicted. These characteristics made the author attempt to create a model based on the Markov chains of kth row in a supply chain. The focus was on sales planning accounting for safety stocks planning and various characteristic of this supply chain.
Źródło:
Archives of Transport System Telematics; 2017, 10, 4; 47-51
1899-8208
Pojawia się w:
Archives of Transport System Telematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of methods used for filling partially unobserved contingency tables
Autorzy:
Kot, Michał
Kamiński, Bogumił
Powiązania:
https://bibliotekanauki.pl/articles/2034044.pdf
Data publikacji:
2021-03-30
Wydawca:
Główny Urząd Statystyczny
Tematy:
contingency tables
Markov Chain Monte Carlo
Iterative Proportional Fitting Procedure
Opis:
In this article, we investigate contingency tables where the entries containing small counts are unknown for data privacy reasons. We propose and test two competitive methods for estimating the unknown entries: our modification of the Iterative Proportional Fitting Procedure (IPFP), and one of the Monte Carlo Markov Chain methods called Shake-and-Bake. We use simulation experiments to test these methods in terms of time complexity and the accuracy of searching the space of feasible solutions. To simplify the estimation procedure, we propose to pre-process partially unknown contingency tables with simple heuristics and dimensionality-reduction techniques to find and fill all trivial entries. Our results demonstrate that if the number of missing cells is not very large, the pre-processing is often enough to find fillings for the unknown values in contingency tables. In the cases where simple heuristics are insufficient, the Shake-and-Bake technique outperforms the modified IPFP in terms of time complexity and the accuracy of searching the space of feasible solutions.
Źródło:
Przegląd Statystyczny; 2021, 68, 4; 1-20
0033-2372
Pojawia się w:
Przegląd Statystyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Markov Model of Cyber Attack Life Cycle Triggered by Software Vulnerability
Autorzy:
Hoffmann, Romuald
Powiązania:
https://bibliotekanauki.pl/articles/1844613.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Markov model
cyber-attack
vulnerability
life cycle
homogenous Markov process
continuous time Markov chain
Opis:
Software vulnerability life cycles illustrate changes in detection processes of software vulnerabilities during using computer systems. Unfortunately, the detection can be made by cyber-adversaries and a discovered software vulnerability may be consequently exploited for their own purpose. The vulnerability may be exploited by cyber-criminals at any time while it is not patched. Cyber-attacks on organizations by exploring vulnerabilities are usually conducted through the processes divided into many stages. These cyber-attack processes in literature are called cyber-attack live cycles or cyber kill chains. The both type of cycles have their research reflection in literature but so far, they have been separately considered and modeled. This work addresses this deficiency by proposing a Markov model which combine a cyber-attack life cycle with an idea of software vulnerability life cycles. For modeling is applied homogeneous continuous time Markov chain theory.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 1; 35-41
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analytical Study of the Distance Change on IEEE 802.11ah Standard using Markov Chain Model
Autorzy:
Perdana, Doan
Sakhrul, Amirah Amaliah
Erfianto, Bayu
Marwan, Abdul Aziz
Powiązania:
https://bibliotekanauki.pl/articles/27311947.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
Enhanced Distributed Channel Access
Markov Chain
802.11ah
RAW
Opis:
This research proposed a model of Enhanced Distributed Channel Access (EDCA) scheme which is one of the techniques used in reducing collision and usually prioritized due to its contention window to determine the impact of distance change on the IEEE 802.11 ah standard. The proposed model was analyzed using the Markov Chain approach to determine the effect of distance change on collisions levels while the numerical were simulated using MATLAB. Moreover, the Markov chain solution was used to evaluate parameters such as throughput, energy consumption, and delay. The results showed the increment in RAW slot duration and the distance change for each station can reduce the performance on the standard and the scenario when the RAW slot duration was changed by 50 ms performed better than 100 ms and 250 ms.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 4; 745--749
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 55

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies