{"id":"W2145159132","doi":"10.1109/iscas.2005.1465445","title":"A Subspace Constrained Constant Modulus Algorithm for Blind Array","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Subspace topology; Maxima and minima; Rate of convergence; Algorithm; Constant (computer programming); Convergence (economics); Mathematics; Stochastic gradient descent; Sensitivity (control systems); Gradient descent; Computational complexity theory; Mathematical optimization; Applied mathematics; Computer science; Artificial intelligence; Artificial neural network; Mathematical analysis","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.0004176139,0.0001294817,0.0001521754,0.0001079334,0.00008962759,0.0001803383,0.0004524745,0.00007637894,0.0000437238],"category_scores_gemma":[0.00002827449,0.0001153199,0.00007499735,0.0002166302,0.00007897923,0.0004492408,0.00004865165,0.000087802,0.00003958145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003633398,"about_ca_system_score_gemma":0.0001352087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008836072,"about_ca_topic_score_gemma":0.00003425777,"domain_scores_codex":[0.998974,0.0000378078,0.0002232363,0.0003267104,0.0001824993,0.0002557051],"domain_scores_gemma":[0.9991755,0.0001016742,0.00007404617,0.000394778,0.0001528879,0.0001010785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000697171,0.0001017445,0.000006515881,0.000003240629,0.00001916188,0.00000181459,0.0008849602,0.00003502429,0.003561926,0.5770723,0.009051895,0.4092545],"study_design_scores_gemma":[0.00170979,0.0001997004,0.00001275761,0.00001064297,0.000006524703,0.00004516452,0.00009134672,0.7049951,0.1627693,0.01384163,0.1159197,0.0003983479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002320456,0.00003264161,0.9678507,0.007581848,0.00008854838,0.0004833789,0.000007630633,0.0007347233,0.02298849],"genre_scores_gemma":[0.127898,0.000005122352,0.8674935,0.002023057,0.00006753163,0.00006285295,0.000003365302,0.00000821638,0.002438437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.70496,"threshold_uncertainty_score":0.4702611,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02146063921431837,"score_gpt":0.2842696898278127,"score_spread":0.2628090506134944,"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."}}