MétaCan
Menu
Back to cohort
Record W1681165416 · doi:10.1002/9780470061572.eqr105

Group Maintenance Policies

2007· other· en· W1681165416 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

VenueEncyclopedia of Statistics in Quality and Reliability · 2007
Typeother
Languageen
FieldEngineering
TopicReliability and Maintenance Optimization
Canadian institutionsWestern University
Fundersnot available
KeywordsGeneralizationFeature (linguistics)State (computer science)Computer scienceGroup (periodic table)MathematicsAlgorithm

Abstract

fetched live from OpenAlex

Abstract This paper introduces a new group replacement policy for n independent identical machines operating in parallel. This policy is a generalization of the classes of m ‐failure, ( m , T ) and T ‐failure policies. The adaptive nature of this policy is its most attractive feature: the replacement rule varies according to the state of the system. Once the rule has been found, implementation is no harder than for other standard policies which do not incorporate this adaptive feature. An attractive feature of this approach is that no other policy that uses only the times of operations of the machines and the number of machines that have failed can do better. It is demonstrated that the classes of m ‐failure, ( m , T ) and T ‐failure policies are not generally the optimal.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.502
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
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.011
GPT teacher head0.270
Teacher spread0.259 · 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