Wszystkie pola: negative - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Simulation modeling of HM-networks with consideration of positive and negative messages
Autorzy:: Naumenko, V.
Matalytski, M.
Powiązania:: https://bibliotekanauki.pl/articles/122640.pdf
Data publikacji:: 2015
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-network
incomes
negative messages
simulation modeling
HM-sieci
dochody
modelowanie symulacyjne
Opis:: In the article an open Queueing Network (QN) with positive and negative messages and incomes, which can be used in modeling of the behavior of viruses at the Information Systems and Networks (ISN), and also at forecasting costs taking into account virus penetration, was analyzed. Some numerical and analytical results were described on the analysis of exponential QN of the above type. It was given an algorithm of simulation modeling (SM) of HM-networks with positive and negative messages, based on the 0-point, which allows you to find incomes in such networks with arbitrary distribution of service times of positive messages. The results of the SM have been compared with the proposed analytical and numerical results. Sufficiently high accuracy of these methods was shown.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 2; 49-60
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Investigation of networks with positive and negative messages, many-lines queueing systems and incomes
Autorzy:: Naumenko, V.
Matalytski, M.
Powiązania:: https://bibliotekanauki.pl/articles/122391.pdf
Data publikacji:: 2015
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
negative messages
many-lines systems
expected incomes
information systems and networks
Opis:: The analysis of an open Markov Queueing Network with positive and negative messages, many-lines queueing systems and incomes has been carried out. External arrivals to the network, service times of rates and probabilities of messages transition between queueing systems (QS) depend on time. A method for finding the expected incomes of the network systems, the expressions for the average number of messages at the systems has been proposed.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 1; 79-90
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Finding the expected revenues in Markov networks with positive and negative customers at a stationary regime
Autorzy:: Matalytski, M.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122624.pdf
Data publikacji:: 2018
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive and negative customers
signals
expected revenues
stationary regime
sieć G
pozytywny klient
negatywny klient
system kolejkowy
Opis:: Finding the expected revenues in the queueing systems (QS) of open Markov G-networks of two types, with positive and negative customers and with positive customers and signals, has been described in the paper. A negative customer arriving to the system destroys one positive customer if at least one is available in the system, thus reducing the number of positive customers in the system by one. The signal, coming into an empty system (where there are no positive customers), does not have any impact on the network and immediately disappears from it. Otherwise, if the system is not empty, when it receives a signal, the following events can occur: the incoming signal instantly moves the positive customer from one QS into another with a certain probability, or with the other probability, the signal is triggered as a negative customer.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 1; 49-60
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Nonstationary analysis of a queueing network with positive and negative messages
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122613.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: information systems
telecommunications systems
information networks
telecommunications networks
virus
open G-network with negative messages
transient behavior
system of difference-differential equations
probability states
generating function
Opis:: This paper contains an investigation of an open queueing network with positive and negative messages that can be used to model the behavior of viruses in information and telecommunication systems and networks. The purpose of research is investigation of such a network at the transient behavior. We consider the case when the intensity of the incoming flow of positive and negative messages and service intensity of messages do not depend on time. It is assumed that all queueing systems of network are one-line. We obtained a system difference-differential equations for the state probabilities of the network. To find the state probabilities of the network in the transitional behavior applied a methodology based on the use of the apparatus of multidimensional generating functions. We obtained an expression for generating function. An example is calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 61-71
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

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ł

Zmień widok

na półce

Skocz do pozycji: 6.

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ł

Zmień widok

na półce

Skocz do pozycji: 7.

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ł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Analysis of the queueing network with a random waiting time of negative customers at a non-stationary regime
Autorzy:: Naumenko, V.
Matalytski, M.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122923.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive customers
negative customers
random waiting time
heavy-traffic regime
state probabilities
mean characteristics
non-stationary regime
sieci kolejkowe
sieć G
pozytywny klient
negatywny klient
czas oczekiwania
równania różniczkowe
Opis:: In the article a queueing network (QN) with positive customers and a random waiting time of negative customers has been investigated. Negative customers destroy positive customers on the expiration of a random time. Queueing systems (QS) operate under a heavy-traffic regime. The system of difference-differential equations (DDE) for state probabilities of such a network was obtained. The technique of solving this system and finding mean characteristics of the network, which is based on the use of multivariate generating functions was proposed.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 3; 111-122
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 9.

