{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:08Z","timestamp":1750306748646,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["NRF-2011-0013963"],"award-info":[{"award-number":["NRF-2011-0013963"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2011-0013963"],"award-info":[{"award-number":["NRF-2011-0013963"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1145\/2513228.2513273","type":"proceedings-article","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T19:22:39Z","timestamp":1384543359000},"page":"43-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient bit-parallel algorithm for IDS"],"prefix":"10.1145","author":[{"given":"Sung-il","family":"Oh","sequence":"first","affiliation":[{"name":"Infnis networks Seoul, Korea"}]},{"given":"Min Sik","family":"Kim","sequence":"additional","affiliation":[{"name":"University Pullman, WA"}]},{"given":"Inbok","family":"Lee","sequence":"additional","affiliation":[{"name":"Institute of IT Korea Aerospace University Goyang-City, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2013,10]]},"reference":[{"volume-title":"Proc. of IPDPS","year":"2007","author":"Schuff D.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_3_1","unstructured":"Snort http:\/\/www.snort.org  Snort http:\/\/www.snort.org"},{"volume-title":"Proc. of APCC","year":"2012","author":"Oh S.-I.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"e_1_3_2_1_6_1","unstructured":"http:\/\/www.ll.mit.edu\/mission\/communications\/ist\/corpora\/ideval\/data\/index.html  http:\/\/www.ll.mit.edu\/mission\/communications\/ist\/corpora\/ideval\/data\/index.html"}],"event":{"name":"RACS'13: Research in Adaptive and Convergent Systems","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","ACCT Association of Convergent Computing Technology"],"location":"Montreal Quebec Canada","acronym":"RACS'13"},"container-title":["Proceedings of the 2013 Research in Adaptive and Convergent Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2513228.2513273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2513228.2513273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:26Z","timestamp":1750231706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2513228.2513273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":6,"alternative-id":["10.1145\/2513228.2513273","10.1145\/2513228"],"URL":"https:\/\/doi.org\/10.1145\/2513228.2513273","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"2013-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}