MétaCan
Menu
Back to cohort
Record W2014875639 · doi:10.3166/jds.12.79-92

Availability Optimization of Fault-Tolerant Systems

2003· article· en· W2014875639 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Decision System · 2003
Typearticle
Languageen
FieldEngineering
TopicOptimization and Packing Problems
Canadian institutionsUniversité du Québec en Abitibi-TémiscamingueUniversité Laval
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceHumanitiesPhilosophy

Abstract

fetched live from OpenAlex

The use of fault-tolerance techniques is an interesting means of enhancing the availability of a system. This paper highlights the fault-tolerance contribution at the basis of a three state availability model that takes into account the degraded functioning of a system. Furthermore, a new optimization problem of fault-tolerant systems is addressed. We consider a series system consisting of N stochastically independent components. Each component can operate either normally or in a degraded mode. To allow the degraded mode functioning, different technologies are available for each component. The design problem studied in this paper seeks to find the optimal configuration that maximizes the system availability under some resources constraints, or to determine the optimal configuration that respects some predetermined availability level at a minimal cost.

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: Empirical · Consensus signal: none
Teacher disagreement score0.937
Threshold uncertainty score0.367

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.014
GPT teacher head0.226
Teacher spread0.212 · 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