MétaCan
Menu
Back to cohort
Record W1969034729 · doi:10.1109/pimrc.2011.6139975

Reduced complexity multiband multi-sensor spectrum sensing

2011· article· en· W1969034729 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsQueen's University
Fundersnot available
KeywordsPartially observable Markov decision processComputer scienceDetectorFalse alarmConstant false alarm rateExploitConstraint (computer-aided design)Real-time computingMarkov decision processMarkov processAlgorithmMarkov chainMarkov modelArtificial intelligenceMathematicsMachine learningTelecommunications

Abstract

fetched live from OpenAlex

A spectrum sensing problem in which multiple sensors are used to detect an idle period in multiple channels is considered in this paper. By casting the problem using a partially observable Markov decision process (POMDP), a sequential detection scheme that minimizes the expected detection time and false alarm is described. Recent research shows that the POMDP formulation can be applied to spectrum sensing problems that sense multiple channels using only one sensor. This paper shows that this approach can be generalized to systems that incorporate an arbitrary number of sensors. Based on this more general procedure, this paper proposes two sequential detection schemes that exploit the additional sensors to reduce the detection time in the spectrum sensing system while maintaining its false alarm rate under a desired design constraint. The performances of the two detectors are investigated through Monte Carlo simulation.

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

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.097
GPT teacher head0.259
Teacher spread0.163 · 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