Bachelor's theses of year 2024
Theses and projects (PhD, MSc, BSc, Project)
-
Entwicklung eines Konzepts zur Erhebung von IT-Sicherheitskennzahlen für ein ISO/IEC-27001 konformes ISMS.
1
2024.
BibTeX Entry
@misc{schm24, author = {Christian Schmidt}, title = {{Entwicklung} eines {Konzepts} zur {Erhebung} von {IT-Sicherheitskennzahlen} für ein {ISO/IEC-27001} konformes {ISMS}}, year = {2024}, key = {schm24}, month = {1}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Stefan Metzger}, type = {Bachelorthesis}, } -
Comparison of Machine Learning Classification Architectures for IoT Communication Data.
1
2024.
BibTeX Entry
@misc{schw24, author = {Lukas Schwab}, title = {{Comparison} of {Machine} {Learning} {Classification} {Architectures} for {IoT} {Communication} {Data}}, year = {2024}, key = {schw24}, month = {1}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Radio Resource Control: Angriffsklassifikationen und exemplarische Implementierung.
1
2024.
BibTeX Entry
@misc{well24, author = {Dominik Wellnitz}, title = {{Radio} {Resource} {Control:} {Angriffsklassifikationen} und exemplarische {Implementierung}}, year = {2024}, key = {well24}, month = {1}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Topic Recognition in Conversations for Forensic Text Analysis.
1
2024.
BibTeX Entry
@misc{wiet24, author = {Simon Wiethase}, title = {{Topic} {Recognition} in {Conversations} for {Forensic} {Text} {Analysis}}, year = {2024}, key = {wiet24}, month = {1}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Habit Analysis of Broadcast Information of CMAS/ETWS and GPS SIBs in 4G and 5G Networks.
2
2024.
BibTeX Entry
@misc{sroh24, author = {Serhiy Srohyy}, title = {{Habit} {Analysis} of {Broadcast} {Information} of {CMAS/ETWS} and {GPS} {SIBs} in 4G and 5G {Networks}}, year = {2024}, key = {sroh24}, month = {2}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Comparative Analysis of BLE Location-tracking Accessories.
2
2024.
BibTeX Entry
@misc{loff24, author = {E. Philipp Löffler}, title = {{Comparative} {Analysis} of {BLE} {Location-tracking} {Accessories}}, year = {2024}, key = {loff24}, month = {2}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Dr. Kai Bader (ZITiS)}, type = {Bachelorthesis}, } -
Comparative Analysis of Rule-Based Classifiers and Machine Learning Models for Identifying German Language Varieties.
3
2024.
BibTeX Entry
@misc{lee24, author = {Jihyun Lee}, title = {{Comparative} {Analysis} of {Rule-Based} {Classifiers} and {Machine} {Learning} {Models} for {Identifying} {German} {Language} {Varieties}}, year = {2024}, key = {lee24}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sebastian Böhm}, type = {Bachelorthesis}, } -
Automatisierung des Labelings von IoT-Kommunikationsdatenströmen im maschinellen Lernen.
3
2024.
BibTeX Entry
@misc{drus24, author = {Felix Druschel}, title = {{Automatisierung} des {Labelings} von {IoT-Kommunikationsdatenströmen} im maschinellen {Lernen}}, year = {2024}, key = {drus24}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sebastian Böhm}, type = {Bachelorthesis}, } -
DTLS Key Establishment in Wireless Sensor Networks.
3
2024.
BibTeX Entry
@misc{kell24, author = {Erik Kellenter}, title = {{DTLS} {Key} {Establishment} in {Wireless} {Sensor} {Networks}}, year = {2024}, key = {kell24}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Evaluation of Incident Exchange Formats for Higher Education Institutions Collaboration in Security Incident Management.
4
2024.
BibTeX Entry
@misc{maha24, author = {Shreeya Maharjan}, title = {{Evaluation} of {Incident} {Exchange} {Formats} for {Higher} {Education} {Institutions} {Collaboration} in {Security} {Incident} {Management}}, year = {2024}, key = {maha24}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Miran Mizani}, type = {Bachelorthesis}, } -
Analyse und Identifikation von Optimierungspotentialen für den Energieverbrauch in der Datenhaltung und Verarbeitung.
4
2024.
BibTeX Entry
@misc{thie24, author = {Triston Thies}, title = {{Analyse} und {Identifikation} von {Optimierungspotentialen} für den {Energieverbrauch} in der {Datenhaltung} und {Verarbeitung}}, year = {2024}, key = {thie24}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Michael Ott (LRZ)}, type = {Bachelorthesis}, } -
Requirements associated with a command line interface for a dynamic hardware topology information system.
4
2024.
BibTeX Entry
@misc{schn24a, author = {Stefan Schnellberger}, title = {{Requirements} associated with a command line interface for a dynamic hardware topology information system}, year = {2024}, key = {schn24a}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Daniel Diefenthaler}, type = {Bachelorthesis}, } -
Designing a MLIR Dialect for the Brainfuck Language.
4
2024.
PDF
Abstract
MLIR is an extensible compiler infrastructure with support for parsing, printing, documentation, conversion and optimization of intermediate representation (IR). While being a rather young project, it is already used in applications ranging from representation of machine learning models, polyhedral optimization and quantum assembly languages. The extensibility of MLIR's IR is enabled by the concepts of operation (Op) and dialect. While Ops are a way to model functionality of any level, dialects can group operations of a common functionality or motivation. The extensibility of MLIR makes it a rather complex framework. Users can extend the MLIR IR and pass infrastructure, both declarative and imperative. Furthermore, they can use existing dialects and passes to combine them with their custom ones. To improve the accessibility of MLIR for the general public, we designed a starter project simple enough to focus on the possibilities of MLIR and complex enough to include the use of many of MLIR's features. This thesis presents a MLIR-based compiler for the Brainfuck language: the MLIR Brainfuck project. We implemented frontend, middleware and backend based on an import script to translate Brainfuck programs to an MLIR representation, three MLIR inherent abstractions to model Brainfuck on different levels, conversion passes between them and a conversion to the LLVM intermediate representation.BibTeX Entry
@misc{schw24a, author = {Jacob Schwaiger}, title = {{Designing} a {MLIR} {Dialect} for the {Brainfuck} {Language}}, year = {2024}, pdf = {https://bib.nm.ifi.lmu.de/pdf/schw24a.pdf}, abstract = {MLIR is an extensible compiler infrastructure with support for parsing, printing, documentation, conversion and optimization of intermediate representation (IR). While being a rather young project, it is already used in applications ranging from representation of machine learning models, polyhedral optimization and quantum assembly languages. The extensibility of MLIR's IR is enabled by the concepts of operation (Op) and dialect. While Ops are a way to model functionality of any level, dialects can group operations of a common functionality or motivation. The extensibility of MLIR makes it a rather complex framework. Users can extend the MLIR IR and pass infrastructure, both declarative and imperative. Furthermore, they can use existing dialects and passes to combine them with their custom ones. To improve the accessibility of MLIR for the general public, we designed a starter project simple enough to focus on the possibilities of MLIR and complex enough to include the use of many of MLIR's features. This thesis presents a MLIR-based compiler for the Brainfuck language: the MLIR Brainfuck project. We implemented frontend, middleware and backend based on an import script to translate Brainfuck programs to an MLIR representation, three MLIR inherent abstractions to model Brainfuck on different levels, conversion passes between them and a conversion to the LLVM intermediate representation.}, key = {schw24a}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Pascal Jungblut}, type = {Bachelorthesis}, } -
A Symphony of Metrics: Assessing the Advantages of eBPF over conventional Benchmarking Tools.
2
2024.
PDF
Abstract
Supercomputers are configured to handle demanding calculations, and their architecture varies based on the workloads they run. Some workloads involve extensive data communication between instances, requiring a high grade of network traffic throughput capabilities of the cluster and an optimized architecture for intercommunication of these workloads. Other workloads may require more hardware-based resources, such as high amounts of system memory, compute performance, and disk speeds, calling for cluster architectures optimized for these resource types. In general, It can be said, that various cluster architectures have their own benefits and non-benefits, on which informed decisions have to be made. Choosing the ideal cluster architecture for a particular workload has been a topic of extensive research. The decision-making process begins with gathering behavioral data on the workload; acting on this data is a separate field of study with various approaches. Most systems utilize a user-space program that can benchmark the workload to make its behavior more measurable. Recent work on the extended Berkeley Packet Filter (eBPF) has made it possible to bench- mark at a lower level within the kernel space. eBPF provides more control over resources and better access to operating system functions and information that are not easily accessible through user-space programs. This thesis aims to assess eBPF’s advantages in Linux systems compared to conven tional benchmarking solutions. We will develop an eBPF-based benchmarking reference implementation to collect per-process usage statistics, including CPU, Memory, and Disk utilization. Our assessment will compare this system against traditional solutions, focusing on correctness, modularity, simplicity, and scalability.BibTeX Entry
@misc{schn24, author = {Daniel Schneider}, title = {A {Symphony} of {Metrics:} {Assessing} the {Advantages} of {eBPF} over conventional {Benchmarking} {Tools}}, year = {2024}, pdf = {https://bib.nm.ifi.lmu.de/pdf/schn24.pdf}, abstract = {Supercomputers are configured to handle demanding calculations, and their architecture varies based on the workloads they run. Some workloads involve extensive data communication between instances, requiring a high grade of network traffic throughput capabilities of the cluster and an optimized architecture for intercommunication of these workloads. Other workloads may require more hardware-based resources, such as high amounts of system memory, compute performance, and disk speeds, calling for cluster architectures optimized for these resource types. In general, It can be said, that various cluster architectures have their own benefits and non-benefits, on which informed decisions have to be made. Choosing the ideal cluster architecture for a particular workload has been a topic of extensive research. The decision-making process begins with gathering behavioral data on the workload; acting on this data is a separate field of study with various approaches. Most systems utilize a user-space program that can benchmark the workload to make its behavior more measurable. Recent work on the extended Berkeley Packet Filter (eBPF) has made it possible to bench- mark at a lower level within the kernel space. eBPF provides more control over resources and better access to operating system functions and information that are not easily accessible through user-space programs. This thesis aims to assess eBPF’s advantages in Linux systems compared to conven tional benchmarking solutions. We will develop an eBPF-based benchmarking reference implementation to collect per-process usage statistics, including CPU, Memory, and Disk utilization. Our assessment will compare this system against traditional solutions, focusing on correctness, modularity, simplicity, and scalability.}, key = {schn24}, month = {2}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Maximilian Höb}, type = {Bachelorthesis}, } -
Design and Evaluation of a Sign Language Dictionary leveraging Wikidata’s Semantics.
3
2024.
PDF
Abstract
The work explores the utilization of the Wikidata platform and its standard tools as the backend for an online dictionary for Hausa Sign Language. In this context, there exists an official website providing an overview of Hausa Sign Language, alongside two separate applications for Android and iOS, each with its own database. This situation results in the aim of creating a common database to be implemented into a cross-platform application. Dart/Flutter was chosen as the cross-platform programming language. For the common database, Wikidata: Lexicographical Data was selected as an online dictionary. Due to its structure and regulations for sign language representation, the frontend had to be adapted to efficiently display the content of each entry. To retrieve specific entry components, the SPARQL system was employed for querying across diverse data sources, assisting in addressing certain regulations imposed by Wikidata. The interface for executing SPARQL queries was implemented using the FutureBuilder widget, which allows for the asynchronous construction of user interfaces while awaiting the completion of Future objects. Another crucial aspect was overcoming the lack of a local database to implement features like marking entries as favorites. The SharedPreferences package was employed to persistently store these entries. Although the implementation is currently in the prototype stage, the feasibility of the work could be demonstrated. While some requirements could not be fully verified, the overall potential of implementing Wikidata: Lexicographical was showcased, highlighting its importance over the current state with two separate applications. Additionally, identified disadvantages were complemented with proposed solutions, such as local data caching to mitigate internet dependency when using the application.BibTeX Entry
@misc{scha24, author = {Eva Schambach}, title = {{Design} and {Evaluation} of a {Sign} {Language} {Dictionary} leveraging {Wikidata’s} {Semantics}}, year = {2024}, pdf = {https://bib.nm.ifi.lmu.de/pdf/scha24.pdf}, abstract = {The work explores the utilization of the Wikidata platform and its standard tools as the backend for an online dictionary for Hausa Sign Language. In this context, there exists an official website providing an overview of Hausa Sign Language, alongside two separate applications for Android and iOS, each with its own database. This situation results in the aim of creating a common database to be implemented into a cross-platform application. Dart/Flutter was chosen as the cross-platform programming language. For the common database, Wikidata: Lexicographical Data was selected as an online dictionary. Due to its structure and regulations for sign language representation, the frontend had to be adapted to efficiently display the content of each entry. To retrieve specific entry components, the SPARQL system was employed for querying across diverse data sources, assisting in addressing certain regulations imposed by Wikidata. The interface for executing SPARQL queries was implemented using the FutureBuilder widget, which allows for the asynchronous construction of user interfaces while awaiting the completion of Future objects. Another crucial aspect was overcoming the lack of a local database to implement features like marking entries as favorites. The SharedPreferences package was employed to persistently store these entries. Although the implementation is currently in the prototype stage, the feasibility of the work could be demonstrated. While some requirements could not be fully verified, the overall potential of implementing Wikidata: Lexicographical was showcased, highlighting its importance over the current state with two separate applications. Additionally, identified disadvantages were complemented with proposed solutions, such as local data caching to mitigate internet dependency when using the application.}, key = {scha24}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Maximilian Höb}, type = {Bachelorthesis}, } -
Analyse Technischer Merkmale von IEEE 802.15.4 WPAN Kommunikationsdaten.
4
2024.
BibTeX Entry
@misc{vals24, author = {Georgios Valsamidis}, title = {{Analyse} {Technischer} {Merkmale} von {IEEE} 802.15.4 {WPAN} {Kommunikationsdaten}}, year = {2024}, key = {vals24}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Capabilities and Limitations of Localization Mechanism in 5G Mobile Networks.
4
2024.
BibTeX Entry
@misc{schn24b, author = {Tim Schneider e Silva}, title = {{Capabilities} and {Limitations} of {Localization} {Mechanism} in 5G {Mobile} {Networks}}, year = {2024}, key = {schn24b}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Simulating Circuits in Quantum Natural Language Processing using Tensor Networks.
4
2024.
PDF
Abstract
Quantum natural language processing deals with the implementation of natural language models on quantum hardware. It remains uncertain whether these models benefit from a quantum advantage or can be efficiently simulated on classical hardware. Tensor networks emerge as a promising tool in the efficient approximation of quantum states. This thesis explores the feasibility and potential advantages of employing tensor network simulation for quantum natural language processing. Using a matrix product state architecture, we investigate the complexity of simulating circuits obtained from the Categorical Compositional Distributional framework. Our results indicate an exponential complexity when these simulations are performed non-approximated. To analyze the impact of approximation on the performance of quantum natural language processing models, we introduce a binary classification task and train on two datasets, focusing on the difference between training with and without approximating the simulation. Our findings indicate that training with approximated simulation is possible, yet it exhibits greater instability and slower convergence.BibTeX Entry
@misc{muel24, author = {Adrian Mülthaler}, title = {{Simulating} {Circuits} in {Quantum} {Natural} {Language} {Processing} using {Tensor} {Networks}}, year = {2024}, pdf = {https://bib.nm.ifi.lmu.de/pdf/muel24.pdf}, abstract = {Quantum natural language processing deals with the implementation of natural language models on quantum hardware. It remains uncertain whether these models benefit from a quantum advantage or can be efficiently simulated on classical hardware. Tensor networks emerge as a promising tool in the efficient approximation of quantum states. This thesis explores the feasibility and potential advantages of employing tensor network simulation for quantum natural language processing. Using a matrix product state architecture, we investigate the complexity of simulating circuits obtained from the Categorical Compositional Distributional framework. Our results indicate an exponential complexity when these simulations are performed non-approximated. To analyze the impact of approximation on the performance of quantum natural language processing models, we introduce a binary classification task and train on two datasets, focusing on the difference between training with and without approximating the simulation. Our findings indicate that training with approximated simulation is possible, yet it exhibits greater instability and slower convergence.}, key = {muel24}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Korbinian Staudacher and Florian Krötz and Jakob Murauer and Axel Wisiorek}, type = {Bachelorthesis}, } -
Post-Compromise Security in Revocable Identity-Based Encryption.
6
2024.
BibTeX Entry
@misc{loes24, author = {Kajetan Lösch}, title = {{Post-Compromise} {Security} in {Revocable} {Identity-Based} {Encryption}}, year = {2024}, key = {loes24}, month = {6}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sophia Grundner-Culemann}, type = {Bachelorthesis}, } -
Analysis and Evaluation of IoT Device Identification using Periodic Communication.
6
2024.
BibTeX Entry
@misc{lind24, author = {Thomas Lindner}, title = {{Analysis} and {Evaluation} of {IoT} {Device} {Identification} using {Periodic} {Communication}}, year = {2024}, key = {lind24}, month = {6}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Predicting Movement Paths from Cell Change Events.
6
2024.
BibTeX Entry
@misc{gill24, author = {Alexander Giller}, title = {{Predicting} {Movement} {Paths} from {Cell} {Change} {Events}}, year = {2024}, key = {gill24}, month = {6}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Automatisierte IT-Sicherheitstests im Software-Entwicklungsprozess: Einsatz von Schwachstellenscannern.
6
2024.
BibTeX Entry
@misc{bawi24, author = {Markus Bawiedemann}, title = {{Automatisierte} {IT-Sicherheitstests} im {Software-Entwicklungsprozess:} {Einsatz} von {Schwachstellenscannern}}, year = {2024}, key = {bawi24}, month = {6}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Function Fingerprinting in 5G Core Networks.
7
2024.
BibTeX Entry
@misc{wink24, author = {Sebastian Winkler}, title = {{Function} {Fingerprinting} in 5G {Core} {Networks}}, year = {2024}, key = {wink24}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Untersuchung des Zusammenhangs zwischen Zellmorphologie und Zellmobilität.
7
2024.
BibTeX Entry
@misc{wint24, author = {Benedikt Winter}, title = {{Untersuchung} des {Zusammenhangs} zwischen {Zellmorphologie} und {Zellmobilität}}, year = {2024}, key = {wint24}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Recognition of Text Origin in German Language using ML Classification Models.
7
2024.
BibTeX Entry
@misc{wong24, author = {Hui Min Wong}, title = {{Recognition} of {Text} {Origin} in {German} {Language} using {ML} {Classification} {Models}}, year = {2024}, key = {wong24}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
XACML Policy Verification for Attribute Based Access Control by AI Deployment.
7
2024.
BibTeX Entry
@misc{wend24, author = {Julian Wendlandt}, title = {{XACML} {Policy} {Verification} for {Attribute} {Based} {Access} {Control} by {AI} {Deployment}}, year = {2024}, key = {wend24}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Unlock the Interoperability: Solutions for an Open Cloud Ecosystem.
7
2024.
BibTeX Entry
@misc{lu24, author = {Kexin Lu}, title = {{Unlock} the {Interoperability:} {Solutions} for an {Open} {Cloud} {Ecosystem}}, year = {2024}, key = {lu24}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Jan Schmidt}, type = {Bachelorthesis}, } -
A Comparative Analysis and Classification of Public Key Certificate Revocation Methods.
9
2024.
BibTeX Entry
@misc{ahme24, author = {Md Sabbir Ahmed}, title = {A {Comparative} {Analysis} and {Classification} of {Public} {Key} {Certificate} {Revocation} {Methods}}, year = {2024}, key = {ahme24}, month = {9}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sophia Grundner-Culemann}, type = {Bachelorthesis}, } -
Comparing Tensor Network Simulations for Quantum Fourier Transformation.
9
2024.
BibTeX Entry
@misc{cims24, author = {Ege Cimsir}, title = {{Comparing} {Tensor} {Network} {Simulations} for {Quantum} {Fourier} {Transformation}}, year = {2024}, key = {cims24}, month = {9}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Korbinian Staudacher and Florian Krötz}, type = {Bachelorthesis}, } -
Performance Analysis of Synchronization Mechanisms in Java.
9
2024.
BibTeX Entry
@misc{liu24, author = {Yihan Liu}, title = {{Performance} {Analysis} of {Synchronization} {Mechanisms} in {Java}}, year = {2024}, key = {liu24}, month = {9}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Karl Fuerlinger}, type = {Bachelorthesis}, } -
Quantenschlüsselaustausch: Analyse der Realisierbarkeit und Herausforderungen.
10
2024.
BibTeX Entry
@misc{nalb24, author = {Suzan Nalbant}, title = {{Quantenschlüsselaustausch:} {Analyse} der {Realisierbarkeit} und {Herausforderungen}}, year = {2024}, key = {nalb24}, month = {10}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sophia Grundner-Culemann and Gazdag}, type = {Bachelorthesis}, } -
Systematic Review of Adaptive Virtual Reality Training.
10
2024.
BibTeX Entry
@misc{buet24, author = {Tobias Büttgen}, title = {{Systematic} {Review} of {Adaptive} {Virtual} {Reality} {Training}}, year = {2024}, key = {buet24}, month = {10}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Fabio Genz}, type = {Bachelorthesis}, } -
Analyse und Umwandlung von TEMS Logs zu PCAP.
10
2024.
BibTeX Entry
@misc{kulb24, author = {David Kulbe}, title = {{Analyse} und {Umwandlung} von {TEMS} {Logs} zu {PCAP}}, year = {2024}, key = {kulb24}, month = {10}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Entwicklung eines auf LDAP und Active Directory basierenden RBAC und PBAC Access Control Managements unter Berücksichtigung gesetzlicher und regulatorischer Normen und Vorschriften zur Verwendung in einer hybriden Cloud-Umgebung.
11
2024.
BibTeX Entry
@misc{gulc24, author = {Duygu Gülcehre}, title = {{Entwicklung} eines auf {LDAP} und {Active} {Directory} basierenden {RBAC} und {PBAC} {Access} {Control} {Managements} unter {Berücksichtigung} gesetzlicher und regulatorischer {Normen} und {Vorschriften} zur {Verwendung} in einer hybriden {Cloud-Umgebung}}, year = {2024}, key = {gulc24}, month = {11}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Stefan Metzger}, type = {Bachelorthesis}, } -
Conceptualisation of a Continuity Plan for Active Directory Services.
11
2024.
BibTeX Entry
@misc{abdu24, author = {Adam Abdullah}, title = {{Conceptualisation} of a {Continuity} {Plan} for {Active} {Directory} {Services}}, year = {2024}, key = {abdu24}, month = {11}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Michael Schmidt}, type = {Bachelorthesis}, } -
Einfluss von adaptiven VR-Trainingsanwendungen auf den Lerntransfer.
11
2024.
BibTeX Entry
@misc{dame24, author = {Marco D'Amelio}, title = {{Einfluss} von adaptiven {VR-Trainingsanwendungen} auf den {Lerntransfer}}, year = {2024}, key = {dame24}, month = {11}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Fabio Genz}, type = {Bachelorthesis}, } -
Entwicklung eines Modells für Handlungsanweisungen zur Abwehr von Cyberangriffen.
12
2024.
BibTeX Entry
@misc{klug24, author = {Sven-Gerrit Kluge}, title = {{Entwicklung} eines {Modells} für {Handlungsanweisungen} zur {Abwehr} von {Cyberangriffen}}, year = {2024}, key = {klug24}, month = {12}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Bachelorthesis}, } -
Flow-based Activity Recognition from Statistical Traffic Analysis.
12
2024.
BibTeX Entry
@misc{li24a, author = {Biwen Li}, title = {{Flow-based} {Activity} {Recognition} from {Statistical} {Traffic} {Analysis}}, year = {2024}, key = {li24a}, month = {12}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Fabian Dreer}, type = {Bachelorthesis}, }
Disclaimer:
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.