{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:54Z","timestamp":1725551094258},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121883"},{"type":"electronic","value":"9783642121890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12189-0_38","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T18:11:05Z","timestamp":1270059065000},"page":"427-440","source":"Crossref","is-referenced-by-count":0,"title":["Pattern-Unit Based Regular Expression Matching with Reconfigurable Function Unit"],"prefix":"10.1007","author":[{"given":"Ming","family":"Cong","sequence":"first","affiliation":[]},{"given":"Hong","family":"An","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhi-hong","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (1979)"},{"key":"38_CR2","first-page":"227","volume-title":"9th IEEE Symposium on Field-Programmable Custom Computing Machines","author":"R. Sidhu","year":"2001","unstructured":"Sidhu, R., Prasanna, V.K.: Fast RE matching using FPGAs. In: 9th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 227\u2013238. IEEE Press, Los Alamitos (2001)"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/FPGA.2002.1106666","volume-title":"10th IEEE Symposium on Field-Programmable Custom Computing Machines","author":"B.L. Hutchings","year":"2002","unstructured":"Hutchings, B.L., Franklin, R., Carver, D.: Assisting network intrusion detection with reconfigurable hardware. In: 10th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 111\u2013120. IEEE Press, Los Alamitos (2002)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/FCCM.2004.50","volume-title":"12th IEEE Symposium on Field-Programmable Custom Computing Machines","author":"C.R. Clark","year":"2004","unstructured":"Clark, C.R., Schimmel, D.E.: Scalable parallel pattern matching on high speed networks. In: 12th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 249\u2013257. IEEE Press, Los Alamitos (2004)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Sourdis, I., Bispo, J., Cardoso, J.M.P., Vassiliadis, S.: RE Matching in Reconfigurable Hardware. Journal of Signal Processing Systems, 99\u2013121 (October 2007)","DOI":"10.1007\/s11265-007-0131-0"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/FCCM.2004.25","volume-title":"12th IEEE Symposium on Field-Programmable Custom Computing Machines","author":"Y. Cho","year":"2004","unstructured":"Cho, Y., Smith, W.H.M.: Deep packet filter with dedicated logic and read only memories. In: 12th IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 125\u2013134. IEEE Press, Los Alamitos (2004)"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Brodie, B.C., Cytron, R.K., Taylor, D.E.: A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching. In: 33rd Annual International Symposium on Computer Architecture, ISCA 2006, pp. 191\u2013202 (2006)","DOI":"10.1109\/ISCA.2006.7"},{"issue":"12","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1109\/TVLSI.2007.909801","volume":"15","author":"C.-H. Lin","year":"2007","unstructured":"Lin, C.-H., Huang, C.-T., Jiang, C.-P., et al.: Optimization of Pattern Matching Circuits for RE on FPGA. IEEE Transactions on Very Large Scale Integration (VLSI) Systems\u00a015(12), 1303\u20131310 (2007)","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Mitra, A., Najjar, W.A., Bhuyan, L.N.: Compiling PCRE to FPGA for accelerating SNORT IDS. In: ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, Orlando, pp. 127\u2013136 (2007)","DOI":"10.1145\/1323548.1323571"},{"key":"38_CR10","first-page":"31","volume-title":"11th Field-Programmable Custom Computing Machines","author":"J. Moscola","year":"2003","unstructured":"Moscola, J., Lockwood, J., Loui, R.P., Pachos, M.: Implementation of a content-scanning module for an internet firewall. In: 11th Field-Programmable Custom Computing Machines, pp. 31\u201338. IEEE Press, Los Alamitos (2003)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Kumar, S., Dharmapurikar, S., Yu, F.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proceedings of the SIGCOMM 2006 conference on Applications, technologies, architectures, and protocols for computer communications, October 2006, vol.\u00a036(4), pp. 339\u2013350 (2006)","DOI":"10.1145\/1159913.1159952"},{"issue":"2","key":"38_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.982918","volume":"35","author":"J. Emer","year":"2002","unstructured":"Emer, J., Ahuja, P., Borch, E., et al.: Asim: A performance model framework. Computer\u00a035(2), 68\u201376 (2002)","journal-title":"Computer"},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computation","author":"J. Hopcroft","year":"1971","unstructured":"Hopcroft, J.: An nlogn algorithm for minimizing states in a finite automaton. In: Kohavi, J. (ed.) Theory of Machines and Computation, pp. 189\u2013196. Academic, New York (1971)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12189-0_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:50:39Z","timestamp":1606168239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12189-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121883","9783642121890"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12189-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}