{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:09:49Z","timestamp":1743120589197,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199081"},{"type":"electronic","value":"9783030199098"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19909-8_13","type":"book-chapter","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:14:02Z","timestamp":1557879242000},"page":"150-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing Long Sequences of Consecutive Fibonacci Integers with TensorFlow"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Drakopoulos","sequence":"first","affiliation":[]},{"given":"Xenophon","family":"Liapakis","sequence":"additional","affiliation":[]},{"given":"Evaggelos","family":"Spyrou","sequence":"additional","affiliation":[]},{"given":"Giannis","family":"Tzimas","sequence":"additional","affiliation":[]},{"given":"Phivos","family":"Mylonas","sequence":"additional","affiliation":[]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,15]]},"reference":[{"issue":"9","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3022670.2976746","volume":"51","author":"Mart\u00edn Abadi","year":"2016","unstructured":"Abadi, M.: TensorFlow: learning functions at scale. ACM SIGPLAN Not. 51(9) (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"13_CR2","unstructured":"Abadi, M., et al.: TensorFlow: a system for large-scale machine learning. In: OSDI, vol. 16, pp. 265\u2013283 (2016)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1090\/S0002-9939-05-08220-1","volume":"134","author":"A Akbary","year":"2006","unstructured":"Akbary, A., Wang, Q.: A generalized Lucas sequence and permutation binomials. Proc. Am. Math. Soc. 134(1), 15\u201322 (2006)","journal-title":"Proc. Am. Math. Soc."},{"key":"13_CR4","first-page":"526","volume":"245","author":"G Bilgici","year":"2014","unstructured":"Bilgici, G.: Two generalizations of Lucas sequence. Appl. Math. Comput. 245, 526\u2013538 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"22","key":"13_CR5","first-page":"1097","volume":"5","author":"C Bolat","year":"2010","unstructured":"Bolat, C., K\u00f6se, H.: On the properties of k-Fibonacci numbers. Int. J. Contemp. Math. Sci. 5(22), 1097\u20131105 (2010)","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-1-4612-3352-7_9","volume-title":"Sequences","author":"RM Capocelli","year":"1990","unstructured":"Capocelli, R.M., Cerbone, G., Cull, P., Holloway, J.L.: Fibonacci facts and formulas. In: Capocelli, R.M. (ed.) Sequences, pp. 123\u2013137. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4612-3352-7_9"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Chollet, F.: Xception: deep learning with depthwise separable convolutions. In: CVPR, pp. 1251\u20131258 (2017)","DOI":"10.1109\/CVPR.2017.195"},{"key":"13_CR8","unstructured":"Chollet, F., et al.: Keras: deep learning library for theano and TensorFlow (2015)"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0022-314X(70)90044-2","volume":"2","author":"JD Dixon","year":"1970","unstructured":"Dixon, J.D.: The number of steps in the Euclidean algorithm. J. Number Theory 2(4), 414\u2013422 (1970)","journal-title":"J. Number Theory"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Drakopoulos, G., Gourgaris, P., Kanavos, A.: Graph communities in Neo4j: four algorithms at work. Evolving Syst. (2018). https:\/\/doi.org\/10.1007\/s12530-018-9244-x","DOI":"10.1007\/s12530-018-9244-x"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/computation5030034","volume":"5","author":"Georgios Drakopoulos","year":"2017","unstructured":"Drakopoulos, G., Kanavos, A., Karydis, I., Sioutas, S., Vrahatis, A.G.: Tensor-based semantically-aware topic clustering of biomedical documents. Computation 5(3) (2017)","journal-title":"Computation"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Drakopoulos, G., Kanavos, A., Tsolis, D., Mylonas, P., Sioutas, S.: Towards a framework for tensor ontologies over Neo4j: representations and operations. In: IISA, August 2017","DOI":"10.1109\/IISA.2017.8316441"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Drakopoulos, G., Liapakis, X., Tzimas, G., Mylonas, P.: A graph resilience metric based on paths: higher order analytics with GPU. In: ICTAI. IEEE, November 2018","DOI":"10.1109\/ICTAI.2018.00138"},{"key":"13_CR14","volume-title":"GeNeDis 2018","author":"G Drakopoulos","year":"2018","unstructured":"Drakopoulos, G., Marountas, M., Liapakis, X., Tzimas, G., Mylonas, P., Sioutas, S.: Blockchain for mobile health applications: acceleration with GPU computing. In: Vlamos, P. (ed.) GeNeDis 2018. Springer, Heidelberg (2018)"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Drakopoulos, G., et al.: A genetic algorithm for spatiosocial tensor clustering: exploiting TensorFlow potential. Evolving Syst. (2019). https:\/\/doi.org\/10.1007\/s12530-019-09274-9","DOI":"10.1007\/s12530-019-09274-9"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Dunlap, R.A.: The Golden Ratio and Fibonacci Numbers. World Scientific (1997)","DOI":"10.1142\/3595"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Fateman, R.J.: Lookup tables, recurrences and complexity. In: International Symposium on Symbolic and Algebraic Computation, pp. 68\u201373. ACM (1989)","DOI":"10.1145\/74540.74549"},{"issue":"1\u20134","key":"13_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"ML Fredman","year":"1986","unstructured":"Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1(1\u20134), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"13_CR20","unstructured":"Goldsborough, P.: A tour of TensorFlow. arXiv preprint arXiv:1610.01178 (2016)"},{"issue":"12","key":"13_CR21","first-page":"6011","volume":"217","author":"A \u0130pek","year":"2011","unstructured":"\u0130pek, A.: On the spectral norms of circulant matrices with classical Fibonacci and Lucas numbers entries. Appl. Math. Comput. 217(12), 6011\u20136012 (2011)","journal-title":"Appl. Math. Comput."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-1-4842-2766-4_7","volume-title":"Deep Learning with Python","author":"N Ketkar","year":"2017","unstructured":"Ketkar, N.: Introduction to keras. In: Ketkar, N. (ed.) Deep Learning with Python, pp. 97\u2013111. Springer, Heidelberg (2017)"},{"key":"13_CR23","volume-title":"Fibonacci and Lucas Numbers with Applications","author":"T Koshy","year":"2019","unstructured":"Koshy, T.: Fibonacci and Lucas Numbers with Applications. Wiley, Hoboken (2019)"},{"issue":"1","key":"13_CR24","first-page":"1299","volume":"18","author":"DG Matthews","year":"2017","unstructured":"Matthews, D.G., et al.: GPflow: a Gaussian process library using TensorFlow. J. Mach. Learn. Res. 18(1), 1299\u20131304 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Raith, F., Richter, I., Lindermeier, R., Klinker, G.: Identification of inaccurate effort estimates in agile software development. In: APSEC, vol. 2, pp. 67\u201372. IEEE (2013)","DOI":"10.1109\/APSEC.2013.114"},{"issue":"3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TE.2015.2506624","volume":"59","author":"G Rodr\u00edguez","year":"2016","unstructured":"Rodr\u00edguez, G., Soria, \u00c1., Campo, M.: Measuring the impact of agile coaching on students\u2019 performance. Trans. Educ. 59(3), 202\u2013209 (2016)","journal-title":"Trans. Educ."},{"key":"13_CR27","volume-title":"Essential Scrum: A Practical Guide to the Most Popular Agile Process","author":"KS Rubin","year":"2012","unstructured":"Rubin, K.S.: Essential Scrum: A Practical Guide to the Most Popular Agile Process. Addison-Wesley, Boston (2012)"},{"key":"13_CR28","unstructured":"Schwaber, K., Sutherland, J.: The scrum guide. Scrum Alliance 21 (2011)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Sorenson, J.: An analysis of Lehmer\u2019s Euclidean GCD algorithm. In: International Symposium on Symbolic and Algebraic Computation, pp. 254\u2013258. ACM (1995)","DOI":"10.1145\/220346.220378"},{"issue":"6","key":"13_CR30","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0020-0190(00)00112-5","volume":"75","author":"D Takahashi","year":"2000","unstructured":"Takahashi, D.: A fast algorithm for computing large Fibonacci numbers. Inf. Process. Lett. 75(6), 243\u2013246 (2000)","journal-title":"Inf. Process. Lett."},{"key":"13_CR31","first-page":"225","volume":"35","author":"W Zhang","year":"1997","unstructured":"Zhang, W.: Some identities involving the Fibonacci numbers. Fibonacci Q. 35, 225\u2013228 (1997)","journal-title":"Fibonacci Q."}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19909-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T13:40:38Z","timestamp":1684158038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19909-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199081","9783030199098"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19909-8_13","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Artificial Intelligence Applications and Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hersonissos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aiai2019.eu\/","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":"Easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"49","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":"6","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":"49% - 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.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}