MétaCan
Menu
Back to cohort
Record W2154022955 · doi:10.5555/2675983.2676344

Application of the DEVS and Cell-DEVS formalisms for modeling networking applications

2013· article· en· W2154022955 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

VenueWinter Simulation Conference · 2013
Typearticle
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsCarleton University
Fundersnot available
KeywordsDEVSRotation formalisms in three dimensionsComputer scienceFormalism (music)Distributed computingWireless sensor networkComputer networkBase stationWirelessDiscrete event simulationModeling and simulationWireless networkSimulationTelecommunications

Abstract

fetched live from OpenAlex

We present the use of DEVS and Cell-DEVS formalisms to model different approaches in networking applications. We discuss various applications of discrete event system specifications for modeling and simulation of Wireless networks and Wireless Sensor Networks (WSN). We discuss how to use the Cell-DEVS formalism to model a WSN for investigating on stochastic properties of malware propagation and the intrinsic characteristic of WSN. We also discuss the use of DEVS to model a cellular network including a wide geographical area, various Cells and varied User Equipment. Finally, we discuss how to use the cell DEVS formalism to model mobile networks, and how the Cell-DEVS formalism can be used to track mobile user movement in a covered area. The latter model tries to find out the number of Base Stations which cover a mobile user in different location of an area and how to improve QoS based on different configurations (in particular for the UEs near the cell borders).

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.960
Threshold uncertainty score0.359

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.0010.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.120
GPT teacher head0.380
Teacher spread0.260 · 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