{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:10:26Z","timestamp":1762459826823,"version":"3.37.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"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-43120-4_27","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"341-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved Cross-Validation for Classifiers that Make Algorithmic Choices to\u00a0Minimise Runtime Without Compromising Output Correctness"],"prefix":"10.1007","author":[{"given":"Dorian","family":"Florescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"England","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"27_CR1","volume-title":"Pattern Recognition and Machine Learning","author":"C Bishop","year":"2006","unstructured":"Bishop, C.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-10515-4_4","volume-title":"Computer Algebra in Scientific Computing","author":"R Bradford","year":"2014","unstructured":"Bradford, R., Chen, C., Davenport, J.H., England, M., Moreno Maza, M., Wilson, D.: Truth table invariant cylindrical algebraic decomposition by regular chains. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2014. LNCS, vol. 8660, pp. 44\u201358. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10515-4_4"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bradford, R., et al.: A case study on the parametric occurrence of multiple steady states. In: Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, pp. 45\u201352. ACM (2017). \nhttps:\/\/doi.org\/10.1145\/3087604.3087622","DOI":"10.1145\/3087604.3087622"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jsc.2019.07.008","volume":"98","author":"R Bradford","year":"2020","unstructured":"Bradford, R., et al.: Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98, 84\u2013119 (2020). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2019.07.008","journal-title":"J. Symb. Comput."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jsc.2015.11.002","volume":"76","author":"R Bradford","year":"2016","unstructured":"Bradford, R., Davenport, J., England, M., McCallum, S., Wilson, D.: Truth table invariant cylindrical algebraic decomposition. J. Symb. Comput. 76, 1\u201335 (2016). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2015.11.002","journal-title":"J. Symb. Comput."},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-39320-4_2","volume-title":"Intelligent Computer Mathematics","author":"R Bradford","year":"2013","unstructured":"Bradford, R., Davenport, J.H., England, M., Wilson, D.: Optimising problem formulation for cylindrical algebraic decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS (LNAI), vol. 7961, pp. 19\u201334. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39320-4_2"},{"key":"27_CR7","unstructured":"Bridge, J.: Machine learning and automated theorem proving. Technical report. UCAM-CL-TR-792, University of Cambridge, Computer Laboratory (2010)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10817-014-9301-5","volume":"53","author":"J Bridge","year":"2014","unstructured":"Bridge, J., Holden, S., Paulson, L.: Machine learning for first-order theorem proving. J. Autom. Reason. 53, 141\u2013172 (2014). \nhttps:\/\/doi.org\/10.1007\/s10817-014-9301-5","journal-title":"J. Autom. Reason."},{"key":"27_CR9","unstructured":"Brown, C.: Companion to the tutorial: cylindrical algebraic decomposition. Presented at ISSAC 2004 (2004). \nhttp:\/\/www.usna.edu\/Users\/cs\/wcbrown\/research\/ISSAC04\/handout.pdf"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Brown, C., Davenport, J.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC 2007, pp. 54\u201360. ACM (2007). \nhttps:\/\/doi.org\/10.1145\/1277548.1277557","DOI":"10.1145\/1277548.1277557"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Carette, J.: Understanding expression simplification. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ISSAC 2004, pp. 72\u201379. ACM (2004). \nhttps:\/\/doi.org\/10.1145\/1005285.1005298","DOI":"10.1145\/1005285.1005298"},{"key":"27_CR12","series-title":"Texts & Monographs in Symbolic Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"B Caviness","year":"1998","unstructured":"Caviness, B., Johnson, J.: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts & Monographs in Symbolic Computation. Springer, New York (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-9459-1"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-43799-5_17","volume-title":"Computer Mathematics","author":"C Chen","year":"2014","unstructured":"Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Feng, R., Lee, W., Sato, Y. (eds.) Computer Mathematics, pp. 199\u2013221. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43799-5_17"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009, pp. 95\u2013102. ACM (2009). \nhttps:\/\/doi.org\/10.1145\/1576702.1576718","DOI":"10.1145\/1576702.1576718"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Chinchor, N.: MUC-4 evaluation metrics. In: Proceedings of the 4th Conference on Message Understanding (MUC4 1992), pp. 22\u201329. Association for Computational Linguistics (1992). \nhttps:\/\/doi.org\/10.3115\/1072064.1072067","DOI":"10.3115\/1072064.1072067"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). \nhttps:\/\/doi.org\/10.1007\/3-540-07407-4_17\n\n. Reprinted in the collection [12]"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G Collins","year":"1991","unstructured":"Collins, G., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12, 299\u2013328 (1991). \nhttps:\/\/doi.org\/10.1016\/S0747-7171(08)80152-6","journal-title":"J. Symb. Comput."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Davenport, J., Bradford, R., England, M., Wilson, D.: Program verification in the presence of complex numbers, functions with branch cuts etc. In: 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, pp. 83\u201388. IEEE (2012). \nhttp:\/\/dx.doi.org\/10.1109\/SYNASC.2012.68","DOI":"10.1109\/SYNASC.2012.68"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ISSAC 2004, pp. 111\u2013118. ACM (2004). \nhttps:\/\/doi.org\/10.1145\/1005285.1005303","DOI":"10.1145\/1005285.1005303"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-96418-8_20","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"M England","year":"2018","unstructured":"England, M.: Machine learning for mathematical software. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 165\u2013174. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96418-8_20"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"England, M., Bradford, R., Davenport, J.: Cylindrical algebraic decomposition with equational constraints. J. Symb. Comput. (2019). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2019.07.019","DOI":"10.1016\/j.jsc.2019.07.019"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-662-44199-2_68","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"M England","year":"2014","unstructured":"England, M., Bradford, R., Davenport, J.H., Wilson, D.: Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 450\u2013457. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44199-2_68"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-23250-4_7","volume-title":"Intelligent Computer Mathematics","author":"M England","year":"2019","unstructured":"England, M., Florescu, D.: Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition. In: Kaliszyk, C., Brady, E., Kohlhase, A., Sacerdoti Coen, C. (eds.) CICM 2019. LNCS (LNAI), vol. 11617, pp. 93\u2013108. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-23250-4_7"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-662-44199-2_69","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"M England","year":"2014","unstructured":"England, M., Wilson, D., Bradford, R., Davenport, J.H.: Using the regular chains library to build cylindrical algebraic decompositions by projecting and lifting. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 458\u2013465. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44199-2_69"},{"key":"27_CR25","unstructured":"Florescu, D., England, M.: Algorithmically generating new algebraic features of polynomial systems for machine learning. In: Abbott, J., Griggio, A. (eds.) Proceedings of the 4th Workshop on Satisfiability Checking and Symbolic Computation (SC$$^2$$ 2019). No. 2460 in CEUR Workshop Proceedings (2019). \nhttp:\/\/ceur-ws.org\/Vol-2460\/"},{"key":"27_CR26","doi-asserted-by":"publisher","unstructured":"Ghaffarian, S., Shahriari, H.: Software vulnerability analysis and discovery using machine-learning and data-mining techniques: a survey. ACM Comput. Surv. 50(4) (2017). \nhttps:\/\/doi.org\/10.1145\/3092566","DOI":"10.1145\/3092566"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Huang, Z., England, M., Davenport, J., Paulson, L.: Using machine learning to decide when to precondition cylindrical algebraic decomposition with Groebner bases. In: 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), pp. 45\u201352. IEEE (2016). \nhttps:\/\/doi.org\/10.1109\/SYNASC.2016.020","DOI":"10.1109\/SYNASC.2016.020"},{"issue":"4","key":"27_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s11786-019-00394-8","volume":"13","author":"Z Huang","year":"2019","unstructured":"Huang, Z., England, M., Wilson, D., Bridge, J., Davenport, J., Paulson, L.: Using machine learning to improve cylindrical algebraic decomposition. Math. Comput. Sci. 13(4), 461\u2013488 (2019). \nhttps:\/\/doi.org\/10.1007\/s11786-019-00394-8","journal-title":"Math. Comput. Sci."},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-08434-3_8","volume-title":"Intelligent Computer Mathematics","author":"Z Huang","year":"2014","unstructured":"Huang, Z., England, M., Wilson, D., Davenport, J.H., Paulson, L.C., Bridge, J.: Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 92\u2013107. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08434-3_8"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-31365-3_27","volume-title":"Automated Reasoning","author":"D Jovanovi\u0107","year":"2012","unstructured":"Jovanovi\u0107, D., de Moura, L.: Solving non-linear arithmetic. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 339\u2013354. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31365-3_27"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-32859-1_21","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"M Kobayashi","year":"2016","unstructured":"Kobayashi, M., Iwane, H., Matsuzaki, T., Anai, H.: Efficient subformula orders for real quantifier elimination of non-prenex formulas. In: Kotsireas, I.S., Rump, S.M., Yap, C.K. (eds.) MACIS 2015. LNCS, vol. 9582, pp. 236\u2013251. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-32859-1_21"},{"key":"27_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-39634-2_6","volume-title":"Interactive Theorem Proving","author":"D K\u00fchlwein","year":"2013","unstructured":"K\u00fchlwein, D., Blanchette, J.C., Kaliszyk, C., Urban, J.: MaSh: machine learning for sledgehammer. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 35\u201350. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39634-2_6"},{"key":"27_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cpc.2014.08.008","volume":"189","author":"J Kuipers","year":"2015","unstructured":"Kuipers, J., Ueda, T., Vermaseren, J.: Code optimization in FORM. Comput. Phys. Commun. 189, 1\u201319 (2015). \nhttps:\/\/doi.org\/10.1016\/j.cpc.2014.08.008","journal-title":"Comput. Phys. Commun."},{"key":"27_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-66263-3_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"JH Liang","year":"2017","unstructured":"Liang, J.H., Hari Govind, V.K., Poupart, P., Czarnecki, K., Ganesh, V.: An empirical study of branching heuristics through the lens of global learning rate. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 119\u2013135. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66263-3_8"},{"key":"27_CR35","doi-asserted-by":"crossref","unstructured":"Mulligan, C., Bradford, R., Davenport, J., England, M., Tonks, Z.: Non-linear real arithmetic benchmarks derived from automated reasoning in economics. In: Bigatti, A., Brain, M. (eds.) Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC$$^2$$ 2018). No. 2189 in CEUR Workshop Proceedings, pp. 48\u201360 (2018). \nhttp:\/\/ceur-ws.org\/Vol-2189\/","DOI":"10.3386\/w24602"},{"key":"27_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-96418-8_44","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"CB Mulligan","year":"2018","unstructured":"Mulligan, C.B., Davenport, J.H., England, M.: TheoryGuru: a mathematica package to apply quantifier elimination technology to economics. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 369\u2013378. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-96418-8_44"},{"key":"27_CR37","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011). \nhttp:\/\/www.jmlr.org\/papers\/v12\/pedregosa11a.html","journal-title":"J. Mach. Learn. Res."},{"key":"27_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11870814_25","volume-title":"Computer Algebra in Scientific Computing","author":"T Sturm","year":"2006","unstructured":"Sturm, T.: New domains for applied quantifier elimination. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2006. LNCS, vol. 4194, pp. 295\u2013301. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11870814_25"},{"key":"27_CR39","unstructured":"Urban, J.: MaLARea: a metasystem for automated reasoning in large theories. In: Empirically Successful Automated Reasoning in Large Theories (ESARLT 2007), CEUR Workshop Proceedings, vol. 257, p. 14. CEUR-WS (2007). \nhttp:\/\/ceur-ws.org\/Vol-257\/"},{"key":"27_CR40","doi-asserted-by":"crossref","unstructured":"Wilson, D., Davenport, J., England, M., Bradford, R.: A \u201cpiano movers\u201d problem reformulated. In: 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013, pp. 53\u201360. IEEE (2013). \nhttp:\/\/dx.doi.org\/10.1109\/SYNASC.2013.14","DOI":"10.1109\/SYNASC.2013.14"},{"key":"27_CR41","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008). \nhttps:\/\/doi.org\/10.1613\/jair.2490","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:15:31Z","timestamp":1584490531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_27","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":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","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":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"66","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":"22","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":"33% - 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,1","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":"5,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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}