MétaCan
Menu
Back to cohort

An Accurate Approximation of the Exponential Integral Function Using a Sum of Exponentials

2013· article· en· W2059437848 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

VenueIEEE Communications Letters · 2013
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsHybrid automatic repeat requestExponential functionComputer scienceInterference (communication)Automatic repeat requestFunction (biology)Signal-to-noise ratio (imaging)AlgorithmApplied mathematicsExpression (computer science)Moment-generating functionMathematicsMathematical optimizationChannel (broadcasting)Probability density functionTelecommunications linkStatisticsTelecommunicationsMathematical analysis

Abstract

fetched live from OpenAlex

This paper proposes a novel approximation for the exponential integral function, E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> [x], using a sum of exponential functions. This approximation facilitates studying the error probability of a number of communication techniques in the presence of Co-Channel Interference (CCI). These include Hybrid Automatic Repeat Request (HARQ) with soft combining, selection relaying, incremental relaying, and opportunistic incremental relaying, just to name a few. To illustrate the usefulness and accuracy of the proposed approximation, we study the error probability of a Chase combining HARQ system operating in the presence of an unknown source of CCI where we derive an accurate closed form expression for the Moment Generating Function (MGF) of the resultant Signal to Interference plus Noise Ratio (SINR). The accuracy of the derived result is verified using computer 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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.874
Threshold uncertainty score0.618

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0030.001
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.077
GPT teacher head0.303
Teacher spread0.226 · 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