{"id":"W2788428941","doi":"10.1109/tsp.2018.2812748","title":"Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":538,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Telecommunications link; Computer science; Scheduling (production processes); Mathematical optimization; Optimization problem; Convex optimization; Distributed computing; Algorithm; Regular polygon; Mathematics; Computer network","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.001500904,0.0007840239,0.0006514789,0.0005519263,0.0004873493,0.001535794,0.0007425815,0.001167936,0.003233267],"category_scores_gemma":[0.00285112,0.0003654597,0.0007527418,0.0009568011,0.001239641,0.001475985,0.00116127,0.002001401,0.0005472766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186699,"about_ca_system_score_gemma":0.0009786442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009403505,"about_ca_topic_score_gemma":0.000599379,"domain_scores_codex":[0.9992474,0.0003471624,0.00002723196,0.00008444587,0.0002274963,0.00006619723],"domain_scores_gemma":[0.9993311,0.0004433377,0.00006859555,0.00006960166,0.00006813864,0.00001918069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002382192,0.00004453548,0.0001456997,0.0001332911,0.00002351481,0.00004922417,0.00008125226,0.3456081,0.003029178,0.56787,0.004289382,0.07870203],"study_design_scores_gemma":[0.000006234248,0.00002824045,0.0000550367,0.00002366311,0.000005758428,0.00003067905,0.00001593855,0.860221,0.0008612333,0.1289726,0.009771528,0.00000827553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001037188,0.0003944781,0.993437,0.0002672347,0.00008101879,0.00001970085,0.00001448698,0.00003105722,0.004717884],"genre_scores_gemma":[0.2643152,0.003432978,0.7160622,0.0005580051,0.0007214576,0.000368094,0.00008351383,0.0001867476,0.01427184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003233267,"threshold_uncertainty_score":0.01081634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03411177826444568,"score_gpt":0.2986854867013103,"score_spread":0.2645737084368646,"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."}}