{"id":"W2132388463","doi":"10.1109/ccece.2011.6030679","title":"Optimal linear MIMO relay communication under a constraint on the condition number of relay transform matrix","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Iran Telecommunication Research Center","keywords":"Relay; MIMO; Relay channel; Maximization; Multiplexing; Computer science; Transformation matrix; Node (physics); Constraint (computer-aided design); Matrix (chemical analysis); Control theory (sociology); Mathematics; Topology (electrical circuits); Mathematical optimization; Power (physics); Telecommunications; Beamforming; Engineering","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.001095971,0.001042521,0.001016055,0.000274756,0.0003180757,0.0009951688,0.0005136773,0.00084578,0.001895828],"category_scores_gemma":[0.003875008,0.0004453566,0.0003286209,0.0006272137,0.001072497,0.001608165,0.0007752706,0.0007196849,0.0005413668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007505378,"about_ca_system_score_gemma":0.0009381995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008832823,"about_ca_topic_score_gemma":0.0009206487,"domain_scores_codex":[0.99888,0.0004914146,0.00004037479,0.0001927375,0.0002501997,0.0001453123],"domain_scores_gemma":[0.9976648,0.001575172,0.0003079354,0.0001404621,0.0002516687,0.00006002311],"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.0002484995,0.0000581848,0.0002685042,0.0001751231,0.00003928961,0.0003411248,0.0001176817,0.8937106,0.02075659,0.06184014,0.001450824,0.02099347],"study_design_scores_gemma":[0.00004077024,0.0001307996,0.0001570191,0.00001148145,0.00001723563,0.0001574492,0.0000372468,0.9784752,0.004839467,0.01559268,0.0005194372,0.00002112727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05862484,0.0007288472,0.9312294,0.0004173557,0.00003322985,0.00004248655,0.0001154395,0.0001865907,0.008621826],"genre_scores_gemma":[0.907544,0.0008355823,0.08819369,0.0001192236,0.00008105928,0.00008324247,0.0001074695,0.00004433666,0.00299136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001895828,"threshold_uncertainty_score":0.006342113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0652160517191458,"score_gpt":0.3156593464520596,"score_spread":0.2504432947329138,"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."}}