{"id":"W2036989290","doi":"10.1115/1.1778186","title":"A Formal Two-Phase Method for Decomposition of Complex Design Problems","year":2005,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Decomposition; Matrix decomposition; Diagonal; Computer science; Matrix (chemical analysis); Block matrix; Partition (number theory); Decomposition method (queueing theory); Algorithm; Phase (matter); Diagonal matrix; Mathematical optimization; Mathematics; Discrete mathematics; Eigenvalues and eigenvectors; Combinatorics; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00348194,0.0001426279,0.0003442562,0.0002650964,0.0001099135,0.00008056114,0.0002465137,0.00006464202,0.00011632],"category_scores_gemma":[0.0002278526,0.0001175271,0.0001446602,0.0002692737,0.00001212962,0.001443838,0.00004165209,0.0001115149,0.00001277355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000483081,"about_ca_system_score_gemma":0.00006073993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002699389,"about_ca_topic_score_gemma":0.000001363112,"domain_scores_codex":[0.9984562,0.00006306716,0.0007883068,0.0001356779,0.0003172426,0.0002395325],"domain_scores_gemma":[0.9982559,0.000172744,0.0008946239,0.00009599412,0.0005565649,0.00002418625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005001477,0.001502456,0.00001248909,0.0003546869,0.0002809394,0.000009347572,0.0001454876,0.06399357,0.5243585,0.05588317,0.02796942,0.3204884],"study_design_scores_gemma":[0.009820035,0.0004837279,0.00003877087,0.0001625211,0.000324465,0.00005132939,0.00004731661,0.8534942,0.07440109,0.04554927,0.01529476,0.0003325098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001406421,0.00004813753,0.9965123,0.001125461,0.0001889759,0.0005609088,9.390471e-7,0.00002177862,0.0001350637],"genre_scores_gemma":[0.3423462,0.000007109925,0.6560409,0.0005546505,0.0009804812,0.00001369867,0.000008500948,0.00001995189,0.00002848047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7895006,"threshold_uncertainty_score":0.4792615,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07483911314037207,"score_gpt":0.3336994322018468,"score_spread":0.2588603190614747,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}