{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:36:11Z","timestamp":1743122171585,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936970"},{"type":"electronic","value":"9783319936987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_49","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"639-652","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast Higher-Order Functions for Tensor Calculus with Tensors and Subtensors"],"prefix":"10.1007","author":[{"given":"Cem","family":"Bassoy","sequence":"first","affiliation":[]},{"given":"Volker","family":"Schatz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"49_CR1","unstructured":"Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., Kudlur, M., Levenberg, J., Monga, R., Moore, S., Murray, D.G., Steiner, B., Tucker, P., Vasudevan, V., Warden, P., Wicke, M., Yu, Y., Zheng, X.: TensorFlow: a system for large-scale machine learning. In: Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI 2016, pp. 265\u2013283. USENIX Association, Berkeley (2016)"},{"key":"49_CR2","unstructured":"Andres, B., K\u00f6the, U., Kr\u00f6ger, T., Hamprecht, F.A.: Runtime-flexible multi-dimensional arrays and views for C++98 and C++0x. CoRR abs\/1008.2909 (2010)"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1137\/100804577","volume":"34","author":"M Brazell","year":"2013","unstructured":"Brazell, M., Li, N., Navasca, C., Tamon, C.: Solving multilinear systems via tensor inversion. SIAM J. Matrix Anal. Appl. 34, 542\u2013570 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"49_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/2166.2167","volume":"5","author":"NH Cohen","year":"1983","unstructured":"Cohen, N.H.: Eliminating redundant recursive calls. ACM Trans. Program. Lang. Syst. (TOPLAS) 5(3), 265\u2013299 (1983)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.knosys.2015.07.013","volume":"89","author":"H Fanaee-T","year":"2015","unstructured":"Fanaee-T, H., Gama, J.: Multi-aspect-streaming tensor analysis. Knowl.-Based Syst. 89, 332\u2013345 (2015)","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/spe.630","volume":"35","author":"R Garcia","year":"2005","unstructured":"Garcia, R., Lumsdaine, A.: MultiArray: a C++ library for generic programming with arrays. Softw. Pract. Exper. 35(2), 159\u2013188 (2005)","journal-title":"Softw. Pract. Exper."},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1017\/S0962492914000087","volume":"23","author":"W Hackbusch","year":"2014","unstructured":"Hackbusch, W.: Numerical tensor calculus. Acta Numer. 23, 651\u2013742 (2014)","journal-title":"Acta Numer."},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jocs.2016.05.004","volume":"16","author":"AP Harrison","year":"2016","unstructured":"Harrison, A.P., Joseph, D.: Numeric tensor framework: exploiting and extending einstein notation. J. Comput. Sci. 16, 128\u2013139 (2016)","journal-title":"J. Comput. Sci."},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Sun, J.: Scalable tensor decompositions for multi-aspect data mining. In: Proceedings of the 8th IEEE International Conference on Data Mining, pp. 363\u2013372. IEEE, Washington (2008)","DOI":"10.1109\/ICDM.2008.89"},{"key":"49_CR10","volume-title":"Handbook of Linear Algebra","author":"LH Lim","year":"2017","unstructured":"Lim, L.H.: Tensors and hypermatrices. In: Hogben, L. (ed.) Handbook of Linear Algebra, 2nd edn. Chapman and Hall, New York (2017)","edition":"2"},{"issue":"11","key":"49_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/328691.328700","volume":"34","author":"YA Liu","year":"1999","unstructured":"Liu, Y.A., Stoller, S.D.: From recursion to iteration: what are the optimizations? ACM SIGPLAN Not. 34(11), 73\u201382 (1999)","journal-title":"ACM SIGPLAN Not."},{"issue":"3","key":"49_CR12","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.patcog.2006.08.004","volume":"40","author":"B Savas","year":"2007","unstructured":"Savas, B., Eld\u00e9n, L.: Handwritten digit classification using higher order singular value decomposition. Pattern Recogn. 40(3), 993\u20131003 (2007)","journal-title":"Pattern Recogn."},{"issue":"3pt2","key":"49_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1111\/cgf.12102","volume":"32","author":"S.K. Suter","year":"2013","unstructured":"Suter, S.K., Makhynia, M., Pajarola, R.: Tamresh - tensor approximation multiresolution hierarchy for interactive volume visualization. In: Proceedings of the 15th Eurographics Conference on Visualization, EuroVis 2013, pp. 151\u2013160. Eurographics Association (2013)","journal-title":"Computer Graphics Forum"},{"key":"49_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49372-7_24","volume-title":"Computing in Object-Oriented Parallel Environments","author":"TL Veldhuizen","year":"1998","unstructured":"Veldhuizen, T.L.: Arrays in blitz++. In: Caromel, D., Oldehoeft, R.R., Tholburn, M. (eds.) ISCOPE 1998. LNCS, vol. 1505, pp. 223\u2013230. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49372-7_24"},{"issue":"8","key":"49_CR15","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1093\/comjnl\/42.8.650","volume":"42","author":"MP Ward","year":"1999","unstructured":"Ward, M.P., Bennett, K.H.: Recursion removal\/introduction by formal transformation: an aid to program development and program comprehension. Comput. J. 42(8), 650\u2013650 (1999)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:08:15Z","timestamp":1654906095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_49","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":"12 June 2018","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":"Wuxi","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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":"406","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":"148","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":"60","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":"36% - 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":"3","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":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%.  A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}