{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133639,0.0001089863,0.0002696789,0.0001269754,0.00004213227,0.00002200148,0.0001562081,0.0001533821,0.00005696098],"category_scores_gemma":[0.000272927,0.00008797284,0.0001312912,0.00008773171,0.00001439415,0.0001027724,0.000006716952,0.0002775606,0.000001173065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001833396,"about_ca_system_score_gemma":0.00005825945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.651686e-7,"about_ca_topic_score_gemma":3.701971e-7,"domain_scores_codex":[0.9989774,0.00007862624,0.0005078682,0.00008101811,0.0002073921,0.0001476612],"domain_scores_gemma":[0.9987578,0.0006055626,0.0001884661,0.000104637,0.0002273228,0.0001161769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001217224,0.00005906966,4.59089e-7,0.00009709286,0.00002381316,0.000002325555,0.00001334335,0.7448053,0.2504459,0.0006554642,0.0004223329,0.003353188],"study_design_scores_gemma":[0.0005372217,0.0002917599,0.00001012188,0.0000579169,0.00005544562,0.00002165182,0.000002186528,0.5972191,0.3954692,0.006103413,0.0001563304,0.00007567466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002022345,0.00007578036,0.9970887,0.0001087644,0.0003914889,0.0002656108,0.00000245355,0.00003452382,0.00001030507],"genre_scores_gemma":[0.4034685,0.00001627563,0.5964031,0.00001641055,0.00006560123,0.000007853072,9.176968e-7,0.00001746988,0.000003813592],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4014462,"threshold_uncertainty_score":0.3587428,"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."}}