MétaCan
Menu
Back to cohort
Record W1973012941 · doi:10.1109/infocom.2014.6848152

Probability distribution of spectral hole duration in cognitive networks

2014· article· en· W1973012941 on OpenAlexaff
Jelena Mišić, Vojislav B. Mišić

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsIdleExponential distributionIndependent and identically distributed random variablesCognitive radioChannel (broadcasting)Proxy (statistics)Probability distributionMathematicsRandom variableExponential functionComputer scienceTopology (electrical circuits)Exponential growthStatisticsStatistical physicsTelecommunicationsPhysicsMathematical analysisCombinatorics

Abstract

fetched live from OpenAlex

Operation of cognitive secondary networks is critically dependent on the activity patterns of primary users. In this paper, we investigate the probability distribution of spectral holes, assuming that active and idle periods of primary users are independent random variables (which need not be identically distributed). We consider black, white, and gray holes, which correspond to time intervals when all channels are busy, all channels are idle, and some channels are busy while others are idle, respectively. We show that the duration of black and white holes may be described using an exponential approximation which holds regardless of the actual probability distribution of channel active and idle times, as long as the number of channels is not too small. The time interval between successive black hole occurrences is shown to be exponentially distributed as well. We also analyze the behavior of gray holes and quantify their impact using a simple proxy measure.

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 imitation

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

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
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.017
GPT teacher head0.234
Teacher spread0.217 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations12
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicCognitive Radio Networks and Spectrum SensingFrench-language works237,207