{"id":"W2115098331","doi":"10.1109/mnrc.2008.4683370","title":"PERG: A scalable pattern-matching accelerator","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Pattern matching; False positive paradox; Field-programmable gate array; Bloom filter; Matching (statistics); Throughput; Pattern recognition (psychology); Intrusion detection system; Computer hardware; Parallel computing; Data mining; Artificial intelligence; Algorithm; Database; Operating system","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.0003299246,0.0007013354,0.0004769501,0.0006723993,0.0003311542,0.0009140196,0.002449109,0.0006801034,0.03010749],"category_scores_gemma":[0.0008333709,0.0004134725,0.0003155665,0.001004591,0.0002288929,0.001471529,0.0008119267,0.0007068733,0.00718387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007990478,"about_ca_system_score_gemma":0.0008614386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001540897,"about_ca_topic_score_gemma":0.001910981,"domain_scores_codex":[0.9996289,0.00003145777,0.00001989126,0.0000662903,0.0001865379,0.00006696977],"domain_scores_gemma":[0.9997151,0.00006636003,0.00003370926,0.00005750694,0.00008637064,0.00004081047],"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.002645412,0.0004358715,0.003688083,0.0008154101,0.0002131998,0.0007641693,0.0001600797,0.03517802,0.1369784,0.02745616,0.2184361,0.573229],"study_design_scores_gemma":[0.0008265074,0.001449125,0.002936112,0.00008533857,0.0001457933,0.001217267,0.0001201444,0.6148427,0.1476072,0.01603583,0.2145954,0.0001386662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08643248,0.003317702,0.7554272,0.001117276,0.0009803677,0.0006096084,0.002689875,0.08133432,0.06809103],"genre_scores_gemma":[0.5272495,0.0009336124,0.3992607,0.001157621,0.000152569,0.0005798048,0.006157859,0.001319108,0.06318928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03010749,"threshold_uncertainty_score":0.1007196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02036455288443324,"score_gpt":0.226244449293295,"score_spread":0.2058798964088618,"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."}}