<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5525</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>6</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Overhead-Aware Schedule Synthesis for Logical Execution Time (LET) in Automotive Systems</title>
    <abstract language="eng">The Logical Execution Time (LET) has recently been integrated in multi-core automotive systems to ensure timing and dataflow determinism. Although buffering mechanisms are introduced to incorporate LET semantics, they do not guarantee that tasks are executed within their LET frames. In fact, LET and buffering semantics are violated if scheduling is not designed to execute all tasks within their LET frames and in a specific order. In this paper, we describe a scheduling synthesis technique for Fixed-Priority Scheduling (FPS) to achieve resource-efficient execution of LET systems. The proposed approach considers LET semantics, scheduling overheads, and delays caused by operating system operations and provides the possibility to optimize the schedule with respect to aspects like scheduling overheads. Our performance and feasibility evaluation shows that the proposed algorithm provides results in a reasonable amount of time for models of complex industrial applications. Thus, the integration of the proposed algorithm into an automated process is of high benefit to accelerate the development of vehicle applications.</abstract>
    <parentTitle language="eng">2022 IEEE 35th International System-on-Chip Conference (SOCC): 05-08 September 2022, Belfast, United Kingdom</parentTitle>
    <identifier type="isbn">978-1-6654-5985-3</identifier>
    <identifier type="doi">10.1109/SOCC56010.2022.9908103</identifier>
    <enrichment key="opus.import.date">2022-10-28T17:12:32+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Erjola Lalo</author>
    <author>Andreas Sailer</author>
    <author>Jürgen Mottok</author>
    <author>Christian Siemers</author>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16312">Energie und Mobilität</collection>
  </doc>
  <doc>
    <id>5573</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>6</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-11-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Security-Gateway for SCADA-Systems in Critical Infrastructures</title>
    <abstract language="eng">Supervisory Control and Data Acquisition (SCADA) systems are used to control and monitor components within the energy grid, playing a significant role in the stability of the system. As a part of critical infrastructures, components in these systems have to fulfill a variety of different requirements regarding their dependability and must also undergo strict audit procedures in order to comply with all relevant standards. This results in a slow adoption of new functionalities. Due to the emerged threat of cyberattacks against critical infrastructures, extensive security measures are needed within these systems to protect them from adversaries and ensure a stable operation. In this work, a solution is proposed to integrate extensive security measures into current systems. By deploying additional security-gateways into the communication path between two nodes, security features can be integrated transparently for the existing components. The developed security-gateway is compliant to all regulatory requirements and features an internal architecture based on the separation-of-concerns principle to increase its security and longevity. The viability of the proposed solution has been verified in different scenarios, consisting of realistic field tests, security penetration tests and various performance evaluations.</abstract>
    <parentTitle language="eng">27th International Conference on Applied Electronics (AE): 06-07 September 2022, Pilsen, CZ</parentTitle>
    <identifier type="doi">10.1109/AE54730.2022.9920070</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="Kostentraeger">2056071</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Tobias Frauenschläger</author>
    <author>Jürgen Mottok</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Critical Infrastructure</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Certification</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Supervisory Control and Data Acquisition</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Security</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Dependability</value>
    </subject>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16315">Information und Kommunikation</collection>
  </doc>
  <doc>
    <id>5571</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>9</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-11-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Investigation of Scheduling Algorithms for DAG. Tasks through Simulations</title>
    <abstract language="eng">In the real-time systems sector, various task models and corresponding tests exist to model and verify the schedulability of task sets on the system at hand. While those models and schedulability tests have intensively been studied from a theoretical point of view, it is hard to ma e use of them to compare the actual execution behavior of scheduling algorithms on a real system. In contrast to schedulability tests, simulators can help to investigate the performance of specific scheduling algorithms. One of the most generalized task models to describe parallel tasks is the Directed Acyclic Graph model that allows to represent tasks as a series of subtasks that depict the potentially parallel computations and precedence constraints that denote the order in which the subtasks are allowed to execute.&#13;
