@phdthesis{Makeschin2015, author = {Makeschin, Sarah}, title = {"The Imagined Presidency": Political Communication as "Narrative" and "Performance" - A Case Study of Barack Obama's 2008 Presidential Campaign}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-4496}, school = {Universit{\"a}t Passau}, pages = {230 S.}, year = {2015}, abstract = {Many communication scholars agree that political communication in the 21st century has permanently changed due to the enormous shifts in mass media communications landscape. Today, political culture and public debate are characterized by a highly individualistic and consumption-oriented electorate conditioned by a hypermedialized public sphere spawned by the so-called "Digital Revolution". Confronted with a fluid and volatile communications landscape, political actors of the 21st century have had to develop new strategies to fulfill their functional role in the public arena and satisfy their audiences' expectations. This has had massive impact on the communication logistics of perhaps the world's most powerful political office and the ultimate of collective meaning-making and national identity in the United States: that of the American Presidency. The perception of Barack Obama's 2008 election campaign as epitomizing such shifts in the collective meaning-making processes lies at the core of this research project. The analyzes Barack Obama's 2008 presidential election campaign with respect to its underlying communicational and performative concept(s), and its impact on the socio-ontological dimension of the office of the American Presidency in the 21st century. While storytelling and performative staging have always been crucial to the American presidential office (Cornog 2004; Woodward 2007, Weiss 2008), this research project aims to show how "telling a story" and staging it properly have become the sine qua non for American presidential political communication. This case study of Barack Obama's 2008 presidential election campaign examines the central role that imaginative processes, their narrative formation and performative staging play in 21st century political dialog. Furthermore the dissertation suggests, that these paradigmatic shifts demand a refinement of existing socio-political concepts of the institution of the American Presidency.}, subject = {Obama, Barack}, language = {en} } @phdthesis{Kasinathan2021, author = {Kasinathan, Prabhakaran}, title = {Workflow-aware access control for the Internet of Things}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-8915}, school = {Universit{\"a}t Passau}, pages = {xxiii, 214 Seiten}, year = {2021}, abstract = {IoT is defined as a paradigm where "things" have sensing, actuating, communicating, and self-configuring abilities, and are connected to each other and to the Internet. Recent advancements in the manufacturing industry have helped to produce embedded devices with various sensors and actuators in mass numbers at a reduced cost. As part of the IoT revolution, everyday devices such as television, refrigerator, cars, even industrial machines are now connected IoT devices. Recent studies have predicted that by 2025 there will be over 75 billion of such IoT devices connected to the Internet. The providers of IoT based services want to integrate their services to satisfy customer requirements. For example, in the mobility scenario, different mobility solution providers want to offer a multi-modal ticket to their customers jointly. In such a distributed and loosely coupled environment, each owner and stakeholder wants to secure his/her own integrity, confidentiality, and functionality goals. This means that distributed rules and conditions defined by the individual owners must be enforced on the participating entities (e.g., customers or partners using their services). The owners and stakeholders may not necessarily trust each other's actions. Therefore, a mechanism is required that guarantees the rules and conditions specified by the different owners. Attacks on IoT devices and similar computing systems are increasing and getting more advanced. IoT devices are often constrained, i.e., they have limited processing power, memory, and energy. Security mechanisms designed for traditional computing systems, e.g., computers, servers, or mobile computing devices such as smartphones, may not fit in those constrained IoT devices. Weak security mechanisms and unenforced security measures were one of the main reasons for recent successful attacks on IoT devices and services. As IoT is now used in many sensitive places, including critical infrastructures, securing them becomes more critical than ever. This thesis focuses on developing mechanisms that secure IoT devices and services and enforcing the rules and conditions specified by the owners on entities that want to access owners' resources. In classical computer systems, security automata are used for specifying security policies and monitoring mechanisms are used for enforcing such policies. For instance, a reference monitor observes and stops the execution when the security policies are about to be violated, thus, the security policies are enforced. To restrict the adversary from using protected IoT devices or services for malicious purposes, it is required to ensure that a workflow must be followed to access the protected resource. In distributed IoT systems where the policies are governed by different owners, each owner would like to specify their rules and conditions in their workflows. The workflows contain tasks that must be performed in a particular order. The goal of this thesis is to develop mechanisms to specify and enforce these workflows in the distributed IoT environment. This thesis introduces a distributed WFAC framework that restricts the entities to do only what they are allowed to do in a collaborative environment. To gain access to a service protected by the WFAC framework, every workflow participant must prove that he/she is in a particular state of an authorized workflow. Authorized means two things: (a) the owner has authorized the workflow to be executed; (b) the workflow participant is authorized to execute it. This restricts the adversary's access to the devices and its services. The security policies defined by different owners are modeled as workflows and specified using Petri Nets. The policies are then enforced with the help of the WFAC framework which supports error-handling, accountability, integration of practitioner-friendly tools, and interoperability with existing security mechanisms such as OAuth. Thus, the WFAC guarantees the integrity of workflows in a distributed environment.}, language = {en} } @phdthesis{Ali2011, author = {Ali, Rashid}, title = {Weyl Gr{\"o}bner Basis Cryptosystems}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-23195}, school = {Universit{\"a}t Passau}, year = {2011}, abstract = {In this thesis, we shall consider a certain class of algebraic cryptosystems called Gr{\"o}bner Basis Cryptosystems. In 1994, Koblitz introduced the Polly Cracker cryptosystem that is based on the theory of Gr{\"o}bner basis in commutative polynomials rings. The security of this cryptosystem relies on the fact that the computation of Gr{\"o}bner basis is, in general, EXPSPACE-hard. Cryptanalysis of these commutative Polly Cracker type cryptosystems is possible by using attacks that do not require the computation of Gr{\"o}bner basis for breaking the system, for example, the attacks based on linear algebra. To secure these (commutative) Gr{\"o}bner basis cryptosystems against various attacks, among others, Ackermann and Kreuzer introduced a general class of Gr{\"o}bner Basis Cryptosystems that are based on the difficulty of computing module Gr{\"o}bner bases over general non-commutative rings. The objective of this research is to describe a special class of such cryptosystems by introducing the Weyl Gr{\"o}bner Basis Cryptosystems. We divide this class of cryptosystems in two parts namely the (left) Weyl Gr{\"o}bner Basis Cryptosystems and Two-Sided Weyl Gr{\"o}bner Basis Cryptosystems. We suggest to use Gr{\"o}bner bases for left and two-sided ideals in Weyl algebras to construct specific instances of such cryptosystems. We analyse the resistance of these cryptosystems to the standard attacks and provide computational evidence that secure Weyl Gr{\"o}bner Basis Cryptosystems can be built using left (resp. two-sided) Gr{\"o}bner bases in Weyl algebras.}, subject = {Gr{\"o}bner-Basis}, language = {en} } @phdthesis{Braun2015, author = {Braun, Bastian}, title = {Web-based Secure Application Control}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3048}, school = {Universit{\"a}t Passau}, year = {2015}, abstract = {The world wide web today serves as a distributed application platform. Its origins, however, go back to a simple delivery network for static hypertexts. The legacy from these days can still be observed in the communication protocol used by increasingly sophisticated clients and applications. This thesis identifies the actual security requirements of modern web applications and shows that HTTP does not fit them: user and application authentication, message integrity and confidentiality, control-flow integrity, and application-to-application authorization. We explore the other protocols in the web stack and work out why they can not fill the gap. Our analysis shows that the underlying problem is the connectionless property of HTTP. However, history shows that a fresh start with web communication is far from realistic. As a consequence, we come up with approaches that contribute to meet the identified requirements. We first present impersonation attack vectors that begin before the actual user authentication, i.e. when secure web interaction and authentication seem to be unnecessary. Session fixation attacks exploit a responsibility mismatch between the web developer and the used web application framework. We describe and compare three countermeasures on different implementation levels: on the source code level, on the framework level, and on the network level as a reverse proxy. Then, we explain how the authentication credentials that are transmitted for the user login, i.e. the password, and for session tracking, i.e. the session cookie, can be complemented by browser-stored and user-based secrets respectively. This way, an attacker can not hijack user accounts only by phishing the user's password because an additional browser-based secret is required for login. Also, the class of well-known session hijacking attacks is mitigated because a secret only known by the user must be provided in order to perform critical actions. In the next step, we explore alternative approaches to static authentication credentials. Our approach implements a trusted UI and a mutually authenticated session using signatures as a means to authenticate requests. This way, it establishes a trusted path between the user and the web application without exchanging reusable authentication credentials. As a downside, this approach requires support on the client side and on the server side in order to provide maximum protection. Another approach avoids client-side support but can not implement a trusted UI and is thus susceptible to phishing and clickjacking attacks. Our approaches described so far increase the security level of all web communication at all time. This is why we investigate adaptive security policies that fit the actual risk instead of permanently restricting all kinds of communication including non-critical requests. We develop a smart browser extension that detects when the user is authenticated on a website meaning that she can be impersonated because all requests carry her identity proof. Uncritical communication, however, is released from restrictions to enable all intended web features. Finally, we focus on attacks targeting a web application's control-flow integrity. We explain them thoroughly, check whether current web application frameworks provide means for protection, and implement two approaches to protect web applications: The first approach is an extension for a web application framework and provides protection based on its configuration by checking all requests for policy conformity. The second approach generates its own policies ad hoc based on the observed web traffic and assuming that regular users only click on links and buttons and fill forms but do not craft requests to protected resources.}, subject = {Computersicherheit}, language = {en} } @phdthesis{Satur2018, author = {Satur, Luzile Mae}, title = {Vibrancy of Public Spaces: Inclusivity and Participation Amidst the Challenges in Transformative Process in the City of Cagayan de Oro, Philippines}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-6136}, school = {Universit{\"a}t Passau}, pages = {V, 206 Seiten}, year = {2018}, abstract = {This study examines the dynamics which lead to revitalization of everyday life in the public spaces of Cagayan de Oro, a medium-sized urban center in Northern Mindanao, the Philippines. By employing the oriental philosophies together with western thoughts such as Henri Lefebvre, Alain Touraine and J{\"u}rgen Habermas, this study elucidates that the core of perceived, lived and conceived spaces is 'the Subject.' Once the Subject utilizes the public sphere to instill social action, social space is ultimately produced. Hawkers, grassroots environmental activists, street readers and artists are the social Subjects who partake in the vibrancy of public spaces. The social Subjects utilize public spaces as venues of social transformation. Thus, this study argues that the social Subjects' role in democratic process lead to inclusivity of the marginalized sector in the public spaces of the city.}, subject = {{\"O}ffentlicher Raum}, language = {en} } @phdthesis{Le2015, author = {Le, Ngoc Long}, title = {Various Differents for 0-Dimensional Schemes and Applications}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-3386}, school = {Universit{\"a}t Passau}, pages = {205}, year = {2015}, abstract = {This thesis attempts to investigate the Noether, Dedekind, and K{\"a}hler differents for a 0-dimensional scheme X in the projective n-space P^n_K over an arbitrary field K. In particular, we focus on studying the relations between the algebraic structure of these differents and geometric properties of the scheme X. In Chapter 1 we give an outline to the problems this thesis is concerned with, a brief literature review for each problem, and the main results regarding these problems. Chapter 2 contains background results that we will need in the subsequent chapters. We introduce the concept of maximal p_j-subschemes of a 0-dimensional scheme X and give some descriptions of them and their Hilbert functions. Furthermore, we generalize the notion of a separator of a subscheme of X of degree deg(X)-1 to a set of separators of a maximal p_j-subscheme of X. In Chapter 3 we explore the Noether, Dedekind, and K{\"a}hler differents for 0-dimensional schemes X. First we define these differents for X, and take a look at how to compute these differents and examine their relations. Then we give an answer to the question "What are the Hilbert functions of these differents?" in some cases. In Chapter 4 we use the differents to investigate the Cayley-Bacharach property of 0-dimensional schemes over an arbitrary field K. The principal results of this chapter are characterizations of CB-schemes and of arithmetically Gorenstein schemes in terms of their Dedekind differents and a criterion for a 0-dimensional smooth scheme to be a complete intersection. We also generalize some results such as Dedekind's formula and the characterization of the Cayley-Bacharach property by using Liaison theory. In addition, several propositions on the uniformities are proven. In Chapter 5 we are interested in studying the Noether, Dedekind, and K{\"a}hler differents for finite special classes of schemes and finding out some applications of these differents. First, we investigate these differents for reduced 0-dimensional almost complete intersections X in P^n_K over a perfect field K. Then we investigate the relationships between these differents and the i-th Fitting ideals of the module of K{\"a}hler differentials of the homogeneous coordinate ring of X. Finally, we look more closely at the Hilbert functions and the regularity indices of these differents for fat point schemes.}, subject = {Kommutativer Ring}, language = {en} } @phdthesis{Garchery2020, author = {Garchery, Mathieu}, title = {User-centered intrusion detection using heterogeneous data}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-8704}, school = {Universit{\"a}t Passau}, pages = {vii, 119 Seiten}, year = {2020}, abstract = {With the frequency and impact of data breaches raising, it has become essential for organizations to automate intrusion detection via machine learning solutions. This generally comes with numerous challenges, among others high class imbalance, changing target concepts and difficulties to conduct sound evaluation. In this thesis, we adopt a user-centered anomaly detection perspective to address selected challenges of intrusion detection, through a real-world use case in the identity and access management (IAM) domain. In addition to the previous challenges, salient properties of this particular problem are high relevance of categorical data, limited feature availability and total absence of ground truth. First, we ask how to apply anomaly detection to IAM audit logs containing a restricted set of mixed (i.e. numeric and categorical) attributes. Then, we inquire how anomalous user behavior can be separated from normality, and this separation evaluated without ground truth. Finally, we examine how the lack of audit data can be alleviated in two complementary settings. On the one hand, we ask how to cope with users without relevant activity history ("cold start" problem). On the other hand, we seek how to extend audit data collection with heterogeneous attributes (i.e. categorical, graph and text) to improve insider threat detection. After aggregating IAM audit data into sessions, we introduce and compare general anomaly detection methods for mixed data to a user identification approach, designed to learn the distinction between normal and malicious user behavior. We find that user identification outperforms general anomaly detection and is effective against masquerades. An additional clustering step allows to reduce false positives among similar users. However, user identification is not effective against insider threats. Furthermore, results suggest that the current scope of our audit data collection should be extended. In order to tackle the "cold start" problem, we adopt a zero-shot learning approach. Focusing on the CERT insider threat use case, we extend an intrusion detection system by integrating user relations to organizational entities (like assignments to projects or teams) in order to better estimate user behavior and improve intrusion detection performance. Results show that this approach is effective in two realistic scenarios. Finally, to support additional sources of audit data for insider threat detection, we propose a method representing audit events as graph edges with heterogeneous attributes. By performing detection at fine-grained level, this approach advantageously improves anomaly traceability while reducing the need for aggregation and feature engineering. Our results show that this method is effective to find intrusions in authentication and email logs. Overall, our work suggests that masquerades and insider threats call for different detection methods. For masquerades, user identification is a promising approach. To find malicious insiders, graph features representing user context and relations to other entities can be informative. This opens the door for tighter coupling of intrusion detection with user identities, roles and privileges used in IAM solutions.}, subject = {Anomalie}, language = {en} } @phdthesis{Limam2014, author = {Limam, Lyes}, title = {Usage-Driven Unified Model for User Profile and Data Source Profile Extraction}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-2936}, school = {Universit{\"a}t Passau}, pages = {160}, year = {2014}, abstract = {This thesis addresses a problem related to usage analysis in information retrieval systems. Indeed, we exploit the history of search queries as support of analysis to extract a profile model. The objective is to characterize the user and the data source that interact in a system to allow different types of comparison (user-to-user, sourceto- source, user-to-source). According to the study we conducted on the work done on profile model, we concluded that the large majority of the contributions are strongly related to the applications within they are proposed. As a result, the proposed profile models are not reusable and suffer from several weaknesses. For instance, these models do not consider the data source, they lack of semantic mechanisms and they do not deal with scalability (in terms of complexity). Therefore, we propose a generic model of user and data source profiles. The characteristics of this model are the following. First, it is generic, being able to represent both the user and the data source. Second, it enables to construct the profiles in an implicit way based on histories of search queries. Third, it defines the profile as a set of topics of interest, each topic corresponding to a semantic cluster of keywords extracted by a specific clustering algorithm. Finally, the profile is represented according to the vector space model. The model is composed of several components organized in the form of a framework, in which we assessed the complexity of each component. The main components of the framework are: • a method for keyword queries disambiguation • a method for semantically representing search query logs in the form of a taxonomy; • a clustering algorithm that allows fast and efficient identification of topics of interest as semantic clusters of keywords; • a method to identify user and data source profiles according to the generic model. This framework enables in particular to perform various tasks related to usage-based structuration of a distributed environment. As an example of application, the framework is used to the discovery of user communities, and the categorization of data sources. To validate the proposed framework, we conduct a series of experiments on real logs from the search engine AOL search, which demonstrate the efficiency of the disambiguation method in short queries, and show the relation between the quality based clustering and the structure based clustering.}, subject = {Information Retrieval}, language = {en} } @phdthesis{Stegmaier2014, author = {Stegmaier, Florian}, title = {Unified Retrieval in Distributed and Heterogeneous Multimedia Information Systems}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-27317}, school = {Universit{\"a}t Passau}, year = {2014}, abstract = {Multimedia retrieval is an essential part of today's world. This situation is observable in industrial domains, e.g., medical imaging, as well as in the private sector, visible by activities in manifold Social Media platforms. This trend led to the creation of a huge environment of multimedia information retrieval services offering multimedia resources for almost any user requests. Indeed, the encompassed data is in general retrievable by (proprietary) APIs and query languages, but unfortunately a unified access is not given due to arising interoperability issues between those services. In this regard, this thesis focuses on two application scenarios, namely a medical retrieval system supporting a radiologist's workflow, as well as an interoperable image retrieval service interconnecting diverse data silos. The scientific contribution of this dissertation is split in three different parts: the first part of this thesis improves the metadata interoperability issue. Here, major contributions to a community-driven, international standardization have been proposed leading to the specification of an API and ontology to enable a unified annotation and retrieval of media resources. The second part issues a metasearch engine especially designed for unified retrieval in distributed and heterogeneous multimedia retrieval environments. This metasearch engine is capable of being operated in a federated as well as autonomous manner inside the aforementioned application scenarios. The remaining third part ensures an efficient retrieval due to the integration of optimization techniques for multimedia retrieval in the overall query execution process of the metasearch engine.}, subject = {Abfrage}, language = {en} } @phdthesis{Zhu2019, author = {Zhu, Chunjie}, title = {Understanding the Formation and Improving the Accuracy of Teacher Judgment}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-7387}, school = {Universit{\"a}t Passau}, pages = {ix, 120 Seiten}, year = {2019}, abstract = {Die Forschung zu Lehrkrafturteilen hat in den letzten drei Jahrzehnten betr{\"a}chtliche Fortschritte gemacht. Die Bedeutung des Lehrkrafturteils und die Variabilit{\"a}t in der Urteilsgenauigkeit erfordern eine eingehendere Untersuchung. Basierend auf der {\"U}berpr{\"u}fung fr{\"u}herer Studien wurde ein systematischer analytischer Rahmen vorbereitet, der aus drei Hauptstudien besteht, um das Verst{\"a}ndnis der Prozesse und Merkmale von Lehrkrafturteilen zu erweitern. In den drei vorgestellten Studien wurde insbesondere untersucht, wie Lehrkrafturteile durch verschiedene Sch{\"u}lermerkmale generiert werden, welche M{\"o}glichkeiten es gibt, die Urteilsgenauigkeit von Lehrkr{\"a}ften zu verbessern und ob die Urteilsgenauigkeit von Lehrkr{\"a}ften im Laufe der Zeit stabil bleiben kann. In der ersten Studie wurde das Linsenmodell der Theorie der sozialen Beurteilung angewendet, um die Einsch{\"a}tzungen von Lehrpersonen {\"u}ber die Leistung von Sch{\"u}lerinnen und Sch{\"u}lern und ihre Strategien der Informationsverarbeitung besser zu verstehen. 260 Lehrkr{\"a}fte aus sieben chinesischen Grundschulen wurden gebeten, aus sieben Informationsquellen Sch{\"u}lermerkmale auszuw{\"a}hlen und zu bewerten, anhand derer sie die Leistungen der Sch{\"u}ler beurteilen k{\"o}nnten. Die Lehrpersonen entwickelten eine klare Hierarchie der verwendeten Datenquellen. Die besten Informationen wurden aus den F{\"a}higkeiten und Einstellungen der Sch{\"u}lerinnen und Sch{\"u}ler gewonnen und die am wenigsten wichtigen Informationen aus der sozialen Interaktion mit anderen sowie aus der Sch{\"u}ler-Demografie. Um genauere Einsch{\"a}tzungen zu treffen, sollten die Lehrkr{\"a}fte {\"u}ber g{\"u}ltige Indikatoren f{\"u}r die Sch{\"u}lerleistung informiert werden. Die zweite Studie zielte darauf ab, die Urteilsgenauigkeit von Lehrkr{\"a}ften und die Leistung der Sch{\"u}lerinnen und Sch{\"u}ler durch den Einsatz von Classroom-Response-Systemen („Clickern") zu f{\"o}rdern. 20 Schulklassen mit 459 Sch{\"u}lerinnen und Sch{\"u}lern der sechsten Klasse und ihren Mathematiklehrkr{\"a}ften wurden f{\"u}r eine f{\"u}nfw{\"o}chige quasi-experimentelle Interventionsstudie mit einem Pre- und Post-Test in drei Gruppen eingeteilt. Die Ergebnisse zeigen, dass beide Ziele weitgehend erreicht werden konnten. Sch{\"u}lerinnen und Sch{\"u}ler der Clicker-Gruppe haben durch die Intervention mehr mathematisches Wissen erworben als Studenten der Tagebuch- und Kontrollgruppe. Die Lehrkrafturteile aller drei Gruppen wurden vom Pre- zum Post-Test genauer. Lehrpersonen, die Clicker verwendeten, beurteilten jedoch mit h{\"o}chster Genauigkeit. Clicker k{\"o}nnen als wertvolles Werkzeug zur Verbesserung der Urteilsgenauigkeit von Lehrkr{\"a}ften empfohlen werden. In der dritten Studie wurde die zeitliche Stabilit{\"a}t der Urteilsgenauigkeit der Lehrkr{\"a}fte hinsichtlich Motivation, Emotion und Leistung der Sch{\"u}lerinnen und Sch{\"u}ler untersucht. Neun Klassen mit 326 Sechstkl{\"a}sslern einer chinesischen Grundschule und ihren Mathematiklehrpersonen nahmen an der Studie teil. Die Sch{\"u}ler arbeiteten an einem standardisierten Mathematik-Test und einem Selbstbeschreibungsfragebogen zu Motivation und Emotion. Die Lehrpersonen beurteilten die Motivation, Emotion und Leistung jedes einzelnen Sch{\"u}lers anhand einzelner Items. Das Lehrkrafturteil und die Eigenschaften der Sch{\"u}lerinnen und Sch{\"u}ler wurden innerhalb von vier Wochen zweimal gemessen. Die Ergebnisse zeigten, dass die Lehrkr{\"a}fte in der Lage waren, die Sch{\"u}lerleistungen mit hoher Genauigkeit, die Motivation der Sch{\"u}lerinnen und Sch{\"u}ler mit m{\"a}ßiger bis hoher Genauigkeit und die Emotion der Sch{\"u}lerinnen und Sch{\"u}ler meist mit geringer Genauigkeit zu bewerten. Die Urteilsgenauigkeit der Lehrpersonen war sehr stabil mit nur geringen Ver{\"a}nderungen an den verschiedenen Genauigkeitskomponenten. Es kann gefolgert werden, dass chinesische Grundschullehrkr{\"a}fte in der Lage sind, zu verschiedenen Zeitpunkten faire Urteile {\"u}ber Sch{\"u}lerleistungen und der Motivation ihrer Sch{\"u}lerinnen und Sch{\"u}ler zu treffen. Die Emotionen der Sch{\"u}lerinnen und Sch{\"u}ler sind f{\"u}r Lehrpersonen jedoch schwer zu erfassen.}, subject = {Lehrer}, language = {en} }