{"id":"W2096810636","doi":"10.1109/icassp.1994.389988","title":"A regular recursive algorithm for the discrete sine transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Recursion (computer science); Sine; Simple (philosophy); Algorithm; Trigonometry; Trigonometric functions; Discrete cosine transform; Discrete sine transform; Computer science; Recursive functions; Mathematical induction; Mathematics; Discrete mathematics; Artificial intelligence; Fourier transform; Fourier analysis; 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.00009196721,0.00006810756,0.00005610847,0.00002428814,0.00009654194,0.0001990708,0.0003786212,0.00001358548,0.00006973001],"category_scores_gemma":[0.000005731738,0.00004115932,0.00006031854,0.0001456769,0.00001993362,0.0006648055,0.00002301622,0.00002397282,0.00003140804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001370318,"about_ca_system_score_gemma":0.000004806645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006337194,"about_ca_topic_score_gemma":0.000003301534,"domain_scores_codex":[0.999427,0.000008384418,0.0001146586,0.0001554873,0.0001283553,0.000166147],"domain_scores_gemma":[0.9995967,0.00008276744,0.00002236722,0.0002250525,0.0000376943,0.00003537393],"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":[7.781243e-7,0.00001071808,3.321748e-7,0.000001412167,0.000009719874,5.427869e-7,0.0003830577,9.540516e-7,0.00003801191,0.04574235,0.01627512,0.937537],"study_design_scores_gemma":[0.0008035394,0.0003840636,0.00004603716,0.000007681695,0.00001330355,0.00001612797,0.0001489799,0.7062323,0.008592322,0.04451939,0.2390409,0.0001953247],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009018826,0.00008930053,0.9802501,0.009564606,0.0001327733,0.000386573,0.000009993885,0.00006267779,0.009494931],"genre_scores_gemma":[0.07564312,0.0001589082,0.8794075,0.004886247,0.0002614076,0.0003034329,0.00002887225,0.00002668714,0.03928386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9373417,"threshold_uncertainty_score":0.1919644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03496759219557211,"score_gpt":0.2613941651211339,"score_spread":0.2264265729255618,"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."}}