{"id":"W2034885336","doi":"10.1115/1.4001534","title":"Methodical Extensions for Decomposition of Matrix-Based Design Problems","year":2010,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Dependency (UML); Extension (predicate logic); Decomposition; Computer science; Matrix (chemical analysis); Mathematical optimization; Algorithm; Heuristic; Matrix decomposition; Binary number; Theoretical computer science; Mathematics; Artificial intelligence; Programming language; Arithmetic","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003240032,0.001316784,0.0007287956,0.001338563,0.0005282261,0.001194398,0.001397375,0.0007345151,0.008402507],"category_scores_gemma":[0.00647868,0.0005578343,0.001448617,0.001191632,0.001180087,0.001454128,0.001759556,0.002394425,0.001447471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007471388,"about_ca_system_score_gemma":0.001061121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007887321,"about_ca_topic_score_gemma":0.00133759,"domain_scores_codex":[0.9979882,0.0009944456,0.0001210677,0.0001806112,0.0006399516,0.00007561157],"domain_scores_gemma":[0.9970497,0.001935865,0.0001562634,0.0003463252,0.0004598761,0.00005191275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006289503,0.0001029228,0.0003842136,0.0006303443,0.00005688517,0.0001391982,0.0002647783,0.1797293,0.003324093,0.6586593,0.004260662,0.1523853],"study_design_scores_gemma":[0.00007170642,0.00006865511,0.0001171851,0.0001218362,0.00002271566,0.0001278842,0.00004248233,0.6507753,0.001440635,0.3094553,0.03773031,0.00002583882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003327381,0.00006662357,0.9976864,0.00004287043,0.00002508057,0.00003013965,0.00001542342,0.00004482054,0.001755875],"genre_scores_gemma":[0.02399216,0.0002840828,0.9731304,0.00009013889,0.00007459149,0.000419505,0.00007600852,0.0000797441,0.001853285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008402507,"threshold_uncertainty_score":0.02810913,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0357449666345458,"score_gpt":0.2952206457719773,"score_spread":0.2594756791374315,"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."}}