{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316135,0.0006617725,0.0005310078,0.0004548153,0.0003991062,0.0005614694,0.0007103406,0.0009275789,0.003921736],"category_scores_gemma":[0.00183528,0.0003084898,0.0004310986,0.0009145422,0.0005556356,0.001224543,0.0007742569,0.001124104,0.00172769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003467841,"about_ca_system_score_gemma":0.001088642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001229238,"about_ca_topic_score_gemma":0.001204501,"domain_scores_codex":[0.999651,0.00008619196,0.00001953036,0.00009227641,0.0001322969,0.00001873712],"domain_scores_gemma":[0.9996222,0.0001434358,0.00003989448,0.00006651656,0.000108314,0.00001950966],"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.0002229333,0.00007235736,0.0003950881,0.0001702487,0.0000601292,0.00008112447,0.00008277636,0.1804235,0.04122689,0.08295726,0.006378132,0.6879295],"study_design_scores_gemma":[0.00002974291,0.00006879729,0.0001754804,0.00001024684,0.000008380402,0.0001326397,0.000006854368,0.9739111,0.007292402,0.01029978,0.008041068,0.00002358189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001285453,0.0001639899,0.9976991,0.00005368756,0.0000305076,0.00001288424,0.00001611988,0.0002022715,0.0005359415],"genre_scores_gemma":[0.04077514,0.0002771552,0.9556105,0.0000757493,0.00005621891,0.0001000413,0.0001119587,0.0000701356,0.002923036],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003921736,"threshold_uncertainty_score":0.01311958,"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."}}