{"id":"W2105605001","doi":"10.1109/mwscas.1993.343072","title":"A VLSI architecture for DFT","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Very-large-scale integration; Computer science; Architecture; Simple (philosophy); Discrete Fourier transform (general); Modular design; Parallel computing; Point (geometry); Computational science; Fast Fourier transform; Computation; Theoretical computer science; Algorithm; Fourier transform; Computer architecture; Arithmetic; Embedded system; Mathematics; Fourier analysis; Fractional Fourier transform","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.00007471273,0.00005178709,0.00006959387,0.00002250396,0.00004495922,0.00005136192,0.0003260359,0.0000186555,0.00008314199],"category_scores_gemma":[0.00003423704,0.0000352045,0.00005053727,0.0001391158,0.00001128686,0.00006115795,0.00005663324,0.00004309449,0.0000426121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003644347,"about_ca_system_score_gemma":0.000002051774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003451676,"about_ca_topic_score_gemma":4.223201e-7,"domain_scores_codex":[0.999524,0.00001751213,0.00006482792,0.0001679558,0.00007109833,0.0001546184],"domain_scores_gemma":[0.9995909,0.0001157884,0.00001372068,0.0002046376,0.0000163237,0.00005862596],"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":[2.570559e-7,0.00001815538,0.000003761134,0.00000221516,0.000002169264,0.000001022013,0.00006379004,0.000006743922,0.0002044249,0.03904063,0.00307705,0.9575798],"study_design_scores_gemma":[0.000287621,0.0001755934,0.00009693433,0.000004020366,0.000001998432,0.00001478613,0.0000048807,0.3964503,0.002626831,0.1144757,0.4856781,0.0001832281],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004830512,0.00005601494,0.9851012,0.004732181,0.0001597908,0.00008162738,5.835104e-7,0.0001110562,0.009709247],"genre_scores_gemma":[0.003259918,0.000002421594,0.9919274,0.001313173,0.00008130551,0.000008638424,8.403089e-8,0.000003180127,0.003403887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9573966,"threshold_uncertainty_score":0.1435598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03497187509894589,"score_gpt":0.2768092329434893,"score_spread":0.2418373578445434,"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."}}