MétaCan
Menu
Back to cohort
Record W2143107836 · doi:10.1145/1065983.1066007

MOPAR

2005· article· en· W2143107836 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer science

Abstract

fetched live from OpenAlex

In this paper we propose a fully distributed peer-to-peer (P2P) infrastructure supporting Networked Virtual Environment (NVE) applications, such as massively multiplayer online games (MMOG). While many attempts have been made to tackle one of the most challenging issues in MMOGs - interest management, none of them are considered truly successful. Our architecture is a hybrid scheme focusing on NVEs' interest management. Our scheme takes the advantage of both structured overlay, i.e. Distributed Hash Table (DHT), and the unstructured P2P architecture. It not only has more stable and consistent performance with respect to neighbor discovery, but also is more scalable and fault tolerant than the existing approaches. Unlike other hexagonal zoning approaches in which each participant has a discrete view of the virtual world, our zoning design guarantees that all participants have a continuous view. Moreover, our novel hierarchical architecture and the message dissemination algorithm greatly save network bandwidth and alleviate each node's workload. We implemented our infrastructure running on top of an emulated network. We also implemented a simple game simulation and a visualization tool to demonstrate and visualize our infrastructure.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.713
Threshold uncertainty score0.999

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.002

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.010
GPT teacher head0.232
Teacher spread0.222 · 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

Quick stats

Citations150
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicPeer-to-Peer Network TechnologiesFrench-language works237,207