In this paper, we investigate various scheduling algorithms for the Directed Acyclic Graph model. For that, we first recapitulate the examined scheduling algorithms in detail and point out relevant differences. Subsequently, we present the evaluation of different global and federated scheduling algorithms using fine-grained parallel tasks. To this end, we generate random Directed Acyclic Graph tasks and simulate their execution on multiprocessor systems using scheduling algorithms such as global rate-monotonic and semi-federated scheduling as well as global scheduling policies using the thread pool model.</abstract>
    <parentTitle language="eng">ERTS 2022, 11th European Congress Embedded Real Time Systems: 1-2 June, Toulouse, France</parentTitle>
    <identifier type="url">https://hal.archives-ouvertes.fr/hal-03700472/document</identifier>
    <enrichment key="BegutachtungStatus">begutachtet</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Michael Schmid</author>
    <author>Jürgen Mottok</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real-time</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>task models</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>simulation</value>
    </subject>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16315">Information und Kommunikation</collection>
    <collection role="oaweg" number="">Bronze Open Access - frei zugänglich aber ohne Lizenzhinweis</collection>
  </doc>
  <doc>
    <id>5569</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1278</pageFirst>
    <pageLast>1285</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-11-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Accessing the Presentation of Causal Graphs and an Application of Gestalt Principles with Eye Tracking</title>
    <abstract language="eng">The discipline of causal inference uses so-called causal graphs to model cause and effect relations of random variables. As those graphs only encode a relation structure there is no hard rule concerning their alignment. The present paper presents a study with the aim of working out the optimal alignment of causal graphs with respect to comprehensibility and interestingness. In addition, the study examines whether the central gestalt principles of psychology apply for causal graphs. Data from 29 participants is acquired by triangulating eye tracking with a questionnaire. The results of the study suggest that causal graphs should be aligned downwards. Moreover, the gestalt principles proximity, similarity and closure are shown to hold true for causal graphs.</abstract>
    <parentTitle language="eng">2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER 2022), 1st Workshop on Advances in Human-Centric Experiments in Software Engineering (HUMAN 2022): 15-18 March 2022, Honolulu, HI, USA</parentTitle>
    <identifier type="doi">10.1109/SANER53432.2022.00153</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="Kostentraeger">FH-Invest (FKZ: 13FHlOIIN6)</enrichment>
    <enrichment key="Kostentraeger">HolmeS 3 (FKZ: DIK0173/03)</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Lisa Grabinger</author>
    <author>Florian Hauser</author>
    <author>Jürgen Mottok</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>causal graphs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>gestalt principles</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>eye tracking</value>
    </subject>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
  <doc>
    <id>5582</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>RWTH Aachen</publisherName>
    <publisherPlace>Aachen</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-11-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Towards Semantic model-to-model Mapping of Cross-Domain Component Interfaces for Interoperability of Vehicle Applications : An Approach towards Synergy Exploration</title>
    <abstract language="eng">With the increase in demand of services in the automotive industry, automotive enterprises prefer to collaborate with other qualified cross-domain partners to provide complex automotive functions (or services), such as autonomous driving, OTA (Over The Air) vehicle update, V2X (Vehicle-to-Vehicle communication), etc. One key element in cross-domain enterprise collaboration is the mutual agreement between interfaces of software components. In this context, model-to-model mappings of software component models of heterogeneous frameworks for automotive services and to explore the synergies in their interface semantics, have become an essential factor in improving the interoperability among the automotive and other cross-domain enterprises. However, one of the challenges in achieving cross-domain component interface model-to-model mappings at an application level lies in detecting the interface semantics and the semantic relations that are conveyed in different component models in different frameworks. This paper addresses this challenge using a Model Driven Architecture (MDA) based analytical approach to explore interface semantic synergies in the cross-domain component meta-models that are used for automotive services. The approach applies manual semantic checking measurements at an application interface level to understand the meanings and relations between the different meta-model entities of cross-domain framework software components. In this research, we attempt to ensure that interface description models of software components from heterogeneous frameworks can be compared, correlated and re-used for automotive services based on semantic synergies. We have demonstrated our approach using component meta-models from cross-domain enterprises, that are used for the automotive application domain.</abstract>
    <parentTitle language="eng">MDE4IoT &amp; ModComp 2019: Model-Driven Engineering for the Internet of Things (MDE4IoT) &amp; Interplay of Model-Driven and Component-Based Software Engineering (ModComp); joint proceedings of the Workshop on Model-Driven Engineering for the Internet of Things (MDE4IoT) &amp; of the Workshop on Interplay of Model-Driven and Component-Based Software Engineering (ModComp); co-located with the IEEE/ACM 22nd International Conference on Model Driven Engineering Languages and Systems (MODELS 2019), Munich, Germany, September 15 and 17, 2019</parentTitle>
    <identifier type="doi">10.13140/RG.2.2.28765.15840</identifier>
    <identifier type="url">https://ceur-ws.org/Vol-2442/paper8.pdf</identifier>
    <enrichment key="BegutachtungStatus">begutachtet</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="OtherSeries">CEUR workshop proceedings ; vol-2442</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Sangita De</author>
    <author>Michael Niklas</author>
    <author>Brian Rooney</author>
    <author>Jürgen Mottok</author>
    <author>Premek Brada</author>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16315">Information und Kommunikation</collection>
    <collection role="oaweg" number="">Diamond Open Access - OA-Veröffentlichung ohne Publikationskosten (Sponsoring)</collection>
    <collection role="institutes" number="">Laboratory for Safe and Secure Systems (LAS3)</collection>
  </doc>
  <doc>
    <id>5632</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>20</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Final Round: Benchmarking NIST LWC Ciphers on Microcontrollers</title>
    <abstract language="eng">In this work, we present our benchmarking results for the ten finalist ciphers of the Lightweight Cryptography (LWC) project initiated by National Institute of Standards and Technology (NIST). We evaluate the speed and code size of various software implementations on five different platforms featuring four different architectures. Moreover, we benchmark the dynamic memory utilization of the remaining NIST LWC algorithms on one 32-bit ARM controller. We describe our test cases and methodology and provide some information regarding the design and properties of the finalists before showing and discussing our results. Altogether, we evaluated almost 300 implementations of the 3rd round candidates and pick the most appropriate and best (primary) implementation of each cipher for our comparisons. We include a variant of AES-GCM in our benchmarking in order to be able to compare the state-of-the-art to the novel LWC ciphers. Our research gives an overview over the performance of the latest software implementations of the NIST LWC finalists and shows under which circumstances which candidate is performing the best in our individual test cases. Additionally, we make all benchmarking results, the code for our test framework and every tested implementation available to the public to ensure a transparent testing process.</abstract>
    <parentTitle language="eng">Attacks and Defenses for the Internet-of-Things, 5th International Workshop, ADIoT 2022: Copenhagen, Denmark, September 30, 2022, Revised Selected Papers</parentTitle>
    <identifier type="isbn">978-3-031-21311-3</identifier>
    <identifier type="doi">10.1007/978-3-031-21311-3_1</identifier>
    <enrichment key="opus.import.date">2022-12-14T15:14:57+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science ; 13745</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Sebastian Renner</author>
    <author>Enrico Pozzobon</author>
    <author>Jürgen Mottok</author>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Laboratory for Safe and Secure Systems (LAS3)</collection>
  </doc>
  <doc>
    <id>5634</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>21</pageFirst>
    <pageLast>40</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Evolving a Boolean Masked Adder Using Neuroevolution</title>
    <abstract language="eng">The modular addition is a popular building block when designing lightweight ciphers. While algorithms mainly based on the addition can reach very high performance, masking their implementations results in a huge penalty. Since efficient protection against side-channel attacks is a requirement in lots of use cases, we focus on optimizing the Boolean masking of the modular addition. Contrary to recent related work, we target evolving a masked full adder instead of parts of a parallel prefix adder. We study how techniques typically found in neural network evolution and genetic algorithms can be adapted in order to help in evolving an efficiently masked adder. We customize a well-known neuroevolution algorithm, develop an optimized masked adder with our new approach and implement the ChaCha20 cipher on an ARM Cortex-M3 controller. We compare the performance of the protected neuroevolved implementation to solutions found by traditional search methods. Moreover, the leakage of our new solution is validated by a t-test conducted with a leakage simulator. We present under which circumstances our masked implementation outperforms related work and prove the feasibility of successfully using neuroevolution when searching for complex Boolean networks.</abstract>
    <parentTitle language="eng">Attacks and Defenses for the Internet-of-Things, 5th International Workshop, ADIoT 2022: Copenhagen, Denmark, September 30, 2022, Revised Selected Papers</parentTitle>
    <identifier type="isbn">978-3-031-21310-6</identifier>
    <identifier type="doi">10.1007/978-3-031-21311-3_2</identifier>
    <enrichment key="opus.import.date">2022-12-14T15:14:57+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science ; 13745</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Sebastian Renner</author>
    <author>Enrico Pozzobon</author>
    <author>Jürgen Mottok</author>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Laboratory for Safe and Secure Systems (LAS3)</collection>
  </doc>
  <doc>
    <id>5580</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>14</pageFirst>
    <pageLast>28</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2022-11-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Evaluation of Semantic Interoperability of Automotive Service API Models Based on Metamodels Similarity Metrics Using a Semi-automated Approach</title>
    <abstract language="eng">In recent years, mapping of application software components’ ontologies semantically emerged as a big research challenge in automotive application domain that manipulates several cross-enterprise synergy knowledge application frameworks. The same knowledge formalized by different experts in different vehicle application frameworks leads to heterogeneous representations of components’ interface data. Consequently, this causes the most daunting impediment in semantic interoperability between the service components in cooperative automotive systems. From a modeling perspective, in the absence of standardized domain-based unified modeling techniques, the orchestration and resolution of semantic data interoperability between various vehicle application frameworks’ components’ interface models remain a challenge. However, this challenge could be addressed using ontological metamodeling by specifying semantic associations between components’ interface model concepts based on the domain knowledge. Apart from the semantic mapping of interface ontological metamodels, this work also defines quality metrics to determine the degree of semantic alignment achieved between the various interface ontologies. Additionally, to reduce development time and cost towards semantic interoperability, this work proposes a semi-automated plugin tool for the applicability of the evaluated quality metrics to semantic mapping of real-world components’ interface models.</abstract>
    <parentTitle language="eng">iCETiC 2022 : 5th International Conference on Emerging Technologies in Computing 2022: Aug 15, 2022 - Aug 16, 2022, Chester, UK</parentTitle>
    <identifier type="doi">10.1007/978-3-031-25161-0_2</identifier>
    <enrichment key="BegutachtungStatus">begutachtet</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="OtherSeries">Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ; vol 463</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Sangita De</author>
    <author>Jürgen Mottok</author>
    <author>Premek Brada</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Framework</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Interface</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Metamodel</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Metrics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Ontology</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Semantic</value>
    </subject>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16315">Information und Kommunikation</collection>
    <collection role="institutes" number="">Laboratory for Safe and Secure Systems (LAS3)</collection>
  </doc>
  <doc>
    <id>6085</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>120</pageFirst>
    <pageLast>129</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Evaluating Graph-based Modeling Languages</title>
    <abstract language="eng">As humans, we tend to use models to describe reality. Modeling languages provide the formal frameworks for creating such models. Usually, the graphical design of individual model elements is based on subjective decisions; their suitability is determined at most by the prevalence of the modeling language. With other words: there is no objective way to compare different designs of model elements. The present paper addresses this issue: it introduces a systematic approach for evaluating the elements of graph-based modeling languages comprising 14 criteria – derived from standards, usability analyses, or the design theories ‘Physics of Notations’ and ‘Cognitive Dimensions of Notations’. The criteria come with measurement procedures and evaluation schemes based on reasoning, eye tracking, and questioning. The developed approach is demonstrated with a specific use case: three distinct sets of node elements for causal graphs are evaluated in an eye tracking study with 41 subjects.</abstract>
    <parentTitle language="eng">Proceedings of the 5th European Conference on Software Engineering Education, Seeon/Germany, June 19 - 21, 2023</parentTitle>
    <identifier type="doi">10.1145/3593663.3593664</identifier>
    <identifier type="isbn">978-1-4503-9956-2</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Lisa Grabinger</author>
    <author>Florian Hauser</author>
    <author>Jürgen Mottok</author>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Laboratory for Safe and Secure Systems (LAS3)</collection>
  </doc>
  <doc>
    <id>6088</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>65</pageFirst>
    <pageLast>72</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>ACM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Something Short Gets Even Shorter: Adapting the LIST-K for the Use in an Online Learning Management System</title>
    <abstract language="eng">This study examines how Klingsieck’s LIST-K questionnaire [22] can be shortened and adapted to the requirements of an online learning management system. In a study with 213 participants, the questionnaire is subjected to an exploitative factor analysis. In a next step, the results are evaluated in terms of their reliability. This process creates a modified factor structure for the LIST-K, comprising a total of eight factors. The reliability of the modified questionnaire is at an α of .770. The shortened version of the LIST-K questionnaire is currently being used on an experimental basis in different courses.</abstract>
    <parentTitle language="eng">Proceedings of the 5th European Conference on Software Engineering Education, Seeon/Germany, June 19 - 21, 2023</parentTitle>
    <identifier type="doi">10.1145/3593663.3593684</identifier>
    <identifier type="isbn">978-1-4503-9956-2</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Florian Hauser</author>
    <author>Lisa Grabinger</author>
    <author>Jürgen Mottok</author>
    <collection role="institutes" number="FakEI">Fakultät Elektro- und Informationstechnik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Laboratory for Safe and Secure Systems (LAS3)</collection>
  </doc>
</export-example>
