MétaCan
Menu
Back to cohort
Record W4229533637 · doi:10.1115/1.2218885

Towards Rapid Redesign: Pattern-based Redesign Planning for Large-Scale and Complex Redesign Problems

2005· article· en· W4229533637 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 · 2005
Typearticle
Languageen
FieldComputer Science
TopicModel-Driven Software Engineering Techniques
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsDecompositionProcess (computing)Computer scienceSelection (genetic algorithm)Focus (optics)Scale (ratio)Industrial engineeringSystems engineeringEngineeringEngineering drawingArtificial intelligence

Abstract

fetched live from OpenAlex

We have developed a decomposition-based rapid redesign methodology for large and complex computational redesign problems. While the overall methodology consists of two general steps: diagnosis and repair, in this paper we focus on the repair step in which decomposition patterns are utilized for redesign planning. Resulting from design diagnosis, a typical decomposition pattern solution to a given redesign problem indicates the portions of the design model necessary for recomputation as well as the interaction part within the model accountable for design change propagation. Following this, in this paper we suggest repair actions with an approach derived from an input pattern solution, to generate a redesign road map allowing for taking a shortcut in the redesign solution process. To do so, a two-stage redesign planning approach from recomputation strategy selection to redesign road map generation is proposed. An example problem concerning the redesign of a relief valve is used for illustration and validation.

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.004
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.804
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.001
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.068
GPT teacher head0.286
Teacher spread0.218 · 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