Informacja

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

Wyszukujesz frazę "positive/negative" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Investigation of G-networks with restart at a non-stationary mode and their application
Autorzy:
Matalytski, Mikhail
Naumenko, Victor
Kopats, Dmitry
Powiązania:
https://bibliotekanauki.pl/articles/122538.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queueing network
G-network
positive and negative customers
non-stationary regime
multiple type customers
signals
restart
nonstationary state probabilities
successive approximation method
sieć kolejkowa
sieć G
sygnały
metoda aproksymacji
aproksymacja
teoria kolejek
pozytywny klient
negatywny klient
Opis:
This article discusses the question of restarting the script, when restart is used by many users of the information network, which can be modelled as a G-network. Negative claims simulate the crash of the script and the re-sending of the request. Investigation of an open queuing network (QN) with several types of positive customers with the phase type of distribution of their service time and one type of negative customers have been carried out. Negative customers are signals whose effect is to restart one customers in a queue. A technique is proposed for finding the probability of states. It is based on the use of a modified method of successive approximations, combined with the method of a series. The successive approximations converge with time to a stationary distribution of state probabilities, the form of which is indicated in the article, and the sequence of approximations converges to the solution of the difference-differential equations (DDE) system. The uniqueness of this solution is proved. Any successive approximation is representable in the form of a convergent power series with an infinite radius of convergence, the coefficients of which satisfy recurrence relations, which is convenient for computer calculations. A model example illustrating the finding of time-dependent probabilities of network states using the proposed technique is also presented.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 2; 41-51
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of HM-network with positive and negative claims for finding of memory volumes in information systems
Autorzy:
Matalytski, Mikhail
Zając, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/122992.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
HM-networks
information systems
volume of claim
positive claims
negative claims
sieci HM
systemy informacyjne
roszczenie pozytywne
roszczenie negatywne
Opis:
To solve the problem of determining the volume of memory of information systems (IS), it was suggested to use a stochastic model based on the use of HM (Howard-Matalytski) - a queueing network with revenues. This model allows you to take into account the dependencies of the processing times of messages (claims) on their volumes, the possibility of changing the volume of messages over time, and also the possibility of getting computer viruses into it. In such cases the processing of messages in nodes can be interrupted for some random time. Expressions are obtained for the mean (expected) values of the total message volumes in the IS nodes.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 1; 41-51
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of HM-networks with positive and negative heterogeneous requests for finding memory volume in information systems
Autorzy:
Matalytski, Mikhail
Zajac, Pawel
Kopats, Dmitry
Powiązania:
https://bibliotekanauki.pl/articles/1839809.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
HM-network
information systems
volumes of requests
positive heterogeneous request
negative heterogeneous request
sieć HM
sieć kolejkowa
system informacyjny
pojemność pamięci
Opis:
To determine the memory volume of information systems (IS), it was proposed to use a stochastic model, based on the use of a queueing network with bypasses, known as an HM-network. This model includes the servicing of heterogeneous requests along with their volumes, the ability to change the volume of such requests with their passage of time and the possibility of finding computer viruses in them, and therefore servicing requests can be interrupted at some random time. The expressions were obtained for the expected total values of the volume of requests in IS nodes.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 67-77
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of HM-networks with positive and negative heterogeneous requests for finding memory volume in information systems
Autorzy:
Matalytski, Mikhail
Zajac, Pawel
Kopats, Dmitry
Powiązania:
https://bibliotekanauki.pl/articles/122732.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
HM-network
information systems
volumes of requests
positive heterogeneous request
negative heterogeneous request
sieć HM
sieć kolejkowa
system informacyjny
pojemność pamięci
Opis:
To determine the memory volume of information systems (IS), it was proposed to use a stochastic model, based on the use of a queueing network with bypasses, known as an HM-network. This model includes the servicing of heterogeneous requests along with their volumes, the ability to change the volume of such requests with their passage of time and the possibility of finding computer viruses in them, and therefore servicing requests can be interrupted at some random time. The expressions were obtained for the expected total values of the volume of requests in IS nodes.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 67-77
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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