[{"citation":{"chicago":"Sommerauer, Peter, and Oliver Müller. “Augmented Reality in Informal Learning Environments: A Field Experiment in a Mathematics Exhibition.” <i>Computers and Education</i>, 2014, 59--68. <a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">https://doi.org/10.1016/j.compedu.2014.07.013</a>.","ieee":"P. Sommerauer and O. Müller, “Augmented reality in informal learning environments: A field experiment in a mathematics exhibition,” <i>Computers and Education</i>, pp. 59--68, 2014.","ama":"Sommerauer P, Müller O. Augmented reality in informal learning environments: A field experiment in a mathematics exhibition. <i>Computers and Education</i>. 2014:59--68. doi:<a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">10.1016/j.compedu.2014.07.013</a>","apa":"Sommerauer, P., &#38; Müller, O. (2014). Augmented reality in informal learning environments: A field experiment in a mathematics exhibition. <i>Computers and Education</i>, 59--68. <a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">https://doi.org/10.1016/j.compedu.2014.07.013</a>","short":"P. Sommerauer, O. Müller, Computers and Education (2014) 59--68.","mla":"Sommerauer, Peter, and Oliver Müller. “Augmented Reality in Informal Learning Environments: A Field Experiment in a Mathematics Exhibition.” <i>Computers and Education</i>, 2014, pp. 59--68, doi:<a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">10.1016/j.compedu.2014.07.013</a>.","bibtex":"@article{Sommerauer_Müller_2014, title={Augmented reality in informal learning environments: A field experiment in a mathematics exhibition}, DOI={<a href=\"https://doi.org/10.1016/j.compedu.2014.07.013\">10.1016/j.compedu.2014.07.013</a>}, journal={Computers and Education}, author={Sommerauer, Peter and Müller, Oliver}, year={2014}, pages={59--68} }"},"page":"59--68","year":"2014","publication_identifier":{"isbn":["0360-1315"],"issn":["03601315"]},"doi":"10.1016/j.compedu.2014.07.013","title":"Augmented reality in informal learning environments: A field experiment in a mathematics exhibition","date_created":"2018-10-12T08:30:44Z","author":[{"first_name":"Peter","last_name":"Sommerauer","full_name":"Sommerauer, Peter"},{"first_name":"Oliver","full_name":"Müller, Oliver","last_name":"Müller"}],"date_updated":"2022-01-06T07:01:18Z","status":"public","type":"journal_article","publication":"Computers and Education","extern":"1","language":[{"iso":"eng"}],"keyword":["Augmented reality","Cognitive theory of multimedia learning","Field experiment","Informal learning","Museum"],"user_id":"72849","_id":"4697"},{"doi":"10.1112/s1461157013000302","author":[{"last_name":"Fieker","full_name":"Fieker, Claus","first_name":"Claus"},{"full_name":"Klüners, Jürgen","id":"21202","last_name":"Klüners","first_name":"Jürgen"}],"volume":17,"date_updated":"2023-03-06T09:43:56Z","citation":{"short":"C. Fieker, J. Klüners, LMS Journal of Computation and Mathematics 17 (2014) 141–158.","mla":"Fieker, Claus, and Jürgen Klüners. “Computation of Galois Groups of Rational Polynomials.” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, Wiley, 2014, pp. 141–58, doi:<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>.","bibtex":"@article{Fieker_Klüners_2014, title={Computation of Galois groups of rational polynomials}, volume={17}, DOI={<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>}, number={1}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Fieker, Claus and Klüners, Jürgen}, year={2014}, pages={141–158} }","apa":"Fieker, C., &#38; Klüners, J. (2014). Computation of Galois groups of rational polynomials. <i>LMS Journal of Computation and Mathematics</i>, <i>17</i>(1), 141–158. <a href=\"https://doi.org/10.1112/s1461157013000302\">https://doi.org/10.1112/s1461157013000302</a>","ama":"Fieker C, Klüners J. Computation of Galois groups of rational polynomials. <i>LMS Journal of Computation and Mathematics</i>. 2014;17(1):141-158. doi:<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>","chicago":"Fieker, Claus, and Jürgen Klüners. “Computation of Galois Groups of Rational Polynomials.” <i>LMS Journal of Computation and Mathematics</i> 17, no. 1 (2014): 141–58. <a href=\"https://doi.org/10.1112/s1461157013000302\">https://doi.org/10.1112/s1461157013000302</a>.","ieee":"C. Fieker and J. Klüners, “Computation of Galois groups of rational polynomials,” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, pp. 141–158, 2014, doi: <a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>."},"page":"141-158","intvolume":"        17","publication_status":"published","publication_identifier":{"issn":["1461-1570"]},"user_id":"93826","department":[{"_id":"102"}],"_id":"34845","status":"public","type":"journal_article","title":"Computation of Galois groups of rational polynomials","date_created":"2022-12-22T10:53:44Z","publisher":"Wiley","year":"2014","issue":"1","language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","General Mathematics"],"external_id":{"arxiv":["1211.3588"]},"abstract":[{"lang":"eng","text":"Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial, is a very old problem. Currently, the best algorithmic solution is Stauduhar’s method. Computationally, one of the key challenges in the application of Stauduhar’s method is to find, for a given pair of groups H<G, a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm."}],"publication":"LMS Journal of Computation and Mathematics"},{"type":"journal_article","status":"public","department":[{"_id":"102"}],"user_id":"93826","_id":"42793","extern":"1","publication_identifier":{"issn":["0022-314X"]},"publication_status":"published","page":"375-393","intvolume":"       136","citation":{"ama":"Kirschmer M. One-class genera of maximal integral quadratic forms. <i>Journal of Number Theory</i>. 2014;136:375-393. doi:<a href=\"https://doi.org/10.1016/j.jnt.2013.10.007\">10.1016/j.jnt.2013.10.007</a>","ieee":"M. Kirschmer, “One-class genera of maximal integral quadratic forms,” <i>Journal of Number Theory</i>, vol. 136, pp. 375–393, 2014, doi: <a href=\"https://doi.org/10.1016/j.jnt.2013.10.007\">10.1016/j.jnt.2013.10.007</a>.","chicago":"Kirschmer, Markus. “One-Class Genera of Maximal Integral Quadratic Forms.” <i>Journal of Number Theory</i> 136 (2014): 375–93. <a href=\"https://doi.org/10.1016/j.jnt.2013.10.007\">https://doi.org/10.1016/j.jnt.2013.10.007</a>.","apa":"Kirschmer, M. (2014). One-class genera of maximal integral quadratic forms. <i>Journal of Number Theory</i>, <i>136</i>, 375–393. <a href=\"https://doi.org/10.1016/j.jnt.2013.10.007\">https://doi.org/10.1016/j.jnt.2013.10.007</a>","short":"M. Kirschmer, Journal of Number Theory 136 (2014) 375–393.","mla":"Kirschmer, Markus. “One-Class Genera of Maximal Integral Quadratic Forms.” <i>Journal of Number Theory</i>, vol. 136, Elsevier BV, 2014, pp. 375–93, doi:<a href=\"https://doi.org/10.1016/j.jnt.2013.10.007\">10.1016/j.jnt.2013.10.007</a>.","bibtex":"@article{Kirschmer_2014, title={One-class genera of maximal integral quadratic forms}, volume={136}, DOI={<a href=\"https://doi.org/10.1016/j.jnt.2013.10.007\">10.1016/j.jnt.2013.10.007</a>}, journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Kirschmer, Markus}, year={2014}, pages={375–393} }"},"volume":136,"author":[{"first_name":"Markus","last_name":"Kirschmer","id":"82258","full_name":"Kirschmer, Markus"}],"date_updated":"2023-04-04T09:13:29Z","doi":"10.1016/j.jnt.2013.10.007","publication":"Journal of Number Theory","abstract":[{"lang":"eng","text":"Suppose Q is a definite quadratic form on a vector space V over some totally real field K ≠ Q. Then the maximal integral Zₖ-lattices in (V,Q) are locally isometric everywhere and hence form a single genus. We enumerate all orthogonal spaces (V,Q) of dimension at least 3, where the corresponding genus of maximal integral lattices consists of a single isometry class. It turns out, there are 471 such genera. Moreover, the dimension of V and the degree of K are bounded by 6 and 5 respectively. This classification also yields all maximal quaternion orders of type number one."}],"language":[{"iso":"eng"}],"keyword":["Algebra and Number Theory"],"year":"2014","date_created":"2023-03-07T08:29:34Z","publisher":"Elsevier BV","title":"One-class genera of maximal integral quadratic forms"},{"intvolume":"        17","page":"345-359","citation":{"ama":"Eick B, Kirschmer M, Leedham-Green C. The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R). <i>LMS Journal of Computation and Mathematics</i>. 2014;17(1):345-359. doi:<a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>","ieee":"B. Eick, M. Kirschmer, and C. Leedham-Green, “The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R),” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, pp. 345–359, 2014, doi: <a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>.","chicago":"Eick, B., Markus Kirschmer, and C. Leedham-Green. “The Constructive Membership Problem for Discrete Free Subgroups of Rank 2 of SL₂(R).” <i>LMS Journal of Computation and Mathematics</i> 17, no. 1 (2014): 345–59. <a href=\"https://doi.org/10.1112/s1461157014000047\">https://doi.org/10.1112/s1461157014000047</a>.","apa":"Eick, B., Kirschmer, M., &#38; Leedham-Green, C. (2014). The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R). <i>LMS Journal of Computation and Mathematics</i>, <i>17</i>(1), 345–359. <a href=\"https://doi.org/10.1112/s1461157014000047\">https://doi.org/10.1112/s1461157014000047</a>","short":"B. Eick, M. Kirschmer, C. Leedham-Green, LMS Journal of Computation and Mathematics 17 (2014) 345–359.","bibtex":"@article{Eick_Kirschmer_Leedham-Green_2014, title={The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R)}, volume={17}, DOI={<a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>}, number={1}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Eick, B. and Kirschmer, Markus and Leedham-Green, C.}, year={2014}, pages={345–359} }","mla":"Eick, B., et al. “The Constructive Membership Problem for Discrete Free Subgroups of Rank 2 of SL₂(R).” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, Wiley, 2014, pp. 345–59, doi:<a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>."},"publication_identifier":{"issn":["1461-1570"]},"publication_status":"published","doi":"10.1112/s1461157014000047","volume":17,"author":[{"last_name":"Eick","full_name":"Eick, B.","first_name":"B."},{"last_name":"Kirschmer","id":"82258","full_name":"Kirschmer, Markus","first_name":"Markus"},{"first_name":"C.","last_name":"Leedham-Green","full_name":"Leedham-Green, C."}],"date_updated":"2023-04-04T09:31:17Z","status":"public","type":"journal_article","extern":"1","department":[{"_id":"102"}],"user_id":"93826","_id":"42794","year":"2014","issue":"1","title":"The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R)","date_created":"2023-03-07T08:30:15Z","publisher":"Wiley","abstract":[{"text":"We exhibit a practical algorithm for solving the constructive membership problem for discrete free subgroups of rank 2 in PSL₂(R) or SL₂(R). This algorithm, together with methods for checking whether a two-generator subgroup of PSL₂(R) or SL₂(R) is discrete and free, have been implemented in Magma for groups defined over real algebraic number fields.","lang":"eng"}],"publication":"LMS Journal of Computation and Mathematics","language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","General Mathematics"]},{"type":"journal_article","publication":"IEEE Transactions on Computers","status":"public","_id":"46266","user_id":"78614","department":[{"_id":"48"}],"keyword":["Computational Theory and Mathematics","Hardware and Architecture","Theoretical Computer Science","Software"],"extern":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0018-9340"]},"year":"2014","citation":{"mla":"Alizadeh, Bijan, et al. “A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs.” <i>IEEE Transactions on Computers</i>, Institute of Electrical and Electronics Engineers (IEEE), 2014, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>.","short":"B. Alizadeh, P. Behnam, S. Sadeghi-Kohan, IEEE Transactions on Computers (2014) 1–1.","bibtex":"@article{Alizadeh_Behnam_Sadeghi-Kohan_2014, title={A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs}, DOI={<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Alizadeh, Bijan and Behnam, Payman and Sadeghi-Kohan, Somayeh}, year={2014}, pages={1–1} }","apa":"Alizadeh, B., Behnam, P., &#38; Sadeghi-Kohan, S. (2014). A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. <i>IEEE Transactions on Computers</i>, 1–1. <a href=\"https://doi.org/10.1109/tc.2014.2329687\">https://doi.org/10.1109/tc.2014.2329687</a>","chicago":"Alizadeh, Bijan, Payman Behnam, and Somayeh Sadeghi-Kohan. “A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs.” <i>IEEE Transactions on Computers</i>, 2014, 1–1. <a href=\"https://doi.org/10.1109/tc.2014.2329687\">https://doi.org/10.1109/tc.2014.2329687</a>.","ieee":"B. Alizadeh, P. Behnam, and S. Sadeghi-Kohan, “A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs,” <i>IEEE Transactions on Computers</i>, pp. 1–1, 2014, doi: <a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>.","ama":"Alizadeh B, Behnam P, Sadeghi-Kohan S. A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. <i>IEEE Transactions on Computers</i>. Published online 2014:1-1. doi:<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>"},"page":"1-1","date_updated":"2023-08-02T11:32:37Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","author":[{"full_name":"Alizadeh, Bijan","last_name":"Alizadeh","first_name":"Bijan"},{"first_name":"Payman","last_name":"Behnam","full_name":"Behnam, Payman"},{"first_name":"Somayeh","last_name":"Sadeghi-Kohan","orcid":"https://orcid.org/0000-0001-7246-0610","id":"78614","full_name":"Sadeghi-Kohan, Somayeh"}],"date_created":"2023-08-02T11:15:22Z","title":"A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs","doi":"10.1109/tc.2014.2329687"},{"extern":"1","keyword":["attitudes","teaching and learning","studying","higher education institution","theory of planned behavior","instrument development"],"department":[{"_id":"208"},{"_id":"282"}],"user_id":"51057","_id":"4478","status":"public","abstract":[{"text":"The purpose of the research was to develop and validate an instrument for the assessment of attitudes towards the study environment in higher education contexts. The questionnaire is designed to measure students' attitudes towards two particular objects: the university (or Higher Education Institution) and the process of studying. Five studies at two different universities were conducted to develop and validate the Attitudes towards the Study Environment Questionnaire (ASEQ). In total, 1640 students filled in the questionnaire. Reliability tests and exploratory factor analysis as well as confirmatory factor analysis showed satisfactory psychometric characteristics of the ASEQ. Each part of the questionnaire is internally consistent and construct validity of the scales is supported by correlations with other constructs as assumed by current theories: Positive attitudinal constructs (normative behavior, autonomy, joy, self-efficacy, and task value) are positively related to intrinsic motivation and the expected study performance while anxiety is negatively related to these constructs. \r\nSince attitudes towards the study situation are connected to student engagement and motivation, the study contributes to the theory of student learning by providing a validated instrument to assess attitudes. Thus, the ASEQ can support further research on student performance and development by providing an instrument for the hitherto neglected but nonetheless extremely relevant domain of attitudes. Also, the questionnaire can be used as a diagnostic instrument for higher education faculty and administration to trace students' attitudinal development over time - a factor of prime importance for student socialization during the introductory phase of studying.","lang":"eng"}],"type":"conference","conference":{"name":"15th Biennial EARLI Conference","start_date":"2013-08-27","end_date":"2013-08-31","location":"München "},"title":"On the assessment of attitudes towards the study process and the university: Attitudes towards the Study Environment Questionnaire (ASEQ)","author":[{"first_name":"Taiga","last_name":"Brahm","full_name":"Brahm, Taiga"},{"first_name":"Tobias","full_name":"Jenert, Tobias","id":"71994","last_name":"Jenert","orcid":" https://orcid.org/0000-0001-9262-5646"},{"first_name":"Dieter","full_name":"Euler, Dieter","last_name":"Euler"}],"date_created":"2018-09-19T08:22:51Z","date_updated":"2022-01-06T07:01:06Z","publisher":"EARLI European Association for Research on Learning and Instruction","citation":{"chicago":"Brahm, Taiga, Tobias Jenert, and Dieter Euler. “On the Assessment of Attitudes towards the Study Process and the University: Attitudes towards the Study Environment Questionnaire (ASEQ).” EARLI European Association for Research on Learning and Instruction, 2013.","ieee":"T. Brahm, T. Jenert, and D. Euler, “On the assessment of attitudes towards the study process and the university: Attitudes towards the Study Environment Questionnaire (ASEQ),” presented at the 15th Biennial EARLI Conference, München , 2013.","ama":"Brahm T, Jenert T, Euler D. On the assessment of attitudes towards the study process and the university: Attitudes towards the Study Environment Questionnaire (ASEQ). In: EARLI European Association for Research on Learning and Instruction; 2013.","apa":"Brahm, T., Jenert, T., &#38; Euler, D. (2013). On the assessment of attitudes towards the study process and the university: Attitudes towards the Study Environment Questionnaire (ASEQ). Presented at the 15th Biennial EARLI Conference, München : EARLI European Association for Research on Learning and Instruction.","bibtex":"@inproceedings{Brahm_Jenert_Euler_2013, title={On the assessment of attitudes towards the study process and the university: Attitudes towards the Study Environment Questionnaire (ASEQ)}, publisher={EARLI European Association for Research on Learning and Instruction}, author={Brahm, Taiga and Jenert, Tobias and Euler, Dieter}, year={2013} }","short":"T. Brahm, T. Jenert, D. Euler, in: EARLI European Association for Research on Learning and Instruction, 2013.","mla":"Brahm, Taiga, et al. <i>On the Assessment of Attitudes towards the Study Process and the University: Attitudes towards the Study Environment Questionnaire (ASEQ)</i>. EARLI European Association for Research on Learning and Instruction, 2013."},"year":"2013"},{"citation":{"ama":"Jenert T, Brahm T. Die Entwicklung studien-und hochschulbezogener Einstellungen an einer Wirtschaftsuniversität: eine qualitative Längsschnittstudie. In: Institut für Psychologie; 2013.","ieee":"T. Jenert and T. Brahm, “Die Entwicklung studien-und hochschulbezogener Einstellungen an einer Wirtschaftsuniversität: eine qualitative Längsschnittstudie,” presented at the 14. Fachgruppentagung Pädagogische Psychologie der Deutschen Gesellschaft für Psychologie, Hildesheim, 2013.","chicago":"Jenert, Tobias, and Taiga Brahm. “Die Entwicklung Studien-Und Hochschulbezogener Einstellungen an Einer Wirtschaftsuniversität: Eine Qualitative Längsschnittstudie.” Institut für Psychologie, 2013.","mla":"Jenert, Tobias, and Taiga Brahm. <i>Die Entwicklung Studien-Und Hochschulbezogener Einstellungen an Einer Wirtschaftsuniversität: Eine Qualitative Längsschnittstudie</i>. Institut für Psychologie, 2013.","short":"T. Jenert, T. Brahm, in: Institut für Psychologie, 2013.","bibtex":"@inproceedings{Jenert_Brahm_2013, title={Die Entwicklung studien-und hochschulbezogener Einstellungen an einer Wirtschaftsuniversität: eine qualitative Längsschnittstudie}, publisher={Institut für Psychologie}, author={Jenert, Tobias and Brahm, Taiga}, year={2013} }","apa":"Jenert, T., &#38; Brahm, T. (2013). Die Entwicklung studien-und hochschulbezogener Einstellungen an einer Wirtschaftsuniversität: eine qualitative Längsschnittstudie. Presented at the 14. Fachgruppentagung Pädagogische Psychologie der Deutschen Gesellschaft für Psychologie, Hildesheim: Institut für Psychologie."},"year":"2013","author":[{"orcid":" https://orcid.org/0000-0001-9262-5646","last_name":"Jenert","full_name":"Jenert, Tobias","id":"71994","first_name":"Tobias"},{"first_name":"Taiga","full_name":"Brahm, Taiga","last_name":"Brahm"}],"date_created":"2018-09-19T08:29:59Z","date_updated":"2022-01-06T07:01:06Z","publisher":"Institut für Psychologie","conference":{"name":"14. Fachgruppentagung Pädagogische Psychologie der Deutschen Gesellschaft für Psychologie","start_date":"2013-09-23","end_date":"2013-09-25","location":"Hildesheim"},"title":"Die Entwicklung studien-und hochschulbezogener Einstellungen an einer Wirtschaftsuniversität: eine qualitative Längsschnittstudie","type":"conference","status":"public","abstract":[{"text":"Die vorliegende Untersuchung an der Universität St. Gallen soll Erkenntnisse über die Verläufe der Einstellungsveränderungen der Studierenden geben (vgl. Brahm & Jenert, 2012). Basierend auf der Theorie des geplanten Verhaltens (Ajzen & Fishbein, 1980) werden drei Forschungsfragen adressiert: (1) Gibt es typische Pfade der Einstellungsentwicklung? (2) Wie wird das normative Verhalten von Mitstudierenden und anderen Personen wahrgenommen? (3) Welche Erfahrungen beeinflussen die Entwicklung? Zur Beantwortung dieser Fragen wurde über das erste Studienjahr hinweg eine Interviewserie mit 13 Studierenden durchgeführt. Die Datenanalyse mithilfe grafischer Case Histories zeigt, dass die Einstellungen der Probanden über die Zeit differenzierter werden. Zudem gibt es Widersprüche zwischen den Einstellungen und dem wahrgenommenen normativen Verhalten. Dabei ist die Einstellungsentwicklung von konkreten Ereignissen geprägt und kann damit durch strukturelle Interventionen beeinflusst werden.","lang":"ger"}],"user_id":"51057","department":[{"_id":"208"},{"_id":"282"}],"_id":"4481","extern":"1","keyword":["student attitudes","theory of planned behaviour","Einstellungsentwicklung","student motivation"]},{"type":"conference","publication":"European Conference on Information Systems","status":"public","_id":"4698","user_id":"72849","keyword":["Abstraction","Affordances","Design Science Research","Design Theory","Information Systems Development","Reflection","Theorizing"],"language":[{"iso":"eng"}],"extern":"1","year":"2013","citation":{"ama":"Gregor S, Müller O, Seidel S. Reflection, abstraction and theorizing in design and development research. In: <i>European Conference on Information Systems</i>. ; 2013.","ieee":"S. Gregor, O. Müller, and S. Seidel, “Reflection, abstraction and theorizing in design and development research,” in <i>European Conference on Information Systems</i>, 2013.","chicago":"Gregor, Shirley, Oliver Müller, and Stefan Seidel. “Reflection, Abstraction and Theorizing in Design and Development Research.” In <i>European Conference on Information Systems</i>, 2013.","bibtex":"@inproceedings{Gregor_Müller_Seidel_2013, title={Reflection, abstraction and theorizing in design and development research}, booktitle={European Conference on Information Systems}, author={Gregor, Shirley and Müller, Oliver and Seidel, Stefan}, year={2013} }","mla":"Gregor, Shirley, et al. “Reflection, Abstraction and Theorizing in Design and Development Research.” <i>European Conference on Information Systems</i>, 2013.","short":"S. Gregor, O. Müller, S. Seidel, in: European Conference on Information Systems, 2013.","apa":"Gregor, S., Müller, O., &#38; Seidel, S. (2013). Reflection, abstraction and theorizing in design and development research. In <i>European Conference on Information Systems</i>."},"date_updated":"2022-01-06T07:01:18Z","author":[{"last_name":"Gregor","full_name":"Gregor, Shirley","first_name":"Shirley"},{"last_name":"Müller","full_name":"Müller, Oliver","id":"72849","first_name":"Oliver"},{"first_name":"Stefan","last_name":"Seidel","full_name":"Seidel, Stefan"}],"date_created":"2018-10-12T08:30:49Z","title":"Reflection, abstraction and theorizing in design and development research","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2013_cr/74/"}]},{"keyword":["Bayes methods","Gaussian processes","convolution","decision theory","decoding","noise","reverberation","speech coding","speech recognition","Bayesian decision rule","GMM","Gaussian mixture models","additive noise scenarios","automatic speech recognition systems","convolutive noise scenarios","decoding approach","mathematical framework","reverberant environments","significance decoding","speech feature estimation","uncertainty-of-observation techniques","Hidden Markov models","Maximum likelihood decoding","Noise","Speech","Speech recognition","Uncertainty","Uncertainty-of-observation","modified imputation","noise robust speech recognition","significance decoding","uncertainty decoding"],"language":[{"iso":"eng"}],"_id":"11716","department":[{"_id":"54"}],"user_id":"44006","abstract":[{"lang":"eng","text":"The accuracy of automatic speech recognition systems in noisy and reverberant environments can be improved notably by exploiting the uncertainty of the estimated speech features using so-called uncertainty-of-observation techniques. In this paper, we introduce a new Bayesian decision rule that can serve as a mathematical framework from which both known and new uncertainty-of-observation techniques can be either derived or approximated. The new decision rule in its direct form leads to the new significance decoding approach for Gaussian mixture models, which results in better performance compared to standard uncertainty-of-observation techniques in different additive and convolutive noise scenarios."}],"status":"public","publication":"Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on","type":"conference","title":"GMM-based significance decoding","doi":"10.1109/ICASSP.2013.6638984","date_updated":"2022-01-06T06:51:07Z","author":[{"full_name":"Abdelaziz, Ahmed H.","last_name":"Abdelaziz","first_name":"Ahmed H."},{"last_name":"Zeiler","full_name":"Zeiler, Steffen","first_name":"Steffen"},{"first_name":"Dorothea","full_name":"Kolossa, Dorothea","last_name":"Kolossa"},{"first_name":"Volker","last_name":"Leutnant","full_name":"Leutnant, Volker"},{"full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_created":"2019-07-12T05:26:53Z","year":"2013","page":"6827-6831","citation":{"apa":"Abdelaziz, A. H., Zeiler, S., Kolossa, D., Leutnant, V., &#38; Haeb-Umbach, R. (2013). GMM-based significance decoding. In <i>Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on</i> (pp. 6827–6831). <a href=\"https://doi.org/10.1109/ICASSP.2013.6638984\">https://doi.org/10.1109/ICASSP.2013.6638984</a>","bibtex":"@inproceedings{Abdelaziz_Zeiler_Kolossa_Leutnant_Haeb-Umbach_2013, title={GMM-based significance decoding}, DOI={<a href=\"https://doi.org/10.1109/ICASSP.2013.6638984\">10.1109/ICASSP.2013.6638984</a>}, booktitle={Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on}, author={Abdelaziz, Ahmed H. and Zeiler, Steffen and Kolossa, Dorothea and Leutnant, Volker and Haeb-Umbach, Reinhold}, year={2013}, pages={6827–6831} }","mla":"Abdelaziz, Ahmed H., et al. “GMM-Based Significance Decoding.” <i>Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference On</i>, 2013, pp. 6827–31, doi:<a href=\"https://doi.org/10.1109/ICASSP.2013.6638984\">10.1109/ICASSP.2013.6638984</a>.","short":"A.H. Abdelaziz, S. Zeiler, D. Kolossa, V. Leutnant, R. Haeb-Umbach, in: Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference On, 2013, pp. 6827–6831.","ieee":"A. H. Abdelaziz, S. Zeiler, D. Kolossa, V. Leutnant, and R. Haeb-Umbach, “GMM-based significance decoding,” in <i>Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on</i>, 2013, pp. 6827–6831.","chicago":"Abdelaziz, Ahmed H., Steffen Zeiler, Dorothea Kolossa, Volker Leutnant, and Reinhold Haeb-Umbach. “GMM-Based Significance Decoding.” In <i>Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference On</i>, 6827–31, 2013. <a href=\"https://doi.org/10.1109/ICASSP.2013.6638984\">https://doi.org/10.1109/ICASSP.2013.6638984</a>.","ama":"Abdelaziz AH, Zeiler S, Kolossa D, Leutnant V, Haeb-Umbach R. GMM-based significance decoding. In: <i>Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference On</i>. ; 2013:6827-6831. doi:<a href=\"https://doi.org/10.1109/ICASSP.2013.6638984\">10.1109/ICASSP.2013.6638984</a>"},"publication_identifier":{"issn":["1520-6149"]}},{"publication":"38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"In this paper we present a speech presence probability (SPP) estimation algorithmwhich exploits both temporal and spectral correlations of speech. To this end, the SPP estimation is formulated as the posterior probability estimation of the states of a two-dimensional (2D) Hidden Markov Model (HMM). We derive an iterative algorithm to decode the 2D-HMM which is based on the turbo principle. The experimental results show that indeed the SPP estimates improve from iteration to iteration, and further clearly outperform another state-of-the-art SPP estimation algorithm."}],"department":[{"_id":"54"}],"user_id":"44006","_id":"11917","language":[{"iso":"eng"}],"keyword":["correlation methods","estimation theory","hidden Markov models","iterative methods","probability","spectral analysis","speech processing","2D HMM","SPP estimates","iterative algorithm","posterior probability estimation","spectral correlation","speech presence probability estimation","state-of-the-art SPP estimation algorithm","temporal correlation","turbo principle","two-dimensional hidden Markov model","Correlation","Decoding","Estimation","Iterative decoding","Noise","Speech","Vectors"],"publication_identifier":{"issn":["1520-6149"]},"page":"863-867","citation":{"apa":"Vu, D. H. T., &#38; Haeb-Umbach, R. (2013). Using the turbo principle for exploiting temporal and spectral correlations in speech presence probability estimation. In <i>38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)</i> (pp. 863–867). <a href=\"https://doi.org/10.1109/ICASSP.2013.6637771\">https://doi.org/10.1109/ICASSP.2013.6637771</a>","bibtex":"@inproceedings{Vu_Haeb-Umbach_2013, title={Using the turbo principle for exploiting temporal and spectral correlations in speech presence probability estimation}, DOI={<a href=\"https://doi.org/10.1109/ICASSP.2013.6637771\">10.1109/ICASSP.2013.6637771</a>}, booktitle={38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)}, author={Vu, Dang Hai Tran and Haeb-Umbach, Reinhold}, year={2013}, pages={863–867} }","short":"D.H.T. Vu, R. Haeb-Umbach, in: 38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013), 2013, pp. 863–867.","mla":"Vu, Dang Hai Tran, and Reinhold Haeb-Umbach. “Using the Turbo Principle for Exploiting Temporal and Spectral Correlations in Speech Presence Probability Estimation.” <i>38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)</i>, 2013, pp. 863–67, doi:<a href=\"https://doi.org/10.1109/ICASSP.2013.6637771\">10.1109/ICASSP.2013.6637771</a>.","chicago":"Vu, Dang Hai Tran, and Reinhold Haeb-Umbach. “Using the Turbo Principle for Exploiting Temporal and Spectral Correlations in Speech Presence Probability Estimation.” In <i>38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)</i>, 863–67, 2013. <a href=\"https://doi.org/10.1109/ICASSP.2013.6637771\">https://doi.org/10.1109/ICASSP.2013.6637771</a>.","ieee":"D. H. T. Vu and R. Haeb-Umbach, “Using the turbo principle for exploiting temporal and spectral correlations in speech presence probability estimation,” in <i>38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)</i>, 2013, pp. 863–867.","ama":"Vu DHT, Haeb-Umbach R. Using the turbo principle for exploiting temporal and spectral correlations in speech presence probability estimation. In: <i>38th International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013)</i>. ; 2013:863-867. doi:<a href=\"https://doi.org/10.1109/ICASSP.2013.6637771\">10.1109/ICASSP.2013.6637771</a>"},"year":"2013","author":[{"first_name":"Dang Hai Tran","last_name":"Vu","full_name":"Vu, Dang Hai Tran"},{"last_name":"Haeb-Umbach","id":"242","full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold"}],"date_created":"2019-07-12T05:30:45Z","date_updated":"2022-01-06T06:51:12Z","doi":"10.1109/ICASSP.2013.6637771","title":"Using the turbo principle for exploiting temporal and spectral correlations in speech presence probability estimation"},{"publication_identifier":{"issn":["0010-437X","1570-5846"]},"publication_status":"published","issue":"8","year":"2013","page":"1381-1400","intvolume":"       149","citation":{"bibtex":"@article{Rösler_Koornwinder_Voit_2013, title={Limit transition between hypergeometric functions of type BC and type A}, volume={149}, DOI={<a href=\"https://doi.org/10.1112/s0010437x13007045\">10.1112/s0010437x13007045</a>}, number={8}, journal={Compositio Mathematica}, publisher={Wiley}, author={Rösler, Margit and Koornwinder, Tom and Voit, Michael}, year={2013}, pages={1381–1400} }","mla":"Rösler, Margit, et al. “Limit Transition between Hypergeometric Functions of Type BC and Type A.” <i>Compositio Mathematica</i>, vol. 149, no. 8, Wiley, 2013, pp. 1381–400, doi:<a href=\"https://doi.org/10.1112/s0010437x13007045\">10.1112/s0010437x13007045</a>.","short":"M. Rösler, T. Koornwinder, M. Voit, Compositio Mathematica 149 (2013) 1381–1400.","apa":"Rösler, M., Koornwinder, T., &#38; Voit, M. (2013). Limit transition between hypergeometric functions of type BC and type A. <i>Compositio Mathematica</i>, <i>149</i>(8), 1381–1400. <a href=\"https://doi.org/10.1112/s0010437x13007045\">https://doi.org/10.1112/s0010437x13007045</a>","ama":"Rösler M, Koornwinder T, Voit M. Limit transition between hypergeometric functions of type BC and type A. <i>Compositio Mathematica</i>. 2013;149(8):1381-1400. doi:<a href=\"https://doi.org/10.1112/s0010437x13007045\">10.1112/s0010437x13007045</a>","chicago":"Rösler, Margit, Tom Koornwinder, and Michael Voit. “Limit Transition between Hypergeometric Functions of Type BC and Type A.” <i>Compositio Mathematica</i> 149, no. 8 (2013): 1381–1400. <a href=\"https://doi.org/10.1112/s0010437x13007045\">https://doi.org/10.1112/s0010437x13007045</a>.","ieee":"M. Rösler, T. Koornwinder, and M. Voit, “Limit transition between hypergeometric functions of type BC and type A,” <i>Compositio Mathematica</i>, vol. 149, no. 8, pp. 1381–1400, 2013, doi: <a href=\"https://doi.org/10.1112/s0010437x13007045\">10.1112/s0010437x13007045</a>."},"date_updated":"2023-01-24T22:15:13Z","publisher":"Wiley","volume":149,"author":[{"full_name":"Rösler, Margit","id":"37390","last_name":"Rösler","first_name":"Margit"},{"first_name":"Tom","full_name":"Koornwinder, Tom","last_name":"Koornwinder"},{"full_name":"Voit, Michael","last_name":"Voit","first_name":"Michael"}],"date_created":"2023-01-20T09:37:16Z","title":"Limit transition between hypergeometric functions of type BC and type A","doi":"10.1112/s0010437x13007045","publication":"Compositio Mathematica","type":"journal_article","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Let <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline1\" /><jats:tex-math>${F}_{BC} (\\lambda , k; t)$</jats:tex-math></jats:alternatives></jats:inline-formula> be the Heckman–Opdam hypergeometric function of type BC with multiplicities <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline2\" /><jats:tex-math>$k= ({k}_{1} , {k}_{2} , {k}_{3} )$</jats:tex-math></jats:alternatives></jats:inline-formula> and weighted half-sum <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline3\" /><jats:tex-math>$\\rho (k)$</jats:tex-math></jats:alternatives></jats:inline-formula> of positive roots. We prove that <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline4\" /><jats:tex-math>${F}_{BC} (\\lambda + \\rho (k), k; t)$</jats:tex-math></jats:alternatives></jats:inline-formula> converges as <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline5\" /><jats:tex-math>${k}_{1} + {k}_{2} \\rightarrow \\infty $</jats:tex-math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline6\" /><jats:tex-math>${k}_{1} / {k}_{2} \\rightarrow \\infty $</jats:tex-math></jats:alternatives></jats:inline-formula> to a function of type A for <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline7\" /><jats:tex-math>$t\\in { \\mathbb{R} }^{n} $</jats:tex-math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline8\" /><jats:tex-math>$\\lambda \\in { \\mathbb{C} }^{n} $</jats:tex-math></jats:alternatives></jats:inline-formula>. This limit is obtained from a corresponding result for Jacobi polynomials of type BC, which is proven for a slightly more general limit behavior of the multiplicities, using an explicit representation of Jacobi polynomials in terms of Jack polynomials. Our limits include limit transitions for the spherical functions of non-compact Grassmann manifolds over one of the fields <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0010437X13007045_inline9\" /><jats:tex-math>$ \\mathbb{F} = \\mathbb{R} , \\mathbb{C} , \\mathbb{H} $</jats:tex-math></jats:alternatives></jats:inline-formula> when the rank is fixed and the dimension tends to infinity. The limit functions turn out to be exactly the spherical functions of the corresponding infinite-dimensional Grassmann manifold in the sense of Olshanski.</jats:p>"}],"status":"public","_id":"37672","department":[{"_id":"555"}],"user_id":"93826","keyword":["Algebra and Number Theory"],"language":[{"iso":"eng"}]},{"status":"public","type":"journal_article","extern":"1","_id":"42796","user_id":"93826","department":[{"_id":"102"}],"citation":{"apa":"Lorch, D., &#38; Kirschmer, M. (2013). Single-class genera of positive integral lattices. <i>LMS Journal of Computation and Mathematics</i>, <i>16</i>, 172–186. <a href=\"https://doi.org/10.1112/s1461157013000107\">https://doi.org/10.1112/s1461157013000107</a>","mla":"Lorch, David, and Markus Kirschmer. “Single-Class Genera of Positive Integral Lattices.” <i>LMS Journal of Computation and Mathematics</i>, vol. 16, Wiley, 2013, pp. 172–86, doi:<a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>.","bibtex":"@article{Lorch_Kirschmer_2013, title={Single-class genera of positive integral lattices}, volume={16}, DOI={<a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Lorch, David and Kirschmer, Markus}, year={2013}, pages={172–186} }","short":"D. Lorch, M. Kirschmer, LMS Journal of Computation and Mathematics 16 (2013) 172–186.","chicago":"Lorch, David, and Markus Kirschmer. “Single-Class Genera of Positive Integral Lattices.” <i>LMS Journal of Computation and Mathematics</i> 16 (2013): 172–86. <a href=\"https://doi.org/10.1112/s1461157013000107\">https://doi.org/10.1112/s1461157013000107</a>.","ieee":"D. Lorch and M. Kirschmer, “Single-class genera of positive integral lattices,” <i>LMS Journal of Computation and Mathematics</i>, vol. 16, pp. 172–186, 2013, doi: <a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>.","ama":"Lorch D, Kirschmer M. Single-class genera of positive integral lattices. <i>LMS Journal of Computation and Mathematics</i>. 2013;16:172-186. doi:<a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>"},"page":"172-186","intvolume":"        16","publication_status":"published","publication_identifier":{"issn":["1461-1570"]},"doi":"10.1112/s1461157013000107","date_updated":"2023-04-04T07:57:04Z","author":[{"first_name":"David","full_name":"Lorch, David","last_name":"Lorch"},{"first_name":"Markus","last_name":"Kirschmer","full_name":"Kirschmer, Markus","id":"82258"}],"volume":16,"abstract":[{"lang":"eng","text":"We give an enumeration of all positive definite primitive Z-lattices in dimension n ≥ 3 whose genus consists of a single isometry class. This is achieved by using bounds obtained from the Smith–Minkowski–Siegel mass formula to computationally construct the square-free determinant lattices with this property, and then repeatedly calculating pre-images under a mapping first introduced by G. L. Watson.\r\n\r\nWe hereby complete the classification of single-class genera in dimensions 4 and 5 and correct some mistakes in Watson’s classifications in other dimensions. A list of all single-class primitive Z-lattices has been compiled and incorporated into the Catalogue of Lattices."}],"publication":"LMS Journal of Computation and Mathematics","keyword":["Computational Theory and Mathematics","General Mathematics"],"language":[{"iso":"eng"}],"year":"2013","title":"Single-class genera of positive integral lattices","publisher":"Wiley","date_created":"2023-03-07T08:34:28Z"},{"author":[{"first_name":"J.","last_name":"Karátson","full_name":"Karátson, J."},{"id":"100441","full_name":"Kovács, Balázs","orcid":"0000-0001-9872-3474","last_name":"Kovács","first_name":"Balázs"}],"volume":65,"date_updated":"2024-04-03T09:23:54Z","doi":"10.1016/j.camwa.2012.04.021","publication_status":"published","publication_identifier":{"issn":["0898-1221"]},"citation":{"chicago":"Karátson, J., and Balázs Kovács. “Variable Preconditioning in Complex Hilbert Space and Its Application to the Nonlinear Schrödinger Equation.” <i>Computers &#38;amp; Mathematics with Applications</i> 65, no. 3 (2012): 449–59. <a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">https://doi.org/10.1016/j.camwa.2012.04.021</a>.","ieee":"J. Karátson and B. Kovács, “Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation,” <i>Computers &#38;amp; Mathematics with Applications</i>, vol. 65, no. 3, pp. 449–459, 2012, doi: <a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>.","ama":"Karátson J, Kovács B. Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation. <i>Computers &#38;amp; Mathematics with Applications</i>. 2012;65(3):449-459. doi:<a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>","apa":"Karátson, J., &#38; Kovács, B. (2012). Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation. <i>Computers &#38;amp; Mathematics with Applications</i>, <i>65</i>(3), 449–459. <a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">https://doi.org/10.1016/j.camwa.2012.04.021</a>","bibtex":"@article{Karátson_Kovács_2012, title={Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation}, volume={65}, DOI={<a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>}, number={3}, journal={Computers &#38;amp; Mathematics with Applications}, publisher={Elsevier BV}, author={Karátson, J. and Kovács, Balázs}, year={2012}, pages={449–459} }","short":"J. Karátson, B. Kovács, Computers &#38;amp; Mathematics with Applications 65 (2012) 449–459.","mla":"Karátson, J., and Balázs Kovács. “Variable Preconditioning in Complex Hilbert Space and Its Application to the Nonlinear Schrödinger Equation.” <i>Computers &#38;amp; Mathematics with Applications</i>, vol. 65, no. 3, Elsevier BV, 2012, pp. 449–59, doi:<a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>."},"intvolume":"        65","page":"449-459","user_id":"100441","department":[{"_id":"841"}],"_id":"45933","type":"journal_article","status":"public","date_created":"2023-07-10T11:33:50Z","publisher":"Elsevier BV","title":"Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation","issue":"3","year":"2012","language":[{"iso":"eng"}],"keyword":["Computational Mathematics","Computational Theory and Mathematics","Modeling and Simulation"],"publication":"Computers &amp; Mathematics with Applications"},{"year":"2012","citation":{"chicago":"Kirschmer, Markus. “A Normal Form for Definite Quadratic Forms over $\\mathbb{F}_{q}[t]$.” <i>Mathematics of Computation</i> 81, no. 279 (2012): 1619–34. <a href=\"https://doi.org/10.1090/s0025-5718-2011-02570-6\">https://doi.org/10.1090/s0025-5718-2011-02570-6</a>.","ieee":"M. Kirschmer, “A normal form for definite quadratic forms over $\\mathbb{F}_{q}[t]$,” <i>Mathematics of Computation</i>, vol. 81, no. 279, pp. 1619–1634, 2012, doi: <a href=\"https://doi.org/10.1090/s0025-5718-2011-02570-6\">10.1090/s0025-5718-2011-02570-6</a>.","ama":"Kirschmer M. A normal form for definite quadratic forms over $\\mathbb{F}_{q}[t]$. <i>Mathematics of Computation</i>. 2012;81(279):1619-1634. doi:<a href=\"https://doi.org/10.1090/s0025-5718-2011-02570-6\">10.1090/s0025-5718-2011-02570-6</a>","short":"M. Kirschmer, Mathematics of Computation 81 (2012) 1619–1634.","mla":"Kirschmer, Markus. “A Normal Form for Definite Quadratic Forms over $\\mathbb{F}_{q}[t]$.” <i>Mathematics of Computation</i>, vol. 81, no. 279, American Mathematical Society (AMS), 2012, pp. 1619–34, doi:<a href=\"https://doi.org/10.1090/s0025-5718-2011-02570-6\">10.1090/s0025-5718-2011-02570-6</a>.","bibtex":"@article{Kirschmer_2012, title={A normal form for definite quadratic forms over $\\mathbb{F}_{q}[t]$}, volume={81}, DOI={<a href=\"https://doi.org/10.1090/s0025-5718-2011-02570-6\">10.1090/s0025-5718-2011-02570-6</a>}, number={279}, journal={Mathematics of Computation}, publisher={American Mathematical Society (AMS)}, author={Kirschmer, Markus}, year={2012}, pages={1619–1634} }","apa":"Kirschmer, M. (2012). A normal form for definite quadratic forms over $\\mathbb{F}_{q}[t]$. <i>Mathematics of Computation</i>, <i>81</i>(279), 1619–1634. <a href=\"https://doi.org/10.1090/s0025-5718-2011-02570-6\">https://doi.org/10.1090/s0025-5718-2011-02570-6</a>"},"intvolume":"        81","page":"1619-1634","publication_status":"published","publication_identifier":{"issn":["0025-5718","1088-6842"]},"issue":"279","title":"A normal form for definite quadratic forms over $\\mathbb{F}_{q}[t]$","doi":"10.1090/s0025-5718-2011-02570-6","date_updated":"2023-04-04T09:22:22Z","publisher":"American Mathematical Society (AMS)","author":[{"last_name":"Kirschmer","id":"82258","full_name":"Kirschmer, Markus","first_name":"Markus"}],"date_created":"2023-03-07T08:35:56Z","volume":81,"abstract":[{"lang":"eng","text":"An efficient algorithm to compute automorphism groups and isometries of definite Fq[t]-lattices for odd q is presented. The algorithm requires several square root computations in Fq₂ but no enumeration of orbits having more than eight elements. "}],"status":"public","type":"journal_article","publication":"Mathematics of Computation","keyword":["Applied Mathematics","Computational Mathematics","Algebra and Number Theory"],"extern":"1","language":[{"iso":"eng"}],"_id":"42797","user_id":"93826","department":[{"_id":"102"}]},{"status":"public","publication":"Journal of the Association for Information Systems","type":"journal_article","keyword":["Creativity","Creativity Support Systems","convergent thinking","design theory","divergent thinking"],"extern":"1","language":[{"iso":"eng"}],"_id":"4708","user_id":"72849","year":"2011","page":"714--740","citation":{"ama":"Müller-Wienbergen F, Müller O, Seidel S, Becker J. Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems that Support Convergent and Divergent Thinking. <i>Journal of the Association for Information Systems</i>. 2011;(11):714--740. doi:<a href=\"https://doi.org/10.1016/S0006-3495(00)76637-9\">10.1016/S0006-3495(00)76637-9</a>","ieee":"F. Müller-Wienbergen, O. Müller, S. Seidel, and J. Becker, “Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems that Support Convergent and Divergent Thinking,” <i>Journal of the Association for Information Systems</i>, no. 11, pp. 714--740, 2011.","chicago":"Müller-Wienbergen, Felix, Oliver Müller, Stefan Seidel, and Jörg Becker. “Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems That Support Convergent and Divergent Thinking.” <i>Journal of the Association for Information Systems</i>, no. 11 (2011): 714--740. <a href=\"https://doi.org/10.1016/S0006-3495(00)76637-9\">https://doi.org/10.1016/S0006-3495(00)76637-9</a>.","apa":"Müller-Wienbergen, F., Müller, O., Seidel, S., &#38; Becker, J. (2011). Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems that Support Convergent and Divergent Thinking. <i>Journal of the Association for Information Systems</i>, (11), 714--740. <a href=\"https://doi.org/10.1016/S0006-3495(00)76637-9\">https://doi.org/10.1016/S0006-3495(00)76637-9</a>","bibtex":"@article{Müller-Wienbergen_Müller_Seidel_Becker_2011, title={Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems that Support Convergent and Divergent Thinking}, DOI={<a href=\"https://doi.org/10.1016/S0006-3495(00)76637-9\">10.1016/S0006-3495(00)76637-9</a>}, number={11}, journal={Journal of the Association for Information Systems}, author={Müller-Wienbergen, Felix and Müller, Oliver and Seidel, Stefan and Becker, Jörg}, year={2011}, pages={714--740} }","mla":"Müller-Wienbergen, Felix, et al. “Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems That Support Convergent and Divergent Thinking.” <i>Journal of the Association for Information Systems</i>, no. 11, 2011, pp. 714--740, doi:<a href=\"https://doi.org/10.1016/S0006-3495(00)76637-9\">10.1016/S0006-3495(00)76637-9</a>.","short":"F. Müller-Wienbergen, O. Müller, S. Seidel, J. Becker, Journal of the Association for Information Systems (2011) 714--740."},"publication_identifier":{"isbn":["1536-9323"],"issn":["15369323"]},"issue":"11","title":"Leaving the Beaten Tracks in Creative Work – A Design Theory for Systems that Support Convergent and Divergent Thinking","doi":"10.1016/S0006-3495(00)76637-9","date_updated":"2022-01-06T07:01:19Z","date_created":"2018-10-12T08:37:03Z","author":[{"first_name":"Felix","last_name":"Müller-Wienbergen","full_name":"Müller-Wienbergen, Felix"},{"first_name":"Oliver","id":"72849","full_name":"Müller, Oliver","last_name":"Müller"},{"full_name":"Seidel, Stefan","last_name":"Seidel","first_name":"Stefan"},{"first_name":"Jörg","full_name":"Becker, Jörg","last_name":"Becker"}]},{"publication":"Interaction Studies","abstract":[{"text":"It has been proposed that the design of robots might benefit from interactions that are similar to caregiver–child interactions, which is tailored to children’s respective capacities to a high degree. However, so far little is known about how people adapt their tutoring behaviour to robots and whether robots can evoke input that is similar to child-directed interaction. The paper presents detailed analyses of speakers’ linguistic and non-linguistic behaviour, such as action demonstration, in two comparable situations: In one experiment, parents described and explained to their nonverbal infants the use of certain everyday objects; in the other experiment, participants tutored a simulated robot on the same objects. The results, which show considerable differences between the two situations on almost all measures, are discussed in the light of the computer-as-social-actor paradigm and the register hypothesis.","lang":"eng"}],"language":[{"iso":"eng"}],"keyword":["human–robot interaction (HRI)","social communication","register theory","motionese","robotese","child-directed speech (CDS)","motherese","mindless transfer","computers-as-social-actors"],"issue":"1","year":"2011","date_created":"2020-06-24T13:01:57Z","publisher":"John Benjamins Publishing Company","title":"Mindful tutors: Linguistic choice and action demonstration in speech to infants and a simulated robot","type":"journal_article","status":"public","department":[{"_id":"749"}],"user_id":"14931","_id":"17233","publication_identifier":{"issn":["1572-0381"]},"intvolume":"        12","page":"134-161","citation":{"apa":"Fischer, K., Foth, K., Rohlfing, K., &#38; Wrede, B. (2011). Mindful tutors: Linguistic choice and action demonstration in speech to infants and a simulated robot. <i>Interaction Studies</i>, <i>12</i>(1), 134–161. <a href=\"https://doi.org/10.1075/is.12.1.06fis\">https://doi.org/10.1075/is.12.1.06fis</a>","mla":"Fischer, Kerstin, et al. “Mindful Tutors: Linguistic Choice and Action Demonstration in Speech to Infants and a Simulated Robot.” <i>Interaction Studies</i>, vol. 12, no. 1, John Benjamins Publishing Company, 2011, pp. 134–61, doi:<a href=\"https://doi.org/10.1075/is.12.1.06fis\">10.1075/is.12.1.06fis</a>.","bibtex":"@article{Fischer_Foth_Rohlfing_Wrede_2011, title={Mindful tutors: Linguistic choice and action demonstration in speech to infants and a simulated robot}, volume={12}, DOI={<a href=\"https://doi.org/10.1075/is.12.1.06fis\">10.1075/is.12.1.06fis</a>}, number={1}, journal={Interaction Studies}, publisher={John Benjamins Publishing Company}, author={Fischer, Kerstin and Foth, Kilian and Rohlfing, Katharina and Wrede, Britta}, year={2011}, pages={134–161} }","short":"K. Fischer, K. Foth, K. Rohlfing, B. Wrede, Interaction Studies 12 (2011) 134–161.","ieee":"K. Fischer, K. Foth, K. Rohlfing, and B. Wrede, “Mindful tutors: Linguistic choice and action demonstration in speech to infants and a simulated robot,” <i>Interaction Studies</i>, vol. 12, no. 1, pp. 134–161, 2011, doi: <a href=\"https://doi.org/10.1075/is.12.1.06fis\">10.1075/is.12.1.06fis</a>.","chicago":"Fischer, Kerstin, Kilian Foth, Katharina Rohlfing, and Britta Wrede. “Mindful Tutors: Linguistic Choice and Action Demonstration in Speech to Infants and a Simulated Robot.” <i>Interaction Studies</i> 12, no. 1 (2011): 134–61. <a href=\"https://doi.org/10.1075/is.12.1.06fis\">https://doi.org/10.1075/is.12.1.06fis</a>.","ama":"Fischer K, Foth K, Rohlfing K, Wrede B. Mindful tutors: Linguistic choice and action demonstration in speech to infants and a simulated robot. <i>Interaction Studies</i>. 2011;12(1):134-161. doi:<a href=\"https://doi.org/10.1075/is.12.1.06fis\">10.1075/is.12.1.06fis</a>"},"volume":12,"author":[{"full_name":"Fischer, Kerstin","last_name":"Fischer","first_name":"Kerstin"},{"last_name":"Foth","full_name":"Foth, Kilian","first_name":"Kilian"},{"first_name":"Katharina","full_name":"Rohlfing, Katharina","id":"50352","last_name":"Rohlfing"},{"first_name":"Britta","full_name":"Wrede, Britta","last_name":"Wrede"}],"date_updated":"2023-02-01T12:56:04Z","doi":"10.1075/is.12.1.06fis"},{"doi":"10.1016/j.jsc.2012.05.010","author":[{"first_name":"Mark","last_name":"van Hoeij","full_name":"van Hoeij, Mark"},{"first_name":"Jürgen","last_name":"Klüners","full_name":"Klüners, Jürgen","id":"21202"},{"first_name":"Andrew","last_name":"Novocin","full_name":"Novocin, Andrew"}],"volume":52,"date_updated":"2023-03-06T09:46:15Z","citation":{"apa":"van Hoeij, M., Klüners, J., &#38; Novocin, A. (2011). Generating subfields. <i>Journal of Symbolic Computation</i>, <i>52</i>, 17–34. <a href=\"https://doi.org/10.1016/j.jsc.2012.05.010\">https://doi.org/10.1016/j.jsc.2012.05.010</a>","short":"M. van Hoeij, J. Klüners, A. Novocin, Journal of Symbolic Computation 52 (2011) 17–34.","bibtex":"@article{van Hoeij_Klüners_Novocin_2011, title={Generating subfields}, volume={52}, DOI={<a href=\"https://doi.org/10.1016/j.jsc.2012.05.010\">10.1016/j.jsc.2012.05.010</a>}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV}, author={van Hoeij, Mark and Klüners, Jürgen and Novocin, Andrew}, year={2011}, pages={17–34} }","mla":"van Hoeij, Mark, et al. “Generating Subfields.” <i>Journal of Symbolic Computation</i>, vol. 52, Elsevier BV, 2011, pp. 17–34, doi:<a href=\"https://doi.org/10.1016/j.jsc.2012.05.010\">10.1016/j.jsc.2012.05.010</a>.","ieee":"M. van Hoeij, J. Klüners, and A. Novocin, “Generating subfields,” <i>Journal of Symbolic Computation</i>, vol. 52, pp. 17–34, 2011, doi: <a href=\"https://doi.org/10.1016/j.jsc.2012.05.010\">10.1016/j.jsc.2012.05.010</a>.","chicago":"Hoeij, Mark van, Jürgen Klüners, and Andrew Novocin. “Generating Subfields.” <i>Journal of Symbolic Computation</i> 52 (2011): 17–34. <a href=\"https://doi.org/10.1016/j.jsc.2012.05.010\">https://doi.org/10.1016/j.jsc.2012.05.010</a>.","ama":"van Hoeij M, Klüners J, Novocin A. Generating subfields. <i>Journal of Symbolic Computation</i>. 2011;52:17-34. doi:<a href=\"https://doi.org/10.1016/j.jsc.2012.05.010\">10.1016/j.jsc.2012.05.010</a>"},"page":"17-34","intvolume":"        52","publication_status":"published","publication_identifier":{"issn":["0747-7171"]},"user_id":"93826","department":[{"_id":"102"}],"_id":"34846","status":"public","type":"journal_article","title":"Generating subfields","date_created":"2022-12-22T10:54:15Z","publisher":"Elsevier BV","year":"2011","language":[{"iso":"eng"}],"keyword":["Computational Mathematics","Algebra and Number Theory"],"abstract":[{"text":"Given a field extension K/k of degree n we are interested in finding the subfields of K containing k. There can be more than polynomially many subfields. We introduce the notion of generating subfields, a set of up to n subfields whose intersections give the rest. We provide an efficient algorithm which uses linear algebra in k or lattice reduction along with factorization in any extension of K. Implementations show that previously difficult cases can now be handled.","lang":"eng"}],"publication":"Journal of Symbolic Computation"},{"keyword":["venture capital","capital structure","contract theory","deal experience"],"language":[{"iso":"eng"}],"publication":"European Financial Management (VHB-JOURQUAL 4 Ranking B)","abstract":[{"text":"This article analyses 336 German venture capital transactions from 1990 to 2005 and seeks to determine why selected financial securities differ across deals. We find that a broad array of financial instruments is used, covering straight equity, mezzanine and debt‐like securities. Based on the chosen financial securities’ upside potential and downside protection characteristics, we provide an explanation for the differing use of these securities. Our results show that investors’ deal experience, adverse selection risks and economic prospects in the public equity market influence the selection of financial securities. ","lang":"eng"}],"publisher":"Wiley Online Library","date_created":"2018-10-31T11:39:27Z","title":"Adverse selection, investor experience and security choice in venture capital finance: evidence from Germany","quality_controlled":"1","issue":"3","year":"2011","_id":"5195","department":[{"_id":"275"}],"user_id":"115848","article_type":"original","extern":"1","type":"journal_article","status":"public","date_updated":"2026-04-09T08:01:03Z","volume":17,"author":[{"first_name":"Thomas","last_name":"Hartmann-Wendels","full_name":"Hartmann-Wendels, Thomas"},{"first_name":"Georg","last_name":"Keienburg","full_name":"Keienburg, Georg"},{"full_name":"Sievers, Sönke","id":"46447","last_name":"Sievers","first_name":"Sönke"}],"doi":"10.1111/j.1468-036X.2010.00568.x","main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/full/10.1111/j.1468-036X.2010.00568.x"}],"publication_status":"published","intvolume":"        17","page":"464-499","jel":["G24","G32"],"citation":{"chicago":"Hartmann-Wendels, Thomas, Georg Keienburg, and Sönke Sievers. “Adverse Selection, Investor Experience and Security Choice in Venture Capital Finance: Evidence from Germany.” <i>European Financial Management (VHB-JOURQUAL 4 Ranking B)</i> 17, no. 3 (2011): 464–99. <a href=\"https://doi.org/10.1111/j.1468-036X.2010.00568.x\">https://doi.org/10.1111/j.1468-036X.2010.00568.x</a>.","ieee":"T. Hartmann-Wendels, G. Keienburg, and S. Sievers, “Adverse selection, investor experience and security choice in venture capital finance: evidence from Germany,” <i>European Financial Management (VHB-JOURQUAL 4 Ranking B)</i>, vol. 17, no. 3, pp. 464–499, 2011, doi: <a href=\"https://doi.org/10.1111/j.1468-036X.2010.00568.x\">10.1111/j.1468-036X.2010.00568.x</a>.","ama":"Hartmann-Wendels T, Keienburg G, Sievers S. Adverse selection, investor experience and security choice in venture capital finance: evidence from Germany. <i>European Financial Management (VHB-JOURQUAL 4 Ranking B)</i>. 2011;17(3):464-499. doi:<a href=\"https://doi.org/10.1111/j.1468-036X.2010.00568.x\">10.1111/j.1468-036X.2010.00568.x</a>","apa":"Hartmann-Wendels, T., Keienburg, G., &#38; Sievers, S. (2011). Adverse selection, investor experience and security choice in venture capital finance: evidence from Germany. <i>European Financial Management (VHB-JOURQUAL 4 Ranking B)</i>, <i>17</i>(3), 464–499. <a href=\"https://doi.org/10.1111/j.1468-036X.2010.00568.x\">https://doi.org/10.1111/j.1468-036X.2010.00568.x</a>","mla":"Hartmann-Wendels, Thomas, et al. “Adverse Selection, Investor Experience and Security Choice in Venture Capital Finance: Evidence from Germany.” <i>European Financial Management (VHB-JOURQUAL 4 Ranking B)</i>, vol. 17, no. 3, Wiley Online Library, 2011, pp. 464–99, doi:<a href=\"https://doi.org/10.1111/j.1468-036X.2010.00568.x\">10.1111/j.1468-036X.2010.00568.x</a>.","short":"T. Hartmann-Wendels, G. Keienburg, S. Sievers, European Financial Management (VHB-JOURQUAL 4 Ranking B) 17 (2011) 464–499.","bibtex":"@article{Hartmann-Wendels_Keienburg_Sievers_2011, title={Adverse selection, investor experience and security choice in venture capital finance: evidence from Germany}, volume={17}, DOI={<a href=\"https://doi.org/10.1111/j.1468-036X.2010.00568.x\">10.1111/j.1468-036X.2010.00568.x</a>}, number={3}, journal={European Financial Management (VHB-JOURQUAL 4 Ranking B)}, publisher={Wiley Online Library}, author={Hartmann-Wendels, Thomas and Keienburg, Georg and Sievers, Sönke}, year={2011}, pages={464–499} }"}},{"year":"2010","citation":{"apa":"Jenert, T., &#38; Gebhardt, A. (2010). <i>Zugänge zum Begriff der Lernkultur: Eine Systematisierung auf Basis kultur-und lerntheoretischer Überlegungen</i>.","short":"T. Jenert, A. Gebhardt, Zugänge Zum Begriff Der Lernkultur: Eine Systematisierung Auf Basis Kultur-Und Lerntheoretischer Überlegungen, 2010.","bibtex":"@book{Jenert_Gebhardt_2010, title={Zugänge zum Begriff der Lernkultur: Eine Systematisierung auf Basis kultur-und lerntheoretischer Überlegungen}, author={Jenert, Tobias and Gebhardt, Anja}, year={2010} }","mla":"Jenert, Tobias, and Anja Gebhardt. <i>Zugänge Zum Begriff Der Lernkultur: Eine Systematisierung Auf Basis Kultur-Und Lerntheoretischer Überlegungen</i>. 2010.","ama":"Jenert T, Gebhardt A. <i>Zugänge Zum Begriff Der Lernkultur: Eine Systematisierung Auf Basis Kultur-Und Lerntheoretischer Überlegungen</i>.; 2010.","ieee":"T. Jenert and A. Gebhardt, <i>Zugänge zum Begriff der Lernkultur: Eine Systematisierung auf Basis kultur-und lerntheoretischer Überlegungen</i>. 2010.","chicago":"Jenert, Tobias, and Anja Gebhardt. <i>Zugänge Zum Begriff Der Lernkultur: Eine Systematisierung Auf Basis Kultur-Und Lerntheoretischer Überlegungen</i>, 2010."},"date_updated":"2022-01-06T07:01:04Z","date_created":"2018-09-18T11:50:40Z","author":[{"first_name":"Tobias","full_name":"Jenert, Tobias","last_name":"Jenert"},{"full_name":"Gebhardt, Anja","last_name":"Gebhardt","first_name":"Anja"}],"title":"Zugänge zum Begriff der Lernkultur: Eine Systematisierung auf Basis kultur-und lerntheoretischer Überlegungen","type":"report","abstract":[{"text":"\"Lernkultur\" wird als Begriff häufig gebraucht und fast ebenso häufig definiert  das gilt für den betrieblichen Kontext ebenso wie für die Bereiche der Schul-, Hochschul-, Berufs- und Erwachsenenbildung (z. B. Wulf, Althans, Blaschke, Ferrin, Göhlich, Jörissen, Mattig et al., 2007; Jenert, Zellweger Moser, Dommen & Gebhardt, 2009; Kirchhöfer, 2004; Erpenbeck & Sauer, 2000). Trotz der grossen Aufmerksamkeit, die der Begriff in den letzten zwei Jahrzehnten erfahren hat, kann man nicht von einem in sich geschlossenen Forschungsprogramm sprechen. Die Zugänge zum Phänomenbereich Lernkultur sind ebenso vielfältig wie die hinter einzelnen Ansätzen stehenden Lernkulturkonstrukte. Den Autoren ist keine Publikation bekannt, welche unterschiedliche Ansätze der Lernkulturforschung systematisch aufarbeitet. Eine wichtige Referenzquelle ist der Bericht von Kuh und Whitt (1988) \"The Invisible Tapestry: Culture in American Colleges and Universities\". Ausgehend von einer fundierten Übersicht zu unterschiedlichen Zugängen zum Kulturbegriff (oft in starker Anlehnung an die Organisationskulturforschung (vgl. Allaire & Firsirotu, 1984)) stellen die Autoren ein Rahmenmodell zur Analyse von Hochschulkulturen vor (Kuh und Whitt, 1988, S. 56). Diese Arbeit erweist sich für ein besseres Verständnis unter-schiedlicher Zugänge zum Lernkulturbegriff als aufschlussreich, weil im Kontext Hoch-schule zwangsweise viele Aspekte des Lernens und Lehrens angesprochen werden. Allerdings fokussiert auch dieser Bericht nicht das Konstrukt der Lernkultur und bietet damit nur einen Ausgangspunkt für die Identifizierung unterschiedlicher Zugänge.","lang":"ger"}],"status":"public","_id":"4448","user_id":"51057","department":[{"_id":"208"},{"_id":"282"}],"keyword":["Lernkultur","learning culture","culture theory","approaches to learning culture","culture of learning"],"extern":"1"},{"type":"conference","publication":"Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual","status":"public","abstract":[{"lang":"eng","text":"Recent advances in information processing enable new kinds of technical systems, called self-optimizing systems. These systems are able to adapt their objectives and their behavior according to the current situation and influences autonomously. This behavior adaptation is non-deterministic and hence self-optimization is a risk to the system, e.g. if the result of the self-optimization process does not match the suddenly changed situation. In contrary, self-optimization could be used to increase the dependability by pursuing objectives like reliability and availability. In our preceding publications we introduced the so called multi-level dependability concept to cope with this new kind of systems (cf. [6]). This concept comprises the monitoring of the system behavior, the classification of the current situation, and the selection of the appropriate measure, if reliability limits are exceeded. In this paper we present for the first time experimental results. The dependability concept is implemented in the self-optimizing active guidance system of a railway vehicle. The test drives illustrate clearly that the proposed concept is able to cope with, e.g., sensor failures, and is able to increase the reliability and availability of the active guidance module."}],"user_id":"55222","department":[{"_id":"151"}],"_id":"9763","language":[{"iso":"eng"}],"keyword":["availability","dependability concept","multilevel dependability concept","railway vehicle","reliability","self optimizing active guidance system","self optimizing railway guidance system","situation classification","system behavior monitoring","optimal control","railways","reliability theory","self-adjusting systems"],"publication_identifier":{"issn":["0149-144X"]},"quality_controlled":"1","citation":{"ama":"Sondermann-Wölke C, Geisler J, Sextro W. Increasing the reliability of a self-optimizing railway guidance system. In: <i>Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual</i>. ; 2010:1-6. doi:<a href=\"https://doi.org/10.1109/RAMS.2010.5448080\">10.1109/RAMS.2010.5448080</a>","ieee":"C. Sondermann-Wölke, J. Geisler, and W. Sextro, “Increasing the reliability of a self-optimizing railway guidance system,” in <i>Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual</i>, 2010, pp. 1–6.","chicago":"Sondermann-Wölke, Christoph, Jens Geisler, and Walter Sextro. “Increasing the Reliability of a Self-Optimizing Railway Guidance System.” In <i>Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual</i>, 1–6, 2010. <a href=\"https://doi.org/10.1109/RAMS.2010.5448080\">https://doi.org/10.1109/RAMS.2010.5448080</a>.","short":"C. Sondermann-Wölke, J. Geisler, W. Sextro, in: Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual, 2010, pp. 1–6.","bibtex":"@inproceedings{Sondermann-Wölke_Geisler_Sextro_2010, title={Increasing the reliability of a self-optimizing railway guidance system}, DOI={<a href=\"https://doi.org/10.1109/RAMS.2010.5448080\">10.1109/RAMS.2010.5448080</a>}, booktitle={Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual}, author={Sondermann-Wölke, Christoph and Geisler, Jens and Sextro, Walter}, year={2010}, pages={1–6} }","mla":"Sondermann-Wölke, Christoph, et al. “Increasing the Reliability of a Self-Optimizing Railway Guidance System.” <i>Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual</i>, 2010, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/RAMS.2010.5448080\">10.1109/RAMS.2010.5448080</a>.","apa":"Sondermann-Wölke, C., Geisler, J., &#38; Sextro, W. (2010). Increasing the reliability of a self-optimizing railway guidance system. In <i>Reliability and Maintainability Symposium (RAMS), 2010 Proceedings - Annual</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/RAMS.2010.5448080\">https://doi.org/10.1109/RAMS.2010.5448080</a>"},"page":"1 -6","year":"2010","author":[{"full_name":"Sondermann-Wölke, Christoph","last_name":"Sondermann-Wölke","first_name":"Christoph"},{"full_name":"Geisler, Jens","last_name":"Geisler","first_name":"Jens"},{"id":"21220","full_name":"Sextro, Walter","last_name":"Sextro","first_name":"Walter"}],"date_created":"2019-05-13T10:35:39Z","date_updated":"2022-01-06T07:04:19Z","doi":"10.1109/RAMS.2010.5448080","title":"Increasing the reliability of a self-optimizing railway guidance system"}]