Tytuł:: Analysis of the queueing network with a random bounded waiting time of positive and negative customers at a non-stationary regime
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122455.pdf
Data publikacji:: 2017
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive and negative customers
random bounded waiting time of customers
non-stationary regime
generation function
non-stationary state probabilities
expected revenues
sieć G
pozytywny klient
negatywny klient
teoria kolejek
czas oczekiwania
Opis:: In the first part of the article, an investigation of an open Markov queueing network with positive and negative customers (G-networks) has been carried out. The network receives two exponential arrivals of positive and negative customers. Negative customers do not receive service. The waiting time of customers of both types in each system is bounded by a random variable having an exponential distribution with different parameters. When the waiting time of a negative customer in the queue is over it reduces the number of positive customers per unit if the system has positive customers. The Kolmogorov system of difference-differential equations for non-stationary state probabilities has been derived. The method for finding state probabilities of an investigated network, based on the use of apparatus of multidimensional generating functions has been proposed. Expressions for finding the mean number of positive and negative customers in the network systems have also been found. In the second part the same network has been investigated, but with revenues. The case when revenues from the network transitions between states are random variables with given mean values has been considered. A method for finding expected revenues of the network systems has been proposed. Obtained results may be used for modeling of computer viruses in information systems and networks and also for forecasting of costs, considering the viruses penetration.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 97-108
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 10.

Tytuł:: Application of a z-transforms method for investigation of Markov G-networks
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122773.pdf
Data publikacji:: 2014
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: open G-network
positive and negative messages
expected incomes
z-transforms method
dochody oczekiwane
Opis:: The purpose of this research paper is to find the expected incomes in open Markov queueing networks with incomes, positive and negative messages at any time by the multidimensional transformations. Investigations were carried out in cases when incomes from the network transitions between the states are deterministic functions not dependent on network states and time. It is assumed that all network systems are one-line. It was proved the theorem on the expression for the multidimensional z-transform. An algorithm was proposed for calculation of expected incomes. It is calculated an example on the PC.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 1; 61-73
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 11.

Tytuł:: Investigation of G-network with random delay of signals at nonstationary behaviour
Autorzy:: Matalytski, M.
Naumenko, V.
Powiązania:: https://bibliotekanauki.pl/articles/122322.pdf
Data publikacji:: 2014
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
negative messages
transient behavior
signals with random delay
DDoS-attack
sieć G
stan nieustalony
atak DDoS
Opis:: The object of this research is an open queueing G-network with signals with random delay. The purpose of the research is investigation of such a network at the transient behavior. It is considered the case when the intensity of the incoming flow of positive and negative messages and service intensity of messages do not depend on time. All the systems in the network are one-line. It is described the model of computer system DDoS-attacks, the effect of penetration of the virus in a computer network in the form of G-network with random delay of signals. Approximate expressions are obtained for the time-dependent probabilities of states and the average characteristics of the network. Examples are calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 3; 155-166
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 12.

Tytuł:: Asymptotic analysis of a closed G-network of unreliable nodes
Autorzy:: Rusilko, Tatiana
Powiązania:: https://bibliotekanauki.pl/articles/2175521.pdf
Data publikacji:: 2022
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
unreliable queueing systems
positive customer
negative customer
birth-death process
asymptotic analysis
queueing network
sieć G
proces narodzin i śmierci
analiza asymptotyczna
sieci kolejkowe
Opis:: A closed exponential queueing G-network of unreliable multi-server nodes was studied under the asymptotic assumption of a large number of customers. The process of changing the number of functional servers in network nodes was considered as the birth-death process. The process of changing the number of customers at the nodes was considered as a continuous-state Markov process. It was proved that its probability density function satisfies the Fokker-Planck-Kolmogorov equation. The system of differential equations for the first-order and second-order moments of this process was derived. This allows us to predict the expectation, the variance and the pairwise correlation of the number of customers in the G-network nodes both in the transient and steady state.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2022, 21, 2; 91--102
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 13.

