TY - CONF AU - Camberg, Alan Adam AU - Hielscher, Christian ID - 16826 T2 - Aachen Body Engineering Days 2019 TI - A holistic approach to the lightweight design of tailored structural components using the example of a hybrid A-pillar ER - TY - CONF AU - Camberg, Alan Adam AU - Tröster, Thomas ID - 16827 T2 - 26. Sächsische Fachtagung Umformtechnik TI - Challenges in fracture modeling under non-isothermal forming conditions using the example of a new forming process for aluminum blanks ER - TY - CONF AU - Tinkloh, Steffen Rainer AU - Wu, Tao AU - Tröster, Thomas AU - Niendorf, Thomas ID - 16831 TI - A micromechanical based finite element simulation of process induced residual stresses in metal-CFRP-hybrid structures ER - TY - GEN AB - In this work we describe our results achieved in the ProtestNews Lab at CLEF 2019. To tackle the problems of event sentence detection and event extraction we decided to use contextualized string embeddings. The models were trained on a data corpus collected from Indian news sources, but evaluated on data obtained from news sources from other countries as well, such as China. Our models have obtained competitive results and have scored 3rd in the event sentence detection task and 1st in the event extraction task based on average F1-scores for different test datasets. AU - Skitalinskaya, Gabriella AU - Klaff, Jonas AU - Spliethöver, Maximilian ID - 16847 TI - CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction VL - 2380 ER - TY - GEN AB - State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing. AU - Witschen, Linus Matthias AU - Ghasemzadeh Mohammadi, Hassan AU - Artmann, Matthias AU - Platzner, Marco ID - 16853 KW - Approximate computing KW - parameter selection KW - search space exploration KW - verification KW - circuit synthesis T2 - Fourth Workshop on Approximate Computing (AxC 2019) TI - Jump Search: A Fast Technique for the Synthesis of Approximate Circuits ER - TY - JOUR AU - Atkins, Marc AU - Gilroy, Bernard Michael AU - Seiler, Volker ID - 16882 IS - 2 JF - Intereconomics TI - New Dimensions of Service Offshoring in World Trade VL - 54 ER - TY - CHAP AU - Gilroy, Bernard Michael AU - Golderbein, Alexander AU - Peitz, Christian AU - Stöckmann, Nico ED - Fortz, B. ED - Labbé, M. ID - 16883 T2 - Operations Research Proceedings 2018 TI - The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies ER - TY - JOUR AU - Krimphove, Dieter AU - Peitz, Christian ID - 16884 JF - Fintechs: Rechtliche Grundlagen moderner Finanztechnologien TI - Social-Trading und Copy-Trading ER - TY - JOUR AU - Heinen, Matthias AU - Vrabec, Jadran ID - 16955 JF - The Journal of Chemical Physics KW - pc2-ressources SN - 0021-9606 TI - Evaporation sampled by stationary molecular dynamics simulation ER - TY - JOUR AU - Fingerhut, Robin AU - Herres, Gerhard AU - Vrabec, Jadran ID - 16958 JF - Molecular Physics KW - pc2-ressources SN - 0026-8976 TI - Thermodynamic factor of quaternary mixtures from Kirkwood–Buff integration ER - TY - JOUR AU - Mennicken, Max AU - Peter, Sophia Katharina AU - Kaulen, Corinna AU - Simon, Ulrich AU - Karthäuser, Silvia ID - 16960 JF - The Journal of Physical Chemistry C KW - pc2-ressources SN - 1932-7447 TI - Controlling the Electronic Contact at the Terpyridine/Metal Interface ER - TY - JOUR AU - Tönnies, Merle AU - Henneböhl, Dennis ID - 17057 IS - 2 JF - Journal for the Study of British Cultures TI - Negotiating Images of (Un-)Belonging and (Divided) Communities: Ali Smith's Seasonal Quartet as a Counter-Narrative to Brexit VL - 26 ER - TY - JOUR AB - Cyanobacteriochromes are compact and spectrally diverse photoreceptor proteins that are promising candidates for biotechnological applications. Computational studies can contribute to an understanding at a molecular level of their wide spectral tuning and diversity. In this contribution, we benchmark methods to model a 110 nm shift in the UV/Vis absorption spectrum from a red- to a green-absorbing form of the cyanobacteriochrome Slr1393g3. Based on an assessment of semiempirical methods to describe the chromophore geometries of both forms in vacuo, we find that DFTB2+D leads to structures that are the closest to the reference method. The benchmark of the excited state calculations is based on snapshots from quantum mechanics/molecular mechanics molecular dynamics simulations. In our case, the methods RI-ADC(2) and sTD-DFT based on CAM-B3LYP ground state calculations perform the best, whereas no functional can be recommended to simulate the absorption spectra of both forms with time-dependent density functional theory. Furthermore, the difference in absorption for the lowest energy absorption maxima of both forms can already be modelled with optimized structures, but sampling is required to improve the shape of the absorption bands of both forms, in particular for the second band. This benchmark study can guide further computational studies, as it assesses essential components of a protocol to model the spectral tuning of both cyanobacteriochromes and the related phytochromes. AU - Wiebeler, Christian AU - Schapiro, Igor ID - 17077 JF - Molecules KW - pc2-ressources SN - 1420-3049 TI - QM/MM Benchmarking of Cyanobacteriochrome Slr1393g3 Absorption Spectra ER - TY - GEN AU - Oevel, Gudrun AU - Graf-Schlattmann, Marcel AU - Meister, Dorothee M. AU - Wilde, Melanie ID - 17157 TI - Digitaler Wandel als strategischer Transformationsprozess – Zum allgemeinen und hochschulspezifischen Verständnis der Digitalisierung ER - TY - JOUR AU - Oevel, Gudrun AU - Barlösius, Eva ID - 17160 JF - Zeitschrift für Bibliothekswesen und Bibliographie SN - 0044-2380 TI - Quo vadis, Fachinformationsdienste? Ein Überblick über die Ergebnisse der Evaluierung des Förderprogramms »Fachinformationsdienste« für die Wissenschaft ER - TY - CONF AB - State-of-the-art frameworks for generating approximate circuits automatically explore the search space in an iterative process - often greedily. Synthesis and verification processes are invoked in each iteration to evaluate the found solutions and to guide the search algorithm. As a result, a large number of approximate circuits is subjected to analysis - leading to long runtimes - but only a few approximate circuits might form an acceptable solution. In this paper, we present our Jump Search (JS) method which seeks to reduce the runtime of an approximation process by reducing the number of expensive synthesis and verification steps. To reduce the runtime, JS computes impact factors for each approximation candidate in the circuit to create a selection of approximate circuits without invoking synthesis or verification processes. We denote the selection as path from which JS determines the final solution. In our experimental results, JS achieved speed-ups of up to 57x while area savings remain comparable to the reference search method, Simulated Annealing. AU - Witschen, Linus Matthias AU - Ghasemzadeh Mohammadi, Hassan AU - Artmann, Matthias AU - Platzner, Marco ID - 10577 KW - Approximate computing KW - design automation KW - parameter selection KW - circuit synthesis SN - 9781450362528 T2 - Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI '19 TI - Jump Search: A Fast Technique for the Synthesis of Approximate Circuits ER - TY - JOUR AU - Tagne, V. K. AU - Fotso, S. AU - Fono, L. A. AU - Hüllermeier, Eyke ID - 10578 IS - 2 JF - New Mathematics and Natural Computation TI - Choice Functions Generated by Mallows and Plackett–Luce Relations VL - 15 ER - TY - CONF AB - We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio. AU - Scheideler, Christian AU - Setzer, Alexander ID - 10586 KW - Graphs transformations KW - NP-hardness KW - approximation algorithms T2 - Proceedings of the 46th International Colloquium on Automata, Languages, and Programming TI - On the Complexity of Local Graph Transformations VL - 132 ER - TY - JOUR AB - We present a new framework for optimal and feedback control of PDEs using Koopman operator-based reduced order models (K-ROMs). The Koopman operator is a linear but infinite-dimensional operator which describes the dynamics of observables. A numerical approximation of the Koopman operator therefore yields a linear system for the observation of an autonomous dynamical system. In our approach, by introducing a finite number of constant controls, the dynamic control system is transformed into a set of autonomous systems and the corresponding optimal control problem into a switching time optimization problem. This allows us to replace each of these systems by a K-ROM which can be solved orders of magnitude faster. By this approach, a nonlinear infinite-dimensional control problem is transformed into a low-dimensional linear problem. Using a recent convergence result for the numerical approximation via Extended Dynamic Mode Decomposition (EDMD), we show that the value of the K-ROM based objective function converges in measure to the value of the full objective function. To illustrate the results, we consider the 1D Burgers equation and the 2D Navier–Stokes equations. The numerical experiments show remarkable performance concerning both solution times and accuracy. AU - Peitz, Sebastian AU - Klus, Stefan ID - 10593 JF - Automatica SN - 0005-1098 TI - Koopman operator-based model reduction for switched-system control of PDEs VL - 106 ER - TY - JOUR AB - In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems where only a subset of the set of objective functions is taken into account. If the Pareto critical set is completely described by its boundary (e.g., if we have more objective functions than dimensions in decision space), then this can be used to efficiently solve the MOP by solving a number of MOPs with fewer objective functions. If this is not the case, the results can still give insight into the structure of the Pareto critical set. AU - Gebken, Bennet AU - Peitz, Sebastian AU - Dellnitz, Michael ID - 10595 IS - 4 JF - Journal of Global Optimization SN - 0925-5001 TI - On the hierarchical structure of Pareto critical sets VL - 73 ER - TY - CONF AB - In comparison to classical control approaches in the field of electrical drives like the field-oriented control (FOC), model predictive control (MPC) approaches are able to provide a higher control performance. This refers to shorter settling times, lower overshoots, and a better decoupling of control variables in case of multi-variable controls. However, this can only be achieved if the used prediction model covers the actual behavior of the plant sufficiently well. In case of model deviations, the performance utilizing MPC remains below its potential. This results in effects like increased current ripple or steady state setpoint deviations. In order to achieve a high control performance, it is therefore necessary to adapt the model to the real plant behavior. When using an online system identification, a less accurate model is sufficient for commissioning of the drive system. In this paper, the combination of a finite-control-set MPC (FCS-MPC) with a system identification is proposed. The method does not require high-frequency signal injection, but uses the measured values already required for the FCS-MPC. An evaluation of the least squares-based identification on a laboratory test bench showed that the model accuracy and thus the control performance could be improved by an online update of the prediction models. AU - Hanke, Soren AU - Peitz, Sebastian AU - Wallscheid, Oliver AU - Böcker, Joachim AU - Dellnitz, Michael ID - 10597 SN - 9781538694145 T2 - 2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE) TI - Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification ER - TY - JOUR AU - Khan, Gohar Feroz AU - Trier, Matthias ID - 10792 IS - 4 JF - European Journal of Information Systems SN - 0960-085X TI - Assessing the long-term fragmentation of information systems research with a longitudinal multi-network analysis VL - 28 ER - TY - CONF AU - Potthast, Martin AU - Gienapp, Lukas AU - Euchner, Florian AU - Heilenkötter, Nick AU - Weidmann, Nico AU - Wachsmuth, Henning AU - Stein, Benno AU - Hagen, Matthias ID - 11709 T2 - 42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019) TI - Argument Search: Assessing Argument Relevance ER - TY - GEN AU - Wachsmuth, Henning ID - 11713 IS - 3 T2 - Computational Linguistics TI - Book Review: Argumentation Mining VL - 45 ER - TY - CONF AU - Ajjour, Yamen AU - Wachsmuth, Henning AU - Kiesel, Johannes AU - Potthast, Martin AU - Hagen, Matthias AU - Stein, Benno ID - 11714 T2 - Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence TI - Data Acquisition for Argument Search: The args.me Corpus ER - TY - JOUR AB - Advances in electromyographic (EMG) sensor technology and machine learning algorithms have led to an increased research effort into high density EMG-based pattern recognition methods for prosthesis control. With the goal set on an autonomous multi-movement prosthesis capable of performing training and classification of an amputee’s EMG signals, the focus of this paper lies in the acceleration of the embedded signal processing chain. We present two Xilinx Zynq-based architectures for accelerating two inherently different high density EMG-based control algorithms. The first hardware accelerated design achieves speed-ups of up to 4.8 over the software-only solution, allowing for a processing delay lower than the sample period of 1 ms. The second system achieved a speed-up of 5.5 over the software-only version and operates at a still satisfactory low processing delay of up to 15 ms while providing a higher reliability and robustness against electrode shift and noisy channels. AU - Boschmann, Alexander AU - Agne, Andreas AU - Thombansen, Georg AU - Witschen, Linus Matthias AU - Kraus, Florian AU - Platzner, Marco ID - 11950 JF - Journal of Parallel and Distributed Computing KW - High density electromyography KW - FPGA acceleration KW - Medical signal processing KW - Pattern recognition KW - Prosthetics SN - 0743-7315 TI - Zynq-based acceleration of robust high density myoelectric signal processing VL - 123 ER - TY - CHAP AU - Senft, Björn AU - Rittmeier, Florian AU - Fischer, Holger Gerhard AU - Oberthür, Simon ID - 11952 SN - 0302-9743 T2 - Design, User Experience, and Usability. Practice and Case Studies TI - A Value-Centered Approach for Unique and Novel Software Applications ER - TY - JOUR AB - As flexible optical devices that can manipulate the phase and amplitude of light, metasurfaces would clearly benefit from directional optical properties. However, single layer metasurface systems consisting of two-dimensional nanoparticle arrays exhibit only a weak spatial asymmetry perpendicular to the surface and therefore have mostly symmetric transmission features. Here, we present a metasurface design principle for nonreciprocal polarization encryption of holographic images. Our approach is based on a two-layer plasmonic metasurface design that introduces a local asymmetry and generates a bidirectional functionality with full phase and amplitude control of the transmitted light. The encoded hologram is designed to appear in a particular linear cross-polarization channel, while it is disappearing in the reverse propagation direction. Hence, layered metasurface systems can feature asymmetric transmission with full phase and amplitude control and therefore expand the design freedom in nanoscale optical devices toward asymmetric information processing and security features for anticounterfeiting applications. AU - Frese, Daniel AU - Wei, Qunshuo AU - Wang, Yongtian AU - Huang, Lingling AU - Zentgraf, Thomas ID - 11953 IS - 6 JF - Nano Letters SN - 1530-6984 TI - Nonreciprocal Asymmetric Polarization Encryption by Layered Plasmonic Metasurfaces VL - 19 ER - TY - JOUR AU - Li, Tianyou AU - Wei, Qunshuo AU - Reineke, Bernhard AU - Walter, Felicitas AU - Wang, Yongtian AU - Zentgraf, Thomas AU - Huang, Lingling ID - 11955 IS - 15 JF - Optics Express SN - 1094-4087 TI - Reconfigurable metasurface hologram by utilizing addressable dynamic pixels VL - 27 ER - TY - CONF AB - We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of degraded input and clean training targets. Thus, training can be carried out on real recordings of noisy speech rather than simulated ones. In contrast to previous work on unsupervised training of neural mask estimators, our approach avoids the need for a possibly pre-trained teacher model entirely. We demonstrate the effectiveness of our approach by speech recognition experiments on two different datasets: one mainly deteriorated by noise (CHiME 4) and one by reverberation (REVERB). The results show that the performance of the proposed system is on par with a supervised system using oracle target masks for training and with a system trained using a model-based teacher. AU - Drude, Lukas AU - Heymann, Jahn AU - Haeb-Umbach, Reinhold ID - 11965 T2 - INTERSPEECH 2019, Graz, Austria TI - Unsupervised training of neural mask-based beamforming ER - TY - CONF AU - Bronner, Fabian AU - Sommer, Christoph ID - 11985 SN - 9781538694282 T2 - 2018 IEEE Vehicular Networking Conference (VNC) TI - Efficient Multi-Channel Simulation of Wireless Communications ER - TY - CHAP AU - Reinold, Peter AU - Meyer, Norbert AU - Buse, Dominik AU - Klingler, Florian AU - Sommer, Christoph AU - Dressler, Falko AU - Eisenbarth, Markus AU - Andert, Jakob ID - 12043 SN - 2198-7432 T2 - Proceedings TI - Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest ER - TY - CHAP AU - Sommer, Christoph AU - Eckhoff, David AU - Brummer, Alexander AU - Buse, Dominik S. AU - Hagenauer, Florian AU - Joerer, Stefan AU - Segata, Michele ID - 12072 SN - 2522-8595 T2 - Recent Advances in Network Simulation TI - Veins: The Open Source Vehicular Network Simulation Framework ER - TY - CONF AU - Yigitbas, Enes AU - Heindörfer, Joshua AU - Engels, Gregor ID - 12076 T2 - Proceedings of the Mensch und Computer 2019 (MuC ’19) TI - A Context-aware Virtual Reality First Aid Training Application ER - TY - GEN AB - Die Komplexität von Steuersystemen gewinnt in der Debatte um den internationalen Steuerwettbewerb zunehmend an Bedeutung. Im vorliegenden Beitrag erfolgt, basierend auf den Daten, die dem Tax Complexity Index (www.taxcomplexity.org) zugrunde liegen, eine umfassende Gegenüberstellung der Komplexität der Steuersysteme von Deutschland und Öster-reich unter Berücksichtigung der Mittelwerte aller Länder. Die Steuergesetze weisen sowohl in Deutschland als auch in Österreich einen verhältnismäßig hohen Grad an Komplexität auf. Bei den steuerlichen Rahmenbedingungen fällt der Grad an Komplexität in beiden Ländern dagegen niedrig aus, wobei Österreich im Durchschnitt weniger komplex ist als Deutschland. AU - Hoppe, Thomas AU - Rechbauer, Martina AU - Sturm, Susann ID - 12077 TI - Steuerkomplexität im Vergleich zwischen Deutschland und Österreich – Eine Analyse des Status quo ER - TY - CONF AU - Feldkord, Björn AU - Knollmann, Till AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm ID - 12870 T2 - Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) TI - Managing Multiple Mobile Resources ER - TY - CONF AB - We propose a training scheme to train neural network-based source separation algorithms from scratch when parallel clean data is unavailable. In particular, we demonstrate that an unsupervised spatial clustering algorithm is sufficient to guide the training of a deep clustering system. We argue that previous work on deep clustering requires strong supervision and elaborate on why this is a limitation. We demonstrate that (a) the single-channel deep clustering system trained according to the proposed scheme alone is able to achieve a similar performance as the multi-channel teacher in terms of word error rates and (b) initializing the spatial clustering approach with the deep clustering result yields a relative word error rate reduction of 26% over the unsupervised teacher. AU - Drude, Lukas AU - Hasenklever, Daniel AU - Haeb-Umbach, Reinhold ID - 12874 T2 - ICASSP 2019, Brighton, UK TI - Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation ER - TY - CONF AB - Signal dereverberation using the Weighted Prediction Error (WPE) method has been proven to be an effective means to raise the accuracy of far-field speech recognition. First proposed as an iterative algorithm, follow-up works have reformulated it as a recursive least squares algorithm and therefore enabled its use in online applications. For this algorithm, the estimation of the power spectral density (PSD) of the anechoic signal plays an important role and strongly influences its performance. Recently, we showed that using a neural network PSD estimator leads to improved performance for online automatic speech recognition. This, however, comes at a price. To train the network, we require parallel data, i.e., utterances simultaneously available in clean and reverberated form. Here we propose to overcome this limitation by training the network jointly with the acoustic model of the speech recognizer. To be specific, the gradients computed from the cross-entropy loss between the target senone sequence and the acoustic model network output is backpropagated through the complex-valued dereverberation filter estimation to the neural network for PSD estimation. Evaluation on two databases demonstrates improved performance for on-line processing scenarios while imposing fewer requirements on the available training data and thus widening the range of applications. AU - Heymann, Jahn AU - Drude, Lukas AU - Haeb-Umbach, Reinhold AU - Kinoshita, Keisuke AU - Nakatani, Tomohiro ID - 12875 T2 - ICASSP 2019, Brighton, UK TI - Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR ER - TY - CONF AB - In this paper, we present libDirectional, a MATLAB library for directional statistics and directional estimation. It supports a variety of commonly used distributions on the unit circle, such as the von Mises, wrapped normal, and wrapped Cauchy distributions. Furthermore, various distributions on higher-dimensional manifolds such as the unit hypersphere and the hypertorus are available. Based on these distributions, several recursive filtering algorithms in libDirectional allow estimation on these manifolds. The functionality is implemented in a clear, well-documented, and object-oriented structure that is both easy to use and easy to extend. AU - Kurz, Gerhard AU - Gilitschenski, Igor AU - Pfaff, Florian AU - Drude, Lukas AU - Hanebeck, Uwe D. AU - Haeb-Umbach, Reinhold AU - Siegwart, Roland Y. ID - 12876 T2 - Journal of Statistical Software 89(4) TI - Directional Statistics and Filtering Using libDirectional ER - TY - CONF AB - By distributing the computational load over the nodes of a Wireless Acoustic Sensor Network (WASN), the real-time capability of the TRINICON (TRIple-N-Independent component analysis for CONvolutive mixtures) framework for Blind Source Separation (BSS) can be ensured, even if the individual network nodes are not powerful enough to run TRINICON in real-time by themselves. To optimally utilize the limited computing power and data rate in WASNs, the MARVELO (Multicast-Aware Routing for Virtual network Embedding with Loops in Overlays) framework is expanded for use with TRINICON, while a feature-based selection scheme is proposed to exploit the most beneficial parts of the input signal for adapting the demixing system. The simulation results of realistic scenarios show only a minor degradation of the separation performance even in heavily resource-limited situations. AU - Guenther, Michael AU - Afifi, Haitham AU - Brendel, Andreas AU - Karl, Holger AU - Kellermann, Walter ID - 12880 T2 - 2019 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA) (WASPAA 2019) TI - Sparse Adaptation of Distributed Blind Source Separation in Acoustic Sensor Networks ER - TY - CONF AB - Internet of Things (IoT) applications witness an exceptional evolution of traffic demands, while existing protocols, as seen in wireless sensor networks (WSNs), struggle to cope with these demands. Traditional protocols rely on finding a routing path between sensors generating data and sinks acting as gateway or databases. Meanwhile, the network will suffer from high collisions in case of high data rates. In this context, in-network processing solutions are used to leverage the wireless nodes' computations, by distributing processing tasks on the nodes along the routing path. Although in-network processing solutions are very popular in wired networks (e.g., data centers and wide area networks), there are many challenges to adopt these solutions in wireless networks, due to the interference problem. In this paper, we solve the problem of routing and task distribution jointly using a greedy Virtual Network Embedding (VNE) algorithm, and consider power control as well. Through simulations, we compare the proposed algorithm to optimal solutions and show that it achieves good results in terms of delay. Moreover, we discuss its sub-optimality by driving tight lower bounds and loose upper bounds. We also compare our solution with another wireless VNE solution to show the trade-off between delay and symbol error rate. AU - Afifi, Haitham AU - Karl, Holger ID - 12881 T2 - 2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) (WMNC'19) TI - An Approximate Power Control Algorithm for a Multi-Cast Wireless Virtual Network Embedding ER - TY - CONF AB - One of the major challenges in implementing wireless virtualization is the resource discovery. This is particularly important for the embedding-algorithms that are used to distribute the tasks to nodes. MARVELO is a prototype framework for executing different distributed algorithms on the top of a wireless (802.11) ad-hoc network. The aim of MARVELO is to select the nodes for running the algorithms and to define the routing between the nodes. Hence, it also supports monitoring functionalities to collect information about the available resources and to assist in profiling the algorithms. The objective of this demo is to show how MAVRLEO distributes tasks in an ad-hoc network, based on a feedback from our monitoring tool. Additionally, we explain the work-flow, composition and execution of the framework. AU - Afifi, Haitham AU - Karl, Holger AU - Eikenberg, Sebastian AU - Mueller, Arnold AU - Gansel, Lars AU - Makejkin, Alexander AU - Hannemann, Kai AU - Schellenberg, Rafael ID - 12882 KW - WSN KW - virtualization KW - VNE T2 - 2019 IEEE Wireless Communications and Networking Conference (WCNC) (IEEE WCNC 2019) (Demo) TI - A Rapid Prototyping for Wireless Virtual Network Embedding using MARVELO ER - TY - GEN AU - Haltermann, Jan Frederik ID - 12885 TI - Analyzing Data Usage in Array Programs ER - TY - CONF AU - Yigitbas, Enes AU - Jovanovikj, Ivan AU - Sauer, Stefan AU - Engels, Gregor ID - 12889 T2 - Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes (IFIP WG 13.2 & WG 13.5 International Workshop @ INTERACT2019) TI - A Model-based Framework for Context-aware Augmented Reality Applications ER - TY - JOUR AB - We formulate a generic framework for blind source separation (BSS), which allows integrating data-driven spectro-temporal methods, such as deep clustering and deep attractor networks, with physically motivated probabilistic spatial methods, such as complex angular central Gaussian mixture models. The integrated model exploits the complementary strengths of the two approaches to BSS: the strong modeling power of neural networks, which, however, is based on supervised learning, and the ease of unsupervised learning of the spatial mixture models whose few parameters can be estimated on as little as a single segment of a real mixture of speech. Experiments are carried out on both artificially mixed speech and true recordings of speech mixtures. The experiments verify that the integrated models consistently outperform the individual components. We further extend the models to cope with noisy, reverberant speech and introduce a cross-domain teacher–student training where the mixture model serves as the teacher to provide training targets for the student neural network. AU - Drude, Lukas AU - Haeb-Umbach, Reinhold ID - 12890 JF - IEEE Journal of Selected Topics in Signal Processing TI - Integration of Neural Networks and Probabilistic Spatial Models for Acoustic Blind Source Separation ER - TY - CONF AU - Augstein, Mirjam AU - Herder, Eelco AU - Wörndl, Wolfgang AU - Yigitbas, Enes ID - 12894 T2 - 30th ACM Conference on Hypertext and Social Media (HT ’19), September 17–20, 2019, Hof, Germany TI - ABIS 2019 – 23rd International Workshop on Personalization and Recommendation on the Web and Beyond ER - TY - JOUR AU - Hammer, Manfred AU - Ebers, Lena AU - Förstner, Jens ID - 12908 JF - Journal of the Optical Society of America B KW - tet_topic_waveguides SN - 0740-3224 TI - Oblique quasi-lossless excitation of a thin silicon slab waveguide: a guided-wave variant of an anti-reflection coating VL - 36 ER - TY - CONF AU - Razzaghi Kouchaksaraei, Hadi AU - Karl, Holger ID - 12912 T2 - 15th International Conference on Network and Service Management (CNSM) TI - Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services ER - TY - JOUR AU - Reineke, Bernhard AU - Sain, Basudeb AU - Zhao, Ruizhe AU - Carletti, Luca AU - Liu, Bingyi AU - Huang, Lingling AU - de Angelis, Costantino AU - Zentgraf, Thomas ID - 12917 IS - 9 JF - Nano Letters SN - 1530-6984 TI - Silicon metasurfaces for third harmonic geometric phase manipulation and multiplexed holography VL - 19 ER - TY - JOUR AU - Georgi, Philip AU - Massaro, Marcello AU - Luo, Kai Hong AU - Sain, Basudeb AU - Montaut, Nicola AU - Herrmann, Harald AU - Weiss, Thomas AU - Li, Guixin AU - Silberhorn, Christine AU - Zentgraf, Thomas ID - 12919 JF - Light: Science & Applications SN - 2047-7538 TI - Metasurface interferometry toward quantum sensors VL - 8 ER -