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 OpenAlexaff
Jason C. K. Liang, Steven D. Blostein

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.

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.001
metaresearch head score (Gemma)0.002
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: none
Teacher disagreement score0.002
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
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.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

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

Citations3
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Sensor Networks and Detection AlgorithmsFrench-language works237,207