{"id":"W4409475103","doi":"10.1109/pree63126.2024.10955825","title":"Efficient Explicit Method for Representing Saturation of Synchronous Machines Using 2-D Lookup Tables","year":2024,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lookup table; Computer science; Parallel computing; Saturation (graph theory); Algorithm; Mathematics; Programming language; Combinatorics","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.0001922548,0.0004085448,0.0003597025,0.0003206567,0.0002463526,0.0005071341,0.0006576352,0.0004149531,0.004556077],"category_scores_gemma":[0.0006959921,0.0002227973,0.0003004886,0.0003417189,0.0002316029,0.0008245741,0.0002878329,0.000410594,0.0008579947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002882863,"about_ca_system_score_gemma":0.0005554355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002671401,"about_ca_topic_score_gemma":0.003528751,"domain_scores_codex":[0.9999063,0.0000264277,0.000006525979,0.00001049636,0.00004150774,0.000008697087],"domain_scores_gemma":[0.999805,0.00009390685,0.00002049107,0.00002795114,0.0000475816,0.000005093408],"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.00008361619,0.00002480606,0.0006225524,0.0002650635,0.00001717899,0.0002220483,0.0001559097,0.8529385,0.01217322,0.05240067,0.002590083,0.07850631],"study_design_scores_gemma":[0.000005763276,0.00001383778,0.0000377032,0.000008918101,0.000003712565,0.00003534976,0.000007057746,0.9926823,0.001717426,0.002282858,0.003201268,0.000003865246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008001618,0.0002354349,0.9853891,0.00005190297,0.00005231594,0.00002924578,0.00009942024,0.0009276284,0.005213482],"genre_scores_gemma":[0.6647665,0.0005833899,0.3265523,0.0001036513,0.00004292079,0.0001478266,0.0002825498,0.000277003,0.007243792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004556077,"threshold_uncertainty_score":0.01524162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01487913325041617,"score_gpt":0.2809256106767302,"score_spread":0.266046477426314,"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."}}