{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:46Z","timestamp":1740099226828,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030038007"},{"type":"electronic","value":"9783030038014"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03801-4_5","type":"book-chapter","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T12:40:49Z","timestamp":1541767249000},"page":"47-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PSO-Based Newton-Like Method and Iteration Processes in the Generation of Artistic Patterns"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1315-6082","authenticated-orcid":false,"given":"Ireneusz","family":"Go\u015bciniak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9434-9307","authenticated-orcid":false,"given":"Krzysztof","family":"Gdawiec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,10]]},"reference":[{"issue":"1\u20134","key":"5_CR1","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1080\/16864360.2004.10738298","volume":"1","author":"S Wannarumon","year":"2004","unstructured":"Wannarumon, S., Unnanon, K., Bohez, E.: Intelligent computer system for jewelry design support. Comput. Aided Des. Appl. 1(1\u20134), 551\u2013558 (2004)","journal-title":"Comput. Aided Des. Appl."},{"issue":"7","key":"5_CR2","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cad.2006.04.003","volume":"38","author":"S Soo","year":"2006","unstructured":"Soo, S., Yu, K., Chiu, W.: Modeling and fabrication of artistic products based on IFS fractal representation. Comput. Aided Des. 38(7), 755\u2013769 (2006)","journal-title":"Comput. Aided Des."},{"key":"5_CR3","unstructured":"Setti, R.: Generative dreams from deep belief networks. In: Soddu, C., Colabella, E. (eds.) Generative Art 2015: Proceeding of XVIII Generative Art Conference, pp. 260\u2013273. Domus Argenia Publisher, Milan (2015)"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.cad.2012.08.002","volume":"45","author":"C Jia","year":"2013","unstructured":"Jia, C., Ming-Xi, T.: Integrating shape grammars into a generative system for Zhuang ethnic embroidery design exploration. Comput. Aided Des. 45(3), 591\u2013604 (2013)","journal-title":"Comput. Aided Des."},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.cag.2004.03.009","volume":"28","author":"B Kalantari","year":"2004","unstructured":"Kalantari, B.: Polynomiography and applications in art, education and science. Comput. Graph. 28(3), 417\u2013430 (2004)","journal-title":"Comput. Graph."},{"key":"5_CR6","volume-title":"Polynomial Root-Finding and Polynomiography","author":"B Kalantari","year":"2009","unstructured":"Kalantari, B.: Polynomial Root-Finding and Polynomiography. World Scientific, Singapore (2009)"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1007\/s11071-017-3813-6","volume":"90","author":"K Gdawiec","year":"2017","unstructured":"Gdawiec, K.: Fractal patterns from the dynamics of combined polynomial root finding methods. Nonlinear Dyn. 90(4), 2457\u20132479 (2017)","journal-title":"Nonlinear Dyn."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gosciniak, I.: Immune algorithm in non-stationary optimization task. In: 2008 International Conference on Computational Intelligence for Modelling Control Automation, pp. 750\u2013755, December 2008","DOI":"10.1109\/CIMCA.2008.181"},{"issue":"14","key":"5_CR9","doi-asserted-by":"publisher","first-page":"3945","DOI":"10.1007\/s00500-016-2044-y","volume":"21","author":"I Gosciniak","year":"2017","unstructured":"Gosciniak, I.: Discussion on semi-immune algorithm behaviour based on fractal analysis. Soft Comput. 21(14), 3945\u20133956 (2017)","journal-title":"Soft Comput."},{"key":"5_CR10","volume-title":"Numerical Mathematics and Computing","author":"W Cheney","year":"2007","unstructured":"Cheney, W., Kincaid, D.: Numerical Mathematics and Computing, 6th edn. Brooks\/Cole, Pacific Grove (2007)","edition":"6"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1090\/S0002-9939-1953-0054846-3","volume":"4","author":"W Mann","year":"1953","unstructured":"Mann, W.: Mean value methods in iteration. Proc. Am. Math. Soc. 4(3), 506\u2013510 (1953)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1090\/S0002-9939-1974-0336469-5","volume":"44","author":"S Ishikawa","year":"1974","unstructured":"Ishikawa, S.: Fixed points by a new iteration method. Proc. Am. Math. Soc. 44(1), 147\u2013150 (1974)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"5_CR13","first-page":"61","volume":"8","author":"R Agarwal","year":"2007","unstructured":"Agarwal, R., O\u2019Regan, D., Sahu, D.: Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 8(1), 61\u201379 (2007)","journal-title":"J. Nonlinear Convex Anal."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.amc.2017.02.038","volume":"307","author":"K Gdawiec","year":"2017","unstructured":"Gdawiec, K., Kotarski, W.: Polynomiography for the polynomial infinity norm via Kalantari\u2019s formula and nonstandard iterations. Appl. Math. Comput. 307, 17\u201330 (2017)","journal-title":"Appl. Math. Comput."},{"issue":"11","key":"5_CR15","first-page":"1263","volume":"17","author":"G Das","year":"1986","unstructured":"Das, G., Debata, J.: Fixed points of quasi-nonexpansive mappings. Indian J. Pure Appl. Math. 17(11), 1263\u20131269 (1986)","journal-title":"Indian J. Pure Appl. Math."},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s12190-010-0381-z","volume":"35","author":"S Khan","year":"2011","unstructured":"Khan, S., Cho, Y., Abbas, M.: Convergence to common fixed points by a modified iteration process. J. Appl. Math. Comput. 35(1), 607\u2013616 (2011)","journal-title":"J. Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03801-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T17:59:28Z","timestamp":1662400768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03801-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038007","9783030038014"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03801-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISVC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Visual Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Las Vegas, NV","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isvc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isvc.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"58% - 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"}},{"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"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"54 papers were accepted for the main symposium out of 91 submissions; and 12 papers were accepted for the special tracks out of 22 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}