{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005413185,0.0004591759,0.0005530859,0.0007552343,0.0003342413,0.0008116072,0.0008712515,0.0007301247,0.005075055],"category_scores_gemma":[0.002289617,0.0002806128,0.0006367987,0.0007086067,0.0007289387,0.001057096,0.000897858,0.001002777,0.003480443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004088271,"about_ca_system_score_gemma":0.0005965309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008431339,"about_ca_topic_score_gemma":0.001291921,"domain_scores_codex":[0.999386,0.00009707917,0.00004933918,0.0001225658,0.000298788,0.00004623169],"domain_scores_gemma":[0.9995173,0.0001442702,0.00003437794,0.0001223275,0.0001548,0.00002686795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008620812,0.00007450829,0.0004559805,0.0001556244,0.00004452022,0.0002392272,0.0002327001,0.05759582,0.04672118,0.2811522,0.005176843,0.6080652],"study_design_scores_gemma":[0.00007785072,0.0001183554,0.0002568411,0.00003073702,0.00003673874,0.0006603751,0.0000341068,0.848395,0.02652249,0.08030234,0.04350665,0.00005848771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001251835,0.00005414725,0.997195,0.00002925103,0.00003929641,0.00002256283,0.0000127268,0.0002508959,0.001144245],"genre_scores_gemma":[0.03654158,0.000173483,0.9586449,0.00006680768,0.00008444597,0.00008979812,0.0001155261,0.0001495892,0.004133925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005075055,"threshold_uncertainty_score":0.01697779,"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."}}