MétaCan
Menu
Back to cohort
Record W2541974074 · doi:10.1109/cns.1988.4979

Ethernet with segmented carrier

2003· article· en· W2541974074 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
TopicWireless Networks and Protocols
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsEthernetComputer scienceComputer networkCollisionLocal area networkCollision detectionProtocol (science)ThroughputATA over EthernetSimple (philosophy)Multiple Access with Collision Avoidance for WirelessEthernet flow controlRouting protocolTelecommunicationsComputer securityWireless

Abstract

fetched live from OpenAlex

Two variations of a local area network based on a modified concept of Ethernet are presented. Unlike many other concepts (e.g. collision-free protocols, or the so-called new-generation collision protocols) the proposed modifications are simple, realistic and inexpensive. In particular, the essence of the CSMA/CD (carrier-sense multiaccess with collision detection) protocol is retained. The simpler of the two methods, called SCS (single carrier with segmentation), operates almost exactly as the standard Ethernet. The second network, DCS (double carrier with segmentation), is particularly interesting, as (despite the collision protocol) its asymptotic effective throughput turns out to be equal to the capacity of the carrier. The performance of both networks is demonstrated to be superior to the performance of the standard Ethernet.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.940
Threshold uncertainty score0.162

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

Citations7
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207