{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:30:31Z","timestamp":1648611031564},"reference-count":3,"publisher":"International Academy Publishing (IAP)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.7.9.2093-2098","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T19:40:37Z","timestamp":1348688437000},"source":"Crossref","is-referenced-by-count":0,"title":["Study on Anti-worm Diffusion Strategies Based on B+ Address Tree"],"prefix":"10.17706","volume":"7","author":[{"given":"Dewu","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2012,9,1]]},"reference":[{"key":"ref0","doi-asserted-by":"publisher","DOI":"10.1145\/1029618.1029624"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[1] WANG Xiu-ying, SHAO Zhi-qing, LIU Bai-xiang. Worm Detection Algorithm Under P2P Circumstances [J]. Computer Engineering. 2009(3): 173-175.","DOI":"10.1145\/1029618.1029624"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[2] J W Lockwood, J Moscola, M Kulig, et al. Internet worm and virus protection in dynamically reconfigurable hardware[C]. ACM CCS Workshop on Rapid Malcode (WORM 2003), Washington, 2003. [3] N Weaver, V Paxson, S Staniford, et al. Large scale malicious code: A research agenda[OL]. http:\/\/www.cs.berkeley.edu\/~nweaver\/, 2003. [4] N Provos, A virtual honeypot framework[R]. Center of Information Technology Integration, University of Michigan, Tech Rep: citi-tr-03-1, 2003. [5] Wang Bailing, Fang Binxing. A New Friendly Worm Propagation Strategy Based on Diffusing Balance Tree [J]. Journal of Computer Research and Development. 2006(9): 1593-1602. [6] S. Staniford, D. Moore, V Paxson, et al. The Top Speed of Flash Worms[C]. In: Proc. ACM CCS Workshop on Rapid Malcode, Washington DC, USA, 2004:33-42.","DOI":"10.1145\/1029618.1029624"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T20:41:53Z","timestamp":1497991313000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/6664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,1]]},"references-count":3,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2012,9,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.7.9.2093-2098","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,9,1]]}}}