TY - JOUR A1 - Schildgen, Johannes A1 - Jörg, Thomas A1 - Dossinger, Manuel A1 - Deßloch, Stefan T1 - Marimba: A framework for making MapReduce jobs incremental JF - Proceedings - 2014 IEEE International Congress on Big Data, BigData Congress 2014, 27 June 2014 - 02 July 2014, Anchorage, AK, USA N2 - Many MapReduce jobs for analyzing Big Data require many hours and have to be repeated again and again because the base data changes continuously. In this paper we propose Marimba, a framework for making MapReduce jobs incremental. Thus, a recomputation of a job only needs to process the changes since the last computation. This accelerates the execution and enables more frequent recomputations, which leads to results which are more up-to-date. Our approach is based on concepts that are popular in the area of materialized views in relational database systems where a view can be updated only by aggregating changes in base data upon the previous result. KW - Aggregates KW - Rhythm KW - Computational modeling KW - Programming KW - Google KW - Big data KW - Relational databases Y1 - 2014 U6 - https://doi.org/10.1109/BigData.Congress.2014.27 PB - IEEE ER - TY - JOUR A1 - Schindelhauer, Christian A1 - Volbert, Klaus A1 - Ziegler, Martin T1 - Geometric spanners with applications in wireless networks JF - Computational Geometry: Theory and Applications N2 - In this paper we investigate the relations between spanners, weak spanners, and power spanners in for any dimension and apply our results to topology control in wireless networks. For , a c-spanner is a subgraph of the complete Euclidean graph satisfying the condition that between any two vertices there exists a path of length at most c-times their Euclidean distance. Based on this ability to approximate the complete Euclidean graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak c-spanner, this path may be arbitrarily long, but must remain within a disk or sphere of radius c-times the Euclidean distance between the vertices. Finally in a c-power spanner, the total energy consumed on such a path, where the energy is given by the sum of the squares of the edge lengths on this path, must be at most c-times the square of the Euclidean distance of the direct edge or communication link. While it is known that any c-spanner is also both a weak -spanner and a -power spanner for appropriate , depending only on c but not on the graph under consideration, we show that the converse is not true: there exists a family of -power spanners that are not weak C-spanners and also a family of weak -spanners that are not C-spanners for any fixed C. However a main result of this paper reveals that any weak c-spanner is also a C-power spanner for an appropriate constant C. We further generalize the latter notion by considering -power spanners where the sum of the δth powers of the lengths has to be bounded; so ()-power spanners coincide with the usual power spanners and ()-power spanners are classical spanners. Interestingly, these ()-power spanners form a strict hierarchy where the above results still hold for any some even hold for while counter-examples exist for . We show that every self-similar curve of fractal dimension is not a -power spanner for any fixed C, in general. Finally, we consider the sparsified Yao-graph (SparsY-graph or YY) that is a well-known sparse topology for wireless networks. We prove that all SparsY-graphs are weak c-spanners for a constant c and hence they allow us to approximate energy-optimal wireless networks by a constant factor. Y1 - 2007 U6 - https://doi.org/10.1016/j.comgeo.2006.02.001 VL - 36 IS - 3 SP - 197 EP - 214 ER - TY - JOUR A1 - Sehr, Armin A1 - Barfuss, Hendrik A1 - Hofmann, Christian A1 - Maas, Roland A1 - Kellermann, Walter T1 - Efficient training of acoustic models for reverberation-robust medium-vocabulary automatic speech recognition JF - 2014 4th Joint Workshop on Hands-Free Speech Communication and Microphone Arrays, HSCMA, 12-14 May 2014, Villers-les-Nancy, France N2 - A recently proposed concept for training reverberation-robust acoustic models for automatic speech recognition using pairs of clean and reverberant data is extended from word models to tied-state triphone models in this paper. The key idea of the concept, termed ICEWIND, is to use the clean data for the temporal alignment and the reverberant data for the estimation of the emission densities. Experiments with the 5000-word Wall Street Journal corpus confirm the benefits of ICEWIND with tied-state triphones: While the training time is reduced by more than 90%, the word accuracy is improved at the same time, both for room-specific and multi-style hidden Markov models. Since the acoustic models trained with ICEWIND need less Gaussian components for the emission densities to achieve comparable recognition rates as Baum-Welch acoustic models, ICEWIND also allows for a reduced decoding complexity. KW - Hidden Markov models KW - Training KW - Speech recognition KW - Speech KW - Vectors KW - Accuracy KW - Training data Y1 - 2014 U6 - https://doi.org/10.1109/HSCMA.2014.6843275 SP - 177 EP - 181 PB - IEEE ER - TY - CHAP A1 - Meier, Hans A1 - Reindl, Andrea A1 - Wetzel, Daniel A1 - Niemetz, Michael T1 - Comparative Analysis of CAN, CAN FD and Ethernet for Networked Control Systems T2 - Embedded World 2021 Exhibition & Conference: 1.-5.3.2021, digital, conference proceedings N2 - Networked control systems as e.g., battery management systems, smart grids or vehicular systems, consist of sensors, actuators and controllers with a communication network in the control loop. The data rate and the reliability of the underlying communication network are key factors since delays or message losses directly affect the system control. In addition, the processor load caused by the communication is significant as it influences the calculation of system states and the setting of control parameters. The power consumption of the communication network has a further impact on the energy efficiency of the respective application. In this paper, the communication technologies Controller Area Network (CAN), Controller Area Network Flexible Data-rate (CAN FD) and Ethernet are compared in the context of networked control systems with focus on a decentralized battery management system. First, the message processing time and the processor load are measured. With regard to energy efficiency, the maximum power consumption is determined. The Bit Error Rates (BER) and the Residual Error Rates (RER) are calculated to evaluate the reliability. Finally, the receive FIFO load under high traffic conditions is examined. Index Terms—Networked control systems, decentralized battery management system, microcontrollers, communication systems, Ethernet, Controller Area Network (CAN), Controller Area Network Flexible Data-rate (CAN FD) energy efficiency, energy consumption, bit error rate, residual error rate, processor load. Y1 - 2021 UR - https://www.researchgate.net/publication/354995738_Comparative_Analysis_of_CAN_CAN_FD_and_Ethernet_for_Networked_Control_Systems/link/615706baa6fae644fbb85b95/download PB - WEKA Fachmedien ER - TY - CHAP A1 - Wetzel, Daniel A1 - Reindl, Andrea A1 - Meier, Hans A1 - Niemetz, Michael A1 - Farmbauer, Michael T1 - A Customized Python Interface for Windows OS for a Low Budget USB-to-CAN-Adapter T2 - International Conference on Electrical, Computer and Energy Technologies (ICECET 2022): 20-22 July 2022, Prague, Czech Republic N2 - Over the last three decades, the Controller Area Network (CAN) has become the dominant communication in embedded systems. Especially for automotive systems it offers advantages including high robustness, low error rate and high reliability combined with low power consumption. Therefore, learning the basics of this bus system is substantial in this field. Nowadays, various media about the functionality and use of CAN exist which make it easy to read into the topic. But often, theory alone is not sufficient. To deepen the understanding, practical implementation contributes significantly. However, affordable and easy-to-use CAN devices for training purposes are scarce. Existing equipment can be divided into expensive professional devices, which have many functions and inexpensive ones for hobbyists, which require difficult configurations. Therefore, a practical solution is a low-budget device equipped with an overlay which deals with the time consuming configurations. This paper covers the development of a python interface for a purchasable cost effective CAN device for Windows OS. The intention is to create an easy-to-use program that enables beginners to get in touch with CAN and collect practical experience. At the start, a brief explanation of the CAN functionality is given. After that, we introduce the hardware used in this project. Next, the software part covers the development of the interface and the integration of this interface into python-can. Furthermore, a virtual playground is introduced for testing purposes. Also, to demonstrate the functionality of the interface, a test program is executed in conjunction with a logic analyzer. KW - Controller area network KW - User Interface KW - USB to CAN KW - Windows KW - python-CAN Y1 - 2022 SN - 978-1-66547-087-2 U6 - https://doi.org/10.1109/ICECET55527.2022.9872574 PB - IEEE CY - Piscataway, NJ, USA ER - TY - RPRT A1 - Göppel, Simon A1 - Frikel, Jürgen A1 - Haltmeier, Markus T1 - Translation invariant diagonal frame decomposition of inverse problems and their regularization N2 - Solving inverse problems is central to a variety of important applications, such as biomedical image reconstruction and non-destructive testing. These problems are characterized by the sensitivity of direct solution methods with respect to data perturbations. To stabilize the reconstruction process, regularization methods have to be employed. Well-known regularization methods are based on frame expansions, such as the wavelet-vaguelette (WVD) decomposition, which are well adapted to the underlying signal class and the forward model and allow efficient implementation. However, it is well known that the lack of translational invariance of wavelets and related systems leads to specific artifacts in the reconstruction. To overcome this problem, in this paper we introduce and analyze the concept of translation invariant diagonal frame decomposition (TI-DFD) of linear operators. We prove that a TI-DFD combined with a regularizing filter leads to a convergent regularization method with optimal convergence rates. As illustrative example, we construct a wavelet-based TI-DFD for one-dimensional integration, where we also investigate our approach numerically. The results indicate that filtered TI-DFDs eliminate the typical wavelet artifacts when using standard wavelets and provide a fast, accurate, and stable solution scheme for inverse problems. KW - convergence rates KW - frames KW - Inverse problems KW - operator decomposition KW - regularization KW - translation invariance KW - vaguelettes KW - wavelets Y1 - 2022 U6 - https://doi.org/10.48550/arXiv.2208.08500 ER - TY - CHAP A1 - Frauenschläger, Tobias A1 - Mottok, Jürgen T1 - Security-Gateway for SCADA-Systems in Critical Infrastructures T2 - 27th International Conference on Applied Electronics (AE): 06-07 September 2022, Pilsen, CZ N2 - 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. KW - Critical Infrastructure KW - Certification KW - Supervisory Control and Data Acquisition KW - Security KW - Dependability Y1 - 2022 U6 - https://doi.org/10.1109/AE54730.2022.9920070 PB - IEEE ER - TY - CHAP A1 - Schmid, Michael A1 - Mottok, Jürgen T1 - Investigation of Scheduling Algorithms for DAG. Tasks through Simulations T2 - ERTS 2022, 11th European Congress Embedded Real Time Systems: 1-2 June, Toulouse, France N2 - 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. 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. KW - real-time KW - scheduling KW - task models KW - simulation Y1 - 2022 UR - https://hal.archives-ouvertes.fr/hal-03700472/document ER - TY - GEN A1 - Renner, Sebastian A1 - Pozzobon, Enrico A1 - Mottok, Jürgen T1 - 3rd Round Ciphers Evaluation on Microcontrollers T2 - Lightweight Cryptography Workshop (virtual): May 9-11 2022 Y1 - 2022 UR - https://www.nist.gov/video/day-1-part-2-lightweight-cryptography-workshop-2022 PB - National Institute of Standards and Technology (NIST) CY - Gaithersburg ER - TY - CHAP A1 - De, Sangita A1 - Niklas, Michael A1 - Rooney, Brian A1 - Mottok, Jürgen A1 - Brada, Premek T1 - Towards Semantic model-to-model Mapping of Cross-Domain Component Interfaces for Interoperability of Vehicle Applications : An Approach towards Synergy Exploration T2 - MDE4IoT & ModComp 2019: Model-Driven Engineering for the Internet of Things (MDE4IoT) & 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) & 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 N2 - 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. Y1 - 2019 UR - https://ceur-ws.org/Vol-2442/paper8.pdf U6 - https://doi.org/10.13140/RG.2.2.28765.15840 PB - RWTH Aachen CY - Aachen ER - TY - JOUR A1 - Frikel, Jürgen T1 - A measurement-based model for image reconstruction in MPI using a FFL JF - Proceedings of the 20th International Conference of Numerical Analysis and Applied Mathematics (ICNAAM-2022), 2022, Heraklion (Crete, Greece) N2 - Most of the common model-based reconstruction schemes in magnetic particle imaging (MPI) use idealized assumptions, e.g., of an ideal field-free-line (FFL) topology. However, the magnetic fields that are generated in real MPI scanners have distortions and, therefore, model-based approaches often lead to inaccurate reconstructions and may contain artifacts. In order to improve the reconstruction quality in MPI, more realistic MPI models need to be derived. In the present work, we address this problem and present a hybrid model for MPI that allows us to incorporates real measurements of the applied magnetic fields. We will explain that the measurements, that are needed to setup a model for the magnetic fields, can be obtained in a novel calibration procedure that is independent of the resolution and which is much less time-consuming than the one employed in measurement-based MPI reconstructions.We will also present a discretization strategy for this model, that can be used in context of algebraic reconstructions. The presented approach was validated on simulated data in [1], however, its evaluation on real data is a topic for future research. Y1 - 2023 PB - AIP Publishing ER - TY - JOUR A1 - Göppel, Simon A1 - Frikel, Jürgen A1 - Haltmeier, Markus T1 - Regularization of Inverse Problems with Translation Invariant Frames JF - Proceedings of the 20th International Conference of Numerical Analysis and Applied Mathematics (ICNAAM-2022), 2022, Heraklion (Crete, Greece) N2 - In various fields of applications, inverse problems are characterized by their sensitivity to data perturbations which can cause severe reconstruction errors. Hence, regularization procedures are employed in order to ensure stability and reconstruction quality. To overcome limitations of classical approaches such as the filtered singular value decomposition (SVD), frame based diagonalization methods have been studied in the recent years, e.g., wavelet-vagulette (WVD) decomposition. While these methods can be well adapted to the problem at hand, it is well-known, that the lack of translation invariance in multiscale systems can cause specific artifacts in the recovered object. Thus, to overcome these drawbacks we use the translation invariant diagonal frame decomposition (TI-DFD) of linear operators. For illustration, we construct a TI-WVD for one-dimensional integration operator, and confirm our theoretical findings by numerical simulations. Y1 - 2023 PB - AIP Publishing ER - TY - JOUR A1 - Lukyanets, S. A1 - Snarskii, Andrei A. A1 - Shamonin (Chamonine), Mikhail A1 - Bakaev, V. V. T1 - Calculation of magnetic leakage field from a surface defect in a linear ferromagnetic material: an analytical approach JF - NDT & E International N2 - A novel analytical approach for calculating the magnetic leakage field from surface defects is proposed and demonstrated for the case of a linear ferromagnetic material. The novelty of the theory is that it relates the distribution of induced magnetic charges to the surface shape. An excellent agreement between the analytical and numerical results is shown. The functional relations between different magnetic field components are discussed. KW - Magnetic methods KW - Flux leakage KW - Mathematical model KW - Defects Y1 - 2003 U6 - https://doi.org/10.1016/s0963-8695(02)00071-3 VL - 36 IS - 1 SP - 51 EP - 55 PB - Elsevier ER - TY - JOUR A1 - Bakaev, V. V. A1 - Snarskii, Andrei A. A1 - Shamonin (Chamonine), Mikhail T1 - The permeability and remanent magnetization of a randomly inhomogeneous two-phase medium JF - Technical Physics N2 - A randomly inhomogeneous composite consisting of two, ferromagnetic and nonmagnetic (para-or diamagnetic), phases is considered. The dependence of the effective permeability of the composite on the concentration of the ferromagnetic phase and on the applied magnetic field is found for the case of the negligible hysteresis loop. When the hysteresis loop is appreciable, the remanent magnetization as a function of the ferromagnet concentration is calculated. Y1 - 2002 U6 - https://doi.org/10.1134/1.1435901 VL - 47 IS - 1 SP - 125 EP - 128 PB - Springer ER - TY - JOUR A1 - Bakaev, V. V. A1 - Snarskii, Andrei A. A1 - Shamonin (Chamonine), Mikhail T1 - The effective magnetic permeability of a two-phase fibred ferromagnetic composite JF - Technical Physics Y1 - 2001 U6 - https://doi.org/10.1134/1.1427995 VL - 46 IS - 12 SP - 1571 EP - 1574 PB - Springer ER - TY - CHAP A1 - De, Sangita A1 - Mottok, Jürgen A1 - Brada, Premek ED - Miraz, M.H. ED - Southall, G. ED - Ali, Maaruf ED - Ware, A. T1 - Evaluation of Semantic Interoperability of Automotive Service API Models Based on Metamodels Similarity Metrics Using a Semi-automated Approach T2 - iCETiC 2022 : 5th International Conference on Emerging Technologies in Computing 2022: Aug 15, 2022 - Aug 16, 2022, Chester, UK N2 - 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. KW - Framework KW - Interface KW - Metamodel KW - Metrics KW - Ontology KW - Semantic Y1 - 2023 U6 - https://doi.org/10.1007/978-3-031-25161-0_2 SP - 14 EP - 28 PB - Springer CY - Cham ER - TY - CHAP A1 - Rasp, Franziska A1 - Sahinbas, Burak A1 - Reisinger, Thomas A1 - Hipp, Susanne A1 - Leitgeb, Erich T1 - From Ray Tracing to Channel Impulse Responses: A Review on the Description of Polarimetric Time-Invariant SISO Channels T2 - 2024 International Conference on Broadband Communications for Next Generation Networks and Multimedia Applications (CoBCom), 09-11 July 2024, Graz, Austria N2 - One key enabler of autonomous driving is vehicle-to-everything (V2X) communication and positioning using cellular technologies. To design a vehicular localization system, the understanding and modeling of the physical radio channel (RC) is crucial. Polarization is an important yet often overlooked parameter of the RC. The combined polarization of the transmitting and receiving antennas, along with the environment, significantly affects the Channel Impulse Response (CIR) and localization performance. This paper aims to provide a deterministic description of the time-invariant Single-Input Single-Output (SISO) RC with focus on its polarimetric properties. The aim is to link the understanding of physical wave propagation directly to the conventional CIR descriptions used in localization and signal processing. The focus is on SISO RC modeling for arbitrary antennas, including Line-of-Sight (LoS) and multiple reflections. This study intentionally excludes diffraction, diffuse scattering, and bandwidth limitations, yet establishes a foundational frame-work for future multi-antenna systems with full polarimetric capabilities. The paper describes wave propagation using the Jones Calculus to separate polarimetric wave components, and models the polarimetric reception typical of RC modeling methods in positioning. This approach allows for the calculation of received signal at the antenna feed point. The application context of this research is in ranging or positioning within the V2X framework. KW - Channel Modeling KW - Ray Tracing KW - Wave Propagation KW - Friis KW - Jones Calculus KW - Polarization Diversity Y1 - 2024 SN - 979-8-3503-8845-9 U6 - https://doi.org/10.1109/CoBCom62281.2024.10631174 SN - 2834-8265 SP - 1 EP - 8 PB - IEEE ER - TY - CHAP A1 - Rasp, Franziska A1 - Eberlein, Ernst A1 - Perner, Bastian A1 - Roth-Mandutz, Elke A1 - Hipp, Susanne T1 - Enhanced 5G Sidelink Ranging Based on Carrier Aggregation T2 - 2023 13th International Conference on Indoor Positioning and Indoor Navigation (IPIN), Nuremberg, Germany, 25-28 September 2023 N2 - Radio access network based positioning and ranging technologies become more and more important for autonomous driving. Positioning on the 5G Sidelink (SL) is discussed in Release 18 (2022-2024) of the Third Generation Partnership Project. For accurate timing-based ranging, a high temporal and spatial resolution is fundamental. The bandwidth for 5G SL positioning is limited due to sharing the existing SL resources with communication. Therefore, we send the positioning reference signal on two separate Component Carriers, i.e. we use a fragmented spectrum. We introduce a two step algorithm for estimating the time of arrival using the inflection point method. We proved a fragmented spectrum can achieve the same accuracy as a continuous spectrum. KW - Sidelink KW - 5G mobile communications KW - Distance measurement KW - Ranging KW - Positioning Y1 - 2023 SN - 9798350320114 U6 - https://doi.org/10.1109/IPIN57070.2023.10332548 SP - 1 EP - 6 PB - IEEE ER - TY - GEN A1 - Baumann, Timo A1 - Geiser, Dorothee A1 - Menzel, Wolfgang A1 - Mohr, Mario A1 - Neef, Svenja A1 - Nykamp, Sören A1 - Rokita, Nils T1 - Concurrent Sub-turn Interaction Specification and Dialogue Management with an Application to Interactive Storytelling T2 - GSCL Workshop Gesprochene Sprache und Sprachverarbeitung (GSS), Darmstadt, Germany, 2013 N2 - Conventional dialogue management centers around an interaction style that is best described as a ping-pong game, with full turns being the units at which speech is delivered (and expected) by the system, which greatly simplifies the interaction management, delivery and understanding components of the system. While the resulting mode of interaction works well for task-based systems, it is insufficient for more conversational interaction styles, where content is delivered and grounded in units finer than full turns (Poesio and Traum 1997) and where turns are delivered concurrently by both interlocutors and hence overlap more frequently. One domain with particularly frequent overlapping contributions is interactive storytelling: a storyteller that is responsive to listeners will integrate their feedback immediately while still speaking a current contribution, and listener’s remarks or propositions regarding the story will typically be uttered immediately when the related content is delivered. We present our work on a dialogue manager that leverages recent advances in incremental speech delivery and reception (Baumann 2013) to provide for an interactive and concurrent storytelling experience. Our system uses an interaction graph, which uses a word-by-word granularity and allows to specify for individual stretches of speech where (and with what content) users may interrupt/comment, how this is interpreted, and how it is integrated into the storytelling process, thus providing for in-utterance alternatives to be spoken even without audibly interrupting the system’s ongoing utterance. The system’s interaction graph is specified in an XML language and may be hand-crafted by a story designer but can also be automatically generated. In our current system, speech recognition results are interpreted only when the user utterance is finished; however, we plan to integrate incremental speech recognition and understanding capabilities, and to immediately react to the start of user contributions. Y1 - 2013 CY - Darmstadt, Germany ER - TY - JOUR A1 - Reschke, Johannes A1 - Neumann, Cornelius A1 - Berlitz, Stephan T1 - Personalised neural networks for a driver intention prediction: communication as enabler for automated driving JF - Advanced Optical Technologies N2 - In everyday traffic, pedestrians rely on informal communication with other road users. In case of auto� mated vehicles, this communication can be replaced by light signals, which need to be learned beforehand. Prior to an extensive introduction of automated vehicles, a learning phase for these light signals can be set up in manual driving with help of a driver intention prediction. Therefore, a three-staged algorithm consisting of a neural network, a random forest and a conditional stage, is implemented. Using this algorithm, a true-positive rate (TPR) of 94.0% for a 5.0% false-positive rate (FPR) can be achieved. To improve this process, a personalization pro� cedure is implemented, using driver-specific behaviours, resulting in TPRs ranging from 91.5 to 96.6% for a FPR of 5.0%. Transfer learning of neural networks improves the prediction accuracy of almost all drivers. In order to introduce the implemented algorithm in today’s traffic, especially the FPR has to be improved considerably. KW - automotive lighting KW - learning signals KW - recurrent neural networks KW - time sequence processing KW - vehicle-pedestrian-communication Y1 - 2020 U6 - https://doi.org/10.1515/aot-2020-0035 VL - 9 IS - 6 SP - 357 EP - 364 PB - De Gruyter ER -