Tytuł:: Investigation of G-network with bypasses of queueing systems by positive customers at a non-stationary regime
Autorzy:: Naumenko, Victor
Kopats, Dmitry
Matalytski, Mikhail
Pankov, Andrey
Powiązania:: https://bibliotekanauki.pl/articles/1839756.pdf
Data publikacji:: 2020
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: queuing network
non-stationary regime
negative customers
bypass
sieć kolejkowa
negatywny klient
pozytywny klient
Opis:: An open queuing network (QN) with single-line queuing systems (QS) is considered. QS are characterized by the presence of bypasses and the possibility of coming of negative customers. The network receives two independent elementary streams. The first stream is formed from the ordinary (positive) customers, while the second is composed of negative customers. Arriving of each negative customer to the system destroys exactly one positive customer in the queue, if those are contained. Negative customers do not require maintenance as the service of positive customers in the network systems is carried out in accordance with the FIFO discipline. Positive customers with a probability depending on the state of the node when they are sent to it are added to the queue, and with an additional probability, they immediately bypass it and behave in the future as served. The service in the systems is exponential, the routing of positive customers in the network is Markov, taking into account the possibility of turning the customer into a negative one after sending it to another system.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 3; 85-97
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 14.

Tytuł:: About one method of finding expected incomes in HM-queueing network with positive customers and signals
Autorzy:: Matalytski, M.
Powiązania:: https://bibliotekanauki.pl/articles/122974.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: HM-queueing network
positive and negative customers
signals
expected incomes
ransient regime
kolejkownie sieci
systemy kolejkowe
pozytywny klient
negatywny klient
teoria kolejek
Opis:: In the paper an open Markov HM(Howard-Matalytski)-Queueing Network (QN) with incomes, positive customers and signals (G(Gelenbe)-QN with signals) is investigated. The case is researched, when incomes from the transitions between the states of the network are random variables (RV) with given mean values. In the main part of the paper a description is given of G-network with signals and incomes, all kinds of transition probabilities and incomes from the transitions between the states of the network. The method of finding expected incomes of the researched network was proposed, which is based on using of found approximate and exact expressions for the mean values of random incomes. The variances of incomes of queueing systems (QS) was also found. A calculation example, which illustrates the differences of expected incomes of HM-networks with negative customers and QN without them and also with signals, has been given. The practical significance of these results consist of that they can be used at forecasting incomes in computer systems and networks (CSN) taking into account virus penetration into it and also at load control in such networks.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 1; 87-98
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 15.

Tytuł:: Finding the probabilistically-temporal characteristics of Markov G-network with batch removal of positive customers
Autorzy:: Matalytski, M.
Naumenko, V.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122998.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
positive and negative customers
customers batch removal
nonstationary regime
generation function
state probabilities
teoria kolejek
systemy kolejkowe
pozytywny klient
Opis:: The investigation of a Markov queueing network with positive and negative customers and positive customers batch removal has been carried out in the article. The purpose of the research is analysis of such a network at the non-stationary regime, finding the time-dependent state probabilities and mean number of customers. In the first part of this article, a description of the G-network operation is provided with one-line queueing systems. When a negative customer arrives to the system, the count of positive customers is reduced by a random value, which is set by some probability distribution. Then for the non-stationary state probabilities a Kolmogorov system was derived of differencedifferential equations. A technique for finding the state probabilities and the mean number of customers of the investigated network, based on the use of an apparatus of multidimensional generating functions has been proposed. The theorem about the expression for the generating function has been given. A model example has been calculated.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 4; 125-136
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "negative" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język