{"id":"W1857608169","doi":"10.1109/ssp.2005.1628600","title":"Adaptive linear estimators, using biased cramer-RAO bound","year":2005,"lang":"en","type":"article","venue":"IEEE/SP 13th Workshop on Statistical Signal Processing, 2005","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Estimator; Mathematics; Singular value decomposition; Cramér–Rao bound; Applied mathematics; Upper and lower bounds; Estimation theory; Fisher information; Matrix (chemical analysis); Mathematical optimization; Statistics; Algorithm; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005897654,0.0004798409,0.0005757258,0.0003611708,0.0003844753,0.0003993942,0.0008679943,0.0002410874,0.000326857],"category_scores_gemma":[0.0003346821,0.0004611916,0.0001103623,0.0009536257,0.0004454993,0.001095416,0.0001197748,0.0005796551,0.0001539231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003171796,"about_ca_system_score_gemma":0.0005647223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005604525,"about_ca_topic_score_gemma":0.00001375935,"domain_scores_codex":[0.9961511,0.0001751183,0.0009278745,0.0008834808,0.001081269,0.0007811107],"domain_scores_gemma":[0.9973311,0.0008089422,0.0005268658,0.0005050219,0.000402546,0.0004255086],"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.0002264447,0.001260962,0.00008881098,0.000144643,0.00007488544,0.00006891825,0.0005401197,0.04971095,0.001500654,0.03115059,0.01531634,0.8999166],"study_design_scores_gemma":[0.000416789,0.0002163129,0.00009474414,0.0005064461,0.00004003436,0.00002577485,0.0000186802,0.9761283,0.01215816,0.005991485,0.00385286,0.0005504466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00236514,0.0001668057,0.9939186,0.0003734023,0.0001921222,0.0003526599,0.00004913883,0.000695179,0.001886952],"genre_scores_gemma":[0.4277374,0.000007132439,0.571332,0.0004289233,0.0002142079,0.00002481363,0.000009378952,0.00004137264,0.0002047668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9264173,"threshold_uncertainty_score":0.999784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04618136214093548,"score_gpt":0.3374801407416287,"score_spread":0.2912987786006932,"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."}}