MétaCan
Menu
Back to cohort
Record W2015629629 · doi:10.1109/jcn.2001.6596800

Capacity improvement in cellular systems with reuse partitioning

2001· article· en· W2015629629 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

VenueJournal of Communications and Networks · 2001
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsBlocking (statistics)Computer scienceMarkov chainChannel (broadcasting)ReuseChannel capacityCall blockingMarkov processProduct (mathematics)AlgorithmMathematicsTelecommunicationsComputer networkStatisticsQuality of service

Abstract

fetched live from OpenAlex

Reuse Partitioning (RP) is a simple technique that can be used to increase the capacity of a cellular system. With RP, a cell is divided into several concentric regions, each associated with a different cluster size. In this paper, a Markov chain model is developed to evaluate the call blocking probability, Pb, of the basic (no channel rearrangement) n-region RP using fixed channel allocation (FCA). Channel rearrangements are introduced to further improve the capacity. For a certain RP scheme with multiple channel rearrangements (MCR), Pb is shown to have a known product-form solution. It is found that a single channel rearrangement scheme performs almost as well as the MCR scheme. One advantage of MCR is that it reduces the difference in Pb experienced by calls in the different regions. It is shown that the capacity with two-region (four-region) RP with MCR is about 25% (45%) higher than that of a conventional FCA system. The effect of moving users on call blocking and dropping probabilities is also examined.

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 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.767
Threshold uncertainty score0.482

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0030.001
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.038
GPT teacher head0.266
Teacher spread0.227 · 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