MétaCan
Menu
Back to cohort
Record W1513280077 · doi:10.5555/1357910.1357964

A flexible dynamic structure DEVS algorithm towards real-time systems

2007· article· en· W1513280077 on OpenAlex

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

VenueSummer Computer Simulation Conference · 2007
Typearticle
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsCarleton University
Fundersnot available
KeywordsDEVSComputer scienceDistributed computingExploitProcess (computing)Real-time computingModeling and simulationSimulationOperating system

Abstract

fetched live from OpenAlex

A dynamic structure DEVS algorithm - Flexible Dynamic Structure DEVS is introduced in this paper. The dynamic structure is a salient supplementary of the Real-Time DEVS-based experimental environment we proposed before. By adapting the system organization to the changing internal/external environments while the systems are in progress, the functionality of the experimental environment is improved greatly. Consequently, it is possible to build more reliable and flexible Real-Time systems. This paper describes the abstract simulators for dynamic structure DEVS; moreover, the implementing process is presented to show how the dynamic structure abstract simulators work seamlessly with the regular DEVS simulating engine. The Real-Time DEVS-based experimental environment with the dynamic structure function exploits a new space to build reliable and adaptive Real-Time systems.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.906
Threshold uncertainty score0.956

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.097
GPT teacher head0.415
Teacher spread0.318 · 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