{"id":"W3125765581","doi":"10.7287/peerj.preprints.2216v1","title":"Matlab code for the Discrete Hankel Transform","year":2016,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Polytechnique Montréal","funders":"","keywords":"Hankel transform; Discrete Hartley transform; Discrete Fourier transform (general); Discrete sine transform; Convolution (computer science); Mathematics; Hartley transform; Orthogonality; Circular convolution; Convolution theorem; Fast Fourier transform; Fourier transform; Inverse; Fractional Fourier transform; Algorithm; Mathematical analysis; Computer science; Fourier analysis; Geometry","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.0006073574,0.001133977,0.0007792224,0.001323307,0.0003673514,0.0009998026,0.001735772,0.000927033,0.1953987],"category_scores_gemma":[0.00418107,0.0004309044,0.0005075427,0.00106753,0.0003339053,0.0009452822,0.00104989,0.001346555,0.07851814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004878953,"about_ca_system_score_gemma":0.0009058452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001350669,"about_ca_topic_score_gemma":0.001518815,"domain_scores_codex":[0.9992809,0.00008903277,0.00007638208,0.00009763371,0.000388237,0.000067948],"domain_scores_gemma":[0.9983589,0.0006210619,0.0001166005,0.0001514938,0.0006840175,0.00006788032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006532722,0.0001831503,0.001342768,0.001827209,0.0001278738,0.001164933,0.0003624116,0.07888953,0.02936817,0.04557308,0.2558101,0.5846975],"study_design_scores_gemma":[0.000384637,0.0002386928,0.001527299,0.0004491559,0.00005513747,0.002480756,0.000135307,0.4067729,0.04595214,0.03142345,0.5104166,0.0001639378],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.001764227,0.0003596289,0.9232962,0.000226638,0.000199156,0.0001904436,0.004290062,0.04966418,0.02000955],"genre_scores_gemma":[0.07044227,0.0008888897,0.8325879,0.0005742921,0.0001765665,0.001674045,0.01273332,0.02291566,0.05800694],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.1953987,"threshold_uncertainty_score":0.6536736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04074214149237836,"score_gpt":0.2908683643134787,"score_spread":0.2501262228211004,"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."}}