{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008183833,0.0000759318,0.00007767591,0.00003868527,0.0002619048,0.0001468605,0.000353897,0.00003158066,0.00005572084],"category_scores_gemma":[0.000003926173,0.00006370517,0.00002431178,0.0002680491,0.00001649655,0.0006343756,0.00009453444,0.00006658037,0.0001093615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001504263,"about_ca_system_score_gemma":0.00004924627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002406556,"about_ca_topic_score_gemma":0.000003725389,"domain_scores_codex":[0.9993173,0.00001989772,0.000108965,0.0002173879,0.0001492638,0.0001871711],"domain_scores_gemma":[0.9996107,0.0000209813,0.00003299308,0.0002220954,0.00005110794,0.00006214636],"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.00001151748,0.000482324,0.03140114,0.00009241438,0.00005735258,0.0002388197,0.01536409,0.04534484,0.001247523,0.02135059,0.09832845,0.786081],"study_design_scores_gemma":[0.0005454283,0.00006378369,0.002769463,0.00005095539,0.000003751435,0.0001749377,0.00005477297,0.9820961,0.003594692,0.003046964,0.007092561,0.0005066375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04505272,0.00006738075,0.9419966,0.0004179139,0.0001343167,0.00003302063,1.021385e-7,0.0003069353,0.011991],"genre_scores_gemma":[0.8843211,0.00002751408,0.1122619,0.0009197897,0.00008762567,0.000004393983,0.000001093831,0.000006279806,0.002370346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9367512,"threshold_uncertainty_score":0.2597821,"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."}}