A stochastic computational model for yellow time determination and its application
Bibliographic record
Abstract
Summary This paper proposes a stochastic model to determine the yellow time according to the occurring probability of Type‐I dilemma zone (PDZ). Unlike the conventional methods generally based on the deterministic traffic flow theory, the proposed model fully accounts for the randomness of input variables such as approaching speed, deceleration rate, perception‐and‐reaction time, and distance to stop‐line at the yellow onset. A theoretical model is firstly established, and a computational program incorporating Monte Carlo Simulation is then developed to facilitate its general solution. These two alternative solution approaches to derive PDZ and Y are proposed, depending upon whether D/V and (τ + V/2d) follow certain analytical distributions or not. In addition, field data at a typical high‐speed highway intersection are collected to validate the model. Based on the validated model, comprehensive sensitivity analysis is conducted to look into the entire picture of the relationship between PDZ and the distributions as well as correlations of the input variables. To demonstrate the application of the proposed model, the required yellow times for various conditions are calculated based on the acceptable levels of PDZ, and representative application tables for typical cases are finally provided. With the aid of the proposed methodology, traffic engineers are capable of designing yellow time in a more sophisticated manner. Copyright © 2014 John Wiley & Sons, Ltd.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".