{"id":"W2621310776","doi":"10.1109/access.2017.2692210","title":"On Sum-Rate Maximization Approach to Network Beamforming and Power Allocation for Asynchronous Single-Carrier Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Beamforming; Maximization; Relay channel; Channel (broadcasting); Multiplexing; Asynchronous communication; Transceiver; Mathematical optimization; Topology (electrical circuits); Power (physics); Telecommunications; Mathematics; Wireless","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.001983308,0.001795296,0.001164391,0.0006986497,0.0004904856,0.001647178,0.001370737,0.001443805,0.003043182],"category_scores_gemma":[0.004702698,0.00056636,0.0008848062,0.001075818,0.001660494,0.002131933,0.001487823,0.002099541,0.0007584253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001500329,"about_ca_system_score_gemma":0.0007876082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001563323,"about_ca_topic_score_gemma":0.001135386,"domain_scores_codex":[0.998987,0.0005446551,0.00003306735,0.0001277689,0.0002056027,0.0001019474],"domain_scores_gemma":[0.9982869,0.001281484,0.000103275,0.00006152952,0.0002198843,0.00004690093],"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.00006407458,0.00004896061,0.0002329674,0.0002300951,0.00005794019,0.0002391874,0.000157322,0.6891424,0.003828097,0.2869674,0.003075577,0.01595605],"study_design_scores_gemma":[0.000009485901,0.00004340157,0.00006680657,0.00002342766,0.00001482603,0.00004864413,0.0000268093,0.9325101,0.0005850881,0.06507073,0.001586521,0.00001410652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005682826,0.001497102,0.9825835,0.000553898,0.0000933592,0.00003275623,0.00005219147,0.00005124974,0.009453151],"genre_scores_gemma":[0.7131592,0.00955559,0.2527711,0.0007363061,0.001097964,0.0005810341,0.0001455785,0.0002528581,0.02170039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003043182,"threshold_uncertainty_score":0.01088566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06077208868255074,"score_gpt":0.3110750493484778,"score_spread":0.2503029606659271,"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."}}