MétaCan
Menu
Back to cohort
Record W4245468176 · doi:10.1109/wsc.2004.1371455

Simulation Input Updating Using Bayesian Techniques

2005· article· en· W4245468176 on OpenAlex
Tae Chung, Yousif Ahmed Mohamed, Simaan AbouRizk

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueProceedings of the 2004 Winter Simulation Conference, 2004. · 2005
Typearticle
Languageen
FieldEngineering
TopicGeotechnical Engineering and Analysis
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceBayesian probabilityQuality (philosophy)Machine learningTerm (time)Data miningArtificial intelligence

Abstract

fetched live from OpenAlex

Simulation built on assumption and approximation has been traditionally utilized to make predictions prior to construction. Although there are many benefits of simulation such as its capability of multiple experiments with various scenario assumptions, it may lead to erroneous predictions when simulation input data are not accurate. Long-term repetitive projects such as tunnel construction provide opportunities to fine-tune the simulation input parameters based on real project progress. Bayesian updating techniques represent a very effective approach to enhance the quality of the estimates based on the observed data. This paper outlines some benefits that can be achieved using Bayesian updating techniques. The major benefits of these techniques includes more accurate simulation outcome even at the early stage of the project.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.734
Threshold uncertainty score0.765

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.015
GPT teacher head0.247
Teacher spread0.233 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it