[{"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Three prominent low order implicit time integration schemes are the first order implicit Euler-method, the second order trapezoidal rule and the second order Ellsiepen method. Its advantages are stability and comparatively low computational cost, however, they require the solution of a nonlinear system of equations. This paper presents a general approach for the construction of third order Runge–Kutta methods by embedding the above mentioned implicit schemes into the class of ELDIRK-methods. These will be defined to have an <jats:italic>Explicit Last</jats:italic> stage in the general Butcher array of <jats:italic>Diagonal Implicit Runge–Kutta</jats:italic> (DIRK) methods, with the consequence, that no additional system of equations must be solved. The main results—valid also for non-linear ordinary differential equations—are as follows: Two extra function calculations are required in order to embed the implicit Euler-method and one extra function calculation is required for the trapezoidal-rule and the Ellsiepen method, in order to obtain the third order properties, respectively. Two numerical examples are concerned with a parachute with viscous damping and a two-dimensional laser beam simulation. Here, we verify the higher order convergence behaviours of the proposed new ELDIRK-methods, and its successful performances for asymptotically exact global error estimation of so-called reversed embedded RK-method are shown.\r\n</jats:p>"}],"doi":"10.1007/s00466-023-02347-2","title":"Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation","author":[{"id":"335","last_name":"Mahnken","full_name":"Mahnken, Rolf","first_name":"Rolf"}],"department":[{"_id":"9"},{"_id":"154"},{"_id":"321"}],"citation":{"ieee":"R. Mahnken, “Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation,” <i>Computational Mechanics</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>.","chicago":"Mahnken, Rolf. “Derivation of Third Order Runge–Kutta Methods (ELDIRK) by Embedding of Lower Order Implicit Time Integration Schemes for Local and Global Error Estimation.” <i>Computational Mechanics</i>, 2023. <a href=\"https://doi.org/10.1007/s00466-023-02347-2\">https://doi.org/10.1007/s00466-023-02347-2</a>.","short":"R. Mahnken, Computational Mechanics (2023).","bibtex":"@article{Mahnken_2023, title={Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation}, DOI={<a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Mahnken, Rolf}, year={2023} }","ama":"Mahnken R. Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation. <i>Computational Mechanics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>","apa":"Mahnken, R. (2023). Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation. <i>Computational Mechanics</i>. <a href=\"https://doi.org/10.1007/s00466-023-02347-2\">https://doi.org/10.1007/s00466-023-02347-2</a>","mla":"Mahnken, Rolf. “Derivation of Third Order Runge–Kutta Methods (ELDIRK) by Embedding of Lower Order Implicit Time Integration Schemes for Local and Global Error Estimation.” <i>Computational Mechanics</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>."},"publication_status":"published","keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"user_id":"335","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0178-7675","1432-0924"]},"year":"2023","type":"journal_article","status":"public","date_created":"2023-06-23T06:47:36Z","publication":"Computational Mechanics","quality_controlled":"1","publisher":"Springer Science and Business Media LLC","date_updated":"2023-06-23T06:48:42Z","_id":"45757"},{"title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem","author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"orcid":"0000-0003-2014-4696","first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"doi":"10.1016/j.ic.2022.104877","citation":{"chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” <i>Information and Computation</i>, Art. no. 104877, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>, Article 104877. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 104877, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","bibtex":"@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }"},"publication_status":"published","keyword":["Computational Theory and Mathematics","Computer Science Applications","Information Systems","Theoretical Computer Science"],"user_id":"38705","department":[{"_id":"63"}],"date_created":"2022-02-15T07:38:28Z","publication":"Information and Computation","publisher":"Elsevier BV","language":[{"iso":"eng"}],"year":"2022","publication_identifier":{"issn":["0890-5401"]},"type":"journal_article","status":"public","_id":"29843","article_number":"104877","date_updated":"2022-02-15T07:41:00Z"},{"author":[{"last_name":"Bopp","full_name":"Bopp, Frederik","first_name":"Frederik"},{"first_name":"Jonathan","full_name":"Rojas, Jonathan","last_name":"Rojas"},{"first_name":"Natalia","full_name":"Revenga, Natalia","last_name":"Revenga"},{"first_name":"Hubert","full_name":"Riedl, Hubert","last_name":"Riedl"},{"first_name":"Friedrich","full_name":"Sbresny, Friedrich","last_name":"Sbresny"},{"first_name":"Katarina","full_name":"Boos, Katarina","last_name":"Boos"},{"last_name":"Simmet","full_name":"Simmet, Tobias","first_name":"Tobias"},{"last_name":"Ahmadi","first_name":"Arash","full_name":"Ahmadi, Arash"},{"full_name":"Gershoni, David","first_name":"David","last_name":"Gershoni"},{"last_name":"Kasprzak","first_name":"Jacek","full_name":"Kasprzak, Jacek"},{"last_name":"Ludwig","first_name":"Arne","full_name":"Ludwig, Arne"},{"full_name":"Reitzenstein, Stephan","first_name":"Stephan","last_name":"Reitzenstein"},{"first_name":"Andreas","full_name":"Wieck, Andreas","last_name":"Wieck"},{"first_name":"Dirk","full_name":"Reuter, Dirk","id":"37763","last_name":"Reuter"},{"full_name":"Müller, Kai","first_name":"Kai","last_name":"Müller"},{"full_name":"Finley, Jonathan J.","first_name":"Jonathan J.","last_name":"Finley"}],"title":"Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling","doi":"10.1002/qute.202200049","user_id":"42514","keyword":["Electrical and Electronic Engineering","Computational Theory and Mathematics","Condensed Matter Physics","Mathematical Physics","Nuclear and High Energy Physics","Electronic","Optical and Magnetic Materials","Statistical and Nonlinear Physics"],"publication_status":"published","citation":{"bibtex":"@article{Bopp_Rojas_Revenga_Riedl_Sbresny_Boos_Simmet_Ahmadi_Gershoni_Kasprzak_et al._2022, title={Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling}, DOI={<a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>}, number={2200049}, journal={Advanced Quantum Technologies}, publisher={Wiley}, author={Bopp, Frederik and Rojas, Jonathan and Revenga, Natalia and Riedl, Hubert and Sbresny, Friedrich and Boos, Katarina and Simmet, Tobias and Ahmadi, Arash and Gershoni, David and Kasprzak, Jacek and et al.}, year={2022} }","mla":"Bopp, Frederik, et al. “Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling.” <i>Advanced Quantum Technologies</i>, 2200049, Wiley, 2022, doi:<a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>.","short":"F. Bopp, J. Rojas, N. Revenga, H. Riedl, F. Sbresny, K. Boos, T. Simmet, A. Ahmadi, D. Gershoni, J. Kasprzak, A. Ludwig, S. Reitzenstein, A. Wieck, D. Reuter, K. Müller, J.J. Finley, Advanced Quantum Technologies (2022).","apa":"Bopp, F., Rojas, J., Revenga, N., Riedl, H., Sbresny, F., Boos, K., Simmet, T., Ahmadi, A., Gershoni, D., Kasprzak, J., Ludwig, A., Reitzenstein, S., Wieck, A., Reuter, D., Müller, K., &#38; Finley, J. J. (2022). Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling. <i>Advanced Quantum Technologies</i>, Article 2200049. <a href=\"https://doi.org/10.1002/qute.202200049\">https://doi.org/10.1002/qute.202200049</a>","ama":"Bopp F, Rojas J, Revenga N, et al. Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling. <i>Advanced Quantum Technologies</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>","ieee":"F. Bopp <i>et al.</i>, “Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling,” <i>Advanced Quantum Technologies</i>, Art. no. 2200049, 2022, doi: <a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>.","chicago":"Bopp, Frederik, Jonathan Rojas, Natalia Revenga, Hubert Riedl, Friedrich Sbresny, Katarina Boos, Tobias Simmet, et al. “Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling.” <i>Advanced Quantum Technologies</i>, 2022. <a href=\"https://doi.org/10.1002/qute.202200049\">https://doi.org/10.1002/qute.202200049</a>."},"department":[{"_id":"15"},{"_id":"230"}],"publisher":"Wiley","publication":"Advanced Quantum Technologies","date_created":"2022-09-12T07:17:26Z","status":"public","type":"journal_article","year":"2022","publication_identifier":{"issn":["2511-9044","2511-9044"]},"language":[{"iso":"eng"}],"_id":"33332","date_updated":"2022-09-12T07:18:06Z","article_number":"2200049"},{"department":[{"_id":"178"},{"_id":"184"}],"citation":{"chicago":"Auer, Thorsten Fabian, Karin Knorr, and Kirsten Thommes. “Long‐term Effects of Institutional Conditions on Perceived Corruption – A Study on Organizational Imprinting in Post‐communist Countries.” <i>Business Ethics, the Environment &#38; Responsibility</i> 32, no. 2 (2022): 478–97. <a href=\"https://doi.org/10.1111/beer.12506\">https://doi.org/10.1111/beer.12506</a>.","ieee":"T. F. Auer, K. Knorr, and K. Thommes, “Long‐term effects of institutional conditions on perceived corruption – A study on organizational imprinting in post‐communist countries,” <i>Business Ethics, the Environment &#38; Responsibility</i>, vol. 32, no. 2, pp. 478–497, 2022, doi: <a href=\"https://doi.org/10.1111/beer.12506\">10.1111/beer.12506</a>.","apa":"Auer, T. F., Knorr, K., &#38; Thommes, K. (2022). Long‐term effects of institutional conditions on perceived corruption – A study on organizational imprinting in post‐communist countries. <i>Business Ethics, the Environment &#38; Responsibility</i>, <i>32</i>(2), 478–497. <a href=\"https://doi.org/10.1111/beer.12506\">https://doi.org/10.1111/beer.12506</a>","ama":"Auer TF, Knorr K, Thommes K. Long‐term effects of institutional conditions on perceived corruption – A study on organizational imprinting in post‐communist countries. <i>Business Ethics, the Environment &#38; Responsibility</i>. 2022;32(2):478-497. doi:<a href=\"https://doi.org/10.1111/beer.12506\">10.1111/beer.12506</a>","short":"T.F. Auer, K. Knorr, K. Thommes, Business Ethics, the Environment &#38; Responsibility 32 (2022) 478–497.","mla":"Auer, Thorsten Fabian, et al. “Long‐term Effects of Institutional Conditions on Perceived Corruption – A Study on Organizational Imprinting in Post‐communist Countries.” <i>Business Ethics, the Environment &#38; Responsibility</i>, vol. 32, no. 2, Wiley, 2022, pp. 478–97, doi:<a href=\"https://doi.org/10.1111/beer.12506\">10.1111/beer.12506</a>.","bibtex":"@article{Auer_Knorr_Thommes_2022, title={Long‐term effects of institutional conditions on perceived corruption – A study on organizational imprinting in post‐communist countries}, volume={32}, DOI={<a href=\"https://doi.org/10.1111/beer.12506\">10.1111/beer.12506</a>}, number={2}, journal={Business Ethics, the Environment &#38; Responsibility}, publisher={Wiley}, author={Auer, Thorsten Fabian and Knorr, Karin and Thommes, Kirsten}, year={2022}, pages={478–497} }"},"publication_status":"published","intvolume":"        32","article_type":"original","author":[{"id":"49071","last_name":"Auer","full_name":"Auer, Thorsten Fabian","first_name":"Thorsten Fabian"},{"full_name":"Knorr, Karin","first_name":"Karin","id":"33333","last_name":"Knorr"},{"id":"72497","last_name":"Thommes","full_name":"Thommes, Kirsten","first_name":"Kirsten"}],"date_updated":"2023-11-23T08:10:48Z","_id":"34281","language":[{"iso":"eng"}],"year":"2022","publication_identifier":{"eissn":["2694-6424"],"issn":["2694-6416"]},"status":"public","date_created":"2022-12-08T06:59:28Z","publisher":"Wiley","keyword":["Central and Eastern Europe","corruption","imprinting theory","institutional transformation","shock-imprinting"],"main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/beer.12506","open_access":"1"}],"user_id":"49071","oa":"1","project":[{"grant_number":"DFG 398074981","_id":"81","name":"OrgIdent: Die Konstruktion organisationaler Identität und der Einfluss von Geschichte"}],"doi":"10.1111/beer.12506","abstract":[{"text":"In this paper, we apply imprinting theory to examine how institutional transformation substantially influences perceptions of corruption that we argue to be incorporated to a varying extent in organizations founded in that period. For this purpose, we compare the effect of a sudden shock (dissolution of the Soviet Union) on the managers' present perceptions to that of a steady transition (EU accession). We consult the 5th round of the Business Environment and Enterprise Performance Survey from 2012 to 2014 analyzing 4715 interviews with managers of organizations from twelve Central and Eastern European countries. Our results reveal striking differences in the present perception of corruption for organizations founded immediately before and immediately after these institutional transitions. The study's results contribute to the research on imprinting theory regarding the relationship between organizations and institutional conditions that constitutes a lasting effect on organizational structures. Thus, applying an institutional perspective that considers less stable periods for organizations yields a promising avenue in research on organizational behavior.","lang":"eng"}],"title":"Long‐term effects of institutional conditions on perceived corruption – A study on organizational imprinting in post‐communist countries","issue":"2","page":"478-497","volume":32,"type":"journal_article","quality_controlled":"1","publication":"Business Ethics, the Environment & Responsibility"},{"user_id":"86519","publication_status":"published","keyword":["Lehrer*innenbildung","Mentoring","Praxissemester","Professionalisierung","Theorie-Praxis-Relationierung / Teacher training","Mentoring","Internship","Professionalization","Theory-practice-relation"],"citation":{"ama":"Caruso C, Neuweg GH, Wagner M, Harteis C. Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen. <i>Zeitschrift für Erziehungswissenschaft</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s11618-022-01123-x\">10.1007/s11618-022-01123-x</a>","apa":"Caruso, C., Neuweg, G. H., Wagner, M., &#38; Harteis, C. (2022). Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen. <i>Zeitschrift für Erziehungswissenschaft</i>. <a href=\"https://doi.org/10.1007/s11618-022-01123-x\">https://doi.org/10.1007/s11618-022-01123-x</a>","ieee":"C. Caruso, G. H. Neuweg, M. Wagner, and C. Harteis, “Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen.,” <i>Zeitschrift für Erziehungswissenschaft</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s11618-022-01123-x\">10.1007/s11618-022-01123-x</a>.","chicago":"Caruso, Carina, Georg Hans Neuweg, Michael  Wagner, and Christian Harteis. “Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen.” <i>Zeitschrift für Erziehungswissenschaft</i>, 2022. <a href=\"https://doi.org/10.1007/s11618-022-01123-x\">https://doi.org/10.1007/s11618-022-01123-x</a>.","bibtex":"@article{Caruso_Neuweg_Wagner_Harteis_2022, title={Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen.}, DOI={<a href=\"https://doi.org/10.1007/s11618-022-01123-x\">10.1007/s11618-022-01123-x</a>}, journal={Zeitschrift für Erziehungswissenschaft}, publisher={Springer }, author={Caruso, Carina and Neuweg, Georg Hans and Wagner, Michael  and Harteis, Christian}, year={2022} }","mla":"Caruso, Carina, et al. “Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen.” <i>Zeitschrift für Erziehungswissenschaft</i>, Springer , 2022, doi:<a href=\"https://doi.org/10.1007/s11618-022-01123-x\">10.1007/s11618-022-01123-x</a>.","short":"C. Caruso, G.H. Neuweg, M. Wagner, C. Harteis, Zeitschrift für Erziehungswissenschaft (2022)."},"author":[{"full_name":"Caruso, Carina","first_name":"Carina","last_name":"Caruso","id":"23123"},{"full_name":"Neuweg, Georg Hans","first_name":"Georg Hans","last_name":"Neuweg"},{"last_name":"Wagner","full_name":"Wagner, Michael ","first_name":"Michael "},{"orcid":"https://orcid.org/0000-0002-3570-7626","first_name":"Christian","full_name":"Harteis, Christian","last_name":"Harteis","id":"27503"}],"title":"Theorie-Praxis-Relationierung im Praxissemester: Die Perspektive der Mentor*innen.","abstract":[{"text":"In der Mehrheit der deutschen Bundesländer ist ein Langzeitpraktikum (Praxissemester) Bestandteil der Lehramtsstudiengänge. Es zielt insbesondere darauf, Theorie und Praxis miteinander in Beziehung zu setzen. Trotz der gewichtigen Rolle, die den Mentor*innen dabei zugeschrieben wird, ist deren Perspektive noch wenig untersucht. Die empirisch auffindbaren Unterschiede in der Betreuung Studierender könnten u. a. auf unterschiedliche Vorstellungen von der Beziehung zwischen Theorie und Praxis seitens der Mentor*innen zurückzuführen sein. Diese Vorstellungen interessieren in der im Folgenden dargestellten explorativen Interviewstudie, deren Daten einer strukturierenden Inhaltsanalyse unterzogen wurden. Nachstehenden Forschungsfragen wird nachgegangen:\r\n\r\n1) Sind die Mentor*innen auf die Aufgabe der Verknüpfung von Theorie und Praxis vorbereitet?\r\n\r\n2) Werden in den Erzählungen der Mentor*innen zu gelingenden und misslingenden Betreuungserfahrungen Theorie-Praxis-Relationierungsfiguren sichtbar, wenn ja, welche und zeigen sich Bemühungen der Verknüpfung von Theorie und Praxis?\r\n\r\n3) Werden in den Erzählungen der Mentor*innen zur eigenen Lerngeschichte Theorie-Praxis-Relationierungsfiguren sichtbar, wenn ja, welche und welche relative Rolle spielt das Ausbildungswissen aus Sicht der Mentor*innen für die Entwicklung ihres Könnens?\r\n\r\n4) Welches Wissensverständnis der Mentor*innen zeigt sich in den Transkripten und welche Relevanz wird Wissen im Vergleich zu Erfahrung, Reflexion von Erfahrung und Persönlichkeit zugeschrieben?\r\n\r\nEs zeigt sich, dass die Mentor*innen das Theorie-Praxis-Verhältnis in den Gesprächen selten thematisieren, die Begriffe „Wissen“ und „Können“ synonym verwenden und der Erfahrung für die Entwicklung von Können eine höhere Relevanz beimessen als dem didaktischen und pädagogischen Ausbildungswissen.\r\n","lang":"ger"},{"lang":"eng","text":"In most of the German federal states, a long-term internship is part of teacher education at universities. Notably, an internship aims to relate theory and practice. Despite the important role attributed to mentors, only little is known about their perspective. According to previous results, the mentoring of students varies. This could be due, among others, to different ideas about the relationship between theory and practice. The explorative interview study presented below is therefore dedicated to mentors’ ideas of the relationship between theory and practice. The following research questions were investigated:\r\n\r\n1) Are the mentors prepared for the task of linking theory and practice?\r\n\r\n2) Do the mentors’ stories on successful and unsuccessful mentoring experiences reveal theory-practice-relational figures, if so, which and do efforts to relate theory and practice become apparent?\r\n\r\n3) Do theory-practice-relational figures become visible in the mentors’ narratives on their own learning history, if so, what and what relative role does knowledge play from the mentors’ perspective in the context of their skill development?\r\n\r\n4) What understanding of knowledge of the mentors is reflected in the transcripts and what relevance is attributed to knowledge in comparison to experience, reflection of experience and personality?\r\n\r\nThe results show that the mentors rarely address the theory-practice relationship, use the term “knowledge” to name both knowing that and knowing how, and attach greater relevance to experience for skill development than to didactic and pedagogical knowledge."}],"doi":"10.1007/s11618-022-01123-x","alternative_title":["Eine explorative Studie"],"_id":"35112","date_updated":"2024-08-23T12:08:13Z","publisher":"Springer ","publication":"Zeitschrift für Erziehungswissenschaft","date_created":"2023-01-02T17:03:58Z","status":"public","year":"2022","type":"journal_article","language":[{"iso":"ger"}]},{"intvolume":"        69","author":[{"first_name":"Xiaozhe","full_name":"Ju, Xiaozhe","last_name":"Ju"},{"id":"335","last_name":"Mahnken","first_name":"Rolf","full_name":"Mahnken, Rolf"},{"full_name":"Xu, Yangjian","first_name":"Yangjian","last_name":"Xu"},{"last_name":"Liang","first_name":"Lihua","full_name":"Liang, Lihua"}],"department":[{"_id":"9"},{"_id":"154"},{"_id":"321"}],"publication_status":"published","citation":{"chicago":"Ju, Xiaozhe, Rolf Mahnken, Yangjian Xu, and Lihua Liang. “Goal-Oriented Error Estimation and h-Adaptive Finite Elements for Hyperelastic Micromorphic Continua.” <i>Computational Mechanics</i> 69, no. 3 (2022): 847–63. <a href=\"https://doi.org/10.1007/s00466-021-02117-y\">https://doi.org/10.1007/s00466-021-02117-y</a>.","ieee":"X. Ju, R. Mahnken, Y. Xu, and L. Liang, “Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua,” <i>Computational Mechanics</i>, vol. 69, no. 3, pp. 847–863, 2022, doi: <a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>.","ama":"Ju X, Mahnken R, Xu Y, Liang L. Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua. <i>Computational Mechanics</i>. 2022;69(3):847-863. doi:<a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>","apa":"Ju, X., Mahnken, R., Xu, Y., &#38; Liang, L. (2022). Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua. <i>Computational Mechanics</i>, <i>69</i>(3), 847–863. <a href=\"https://doi.org/10.1007/s00466-021-02117-y\">https://doi.org/10.1007/s00466-021-02117-y</a>","short":"X. Ju, R. Mahnken, Y. Xu, L. Liang, Computational Mechanics 69 (2022) 847–863.","mla":"Ju, Xiaozhe, et al. “Goal-Oriented Error Estimation and h-Adaptive Finite Elements for Hyperelastic Micromorphic Continua.” <i>Computational Mechanics</i>, vol. 69, no. 3, Springer Science and Business Media LLC, 2022, pp. 847–63, doi:<a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>.","bibtex":"@article{Ju_Mahnken_Xu_Liang_2022, title={Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>}, number={3}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Ju, Xiaozhe and Mahnken, Rolf and Xu, Yangjian and Liang, Lihua}, year={2022}, pages={847–863} }"},"status":"public","language":[{"iso":"eng"}],"year":"2022","publication_identifier":{"issn":["0178-7675","1432-0924"]},"publisher":"Springer Science and Business Media LLC","date_created":"2022-03-28T13:23:17Z","date_updated":"2023-01-24T13:10:56Z","_id":"30655","doi":"10.1007/s00466-021-02117-y","title":"Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua","keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"user_id":"335","type":"journal_article","publication":"Computational Mechanics","quality_controlled":"1","issue":"3","volume":69,"page":"847-863"},{"intvolume":"        31","doi":"10.1007/s00037-022-00231-8","author":[{"full_name":"Gharibian, Sevag","first_name":"Sevag","last_name":"Gharibian","id":"71541","orcid":"0000-0002-9992-3379"},{"first_name":"Miklos","full_name":"Santha, Miklos","last_name":"Santha"},{"last_name":"Sikora","full_name":"Sikora, Jamie","first_name":"Jamie"},{"full_name":"Sundaram, Aarthi","first_name":"Aarthi","last_name":"Sundaram"},{"first_name":"Justin","full_name":"Yirka, Justin","last_name":"Yirka"}],"title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","publication_status":"published","keyword":["Computational Mathematics","Computational Theory and Mathematics","General Mathematics","Theoretical Computer Science"],"citation":{"short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, Computational Complexity 31 (2022).","bibtex":"@article{Gharibian_Santha_Sikora_Sundaram_Yirka_2022, title={Quantum generalizations of the polynomial hierarchy with applications to QMA(2)}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>}, number={213}, journal={Computational Complexity}, publisher={Springer Science and Business Media LLC}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, year={2022} }","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>Computational Complexity</i>, vol. 31, no. 2, 13, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>.","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum generalizations of the polynomial hierarchy with applications to QMA(2),” <i>Computational Complexity</i>, vol. 31, no. 2, Art. no. 13, 2022, doi: <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>Computational Complexity</i> 31, no. 2 (2022). <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">https://doi.org/10.1007/s00037-022-00231-8</a>.","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum generalizations of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>. 2022;31(2). doi:<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>","apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2022). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>, <i>31</i>(2), Article 13. <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">https://doi.org/10.1007/s00037-022-00231-8</a>"},"status":"public","publication_identifier":{"issn":["1016-3328","1420-8954"]},"year":"2022","type":"journal_article","language":[{"iso":"eng"}],"publisher":"Springer Science and Business Media LLC","publication":"Computational Complexity","date_created":"2022-12-21T10:53:52Z","date_updated":"2023-02-28T11:07:02Z","issue":"2","article_number":"13","volume":31,"_id":"34700"},{"publisher":"Institute of Mathematics, Polish Academy of Sciences","date_created":"2022-12-22T10:08:23Z","status":"public","year":"2022","publication_identifier":{"issn":["0065-1036","1730-6264"]},"language":[{"iso":"eng"}],"_id":"34835","date_updated":"2023-03-06T08:48:33Z","author":[{"id":"21202","last_name":"Klüners","first_name":"Jürgen","full_name":"Klüners, Jürgen"}],"intvolume":"       204","publication_status":"published","citation":{"short":"J. Klüners, Acta Arithmetica 204 (2022) 165–184.","mla":"Klüners, Jürgen. “The Asymptotics of Nilpotent Galois Groups.” <i>Acta Arithmetica</i>, vol. 204, no. 2, Institute of Mathematics, Polish Academy of Sciences, 2022, pp. 165–84, doi:<a href=\"https://doi.org/10.4064/aa211207-16-5\">10.4064/aa211207-16-5</a>.","bibtex":"@article{Klüners_2022, title={The asymptotics of nilpotent Galois groups}, volume={204}, DOI={<a href=\"https://doi.org/10.4064/aa211207-16-5\">10.4064/aa211207-16-5</a>}, number={2}, journal={Acta Arithmetica}, publisher={Institute of Mathematics, Polish Academy of Sciences}, author={Klüners, Jürgen}, year={2022}, pages={165–184} }","chicago":"Klüners, Jürgen. “The Asymptotics of Nilpotent Galois Groups.” <i>Acta Arithmetica</i> 204, no. 2 (2022): 165–84. <a href=\"https://doi.org/10.4064/aa211207-16-5\">https://doi.org/10.4064/aa211207-16-5</a>.","ieee":"J. Klüners, “The asymptotics of nilpotent Galois groups,” <i>Acta Arithmetica</i>, vol. 204, no. 2, pp. 165–184, 2022, doi: <a href=\"https://doi.org/10.4064/aa211207-16-5\">10.4064/aa211207-16-5</a>.","apa":"Klüners, J. (2022). The asymptotics of nilpotent Galois groups. <i>Acta Arithmetica</i>, <i>204</i>(2), 165–184. <a href=\"https://doi.org/10.4064/aa211207-16-5\">https://doi.org/10.4064/aa211207-16-5</a>","ama":"Klüners J. The asymptotics of nilpotent Galois groups. <i>Acta Arithmetica</i>. 2022;204(2):165-184. doi:<a href=\"https://doi.org/10.4064/aa211207-16-5\">10.4064/aa211207-16-5</a>"},"department":[{"_id":"102"}],"publication":"Acta Arithmetica","type":"journal_article","volume":204,"page":"165-184","issue":"2","title":"The asymptotics of nilpotent Galois groups","doi":"10.4064/aa211207-16-5","abstract":[{"text":"We prove an upper bound for the asymptotics of counting functions of number fields with nilpotent Galois groups. ","lang":"eng"}],"user_id":"93826","keyword":["Algebra and Number Theory"],"external_id":{"arxiv":["2011.04325 "]}},{"citation":{"apa":"Sieland, B., Hoppe, A., Stepen, A. J., &#38; Paradies, J. (2022). Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis. <i>Advanced Synthesis &#38;amp; Catalysis</i>, <i>364</i>(18), 3143–3148. <a href=\"https://doi.org/10.1002/adsc.202200525\">https://doi.org/10.1002/adsc.202200525</a>","ama":"Sieland B, Hoppe A, Stepen AJ, Paradies J. Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis. <i>Advanced Synthesis &#38;amp; Catalysis</i>. 2022;364(18):3143-3148. doi:<a href=\"https://doi.org/10.1002/adsc.202200525\">10.1002/adsc.202200525</a>","chicago":"Sieland, Benedikt, Axel Hoppe, Arne J. Stepen, and Jan Paradies. “Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis.” <i>Advanced Synthesis &#38;amp; Catalysis</i> 364, no. 18 (2022): 3143–48. <a href=\"https://doi.org/10.1002/adsc.202200525\">https://doi.org/10.1002/adsc.202200525</a>.","ieee":"B. Sieland, A. Hoppe, A. J. Stepen, and J. Paradies, “Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis,” <i>Advanced Synthesis &#38;amp; Catalysis</i>, vol. 364, no. 18, pp. 3143–3148, 2022, doi: <a href=\"https://doi.org/10.1002/adsc.202200525\">10.1002/adsc.202200525</a>.","mla":"Sieland, Benedikt, et al. “Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis.” <i>Advanced Synthesis &#38;amp; Catalysis</i>, vol. 364, no. 18, Wiley, 2022, pp. 3143–48, doi:<a href=\"https://doi.org/10.1002/adsc.202200525\">10.1002/adsc.202200525</a>.","bibtex":"@article{Sieland_Hoppe_Stepen_Paradies_2022, title={Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis}, volume={364}, DOI={<a href=\"https://doi.org/10.1002/adsc.202200525\">10.1002/adsc.202200525</a>}, number={18}, journal={Advanced Synthesis &#38;amp; Catalysis}, publisher={Wiley}, author={Sieland, Benedikt and Hoppe, Axel and Stepen, Arne J. and Paradies, Jan}, year={2022}, pages={3143–3148} }","short":"B. Sieland, A. Hoppe, A.J. Stepen, J. Paradies, Advanced Synthesis &#38;amp; Catalysis 364 (2022) 3143–3148."},"publication_status":"published","department":[{"_id":"389"}],"author":[{"last_name":"Sieland","full_name":"Sieland, Benedikt","first_name":"Benedikt"},{"first_name":"Axel","full_name":"Hoppe, Axel","id":"62844","last_name":"Hoppe"},{"full_name":"Stepen, Arne J.","first_name":"Arne J.","last_name":"Stepen"},{"orcid":"0000-0002-3698-668X","last_name":"Paradies","id":"53339","first_name":"Jan","full_name":"Paradies, Jan"}],"intvolume":"       364","_id":"59619","date_updated":"2025-04-22T06:12:05Z","date_created":"2025-04-22T06:01:56Z","publisher":"Wiley","language":[{"iso":"eng"}],"year":"2022","publication_identifier":{"issn":["1615-4150","1615-4169"]},"status":"public","main_file_link":[{"url":"https://advanced.onlinelibrary.wiley.com/doi/10.1002/adsc.202200525","open_access":"1"}],"keyword":["hydroboration","nitrile","amine","frustrated Lewis pair","density functional theory"],"oa":"1","user_id":"62844","title":"Frustrated Lewis Pair‐Catalyzed Hydroboration of Nitriles: FLP Versus Borenium Catalysis","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>A frustrated Lewis pair‐catalyzed hydroboration of aromatic and aliphatic nitriles was developed. The catalyst provides the primary amines in high yields of 77–99% with catalyst loading as low as 2 mol%. The reaction displays high functional group tolerance towards esters, amides, nitro groups and aliphatic halides. The addition of the diborylated amines to ethyl 3‐phenylpropiolate proceeds with Z‐selectivity with d.r. of &gt;99:1 in 77–90% yield over two steps. The reaction mechanism was investigated by control and computational experiments.</jats:p><jats:p><jats:boxed-text content-type=\"graphic\" position=\"anchor\"><jats:graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mimetype=\"image/png\" position=\"anchor\" specific-use=\"enlarged-web-image\" xlink:href=\"graphic/adsc202200525-toc-0001-m.png\"><jats:alt-text>magnified image</jats:alt-text></jats:graphic></jats:boxed-text>\r\n</jats:p>","lang":"eng"}],"doi":"10.1002/adsc.202200525","page":"3143-3148","volume":364,"issue":"18","quality_controlled":"1","publication":"Advanced Synthesis &amp; Catalysis","type":"journal_article"},{"date_updated":"2025-12-08T10:44:17Z","_id":"47627","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0018-1560","1573-174X"]},"year":"2022","publisher":"Springer Science and Business Media LLC","date_created":"2023-10-05T09:25:30Z","department":[{"_id":"282"},{"_id":"208"},{"_id":"640"}],"publication_status":"published","citation":{"chicago":"Mordhorst, Lisa, and Tobias Jenert. “Curricular Integration of Academic and Vocational Education: A Theory-Based Empirical Typology of Dual Study Programmes in Germany.” <i>Higher Education</i> 85, no. 6 (2022): 1257–79. <a href=\"https://doi.org/10.1007/s10734-022-00889-7\">https://doi.org/10.1007/s10734-022-00889-7</a>.","ieee":"L. Mordhorst and T. Jenert, “Curricular integration of academic and vocational education: a theory-based empirical typology of dual study programmes in Germany,” <i>Higher Education</i>, vol. 85, no. 6, pp. 1257–1279, 2022, doi: <a href=\"https://doi.org/10.1007/s10734-022-00889-7\">10.1007/s10734-022-00889-7</a>.","apa":"Mordhorst, L., &#38; Jenert, T. (2022). Curricular integration of academic and vocational education: a theory-based empirical typology of dual study programmes in Germany. <i>Higher Education</i>, <i>85</i>(6), 1257–1279. <a href=\"https://doi.org/10.1007/s10734-022-00889-7\">https://doi.org/10.1007/s10734-022-00889-7</a>","ama":"Mordhorst L, Jenert T. Curricular integration of academic and vocational education: a theory-based empirical typology of dual study programmes in Germany. <i>Higher Education</i>. 2022;85(6):1257-1279. doi:<a href=\"https://doi.org/10.1007/s10734-022-00889-7\">10.1007/s10734-022-00889-7</a>","short":"L. Mordhorst, T. Jenert, Higher Education 85 (2022) 1257–1279.","mla":"Mordhorst, Lisa, and Tobias Jenert. “Curricular Integration of Academic and Vocational Education: A Theory-Based Empirical Typology of Dual Study Programmes in Germany.” <i>Higher Education</i>, vol. 85, no. 6, Springer Science and Business Media LLC, 2022, pp. 1257–79, doi:<a href=\"https://doi.org/10.1007/s10734-022-00889-7\">10.1007/s10734-022-00889-7</a>.","bibtex":"@article{Mordhorst_Jenert_2022, title={Curricular integration of academic and vocational education: a theory-based empirical typology of dual study programmes in Germany}, volume={85}, DOI={<a href=\"https://doi.org/10.1007/s10734-022-00889-7\">10.1007/s10734-022-00889-7</a>}, number={6}, journal={Higher Education}, publisher={Springer Science and Business Media LLC}, author={Mordhorst, Lisa and Jenert, Tobias}, year={2022}, pages={1257–1279} }"},"intvolume":"        85","author":[{"first_name":"Lisa","full_name":"Mordhorst, Lisa","last_name":"Mordhorst","id":"81839"},{"orcid":" https://orcid.org/0000-0001-9262-5646","first_name":"Tobias","full_name":"Jenert, Tobias","id":"71994","last_name":"Jenert"}],"article_type":"original","issue":"6","volume":85,"page":"1257-1279","type":"journal_article","quality_controlled":"1","publication":"Higher Education","main_file_link":[{"url":"https://doi.org/10.1007/s10734-022-00889-7"}],"keyword":["Dual study programmes · Curricular integration · Curriculum theory · Empirical typology · Cluster analysis · Germany"],"user_id":"71994","doi":"10.1007/s10734-022-00889-7","abstract":[{"text":"In Germany, dual learning programmes are increasingly offered by higher education institutions. These programmes’ main characteristic and greatest challenge is their integration of academic and vocational learning. So far, this challenge has frequently been stated without specifying its exact nature and consequences for learners. The present study addresses this pedagogical research gap and examines the extent of variation in the degree of integration among dual study programmes. With reference to curriculum theory, the study develops an empirical typology of curricular integration in dual programmes. The data sample consists of 152 programmes at (dual) universities and universities of applied sciences. Data is analysed using hierarchical cluster analysis. Results indicate that the currently prevailing forms of curricular integration should best be differentiated according to five types. The five overlapping types of integration are located on a continuum ranging from parallelism through organisational linking to full curricular integration targeted immediately at students’ personal integration. The analysis confirms that there are problems with complying with integration standards set on the policy level. Above all, the study offers new insights on what marks the diverse integration landscape of dual study programmes. It proves that approaches to integration are more differentiated than previous research has shown.","lang":"eng"}],"title":"Curricular integration of academic and vocational education: a theory-based empirical typology of dual study programmes in Germany"},{"doi":"10.1109/tc.2021.3107196","author":[{"full_name":"Rodriguez, Alfonso","first_name":"Alfonso","last_name":"Rodriguez"},{"last_name":"Otero","full_name":"Otero, Andres","first_name":"Andres"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"},{"first_name":"Eduardo","full_name":"De la Torre, Eduardo","last_name":"De la Torre"}],"title":"Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs","department":[{"_id":"78"}],"publication_status":"published","keyword":["Computational Theory and Mathematics","Hardware and Architecture","Theoretical Computer Science","Software"],"user_id":"398","citation":{"short":"A. Rodriguez, A. Otero, M. Platzner, E. De la Torre, IEEE Transactions on Computers (2021) 1–1.","mla":"Rodriguez, Alfonso, et al. “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs.” <i>IEEE Transactions on Computers</i>, Institute of Electrical and Electronics Engineers (IEEE), 2021, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>.","bibtex":"@article{Rodriguez_Otero_Platzner_De la Torre_2021, title={Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs}, DOI={<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Rodriguez, Alfonso and Otero, Andres and Platzner, Marco and De la Torre, Eduardo}, year={2021}, pages={1–1} }","chicago":"Rodriguez, Alfonso, Andres Otero, Marco Platzner, and Eduardo De la Torre. “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs.” <i>IEEE Transactions on Computers</i>, 2021, 1–1. <a href=\"https://doi.org/10.1109/tc.2021.3107196\">https://doi.org/10.1109/tc.2021.3107196</a>.","ieee":"A. Rodriguez, A. Otero, M. Platzner, and E. De la Torre, “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs,” <i>IEEE Transactions on Computers</i>, pp. 1–1, 2021, doi: <a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>.","apa":"Rodriguez, A., Otero, A., Platzner, M., &#38; De la Torre, E. (2021). Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. <i>IEEE Transactions on Computers</i>, 1–1. <a href=\"https://doi.org/10.1109/tc.2021.3107196\">https://doi.org/10.1109/tc.2021.3107196</a>","ama":"Rodriguez A, Otero A, Platzner M, De la Torre E. Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. <i>IEEE Transactions on Computers</i>. Published online 2021:1-1. doi:<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>"},"status":"public","language":[{"iso":"eng"}],"type":"journal_article","publication_identifier":{"issn":["0018-9340","1557-9956","2326-3814"]},"year":"2021","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2022-04-18T10:03:16Z","publication":"IEEE Transactions on Computers","date_updated":"2022-04-18T10:04:21Z","_id":"30907","page":"1-1"},{"publication_identifier":{"issn":["0095-8956"]},"year":"2021","language":[{"iso":"eng"}],"status":"public","date_created":"2022-11-09T08:43:55Z","publisher":"Elsevier BV","date_updated":"2022-11-09T08:44:37Z","_id":"34042","intvolume":"       153","author":[{"first_name":"Jiaao","full_name":"Li, Jiaao","last_name":"Li"},{"last_name":"Ma","id":"92748","full_name":"Ma, Yulai","first_name":"Yulai"},{"last_name":"Miao","first_name":"Zhengke","full_name":"Miao, Zhengke"},{"last_name":"Shi","first_name":"Yongtang","full_name":"Shi, Yongtang"},{"first_name":"Weifan","full_name":"Wang, Weifan","last_name":"Wang"},{"last_name":"Zhang","full_name":"Zhang, Cun-Quan","first_name":"Cun-Quan"}],"department":[{"_id":"542"}],"citation":{"chicago":"Li, Jiaao, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, and Cun-Quan Zhang. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i> 153 (2021): 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>.","ieee":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, and C.-Q. Zhang, “Nowhere-zero 3-flows in toroidal graphs,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, pp. 61–80, 2021, doi: <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","apa":"Li, J., Ma, Y., Miao, Z., Shi, Y., Wang, W., &#38; Zhang, C.-Q. (2021). Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>, <i>153</i>, 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>","ama":"Li J, Ma Y, Miao Z, Shi Y, Wang W, Zhang C-Q. Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>. 2021;153:61-80. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>","short":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, C.-Q. Zhang, Journal of Combinatorial Theory, Series B 153 (2021) 61–80.","mla":"Li, Jiaao, et al. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, Elsevier BV, 2021, pp. 61–80, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","bibtex":"@article{Li_Ma_Miao_Shi_Wang_Zhang_2021, title={Nowhere-zero 3-flows in toroidal graphs}, volume={153}, DOI={<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>}, journal={Journal of Combinatorial Theory, Series B}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}, year={2021}, pages={61–80} }"},"publication_status":"published","type":"journal_article","publication":"Journal of Combinatorial Theory, Series B","page":"61-80","volume":153,"doi":"10.1016/j.jctb.2021.11.001","title":"Nowhere-zero 3-flows in toroidal graphs","user_id":"15540","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Theoretical Computer Science"]},{"citation":{"apa":"Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A. H., Wang, H., &#38; Emmerich, M. (2021). Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. <i>Computers &#38; Operations Research</i>, <i>136</i>, 105489. <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>","ama":"Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. <i>Computers &#38; Operations Research</i>. 2021;136:105489. doi:<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>","ieee":"C. Grimme <i>et al.</i>, “Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization,” <i>Computers &#38; Operations Research</i>, vol. 136, p. 105489, 2021, doi: <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","chicago":"Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations Research</i> 136 (2021): 105489. <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","bibtex":"@article{Grimme_Kerschke_Aspar_Trautmann_Preuss_Deutz_Wang_Emmerich_2021, title={Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization}, volume={136}, DOI={<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>}, journal={Computers &#38; Operations Research}, author={Grimme, Christian and Kerschke, Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André H. and Wang, Hao and Emmerich, Michael}, year={2021}, pages={105489} }","mla":"Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations Research</i>, vol. 136, 2021, p. 105489, doi:<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","short":"C. Grimme, P. Kerschke, P. Aspar, H. Trautmann, M. Preuss, A.H. Deutz, H. Wang, M. Emmerich, Computers &#38; Operations Research 136 (2021) 105489."},"keyword":["Multimodal optimization","Multi-objective continuous optimization","Landscape analysis","Visualization","Benchmarking","Theory","Algorithms"],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"title":"Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization","author":[{"last_name":"Grimme","full_name":"Grimme, Christian","first_name":"Christian"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"last_name":"Aspar","full_name":"Aspar, Pelin","first_name":"Pelin"},{"orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann","id":"100740"},{"last_name":"Preuss","first_name":"Mike","full_name":"Preuss, Mike"},{"first_name":"André H.","full_name":"Deutz, André H.","last_name":"Deutz"},{"last_name":"Wang","full_name":"Wang, Hao","first_name":"Hao"},{"last_name":"Emmerich","full_name":"Emmerich, Michael","first_name":"Michael"}],"abstract":[{"lang":"eng","text":"Multi-objective (MO) optimization, i.e., the simultaneous optimization of multiple conflicting objectives, is gaining more and more attention in various research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter optimization), or logistics (e.g., vehicle routing). Many works in this domain mention the structural problem property of multimodality as a challenge from two classical perspectives: (1) finding all globally optimal solution sets, and (2) avoiding to get trapped in local optima. Interestingly, these streams seem to transfer many traditional concepts of single-objective (SO) optimization into claims, assumptions, or even terminology regarding the MO domain, but mostly neglect the understanding of the structural properties as well as the algorithmic search behavior on a problem’s landscape. However, some recent works counteract this trend, by investigating the fundamentals and characteristics of MO problems using new visualization techniques and gaining surprising insights. Using these visual insights, this work proposes a step towards a unified terminology to capture multimodality and locality in a broader way than it is usually done. This enables us to investigate current research activities in multimodal continuous MO optimization and to highlight new implications and promising research directions for the design of benchmark suites, the discovery of MO landscape features, the development of new MO (or even SO) optimization algorithms, and performance indicators. For all these topics, we provide a review of ideas and methods but also an outlook on future challenges, research potential and perspectives that result from recent developments."}],"doi":"https://doi.org/10.1016/j.cor.2021.105489","intvolume":"       136","_id":"46318","page":"105489","volume":136,"date_updated":"2023-10-16T12:58:42Z","date_created":"2023-08-04T07:28:34Z","publication":"Computers & Operations Research","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0305-0548"]},"type":"journal_article","year":"2021","status":"public"},{"title":"Digitales Praxissemester - kann das überhaupt gut gehen?","alternative_title":["Reflexionen von Lehramtsstudierenden vor und während des Praxissemesters in Zeiten der Covid-19-Pandemie."],"abstract":[{"text":"Marianne Friese/Rita Braches-Chyrek Einführung Marianne Friese Care Work im Spannungsfeld gesellschaftlicher Transformation. Systemische Widersprüche und Entwicklungsperspektiven Berufliche Bildung und Beschäftigungssysteme Denise Becka und Michaela Evans Wohlfahrtsproduktion und Care im digitalen Wandel: Perspektiven für Beruflichkeit in der Pflege Heidrun Herzberg und Peter Alheit Zur Akzeptanz des Konzepts „Community Nurse\" im Land Brandenburg: Eine qualitative Vorstudie Karin Reiber, Jan Braun und Jutta Mohr Berufliche Bildung in der Domäne Pflege zwischen Anforderungen des Beschäftigungssystems und individueller berufsbiografischer Entwicklung Philipp Struck Entwicklungs- und Verbesserungsperspektiven für berufliche (Aus-)Bildungsprozesse im Gesundheitswesen Rita Braches-Chyrek Soziale Arbeit: Ausbildung und Beschäftigung Julia Kastrup und Alexandra Brutzer Hauswirtschaft in Zeiten von Corona - Ergebnisse einer Interviewstudie mit Hauswirtschaftlichen Fachkräften Akademische Bildung und Weiterbildung Anna Bobe, Anke Karber und Tobias Moock Theorie und Praxis in sozialpädagogischen Bildungsgängen - Erste Strukturierungsansätze vielfältiger Verhältnisse Manuela Liebig, Mirjam Chris und Annemarie Marx „Am Ball bleiben\" - Sensibilisierung für aktuelle Herausforderungen der sozialpädagogischen Praxis durch Arbeitsanalysen im Lehramtsstudium für berufliche Schulen Anja Walter, Martin Fritzenwanker, Martin Karstädt Von Berufsfeldanalysen zum Unterricht - empirisches Material für die Bildungspraxis im Berufsfeld Gesundheit und Pflege nutzen Nina Göddertz „Digitales Praxissemester - kann das überhaupt gut gehen?\" - Reflexionen von Lehramtsstudierenden vor und während des Praxissemesters in Zeiten der Covid-19-Pandemie Stephanie Spanu Systemrelevant(e) ausbilden. Berufliches Lehramt, Fachrichtung Sozialpädagogik und die berufliche Bildung: Der Fachkräftemangel als gesellschaftliche Aufgabe Julia Kastrup, Birgit Peuker, Marie Nölle-Krug und Simon Vollmer Gemeinsam innovativ! - Transformative Themenfelder in der lehramtsbezogenen Ausbildung der beruflichen Fachrichtung Ernährung- und Hauswirtschaft standortübergreifend lehren und lernen Ursula Walkenhorst, Annika Lara Schwarze Digitale Transformation in der Hochschullehre - Chancen und Grenzen für die Gesundheitsberufe Dana Bergmann und Astrid Seltrecht Weiterbildungsordnungsarbeit für Pflegeberufe Claudia Schepers, Johanna Krawietz und Jella Fuchs Kollegiale Beratung für die Kitteltasche","lang":"ger"}],"keyword":["Modernisierung personenbezogener Dienstleistungsberufe Aktueller Forschungsstand","Best Practice und Desiderata"],"user_id":"48187","publication":"Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik","type":"book_chapter","page":"183-199","editor":[{"first_name":"Rita","full_name":"Braches-Chyrek, Rita","last_name":"Braches-Chyrek"},{"last_name":"Friese","first_name":"Marianne","full_name":"Friese, Marianne"}],"author":[{"id":"94171","last_name":"Göddertz","full_name":"Göddertz, Nina","first_name":"Nina"}],"place":"Bielefeld","citation":{"ama":"Göddertz N. Digitales Praxissemester - kann das überhaupt gut gehen? In: Braches-Chyrek R, Friese M, eds. <i>Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik</i>. wbv Media; 2021:183-199.","apa":"Göddertz, N. (2021). Digitales Praxissemester - kann das überhaupt gut gehen? In R. Braches-Chyrek &#38; M. Friese (Eds.), <i>Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik</i> (pp. 183–199). wbv Media.","chicago":"Göddertz, Nina. “Digitales Praxissemester - kann das überhaupt gut gehen?” In <i>Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik</i>, edited by Rita Braches-Chyrek and Marianne Friese, 183–99. Bielefeld: wbv Media, 2021.","ieee":"N. Göddertz, “Digitales Praxissemester - kann das überhaupt gut gehen?,” in <i>Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik</i>, R. Braches-Chyrek and M. Friese, Eds. Bielefeld: wbv Media, 2021, pp. 183–199.","mla":"Göddertz, Nina. “Digitales Praxissemester - kann das überhaupt gut gehen?” <i>Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik</i>, edited by Rita Braches-Chyrek and Marianne Friese, wbv Media, 2021, pp. 183–99.","bibtex":"@inbook{Göddertz_2021, place={Bielefeld}, title={Digitales Praxissemester - kann das überhaupt gut gehen?}, booktitle={Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik}, publisher={wbv Media}, author={Göddertz, Nina}, editor={Braches-Chyrek, Rita and Friese, Marianne}, year={2021}, pages={183–199} }","short":"N. Göddertz, in: R. Braches-Chyrek, M. Friese (Eds.), Care Work in der gesellschaftlichen Transformation. Beschäftigung, Bildung, Fachdidaktik, wbv Media, Bielefeld, 2021, pp. 183–199."},"publication_status":"published","department":[{"_id":"723"},{"_id":"724"},{"_id":"36"}],"date_created":"2023-06-07T08:15:51Z","publisher":"wbv Media","language":[{"iso":"ger"}],"year":"2021","publication_identifier":{"isbn":["9783763972616 "]},"status":"public","_id":"45497","date_updated":"2023-11-09T17:06:04Z"},{"external_id":{"arxiv":["2107.13853"]},"user_id":"15694","oa":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S2405896321021236","open_access":"1"}],"keyword":["optimal control","catastrophe theory","bifurcations","variational methods","symplectic integrators"],"has_accepted_license":"1","abstract":[{"text":"The first order optimality conditions of optimal control problems (OCPs) can\r\nbe regarded as boundary value problems for Hamiltonian systems. Variational or\r\nsymplectic discretisation methods are classically known for their excellent\r\nlong term behaviour. As boundary value problems are posed on intervals of\r\nfixed, moderate length, it is not immediately clear whether methods can profit\r\nfrom structure preservation in this context. When parameters are present,\r\nsolutions can undergo bifurcations, for instance, two solutions can merge and\r\nannihilate one another as parameters are varied. We will show that generic\r\nbifurcations of an OCP are preserved under discretisation when the OCP is\r\neither directly discretised to a discrete OCP (direct method) or translated\r\ninto a Hamiltonian boundary value problem using first order necessary\r\nconditions of optimality which is then solved using a symplectic integrator\r\n(indirect method). Moreover, certain bifurcations break when a non-symplectic\r\nscheme is used. The general phenomenon is illustrated on the example of a cut\r\nlocus of an ellipsoid.","lang":"eng"}],"doi":"https://doi.org/10.1016/j.ifacol.2021.11.099","file":[{"relation":"main_file","date_updated":"2021-07-29T09:37:49Z","creator":"coffen","file_name":"ifacconf.pdf","file_size":3125220,"content_type":"application/pdf","file_id":"22895","access_level":"open_access","date_created":"2021-07-29T09:37:49Z"}],"title":"Bifurcation preserving discretisations of optimal control problems","volume":"54(19)","page":"334-339","type":"conference","quality_controlled":"1","ddc":["510"],"department":[{"_id":"636"}],"publication_status":"published","series_title":"IFAC-PapersOnLine","citation":{"bibtex":"@article{Offen_Ober-Blöbaum_2021, series={IFAC-PapersOnLine}, title={Bifurcation preserving discretisations of optimal control problems}, volume={54(19)}, DOI={<a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>}, author={Offen, Christian and Ober-Blöbaum, Sina}, year={2021}, pages={334–339}, collection={IFAC-PapersOnLine} }","mla":"Offen, Christian, and Sina Ober-Blöbaum. <i>Bifurcation Preserving Discretisations of Optimal Control Problems</i>. 2021, pp. 334–39, doi:<a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>.","short":"C. Offen, S. Ober-Blöbaum, 54(19) (2021) 334–339.","ama":"Offen C, Ober-Blöbaum S. Bifurcation preserving discretisations of optimal control problems. 2021;54(19):334-339. doi:<a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>","apa":"Offen, C., &#38; Ober-Blöbaum, S. (2021). <i>Bifurcation preserving discretisations of optimal control problems: Vol. 54(19)</i> (pp. 334–339). <a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>","ieee":"C. Offen and S. Ober-Blöbaum, “Bifurcation preserving discretisations of optimal control problems,” vol. 54(19). pp. 334–339, 2021, doi: <a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>.","chicago":"Offen, Christian, and Sina Ober-Blöbaum. “Bifurcation Preserving Discretisations of Optimal Control Problems.” IFAC-PapersOnLine, 2021. <a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>."},"author":[{"orcid":"0000-0002-5940-8057","id":"85279","last_name":"Offen","first_name":"Christian","full_name":"Offen, Christian"},{"id":"16494","last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina","first_name":"Sina"}],"conference":{"location":"Berlin, Germany","start_date":"2021-10-11","name":"7th IFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control, LHMNC 2021","end_date":"2021-10-13"},"date_updated":"2023-11-29T10:19:41Z","file_date_updated":"2021-07-29T09:37:49Z","_id":"22894","status":"public","publication_identifier":{"issn":["2405-8963"]},"year":"2021","language":[{"iso":"eng"}],"date_created":"2021-07-29T09:38:32Z","related_material":{"link":[{"description":"GitHub/Zenodo","relation":"software","url":"https://doi.org/10.5281/zenodo.4562664"}]}},{"publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:55Z","status":"public","language":[{"iso":"eng"}],"year":"2021","publication_identifier":{"isbn":["978-1-4503-8352-3"]},"_id":"48862","date_updated":"2023-12-13T10:45:31Z","author":[{"id":"102979","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"}],"place":"New York, NY, USA","publication_status":"published","citation":{"mla":"Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–11.","apa":"Bossek, J., &#38; Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary Algorithms? In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i> (pp. 1–11). Association for Computing Machinery.","ama":"Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms? In: <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. Association for Computing Machinery; 2021:1–11.","bibtex":"@inbook{Bossek_Sudholt_2021, place={New York, NY, USA}, title={Do Additional Optima Speed up Evolutionary Algorithms?}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2021}, pages={1–11} }","chicago":"Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 1–11. New York, NY, USA: Association for Computing Machinery, 2021.","short":"J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–11.","ieee":"J. Bossek and D. Sudholt, “Do Additional Optima Speed up Evolutionary Algorithms?,” in <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–11."},"department":[{"_id":"819"}],"publication":"Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","type":"book_chapter","page":"1–11","extern":"1","title":"Do Additional Optima Speed up Evolutionary Algorithms?","abstract":[{"lang":"eng","text":"Most runtime analyses of randomised search heuristics focus on the expected number of function evaluations to find a unique global optimum. We ask a fundamental question: if additional search points are declared optimal, or declared as desirable target points, do these additional optima speed up evolutionary algorithms? More formally, we analyse the expected hitting time of a target set OPT {$\\cup$} S where S is a set of non-optimal search points and OPT is the set of optima and compare it to the expected hitting time of OPT. We show that the answer to our question depends on the number and placement of search points in S. For all black-box algorithms and all fitness functions we show that, if additional optima are placed randomly, even an exponential number of optima has a negligible effect on the expected optimisation time. Considering Hamming balls around all global optima gives an easier target for some algorithms and functions and can shift the phase transition with respect to offspring population sizes in the (1,{$\\lambda$}) EA on One-Max. Finally, on functions where search trajectories typically join in a single search point, turning one search point into an optimum drastically reduces the expected optimisation time."}],"keyword":["evolutionary algorithms","pseudo-boolean functions","runtime analysis","theory"],"user_id":"102979"},{"abstract":[{"text":"Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph (NNG) transformation of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. Eventually, a proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features.","lang":"eng"}],"place":"New York, NY, USA","extern":"1","author":[{"full_name":"Heins, Jonathan","first_name":"Jonathan","last_name":"Heins"},{"last_name":"Bossek","id":"102979","first_name":"Jakob","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668"},{"first_name":"Janina","full_name":"Pohl, Janina","last_name":"Pohl"},{"last_name":"Seiler","full_name":"Seiler, Moritz","first_name":"Moritz"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"}],"title":"On the Potential of Normalized TSP Features for Automated Algorithm Selection","department":[{"_id":"819"}],"keyword":["automated algorithm selection","graph theory","instance features","normalization","traveling salesperson problem (TSP)"],"user_id":"102979","citation":{"short":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–15.","mla":"Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–15.","bibtex":"@inbook{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={New York, NY, USA}, title={On the Potential of Normalized TSP Features for Automated Algorithm Selection}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, year={2021}, pages={1–15} }","chicago":"Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 1–15. New York, NY, USA: Association for Computing Machinery, 2021.","ieee":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On the Potential of Normalized TSP Features for Automated Algorithm Selection,” in <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–15.","ama":"Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential of Normalized TSP Features for Automated Algorithm Selection. In: <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. Association for Computing Machinery; 2021:1–15.","apa":"Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm Selection. In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i> (pp. 1–15). Association for Computing Machinery."},"status":"public","language":[{"iso":"eng"}],"type":"book_chapter","publication_identifier":{"isbn":["978-1-4503-8352-3"]},"year":"2021","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:58Z","publication":"Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","date_updated":"2023-12-13T10:47:23Z","page":"1–15","_id":"48881"},{"type":"journal_article","publication":"Compositio Mathematica","issue":"12","volume":156,"page":"2437-2468","doi":"10.1112/s0010437x20007551","abstract":[{"lang":"eng","text":"<jats:p>The principal aim of this article is to attach and study <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline4.png\" /><jats:tex-math>$p$</jats:tex-math></jats:alternatives></jats:inline-formula>-adic <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline5.png\" /><jats:tex-math>$L$</jats:tex-math></jats:alternatives></jats:inline-formula>-functions to cohomological cuspidal automorphic representations <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline6.png\" /><jats:tex-math>$\\Pi$</jats:tex-math></jats:alternatives></jats:inline-formula> of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline7.png\" /><jats:tex-math>$\\operatorname {GL}_{2n}$</jats:tex-math></jats:alternatives></jats:inline-formula> over a totally real field <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline8.png\" /><jats:tex-math>$F$</jats:tex-math></jats:alternatives></jats:inline-formula> admitting a Shalika model. We use a modular symbol approach, along the global lines of the work of Ash and Ginzburg, but our results are more definitive because we draw heavily upon the methods used in the recent and separate works of all three authors. By construction, our <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline9.png\" /><jats:tex-math>$p$</jats:tex-math></jats:alternatives></jats:inline-formula>-adic <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline10.png\" /><jats:tex-math>$L$</jats:tex-math></jats:alternatives></jats:inline-formula>-functions are distributions on the Galois group of the maximal abelian extension of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline11.png\" /><jats:tex-math>$F$</jats:tex-math></jats:alternatives></jats:inline-formula> unramified outside <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline12.png\" /><jats:tex-math>$p\\infty$</jats:tex-math></jats:alternatives></jats:inline-formula>. Moreover, we work under a weaker Panchishkine-type condition on <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline13.png\" /><jats:tex-math>$\\Pi _p$</jats:tex-math></jats:alternatives></jats:inline-formula> rather than the full ordinariness condition. Finally, we prove the so-called Manin relations between the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline14.png\" /><jats:tex-math>$p$</jats:tex-math></jats:alternatives></jats:inline-formula>-adic <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline15.png\" /><jats:tex-math>$L$</jats:tex-math></jats:alternatives></jats:inline-formula>-functions at <jats:italic>all</jats:italic> critical points. This has the striking consequence that, given a unitary <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline16.png\" /><jats:tex-math>$\\Pi$</jats:tex-math></jats:alternatives></jats:inline-formula> whose standard <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline17.png\" /><jats:tex-math>$L$</jats:tex-math></jats:alternatives></jats:inline-formula>-function admits at least two critical points, and given a prime <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline18.png\" /><jats:tex-math>$p$</jats:tex-math></jats:alternatives></jats:inline-formula> such that <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline19.png\" /><jats:tex-math>$\\Pi _p$</jats:tex-math></jats:alternatives></jats:inline-formula> is ordinary, the central critical value <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline20.png\" /><jats:tex-math>$L(\\frac {1}{2}, \\Pi \\otimes \\chi )$</jats:tex-math></jats:alternatives></jats:inline-formula> is non-zero for all except finitely many Dirichlet characters <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline21.png\" /><jats:tex-math>$\\chi$</jats:tex-math></jats:alternatives></jats:inline-formula> of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0010437X20007551_inline22.png\" /><jats:tex-math>$p$</jats:tex-math></jats:alternatives></jats:inline-formula>-power conductor.</jats:p>"}],"title":"L-functions of GL(2n): p-adic properties and non-vanishing of twists","keyword":["Algebra and Number Theory"],"user_id":"81636","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0010-437X","1570-5846"]},"year":"2021","publisher":"Wiley","date_created":"2024-04-03T16:58:55Z","date_updated":"2024-04-03T17:13:25Z","_id":"53192","intvolume":"       156","author":[{"last_name":"Dimitrov","full_name":"Dimitrov, Mladen","first_name":"Mladen"},{"first_name":"Fabian","full_name":"Januszewski, Fabian","id":"81636","last_name":"Januszewski"},{"full_name":"Raghuram, A.","first_name":"A.","last_name":"Raghuram"}],"article_type":"original","publication_status":"published","citation":{"chicago":"Dimitrov, Mladen, Fabian Januszewski, and A. Raghuram. “L-Functions of GL(2n): P-Adic Properties and Non-Vanishing of Twists.” <i>Compositio Mathematica</i> 156, no. 12 (2021): 2437–68. <a href=\"https://doi.org/10.1112/s0010437x20007551\">https://doi.org/10.1112/s0010437x20007551</a>.","ieee":"M. Dimitrov, F. Januszewski, and A. Raghuram, “L-functions of GL(2n): p-adic properties and non-vanishing of twists,” <i>Compositio Mathematica</i>, vol. 156, no. 12, pp. 2437–2468, 2021, doi: <a href=\"https://doi.org/10.1112/s0010437x20007551\">10.1112/s0010437x20007551</a>.","ama":"Dimitrov M, Januszewski F, Raghuram A. L-functions of GL(2n): p-adic properties and non-vanishing of twists. <i>Compositio Mathematica</i>. 2021;156(12):2437-2468. doi:<a href=\"https://doi.org/10.1112/s0010437x20007551\">10.1112/s0010437x20007551</a>","apa":"Dimitrov, M., Januszewski, F., &#38; Raghuram, A. (2021). L-functions of GL(2n): p-adic properties and non-vanishing of twists. <i>Compositio Mathematica</i>, <i>156</i>(12), 2437–2468. <a href=\"https://doi.org/10.1112/s0010437x20007551\">https://doi.org/10.1112/s0010437x20007551</a>","short":"M. Dimitrov, F. Januszewski, A. Raghuram, Compositio Mathematica 156 (2021) 2437–2468.","mla":"Dimitrov, Mladen, et al. “L-Functions of GL(2n): P-Adic Properties and Non-Vanishing of Twists.” <i>Compositio Mathematica</i>, vol. 156, no. 12, Wiley, 2021, pp. 2437–68, doi:<a href=\"https://doi.org/10.1112/s0010437x20007551\">10.1112/s0010437x20007551</a>.","bibtex":"@article{Dimitrov_Januszewski_Raghuram_2021, title={L-functions of GL(2n): p-adic properties and non-vanishing of twists}, volume={156}, DOI={<a href=\"https://doi.org/10.1112/s0010437x20007551\">10.1112/s0010437x20007551</a>}, number={12}, journal={Compositio Mathematica}, publisher={Wiley}, author={Dimitrov, Mladen and Januszewski, Fabian and Raghuram, A.}, year={2021}, pages={2437–2468} }"}},{"volume":12,"page":"493-529","issue":"vol. 12 issue 3","publication":"Journal of Writing Research","type":"journal_article","user_id":"14931","keyword":["Literature and Literary Theory","Linguistics and Language","Language and Linguistics","Education"],"title":"Building, emptying out, or dreaming? Action structures and space in students’ metaphors of academic writing","doi":"10.17239/jowr-2021.12.03.01","_id":"31680","date_updated":"2023-02-01T12:14:52Z","publisher":"ARLE (International Association for Research in L1 Education)","date_created":"2022-06-06T13:49:01Z","status":"public","publication_identifier":{"issn":["2030-1006","2294-3307"]},"year":"2021","language":[{"iso":"eng"}],"publication_status":"published","citation":{"apa":"Scharlau, I., Karsten, A., &#38; Rohlfing, K. J. (2021). Building, emptying out, or dreaming? Action structures and space in students’ metaphors of academic writing. <i>Journal of Writing Research</i>, <i>12</i>(vol. 12 issue 3), 493–529. <a href=\"https://doi.org/10.17239/jowr-2021.12.03.01\">https://doi.org/10.17239/jowr-2021.12.03.01</a>","ama":"Scharlau I, Karsten A, Rohlfing KJ. Building, emptying out, or dreaming? Action structures and space in students’ metaphors of academic writing. <i>Journal of Writing Research</i>. 2021;12(vol. 12 issue 3):493-529. doi:<a href=\"https://doi.org/10.17239/jowr-2021.12.03.01\">10.17239/jowr-2021.12.03.01</a>","chicago":"Scharlau, Ingrid, A. Karsten, and Katharina J. Rohlfing. “Building, Emptying out, or Dreaming? Action Structures and Space in Students’ Metaphors of Academic Writing.” <i>Journal of Writing Research</i> 12, no. vol. 12 issue 3 (2021): 493–529. <a href=\"https://doi.org/10.17239/jowr-2021.12.03.01\">https://doi.org/10.17239/jowr-2021.12.03.01</a>.","ieee":"I. Scharlau, A. Karsten, and K. J. Rohlfing, “Building, emptying out, or dreaming? Action structures and space in students’ metaphors of academic writing,” <i>Journal of Writing Research</i>, vol. 12, no. vol. 12 issue 3, pp. 493–529, 2021, doi: <a href=\"https://doi.org/10.17239/jowr-2021.12.03.01\">10.17239/jowr-2021.12.03.01</a>.","mla":"Scharlau, Ingrid, et al. “Building, Emptying out, or Dreaming? Action Structures and Space in Students’ Metaphors of Academic Writing.” <i>Journal of Writing Research</i>, vol. 12, no. vol. 12 issue 3, ARLE (International Association for Research in L1 Education), 2021, pp. 493–529, doi:<a href=\"https://doi.org/10.17239/jowr-2021.12.03.01\">10.17239/jowr-2021.12.03.01</a>.","bibtex":"@article{Scharlau_Karsten_Rohlfing_2021, title={Building, emptying out, or dreaming? Action structures and space in students’ metaphors of academic writing}, volume={12}, DOI={<a href=\"https://doi.org/10.17239/jowr-2021.12.03.01\">10.17239/jowr-2021.12.03.01</a>}, number={vol. 12 issue 3}, journal={Journal of Writing Research}, publisher={ARLE (International Association for Research in L1 Education)}, author={Scharlau, Ingrid and Karsten, A. and Rohlfing, Katharina J.}, year={2021}, pages={493–529} }","short":"I. Scharlau, A. Karsten, K.J. Rohlfing, Journal of Writing Research 12 (2021) 493–529."},"department":[{"_id":"749"},{"_id":"424"}],"author":[{"last_name":"Scharlau","id":"451","first_name":"Ingrid","full_name":"Scharlau, Ingrid","orcid":"0000-0003-2364-9489"},{"first_name":"A.","full_name":"Karsten, A.","last_name":"Karsten"},{"first_name":"Katharina J.","full_name":"Rohlfing, Katharina J.","id":"50352","last_name":"Rohlfing"}],"intvolume":"        12"},{"intvolume":"        90","author":[{"first_name":"Jürgen","full_name":"Klüners, Jürgen","last_name":"Klüners","id":"21202"},{"last_name":"Komatsu","first_name":"Toru","full_name":"Komatsu, Toru"}],"department":[{"_id":"102"}],"citation":{"bibtex":"@article{Klüners_Komatsu_2021, title={Imaginary multiquadratic number fields with class group of exponent $3$ and $5$}, volume={90}, DOI={<a href=\"https://doi.org/10.1090/mcom/3609\">10.1090/mcom/3609</a>}, number={329}, journal={Mathematics of Computation}, publisher={American Mathematical Society (AMS)}, author={Klüners, Jürgen and Komatsu, Toru}, year={2021}, pages={1483–1497} }","mla":"Klüners, Jürgen, and Toru Komatsu. “Imaginary Multiquadratic Number Fields with Class Group of Exponent $3$ and $5$.” <i>Mathematics of Computation</i>, vol. 90, no. 329, American Mathematical Society (AMS), 2021, pp. 1483–97, doi:<a href=\"https://doi.org/10.1090/mcom/3609\">10.1090/mcom/3609</a>.","short":"J. Klüners, T. Komatsu, Mathematics of Computation 90 (2021) 1483–1497.","ama":"Klüners J, Komatsu T. Imaginary multiquadratic number fields with class group of exponent $3$ and $5$. <i>Mathematics of Computation</i>. 2021;90(329):1483-1497. doi:<a href=\"https://doi.org/10.1090/mcom/3609\">10.1090/mcom/3609</a>","apa":"Klüners, J., &#38; Komatsu, T. (2021). Imaginary multiquadratic number fields with class group of exponent $3$ and $5$. <i>Mathematics of Computation</i>, <i>90</i>(329), 1483–1497. <a href=\"https://doi.org/10.1090/mcom/3609\">https://doi.org/10.1090/mcom/3609</a>","ieee":"J. Klüners and T. Komatsu, “Imaginary multiquadratic number fields with class group of exponent $3$ and $5$,” <i>Mathematics of Computation</i>, vol. 90, no. 329, pp. 1483–1497, 2021, doi: <a href=\"https://doi.org/10.1090/mcom/3609\">10.1090/mcom/3609</a>.","chicago":"Klüners, Jürgen, and Toru Komatsu. “Imaginary Multiquadratic Number Fields with Class Group of Exponent $3$ and $5$.” <i>Mathematics of Computation</i> 90, no. 329 (2021): 1483–97. <a href=\"https://doi.org/10.1090/mcom/3609\">https://doi.org/10.1090/mcom/3609</a>."},"publication_status":"published","language":[{"iso":"eng"}],"year":"2021","publication_identifier":{"issn":["0025-5718","1088-6842"]},"status":"public","date_created":"2022-12-22T10:48:44Z","publisher":"American Mathematical Society (AMS)","date_updated":"2023-03-06T08:57:45Z","_id":"34840","abstract":[{"lang":"eng","text":"In this paper we obtain a complete list of imaginary n-quadratic fields with class groups of exponent 3 and 5 under ERH for every positive integer n where an n-quadratic field is a number field of degree 2ⁿ represented as the composite of n quadratic fields. "}],"doi":"10.1090/mcom/3609","title":"Imaginary multiquadratic number fields with class group of exponent $3$ and $5$","external_id":{"arxiv":["2004.03308v2"]},"keyword":["Applied Mathematics","Computational Mathematics","Algebra and Number Theory"],"user_id":"93826","type":"journal_article","publication":"Mathematics of Computation","issue":"329","page":"1483-1497","volume":90}]
