MétaCan
Menu
Back to cohort
Record W2728076348 · doi:10.1109/iwqos.2017.7969116

Copula-based parameter estimation for Markov-modulated Poisson Process

2017· article· en· W2728076348 on OpenAlexaff
Fang Dong, Kui Wu, Venkatesh Srinivasan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsCopula (linguistics)Poisson distributionComputer scienceMarkovian arrival processPoisson processMarkov processCount dataMarginal distributionEstimation theoryMatching (statistics)AlgorithmStochastic processMarkov chainStatisticsMathematical optimizationRandom variableMathematicsEconometricsMachine learning

Abstract

fetched live from OpenAlex

Markov-modulated Poisson Process (MMPP) has been extensively studied in random process theory and widely used as a network traffic model. Most methods for estimating MMPP parameters are based on the exact arrival times. Nevertheless, in many applications it is costly to record the exact time of each arrival. Instead, we only record the number of arrivals in fixed-length time slots, which is called arrival count. Since arrival count data does not maintain detailed arrival times, it is non trivial to develop effective methods for MMPP parameter estimation with arrival counts only. Very few existing works deal with this challenge. This paper tackles the above challenge with copula analysis. The theoretical marginal distribution and copula of arrival counts in MMPP are applied to develop a new estimation method, MarCpa, which is a two-step estimation method involving marginal matching followed by copula matching. Our evaluation results demonstrate that the proposed method is fast and accurate.

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 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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.980
Threshold uncertainty score0.413

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
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.018
GPT teacher head0.292
Teacher spread0.275 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207