MétaCan
Menu
Back to cohort
Record W2170974177 · doi:10.1109/glocom.2005.1578445

GSECps: a diversity technique with improved performance-complexity tradeoff

2005· article· en· W2170974177 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

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsComputer scienceFadingRayleigh fadingDiversity combiningSignal-to-noise ratio (imaging)Selection (genetic algorithm)Computational complexity theoryDiversity schemeDiversity (politics)AlgorithmPerformance improvementScheme (mathematics)Diversity gainCooperative diversityTelecommunicationsMathematicsDecoding methodsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

To efficiently take advantage of the potential diversity benefits of diversity-rich environments, we need combining schemes that can achieve good performance-complexity tradeoff. In this paper, noting the performance limitation of the recently proposed generalized switch and examine combining (GSEC) scheme over the low signal to noise ratio (SNR) region, we develop a new low-complexity combining scheme. The new scheme, termed as GSEC with post-examine selection (GSECps), can offer improved performance over GSEC by operating in the same way as generalized selection combining (GSC) when fading condition is unfavorable. Through thorough performance and complexity analysis of GSECps over i.i.d. Rayleigh fading channels, we show that GSECps can obtain a better performance-complexity tradeoff than both GSEC and GSC schemes.

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 categoriesMeta-epidemiology (narrow), Science and technology studies, Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.765
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0020.001
Scholarly communication0.0000.002
Open science0.0070.003
Research integrity0.0000.001
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.057
GPT teacher head0.276
Teacher spread0.218 · 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