{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T22:40:06Z","timestamp":1750891206081,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030791568"},{"type":"electronic","value":"9783030791575"}],"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-79157-5_24","type":"book-chapter","created":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T07:02:35Z","timestamp":1624690955000},"page":"293-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Data Compression for Edge Devices"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Van Vaerenbergh","sequence":"first","affiliation":[]},{"given":"Tom","family":"Tourw\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"24_CR1","unstructured":"Bristol, E.: Swing door trending: adaptive trend recording. In: ISA National Conference Proceedings, pp. 749\u2013753 (1990)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Cui, M., Zhang, J., Florita, A.R., Hodge, B., Ke, D., Sun, Y.: An optimized swinging door algorithm for wind power ramp event detection. In: 2015 IEEE Power Energy Society General Meeting, pp. 1\u20135 (2015)","DOI":"10.1109\/PESGM.2015.7286272"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Cui, M., Zhang, J., Florita, A.R., Hodge, B., Ke, D., Sun, Y.: Solar power ramp events detection using an optimized swinging door algorithm. In: Proceedings of the ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (2015)","DOI":"10.1115\/DETC2015-46849"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"David Arias Correa, J., Sandro Roschildt Pinto, A., Montez, C., Le\u00e3o, E.: Swinging door trending compression algorithm for IoT environments. In: Anais Estendidos do Simp\u00f3sio Brasileiro de Engenharia de Sistemas Computacionais (SBESC), pp. 143\u2013148. Sociedade Brasileira de Computa\u00e7\u00e3o - SBC, November 2019","DOI":"10.5753\/sbesc_estendido.2019.8650"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.14778\/1687627.1687645","volume":"2","author":"H Elmeleegy","year":"2009","unstructured":"Elmeleegy, H., Elmagarmid, A., Cecchet, E., Aref, W., Zwaenepoel, W.: Online piece-wise linear approximation of numerical streams with precision guarantees. Proc. VLDB Endowment 2, 145\u2013156 (2009)","journal-title":"Proc. VLDB Endowment"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9, 1735\u201380 (1997)","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"24_CR7","unstructured":"Hsu, D.: Time Series Compression Based on Adaptive Piecewise Recurrent Autoencoder, August 2017"},{"issue":"9","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"24_CR9","unstructured":"Kingma, D.P., Welling, M.: Auto-encoding variational Bayes (2013)"},{"key":"24_CR10","unstructured":"Lazaridis, I., Mehrotra, S.: Capturing sensor-generated time series with quality guarantees. In: Proceedings 19th International Conference on Data Engineering (Cat. No. 03CH37405), pp. 429\u2013440 (2003)"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/SURV.2012.060912.00149","volume":"15","author":"T Ma","year":"2013","unstructured":"Ma, T., Hempel, M., Peng, D., Sharif, H.: A survey of energy-efficient compression and communication techniques for multimedia in resource constrained systems. IEEE Commun. Surv. Tutorials 15(3), 963\u2013972 (2013)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Papaioannou, T.G., Riahi, M., Aberer, K.: Towards online multi-model approximation of time series. In: 2011 IEEE 12th International Conference on Mobile Data Management, vol. 1, pp. 33\u201338 (2011)","DOI":"10.1109\/MDM.2011.57"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Ringwelski, M., Renner, C., Reinhardt, A., Weigel, A., Turau, V.: The Hitchhiker\u2019s guide to choosing the compression algorithm for your smart meter data. In: Proceedings of the 2nd IEEE ENERGYCON Conference and Exhibition\/ICT for Energy Symposium (ENERGYCON), pp. 998\u20131003 (2012)","DOI":"10.1109\/EnergyCon.2012.6348285"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Sadler, C.M., Martonosi, M.: Data compression algorithms for energy-constrained devices in delay tolerant networks. In: Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, pp. 265\u2013278 (2006)","DOI":"10.1145\/1182807.1182834"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Salomon, D.: A Concise Introduction to Data Compression. Undergraduate Topics in Computer Science (2008)","DOI":"10.1007\/978-1-84800-072-8"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Sherstinsky, A.: Fundamentals of recurrent neural network (RNN) and long short-term memory (LSTM) network. Physica D 404 (2020)","DOI":"10.1016\/j.physd.2019.132306"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations. AIAI 2021 IFIP WG 12.5 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79157-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T22:02:50Z","timestamp":1750888970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79157-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030791568","9783030791575"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79157-5_24","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 June 2021","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, Crete","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aiai2021.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":"113","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":"50","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":"11","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":"44% - 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.7","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":"2.8","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)"}}]}}