{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:14:20Z","timestamp":1742926460557,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031328824"},{"type":"electronic","value":"9783031328831"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32883-1_46","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T23:03:16Z","timestamp":1684710196000},"page":"518-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On an\u00a0Integrated Assessment for\u00a0the\u00a0Students Within an\u00a0Academic Consortium"],"prefix":"10.1007","author":[{"given":"Popescu","family":"Doru-Anastasiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristea","family":"Daniela-Maria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bold","family":"Nicolae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.3389\/fpsyg.2017.01739","volume":"8","author":"J Beckmann","year":"2017","unstructured":"Beckmann, J., Birney, D., Goode, N.: Beyond psychometrics: the difference between difficult problem solving and complex problem solving. Front. Psychol. 8, 1739 (2017). https:\/\/doi.org\/10.3389\/fpsyg.2017.01739","journal-title":"Front. Psychol."},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1351324921000139","volume":"28","author":"M Bl\u0161t\u00e1k","year":"2021","unstructured":"Bl\u0161t\u00e1k, M., Rozinajova, V.: Automatic question generation based on sentence structure analysis using machine learning approach. Nat. Lang. Eng. 28, 1\u201331 (2021). https:\/\/doi.org\/10.1017\/S1351324921000139","journal-title":"Nat. Lang. Eng."},{"key":"46_CR3","unstructured":"Bold, N.: Item Dataset (2023). https:\/\/github.com\/nicolaebold\/cim_get"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.5465\/AMR.1988.4306775","volume":"13","author":"D Campbell","year":"1988","unstructured":"Campbell, D.: Task complexity: a review and analysis. Acad. Manage. Rev. 13, 40\u201352 (1988). https:\/\/doi.org\/10.5465\/AMR.1988.4306775","journal-title":"Acad. Manage. Rev."},{"issue":"1","key":"46_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s41039-021-00151-1","volume":"16","author":"B Das","year":"2021","unstructured":"Das, B., Majumder, M., Phadikar, S., Sekh, A.A.: Automatic question generation and answer assessment: a survey. Res. Pract. Technol. Enhanced Learn. 16(1), 1\u201315 (2021). https:\/\/doi.org\/10.1186\/s41039-021-00151-1","journal-title":"Res. Pract. Technol. Enhanced Learn."},{"key":"46_CR6","unstructured":"Davis, L.: Job shop scheduling with genetic algorithms. In: Proceedings of the first International Conference on Genetic Algorithms and their Applications, pp. 136\u2013140. Psychology Press (2014)"},{"key":"46_CR7","doi-asserted-by":"publisher","unstructured":"Gkatzia, D., Mahamood, S.: A snapshot of NLG evaluation practices 2005\u20132014 (2015). https:\/\/doi.org\/10.18653\/v1\/W15-4708","DOI":"10.18653\/v1\/W15-4708"},{"key":"46_CR8","doi-asserted-by":"publisher","unstructured":"Kloft, M., Stiehler, F., Zheng, Z., Pinkwart, N.: Predicting MOOC dropout over weeks using machine learning methods. In: Proceedings of the EMNLP 2014 Workshop on Analysis of Large Scale Social Interaction in MOOCs, pp. 60\u201365. Association for Computational Linguistics, Doha, Qatar (2014). https:\/\/doi.org\/10.3115\/v1\/W14-4111. https:\/\/aclanthology.org\/W14-4111","DOI":"10.3115\/v1\/W14-4111"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2018.08.011","volume":"76","author":"CKH Lee","year":"2018","unstructured":"Lee, C.K.H.: A review of applications of genetic algorithms in operations management. Eng. Appl. Artif. Intell. 76, 1\u201312 (2018)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/rrq.019","volume":"47","author":"H Mesmer","year":"2012","unstructured":"Mesmer, H., Cunningham, J., Hiebert, E.: Toward a theoretical model of text complexity for the early grades: learning from the past, anticipating the future. Reading Res. Q. 47, 235\u2013258 (2012). https:\/\/doi.org\/10.1002\/rrq.019","journal-title":"Reading Res. Q."},{"key":"46_CR11","doi-asserted-by":"publisher","unstructured":"Mitkov, R., Ha, L., Varga, A., Rello, L.: Semantic similarity of distractors in multiple-choice tests, pp. 49\u201356 (2009). https:\/\/doi.org\/10.3115\/1705415.1705422","DOI":"10.3115\/1705415.1705422"},{"key":"46_CR12","doi-asserted-by":"publisher","unstructured":"Mostow, J., Chen, W.: Generating instruction automatically for the reading strategy of self-questioning, vol. 200, pp. 465\u2013472 (2009). https:\/\/doi.org\/10.3233\/978-1-60750-028-5-465","DOI":"10.3233\/978-1-60750-028-5-465"},{"key":"46_CR13","doi-asserted-by":"publisher","unstructured":"Nguyen, H.A., Bhat, S., Moore, S., Bier, N., Stamper, J.: Towards generalized methods for automatic question generation in educational domains. In: Hilliger, I., Munoz-Merino, P.J., De Laet, T., Ortega-Arranz, A., Farrell, T. (eds) Educating for a New Future: Making Sense of Technology-Enhanced Learning Adoption. EC-TEL 2022. Lecture Notes in Computer Science, vol. 13450, pp. 272\u2013284. Springer, Berlin (2022). https:\/\/doi.org\/10.1007\/978-3-031-16290-920","DOI":"10.1007\/978-3-031-16290-920"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Popescu, A.D., Bold, N., Nijloveanu, D.: A method based on genetic algorithms for generating assessment tests used for learning. Polibits 54, 53\u201360 (2016). https:\/\/doi.org\/10.17562\/PB-54-7","DOI":"10.17562\/PB-54-7"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Popescu, D.A., Bold, N.: The development of a web application for assessment by tests generated using genetic-based algorithms. CEUR Workshop Proceedings (2016)","DOI":"10.1109\/ICCA.2016.7505360"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Quir\u00f3s, P., Lasheras, F.S.: Methodology for the projection of population pyramids based on monte Carlo simulation and genetic algorithms. Appl. Intell. 1\u201318 (2023)","DOI":"10.1007\/s10489-023-04492-w"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/applin\/22.1.27","volume":"22","author":"P Robinson","year":"2001","unstructured":"Robinson, P.: Task complexity, task difficulty, and task production: exploring interactions in a componential framework. Appl. Linguist. 22, 27\u201357 (2001). https:\/\/doi.org\/10.1093\/applin\/22.1.27","journal-title":"Appl. Linguist."},{"issue":"13","key":"46_CR18","doi-asserted-by":"publisher","first-page":"5832","DOI":"10.1016\/j.eswa.2014.03.035","volume":"41","author":"A Sancho-Asensio","year":"2014","unstructured":"Sancho-Asensio, A., et al.: Improving data partition schemes in smart grids via clustering data streams. Expert Syst. Appl. 41(13), 5832\u20135842 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2014.03.035","journal-title":"Expert Syst. Appl."},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Sharma, S., Kumar, V.: Application of genetic algorithms in healthcare: a review. Next Gener. Healthc. Inf., 75\u201386 (2022)","DOI":"10.1007\/978-981-19-2416-3_5"}],"container-title":["Lecture Notes in Computer Science","Augmented Intelligence and Intelligent Tutoring Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32883-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T23:11:30Z","timestamp":1684710690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32883-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031328824","9783031328831"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32883-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ITS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Tutoring Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Corfu","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"its2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iis-international.org\/its2023\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"84","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":"41","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":"19","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":"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)"}}]}}