{"id":"W2138204585","doi":"10.1109/ccece.2004.1344998","title":"A new graph structure for hardware-software partitioning of heterogeneous systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Directed acyclic graph; Parallel computing; Graph; Dependency graph; Software; Dependency (UML); Graph partition; Software system; Theoretical computer science; Algorithm; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.0004859658,0.0006901089,0.000404125,0.001415817,0.0005945986,0.001100005,0.0009628297,0.0006270342,0.002772066],"category_scores_gemma":[0.001559892,0.0003854712,0.0008462737,0.00160716,0.0006731485,0.002216381,0.0009417865,0.0009715553,0.0008154009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000757499,"about_ca_system_score_gemma":0.001118932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002511958,"about_ca_topic_score_gemma":0.003961747,"domain_scores_codex":[0.9995021,0.0001502278,0.00004372125,0.0001164437,0.000153008,0.00003454153],"domain_scores_gemma":[0.9993955,0.0002060461,0.0000718102,0.0001641726,0.0001204862,0.00004201863],"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.000127419,0.0001172463,0.0009410791,0.0008094031,0.00009799986,0.0004995198,0.0004212635,0.1764171,0.0286105,0.4050619,0.01459182,0.3723047],"study_design_scores_gemma":[0.00008690572,0.0002435817,0.0008895971,0.0002097997,0.000137993,0.000858107,0.0001507834,0.5000176,0.01671509,0.3001285,0.1804594,0.0001025762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003236963,0.0003358632,0.9923413,0.0001800332,0.00008190355,0.00008863211,0.0002722531,0.0006736423,0.002789537],"genre_scores_gemma":[0.04191144,0.000600695,0.9541125,0.0001167432,0.00006182565,0.0002200102,0.0009154108,0.0001993257,0.001861966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002772066,"threshold_uncertainty_score":0.009273469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01442709998033906,"score_gpt":0.227511396647912,"score_spread":0.2130842966675729,"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."}}