MétaCan
Menu
Back to cohort
Record W2162431292 · doi:10.1109/icsmc.1989.71415

Software indexing for reuse

2003· article· en· W2162431292 on OpenAlexaff
Steven Fraser, Jose Duran, R. Aubin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsBell (Canada)
Fundersnot available
KeywordsSmalltalkComputer scienceReuseSoftwarePortingProgramming languageClass hierarchySoftware engineeringOperating systemObject-oriented programmingEngineering

Abstract

fetched live from OpenAlex

Various approaches to software reuse are reviewed and a methodology described. The methodology was developed based on keyboard indexing to retrieve relevant methods in the Smalltalk environment. Important properties that promote software reuse in Smalltalk are encapsulation, inheritance, and dynamic binding. The methodology proposed was initially implemented as a tool in Smalltalk/V Class Hierarchy Browser on a Vienna AOC II personal computer. Special features, such as stop-word lists, stem-word lists, and automatic dictionary generation were implemented and satisfactorily demonstrated. The tool has been ported to Smalltalk-80 on a Macintosh II workstation where increased memory and processing power greatly improved the performance of the tool.< <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.

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.000
metaresearch head score (Gemma)0.001
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: Methods
Teacher disagreement score0.501
Threshold uncertainty score0.310

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
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.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.022
GPT teacher head0.256
Teacher spread0.234 · 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 designTheoretical or conceptual
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
Published2003
Admission routes1
Has abstractyes

Explore more

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