MétaCan
Menu
Back to cohort
Record W2396497375 · doi:10.5539/jmr.v8n3p44

Strong Masting Conjecture for Multiple Size Hexagonal Tessellation in GSM Network Design

2016· article· en· W2396497375 on OpenAlexvenueno aff
S. K. Amponsah, Elvis Kobina Donkoh, James Adu Ansere, Kusi A. Bonsu

Bibliographic record

VenueJournal of Mathematics Research · 2016
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsnot available
Fundersnot available
KeywordsConjectureGSMHexagonal crystal systemMathematicsTessellation (computer graphics)CombinatoricsRange (aeronautics)Cell sizeDiscrete mathematicsGeometryTelecommunicationsComputer scienceCrystallographyEngineeringChemistry

Abstract

fetched live from OpenAlex

One way to improve cellular network performance is to use efficient handover method and design pattern among other factors. The efficient design pattern has been proven geometrically to be hexagonal (Hales, 2001, pp. 1- 22) due to its maximum tessellable area coverage. But uneven geographical distribution of subscribers requires tessellable hexagons of different radii due to variation of costs of GSM masts. This will call for an overlap difference. The constraint of minimum overlap difference for multiple cell range is a new area that is untapped in cell planning. This paper addresses such multiple size hexagonal tessellation problem using a conjecture. Data from MTN River State-Nigeria, was collected. Multiple Size Hexagonal Tessellation Model (MSHTM) conjecture for masting three (3) different size MTN GSM masts in River State, accounted for least overlap difference with area of 148.3km2 using 36 GSM masts instead of the original 21.48 km2 for 50 GSM masts. Our conjecture generally holds for k-different (k>=2 ) cell range.

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.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0070.001

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.109
GPT teacher head0.329
Teacher spread0.221 · 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 designTheoretical or conceptual
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

Citations0
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Mathematics ResearchSame topicgraph theory and CDMA systemsFrench-language works237,207