MétaCan
Menu
Back to cohort
Record W2389913849

Solve the Key Problems in Multi-party Video Conferencing by Using the ALM-technology

2007· article· en· W2389913849 on OpenAlexvenueno aff
Zhao Ailing

Bibliographic record

VenueMicrocomputer applications · 2007
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceMulticastRouterBandwidth (computing)Computer networkKey (lock)Tree (set theory)The InternetDistributed computingVideoconferencingAlgorithmTeleconferenceComputer securityTelecommunicationsWorld Wide Web
DOInot available

Abstract

fetched live from OpenAlex

Before applying multi-party video conferencing into the Internet, we must resolve three problems, they are insufficiency of end system bandwidth, real transmission and the use of extreme bandwidth. With ALM, we can design a more reasonable and appropriate multicast-tree constructing algorithm. The result of simulation shows that this algorithm can solve all the problems. This algorithm includes a local router algorithm and a multicast-tree optimizing algorithm. Every member makes a source-based tree by using the local router algorithm and considering his own condition, then the optimizing algorithm optimizes all the source-based trees in overall situation in order to balance the usage of bandwidth between trees.

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.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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.903
Threshold uncertainty score0.448

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.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.021
GPT teacher head0.257
Teacher spread0.236 · 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 designOther design
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
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicNetwork Traffic and Congestion ControlFrench-language works237,207