{"id":"W2972342334","doi":"10.1109/tpwrs.2019.2940288","title":"A Generic Convex Model for a Chance-Constrained Look-Ahead Economic Dispatch Problem Incorporating an Efficient Wind Power Distribution Modeling","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Power Systems","topic":"Electric Power System Optimization","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Wind power; Economic dispatch; Electric power system; Computer science; Linear programming; Cumulative distribution function; Convex optimization; Probability density function; Scheduling (production processes); Piecewise; Integer programming; Power (physics); Mathematics; Regular polygon; Engineering","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004534454,0.0004561907,0.0005623264,0.0002337074,0.0001937855,0.0001618491,0.0002382405,0.0002776936,0.00001924143],"category_scores_gemma":[0.000001959212,0.0004931609,0.0001788811,0.0002828009,0.00002669366,0.0003938162,0.000001752595,0.0002683462,0.00009331904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008186398,"about_ca_system_score_gemma":0.0001566153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006236524,"about_ca_topic_score_gemma":0.00002664053,"domain_scores_codex":[0.9975573,0.00006992026,0.0008694372,0.0006294626,0.0002717243,0.0006021943],"domain_scores_gemma":[0.9988482,0.00005769274,0.0001851228,0.0005713672,0.0001453527,0.0001922831],"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.00004705894,0.0000876527,0.00001119713,0.0001939665,0.00009053792,8.192485e-7,0.0007694115,0.9958059,0.002540677,0.0003387269,0.0000411187,0.00007299522],"study_design_scores_gemma":[0.001054794,0.0002362856,0.000001418318,0.0001960506,0.00004546115,0.00002621121,0.0002655345,0.9966865,0.0009092222,0.0000194423,0.00002653588,0.0005325121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1586296,0.00009243318,0.835392,0.00001466313,0.002342559,0.002257152,0.0004250193,0.0005128019,0.0003338387],"genre_scores_gemma":[0.9971873,0.000006463397,0.001863552,0.00001202671,0.00002978586,0.0004443951,0.00009974698,0.0001370584,0.0002196943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8385577,"threshold_uncertainty_score":0.999752,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01183710520593526,"score_gpt":0.2084447719713819,"score_spread":0.1966076667654466,"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."}}