MétaCan
Menu
Back to cohort
Record W32426295 · doi:10.3389/fcimb.2020.00173

Protocol independence using the sockets API

2000· article· en· W32426295 on OpenAlexfundno aff
Craig Metz

Bibliographic record

VenueUSENIX Annual Technical Conference · 2000
Typearticle
Languageen
FieldComputer Science
TopicService-Oriented Architecture and Web Services
Canadian institutionsnot available
FundersCanadian Institutes of Health Research
KeywordsComputer scienceProtocol (science)Internet protocol suiteCommunications protocolBackward compatibilityGeneral Inter-ORB ProtocolSoftware deploymentInternet ProtocolSoftwareTunneling protocolReverse Address Resolution ProtocolComputer networkSoftware engineeringDistributed computingOperating systemThe Internet

Abstract

fetched live from OpenAlex

The BSD sockets API provides abstractions and other features that help applications be protocol-independent. Unfortunately, not all of the API is abstract and generic, and many programs do not use the APIs in a protocol-independent way. This means that most network programs, in practice, only work with one layered set of communications protocols - usually TCP over IP. This hinders compatibility with older protocols and deployment of new ones, and is making IP a victim of its own success. During the course of next-generation IP development, implementors worked to convert protocol-dependent applications into protocol-independent applications. Along the way, they defined new interfaces to fix some problems and they found a number of usage problems that lead to protocol dependencies. This paper explains many of the problems encountered, using examples from freely available software, and how to solve them. It also explains many of the new protocol-independent interfaces.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.053
metaresearch head score (Gemma)0.069
Version: metacan-v3-hybrid-931329e0061cValidation 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: Not applicable
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.487
Threshold uncertainty score0.731

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0530.069
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0040.003
Bibliometrics0.0040.003
Science and technology studies0.0020.002
Scholarly communication0.0060.003
Open science0.0030.006
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.4870.270

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.030
GPT teacher head0.306
Teacher spread0.277 · 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 source (direct Gemma or distilled Codex), not a consensus.

Study designNot applicable
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

Citations8
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueUSENIX Annual Technical ConferenceSame topicService-Oriented Architecture and Web ServicesFrench-language works237,207