{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:56:47Z","timestamp":1742986607696,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031243516"},{"type":"electronic","value":"9783031243523"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-24352-3_27","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T16:04:38Z","timestamp":1673971478000},"page":"317-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Creative Graphic Design System Based on Multi-objective Firefly Algorithm"],"prefix":"10.1007","author":[{"given":"Huimin","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.asoc.2015.10.004","volume":"38","author":"M Taherkhani","year":"2016","unstructured":"Taherkhani, M., Safabakhsh, R.: A novel stability-based adaptive inertia weight for particle swarm optimization. Appl. Soft Comput. 38, 281\u2013295 (2016)","journal-title":"Appl. Soft Comput."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Chen, J., Ye, F., Jiang, T.: Numerical analyses of three inertia-weight-improvement-based particle swarm optimization algorithms. IEEE (2017)","DOI":"10.1109\/CIAPP.2017.8167198"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Peng, D., Zhao, H., Huang, L., et al.: Optimal load distribution in power plants based on dynamic inertia weight particle swarm algorithm 2016. Chin. Autom. Comput. Soc. (2016)","DOI":"10.1109\/IConAC.2016.7604895"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"32890","DOI":"10.1109\/ACCESS.2018.2845366","volume":"6","author":"Z Han","year":"2018","unstructured":"Han, Z., Li, Y., Liang, J.: Numerical Improvement for the mechanical performance of bikes based on an intelligent PSO-ABC algorithm and WSN technology. IEEE Access 6, 32890\u201332898 (2018)","journal-title":"IEEE Access"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1109\/JSYST.2019.2904383","volume":"14","author":"A Darabi","year":"2020","unstructured":"Darabi, A., Bagheri, M., Gharehpetian, G.B.: Highly accurate directional overcurrent coordination via combination of Rosen\u2019s gradient projection-complex method with GA-PSO ALGORITHM. IEEE Syst. J. 14(1), 1171\u20131182 (2020)","journal-title":"IEEE Syst. J."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"George, S.: TRUTHFUL workflow scheduling in cloud computing using Hybrid PSOACO. In: 2015 International Conference on Developments of E-Systems Engineering","DOI":"10.1109\/DeSE.2015.62"},{"issue":"3","key":"27_CR7","first-page":"1","volume":"52","author":"J Yang","year":"2016","unstructured":"Yang, J., Yang, S., Ni, P.: A vector tabu search algorithm with enhanced searching ability for Pareto solutions and its application to multiobjective optimizations. IEEE Trans. Magn. 52(3), 1\u20134 (2016)","journal-title":"IEEE Trans. Magn."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Chiali, I., Debbat, F., Bendimerad, F.T.: Hybridization of tabu search and local search metaheuristic algorithms for multiuser detection of SDMA-OFDM system. IEEE (2017)","DOI":"10.1109\/DAT.2017.7889166"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhang, X., Zhang, X.: Antenna array design by artificial bee colony algorithm with similarity induced search method. IEEE Trans. Mag. 55(6), 1.47\u20134.47 (2019)","DOI":"10.1109\/TMAG.2019.2896921"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ins.2020.03.064","volume":"527","author":"H Wang","year":"2020","unstructured":"Wang, H., Wang, W., Xiao, S., et al.: Improving artificial Bee colony algorithm using a new neighborhood selection mechanism. Inf. Sci. 527, 227\u2013240 (2020)","journal-title":"Inf. Sci."},{"issue":"6","key":"27_CR11","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/TDSC.2017.2725953","volume":"16","author":"J Shen","year":"2019","unstructured":"Shen, J., Zhou, T., He, D., et al.: Block design-based key agreement for group data sharing in cloud computing. IEEE Trans. Dependable Secur. Comput. 16(6), 996\u20131010 (2019)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/JAS.2017.7510313","volume":"4","author":"MH Ghahramani","year":"2017","unstructured":"Ghahramani, M.H., Zhou, M., Hon, C.T.: Toward cloud computing QoS architecture: analysis of cloud systems and cloud services. IEEE\/CAA J. Automatica Sinica 4(1), 6\u201318 (2017)","journal-title":"IEEE\/CAA J. Automatica Sinica"}],"container-title":["Communications in Computer and Information Science","Machine Learning, Image Processing, Network Security and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24352-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T16:19:44Z","timestamp":1673972384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24352-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031243516","9783031243523"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24352-3_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIND","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Image Processing, Network Security and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mind2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.manit.ac.in\/mind2022\/","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":"399","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":"64","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":"0","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":"16% - 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":"4","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":"5","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)"}}]}}