MétaCan
Menu
Back to cohort
Record W1983191300 · doi:10.1115/detc2006-99175

Model-Based Decomposition Using Non-Binary Dependency Analysis and Heuristic Partitioning Analysis

2006· article· en· W1983191300 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIndustrial Technology and Control Systems
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsDependency (UML)HeuristicComputer scienceDecompositionBinary numberMathematical optimizationAlgorithmDecomposition method (queueing theory)Functional dependencyTheoretical computer scienceMathematicsData miningArtificial intelligenceRelational databaseStatistics

Abstract

fetched live from OpenAlex

The two-phase method for model-based decomposition (Chen et al. 2005a) has two major functional components: dependency analysis and partitioning analysis. The functions of these two components are enhanced and generalized in this paper in order to improve the method’s capability. On the one hand, the non-binary dependency analysis is developed such that the two-phase method can handle both binary and non-binary dependency information of the model. The essence of this development is to properly select a resemblance coefficient for the quantification of couplings among the model’s elements. On the other hand, as the past version of partitioning analysis takes the enumerative approach to search decomposition solutions, the heuristic partitioning analysis is developed as an alterative to search a reasonably good solution in a shorter time. The working principle of the heuristic approach is to analyze the coupling structure of the model such that the weak coupling links among the model’s elements can be identified for model partitioning. At the end, a relief valve system is applied to illustrate and justify the newly developed method components.

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.000
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.519
Threshold uncertainty score0.520

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
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.009
GPT teacher head0.229
Teacher spread0.219 · 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