M/GI/1 queues with services of both positive and negative customers
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We consider an M/GI/1 queue with two types of customers, positive and negative, which cancel each other out. The server provides service to either a positive customer or a negative customer. In such a system, the queue length can be either positive or negative and an arrival either joins the queue, if it is of the same sign, or instantaneously removes a customer of the opposite sign at the end of the queue or in service. This study is a generalization of Gelenbe's original concept of a queue with negative customers, where only positive customers need services and negative customers arriving at an empty system are lost or need no service. In this paper, we derive the transient and the stationary probability distributions for the major performance measures in terms of generating functions and Laplace transforms. It has been shown that the previous results for the system with negative arrivals of zero service time are special cases of our model. In addition, we obtain the stationary waiting time distribution of this system in terms of a Laplace transform.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it