Temat: sojourn time - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Methods and algorithms for evaluating unknown parameters of operation processes of complex technical systems
Autorzy:: Kołowrocki, K.
Soszyńska, J.
Powiązania:: https://bibliotekanauki.pl/articles/2069646.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:: system operation process
semi-Markov model
sojourn time
distribution
estimation
maritime transport
Opis:: The paper objectives are to present the methods and tools useful in the statistical identifying unknown parameters of the operation models of complex technical systems and to apply them in the maritime industry. There are presented statistical methods of determining unknown parameters of the semi-markov model of the complex technical system operation processes. There is also presented the chi-square goodness-of-fit test applied to verifying the distributions of the system operation process conditional sojourn times in the particular operation states. Applications of these tools to identifying and predicting the operation characteristics of a ferry operating at the Baltic Sea waters are presented as well.
Źródło:: Journal of Polish Safety and Reliability Association; 2009, 2; 211--222
2084-5316
Pojawia się w:: Journal of Polish Safety and Reliability Association
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Preliminary statistical identification and prediction of the container gantry crane operation process
Autorzy:: Kołowrocki, K.
Soszyńska, J.
Powiązania:: https://bibliotekanauki.pl/articles/2069653.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:: semi-Markov process
system operation process
sojourn time
estimation
Opis:: In the paper a Semi-markov process is used to construct a general model of complex industrial systems’ operation processes. Main parameters of this model are defined and its main characteristics are determined as well. In particular case, for a gantry crane, the operation states are defined, the relationships between them are fixed and particular model of its operation process is constructed and finally its main characteristics are determined.
Źródło:: Journal of Polish Safety and Reliability Association; 2010, 1, 1; 173--180
2084-5316
Pojawia się w:: Journal of Polish Safety and Reliability Association
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: A discrete-time system with service control and repairs
Autorzy:: Atencia, I.
Powiązania:: https://bibliotekanauki.pl/articles/331340.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: discrete time queue
unreliable server
negative customers
busy period
sojourn times
continuous time counterpart
serwer niepewny
odbiorca ujemny
system czasu dyskretnego
Opis:: This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of customers occur. The third strategy acts as a signal, that is, it becomes a negative customer. Also examined is the possibility of failures at each service commencement epoch. We carry out a thorough study of the model, deriving analytical results for the stationary distribution. We obtain the generating functions of the number of customers in the queue and in the system. The generating functions of the busy period as well as the sojourn times of a customer at the server, in the queue and in the system, are also provided. We present the main performance measures of the model. The versatility of this model allows us to mention several special cases of interest. Finally, we prove the convergence to the continuous-time counterpart and give some numerical results that show the behavior of some performance measures with respect to the most significant parameters of the system.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 471-484
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: A discrete-time queueing system with changes in the vacation times
Autorzy:: Atencia, I.
Powiązania:: https://bibliotekanauki.pl/articles/330088.pdf
Data publikacji:: 2016
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: discrete time queueing theory
remaining vacation times
busy period
sojourn times
teoria kolejek
okres zajętości
czas przebywania
Opis:: This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 379-390
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Analysis of an N-policy GI/M/1 queue in a multi-phase service environment with disasters
Autorzy:: Jiang, T.
Ammar, S. I.
Chang, B.
Liu, L.
Powiązania:: https://bibliotekanauki.pl/articles/330836.pdf
Data publikacji:: 2018
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: N-policy
GI/M/1 queue
multiphase service environment
disaster
sojourn time
kolejka GI/M/1
katastrofa
czas pobytu
Opis:: This paper investigates an N-policy GI/M/1 queue in a multi-phase service environment with disasters, where the system tends to suffer from disastrous failures while it is in operative service environments, making all present customers leave the system simultaneously and the server stop working completely. As soon as the number of customers in the queue reaches a threshold value, the server resumes its service and moves to the appropriate operative service environment immediately with some probability. We derive the stationary queue length distribution, which is then used for the computation of the Laplace– Stieltjes transform of the sojourn time of an arbitrary customer and the server’s working time in a cycle. In addition, some numerical examples are provided to illustrate the impact of several model parameters on the performance measures.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 375-386
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Analysis of the Discrete-time Multi-queue System with a Cycle-based Scheduler
Autorzy:: Burakowski, Wojciech
Sosnowski, Maciej
Powiązania:: https://bibliotekanauki.pl/articles/1839463.pdf
Data publikacji:: 2021
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: discrete-time queueing system with vacations
system state distribution
packet sojourn time distribution
virtualized system
Opis:: This paper presents an analysis of a discrete-time multi-queue system handling a number of packet streams. The analysis focuses on calculating system state distribution and packet sojourn time distribution. The method relied upon for determining system state distribution is based on creating a number of equations that are solved numerically. Next, based on the distribution calculated in such a manner, we derive relations for packet sojourn time distribution. The models studied may be useful for instance in a system supporting a number of virtual links (each of a constant bitrate) that share a common physical link. Isolation of performance of those virtual links needs to be assured. Finally, we present some exemplary numerical results showing the usefulness of the proposed analysis for supporting the system dimensioning process.
Źródło:: Journal of Telecommunications and Information Technology; 2021, 2; 68-76
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "sojourn time" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język