MétaCan
Menu
Back to cohort
Record W2076215557 · doi:10.1115/1.3013295

Dependability-Based Design Optimization of Degrading Engineering Systems

2008· article· en· W2076215557 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

VenueJournal of Mechanical Design · 2008
Typearticle
Languageen
FieldDecision Sciences
TopicProbabilistic and Robust Engineering Design
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsDependabilityReliability engineeringReworkReliability (semiconductor)Computer scienceMonte Carlo methodFunction (biology)Probabilistic designMathematical optimizationEngineering design processEngineering

Abstract

fetched live from OpenAlex

In this paper, we present a methodology that helps select the distribution parameters in degrading multiresponse systems to improve dependability at the lowest lifetime cost. The dependability measures include both quality (soft failures) and reliability (hard failures). Associated costs of scrap, rework, and warrantee work are included. The key to the approach is the fast and efficient creation of the system cumulative distribution function through a series of time-variant limit-state functions. Probabilities are evaluated by Monte Carlo simulation although the first-order reliability method is a viable alternative. The cost objective function that is common in reliability-based design optimization is expanded to include a lifetime loss of performance cost, herein based on present worth theory (also called present value theory). An optimum design in terms of distribution parameters of the design variables is found via a methodology that involves minimizing cost under performance policy constraints over the lifetime as the system degrades. A case study of an over-run clutch provides the insights and potential of the proposed methodology.

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.010
metaresearch head score (Gemma)0.013
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.565
Threshold uncertainty score0.996

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0100.013
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
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.175
GPT teacher head0.303
Teacher spread0.128 · 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