{"id":"W1982185284","doi":"10.1108/03321641211267155","title":"A vertex cut algorithm for model order reduction of parasitic resistive networks","year":2012,"lang":"en","type":"article","venue":"COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Group for Research in Decision Analysis; University of Guelph","funders":"","keywords":"Resistive touchscreen; Computer science; Vertex (graph theory); Reduction (mathematics); Algorithm; Graph; Resistor; Graph theory; Exploit; Network analysis; Electronic circuit; Theoretical computer science; Mathematics; Engineering; Electrical engineering","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.00029759,0.0007617093,0.0006256928,0.0008507076,0.0005529731,0.0008004874,0.000944652,0.0007438659,0.005063891],"category_scores_gemma":[0.001491759,0.0003791033,0.001045984,0.0007442512,0.0004324119,0.0009154175,0.0007722942,0.001517115,0.00088482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007662968,"about_ca_system_score_gemma":0.0009162819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002957609,"about_ca_topic_score_gemma":0.003908171,"domain_scores_codex":[0.9997041,0.00005819709,0.00001281636,0.00006439178,0.0001292342,0.00003127109],"domain_scores_gemma":[0.9995627,0.0002213749,0.00003221475,0.00007917474,0.00008599905,0.00001853539],"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.000122386,0.0001064005,0.0005740254,0.0001515065,0.00007491127,0.0001398325,0.0001359408,0.660597,0.01049922,0.07740278,0.006157604,0.2440384],"study_design_scores_gemma":[0.00001698966,0.00003106989,0.00005629062,0.00001239624,0.00001218586,0.00004971658,0.00001463901,0.9624751,0.002619865,0.03107001,0.003635467,0.000006206443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003474881,0.00006083016,0.9938519,0.0000525445,0.00002141184,0.00004013812,0.00007160343,0.0004626424,0.001964057],"genre_scores_gemma":[0.1366415,0.0001579531,0.8576499,0.00006533646,0.0000246594,0.0001619479,0.0006253098,0.0003287238,0.004344696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005063891,"threshold_uncertainty_score":0.01694041,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01090118251853687,"score_gpt":0.2539998712645567,"score_spread":0.2430986887460198,"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."}}