MétaCan
Menu
Back to cohort
Record W2140463156 · doi:10.1109/ipdps.2005.192

Efficient Evaluation of Alternatives for Assembly of Services

2005· article· en· W2140463156 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
TopicAdvanced Software Engineering Methodologies
Canadian institutionsCarleton University
Fundersnot available
KeywordsComponent (thermodynamics)Computer scienceQueueing theoryComponent-based software engineeringRank (graph theory)SoftwareSoftware performance testingDistributed computingSoftware engineeringReliability engineeringSystems engineeringSoftware systemSoftware constructionProgramming languageEngineering

Abstract

fetched live from OpenAlex

Component based software engineering (CBSE) provides rapid development using well-tested components with established properties. Performance and other nonfunctional properties can also be analyzed by building models from sub-models, calibrated for the components. Further there can be many choices of components to build-systems, which can provide alternatives. The choice can be governed by goal functions which evaluate the predicted performance. This paper describes a systematic approach to find the feasible combinations of alternatives, and to rank them based on predicted performance. It extends the CBML (component based modeling language) for defining components in layered queuing models for software performance.

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.001
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.275
Threshold uncertainty score0.167

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.075
GPT teacher head0.377
Teacher spread0.302 · 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