Transient behaviour of the M/M/2 queue with catastrophes
This paper presents a transient solution for the system size in the M/M/2 queue with the possibility of catastrophes at the service stations. The state probability of the system size at time t, where the queue starts with any number of customers, in ...
B. Krishna Kumar, S. Pavai Madheswari
doaj +1 more source
Mixed Vehicle Flow At Signalized Intersection: Markov Chain Analysis
We assume that a Poisson flow of vehicles arrives at isolated signalized intersection, and each vehicle, independently of others, represents a random number X of passenger car units (PCU’s). We analyze numerically the stationary distribution of the queue
Gertsbakh Ilya B.
doaj +1 more source
Design of feedback controller for TCP/AQM networks
In this paper, we propose a novel proportional-differential-type feedback controller called Novel-PD as new active queue management (AQM) to regulate the queue length with small oscillation. It measures the current queue length and uses the current queue
Sukant Kishoro Bisoy +1 more
doaj +1 more source
This research investigated a single bulk server queuing model where service modes and server vacations are dependent on the number of clients. The server operates in three different service modes: single service, fixed batch service, and variable batch ...
Subramani Palani Niranjan +2 more
doaj +1 more source
Web-Based Patient Queue Number Registration Application at Sidodadi Puskesmas, Sidoarjo District
Information Technology plays a dominant role in society, enabling quick and accurate access to information. The Sidodadi Health Center in Sidoarjo Regency aims to improve outpatient registration efficiency by developing a web-based system. Currently, the manual registration process leads to long waiting times.
Muhammad Nabila Akmal Wijaya +1 more
openaire +2 more sources
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
As an alternative to previously existing planar graph product structure theorems, we prove that every planar graph $G$ is a subgraph of the strong product of $K_2$, a path and a planar subgraph of a $4$-tree. As an application, we show that the queue number of planar graphs is at most $38$ whereas the queue number of planar bipartite graphs is at most $
openaire +2 more sources
Triage effectiveness: a framework for quantifying the effect of emergency triage prioritization. [PDF]
Johansson A +4 more
europepmc +1 more source
Gaussian Process Regression for Tail Vehicle Departure Time Prediction at Signalized Intersections Using UAV Trajectory Data. [PDF]
Lu K, Liu Z, Zhang R, Xia Q, Wang R.
europepmc +1 more source
Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases. [PDF]
Le N, Vo H, Nguyen T.
europepmc +1 more source
Time aware cyclic queuing forwarding traffic scheduling algorithm considering reallocation and priority sorting (RPS-TACQF). [PDF]
Shen Y, Chen X, Ma X.
europepmc +1 more source

