{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:36:31Z","timestamp":1743071791875,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030399504"},{"type":"electronic","value":"9783030399511"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39951-1_15","type":"book-chapter","created":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T19:02:22Z","timestamp":1580670142000},"page":"242-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Logic-Based Approach to Incremental Monitoring and Optimization on Strongly Distributed Data Streams"],"prefix":"10.1007","author":[{"given":"Elena V.","family":"Ravve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Babcock, B., Olston, C.: Distributed top-k monitoring. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 28\u201339. SIGMOD 2003, ACM, New York, NY, USA (2003)","DOI":"10.1145\/872757.872764"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-02737-6_2","volume-title":"Developments in Language Theory","author":"B Bollig","year":"2009","unstructured":"Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 18\u201338. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02737-6_2"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2579819","volume":"15","author":"B Bollig","year":"2014","unstructured":"Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Pebble weighted automata and weighted logics. ACM Trans. Comput. Log. 15(2), 15 (2014). \nhttps:\/\/doi.org\/10.1145\/2579819","journal-title":"ACM Trans. Comput. Log."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.: Weak second-order arithmetic and finite automata. Z. Math. LogikGrundlagen Math. 6, 66\u201392 (1960)","journal-title":"Z. Math. LogikGrundlagen Math."},{"key":"15_CR5","unstructured":"Cherniack, M., et al.: Scalable distributed stream processing. In: CIDR 2003 - First Biennial Conference on Innovative Data Systems Research, Asilomar, CA, January 2003"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1366102.1366106","volume":"33","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Garofalakis, M.: Approximate continuous querying over distributed streams. ACM Trans. Database Syst. 33(2), 9:1\u20139:39 (2008)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/1921659.1921667","volume":"7","author":"G Cormode","year":"2011","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. ACM Trans. Algorithms 7(2), 211\u20132120 (2011). \nhttps:\/\/doi.org\/10.1145\/1921659.1921667","journal-title":"ACM Trans. Algorithms"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10692760_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Courcelle","year":"1998","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 1\u201316. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/10692760_1"},{"issue":"1\u20132","key":"15_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Appl. Math. 108(1\u20132), 23\u201352 (2001)","journal-title":"Discrete Appl. Math."},{"key":"15_CR10","unstructured":"Cvr\u010dek, D.: Authorization model for strongly distributed information systems. Ph.D. thesis, Faculty of Electrical Engineering and Computer Science, Brno University of Technology, Czech Republic (2000)"},{"key":"15_CR11","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics, research Report LSV-05-13, Labiratoire Sp\u00e9cification et V\u00e9rification, Ecole Normal Sup\u00e9rieure Cachan 61, avenue du Pr\u00e9sident Wilson 94235 Cachan Cedex France (2005)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoret. Comput. Sci. 380, 69\u201386 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-24897-9_2","volume-title":"Algebraic Foundations in Computer Science","author":"M Droste","year":"2011","unstructured":"Droste, M., G\u00f6tze, D., M\u00e4rcker, S., Meinecke, I.: Weighted tree automata over valuation monoids and their characterization by weighted logics. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 30\u201355. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24897-9_2"},{"key":"15_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Berlin (2009)","edition":"1"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-15155-2_47","volume-title":"Mathematical Foundations of Computer Science 2010","author":"M Droste","year":"2010","unstructured":"Droste, M., Meinecke, I.: Describing average- and longtime-behavior by weighted MSO logics. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 537\u2013548. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15155-2_47"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-642-22321-1_43","volume-title":"Developments in Language Theory","author":"M Droste","year":"2011","unstructured":"Droste, M., Meinecke, I., \u0160e\u0161elja, B., Tepav\u010devi\u0107, A.: A cascade decomposition of weighted finite transition systems. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 472\u2013473. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22321-1_43"},{"key":"15_CR17","unstructured":"Droste, M., Paul, E.: A Feferman-Vaught decomposition theorem for weighted MSO logic. In: Potapov, I., Spirakis, P., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. LIPIcs, vol. 117, pp. 76:1\u201376:15 (2018)"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00224-009-9224-4","volume":"48","author":"M Droste","year":"2009","unstructured":"Droste, M., Vogler, H.: Weighted logics for unranked tree automata. Theory Comput. Syst. 48(1), 23\u201347 (2009)","journal-title":"Theory Comput. Syst."},{"key":"15_CR19","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03182-7","volume-title":"Finite Model Theory","author":"H Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995). \nhttps:\/\/doi.org\/10.1007\/978-3-662-03182-7"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C Elgot","year":"1961","unstructured":"Elgot, C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21\u201352 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","volume":"47","author":"S Feferman","year":"1959","unstructured":"Feferman, S., Vaught, R.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57\u2013103 (1959)","journal-title":"Fundamenta Mathematicae"},{"issue":"2","key":"15_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00224-010-9296-1","volume":"50","author":"Z F\u00fcl\u00f6p","year":"2012","unstructured":"F\u00fcl\u00f6p, Z., St\u00fcber, T., Vogler, H.: A B\u00fcchi-like theorem for weighted tree automata over multioperator monoids. Theory Comput. Syst. 50(2), 241\u2013278 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"10","key":"15_CR23","doi-asserted-by":"publisher","first-page":"937","DOI":"10.14778\/2536206.2536220","volume":"6","author":"M Garofalakis","year":"2013","unstructured":"Garofalakis, M., Keren, D., Samoladas, V.: Sketch-based geometric monitoring of distributed stream queries. Proc. VLDB Endow. 6(10), 937\u2013948 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"15_CR24","first-page":"1","volume-title":"Advances in Databases and Information Systems","author":"Minos Garofalakis","year":"2014","unstructured":"Garofalakis, M.: Querying distributed data streams - (invited keynote talk). In: Proceedings of 18th East European Conference Advances in Databases and Information Systems, ADBIS 2014, Ohrid, Macedonia, 7\u201310 September 2014, pp. 1\u201310 (2014)"},{"key":"15_CR25","first-page":"2003","volume":"15","author":"A Gilbert","year":"2003","unstructured":"Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.J.: One-pass wavelet decompositions of data streams. IEEE TKDE 15, 2003 (2003)","journal-title":"IEEE TKDE"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E., Siebertz, S.: Dynamic definability. In: 15th International Conference on Database Theory, ICDT 2012, Berlin, Germany, 26\u201329 March 2012, pp. 236\u2013248 (2012). \nhttps:\/\/doi.org\/10.1145\/2274576.2274601","DOI":"10.1145\/2274576.2274601"},{"key":"15_CR27","series-title":"Graduate texts in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate texts in computer science. Springer, New York (1999). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-0539-5"},{"issue":"8","key":"15_CR28","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1109\/TKDE.2013.180","volume":"26","author":"D Keren","year":"2014","unstructured":"Keren, D., Sagy, G., Abboud, A., Ben-David, D., Schuster, A., Sharfman, I., Deligiannakis, A.: Geometric monitoring of heterogeneous streams. IEEE Trans. Knowl. Data Eng. 26(8), 1890\u20131903 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Riveros, C.: Quantitative monadic second-order logic. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25\u201328 June 2013, pp. 113\u2013122 (2013)","DOI":"10.1109\/LICS.2013.16"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"122","DOI":"10.4204\/EPTCS.119.12","volume":"119","author":"Nadia Labai","year":"2013","unstructured":"Labai, N., Makowsky, J.: Weighted automata and monadic second order logic. In: Proceedings Fourth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2013, Borca di Cadore, Dolomites, Italy, 29\u201331th August 2013, pp. 122\u2013135 (2013)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"5","key":"15_CR31","first-page":"545","volume":"8","author":"A Lazerson","year":"2015","unstructured":"Lazerson, A., Sharfman, I., Keren, D., Schuster, A., Garofalakis, M., Samoladas, V.: Monitoring distributed streams using convex decompositions. PVLDB 8(5), 545\u2013556 (2015)","journal-title":"PVLDB"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J Makowsky","year":"2004","unstructured":"Makowsky, J.: Algorithmic uses of the Feferman-Vaught theorem. Ann. Pure Appl. Logic 126, 159\u2013213 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/3-540-60246-1_159","volume-title":"Mathematical Foundations of Computer Science 1995","author":"JA Makowsky","year":"1995","unstructured":"Makowsky, J.A., Ravve, E.V.: Incremental model checking for decomposable structures. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 540\u2013551. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-60246-1_159"},{"issue":"2","key":"15_CR34","first-page":"411","volume":"19","author":"E Mandrali","year":"2009","unstructured":"Mandrali, E., Rahonis, G.: Recognizable tree series with discounting. Acta Cybernetica 19(2), 411\u2013439 (2009)","journal-title":"Acta Cybernetica"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Olston, C., Jiang, J., Widom, J.: Adaptive filters for continuous queries over distributed data streams. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 563\u2013574. SIGMOD 2003, ACM, New York, NY, USA (2003)","DOI":"10.1145\/872757.872825"},{"key":"15_CR36","series-title":"Studies in Logic","first-page":"58","volume-title":"Logic, Methodology and Philosophy of Science II","author":"M Rabin","year":"1965","unstructured":"Rabin, M.: A simple method for undecidability proofs and some applications. In: Hillel, Y.B. (ed.) Logic, Methodology and Philosophy of Science II. Studies in Logic, pp. 58\u201368. North Holland, Amsterdam (1965)"},{"key":"15_CR37","unstructured":"Ravve, E.V., Volkovich, Z., Weber, G.W.: A uniform approach to incremental automated reasoning on strongly distributed structures. In: Gottlob, G., Sutcliffe, G., Voronkov, A. (eds.) GCAI 2015. Global Conference on Artificial Intelligence. EasyChair Proceedings in Computing, vol. 36, pp. 229\u2013251. EasyChair (2015)"},{"key":"15_CR38","unstructured":"Ravve, E., Volkovich, Z.: Four scenarios of effective computations on sum-like graphs. In: Proceedings of the The 9th International Multi-Conference on Computing in the Global Informationin Technology, pp. 1\u20138 (2014)"},{"key":"15_CR39","unstructured":"Ravve, E.: Model Checking for various notions of products. Master\u2019s thesis, Thesis, Department of Computer Science, Technion-Israel Institute of Technology (1995)"},{"issue":"11","key":"15_CR40","doi-asserted-by":"publisher","first-page":"3061","DOI":"10.1002\/cpe.3597","volume":"28","author":"E Ravve","year":"2016","unstructured":"Ravve, E.: Incremental computations over strongly distributed databases. Concurrency Comput. Pract. Experience 28(11), 3061\u20133076 (2016)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"15_CR41","volume-title":"Analytic Methods in Systems and Software Testing","author":"E Ravve","year":"2017","unstructured":"Ravve, E., Volkovich, Z.: Incremental verification and coverage analysis of strongly distributed systems. In: Kenett, R., Ruggeri, G., Faltin, F. (eds.) Analytic Methods in Systems and Software Testing. Wiley, Hoboken (2017)"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Ravve, E., Volkovich, Z., Weber, G.W.: Effective optimization with weighted automata on decomposable trees. Optimization Journal, Special Issue on Recent Advances in Continuous Optimization on the Occasion of the 25th European Conference on Operational Research (EURO XXV 2012), vol. 63, pp. 109\u2013127 (2014)","DOI":"10.1080\/02331934.2013.865735"},{"key":"15_CR43","doi-asserted-by":"crossref","unstructured":"Ravve, E., Volkovich, Z., Weber, G.W.: Reasoning on strongly distributed multi-agent systems. In: Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 251\u2013256 (2015)","DOI":"10.1109\/SYNASC.2015.68"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Schubert, E., Weiler, M., Kriegel, H.P.: Signitrend: scalable detection of emerging topics in textual streams by hashed significance thresholds. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 871\u2013880. KDD 2014, ACM, New York, NY, USA (2014)","DOI":"10.1145\/2623330.2623740"},{"issue":"4","key":"15_CR45","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1292609.1292613","volume":"32","author":"I Sharfman","year":"2007","unstructured":"Sharfman, I., Schuster, A., Keren, D.: A geometric approach to monitoring threshold functions over distributed data streams. ACM Trans. Database Syst. 32(4), 23 (2007)","journal-title":"ACM Trans. Database Syst."},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Sharfman, I., Schuster, A., Keren, D.: Shape sensitive geometric monitoring. In: Proceedings of the Twenty-seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 301\u2013310. PODS 2008, ACM, New York, NY, USA (2008)","DOI":"10.1145\/1376916.1376958"},{"issue":"4","key":"15_CR47","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TKDE.2008.169","volume":"21","author":"R Wolff","year":"2009","unstructured":"Wolff, R., Bhaduri, K., Kargupta, H.: A generic local algorithm for mining data streams in large distributed systems. IEEE Trans. Knowl. Data Eng. 21(4), 465\u2013478 (2009). \nhttps:\/\/doi.org\/10.1109\/TKDE.2008.169","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39951-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T05:47:26Z","timestamp":1580795246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39951-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030399504","9783030399511"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39951-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoIKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations of Information and Knowledge Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"foiks2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/foiks2020.cs.tu-dortmund.de\/","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":"33","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":"19","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":"0","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":"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 (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":"2","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)"}}]}}