@inproceedings{SchoenhaerlFuxenGrafetal., author = {Sch{\"o}nh{\"a}rl, Stefan and Fuxen, Philipp and Graf, Julian and Schmidt, Jonas and Hackenberg, Rudolf and Mottok, J{\"u}rgen}, title = {An Automotive Penetration Testing Framework for IT-Security Education}, series = {Cloud Computing 2022: The Thirteenth International Conference on Cloud Computing, GRIDs, and Virtualization, Special Track FAST-CSP, Barcelona, Spain, 24.-28.04.2022}, booktitle = {Cloud Computing 2022: The Thirteenth International Conference on Cloud Computing, GRIDs, and Virtualization, Special Track FAST-CSP, Barcelona, Spain, 24.-28.04.2022}, publisher = {IARIA}, address = {[Wilmington, DE, USA]}, isbn = {978-1-61208-948-5}, pages = {1 -- 6}, abstract = {Automotive Original Equipment Manufacturer (OEM) and suppliers started shifting their focus towards the security of their connected electronic programmable products recently since cars used to be mainly mechanical products. However, this has changed due to the rising digitalization of vehicles. Security and functional safety have grown together and need to be addressed as a single issue, referred to as automotive security, in the following article. One way to accomplish security is automotive security education. The scientific contribution of this paper is to establish an Automotive Penetration Testing Education Platform (APTEP). It consists of three layers representing different attack points of a vehicle. The layers are the outer, inner, and core layers. Each of those contains multiple interfaces, such as Wireless Local Area Network (WLAN) or electric vehicle charging interfaces in the outer layer, message bus systems in the inner layer, and debug or diagnostic interfaces in the core layer. One implementation of APTEP is in a hardware case and as a virtual platform, referred to as the Automotive Network Security Case (ANSKo). The hardware case contains emulated control units and different communication protocols. The virtual platform uses Docker containers to provide a similar experience over the internet. Both offer two kinds of challenges. The first introduces users to a specific interface, while the second combines multiple interfaces, to a complex and realistic challenge. This concept is based on modern didactic theory, such as constructivism and problem-based learning. Computer Science students from the Ostbayerische Technische Hochschule (OTH)Regensburg experienced the challenges as part of a special topic course and provided positive feedback.}, language = {en} } @inproceedings{NadimpalliHauserBittneretal., author = {Nadimpalli, Vamsi Krishna and Hauser, Florian and Bittner, Dominik and Grabinger, Lisa and Staufer, Susanne and Mottok, J{\"u}rgen}, title = {Systematic Literature Review for the Use of AI Based Techniques in Adaptive Learning Management Systems}, series = {Proceedings of the 5th European Conference on Software Engineering Education, Seeon/Germany, June 19 - 21, 2023}, booktitle = {Proceedings of the 5th European Conference on Software Engineering Education, Seeon/Germany, June 19 - 21, 2023}, editor = {Mottok, J{\"u}rgen}, publisher = {Association for Computing Machinery}, address = {New York}, isbn = {978-1-4503-9956-2}, doi = {10.1145/3593663.3593681}, pages = {83 -- 92}, abstract = {Nowadays, learning management systems are widely employed in all educational institutions to instruct students as a result of the increasing in online usage. Today's learning management systems provide learning paths without personalizing them to the characteristics of the learner. Therefore, research these days is concentrated on employing AI-based strategies to personalize the systems. However, there are many different AI algorithms, making it challenging to determine which ones are most suited for taking into account the many different features of learner data and learning contents. This paper conducts a systematic literature review in order to discuss the AI-based methods that are frequently used to identify learner characteristics, organize the learning contents, recommend learning paths, and highlight their advantages and disadvantages.}, language = {en} } @techreport{Schultz, author = {Schultz, Maximilian}, title = {1.Bericht f{\"u}r das Regensburg Center of Health Sciences and Technology (RCHST)}, volume = {2024}, publisher = {OTH Regensburg}, address = {Regensburg}, doi = {10.35096/othr/pub-7312}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:898-opus4-73125}, pages = {17}, abstract = {Der vorliegende Bericht zeigt den aktuellen Stand des Projekts „K{\"u}nstliche Intelligenz f{\"u}r Nichtregierungsorganisationen (KINiro) - Bedarf, Akzeptanz und Umsetzungsm{\"o}glichkeiten" an der OTH Regensburg am Institut f{\"u}r Sozialforschung und Technikfolgenabsch{\"a}tzung (IST). Im Projektbericht wird das Projekt KINiro mit besonderem Blick auf die Erkenntnisse und T{\"a}tigkeiten im Gesundheitswesen aufgezeigt. Das Projekt KINiro wird mit Laufzeit Januar 2023 bis Dezember 2025 durch das Bundesministerium f{\"u}r Familie, Senioren, Frauen und Jugend (BMFSFJ) gef{\"o}rdert. Eine zus{\"a}tzliche Unterst{\"u}tzung bietet das Regensburg Center of Health Sciences and Technology (RCHST)}, language = {de} } @inproceedings{SchwaegerlUhrigWestfechtel, author = {Schw{\"a}gerl, Felix and Uhrig, Sabrina and Westfechtel, Bernhard}, title = {A Graph-based Algorithm for Three-way Merging of Ordered Collections in EMF Models}, series = {Science of Computer Programming}, volume = {113}, booktitle = {Science of Computer Programming}, number = {Part 1}, doi = {10.1016/j.scico.2015.02.008}, pages = {51 -- 81}, abstract = {In EMF models, ordered collections appear as the values of multi-valued structural features. Traditional, text-based version control systems do not sufficiently support three-way merging of ordered collections inside EMF models since they cannot guarantee a consistent result. The operation three-way merging is defined as follows: based on a common base version b, two alternative versions and were developed by copying and modifying the base version. To reconcile these changes, a merged version m is to be created as a common successor of and . In this paper, we present a graph algorithm to solve the problem of three-way merging of ordered collections in EMF models. Each version of a collection can be represented by means of a linearly ordered graph. To create the merged version, these graphs are combined to a merged collection graph using set formula. To create the merged collection, a generalized topological sort is performed on the merged collection graph. Conflicts occur in case the order of elements cannot be deduced automatically; these conflicts are resolved either interactively or by default rules. We have implemented the merge algorithm in our tool BTMerge, which performs a consistency-preserving three-way merge of versions of EMF models being instances of arbitrary Ecore models. Our implementation relies on an alternative form of representing multiple versions of a collection, namely a versioned collection graph which forms a superimposition of collection versions. The algorithm presented here is purely state-based. Matching and merging of collections are clearly separated sub-problems. Insertions and deletions performed on the elements of the collection are propagated into the merged version in a consistent way. Our algorithm makes only minimal assumptions with regard to the underlying product model and thus may be applied to ordered collections inside plain text or XML files. By taking arbitrary move operations into account, the algorithm considerably goes beyond the functionality of contemporary merge tools which cannot adequately handle move operations.}, language = {en} } @inproceedings{BuchmannSchwaegerl, author = {Buchmann, Thomas and Schw{\"a}gerl, Felix}, title = {Breaking the Boundaries of Meta Models and Preventing Information Loss in Model-Driven Software Product Lines}, series = {Proceedings of the 11th International Conference on Evaluation of Novel Software Approaches to Software Engineering, Vol 1, 2016, Rome, Italy}, booktitle = {Proceedings of the 11th International Conference on Evaluation of Novel Software Approaches to Software Engineering, Vol 1, 2016, Rome, Italy}, publisher = {SCITEPRESS - Science and and Technology Publications}, doi = {10.5220/0005789100730083}, pages = {83}, abstract = {Model-driven software product line engineering is an integrating discipline for which tool support has become available recently. However, existing tools are still immature and have several weaknesses. Among others, limitations in variability, caused by meta model restrictions, and unintended information loss are not addressed. In this paper, we present two conceptual extensions to model-driven product line engineering based on negative variability, being alternative mappings and surrogates. Alternative mappings allow for unconstrained variability, mitigating meta model restrictions by virtually extending the underlying multi-variant domain model. Surrogates prevent unintended information loss during product derivation based on a contextsensitive product analysis, which can be controlled by a declarative OCL-based language. Both extensions have been implemented in FAMILE, a model-driven product line tool that is based on EMF, provides dedicated consistency repair mechanisms, and completely automates application engineering. The added value of alternative mappings and surrogates is demonstrated by a running example.}, language = {en} } @inproceedings{SchwaegerlUhrigWestfechtel, author = {Schw{\"a}gerl, Felix and Uhrig, Sabrina and Westfechtel, Bernhard}, title = {Model-based tool support for consistent three-way merging of EMF models}, series = {ACME '13, Proceedings of the workshop on ACadeMics Tooling with Eclipse}, booktitle = {ACME '13, Proceedings of the workshop on ACadeMics Tooling with Eclipse}, publisher = {ACM}, address = {New York, NY, USA}, doi = {10.1145/2491279.2491281}, abstract = {Inadequate version control has been identified as a major obstacle to the application of model-driven software engineering. In particular, sophisticated support for merging model versions is urgently needed. We present a tool for merging of EMF models which may be applied to instances of arbitrary Ecore models. The tool advances the state of the art by guaranteeing a consistent merge result. Furthermore, it detects and resolves not only context-free, but also context-sensitive conflicts. Our merge tool is model-based; it relies on EMF for its implementation. Initial experiences gained from its application confirm that the merge tool operates both accurately and efficiently.}, language = {en} } @misc{MauererJoblinTamburrietal., author = {Mauerer, Wolfgang and Joblin, Mitchell and Tamburri, Damian Andrew and Paradis, Carlos and Kazman, Rick and Apel, Sven}, title = {In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study [Data set]}, doi = {10.5281/zenodo.4766388}, language = {en} } @misc{MauererScherzinger, author = {Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {Nullius in Verba - Reproducibility Tutorial [Data set]}, doi = {10.5281/zenodo.4730023}, abstract = {Reproduction package (docker image) for the ICDE 2021 tutorial "Nullius in Verba".}, language = {en} } @misc{SchmidbauerLobeSchaeferetal., author = {Schmidbauer, Lukas and Lobe, Elisabeth and Sch{\"a}fer, Ina and Mauerer, Wolfgang}, title = {It's Quick to be Square: Fast Quadratisation for Quantum Toolchains [Data set]}, doi = {10.5281/zenodo.14245588}, abstract = {Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an order as determined by the structure of the objective function and the properties of target hardware. When the structure of the problem representation is not aligned with structure and boundary conditions of the executing hardware, various overheads to degrade the computation may arise, possibly negating any possible quantum advantage. Therefore, automatic transformations of problem representations play an important role in quantum computing when descriptions (semi-)targeted at humans must be cast into forms that can be executed on quantum computers. Mathematically equivalent formulations are known to result in substantially different non-functional properties depending on hardware, algorithm and detail properties of the problem. Given the current state of noisy-intermediate scale quantum hardware (NISQ), these effects are considerably more pronounced than in classical computing. Likewise, efficiency of the transformation itself is relevant because possible quantum advantage may easily be eradicated by the overhead of transforming between representations. In this paper we consider a specific class of higher-level representations (polynomial unconstrained binary optimisation problems), and devise novel automatic transformation mechanisms into widely used quadratic unconstrained binary optimisation problems that substantially improve efficiency and versatility over the state of the art. We also identify what influence factors of lower-level details can be abstracted away in the transformation process, and which details must be made available to higher-level abstractions.}, language = {en} } @misc{Bugert, author = {Bugert, Flemming}, title = {Applying Ariadne: Dataset on Learning Styles and Moodle-Based Learning Paths [Data set]}, doi = {10.5281/zenodo.12594911}, abstract = {This dataset contains information queried from 22 students inside a Moodle based learning management system during the winter term 2023/24 at a German university. Abstract With the use of learning management systems students benefit from being recommended suitable learning elements based on their individual needs. In doing so, recommendation algorithms are applied which first query the student's learning style. To improve the recommendation of learning elements a continuous analysis of the individual's learning style is required. A frequent questionnaire assessment would however be too time consuming. Instead, in a prior study an algorithm has been designed to identify changes in learning styles from the student's selection of learning elements. In this paper, we investigate the functionality of that algorithm by applying it on real student data. In particular, we test if the algorithm correctly indicates changes in learning styles. The utilised data is collected in our learning management system. To be precise, the data is obtained from 22 students enrolled in a software engineering course during the winter term of 2023/24. The data comprises two types of information for each student: 1) learning style collected at the start and end of the term, and 2) the user's actual selection of learning elements inside the learning management system. The uniqueness of this study lies in the data and the evaluation strategy based on it. Having the learning style at the end of the semester period as ground truth allows us to test if the algorithm operates correctly with actual user data from our learning management system. The results validate the behaviour of our algorithm, yet they strongly suggest the need for an adaptation. Further research is required on how to parameterise the underlying models.}, language = {en} } @misc{SchmidbauerMauerer, author = {Schmidbauer, Lukas and Mauerer, Wolfgang}, title = {SAT Strikes Back: Parameter and Path Relations in Quantum Toolchains [Data set]}, doi = {10.5281/zenodo.15464391}, abstract = {In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form. Thereby, it is crucial to find (multiple) transformation paths that are optimised for (hardware specific) metrics. We zoom into this pictured tree of transformations by focussing on k-SAT instances as input and their transformation to QUBO, while considering structure and characteristic metrics of input, intermediate and output representations. Our results can be used to rate valid paths of transformation in advance—also in automated (quantum) toolchains. We support the automation aspect by considering stability and therefore predictability of free parameters and transformation paths. Moreover, our findings can be used in the manifesting era of error correction (since considering structure in a high abstraction layer can benefit error correcting codes in layers below). We also show that current research is closely linked to quadratisation techniques and their mathematical foundation.}, language = {en} } @misc{StockerLehrer, author = {Stocker, Philipp and Lehrer, Tobias}, title = {Machine Learning Dataset of U-Channel Sheet Metal Geometry Representations with Supervision Information for Drawability Assessment and Part Segmentation [Data set]}, doi = {10.5281/zenodo.15327950}, abstract = {The dataset contains 2533 geometries from four different parametric CAD models sampled from the U-Channel python package. The representations include the original CAD geometries (.step), graph binaries (.bin), meshes (.off), and point clouds (.xyz). Additionally, we provide labels for supervised learning use cases of local and global drawability assessment and part segmentation (.json) for all representations. Custom label computation for drawability assessment is enabled by the provided strains.zip file, which contains minor and major true strains for the given meshes. For more details, refer to the associated publication.}, language = {en} } @misc{Staufer, author = {Staufer, Susanne}, title = {Persistence of Learning Style, Learning Strategy, and Personality Traits [Data set]}, doi = {10.5281/zenodo.12743866}, abstract = {This dataset contains the result of the survey to learning styles, learning strategies, and personality traits. The survey was executed in winter term 2023/24 and summer term 2023 in a German university (OTH Regensburg) during the course "Software Engineering". Examined questionnaires are ILS (learning styles), LIST-K (learning strategies), and BFI-10 (personality traits). The same three questionnaires were asked at two different survey periods three to four months apart while each survey period lasts one to two weeks. Pretest data were examined at the start of the term, while posttest data at the end.}, language = {en} } @inproceedings{BittnerEzerGrabingeretal., author = {Bittner, Dominik and Ezer, Timur and Grabinger, Lisa and Hauser, Florian and Mottok, J{\"u}rgen}, title = {Unveiling the secrets of learning styles: decoding eye movements via machine learning}, series = {Proceedings of the 16th annual International Conference of Education, Research and Innovation (ICERI 2023), Seville, Spain, 11/13/2023 - 11/14/2023}, booktitle = {Proceedings of the 16th annual International Conference of Education, Research and Innovation (ICERI 2023), Seville, Spain, 11/13/2023 - 11/14/2023}, editor = {G{\´o}mez Chova, Luis and Gonz{\´a}lez Mart{\´i}nez, Chelo and Lees, Joanna}, publisher = {IATED}, isbn = {978-84-09-55942-8}, doi = {10.21125/iceri.2023.1291}, pages = {5153 -- 5162}, abstract = {Universities are faced with a rising number of dropouts in recent years. This is largely due to students' limited capability of finding individual learning paths through various course materials. However, a possible solution to this problem is the introduction of adaptive learning management systems, which recommend tailored learning paths to students - based on their individual learning styles. For the classification of learning styles, the most commonly used methods are questionnaires and learning analytics. Nevertheless, both methods are prone to errors: questionnaires may give superficial answers due to lack of time or motivation, while learning analytics do not reflect offline learning behavior. This paper proposes an alternative approach to classify students' learning styles by integrating eye tracking in combination with Machine Learning (ML) algorithms. Incorporating eye tracking technology into the classification process eliminates the potential problems arising from questionnaires or learning analytics by providing a more objective and detailed analysis of the subject's behavior. Moreover, this approach allows for a deeper understanding of subconscious processes and provides valuable insights into the individualized learning preferences of students. In order to demonstrate this approach, an eye tracking study is conducted with 117 participants using the Tobii Pro Fusion. Using qualitative and quantitative analyses, certain patterns in the subjects' gaze behavior are assigned to their learning styles given by the validated Index of Learning Styles (ILS) questionnaire. In short, this paper presents an innovative solution to the challenges associated with classifying students' learning styles. By combining eye tracking data with ML algorithms, an accurate and insightful understanding of students' individual learning paths can be achieved, ultimately leading to improved educational outcomes and reduced dropout rates.}, language = {en} } @misc{BittnerEzerGrabingeretal., author = {Bittner, Dominik and Ezer, Timur and Grabinger, Lisa and Hauser, Florian and Mottok, J{\"u}rgen}, title = {Eye Tracking based Learning Style Identification for Learning Management Systems [Data set]}, doi = {10.5281/zenodo.8349468}, abstract = {In recent years, universities have been faced with increasing numbers of students dropping out. This is partly due to the fact that students are limited in their ability to explore individual learning paths through different course materials. However, a promising remedy to this issue is the implementation of adaptive learning management systems. These systems recommend customised learning paths to students - based on their individual learning styles. Learning styles are commonly classified using questionnaires and learning analytics, but both methods are prone to error. Questionnaires may yield superficial responses due to time constraints or lack of motivation, while learning analytics ignore offline learning behaviour. To address these limitations, this study aims to integrating Eye Tracking for a more accurate classification of students' learning styles. Ultimately, this comprehensive approach could not only open up a deeper understanding of subconscious processes, but also provide valuable insights into students' unique learning preferences.}, language = {en} } @misc{MoserEberhardtMeyeretal., author = {Moser, Elisabeth and Eberhardt, Matthias and Meyer, Selina and Schmidhuber, Maximilian and Ketterer, Daniel}, title = {ARGO ship classification dataset [Data set]}, doi = {10.5281/zenodo.6058710}, abstract = {The ARGO ship classification dataset holds 1750 labelled images from PlanetScope-4-Band satelites. The dataset creation process and results on the dataset are published in the demo paper: {CITE} The imagery is provided as numpy binary files. All image data is licensed by Planet Labs PBC. The channel ordering is BGRN. The dataset is provided in two folders named "ship" and "non_ship". Those folders correspond to the original labels created during automated dataset creation. The files are numbered. Two additional .csv files are provided. The shipsAIS_2017_Zone17.csv file holds the AIS information on the imagery contained in the ship folder. The data was retrieved from marinecadastre.gov. During the experiments errors in the automatically created dataset emerged which are further described in the paper. The manual relabelling is supplied in the corrected_labels.csv file.}, language = {en} } @misc{GrabingerHomannHauseretal., author = {Grabinger, Lisa and Homann, Alexander and Hauser, Florian and Mottok, J{\"u}rgen}, title = {Study: MISRA C coding guidelines [Data set]}, doi = {10.5281/zenodo.7898606}, abstract = {This repository contains the material and obtained data of an eye tracking study on the topic "MISRA C coding guidelines".}, language = {en} } @misc{GrabingerHauserMottok, author = {Grabinger, Lisa and Hauser, Florian and Mottok, J{\"u}rgen}, title = {Study: Notation of Causal Graphs [Data set]}, doi = {10.5281/zenodo.7241158}, abstract = {This repository contains the material and obtained data of an eye tracking study on the topic "Notation of Causal Graphs".}, language = {en} } @misc{GrabingerHauserMottok, author = {Grabinger, Lisa and Hauser, Florian and Mottok, J{\"u}rgen}, title = {Study: Layout of Causal Graphs [Data set]}, doi = {10.5281/zenodo.7241097}, abstract = {This repository contains the material and obtained data of an eye tracking study on the topic "Layout of Causal Graphs".}, language = {en} } @article{GrabingerHauserWolffetal., author = {Grabinger, Lisa and Hauser, Florian and Wolff, Christian and Mottok, J{\"u}rgen}, title = {On Eye Tracking in Software Engineering}, series = {SN Computer Science}, volume = {5}, journal = {SN Computer Science}, number = {6}, publisher = {Springer}, address = {Singapore}, issn = {2661-8907}, doi = {10.1007/s42979-024-03045-3}, abstract = {Eye tracking is becoming more and more important as a research method within the field of software engineering (SE). Existing meta-analyses focus on the design or conduct of SE eye tracking studies rather than the analysis phase. This article attempts to fill this gap; it presents a systematic literature review of eye tracking studies in the field of SE—focusing mainly on the data analysis methods used. From the IEEE Xplore and ACM digital libraries we gather 125 papers up to the first quarter of 2024. Detailed evaluation provides information on the number of papers that use specific methods of analysis (i.e., descriptive or inferential statistics, and gaze visualization) or settings (e.g., sample size, technical setup, and selected aspects of research design). With the data obtained we can infer the popularity of specific analysis methods in the field. Those results enable efficient work on data analysis tools or education of aspiring researchers and can serve as basis for standardization or guidelines within the community—providing for methods to include as well as current inconsistencies.}, language = {en} } @misc{Grabinger, author = {Grabinger, Lisa}, title = {Data of a systematic literature research on eye tracking in software engineering [Data set]}, doi = {10.5281/zenodo.11279180}, abstract = {How did the data collection work? By systematic research in the IEEE Xplore and ACM digital libraries we extracted 125 papers. Further details on the procedure can be found in the journal paper. What data is provided? In this repository you can find the extracted data, i.e., file data.xlsx.}, language = {en} } @inproceedings{BockSchwarzWeiss, author = {Bock, Sebastian and Schwarz, Philipp and Weiß, Martin G.}, title = {U-Shape Phenomenon with Gaussian Noise and Clipped Inputs}, series = {Proceedings of Eighth International Congress on Information and Communication Technology. - (ICICT 2023, London, Volume 3)}, booktitle = {Proceedings of Eighth International Congress on Information and Communication Technology. - (ICICT 2023, London, Volume 3)}, editor = {Yang, Xin-She}, publisher = {Springer}, address = {Singapore}, isbn = {978-981-99-3042-5}, doi = {10.1007/978-981-99-3043-2_45}, pages = {569 -- 579}, abstract = {Object detection and recognition is a core task in machine vision. Both the position and the rotation of the objects are of interest. Common algorithms for object recognition based on neural networks use a regression formulation and are aimed at changing environments. In industrial applications, the setting is different: One would like to determine with high accuracy, the pose of known objects. We are investigating a prototype application in this field, where we identify the rotation of an object in a plane. We use common network architectures and provide an overview of how well they are suited for this purpose. In addition, we compare our results with standard image processing algorithms, paying particular attention to the accuracy with metrics relevant in the industry. Moreover, an U-shape phenomenon with disturbed data occurred during the experiments, which is partially explained analytically.}, language = {en} } @phdthesis{Stadler, author = {Stadler, Sebastian Rudolf Johann}, title = {The integration of virtual reality into the design process}, url = {http://nbn-resolving.de/https://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:91-diss-20211103-1612177-1-3}, pages = {VIII, 205}, abstract = {Technological advances strive towards automation and digitalization with the aim to increase efficiency in terms of decreased costs and product development time, resulting in shorter product life cycles. As this causes industries to release products more frequently and more quickly, industrial designers face problems in developing more complex systems in a decreased amount of time while aiming to meet individualized user requirements and stakeholder demands. If prototypes are infeasible or unaffordable, a successful market implementation of products is jeopardized. As design history proves, the introduction of new technologies to the profession of design has the potential to revolutionize the way of working for industrial designers. Virtual Reality may be one of these revolutions, as Computer-Aid Design has been in the 1980s. The present dissertation investigates the integration of Virtual Reality and its impact on the design process, the respective design method, but also the designer and design as a profession. After defining industrial design and Virtual Reality, a basic framework is proposed that describes a design process consensus model, the transfer of conventional design methods into VR, as well as a preliminary set of criteria for evaluating design studies. Based on this framework, four research questions are defined that initiate the investigation of how Virtual Reality can impact the design process, design methods, the role of designers, and design as a profession. To allow this, a refined set of criteria for evaluating design studies is developed and a benchmark study is conducted that proves the suitability for using Virtual Reality in the chosen context. Subsequently, five design studies are conducted in the field of autonomous mobility for public transport in Singapore to investigate the previously defined questions. The five design methods that are combined with Virtual Reality are heuristic evaluation, surveys, Computer-Aided Design prototyping, usability testing, and product presentation. For each design study, the development of the VR apparatus as well as the data collection and test of the method is explained. Additionally, two conventional design methods are consulted for a subsequent comparative analysis of each VR methods. Beyond the definition of the refined evaluation criteria, consisting of safety, validity, time and cost, variability, interactivity, immersion, and effort, the suitability of using VR for behavioural observation in the present application domain is confirmed. Based on the present investigations, the Virtual Design Toolbox is presented. The toolbox consists of five method cards that explain the usage of Virtual Reality for industrial designers throughout the product development and function as support for successfully developing and applying design methods utilizing this technology. The case studies prove that the usage of Virtual Reality has the potential to impact the design process, as divergent thinking and convergent thinking is fostered through valid data collection, decreased time- and cost- involvement, and increased variability. The roles of the involved designers throughout all design studies shifted from being concept creators towards coordinators and facilitators. Implications are derived on different levels, starting with the technology of Virtual Reality that could be a future game changer for research and design, followed by increased motivation to participate in design studies, the need for interdisciplinary teams to establish the required expertise, and lastly integration of Virtual Reality in design education. The usage of Virtual Reality in design will not replace conventional design methods but has the potential to lead to a paradigm shift for the whole profession of design.}, language = {en} } @phdthesis{Lalo, author = {Lalo, Erjola}, title = {Deployment designs for multi-core-real time systems}, edition = {1. Auflage}, publisher = {Universit{\"a}tsverlag Regensburg}, address = {Regensburg}, isbn = {978-3-86845-181-8}, doi = {10.21268/20240712-0}, url = {http://nbn-resolving.de/urn:nbn:de:gbv:104-20240712-00000-7}, pages = {iii, 371}, abstract = {In modern embedded automotive systems, multi-core processors are used to provide higher execution performance and more computing capacity. However, they influence the way these systems are designed. Each change of the platform and application software results in an effort required to ensure and validate the functional correctness and timing requirements of these systems in a multi-core platform. For this reason, the use of the Logical Execution Time (LET) paradigm is advantageous for multi-core systems, as it satisfies these requirements by providing time and dataflow determinism, thereby reducing the development cycle and the impact of the platform in the design of such systems. To integrate LET into these systems, special mechanisms are required to satisfy its semantics. Therefore, this work focuses on buffering and scheduling techniques for resource efficient integration of LET in automotive systems. A buffering mechanism and an automatic schedule synthesis are proposed to guarantee functional correctness, timing requirements, and LET semantics and to reduce the increased demands of LET for memory and processor resources. A static and global buffering protocol is proposed, which compared to lock-based protocols has plausible memory needs and zero-communication overheads at the boundaries of LET intervals. The automatic schedule synthesis considers the Operating System (OS) overheads such that scheduling is optimized with respect to context-switching overheads caused by preemption. Buffering implements most of the LET semantics, but it provides no guarantee that tasks execute within their LET intervals. If scheduling is not designed to ensure that all tasks execute within their LET intervals, then functional correctness and LET semantics are violated. The manual design of a feasible schedule that satisfies the semantics and additional requirements of the application is inefficient and requires a significant amount of effort. Therefore, an automatic schedule generation approach for the Fixed-Priority Scheduling (FPS) and Time-Triggered Scheduling (TTS) is proposed. FPS is the widely used mechanism in the automotive domain because of its flexibility to handle dynamic changes of highly event-driven applications. Recently, TTS has attracted considerable attention in this domain to increase deterministic execution of tasks and efficient planning of processor resources. Therefore, schedule synthesis of FPS and TTS is provided to identify the efficiency, practicality, and resource optimization abilities of each approach for LET systems. To show the practicality of LET for industrial automotive systems, its integration into the software architecture of the classic platform of AUTomotive Open System Architecture (AUTOSAR) is described and a case study is conducted using a real world system.}, language = {en} } @phdthesis{Renner, author = {Renner, Sebastian}, title = {Secure Lightweight Authenticated Encryption for Critical Infrastructures in the Internet of Things}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20230922-1703211-1-0}, pages = {xix, 135}, abstract = {The cryptographic protection of transmitted data on resource-constraint IoT devices presents a difficult challenge. In this thesis, a benchmarking framework for the performance evaluation of lightweight encryption algorithms is introduced. It is analyzed, if and when novel encryption algorithms are more suitable for IoT use cases than the current standard. Besides comparing the sole performance, the cost for hardening the algorithms against side-channel analysis is discussed.}, language = {en} } @phdthesis{Wulf, author = {Wulf, Frederik}, title = {Essays on cloud computing adoption, post-adoption, and security}, pages = {166}, language = {en} } @phdthesis{Weiss, author = {Weiß, Nils}, title = {Security testing in safety-critical networks}, pages = {xiv, 126}, abstract = {The evolution of cars from mechanical systems to rolling computers creates new requirements for safety and security engineering. Nowadays, every vehicle contains a safety-critical real-time communication network to fulfill its function. Especially the increasing connectivity of automotive systems enlarged the attack surface for cyber-attacks. Safety engineering in this area is well understood and studied for decades, though the security engineering of these systems needs further research. This thesis introduces a black-box investigation process to analyze existing auto-motive systems and components and identifies security vulnerabilities in four different ECUs. Combined with a survey of published security research, vehicle-internal networks are identified as an extraordinary threat to the vehicle's safety and security. The outstanding automation capabilities of security tests for these networks are leveraged in the second part of this thesis. In order to create automated tools for automotive networks, a software foundation is necessary. As part of this thesis, a comprehensive open-source software framework for security testing in vehicular networks was developed and published. This aims to support further security research based on open and free software. Novel tools for the automated identification and exploration of attack surfaces in automotive diagnostic protocol implementations are created and evaluated. These tools allow the creation of comparable attack surface metrics through black-box scans of arbitrary ECUs. Automata learning and system state reverse-engineering techniques highly increase the exploration capabilities of the presented tools. The exploration algorithm is tested on thirteen different ECUs from independent OEMs. All gathered results are evaluated and discussed in the final part of this thesis. Finally, open issues and further research based on this contribution are discussed.}, language = {en} } @article{HeinrichZellnerLeist, author = {Heinrich, Bernd and Zellner, Gregor and Leist, Susanne}, title = {Service integrators in business networks - The importance of relationship values}, series = {Electronic Markets}, volume = {21}, journal = {Electronic Markets}, number = {4}, publisher = {Springer}, doi = {10.1007/s12525-011-0075-x}, pages = {215 -- 235}, abstract = {To realise the potentials of CRM (customer relationship management), relationship-specific processes need to be designed and implemented in companies. This is all the more important and complicated in business networks where two or more actors collaborate to serve the customers. A good collaboration within business networks is the basis for understanding the customer process and identifying customer needs. But, even in these days of customer orientation, transaction orientation is still a matter of strong interest, and the following questions remain to be answered: What is the difference between relationship-oriented processes and transaction-oriented processes, and how can relationship-oriented processes be designed for a business network? The authors give first answers to both questions by using a systematic, goal-oriented specialisation of generic actions. To give an example, one relationship-oriented process will be designed and specified for a certain customer process in the course of this paper.}, language = {en} } @inproceedings{GriesbergerLeistZellner, author = {Griesberger, Philipp and Leist, Susanne and Zellner, Gregor}, title = {Analysis of techniques for business process improvement}, series = {19th European Conference on Information Systems, ECIS 2011, Helsinki, Finland, June 9-11, 2011}, booktitle = {19th European Conference on Information Systems, ECIS 2011, Helsinki, Finland, June 9-11, 2011}, pages = {12}, abstract = {This paper is about identifying and analyzing techniques that can be used in a business process improvement (BPI) situation. To determine suitable techniques, the term BPI is defined and criteria are derived to analyze the usability of the selected techniques. Over 300 techniques from various improvement methods were reduced to those techniques which can be applied to help improve business processes and, in particular, to support the act of improvement. Identifying these techniques is helpful, because in most cases the act of improvement is a black box that lacks guidelines or structured procedures. In our research we developed an evaluation scheme to analyze the usability of BPI techniques and give hints about how to select a suitable technique for a certain improvement situation.}, language = {en} } @article{BrollGoldhackerHahneletal., author = {Broll, Alexander and Goldhacker, Markus and Hahnel, Sebastian and Rosentritt, Martin}, title = {Morphological effects of input data quantity in AI-powered dental crown design}, series = {Journal of dentistry}, volume = {159}, journal = {Journal of dentistry}, publisher = {Elsevier}, doi = {10.1016/j.jdent.2025.105767}, pages = {1 -- 8}, abstract = {OBJECTIVES: This retrospective in vitro study evaluated the impact of input data quantity on the morphology of dental crowns generated by AI-based software. The hypothesis suggests that increased input data quantity improves the quality of generated occlusal surfaces. METHODS: A dataset comprising n=30 patients (11 males, 19 females; age: 22-31 years) was analyzed. Input data was categorized into full dentition (full), quadrant data (quad), and adjacent teeth (adj). AI-based software (Dentbird Crown, Imageworks Inc.) generated crowns for a single lower first molar (36/46). Metrics were proposed to assess the morphology and occlusal relationships of the crowns, with the original tooth as reference. STATISTICS: Friedman Chi-Square tests, Wilcoxon signed rank tests, Kendall correlation and Fligner-Killeen tests (α = 0.05). RESULTS: Full and quad groups provided consistent reconstruction quality with no significant differences in morphology and occlusal relationships. The adj group showed significant (p<0.05) morphological deviations and higher reconstruction failure rates compared to the full and quad groups. Correlations (median: 0.19; min-max range: 0.01-0.54) indicate that the proposed metrics capture distinct morphological and functional crown aspects. CONCLUSION: The software reliably reconstructed crowns with at least quadrant-level input data. Performance declined with reduced input. Full-jaw scans did not enhance accuracy compared to quadrant data. CLINICAL SIGNIFICANCE: Increased input data quantity can improve the accuracy of AI-based restorations. As a result, prosthodontists benefit from predictable, accurate restoration proposals that reduce the need for digital chairside adjustments as well as manual modifications after fabrication. This streamlines clinical workflows and enhances the quality of restorations. Quadrant-level data has proven sufficient to generate high-quality reconstructions. Further input data did not significantly improve the accuracy of the reconstructions. The proposed metrics enable quantitative assessments of morphological and functional restoration quality, supporting reliable AI-driven workflows.}, language = {en} } @article{BrollRosentrittSchlegletal., author = {Broll, Alexander and Rosentritt, Martin and Schlegl, Thomas and Goldhacker, Markus}, title = {A data-driven approach for the partial reconstruction of individual human molar teeth using generative deep learning}, series = {Frontiers in Artificial Intelligence}, volume = {7}, journal = {Frontiers in Artificial Intelligence}, publisher = {Frontiers Media SA}, issn = {2624-8212}, doi = {10.3389/frai.2024.1339193}, abstract = {Background and objectiveDue to the high prevalence of dental caries, fixed dental restorations are regularly required to restore compromised teeth or replace missing teeth while retaining function and aesthetic appearance. The fabrication of dental restorations, however, remains challenging due to the complexity of the human masticatory system as well as the unique morphology of each individual dentition. Adaptation and reworking are frequently required during the insertion of fixed dental prostheses (FDPs), which increase cost and treatment time. This article proposes a data-driven approach for the partial reconstruction of occlusal surfaces based on a data set that comprises 92 3D mesh files of full dental crown restorations.MethodsA Generative Adversarial Network (GAN) is considered for the given task in view of its ability to represent extensive data sets in an unsupervised manner with a wide variety of applications. Having demonstrated good capabilities in terms of image quality and training stability, StyleGAN-2 has been chosen as the main network for generating the occlusal surfaces. A 2D projection method is proposed in order to generate 2D representations of the provided 3D tooth data set for integration with the StyleGAN architecture. The reconstruction capabilities of the trained network are demonstrated by means of 4 common inlay types using a Bayesian Image Reconstruction method. This involves pre-processing the data in order to extract the necessary information of the tooth preparations required for the used method as well as the modification of the initial reconstruction loss.ResultsThe reconstruction process yields satisfactory visual and quantitative results for all preparations with a root mean square error (RMSE) ranging from 0.02 mm to 0.18 mm. When compared against a clinical procedure for CAD inlay fabrication, the group of dentists preferred the GAN-based restorations for 3 of the total 4 inlay geometries.ConclusionsThis article shows the effectiveness of the StyleGAN architecture with a downstream optimization process for the reconstruction of 4 different inlay geometries. The independence of the reconstruction process and the initial training of the GAN enables the application of the method for arbitrary inlay geometries without time-consuming retraining of the GAN.}, language = {en} } @article{BrollGoldhackerHahneletal., author = {Broll, Alexander and Goldhacker, Markus and Hahnel, Sebastian and Rosentritt, Martin}, title = {Generative deep learning approaches for the design of dental restorations: A narrative review}, series = {Journal of Dentistry}, volume = {145}, journal = {Journal of Dentistry}, publisher = {Elsevier}, issn = {0300-5712}, doi = {10.1016/j.jdent.2024.104988}, pages = {10}, abstract = {Objectives: This study aims to explore and discuss recent advancements in tooth reconstruction utilizing deep learning (DL) techniques. A review on new DL methodologies in partial and full tooth reconstruction is conducted. Data/Sources: PubMed, Google Scholar, and IEEE Xplore databases were searched for articles from 2003 to 2023. Study selection: The review includes 9 articles published from 2018 to 2023. The selected articles showcase novel DL approaches for tooth reconstruction, while those concentrating solely on the application or review of DL methods are excluded. The review shows that data is acquired via intraoral scans or laboratory scans of dental plaster models. Common data representations are depth maps, point clouds, and voxelized point clouds. Reconstructions focus on single teeth, using data from adjacent teeth or the entire jaw. Some articles include antagonist teeth data and features like occlusal grooves and gap distance. Primary network architectures include Generative Adversarial Networks (GANs) and Transformers. Compared to conventional digital methods, DL-based tooth reconstruction reports error rates approximately two times lower. Conclusions: Generative DL models analyze dental datasets to reconstruct missing teeth by extracting insights into patterns and structures. Through specialized application, these models reconstruct morphologically and functionally sound dental structures, leveraging information from the existing teeth. The reported advancements facilitate the feasibility of DL-based dental crown reconstruction. Beyond GANs and Transformers with point clouds or voxels, recent studies indicate promising outcomes with diffusion-based architectures and innovative data representations like wavelets for 3D shape completion and inference problems. Clinical significance: Generative network architectures employed in the analysis and reconstruction of dental structures demonstrate notable proficiency. The enhanced accuracy and efficiency of DL-based frameworks hold the potential to enhance clinical outcomes and increase patient satisfaction. The reduced reconstruction times and diminished requirement for manual intervention may lead to cost savings and improved accessibility of dental services.}, language = {en} } @misc{OttRosengarthDoenitzetal., author = {Ott, Christian and Rosengarth, K. and Doenitz, Christian and Hoehne, Julius and Wendl, C. and Dodoo-Schittko, Frank and Lang, Elmar Wolfgang and Schmidt, Nils Ole and Goldhacker, Markus}, title = {Preoperative assessment of language dominance through combined resting-state and task-based functional magnetic resonance imaging}, series = {Brain and Spine}, volume = {1}, journal = {Brain and Spine}, number = {Suppl. 2}, publisher = {Elsevier}, doi = {10.1016/j.bas.2021.100523}, abstract = {Background: Brain lesions in language-related cortical areas remain a challenge in the clinical routine. In recent years the resting-state fMRI (rs-fMRI) was shown to be a feasible method for preoperative language assessment. The aim of this study was to examine whether language-related resting-state components, which have been obtained using a data-driven independent-component-based identification algorithm, can be supportive in determining language dominance in the left or right hemisphere. Methods: Twenty patients suffering from brain lesions close to supposed language relevant cortical areas were included. Rs-fMRI and task-based (tb-fMRI) were performed for the purpose of preoperative language assessment. Tb-fMRI included a verb generation task with an appropriate control condition (a syllable switching task) to decompose language critical and language supportive processes. Subsequently, the best fitting ICA component for the resting-state language network (RSLN) referential to general linear models (GLMs) of the tb-fMRI (including models with and without linguistic control conditions) was identified using an algorithm based on the Dice-index. Results: The RSLNs associated with GLMs using a linguistic control condition led to significantly higher laterality indices than GLM baseline contrasts. LIs derived from GLM contrasts with and without control conditions alone did not differ significantly. Conclusion: In general, the results suggest that determining language dominance in the human brain is feasible both with tb-fMRI and rs-fMRI, and in particular, the combination of both approaches yields a higher specificity in preoperative language assessment. Moreover, we can conclude that the choice of the language mapping paradigm is crucial for the mentioned benefits.}, language = {en} } @article{GoldhackerTomeGreenleeetal., author = {Goldhacker, Markus and Tom{\´e}, Ana Maria and Greenlee, Mark W. and Lang, Elmar Wolfgang}, title = {Frequency-Resolved Dynamic Functional Connectivity Reveals Scale-Stable Features of Connectivity-States}, series = {Frontiers in Human Neuroscience}, volume = {12}, journal = {Frontiers in Human Neuroscience}, publisher = {Frontiers Research Foundation}, address = {Lausanne}, issn = {1662-5161}, doi = {10.3389/fnhum.2018.00253}, pages = {1 -- 16}, abstract = {Investigating temporal variability of functional connectivity is an emerging field in connectomics. Entering dynamic functional connectivity by applying sliding window techniques on resting-state fMRI (rs-fMRI) time courses emerged from this topic. We introduce frequency-resolved dynamic functional connectivity (frdFC) by means of multivariate empirical mode decomposition (MEMD) followed up by filter-bank investigations. In general, we find that MEMD is capable of generating time courses to perform frdFC and we discover that the structure of connectivity-states is robust over frequency scales and even becomes more evident with decreasing frequency. This scale-stability varies with the number of extracted clusters when applying k-means. We find a scale-stability drop-off from k = 4 to k = 5 extracted connectivity-states, which is corroborated by null-models, simulations, theoretical considerations, filter-banks, and scale-adjusted windows. Our filter-bank studies show that filter design is more delicate in the rs-fMRI than in the simulated case. Besides offering a baseline for further frdFC research, we suggest and demonstrate the use of scale-stability as a possible quality criterion for connectivity-state and model selection. We present first evidence showing that connectivity-states are both a multivariate, and a multiscale phenomenon. A data repository of our frequency-resolved time-series is provided.}, language = {en} } @article{FellnerVolbergWimberetal., author = {Fellner, Marie-Christin and Volberg, Gregor and Wimber, Maria and Goldhacker, Markus and Greenlee, Mark W. and Hanslmayr, Simon}, title = {Spatial mnemonic encoding: Theta power decreases and medial temporal lobe BOLD increases co-occur during the usage of the method of loci}, series = {eNeuro}, volume = {3}, journal = {eNeuro}, number = {6}, publisher = {Society for Neuroscience}, address = {Washington, DC}, issn = {2373-2822}, doi = {10.1523/ENEURO.0184-16.2016}, pages = {1 -- 16}, abstract = {The method of loci is one, if not the most, efficient mnemonic encoding strategy. This spatial mnemonic combines the core cognitive processes commonly linked to medial temporal lobe (MTL) activity: spatial and associative memory processes. During such processes, fMRI studies consistently demonstrate MTL activity, while electrophysiological studies have emphasized the important role of theta oscillations (3-8 Hz) in the MTL. However, it is still unknown whether increases or decreases in theta power co-occur with increased BOLD signal in the MTL during memory encoding. To investigate this question, we recorded EEG and fMRI separately, while human participants used the spatial method of loci or the pegword method, a similarly associative but nonspatial mnemonic. The more effective spatial mnemonic induced a pronounced theta power decrease source localized to the left MTL compared with the nonspatial associative mnemonic strategy. This effect was mirrored by BOLD signal increases in the MTL. Successful encoding, irrespective of the strategy used, elicited decreases in left temporal theta power and increases in MTL BOLD activity. This pattern of results suggests a negative relationship between theta power and BOLD signal changes in the MTL during memory encoding and spatial processing. The findings extend the well known negative relation of alpha/beta oscillations and BOLD signals in the cortex to theta oscillations in the MTL.}, language = {en} } @article{GoldhackerKeckIgeletal., author = {Goldhacker, Markus and Keck, P. and Igel, A. and Lang, Elmar Wolfgang and Tom{\´e}, Ana Maria}, title = {A multi-variate blind source separation algorithm}, series = {Computer Methods and Programs in Biomedicine}, volume = {151}, journal = {Computer Methods and Programs in Biomedicine}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1872-7565}, doi = {10.1016/j.cmpb.2017.08.019}, pages = {91 -- 99}, abstract = {Background and objective The study follows the proposal of decomposing a given data matrix into a product of independent spatial and temporal component matrices. A multi-variate decomposition approach is presented, based on an approximate diagonalization of a set of matrices computed using a latent space representation. Methods The proposed methodology follows an algebraic approach, which is common to space, temporal or spatiotemporal blind source separation algorithms. More specifically, the algebraic approach relies on singular value decomposition techniques, which avoids computationally costly and numerically instable matrix inversion. The method is equally applicable to correlation matrices determined from second order correlations or by considering fourth order correlations. Results The resulting algorithms are applied to fMRI data sets either to extract the underlying fMRI components or to extract connectivity maps from resting state fMRI data collected for a dynamic functional connectivity analysis. Intriguingly, our algorithm shows increased spatial specificity compared to common approaches, while temporal precision stays similar. Conclusion The study presents a novel spatiotemporal blind source separation algorithm, which is both robust and avoids parameters that are difficult to fine tune. Applied on experimental data sets, the new method yields highly confined and focused areas with least spatial extent in the retinotopy case, and similar results in the dynamic functional connectivity analyses compared to other blind source separation algorithms. Therefore, we conclude that our novel algorithm is highly competitive and yields results, which are superior or at least similar to existing approaches.}, language = {en} } @article{WeinDecoTomeetal., author = {Wein, Simon and Deco, Gustavo and Tom{\´e}, Ana Maria and Goldhacker, Markus and Malloni, Wilhelm M. and Greenlee, Mark W. and Lang, Elmar Wolfgang}, title = {Brain Connectivity Studies on Structure-Function Relationships: A Short Survey with an Emphasis on Machine Learning}, series = {Computational intelligence and neuroscience}, journal = {Computational intelligence and neuroscience}, publisher = {Hindawi}, doi = {10.1155/2021/5573740}, pages = {1 -- 31}, abstract = {This short survey reviews the recent literature on the relationship between the brain structure and its functional dynamics. Imaging techniques such as diffusion tensor imaging (DTI) make it possible to reconstruct axonal fiber tracks and describe the structural connectivity (SC) between brain regions. By measuring fluctuations in neuronal activity, functional magnetic resonance imaging (fMRI) provides insights into the dynamics within this structural network. One key for a better understanding of brain mechanisms is to investigate how these fast dynamics emerge on a relatively stable structural backbone. So far, computational simulations and methods from graph theory have been mainly used for modeling this relationship. Machine learning techniques have already been established in neuroimaging for identifying functionally independent brain networks and classifying pathological brain states. This survey focuses on methods from machine learning, which contribute to our understanding of functional interactions between brain regions and their relation to the underlying anatomical substrate.}, language = {en} } @inproceedings{WeinTomeGoldhackeretal., author = {Wein, S. and Tom{\´e}, Ana Maria and Goldhacker, Markus and Greenlee, Mark W. and Lang, Elmar Wolfgang}, title = {Hybridizing EMD with cICA for fMRI Analysis of Patient Groups}, series = {2019 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC): 23-27 July 2019, Berlin, Germany}, booktitle = {2019 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC): 23-27 July 2019, Berlin, Germany}, publisher = {IEEE}, doi = {10.1109/EMBC.2019.8856355}, pages = {194 -- 197}, abstract = {Independent component analysis (ICA), as a data driven method, has shown to be a powerful tool for functional magnetic resonance imaging (fMRI) data analysis. One drawback of this multivariate approach is, that it is naturally not convenient for analysis of group studies. Therefore various techniques have been proposed in order to overcome this limitation of ICA. In this paper a novel ICA based work-flow for extracting resting state networks from fMRI group studies is proposed. An empirical mode decomposition (EMD) is used to generate reference signals in a data driven manner, which can be incorporated into a constrained version of ICA (cICA), what helps to overcome the inherent ambiguities. The results of the proposed workflow are then compared to those obtained by a widely used group ICA approach. It is demonstrated that intrinsic modes, extracted by EMD, are suitable to serve as references for cICA to obtain typical resting state patterns, which are consistent over subjects. This novel processing pipeline makes it transparent for the user, how comparable activity patterns across subjects emerge, and also the trade-off between similarity across subjects and preserving individual features can be well adjusted and adapted for different requirements in the new work-flow.}, language = {en} } @article{GoldhackerFellnerVolbergetal., author = {Goldhacker, Markus and Fellner, Marie-Christin and Volberg, G. and Mullinger, K. J. and Greenlee, Mark W. and Hanslmayr, Simon}, title = {Spurious correlations in simultaneous EEG-fMRI driven by in-scanner movement}, series = {NeuroImage}, volume = {133}, journal = {NeuroImage}, number = {June}, publisher = {Elsevier}, doi = {10.1016/j.neuroimage.2016.03.031}, pages = {354 -- 366}, abstract = {Simultaneous EEG-fMRI provides an increasingly attractive research tool to investigate cognitive processes with high temporal and spatial resolution. However, artifacts in EEG data introduced by the MR scanner still remain a major obstacle. This study, employing commonly used artifact correction steps, shows that head motion, one overlooked major source of artifacts in EEG-fMRI data, can cause plausible EEG effects and EEG-BOLD correlations. Specifically, low-frequency EEG (< 20 Hz) is strongly correlated with in-scanner movement. Accordingly, minor head motion (< 0.2 mm) induces spurious effects in a twofold manner: Small differences in task-correlated motion elicit spurious low-frequency effects, and, as motion concurrently influences fMRI data, EEG-BOLD correlations closely match motion-fMRI correlations. We demonstrate these effects in a memory encoding experiment showing that obtained theta power (~ 3-7 Hz) effects and channel-level theta-BOLD correlations reflect motion in the scanner. These findings highlight an important caveat that needs to be addressed by future EEG-fMRI studies.}, language = {en} } @article{WeinTomeGoldhackeretal., author = {Wein, Simon and Tom{\´e}, Ana Maria and Goldhacker, Markus and Greenlee, Mark W. and Lang, Elmar Wolfgang}, title = {A Constrained ICA-EMD Model for Group Level fMRI Analysis}, series = {Frontiers in Neuroscience}, volume = {14}, journal = {Frontiers in Neuroscience}, publisher = {frontiers}, issn = {1662-453X}, doi = {10.3389/fnins.2020.00221}, pages = {1 -- 10}, abstract = {Independent component analysis (ICA), being a data-driven method, has been shown to be a powerful tool for functional magnetic resonance imaging (fMRI) data analysis. One drawback of this multivariate approach is that it is not, in general, compatible with the analysis of group data. Various techniques have been proposed to overcome this limitation of ICA. In this paper, a novel ICA-based workflow for extracting resting-state networks from fMRI group studies is proposed. An empirical mode decomposition (EMD) is used, in a data-driven manner, to generate reference signals that can be incorporated into a constrained version of ICA (cICA), thereby eliminating the inherent ambiguities of ICA. The results of the proposed workflow are then compared to those obtained by a widely used group ICA approach for fMRI analysis. In this study, we demonstrate that intrinsic modes, extracted by EMD, are suitable to serve as references for cICA. This approach yields typical resting-state patterns that are consistent over subjects. By introducing these reference signals into the ICA, our processing pipeline yields comparable activity patterns across subjects in a mathematically transparent manner. Our approach provides a user-friendly tool to adjust the trade-off between a high similarity across subjects and preserving individual subject features of the independent components.}, language = {en} } @article{GoldhackerAlSubariAlBaddaietal., author = {Goldhacker, Markus and Al-Subari, Karema and Al-Baddai, Saad and Tom{\´e}, Ana Maria and Faltermeier, Rupert and Lang, Elmar Wolfgang}, title = {EMDLAB: A toolbox for analysis of single-trial EEG dynamics using empirical mode decomposition}, series = {Journal of Neuroscience Methods}, volume = {253}, journal = {Journal of Neuroscience Methods}, number = {September}, publisher = {Elsevier}, address = {AMsterdam}, doi = {10.1016/j.jneumeth.2015.06.020}, pages = {193 -- 205}, abstract = {Background: Empirical mode decomposition (EMD) is an empirical data decomposition technique. Recently there is growing interest in applying EMD in the biomedical field. New method: EMDLAB is an extensible plug-in for the EEGLAB toolbox, which is an open software environment for electrophysiological data analysis. Results: EMDLAB can be used to perform, easily and effectively, four common types of EMD: plain EMD, ensemble EMD (EEMD), weighted sliding EMD (wSEMD) and multivariate EMD (MEMD) on EEG data. In addition, EMDLAB is a user-friendly toolbox and closely implemented in the EEGLAB toolbox. Comparison with existing methods: EMDLAB gains an advantage over other open-source toolboxes by exploiting the advantageous visualization capabilities of EEGLAB for extracted intrinsic mode functions (IMFs) and Event-Related Modes (ERMs) of the signal. Conclusions: EMDLAB is a reliable, efficient, and automated solution for extracting and visualizing the extracted IMFs and ERMs by EMD algorithms in EEG study.}, language = {en} } @misc{AlSubariAlBaddaiTomeetal., author = {Al-Subari, Karema and Al-Baddai, Saad and Tom{\´e}, Ana Maria and Goldhacker, Markus and Faltermeier, Rupert and Lang, Elmar Wolfgang}, title = {EMDLAB-toolbox- tutorial video}, language = {en} } @book{SchultzJain, author = {Schultz, David and Jain, Brijnesh}, title = {Nonsmooth Analysis and Subgradient Methods for Averaging in Dynamic Time Warping Spaces}, doi = {10.48550/arXiv.1701.06393}, pages = {30}, abstract = {Time series averaging in dynamic time warping (DTW) spaces has been successfully applied to improve pattern recognition systems. This article proposes and analyzes subgradient methods for the problem of finding a sample mean in DTW spaces. The class of subgradient methods generalizes existing sample mean algorithms such as DTW Barycenter Averaging (DBA). We show that DBA is a majorize-minimize algorithm that converges to necessary conditions of optimality after finitely many iterations. Empirical results show that for increasing sample sizes the proposed stochastic subgradient (SSG) algorithm is more stable and finds better solutions in shorter time than the DBA algorithm on average. Therefore, SSG is useful in online settings and for non-small sample sizes. The theoretical and empirical results open new paths for devising sample mean algorithms: nonsmooth optimization methods and modified variants of pairwise averaging methods.}, language = {en} } @inproceedings{RamsauerLohmannMauerer, author = {Ramsauer, Ralf and Lohmann, Daniel and Mauerer, Wolfgang}, title = {Reliable Pre-Integration Tracking of Commits on Mailing Lists}, series = {Invited Talk at Safety Summit at Embedded Linux Conference Europe (ELCE18)}, booktitle = {Invited Talk at Safety Summit at Embedded Linux Conference Europe (ELCE18)}, address = {Edinburgh, Scotland}, language = {en} } @inproceedings{SchroepferSchwaegerlWestfechtel, author = {Schr{\"o}pfer, Johannes and Schw{\"a}gerl, Felix and Westfechtel, Bernhard}, title = {Consistency control for model versions in evolving model-driven software product lines}, series = {2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C), Munich, Germany}, booktitle = {2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C), Munich, Germany}, publisher = {IEEE}, doi = {10.1109/MODELS-C.2019.00043}, pages = {268 -- 277}, abstract = {Model-driven software product lines evolve in both time and space. Consistency control for model versions constitutes a key challenge. We propose a novel approach to consistency control called well-formedness analysis and repair: Instead of attempting to guarantee consistency of each configurable version a priori (which is hard and restrictive), consistency is controlled only when a product version is actually configured. Conflicts, i.e., violation of well-formedness constraints, are detected and repaired, driven by configurable strategies. This approach is generic; it is instantiated for feature models (for the variability model) and EMF models (as domain artifacts).}, language = {en} } @phdthesis{Schedlbauer, author = {Schedlbauer, J{\"u}rgen}, title = {Anforderungsorientierte Optimierung, Evaluation und Validierung der praktischen Inhalte der Lehre in der Medizinischen Informatik in Hochschulen f{\"u}r Angewandte Wissenschaften (HAW)}, isbn = {978-3-88246-461-0}, doi = {10.5283/epub.47750}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:355-epub-477509}, pages = {xvi, 253}, abstract = {Die European University Association (EUA) definiert „Besch{\"a}ftigungsf{\"a}higkeit" als ein Hauptziel der Hochschulausbildung. Der zentrale Aspekt dieser Arbeit ist, kompetenzorientierte Lehre in der praktischen Ausbildung der medizinischen Informatik an Hochschulen f{\"u}r angewandte Wissenschaft(HAW) durch Analyse der Kompetenzanforderungen des Marktes und der Hochschulen zu optimieren. Als Erstes wird dazu ein Berufsbild der Medizinischen Informatik erarbeitet, indem mit Hilfe von Webcrawling, Webextraktion und Text Mining Begriffe von Stellenanzeigen, anhand einer Inhaltsanalyse, die Kompetenzen im Bereich Fachwissen und Soft Skills (Gesch{\"a}ftsprozessmanagement, Teamwork, Prozesse, Lern- und Probleml{\"o}sungsf{\"a}higkeiten) ermittelt werden. Als N{\"a}chstes wird untersucht, inwiefern HAWs diese Kompetenzen in ihren Modulhandb{\"u}chern als Lernziele definieren. Um die Vermittlung der praktischen Inhalte der Ausbildung entsprechend dem Berufsbild zu optimieren wurde - basierend auf der Methodik des Design-based Research - die Lehrmethodik „INstall" entwickelt und evaluiert um die Arbeitsmarktf{\"a}higkeit der Studierenden zu verbessern. Die Eignung der Lehrmethodik wurde anhand einer Fremd- und Selbsteinsch{\"a}tzung der Studierenden untersucht. Die Ergebnisse der Stellenanalyse zeigen, dass nur 45\% der Begriffe der Kategorie Fachwissen und 55\% der Kategorie Soft Skills zuzuordnen sind. Die vorherrschenden Begriffe waren Programmierung, Erfahrung, Projekt und Server. Die Auswertung der Modulhandb{\"u}cher zur Kompetenzorientierung hat große Unterschiede offengelegt, da in zwei Dritteln der Modulhandb{\"u}cher keine Soft Skills als Lernergebnisse formuliert wurden. Anhand eines Zyklus {\"u}ber drei Vorlesungen wurde nachgewiesen, dass die Erweiterung der Lernziele auf Soft Skills durch die Methode „INstall", in der Fremd- und Selbsteinsch{\"a}tzung der Studierenden einen starken Zugewinn an Kompetenzen im fachlichen Wissen, bei der Teamarbeit, im Gesch{\"a}ftsprozessmanagement, beim Lernen, in der Kommunikation und der Probleml{\"o}sung gebracht hat. Die Arbeit legt den Schluss nahe, dass Hard- und Soft Skills bei den Arbeitnehmeranforderungen zur Medizinischen Informatik gleich gewichtet sind. Daraus kann abgeleitet werden, dass die Vorgaben der Berufsverb{\"a}nde zum Kompetenzprofil {\"u}berdacht werden sollten. Fraglich erscheint, ob ein großer Teil der Modulhandb{\"u}cher den Vorgaben der EUA (Besch{\"a}ftigungsf{\"a}higkeit) entsprechen, da die Lernziele ein Defizit an Soft Skills aufweisen. Insgesamt bleibt festzuhalten: Eine gezielte Ausrichtung der Lernziele von {\"U}bungen auf die Anforderungen des Arbeitsmarktes durch die neue Lehrmethode „INstall" hat zu einer von den Studierenden selbst best{\"a}tigten sp{\"u}rbaren Steigerung der ben{\"o}tigten Kompetenzen gef{\"u}hrt.}, language = {de} } @inproceedings{GreinerSchwaegerlWestfechtel, author = {Greiner, Sandra and Schw{\"a}gerl, Felix and Westfechtel, Bernhard}, title = {Realizing multi-variant model transformations on top of reused ATL specifications}, series = {Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development MODELSWARD, Porto, Portugal}, volume = {1}, booktitle = {Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development MODELSWARD, Porto, Portugal}, publisher = {SCITEPRESS - Science and Technology Publications}, doi = {10.5220/0006137803620373}, pages = {362 -- 373}, abstract = {Model transformations are crucial in model-driven software engineering (MDSE). While combining MDSE and software product line engineering (SPLE) techniques, summarized as model-driven product line engineering (MDPLE), promises increased productivity by relying on organized reuse, the benefits are impeded by transformation specifications designed exclusively for single-variant models. Applying single-variant model transformations to multi-variant input models results in output models lacking the variability information. Multi-variant model transformations (MVMT), which preserve variability information, have only recently been understood as an explicit research problem. In this paper, we propose an a posteriori approach towards MVMT. Following the paradigm of organized reuse, we propose to employ single-variant model transformations without modifications in a first step, and to transfer variability information afterwards based on the artifacts provided by the single-variant transformation specification. In particular, we implemented this approach for the well-known model-to-model transformation language ATL. To deduce variability information, the execution artifacts (trace and execution model) are analyzed. Then, variability annotations are transfered to the target model automatically. The implementation is evaluated based on a practically example of a Graph product line. Results exhibit that our approach outperforms the conventional solution with respect to user effort, accuracy and performance.}, language = {en} } @phdthesis{Schmid, author = {Schmid, Isabel}, title = {Weiterentwicklung von Methoden und Ans{\"a}tzen zur automatisierten Informationsextraktion aus Social Networks}, doi = {10.5283/epub.53491}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:355-epub-534918}, pages = {VII, 192}, abstract = {Ob Werbebotschaften effektiv in einem sozialen Netzwerk verbreitet werden k{\"o}nnen, ist abh{\"a}ngig von der Person, die dabei als Multiplikator eingesetzt wird (Deng et al., 2016). Der Einsatz eines einflussreichen Nutzers kann nicht nur die Reichweite der Marketingbotschaft deutlich erh{\"o}hen, sondern auch in den Bereichen Innovations- und Produktmanagement wirken. Neben der großen praktischen Relevanz des Themengebiets hat dieses auch in der Wissenschaft eine Vielzahl an Publikationen hervorgebracht. Eine klare Definition und Abgrenzung einflussreicher Nutzertypen wie z.B. Influencer, Key User oder Lead User fehlt bislang und soll mit Hilfe eines ausf{\"u}hrlichen Literatur{\"u}berblicks angefertigt werden (Ver{\"o}ffentlichung 1). Außerdem wird im Rahmen der Dissertation die Identifikation von Lead User weiterentwickelt, indem verschiedene Analyseformen wie z.B. die SNA, die Sentimentanalyse und das Topic Modeling miteinander kombiniert werden. Das Thema der Sentimentanalyse wird zudem in einer weiteren Ver{\"o}ffentlichung n{\"a}her betrachtet, insbesondere im Zuge der Analyse langer und unstrukturierter Texte. Jedoch lassen sich Vorteile von sozialen Netzwerken nicht nur in Bezug auf die Verbindung zwischen Kunde und Unternehmen feststellen, sondern auch im Bereich ESN. ESN werden mit dem Ziel angewandt, die organisationale Effektivit{\"a}t sowie die Effizienz im Unternehmen zu verbessern (Stei et al., 2016). Zentral dabei ist, dass die Mitarbeiter dazu motiviert werden, aktiv Inhalte zu erzeugen und ihr Wissen mit anderen zu teilen (G{\"u}nther and Spath, 2010). Hierbei lassen sich auch unter den Mitarbeitern unterschiedliche Nutzergruppen erkennen. So k{\"o}nnen u.a. aufgrund von Aktivit{\"a}t und Zentralit{\"a}t im Netzwerk Nutzertypen voneinander unterschieden werden. Zentrale Personen im Netzwerk m{\"u}ssen gef{\"o}rdert werden, um Kommunikation und Kollaboration zu sichern. Deshalb stehen die sog. „value-adding user" im Zentrum der Analyse einer weiteren Publikation.}, language = {de} } @inproceedings{PozzobonWeissMottoketal., author = {Pozzobon, Enrico and Weiß, Nils and Mottok, J{\"u}rgen and Matoušek, V{\´a}clav}, title = {Fuzzy fault injection attacks against secure automotive bootloaders}, series = {21th escar Europe : The World's Leading Automotive Cyber Security Conference (Hamburg, 15. - 16.11.2023)}, booktitle = {21th escar Europe : The World's Leading Automotive Cyber Security Conference (Hamburg, 15. - 16.11.2023)}, publisher = {Ruhr-Universit{\"a}t Bochum}, doi = {10.13154/294-10381}, url = {http://nbn-resolving.de/urn:nbn:de:hbz:294-103817}, pages = {20}, abstract = {Secure embedded bootloaders are the trust anchors for modern vehicles' software. The secure software update process of ECUs is well-defined across the entire automotive industry. Every OEM has his own implementation, but follows the general software update process. This paper demonstrates code execution attacks by combining software and hardware weaknesses in secure automotive bootloaders. The attack can be performed entirely automated, no static code analysisis required. Random fault injection parameters were sufficient to obtain code execution in a reasonable time. All experiments were conducted with electromagnetic fault injection and without any hardware modifications of the targets. We successfully performed our attack on two entirely different gateway Electronic Control Units (ECUs) used in current vehicles (at the time of this research) from Volkswagen and BMW. As a result of this attack, consisting of a combination of a hardware and asoftware attack, the general secure software update process used in the automotive industry needs to be revised.}, language = {en} } @article{JainSchultz, author = {Jain, Brijnesh and Schultz, David}, title = {Asymmetric learning vector quantization for efficient nearest neighbor classification in dynamic time warping spaces}, series = {Pattern Recognition}, volume = {76}, journal = {Pattern Recognition}, publisher = {Elsevier}, doi = {10.1016/j.patcog.2017.10.029}, pages = {349 -- 366}, abstract = {The nearest neighbor method together with the dynamic time warping (DTW) distance is one of the most popular approaches in time series classification. This method suffers from high storage and computation requirements for large training sets. As a solution to both drawbacks, this article extends learning vector quantization (LVQ) from Euclidean spaces to DTW spaces. The proposed generic LVQ scheme uses asymmetric weighted averaging as update rule. We theoretically justify the asymmetric LVQ scheme via subgradient techniques and by the margin-growth principle. In addition, we show that the decision boundary of two prototypes from different classes is piecewise quadratic. Empirical results exhibited superior performance of asymmetric generalized LVQ (GLVQ) over other state-of-the-art prototype generation methods for nearest neighbor classification.}, language = {en} } @article{KlinglWaasWeise, author = {Klingl, F. and Waas, Thomas and Weise, Wolfram}, title = {Nuclear bound states of omega mesons}, series = {Nuclear Physics A}, volume = {650}, journal = {Nuclear Physics A}, number = {3}, publisher = {Elsevier}, doi = {10.1016/S0375-9474(99)00114-1}, pages = {299 -- 312}, abstract = {Models based on chiral SU(3)_L \otimes SU(3)_R symmetry and vector meson dominance suggest an attractive potential for the \$\omega\$-meson in a nuclear medium. We discuss the feasibility of producing nuclear bound states of \$\omega\$-mesons using \$(d,^3He)\$ and pion induced reactions on selected nuclear targets.}, language = {en} } @unpublished{WaasBrockmannWeise, author = {Waas, Thomas and Brockmann, R. and Weise, Wolfram}, title = {Deeply bound pionic states and the effective pion mass in nuclear systems}, doi = {10.48550/arXiv.hep-ph/9704397}, pages = {10}, abstract = {We show that the s-wave pion-nuclear potential which reproduces the deeply bound pionic states in Pb, recently discovered at GSI, is remarkably close to the one constructed directly from low energy theorems based on chiral symmetry. Converting this information into an effective pion mass we find \$m_\pi^\star/m_\pi\simeq 1.13\$ in the center of the Pb nucleus, and \$m_\pi^\star/m_\pi\simeq 1.07\$ in symmetric nuclear matter.}, language = {en} } @unpublished{SchmidbauerLobeSchaeferetal., author = {Schmidbauer, Lukas and Lobe, Elisabeth and Sch{\"a}fer, Ina and Mauerer, Wolfgang}, title = {It's Quick to be Square: Fast Quadratisation for Quantum Toolchains}, abstract = {Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an order as determined by the structure of the objective function and the properties of target hardware. When the structure of the problem representation is not aligned with structure and boundary conditions of the executing hardware, various overheads degrading the computation may arise, possibly negating any possible quantum advantage. Therefore, automatic transformations of problem representations play an important role in quantum computing when descriptions (semi-)targeted at humans must be cast into forms that can be executed on quantum computers. Mathematically equivalent formulations are known to result in substantially different non-functional properties depending on hardware, algorithm and detail properties of the problem. Given the current state of noisy intermediate-scale quantum (NISQ) hardware, these effects are considerably more pronounced than in classical computing. Likewise, efficiency of the transformation itself is relevant because possible quantum advantage may easily be eradicated by the overhead of transforming between representations. In this paper, we consider a specific class of higher-level representations, i.e. polynomial unconstrained binary optimisation problems, and devise novel automatic transformation mechanisms into widely used quadratic unconstrained binary optimisation problems that substantially improve efficiency and versatility over the state of the art. We also identify what influence factors of lower-level details can be abstracted away in the transformation process, and which details must be made available to higher-level abstractions.}, language = {de} }