{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:14:12Z","timestamp":1761808452092,"version":"3.41.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779603"},{"type":"electronic","value":"9783030779610"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77961-0_2","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:07:58Z","timestamp":1623352078000},"page":"17-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Innovative Employment of the NetLogo AIDS Model in Developing a New Chain Code for Compression"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5584-9034","authenticated-orcid":false,"given":"Khaldoon","family":"Dhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6947-0519","authenticated-orcid":false,"given":"Christopher","family":"Cruzen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Al-Asadi, T.A., Witefee, D.M.: Geometrical fusion based on chain code representation. In: IOP Conference Series: Materials Science and Engineering, vol. 928, p. 032033. IOP Publishing (2020)","DOI":"10.1088\/1757-899X\/928\/3\/032033"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12889-020-10153-1","volume":"21","author":"A Asgary","year":"2021","unstructured":"Asgary, A., Cojocaru, M.G., Najafabadi, M.M., Wu, J.: Simulating preventative testing of SARS-CoV-2 in schools: policy implications. BMC Public Health 21(1), 1\u201318 (2021)","journal-title":"BMC Public Health"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Asgary, A., Najafabadi, M.M., Karsseboom, R., Wu, J.: A drive-through simulation tool for mass vaccination during COVID-19 pandemic. In: Healthcare, vol. 8, p. 469. Multidisciplinary Digital Publishing Institute (2020)","DOI":"10.3390\/healthcare8040469"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.3390\/ijerph18010268","volume":"18","author":"A Asgary","year":"2021","unstructured":"Asgary, A., Valtchev, S.Z., Chen, M., Najafabadi, M.M., Wu, J.: Artificial intelligence model of drive-through vaccination simulation. Int. J. Environ. Res. Public Health 18(1), 268 (2021)","journal-title":"Int. J. Environ. Res. Public Health"},{"issue":"14","key":"2_CR5","doi-asserted-by":"publisher","first-page":"15341","DOI":"10.1007\/s11042-016-3831-2","volume":"76","author":"AN Azmi","year":"2016","unstructured":"Azmi, A.N., Nasien, D., Omar, F.S.: Biometric signature verification system based on freeman chain code and k-nearest neighbor. Multimedia Tools Appl. 76(14), 15341\u201315355 (2016). https:\/\/doi.org\/10.1007\/s11042-016-3831-2","journal-title":"Multimedia Tools Appl."},{"key":"2_CR6","first-page":"880","volume":"77","author":"J Bons","year":"1977","unstructured":"Bons, J., Kegel, A.: On the digital processing and transmission of handwriting and sketching. Proceedings of EUROCON 77, 880\u2013890 (1977)","journal-title":"Proceedings of EUROCON"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0031-3203(98)00132-0","volume":"32","author":"E Bribiesca","year":"1999","unstructured":"Bribiesca, E.: A new chain code. Patt. Recogn. 32(2), 235\u2013251 (1999)","journal-title":"Patt. Recogn."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-030-60128-7_45","volume-title":"HCI International 2020 - Late Breaking Papers: Cognition, Learning and Games","author":"B Caci","year":"2020","unstructured":"Caci, B., Dhou, K.: The interplay between artificial intelligence and users\u2019 personalities: a new scenario for human-computer interaction in gaming. In: Stephanidis, C., et al. (eds.) HCI International 2020 - Late Breaking Papers: Cognition, Learning and Games, pp. 619\u2013630. Springer International Publishing, Cham (2020)"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"9308","DOI":"10.1109\/JIOT.2019.2912984","volume":"6","author":"K Dhou","year":"2019","unstructured":"Dhou, K., Cruzen, C.: An innovative chain coding technique for compression based on the concept of biological reproduction: An agent-based modeling approach. IEEE Internet Things J. 6(6), 9308\u20139315 (2019)","journal-title":"IEEE Internet Things J."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Dhou, K., Cruzen, C.: A new chain code for bi-level image compression using an agent-based model of echolocation in dolphins. In: 2020 IEEE 6th International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application (DependSys), pp. 87\u201391 (2020). https:\/\/doi.org\/10.1109\/DependSys51298.2020.00021","DOI":"10.1109\/DependSys51298.2020.00021"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-93701-4_9","volume-title":"Computational Science \u2013 ICCS 2018","author":"K Dhou","year":"2018","unstructured":"Dhou, K.: A novel agent-based modeling approach for image coding and lossless compression based on the wolf-sheep predation model. In: Shi, Y., et al. (eds.) ICCS 2018. LNCS, vol. 10861, pp. 117\u2013128. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93701-4_9"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-319-91250-9_34","volume-title":"Human-Computer Interaction. Interaction Technologies","author":"K Dhou","year":"2018","unstructured":"Dhou, K.: Towards a better understanding of chess players\u2019 personalities: a study using virtual chess players. In: Kurosu, M. (ed.) HCI 2018. LNCS, vol. 10903, pp. 435\u2013446. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91250-9_34"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2019.03.024","volume":"79","author":"K Dhou","year":"2019","unstructured":"Dhou, K.: An innovative design of a hybrid chain coding algorithm for Bi-level image compression using an agent-based modeling approach. Appl. Soft Comput. 79, 94\u2013110 (2019)","journal-title":"Appl. Soft Comput."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-030-30033-3_24","volume-title":"HCI International 2019 \u2013 Late Breaking Papers","author":"K Dhou","year":"2019","unstructured":"Dhou, K.: An innovative employment of virtual humans to explore the chess personalities of Garry Kasparov and other class-A players. In: Stephanidis, C. (ed.) HCII 2019. LNCS, vol. 11786, pp. 306\u2013319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30033-3_24"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.future.2019.08.021","volume":"102","author":"K Dhou","year":"2020","unstructured":"Dhou, K.: A new chain coding mechanism for compression stimulated by a virtual environment of a predator-prey ecosystem. Future Gener. Comput. Syst. 102, 650\u2013669 (2020)","journal-title":"Future Gener. Comput. Syst."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Dhou, K.: A novel investigation of attack strategies via the involvement of virtual humans: a user study of Josh Waitzkin, a virtual chess grandmaster. In: StephanidisStephanidis, C., et al. (eds.) HCII 2020. LNCS, vol. 12425, pp. 658\u2013668. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60128-7_48","DOI":"10.1007\/978-3-030-60128-7_48"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Dhou, K., Cruzen, C.: A highly efficient chain code for compression using an agent-based modeling simulation of territories in biological beavers. Future Gener. Comput. Syst. 118, 1\u201313 (2021). https:\/\/doi.org\/10.1016\/j.future.2020.12.016, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X20330788","DOI":"10.1016\/j.future.2020.12.016"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","volume":"2","author":"H Freeman","year":"1961","unstructured":"Freeman, H.: On the encoding of arbitrary geometric configurations. IRE Trans. Electron. Comput. 2, 260\u2013268 (1961)","journal-title":"IRE Trans. Electron. Comput."},{"issue":"7","key":"2_CR19","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/76.735380","volume":"8","author":"PG Howard","year":"1998","unstructured":"Howard, P.G., Kossentini, F., Martins, B., Forchhammer, S., Rucklidge, W.J.: The emerging JBIG2 standard. IEEE Trans. Circ. Syst. Video Technol. 8(7), 838\u2013848 (1998)","journal-title":"IEEE Trans. Circ. Syst. Video Technol."},{"key":"2_CR20","unstructured":"Hwang, Y.T., Wang, Y.C., Wang, S.S.: An efficient shape coding scheme and its codec design. In: 2001 IEEE Workshop on Signal Processing Systems, pp. 225\u2013232. IEEE (2001)"},{"key":"2_CR21","unstructured":"ISO CCITT Recommend. T.4: Standardization of group 3 facsimile apparatus for document transmission (1980)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Jeromel, A., \u017dalik, B.: An efficient Lossy cartoon image compression method. Multimedia Tools Appl. 79(1), 433\u2013451 (2020)","DOI":"10.1007\/s11042-019-08126-7"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Karczmarek, P., Kiersztyn, A., Pedrycz, W., Dolecki, M.: An application of chain code-based local descriptor and its extension to face recognition. Patt. Recogn. 65, 26\u201334 (2017). https:\/\/doi.org\/10.1016\/j.patcog.2016.12.008, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0031320316303971","DOI":"10.1016\/j.patcog.2016.12.008"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"8497","DOI":"10.1109\/ACCESS.2021.3049868","volume":"9","author":"Y Kim","year":"2021","unstructured":"Kim, Y., Kim, K.H., Cho, W.D.: Image compression using chain coding for electronic shelf labels (ESL) systems. IEEE Access 9, 8497\u20138511 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3049868","journal-title":"IEEE Access"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Liu, H.C., Srinath, M.: Corner detection from chain-code. Patt. Recogn. 23(1), 51\u201368 (1990). https:\/\/doi.org\/10.1016\/0031-3203(90)90048-P, https:\/\/www.sciencedirect.com\/science\/article\/pii\/003132039090048P","DOI":"10.1016\/0031-3203(90)90048-P"},{"issue":"4","key":"2_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.patcog.2004.08.017","volume":"38","author":"YK Liu","year":"2005","unstructured":"Liu, Y.K., \u017dalik, B.: An efficient chain code with Huffman coding. Patt. Recogn. 38(4), 553\u2013557 (2005)","journal-title":"Patt. Recogn."},{"issue":"10","key":"2_CR27","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/26.103046","volume":"39","author":"C Lu","year":"1991","unstructured":"Lu, C., Dunham, J.G.: Highly efficient coding schemes for contour lines based on chain code representations. IEEE Trans. Commun. 39(10), 1511\u20131514 (1991). https:\/\/doi.org\/10.1109\/26.103046","journal-title":"IEEE Trans. Commun."},{"key":"2_CR28","first-page":"518","volume-title":"Intell. Inf. Database Syst.","author":"MA Mohamad","year":"2017","unstructured":"Mohamad, M.A., Haron, H., Hasan, H.: Metaheuristic optimization on conventional freeman chain code extraction algorithm for handwritten character recognition. In: Nguyen, N.T., Tojo, S., Nguyen, L.M., Trawi\u0144ski, B. (eds.) Intell. Inf. Database Syst., pp. 518\u2013527. Springer International Publishing, Cham (2017)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Mouring, M., Dhou, K., Hadzikadic, M.: A novel algorithm for bi-level lossless image compression based on ant colonies. In: 3rd International Conference on Complexity, Future Information Systems and Risk, pp. 72\u201378. Set\u00fabal - Portugal (2018)","DOI":"10.5220\/0006688400720078"},{"key":"2_CR30","unstructured":"Najafabadi, M.M.: Modeling an Open Data Ecosystem: The Case of Food Service Establishments Inspection in New York State. State University of New York at Albany (2020)"},{"key":"2_CR31","unstructured":"Recommendation T6: Facsimile coding schemes and coding control functions for group 4 facsimile apparatus. International Telecommunication Union, Geneva (1988)"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Siddiqi, I., Vincent, N.: A set of chain code based features for writer recognition. In: 2009 10th International Conference on Document Analysis and Recognition, pp. 981\u2013985 (2009). https:\/\/doi.org\/10.1109\/ICDAR.2009.136","DOI":"10.1109\/ICDAR.2009.136"},{"key":"2_CR33","unstructured":"for Standards\/International Electrotechnical Commission, I.O., et al.: Progressive bilevel image compression. International Standard 11544 (1993)"},{"key":"2_CR34","unstructured":"Wilensky, U.: NetLogo. http:\/\/ccl.northwestern.edu\/netlogo\/, Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL (1999). http:\/\/ccl.northwestern.edu\/netlogo\/"},{"key":"2_CR35","unstructured":"Wilensky, U.: NetLogo HIV model. Northwestern University, Evanston, IL, Center for Connected Learning and Computer-Based Modeling (1997)"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Wu, J.T., Ding, J.J.: Improved angle freeman chain code using improved adaptive arithmetic coding. In: 2020 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), pp. 181\u2013184 (2020). https:\/\/doi.org\/10.1109\/APCCAS50809.2020.9301702","DOI":"10.1109\/APCCAS50809.2020.9301702"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Yang, R., Yan, N., Li, L., Liu, D., Wu, F.: Chain code-based occupancy map coding for video-based point cloud compression. In: 2020 IEEE International Conference on Visual Communications and Image Processing (VCIP), pp. 479\u2013482 (2020). https:\/\/doi.org\/10.1109\/VCIP49819.2020.9301867","DOI":"10.1109\/VCIP49819.2020.9301867"},{"key":"2_CR38","unstructured":"Zahir, S., Dhou, K.: A new chain coding based method for binary image compression and reconstruction. In: Picture Coding Symposium, pp. 1321\u20131324 (2007)"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"\u017dalik, B., Mongus, D., \u017dalik, K.R., Podgorelec, D., Luka\u010d, N.: Lossless chain code compression with an improved binary adaptive sequential coding of zero-runs. J. Vis. Commun. Image Represent. 75, 103050 (2021). https:\/\/doi.org\/10.1016\/j.jvcir.2021.103050, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1047320321000225","DOI":"10.1016\/j.jvcir.2021.103050"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"\u017dalik, B., \u017dalik, K.R., Zupan\u010di\u010d, E., Luka\u010d, N., \u017dalik, M., Mongus, D.: Chain code compression with modified interpolative coding. Comput. Electr. Eng. 77, 27\u201336 (2019). https:\/\/doi.org\/10.1016\/j.compeleceng.2019.05.001, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0045790618327666","DOI":"10.1016\/j.compeleceng.2019.05.001"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Zhao, X., Sun, W., Lyu, X., Ma, Z.: On six directions chain code and its application of bead weaving. In: 2018 IEEE 4th International Conference on Computer and Communications (ICCC), pp. 2262\u20132267 (2018). https:\/\/doi.org\/10.1109\/CompComm.2018.8780823","DOI":"10.1109\/CompComm.2018.8780823"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Zhou, L.: A new highly efficient algorithm for lossless binary image compression. ProQuest (2007)","DOI":"10.1109\/CCECE.2006.277530"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77961-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:04:50Z","timestamp":1749506690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77961-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779603","9783030779610"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77961-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}