{"id":"W2001140747","doi":"10.4028/www.scientific.net/amm.143-144.371","title":"Novel Scheme for Multiple-Access Interference Mitigation with Low Complexity","year":2011,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Interference (communication); Computer science; Code division multiple access; Scheme (mathematics); Single antenna interference cancellation; Electronic engineering; Detector; Multiuser detection; Computer network; Computer engineering; Algorithm; Telecommunications; Engineering; Mathematics; Channel (broadcasting)","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.0004993404,0.0007857734,0.001070001,0.0008627418,0.001044859,0.0008116676,0.001674207,0.0009658521,0.00230568],"category_scores_gemma":[0.001231108,0.0002609175,0.0004446314,0.0008539379,0.0005793687,0.001407241,0.001362428,0.0009491343,0.0009792267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005948583,"about_ca_system_score_gemma":0.001092486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005718414,"about_ca_topic_score_gemma":0.0009752008,"domain_scores_codex":[0.9992085,0.0001512743,0.00004555119,0.0001448268,0.0003364894,0.0001133788],"domain_scores_gemma":[0.9993638,0.0001159544,0.00007066122,0.0001587626,0.0002413188,0.00004940561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006216907,0.0003453808,0.001174996,0.0004427238,0.0001794047,0.0005335247,0.0003263192,0.01389894,0.3292854,0.102713,0.00855144,0.5419271],"study_design_scores_gemma":[0.0004165645,0.001044713,0.001045265,0.00006704133,0.0002263413,0.003603479,0.0001029774,0.6985905,0.2089719,0.02854128,0.05715425,0.0002357221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01690193,0.001060782,0.9763608,0.0002416709,0.000371411,0.0001527634,0.0000640716,0.0008184733,0.004028099],"genre_scores_gemma":[0.3798099,0.0006560484,0.6113287,0.00038233,0.00035107,0.0002213427,0.0001550378,0.00003601961,0.007059598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00230568,"threshold_uncertainty_score":0.007713318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1031399036131184,"score_gpt":0.2920290846032373,"score_spread":0.1888891809901189,"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."}}