{"id":"W2164038961","doi":"10.1109/ccece.2003.1226205","title":"A blind user identification for multiuser DS-CDMA based on subspace search","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Code division multiple access; Computer science; Subspace topology; Signal subspace; Ambiguity; Multiuser detection; Linear subspace; Algorithm; SIGNAL (programming language); Identification (biology); Interference (communication); Eigendecomposition of a matrix; Code (set theory); Theoretical computer science; Speech recognition; Mathematics; Artificial intelligence; Eigenvalues and eigenvectors; Telecommunications; Noise (video)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006632134,0.0001089409,0.00009262051,0.0002153265,0.0001166041,0.0003071751,0.00055712,0.00008196905,0.00001686605],"category_scores_gemma":[0.00006046653,0.00009745341,0.00006790595,0.0003664092,0.00002648938,0.0004607273,0.00004942373,0.0001037158,0.0001232229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007177301,"about_ca_system_score_gemma":0.0001252143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004822429,"about_ca_topic_score_gemma":0.00005493379,"domain_scores_codex":[0.9988328,0.00005234183,0.0001930829,0.0003907231,0.0003240826,0.0002070151],"domain_scores_gemma":[0.9988818,0.0001218378,0.00005432135,0.0006614461,0.0002103515,0.00007019992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001300412,0.0008043333,0.0003419844,0.0000383417,0.00001911626,0.000003813817,0.002978875,0.02532884,0.02036632,0.933639,0.006826942,0.009522348],"study_design_scores_gemma":[0.002681613,0.00030673,0.003326689,0.00002764028,0.000004956527,0.00000173933,0.00005176497,0.3440635,0.6329305,0.006525201,0.009736218,0.000343479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02338251,0.000003034945,0.9655391,0.008582043,0.00007635639,0.0006669776,0.000002152304,0.0005159501,0.001231858],"genre_scores_gemma":[0.7447654,0.000001045706,0.2516182,0.00171691,0.00002558508,0.000104764,0.000007977555,0.00001162371,0.001748557],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9271138,"threshold_uncertainty_score":0.3974035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04163728500187153,"score_gpt":0.3314672752804226,"score_spread":0.2898299902785511,"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."}}