MétaCan
Menu
Back to cohort
Record W1993803168 · doi:10.1109/snpd.2010.28

Web Object Prefetching: Approaches and a New Algorithm

2010· article· en· W1993803168 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
TopicCaching and Content Delivery
Canadian institutionsTrent University
Fundersnot available
KeywordsComputer scienceCategorizationThe InternetObject (grammar)Web applicationAlgorithmData miningTheoretical computer scienceArtificial intelligenceWorld Wide Web

Abstract

fetched live from OpenAlex

In Internet applications, Web object prefetching is a commonly used and quite effective algorithmic approach to reduce user perceived delays. While a separate concept, prefetching is closely related to caching and they are often blended together in Web algorithms. In this paper, we give a review of Web prefetching models and algorithms, categorize them into groups based on their design principles, and compare their functionalities and performance. We then proposed a new prefetching algorithm that is based on the Adaptive Resonance Theory (ART) of neural networks. The new model uses the bottom-up and top-down weights of the cluster-URL connections obtained from a modified ART1 algorithm to make prefecthing decisions.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.976
Threshold uncertainty score0.271

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.041
GPT teacher head0.218
Teacher spread0.177 · 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

Citations16
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCaching and Content DeliveryFrench-language works237,207