MétaCan
Menu
Back to cohort
Record W2312272181 · doi:10.2514/6.2005-2204

Collaboration Pursuing Method for MDO Problems

2005· article· en· W2312272181 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

Venue46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference · 2005
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer science

Abstract

fetched live from OpenAlex

Multidisciplinary Design Optimization (MDO) problems are dominated by couplings among subsystems formulated from different disciplines. Effective and efficient collaboration between subsystems is always desirable when solving MDO problems. This work proposes a new sampling-based methodology, named the Collaboration Pursuing Method (CPM), for MDO problems. In the CPM, a new collaboration model, reflecting both physical and mathematical characteristics of couplings in MDO problems, is formulated to guide the search of feasible design solutions. The interdisciplinary consistency among coupled state parameters in MDO problems is reflected and maintained by the collaboration model. An adaptive sampling strategy is also developed to speed up the search of local optimal solutions. The new method is implemented using MATLAB ® 6.0 and successfully applied to four test problems including an engineering design application.

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 categoriesMeta-epidemiology (narrow), Scholarly communication
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.869
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0020.002
Open science0.0010.001
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.012
GPT teacher head0.288
Teacher spread0.276 · 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