{"id":"W2789414605","doi":"10.1109/tmc.2018.2812722","title":"Optimal Power Allocation and Scheduling for Non-Orthogonal Multiple Access Relay-Assisted Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":163,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Computer science; Time division multiple access; Computer network; Telecommunications link; Noma; Throughput; Scheduling (production processes); Cellular network; Transmitter power output; Relay channel; Base station; Spectral efficiency; Wireless; Channel (broadcasting); Power (physics); Telecommunications; Mathematical optimization; Transmitter; Mathematics","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.001460404,0.001049122,0.001096667,0.0005199492,0.0005321431,0.001249068,0.0009065493,0.0007531354,0.001505399],"category_scores_gemma":[0.003641797,0.0006898913,0.0004137431,0.0008454956,0.0009617052,0.001050132,0.0007851147,0.0006692063,0.0002973095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00167535,"about_ca_system_score_gemma":0.001706458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005417532,"about_ca_topic_score_gemma":0.005755358,"domain_scores_codex":[0.9991248,0.0004620831,0.00002814771,0.0001102731,0.0001434769,0.000131206],"domain_scores_gemma":[0.9987728,0.0008376669,0.0001657995,0.00004756068,0.0001220107,0.00005405895],"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.00003721835,0.000025709,0.0001587697,0.00003840543,0.00001595782,0.00004953791,0.00003104249,0.9799412,0.0006208593,0.009778111,0.0004046198,0.008898594],"study_design_scores_gemma":[0.000007090228,0.00001254502,0.00003543319,0.000001923722,0.000002364745,0.000005726546,0.000009095069,0.9959859,0.0001027871,0.003706182,0.0001283759,0.00000246338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03699297,0.001008386,0.9582324,0.0002985737,0.00008305535,0.00006845826,0.0000741605,0.0001177399,0.003124328],"genre_scores_gemma":[0.8797178,0.001145867,0.115669,0.00009731032,0.0000934139,0.0001540787,0.00009008733,0.00005921315,0.002973174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005417532,"threshold_uncertainty_score":0.01215559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01862706309625283,"score_gpt":0.2786956921354312,"score_spread":0.2600686290391783,"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."}}