{"id":"W2117301983","doi":"10.1109/iscas.2005.1465446","title":"A High-Throughput DLMS Adaptive Algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Throughput; Rate of convergence; Adaptive filter; Computer science; Computational complexity theory; Convergence (economics); Least mean squares filter; Adaptive algorithm; Algorithm design; Key (lock); Wireless; Telecommunications","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.00004092188,0.0001676223,0.0001491939,0.00005679082,0.00002943119,0.00001347761,0.0001413407,0.00006218873,0.0002512778],"category_scores_gemma":[0.00000523111,0.0001621826,0.00004036701,0.0001080679,0.00003270036,0.0002827505,0.00004947333,0.0001436269,0.0002642075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000131244,"about_ca_system_score_gemma":0.000004711897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001606836,"about_ca_topic_score_gemma":0.00001055468,"domain_scores_codex":[0.9993102,0.000006647173,0.000150721,0.0001687552,0.0001077146,0.0002559946],"domain_scores_gemma":[0.9996455,0.00002257946,0.00001396368,0.0002306417,0.00002788267,0.00005941357],"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.000008183234,0.00004805993,0.000007101395,0.00001020579,0.00008282557,0.00002117507,0.0002176229,0.06227401,0.01257794,0.03722556,0.01876759,0.8687598],"study_design_scores_gemma":[0.0005259761,0.0001743574,0.0003623887,0.00005293171,0.00001534666,0.00003132521,0.00007632067,0.3934167,0.3462321,0.01044581,0.2477411,0.0009255581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001680807,0.0001161165,0.9811664,0.00006923923,0.0001288669,0.00012712,0.00001438889,0.003254938,0.01344217],"genre_scores_gemma":[0.2999082,0.00003888676,0.6988928,0.00007501564,0.0002177659,0.00003066718,0.000003585936,0.0000407619,0.0007923354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8678342,"threshold_uncertainty_score":0.6613616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01072197546343045,"score_gpt":0.2202882665909731,"score_spread":0.2095662911275427,"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."}}