{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T12:59:08Z","timestamp":1782046748496,"version":"3.54.5"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030779696","type":"print"},{"value":"9783030779702","type":"electronic"}],"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-77970-2_26","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T10:05:06Z","timestamp":1623319506000},"page":"337-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Generic Case of Leap-Frog Algorithm for Optimal Knots Selection in Fitting Reduced Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2907-8632","authenticated-orcid":false,"given":"Ryszard","family":"Kozera","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9595-0735","authenticated-orcid":false,"given":"Lyle","family":"Noakes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3774-5909","authenticated-orcid":false,"given":"Artur","family":"Wili\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"26_CR1","unstructured":"de Boor, C.: A Practical Guide to Splines, 2nd edn. Springer, New York (2001). https:\/\/www.springer.com\/gp\/book\/9780387953663"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30285-0_1","volume-title":"Image and Video Technology \u2013 PSIVT 2015 Workshops","author":"R Kozera","year":"2016","unstructured":"Kozera, R., Noakes, L.: Optimal knots selection for sparse reduced data. In: Huang, F., Sugimoto, A. (eds.) PSIVT 2015. LNCS, vol. 9555, pp. 3\u201314. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30285-0_1"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-66320-3_19","volume-title":"Computer Algebra in Scientific Computing","author":"R Kozera","year":"2017","unstructured":"Kozera, R., Noakes, L.: Non-linearity and non-convexity in optimal knots selection for sparse reduced data. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2017. LNCS, vol. 10490, pp. 257\u2013271. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66320-3_19"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-50417-5_10","volume-title":"Computational Science \u2013 ICCS 2020","author":"R Kozera","year":"2020","unstructured":"Kozera, R., Noakes, L., Wilko\u0142azka, M.: Parameterizations and Lagrange cubics for fitting multidimensional data. In: Krzhizhanovskaya, V.V., et al. (eds.) ICCS 2020. LNCS, vol. 12138, pp. 124\u2013140. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50417-5_10"},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Kozera, R., Noakes L., Wilko\u0142azka, M.: Exponential parameterization to fit reduced data. Appl. Math. Comput. 391(C), 125645 (2021). https:\/\/doi.org\/10.1016\/j.amc.2020.125645","DOI":"10.1016\/j.amc.2020.125645"},{"key":"26_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03314-9_1","volume-title":"Advances in Soft and Hard Computing","author":"R Kozera","year":"2019","unstructured":"Kozera, R., Wili\u0144ski, A.: Fitting dense and sparse reduced data. In: Peja\u015b, J., El Fray, I., Hyla, T., Kacprzyk, J. (eds.) ACS 2018. AISC, vol. 889, pp. 3\u201317. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-03314-9_1"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Kuznetsov, E.B., Yakimovich A.Y.: The best parameterization for parametric interpolation. J. Comput. Appl. Math. 191(2), 239\u2013245 (2006). https:\/\/core.ac.uk\/download\/pdf\/81959885.pdf","DOI":"10.1016\/j.cam.2005.06.040"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kvasov, B.I.: Methods of Shape-Preserving Spline Approximation. World Scientific Pub., Singapore (2000). https:\/\/doi.org\/10.1142\/4172","DOI":"10.1142\/9789812813381"},{"key":"26_CR9","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-981-10-7868-2_7","volume-title":"Artificial Intelligence and Evolutionary Computations in Engineering Systems","author":"B Matebese","year":"2018","unstructured":"Matebese, B., Withey, D., Banda, M.K.: Modified Newton\u2019s method in the Leapfrog method for mobile robot path planning. In: Dash, S.S., Naidu, P.C.B., Bayindir, R., Das, S. (eds.) Artificial Intelligence and Evolutionary Computations in Engineering Systems. AISC, vol. 668, pp. 71\u201378. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-10-7868-2_7"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Noakes, L.: A global algorithm for geodesics. J. Aust. Math. Soc. Series A 65(1), 37\u201350 (1998). https:\/\/doi.org\/10.1017\/S1446788700039380","DOI":"10.1017\/S1446788700039380"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Noakes, L., Kozera, R.: Nonlinearities and noise reduction in 3-source photometric stereo. J. Math. Imaging Vision 18(2), 119\u2013127 (2003). https:\/\/doi.org\/10.1023\/A:1022104332058","DOI":"10.1023\/A:1022104332058"}],"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-77970-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:03:23Z","timestamp":1749506603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77970-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779696","9783030779702"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77970-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}