On Observable Chaotic Maps for Queuing Analysis
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
A queuing model based on chaotic mapping offers a number of distinct advantages over stochastic and constant deterministic models. Depending on the type of chaotic map used, such a queue can capture transient behavior, intermittency, steady state behavior, and complex distributions in arrival rates. These characteristics are especially desirable in many queuing applications in transportation. Earlier studies resulted in chaotic queuing models that cannot be estimated by using observed arrivals. An alternative queuing model is presented along with methods to specify the model, interpret its results, and estimate its parameters. The proposed queuing model used chaotic maps of interarrival times to generate arrivals so that parameters could be calibrated with observable data. A sample queue based on the ergodic logistic map is presented. For the calibration of the mapping on the basis of observed data, the method of successive averages was used with a joint parameter and state estimation algorithm. Two connected queues illustrated how a purely deterministic queuing network could still result in a joint invariant distribution. The results offer a positive view of this method and its applicability to queuing problems, particularly in the field of transportation and dynamic network loading.
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.005 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.006 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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