{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:06:24Z","timestamp":1743059184736,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819902712"},{"type":"electronic","value":"9789819902729"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-0272-9_30","type":"book-chapter","created":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:16:09Z","timestamp":1676470569000},"page":"439-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Cuckoo Search Algorithm and Its Application in Function Optimization"],"prefix":"10.1007","author":[{"given":"Songlv","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuina","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liping","family":"Mo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"issue":"1","key":"30_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm Intell. 1(1), 33\u201357 (2007)","journal-title":"Swarm Intell."},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. System, Man, Cybernetics 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. System, Man, Cybernetics"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"issue":"5","key":"30_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95(5), 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69(3), 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"4226","DOI":"10.3934\/mbe.2021212","volume":"18","author":"D Kang","year":"2021","unstructured":"Kang, D., Mo, L., Wang, F., et al.: Adaptive harmony search algorithm utilizing differential evolution and opposition-based learning. Math. Biosci. Eng. 18(4), 4226\u20134246 (2021)","journal-title":"Math. Biosci. Eng."},{"issue":"02","key":"30_CR7","first-page":"114","volume":"48","author":"F Wan","year":"2022","unstructured":"Wan, F., Ying, N., Huang, S., et al.: Study on efficiency improvement and capacity expansion of Nanwan reservoir based on improved cuckoo algorithm. Water Power 48(02), 114\u2013118 (2022)","journal-title":"Water Power"},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"Liu, M., Zheng, H., Liu Q., Xing, X., Dai, Y.: A backdoor embedding method for backdoor detection in deep neural networks. In: Wang, G., Choo, K.K.R., Ko, R.K.L., Xu, Y., Crispo, B. (eds): Ubiquitous Security. UbiSec 2021. Communications in Computer and Information Science, vol 1557, pp 1\u201312. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-19-0468-4_1","DOI":"10.1007\/978-981-19-0468-4_1"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Yang, X., Deb, S.: Cuckoo search via L\u00e9vy flights. World Congress on Nature & Biologically Inspired Computing. IEEE (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"3","key":"30_CR10","first-page":"36","volume":"2","author":"E Valian","year":"2011","unstructured":"Valian, E., Mohanna, S., Tavakoli, S.: Improved cuckoo search algorithm for feedforward neural network training. Int. J. Artificial Intelligence & Appl. 2(3), 36\u201343 (2011)","journal-title":"Int. J. Artificial Intelligence & Appl."},{"key":"30_CR11","unstructured":"Yan, H., Xie, M., Zhao Q., et al.: New cuckoo search algorithm with parameter dynamic updating. J. Chinese Mini-Micro Computer Syst. 1\u20138 (2021)"},{"issue":"9","key":"30_CR12","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/j.chaos.2011.06.004","volume":"44","author":"S Walton","year":"2011","unstructured":"Walton, S., Hassan, O., Morgan, K., et al.: Modified cuckoo search: a new gradient free optimization algorithm. Chaos, Solitons Fractals 44(9), 710\u2013718 (2011)","journal-title":"Chaos, Solitons Fractals"},{"issue":"5","key":"30_CR13","doi-asserted-by":"publisher","first-page":"3075","DOI":"10.1016\/j.ijhydene.2018.11.140","volume":"44","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Wang, N.: Cuckoo search algorithm with explosion operator for modeling proton exchange membrane fuel cells. Int. J. Hydrogen Energy 44(5), 3075\u20133087 (2019)","journal-title":"Int. J. Hydrogen Energy"},{"key":"30_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105749","volume":"85","author":"A Kamoona","year":"2019","unstructured":"Kamoona, A., Patra, J.: A novel enhanced cuckoo search algorithm for contrast enhancement of gray scale images. Appl. Soft Comput. 85, 105749 (2019)","journal-title":"Appl. Soft Comput."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Huang, J., Gao, L.: A teaching\u2013learning-based cuckoo search for constrained engineering design problems. Advances in Global Optimization. Springer, Cham, pp. 375-386 (2015)","DOI":"10.1007\/978-3-319-08377-3_37"},{"key":"30_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107250","volume":"157","author":"L Abualigah","year":"2021","unstructured":"Abualigah, L., Yousri, D., Abd, E., et al.: Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput. Ind. Eng. 157, 107250 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"30_CR17","unstructured":"Yang, X.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2010)"},{"key":"30_CR18","unstructured":"Tizhoosh, H.: Opposition-Based Learning: A New Scheme for Machine Intelligence, Control & Automation. IEEE (2005)"},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan, S., Tizhoosh, H., Salama, M.: Opposition-based differential evolution. IEEE Trans. Evolutionary Comput. 12(1), 64\u201379 (2008)","journal-title":"IEEE Trans. Evolutionary Comput."},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.asoc.2019.04.016","volume":"80","author":"P Ong","year":"2019","unstructured":"Ong, P., Zainuddin, Z.: Optimizing wavelet neural networks using modified cuckoo search for multi-step ahead chaotic time series prediction. Applied Soft Computing J. 80, 374\u2013386 (2019)","journal-title":"Applied Soft Computing J."},{"issue":"05","key":"30_CR21","first-page":"235","volume":"44","author":"R Li","year":"2017","unstructured":"Li, R., Dai, R.: Adaptive step-size cuckoo search algorithm. Computer Science 44(05), 235\u2013240 (2017)","journal-title":"Computer Science"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.asoc.2016.09.048","volume":"52","author":"H Rakhshani","year":"2017","unstructured":"Rakhshani, H., Rahati, A.: Snap-drift cuckoo search: a novel cuckoo search optimization algorithm. Appl. Soft Comput. 52, 771\u2013794 (2017)","journal-title":"Appl. Soft Comput."}],"container-title":["Communications in Computer and Information Science","Ubiquitous Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-0272-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T17:06:18Z","timestamp":1686675978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-0272-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819902712","9789819902729"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-0272-9_30","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UbiSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Ubiquitous Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhangjiajie","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ubisec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ubisecurity.org\/2022\/","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":"98","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":"34","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":"4","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":"35% - 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":"3","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":"4","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)"}}]}}