[{"status":"public","editor":[{"first_name":"C.","last_name":"Sammut","full_name":"Sammut, C."},{"full_name":"Webb, G.I.","last_name":"Webb","first_name":"G.I."}],"type":"book_chapter","publication":"Encyclopedia of Machine Learning and Data Mining","language":[{"iso":"eng"}],"user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"_id":"10784","citation":{"apa":"Fürnkranz, J., &#38; Hüllermeier, E. (2017). Preference Learning. In C. Sammut &#38; G. I. Webb (Eds.), <i>Encyclopedia of Machine Learning and Data Mining</i> (Vol. 107, pp. 1000–1005). Springer.","short":"J. Fürnkranz, E. Hüllermeier, in: C. Sammut, G.I. Webb (Eds.), Encyclopedia of Machine Learning and Data Mining, Springer, 2017, pp. 1000–1005.","bibtex":"@inbook{Fürnkranz_Hüllermeier_2017, title={Preference Learning}, volume={107}, booktitle={Encyclopedia of Machine Learning and Data Mining}, publisher={Springer}, author={Fürnkranz, J. and Hüllermeier, Eyke}, editor={Sammut, C. and Webb, G.I.Editors}, year={2017}, pages={1000–1005} }","mla":"Fürnkranz, J., and Eyke Hüllermeier. “Preference Learning.” <i>Encyclopedia of Machine Learning and Data Mining</i>, edited by C. Sammut and G.I. Webb, vol. 107, Springer, 2017, pp. 1000–05.","ama":"Fürnkranz J, Hüllermeier E. Preference Learning. In: Sammut C, Webb GI, eds. <i>Encyclopedia of Machine Learning and Data Mining</i>. Vol 107. Springer; 2017:1000-1005.","chicago":"Fürnkranz, J., and Eyke Hüllermeier. “Preference Learning.” In <i>Encyclopedia of Machine Learning and Data Mining</i>, edited by C. Sammut and G.I. Webb, 107:1000–1005. Springer, 2017.","ieee":"J. Fürnkranz and E. Hüllermeier, “Preference Learning,” in <i>Encyclopedia of Machine Learning and Data Mining</i>, vol. 107, C. Sammut and G. I. Webb, Eds. Springer, 2017, pp. 1000–1005."},"page":"1000-1005","intvolume":"       107","year":"2017","title":"Preference Learning","date_created":"2019-07-10T15:44:32Z","author":[{"last_name":"Fürnkranz","full_name":"Fürnkranz, J.","first_name":"J."},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"volume":107,"date_updated":"2022-01-06T06:50:50Z","publisher":"Springer"},{"title":"Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media","date_created":"2019-07-11T08:07:40Z","author":[{"id":"72744","full_name":"Trier, Matthias","last_name":"Trier","first_name":"Matthias"},{"full_name":"Fung, Magdalene","last_name":"Fung","first_name":"Magdalene"},{"first_name":"Abigail","last_name":"Hansen","full_name":"Hansen, Abigail"}],"date_updated":"2022-01-06T06:50:50Z","citation":{"short":"M. Trier, M. Fung, A. Hansen, in: 25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017, 2017, p. 104.","bibtex":"@inproceedings{Trier_Fung_Hansen_2017, title={Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media}, booktitle={25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017}, author={Trier, Matthias and Fung, Magdalene and Hansen, Abigail}, year={2017}, pages={104} }","mla":"Trier, Matthias, et al. “Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media.” <i>25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017</i>, 2017, p. 104.","apa":"Trier, M., Fung, M., &#38; Hansen, A. (2017). Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media. In <i>25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017</i> (p. 104).","ama":"Trier M, Fung M, Hansen A. Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media. In: <i>25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017</i>. ; 2017:104.","chicago":"Trier, Matthias, Magdalene Fung, and Abigail Hansen. “Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media.” In <i>25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017</i>, 104, 2017.","ieee":"M. Trier, M. Fung, and A. Hansen, “Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media,” in <i>25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017</i>, 2017, p. 104."},"page":"104","year":"2017","language":[{"iso":"eng"}],"user_id":"21671","department":[{"_id":"198"}],"_id":"10789","status":"public","type":"conference","publication":"25th European Conference on Information Systems, {ECIS} 2017, Guimar{\\~{a}}es, Portugal, June 5-10, 2017"},{"user_id":"42447","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1079","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","author":[{"full_name":"Hamacher, Dustin Stefan","last_name":"Hamacher","first_name":"Dustin Stefan"}],"supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"date_created":"2017-12-19T10:06:36Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","title":"Das Zusammenschlussvorhaben von Edeka und Kaiser's Tengelmann - eine ökonomische Analyse","citation":{"bibtex":"@book{Hamacher_2017, title={Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Hamacher, Dustin Stefan}, year={2017} }","mla":"Hamacher, Dustin Stefan. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017.","short":"D.S. Hamacher, Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse, Universität Paderborn, 2017.","apa":"Hamacher, D. S. (2017). <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn.","chicago":"Hamacher, Dustin Stefan. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017.","ieee":"D. S. Hamacher, <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017.","ama":"Hamacher DS. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn; 2017."},"year":"2017"},{"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1080","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"type":"mastersthesis","status":"public","date_created":"2017-12-19T10:07:35Z","author":[{"last_name":"Bürmann","full_name":"Bürmann, Jan","first_name":"Jan"}],"supervisor":[{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","title":"Complexity of Signalling in Routing Games under Uncertainty","citation":{"ieee":"J. Bürmann, <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","chicago":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","ama":"Bürmann J. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn; 2017.","apa":"Bürmann, J. (2017). <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn.","mla":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","bibtex":"@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }","short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017."},"year":"2017"},{"title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation","date_created":"2017-12-19T10:08:44Z","author":[{"first_name":"Vipin Ravindran","last_name":"Vijayalakshmi","full_name":"Vijayalakshmi, Vipin Ravindran"}],"supervisor":[{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:51Z","citation":{"bibtex":"@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi, Vipin Ravindran}, year={2017} }","mla":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","apa":"Vijayalakshmi, V. R. (2017). <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn.","ama":"Vijayalakshmi VR. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn; 2017.","chicago":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","ieee":"V. R. Vijayalakshmi, <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017."},"year":"2017","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1081","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","type":"mastersthesis"},{"department":[{"_id":"280"},{"_id":"205"},{"_id":"475"}],"user_id":"42447","series_title":"Working Papers CIE","_id":"1083","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"file_date_updated":"2018-08-15T07:33:12Z","type":"working_paper","status":"public","volume":110,"author":[{"id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer","first_name":"Britta"},{"first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun"}],"date_updated":"2022-01-06T06:50:51Z","oa":"1","main_file_link":[{"url":"http://groups.uni-paderborn.de/wp-wiwi/RePEc/pdf/ciepap/WP110.pdf","open_access":"1"}],"has_accepted_license":"1","intvolume":"       110","citation":{"apa":"Hoyer, B., &#38; Stroh-Maraun, N. (2017). <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i> (Vol. 110). CIE Working Paper Series, Paderborn University.","mla":"Hoyer, Britta, and Nadja Stroh-Maraun. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol. 110, CIE Working Paper Series, Paderborn University, 2017.","short":"B. Hoyer, N. Stroh-Maraun, Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse, CIE Working Paper Series, Paderborn University, 2017.","bibtex":"@book{Hoyer_Stroh-Maraun_2017, series={Working Papers CIE}, title={Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}, volume={110}, publisher={CIE Working Paper Series, Paderborn University}, author={Hoyer, Britta and Stroh-Maraun, Nadja}, year={2017}, collection={Working Papers CIE} }","ieee":"B. Hoyer and N. Stroh-Maraun, <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>, vol. 110. CIE Working Paper Series, Paderborn University, 2017.","chicago":"Hoyer, Britta, and Nadja Stroh-Maraun. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol. 110. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2017.","ama":"Hoyer B, Stroh-Maraun N. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol 110. CIE Working Paper Series, Paderborn University; 2017."},"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"nmaraun","date_created":"2018-08-15T07:33:12Z","date_updated":"2018-08-15T07:33:12Z","file_id":"3911","file_name":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.pdf","access_level":"closed","file_size":346752}],"abstract":[{"lang":"eng","text":"In actual school choice applications the theoretical underpinnings of the Boston School Choice Mechanism (BM) (complete information and rationality of the agents) are often not given. We analyze the actual behavior of agents in such a matching mechanism, using data from the matching mechanism currently used in a clearinghouse at a faculty of Business Administration and Economics at a German university, where a variant of the BM is used, and supplement this data with data generated in a survey among students who participated in the clearinghouse. We find that under the current mechanism over 70% of students act strategically. Controlling for students' limited information, we find that they do act rationally in their decision to act strategically. While students thus seem to react to the incentives to act strategically under the BM, they do not seem to be able to use this to their own advantage. However, those students acting in line with their beliefs manage a significantly better personal outcome than those who do not. We also run simulations by using a variant of the deferred acceptance algorithm, adapted to our situation, to show that the use of a different algorithm may be to the students' advantage."}],"date_created":"2017-12-20T16:21:51Z","publisher":"CIE Working Paper Series, Paderborn University","title":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse","year":"2017"},{"title":"Cooperative static analysis of Android applications","date_updated":"2022-01-06T06:50:52Z","oa":"1","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:12Z","supervisor":[{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"author":[{"last_name":"Pauck","id":"22398","full_name":"Pauck, Felix","first_name":"Felix"}],"year":"2017","citation":{"apa":"Pauck, F. (2017). <i>Cooperative static analysis of Android applications</i>. Universität Paderborn.","short":"F. Pauck, Cooperative Static Analysis of Android Applications, Universität Paderborn, 2017.","bibtex":"@book{Pauck_2017, title={Cooperative static analysis of Android applications}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }","mla":"Pauck, Felix. <i>Cooperative Static Analysis of Android Applications</i>. Universität Paderborn, 2017.","ieee":"F. Pauck, <i>Cooperative static analysis of Android applications</i>. Universität Paderborn, 2017.","chicago":"Pauck, Felix. <i>Cooperative Static Analysis of Android Applications</i>. Universität Paderborn, 2017.","ama":"Pauck F. <i>Cooperative Static Analysis of Android Applications</i>. Universität Paderborn; 2017."},"has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2019-08-07T09:03:48Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"109","user_id":"22398","department":[{"_id":"77"}],"file":[{"access_level":"open_access","file_id":"12905","file_name":"fpauck_2017.pdf","file_size":5093611,"title":"Master's Thesis","date_created":"2019-08-07T08:55:58Z","creator":"fpauck","date_updated":"2019-08-07T09:03:48Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"mastersthesis"},{"year":"2017","citation":{"ama":"Feldotto M, John T, Kundisch D, Hemsen P, Klingsieck K, Skopalik A. Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In: <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>. LNCS. ; 2017:462-467. doi:<a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">10.1007/978-3-319-59144-5_32</a>","ieee":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>, 2017, pp. 462–467.","chicago":"Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>, 462–67. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">https://doi.org/10.1007/978-3-319-59144-5_32</a>.","short":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik, in: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.","bibtex":"@inproceedings{Feldotto_John_Kundisch_Hemsen_Klingsieck_Skopalik_2017, series={LNCS}, title={Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">10.1007/978-3-319-59144-5_32</a>}, booktitle={Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}, author={Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander}, year={2017}, pages={462–467}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>, 2017, pp. 462–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">10.1007/978-3-319-59144-5_32</a>.","apa":"Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., &#38; Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i> (pp. 462–467). <a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">https://doi.org/10.1007/978-3-319-59144-5_32</a>"},"page":"462-467","has_accepted_license":"1","title":"Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App","doi":"10.1007/978-3-319-59144-5_32","date_updated":"2022-01-06T06:50:53Z","date_created":"2018-01-05T08:37:52Z","author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto"},{"id":"3952","full_name":"John, Thomas","last_name":"John","first_name":"Thomas"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"},{"last_name":"Hemsen","id":"22546","full_name":"Hemsen, Paul","first_name":"Paul"},{"last_name":"Klingsieck","full_name":"Klingsieck, Katrin","first_name":"Katrin"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"abstract":[{"text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a \"lean\" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification.","lang":"eng"}],"file":[{"access_level":"closed","file_name":"Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf","file_id":"5230","file_size":1576363,"date_created":"2018-10-31T17:01:09Z","creator":"feldi","date_updated":"2018-10-31T17:01:09Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)","ddc":["000"],"file_date_updated":"2018-10-31T17:01:09Z","language":[{"iso":"eng"}],"_id":"1094","series_title":"LNCS","user_id":"14052","department":[{"_id":"63"},{"_id":"541"},{"_id":"276"}]},{"department":[{"_id":"63"},{"_id":"541"},{"_id":"178"},{"_id":"185"}],"user_id":"14052","_id":"1095","language":[{"iso":"eng"}],"file_date_updated":"2018-10-31T17:02:07Z","ddc":["000"],"publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","type":"conference","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T17:02:07Z","creator":"feldi","date_created":"2018-10-31T17:02:07Z","file_size":485333,"access_level":"closed","file_id":"5232","file_name":"TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf"}],"abstract":[{"text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. ","lang":"eng"}],"date_created":"2018-01-05T08:39:41Z","author":[{"first_name":"Thomas","last_name":"John","full_name":"John, Thomas","id":"3952"},{"first_name":"Matthias","id":"14052","full_name":"Feldotto, Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"last_name":"Hemsen","id":"22546","full_name":"Hemsen, Paul","first_name":"Paul"},{"first_name":"Katrin","full_name":"Klingsieck, Katrin","last_name":"Klingsieck"},{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"},{"last_name":"Langendorf","full_name":"Langendorf, Mike","first_name":"Mike"}],"date_updated":"2022-01-06T06:50:53Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://aisel.aisnet.org/ecis2017_rip/46"}],"title":"Towards a Lean Approach for Gamifying Education","has_accepted_license":"1","page":"2970-2979","citation":{"apa":"John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., &#38; Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i> (pp. 2970–2979).","mla":"John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2017, pp. 2970–79.","short":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","bibtex":"@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017, title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }","chicago":"John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2970–79, 2017.","ieee":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2017, pp. 2970–2979.","ama":"John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>. ; 2017:2970-2979."},"year":"2017"},{"date_updated":"2022-01-06T06:50:55Z","author":[{"last_name":"Kim","full_name":"Kim, Yeong-Su","first_name":"Yeong-Su"},{"full_name":"Lee, Seung-Woo ","last_name":"Lee","first_name":"Seung-Woo "},{"first_name":"Markus","last_name":"Dollmann","id":"27578","full_name":"Dollmann, Markus"},{"first_name":"Michaela","last_name":"Geierhos","orcid":"0000-0002-8180-5606","id":"42496","full_name":"Geierhos, Michaela"}],"volume":4,"citation":{"ama":"Kim Y-S, Lee S-W, Dollmann M, Geierhos M. Semantic Annotation of Software Requirements with Language Frame. <i>International Journal of Software Engineering for Smart Device</i>. 2017;4(2):1-6.","ieee":"Y.-S. Kim, S.-W. Lee, M. Dollmann, and M. Geierhos, “Semantic Annotation of Software Requirements with Language Frame,” <i>International Journal of Software Engineering for Smart Device</i>, vol. 4, no. 2, pp. 1–6, 2017.","chicago":"Kim, Yeong-Su, Seung-Woo  Lee, Markus Dollmann, and Michaela Geierhos. “Semantic Annotation of Software Requirements with Language Frame.” <i>International Journal of Software Engineering for Smart Device</i> 4, no. 2 (2017): 1–6.","short":"Y.-S. Kim, S.-W. Lee, M. Dollmann, M. Geierhos, International Journal of Software Engineering for Smart Device 4 (2017) 1–6.","bibtex":"@article{Kim_Lee_Dollmann_Geierhos_2017, title={Semantic Annotation of Software Requirements with Language Frame}, volume={4}, number={2}, journal={International Journal of Software Engineering for Smart Device}, publisher={Global Vision School Publication}, author={Kim, Yeong-Su and Lee, Seung-Woo  and Dollmann, Markus and Geierhos, Michaela}, year={2017}, pages={1–6} }","mla":"Kim, Yeong-Su, et al. “Semantic Annotation of Software Requirements with Language Frame.” <i>International Journal of Software Engineering for Smart Device</i>, vol. 4, no. 2, Global Vision School Publication, 2017, pp. 1–6.","apa":"Kim, Y.-S., Lee, S.-W., Dollmann, M., &#38; Geierhos, M. (2017). Semantic Annotation of Software Requirements with Language Frame. <i>International Journal of Software Engineering for Smart Device</i>, <i>4</i>(2), 1–6."},"page":"1-6","intvolume":"         4","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2205-8494"]},"article_type":"original","file_date_updated":"2018-12-12T15:30:59Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"_id":"1098","user_id":"477","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"status":"public","type":"journal_article","title":"Semantic Annotation of Software Requirements with Language Frame","publisher":"Global Vision School Publication","date_created":"2018-01-25T15:23:15Z","year":"2017","quality_controlled":"1","issue":"2","ddc":["000"],"keyword":["Natural Language Processing","Semantic Annotation","Machine Learning"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"An end user generally writes down software requirements in ambiguous expressions using natural language; hence, a software developer attuned to programming language finds it difficult to understand th meaning of the requirements. To solve this problem we define semantic categories for disambiguation and classify/annotate the requirement into the categories by using machine-learning models. We extensively use a language frame closely related to such categories for designing features to overcome the problem of insufficient training data compare to the large number of classes. Our proposed model obtained a micro-average F1-score of 0.75, outperforming the previous model, REaCT."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-12-12T15:30:59Z","date_created":"2018-12-12T15:30:59Z","creator":"ups","file_size":244655,"access_level":"closed","file_id":"6196","file_name":"Semantic_Annotation_of_Software_Requirements.pdf"}],"publication":"International Journal of Software Engineering for Smart Device"},{"citation":{"apa":"Antoniadis, A., Kling, P., Ott, S., &#38; Riechers, S. (2017). Continuous Speed Scaling with Variability: A Simple and Direct Approach. <i>Theoretical Computer Science</i>, 1–13. <a href=\"https://doi.org/10.1016/j.tcs.2017.03.021\">https://doi.org/10.1016/j.tcs.2017.03.021</a>","short":"A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science (2017) 1–13.","bibtex":"@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling with Variability: A Simple and Direct Approach}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2017.03.021\">10.1016/j.tcs.2017.03.021</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017}, pages={1–13} }","mla":"Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” <i>Theoretical Computer Science</i>, Elsevier, 2017, pp. 1–13, doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.03.021\">10.1016/j.tcs.2017.03.021</a>.","chicago":"Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” <i>Theoretical Computer Science</i>, 2017, 1–13. <a href=\"https://doi.org/10.1016/j.tcs.2017.03.021\">https://doi.org/10.1016/j.tcs.2017.03.021</a>.","ieee":"A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A Simple and Direct Approach,” <i>Theoretical Computer Science</i>, pp. 1–13, 2017.","ama":"Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability: A Simple and Direct Approach. <i>Theoretical Computer Science</i>. 2017:1-13. doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.03.021\">10.1016/j.tcs.2017.03.021</a>"},"page":"1-13","has_accepted_license":"1","doi":"10.1016/j.tcs.2017.03.021","author":[{"first_name":"Antonios","last_name":"Antoniadis","full_name":"Antoniadis, Antonios"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"full_name":"Ott, Sebastian","last_name":"Ott","first_name":"Sebastian"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"date_updated":"2022-01-06T06:50:55Z","status":"public","type":"journal_article","file_date_updated":"2018-03-21T13:07:43Z","user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"110","year":"2017","title":"Continuous Speed Scaling with Variability: A Simple and Direct Approach","date_created":"2017-10-17T12:41:13Z","publisher":"Elsevier","file":[{"file_size":494600,"access_level":"closed","file_name":"110-TCSSubmission.pdf","file_id":"1567","date_updated":"2018-03-21T13:07:43Z","date_created":"2018-03-21T13:07:43Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al.: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. Theoretical algorithm design for speed scaling problems often tends to discretize problems, as our tools in the discrete realm are often better developed or understood. Using the above speed scaling variant with variable, continuous maximal processor speeds and energy prices as an example, we demonstrate that a more direct approach via tools from variational calculus can not only lead to a very concise and elegant formulation and analysis, but also avoids the “explosion of variables/constraints” that often comes with discretizing. Using well-known tools from calculus of variations, we derive combinatorial optimality characteristics for our continuous problem and provide a quite concise and simple correctness proof."}],"publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"ddc":["040"]},{"citation":{"ama":"Bemmann P. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn; 2017.","ieee":"P. Bemmann, <i>Attribute-based Signatures using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","chicago":"Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","apa":"Bemmann, P. (2017). <i>Attribute-based Signatures using Structure Preserving Signatures</i>. Universität Paderborn.","bibtex":"@book{Bemmann_2017, title={Attribute-based Signatures using Structure Preserving Signatures}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2017} }","short":"P. Bemmann, Attribute-Based Signatures Using Structure Preserving Signatures, Universität Paderborn, 2017.","mla":"Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn, 2017."},"year":"2017","title":"Attribute-based Signatures using Structure Preserving Signatures","author":[{"last_name":"Bemmann","id":"32571","full_name":"Bemmann, Pascal","first_name":"Pascal"}],"date_created":"2017-10-17T12:41:14Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_updated":"2022-01-06T06:51:06Z","publisher":"Universität Paderborn","status":"public","type":"mastersthesis","user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"117"},{"abstract":[{"lang":"eng","text":"In this work, we address the limited availability of large annotated databases for real-life audio event detection by utilizing the concept of transfer learning. This technique aims to transfer knowledge from a source domain to a target domain, even if source and target have different feature distributions and label sets. We hypothesize that all acoustic events share the same inventory of basic acoustic building blocks and differ only in the temporal order of these acoustic units. We then construct a deep neural network with convolutional layers for extracting the acoustic units and a recurrent layer for capturing the temporal order. Under the above hypothesis, transfer learning from a source to a target domain with a different acoustic event inventory is realized by transferring the convolutional layers from the source to the target domain. The recurrent layer is, however, learnt directly from the target domain. Experiments on the transfer from a synthetic source database to the reallife target database of DCASE 2016 demonstrate that transfer learning leads to improved detection performance on average. However, the successful transfer to detect events which are very different from what was seen in the source domain, could not be verified."}],"status":"public","type":"conference","publication":"IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)","language":[{"iso":"eng"}],"_id":"11717","user_id":"44006","department":[{"_id":"54"}],"year":"2017","citation":{"ama":"Arora P, Haeb-Umbach R. A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario. In: <i>IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)</i>. ; 2017.","ieee":"P. Arora and R. Haeb-Umbach, “A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario,” in <i>IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)</i>, 2017.","chicago":"Arora, Prerna, and Reinhold Haeb-Umbach. “A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario.” In <i>IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)</i>, 2017.","bibtex":"@inproceedings{Arora_Haeb-Umbach_2017, title={A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario}, booktitle={IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)}, author={Arora, Prerna and Haeb-Umbach, Reinhold}, year={2017} }","mla":"Arora, Prerna, and Reinhold Haeb-Umbach. “A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario.” <i>IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)</i>, 2017.","short":"P. Arora, R. Haeb-Umbach, in: IEEE 19th International Workshop on Multimedia Signal Processing (MMSP), 2017.","apa":"Arora, P., &#38; Haeb-Umbach, R. (2017). A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario. In <i>IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)</i>."},"related_material":{"link":[{"relation":"supplementary_material","description":"Poster","url":"https://groups.uni-paderborn.de/nt/pubs/2017/MMSP_2017_AroraHaeb_poster.pdf"}]},"title":"A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario","main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2017/MMSP_2017_AroraHaeb.pdf","open_access":"1"}],"date_updated":"2022-01-06T06:51:07Z","oa":"1","author":[{"first_name":"Prerna","last_name":"Arora","full_name":"Arora, Prerna"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242","full_name":"Haeb-Umbach, Reinhold"}],"date_created":"2019-07-12T05:26:54Z"},{"oa":"1","date_updated":"2022-01-06T06:51:08Z","date_created":"2019-07-12T05:27:15Z","author":[{"first_name":"Christoph","id":"40767","full_name":"Boeddeker, Christoph","last_name":"Boeddeker"},{"first_name":"Patrick","full_name":"Hanebrink, Patrick","last_name":"Hanebrink"},{"last_name":"Drude","id":"11213","full_name":"Drude, Lukas","first_name":"Lukas"},{"first_name":"Jahn","full_name":"Heymann, Jahn","id":"9168","last_name":"Heymann"},{"last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242","first_name":"Reinhold"}],"title":"On the Computation of Complex-valued Gradients with Application to Statistically Optimum Beamforming","main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2017/ArXiv_2017_BoeddekerHanebrinkHaeb_Article.pdf","open_access":"1"}],"year":"2017","citation":{"apa":"Boeddeker, C., Hanebrink, P., Drude, L., Heymann, J., &#38; Haeb-Umbach, R. (2017). <i>On the Computation of Complex-valued Gradients with Application to Statistically Optimum Beamforming</i>.","short":"C. Boeddeker, P. Hanebrink, L. Drude, J. Heymann, R. Haeb-Umbach, On the Computation of Complex-Valued Gradients with Application to Statistically Optimum Beamforming, 2017.","mla":"Boeddeker, Christoph, et al. <i>On the Computation of Complex-Valued Gradients with Application to Statistically Optimum Beamforming</i>. 2017.","bibtex":"@book{Boeddeker_Hanebrink_Drude_Heymann_Haeb-Umbach_2017, title={On the Computation of Complex-valued Gradients with Application to Statistically Optimum Beamforming}, author={Boeddeker, Christoph and Hanebrink, Patrick and Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}, year={2017} }","ieee":"C. Boeddeker, P. Hanebrink, L. Drude, J. Heymann, and R. Haeb-Umbach, <i>On the Computation of Complex-valued Gradients with Application to Statistically Optimum Beamforming</i>. 2017.","chicago":"Boeddeker, Christoph, Patrick Hanebrink, Lukas Drude, Jahn Heymann, and Reinhold Haeb-Umbach. <i>On the Computation of Complex-Valued Gradients with Application to Statistically Optimum Beamforming</i>, 2017.","ama":"Boeddeker C, Hanebrink P, Drude L, Heymann J, Haeb-Umbach R. <i>On the Computation of Complex-Valued Gradients with Application to Statistically Optimum Beamforming</i>.; 2017."},"_id":"11735","department":[{"_id":"54"}],"user_id":"40767","language":[{"iso":"eng"}],"type":"report","abstract":[{"lang":"eng","text":"This report describes the computation of gradients by algorithmic differentiation for statistically optimum beamforming operations. Especially the derivation of complex-valued functions is a key component of this approach. Therefore the real-valued algorithmic differentiation is extended via the complex-valued chain rule. In addition to the basic mathematic operations the derivative of the eigenvalue problem with complex-valued eigenvectors is one of the key results of this report. The potential of this approach is shown with experimental results on the CHiME-3 challenge database. There, the beamforming task is used as a front-end for an ASR system. With the developed derivatives a joint optimization of a speech enhancement and speech recognition system w.r.t. the recognition optimization criterion is possible."}],"status":"public"},{"citation":{"short":"C. Boeddeker, P. Hanebrink, L. Drude, J. Heymann, R. Haeb-Umbach, in: Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP), 2017.","bibtex":"@inproceedings{Boeddeker_Hanebrink_Drude_Heymann_Haeb-Umbach_2017, title={Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation}, booktitle={Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)}, author={Boeddeker, Christoph and Hanebrink, Patrick and Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}, year={2017} }","mla":"Boeddeker, Christoph, et al. “Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation.” <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2017.","apa":"Boeddeker, C., Hanebrink, P., Drude, L., Heymann, J., &#38; Haeb-Umbach, R. (2017). Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation. In <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>.","chicago":"Boeddeker, Christoph, Patrick Hanebrink, Lukas Drude, Jahn Heymann, and Reinhold Haeb-Umbach. “Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation.” In <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2017.","ieee":"C. Boeddeker, P. Hanebrink, L. Drude, J. Heymann, and R. Haeb-Umbach, “Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation,” in <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2017.","ama":"Boeddeker C, Hanebrink P, Drude L, Heymann J, Haeb-Umbach R. Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation. In: <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>. ; 2017."},"year":"2017","date_created":"2019-07-12T05:27:16Z","author":[{"id":"40767","full_name":"Boeddeker, Christoph","last_name":"Boeddeker","first_name":"Christoph"},{"first_name":"Patrick","full_name":"Hanebrink, Patrick","last_name":"Hanebrink"},{"first_name":"Lukas","id":"11213","full_name":"Drude, Lukas","last_name":"Drude"},{"last_name":"Heymann","id":"9168","full_name":"Heymann, Jahn","first_name":"Jahn"},{"first_name":"Reinhold","id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach"}],"oa":"1","date_updated":"2022-01-06T06:51:08Z","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2017/icassp_2017_boeddeker_paper.pdf"}],"title":"Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation","publication":"Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)","type":"conference","status":"public","abstract":[{"text":"In this paper we show how a neural network for spectral mask estimation for an acoustic beamformer can be optimized by algorithmic differentiation. Using the beamformer output SNR as the objective function to maximize, the gradient is propagated through the beamformer all the way to the neural network which provides the clean speech and noise masks from which the beamformer coefficients are estimated by eigenvalue decomposition. A key theoretical result is the derivative of an eigenvalue problem involving complex-valued eigenvectors. Experimental results on the CHiME-3 challenge database demonstrate the effectiveness of the approach. The tools developed in this paper are a key component for an end-to-end optimization of speech enhancement and speech recognition.","lang":"eng"}],"department":[{"_id":"54"}],"user_id":"44006","_id":"11736","language":[{"iso":"eng"}]},{"citation":{"apa":"Chinaev, A., &#38; Haeb-Umbach, R. (2017). A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement. In <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>.","bibtex":"@inproceedings{Chinaev_Haeb-Umbach_2017, title={A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement}, booktitle={Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)}, author={Chinaev, Alleksej and Haeb-Umbach, Reinhold}, year={2017} }","mla":"Chinaev, Alleksej, and Reinhold Haeb-Umbach. “A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement.” <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2017.","short":"A. Chinaev, R. Haeb-Umbach, in: Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP), 2017.","ieee":"A. Chinaev and R. Haeb-Umbach, “A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement,” in <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2017.","chicago":"Chinaev, Alleksej, and Reinhold Haeb-Umbach. “A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement.” In <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2017.","ama":"Chinaev A, Haeb-Umbach R. A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement. In: <i>Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</i>. ; 2017."},"year":"2017","related_material":{"link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2017/ChinHaeb17_Slides.pdf","description":"Slides","relation":"supplementary_material"}]},"main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2017/ChinHaeb17.pdf","open_access":"1"}],"title":"A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement","date_created":"2019-07-12T05:27:17Z","author":[{"first_name":"Alleksej","full_name":"Chinaev, Alleksej","last_name":"Chinaev"},{"full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_updated":"2022-01-06T06:51:08Z","oa":"1","status":"public","abstract":[{"text":"The benefits of both a logarithmic spectral amplitude (LSA) estimation and a modeling in a generalized spectral domain (where short-time amplitudes are raised to a generalized power exponent, not restricted to magnitude or power spectrum) are combined in this contribution to achieve a better tradeoff between speech quality and noise suppression in single-channel speech enhancement. A novel gain function is derived to enhance the logarithmic generalized spectral amplitudes of noisy speech. Experiments on the CHiME-3 dataset show that it outperforms the famous minimum mean squared error (MMSE) LSA gain function of Ephraim and Malah in terms of noise suppression by 1.4 dB, while the good speech quality of the MMSE-LSA estimator is maintained.","lang":"eng"}],"type":"conference","publication":"Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)","language":[{"iso":"eng"}],"user_id":"44006","department":[{"_id":"54"}],"_id":"11737"},{"language":[{"iso":"eng"}],"user_id":"44006","department":[{"_id":"54"}],"_id":"11754","status":"public","abstract":[{"text":"Recent advances in discriminatively trained mask estimation networks to extract a single source utilizing beamforming techniques demonstrate, that the integration of statistical models and deep neural networks (DNNs) are a promising approach for robust automatic speech recognition (ASR) applications. In this contribution we demonstrate how discriminatively trained embeddings on spectral features can be tightly integrated into statistical model-based source separation to separate and transcribe overlapping speech. Good generalization to unseen spatial configurations is achieved by estimating a statistical model at test time, while still leveraging discriminative training of deep clustering embeddings on a separate training set. We formulate an expectation maximization (EM) algorithm which jointly estimates a model for deep clustering embeddings and complex-valued spatial observations in the short time Fourier transform (STFT) domain at test time. Extensive simulations confirm, that the integrated model outperforms (a) a deep clustering model with a subsequent beamforming step and (b) an EM-based model with a beamforming step alone in terms of signal to distortion ratio (SDR) and perceptually motivated metric (PESQ) gains. ASR results on a reverberated dataset further show, that the aforementioned gains translate to reduced word error rates (WERs) even in reverberant environments.","lang":"eng"}],"type":"conference","publication":"INTERSPEECH 2017, Stockholm, Schweden","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2017/INTERSPEECH_2017_Drude_paper.pdf"}],"title":"Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings","date_created":"2019-07-12T05:27:37Z","author":[{"last_name":"Drude","id":"11213","full_name":"Drude, Lukas","first_name":"Lukas"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242","full_name":"Haeb-Umbach, Reinhold"}],"date_updated":"2022-01-06T06:51:08Z","oa":"1","citation":{"bibtex":"@inproceedings{Drude_Haeb-Umbach_2017, title={Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings}, booktitle={INTERSPEECH 2017, Stockholm, Schweden}, author={Drude, Lukas and Haeb-Umbach, Reinhold}, year={2017} }","mla":"Drude, Lukas, and Reinhold Haeb-Umbach. “Tight Integration of Spatial and Spectral Features for BSS with Deep Clustering Embeddings.” <i>INTERSPEECH 2017, Stockholm, Schweden</i>, 2017.","short":"L. Drude, R. Haeb-Umbach, in: INTERSPEECH 2017, Stockholm, Schweden, 2017.","apa":"Drude, L., &#38; Haeb-Umbach, R. (2017). Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings. In <i>INTERSPEECH 2017, Stockholm, Schweden</i>.","ama":"Drude L, Haeb-Umbach R. Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings. In: <i>INTERSPEECH 2017, Stockholm, Schweden</i>. ; 2017.","chicago":"Drude, Lukas, and Reinhold Haeb-Umbach. “Tight Integration of Spatial and Spectral Features for BSS with Deep Clustering Embeddings.” In <i>INTERSPEECH 2017, Stockholm, Schweden</i>, 2017.","ieee":"L. Drude and R. Haeb-Umbach, “Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings,” in <i>INTERSPEECH 2017, Stockholm, Schweden</i>, 2017."},"year":"2017","related_material":{"link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2017/INTERSPEECH_2017_Drude_slides.pdf","description":"Slides","relation":"supplementary_material"}]}},{"language":[{"iso":"eng"}],"user_id":"44006","department":[{"_id":"54"}],"_id":"11770","status":"public","abstract":[{"lang":"eng","text":"In this contribution we show how to exploit text data to support word discovery from audio input in an underresourced target language. Given audio, of which a certain amount is transcribed at the word level, and additional unrelated text data, the approach is able to learn a probabilistic mapping from acoustic units to characters and utilize it to segment the audio data into words without the need of a pronunciation dictionary. This is achieved by three components: an unsupervised acoustic unit discovery system, a supervisedly trained acoustic unit-to-grapheme converter, and a word discovery system, which is initialized with a language model trained on the text data. Experiments for multiple setups show that the initialization of the language model with text data improves the word segementation performance by a large margin."}],"type":"conference","publication":"INTERSPEECH 2017, Stockholm, Schweden","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2017/INTERSPEECH_2017_Glarner_paper.pdf"}],"title":"Leveraging Text Data for Word Segmentation for Underresourced Languages","author":[{"last_name":"Glarner","full_name":"Glarner, Thomas","id":"14169","first_name":"Thomas"},{"last_name":"Boenninghoff","full_name":"Boenninghoff, Benedikt","first_name":"Benedikt"},{"full_name":"Walter, Oliver","last_name":"Walter","first_name":"Oliver"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"}],"date_created":"2019-07-12T05:27:55Z","date_updated":"2022-01-06T06:51:08Z","oa":"1","citation":{"apa":"Glarner, T., Boenninghoff, B., Walter, O., &#38; Haeb-Umbach, R. (2017). Leveraging Text Data for Word Segmentation for Underresourced Languages. In <i>INTERSPEECH 2017, Stockholm, Schweden</i>.","short":"T. Glarner, B. Boenninghoff, O. Walter, R. Haeb-Umbach, in: INTERSPEECH 2017, Stockholm, Schweden, 2017.","bibtex":"@inproceedings{Glarner_Boenninghoff_Walter_Haeb-Umbach_2017, title={Leveraging Text Data for Word Segmentation for Underresourced Languages}, booktitle={INTERSPEECH 2017, Stockholm, Schweden}, author={Glarner, Thomas and Boenninghoff, Benedikt and Walter, Oliver and Haeb-Umbach, Reinhold}, year={2017} }","mla":"Glarner, Thomas, et al. “Leveraging Text Data for Word Segmentation for Underresourced Languages.” <i>INTERSPEECH 2017, Stockholm, Schweden</i>, 2017.","ama":"Glarner T, Boenninghoff B, Walter O, Haeb-Umbach R. Leveraging Text Data for Word Segmentation for Underresourced Languages. In: <i>INTERSPEECH 2017, Stockholm, Schweden</i>. ; 2017.","chicago":"Glarner, Thomas, Benedikt Boenninghoff, Oliver Walter, and Reinhold Haeb-Umbach. “Leveraging Text Data for Word Segmentation for Underresourced Languages.” In <i>INTERSPEECH 2017, Stockholm, Schweden</i>, 2017.","ieee":"T. Glarner, B. Boenninghoff, O. Walter, and R. Haeb-Umbach, “Leveraging Text Data for Word Segmentation for Underresourced Languages,” in <i>INTERSPEECH 2017, Stockholm, Schweden</i>, 2017."},"year":"2017","related_material":{"link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2017/INTERSPEECH_2017_Glarner_poster.pdf","description":"Poster","relation":"supplementary_material"}]}},{"type":"bachelorsthesis","status":"public","_id":"118","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"477","year":"2017","citation":{"ieee":"N. Chi Banh, <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","chicago":"Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","ama":"Chi Banh N. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017.","mla":"Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","bibtex":"@book{Chi Banh_2017, title={An Asynchronous Adaptation of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Chi Banh, Ngoc}, year={2017} }","short":"N. Chi Banh, An Asynchronous Adaptation of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","apa":"Chi Banh, N. (2017). <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>. Universität Paderborn."},"date_updated":"2022-01-06T06:51:08Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:14Z","author":[{"first_name":"Ngoc","full_name":"Chi Banh, Ngoc","last_name":"Chi Banh"}],"title":"An Asynchronous Adaptation of a Churn-resistant Overlay Network"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"file_size":323589,"access_level":"closed","file_id":"5387","file_name":"CI Workshop AutoML.pdf","date_updated":"2018-11-06T15:28:09Z","creator":"wever","date_created":"2018-11-06T15:28:09Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"These days, there is a strong rise in the needs for machine learning applications, requiring an automation of machine learning engineering which is referred to as AutoML. In AutoML the selection, composition and parametrization of machine learning algorithms is automated and tailored to a specific problem, resulting in a machine learning pipeline. Current approaches reduce the AutoML problem to optimization of hyperparameters. Based on recursive task networks, in this paper we present one approach from the field of automated planning and one evolutionary optimization approach. Instead of simply parametrizing a given pipeline, this allows for structure optimization of machine learning pipelines, as well. We evaluate the two approaches in an extensive evaluation, finding both approaches to have their strengths in different areas. Moreover, the two approaches outperform the state-of-the-art tool Auto-WEKA in many settings.","lang":"eng"}],"publication":"27th Workshop Computational Intelligence","title":"Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization","date_created":"2018-02-22T07:19:18Z","year":"2017","file_date_updated":"2018-11-06T15:28:09Z","user_id":"49109","department":[{"_id":"355"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"_id":"1180","status":"public","type":"conference","main_file_link":[{"url":"https://publikationen.bibliothek.kit.edu/1000074341/4643874","open_access":"1"}],"conference":{"location":"Dortmund","end_date":"2017-11-24","start_date":"2017-11-23","name":"27th Workshop Computational Intelligence"},"author":[{"first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}],"oa":"1","date_updated":"2022-01-06T06:51:09Z","citation":{"chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization.” In <i>27th Workshop Computational Intelligence</i>. Dortmund, 2017.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization,” in <i>27th Workshop Computational Intelligence</i>, Dortmund, 2017.","ama":"Wever MD, Mohr F, Hüllermeier E. Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization. In: <i>27th Workshop Computational Intelligence</i>. Dortmund; 2017.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2017). Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization. In <i>27th Workshop Computational Intelligence</i>. Dortmund.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: 27th Workshop Computational Intelligence, Dortmund, 2017.","mla":"Wever, Marcel Dominik, et al. “Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization.” <i>27th Workshop Computational Intelligence</i>, 2017.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2017, place={Dortmund}, title={Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization}, booktitle={27th Workshop Computational Intelligence}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2017} }"},"place":"Dortmund","publication_status":"published","has_accepted_license":"1"}]