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 -
TY - JOUR
AU - Bräuer, Sebastian
AU - Plenter, Florian
AU - Klör, Benjamin
AU - Monhof, Markus
AU - Beverungen, Daniel
AU - Becker, Jörg
ID - 12929
JF - Business Research
SN - 2198-3402
TI - Transactions for trading used electric vehicle batteries: theoretical underpinning and information systems design principles
ER -
TY - JOUR
AU - Köthemann, Ronja
AU - Weber, Nils
AU - Lindner, Jörg K N
AU - Meier, Cedrik
ID - 12930
IS - 9
JF - Semiconductor Science and Technology
SN - 0268-1242
TI - High-precision determination of silicon nanocrystals: optical spectroscopy versus electron microscopy
VL - 34
ER -
TY - CONF
AU - Ajjour, Yamen
AU - Alshomary, Milad
AU - Wachsmuth, Henning
AU - Stein, Benno
ID - 12931
T2 - Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and 9th International Joint Conference on Natural Language Processing
TI - Modeling Frames in Argumentation
ER -
TY - CONF
AU - Götte, Thorsten
AU - Hinnenthal, Kristian
AU - Scheideler, Christian
ID - 12944
T2 - Structural Information and Communication Complexity
TI - Faster Construction of Overlay Networks
ER -
TY - CONF
AU - Bäumer, Frederik Simon
AU - Buff, Bianca
ID - 12946
SN - 9789897583773
T2 - Proceedings of the 8th International Conference on Data Science, Technology and Applications
TI - How to Boost Customer Relationship Management via Web Mining Benefiting from the Glass Customer’s Openness
ER -
TY - JOUR
AB - Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory.
AU - Hansmeier, Tim
AU - Platzner, Marco
AU - Pantho, Md Jubaer Hossain
AU - Andrews, David
ID - 12967
IS - 11
JF - Journal of Signal Processing Systems
SN - 1939-8018
TI - An Accelerator for Resolution Proof Checking based on FPGA and Hybrid Memory Cube Technology
VL - 91
ER -
TY - THES
AU - Heindorf, Stefan
ID - 15333
TI - Vandalism Detection in Crowdsourced Knowledge Bases
ER -
TY - GEN
AB - n this paper, I review the empirical literature in the intersection of banks and corporate income taxation that emerged over the last two decades. To structure the included studies, I use a stakeholder approach and outline how corporate income taxation plays into the relation of banks and their four main stakeholders: bank regulators, customers, investors and tax authorities. My contribution to the literature is threefold: First, I contribute by providing, to the best of my knowledge, a first comprehensive review on this topic. Second, I point to areas for future research. Third, I deduce policy implications from the studies under review. In sum, the studies show that taxes distort banks’ pricing decisions, the relative attractiveness of debt and equity financing, the decision to report on or off the balance sheet and banks’ investment allocations. Empirical insights on how tax rules affect banks’ decision-making are helpful for policymakers to tailor suitable and sustainable tax legislation directed at banks.
AU - Gawehn, Vanessa
ID - 15367
KW - corporate income taxes
KW - banks
KW - stakeholder approach
KW - decision-making process
TI - Banks and Corporate Income Taxation: A Review
ER -
TY - CONF
AB - Service Level Agreements are essential tools enabling clients and telco operators to specify required quality of service. The 5GTANGO NFV platform enables SLAs through policies and custom service lifecycle management components. This allows the operator to trigger certain lifecycle management events for a service, and the network service developer to define how to execute such events (e.g., how to scale). In this demo we will demonstrate this unique 5GTANGO concept using an elastic proxy service supported by a high availability SLA enforced through a range of traffic regimes.
AU - Soenen, Thomas
AU - Vicens, Felipe
AU - Bonnet, José
AU - Parada, Carlos
AU - Kapassa, Evgenia
AU - Touloupou, Marious
AU - Fotopulou, Eleni
AU - Zafeiropoulos, Anastasios
AU - Pol, Ana
AU - Kolometsos, Stavros
AU - Xilouris, George
AU - Alemany, Pol
AU - Vilalta, Ricard
AU - Trakadas, Panos
AU - Karkazis, Panos
AU - Peuster, Manuel
AU - Tavernier, Wouter
ID - 15368
KW - 5G mobile communication
KW - contracts
KW - quality of service
KW - telecommunication traffic
KW - virtualisation
KW - custom service lifecycle management components
KW - lifecycle management events
KW - network service developer
KW - elastic proxy service
KW - SLA-controlled proxy service
KW - customisable MANO
KW - operator policies
KW - Service Level Agreements
KW - unique 5G TANGO concept
KW - 5G TANGO NFV platform
KW - quality of service
KW - traffic regimes
KW - high availability SLA
KW - Monitoring
KW - Probes
KW - Portals
KW - Quality of service
KW - Tools
KW - Servers
KW - Graphical user interfaces
SN - 1573-0077
T2 - 2019 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)
TI - SLA-controlled Proxy Service Through Customisable MANO Supporting Operator Policies
ER -
TY - CONF
AU - Müller, Marcel
AU - Behnke, Daniel
AU - Bök, Patrick-Benjamin
AU - Peuster, Manuel
AU - Schneider, Stefan Balthasar
AU - Karl, Holger
ID - 15369
T2 - IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)
TI - 5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing
ER -
TY - CONF
AB - More and more management and orchestration approaches for (software) networks are based on machine learning paradigms and solutions. These approaches depend not only on their program code to operate properly, but also require enough input data to train their internal models. However, such training data is barely available for the software networking domain and most presented solutions rely on their own, sometimes not even published, data sets. This makes it hard, or even infeasible, to reproduce and compare many of the existing solutions. As a result, it ultimately slows down the adoption of machine learning approaches in softwarised networks. To this end, we introduce the "softwarised network data zoo" (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain. We present a general methodology to collect, archive, and publish those data sets for use by other researches and, as an example, eight initial data sets, focusing on the performance of virtualised network functions.
AU - Peuster, Manuel
AU - Schneider, Stefan Balthasar
AU - Karl, Holger
ID - 15371
T2 - IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)
TI - The Softwarised Network Data Zoo
ER -
TY - CONF
AU - Nuriddinov, Askhat
AU - Tavernier, Wouter
AU - Colle, Didier
AU - Pickavet, Mario
AU - Peuster, Manuel
AU - Schneider, Stefan Balthasar
ID - 15372
T2 - IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)
TI - Reproducible Functional Tests for Multi-scale Network Services
ER -
TY - CONF
AB - Offloading packet processing tasks to programmable switches and/or to programmable network interfaces, so called “SmartNICs”, is one of the key concepts to prepare softwarized networks for the high traffic demands of the future. However, implementing network functions that make use of those offload- ing technologies is still challenging and usually requires the availability of specialized hardware. It becomes even harder if heterogeneous services, making use of different offloading and network virtualization technologies, should be developed.
In this paper, we introduce FOP4 (Function Offloading Pro- totyping with P4), a novel prototyping platform that allows to prototype heterogeneous software network scenarios, including container-based, P4-switch-based, and SmartNIC-based network functions. The presented work substantially extends our existing Containernet platform with the means to prototype offloading scenarios. Besides presenting the platform’s system design, we evaluate its scalability and show that it can run scenarios with more than 64 P4 switch or SmartNIC nodes on a single laptop. Finally, we presented a case study in which we use the presented platform to prototype an extended in-band network telemetry use case.
AU - Moro, Daniele
AU - Peuster, Manuel
AU - Karl, Holger
AU - Capone, Antonio
ID - 15373
T2 - IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)
TI - FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios
ER -
TY - CONF
AB - Emulation platforms supporting Virtual Network Functions (VNFs) allow developers to rapidly prototype network services. None of the available platforms, however, supports experimenting with programmable data planes to enable VNF offloading. In this demonstration, we show FOP4, a flexible platform that provides support for Docker-based VNFs, and VNF offloading, by means of P4-enabled switches. The platform provides interfaces to program the P4 devices and to deploy network functions. We demonstrate FOP4 with two complex example scenarios, demonstrating how developers can exploit data plane programmability to implement network functions.
AU - Moro, Daniele
AU - Peuster, Manuel
AU - Karl, Holger
AU - Capone, Antonio
ID - 15374
T2 - IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)
TI - Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios
ER -
TY - CONF
AU - Müller, Marcel
AU - Behnke, Daniel
AU - Bök, Patrick-Benjamin
AU - Schneider, Stefan Balthasar
AU - Peuster, Manuel
AU - Karl, Holger
ID - 15375
T2 - IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)
TI - Putting NFV into Reality: Physical Smart Manufacturing Testbed
ER -
TY - CONF
AU - Behnke, Daniel
AU - Müller, Marcel
AU - Bök, Patrick-Benjamin
AU - Schneider, Stefan Balthasar
AU - Peuster, Manuel
AU - Karl, Holger
ID - 15376
T2 - IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)
TI - NFV-driven intrusion detection for smart manufacturing
ER -
TY - CONF
AU - Berendes, Carsten Ingo
ID - 15391
SN - 1865-1348
T2 - Business Information Systems Workshops
TI - Towards Analyzing High Street Customer Trajectories - A Data-Driven Case Study
ER -
TY - JOUR
AU - Jochen Baumeister
ID - 15416
JF - Quick And Easy Journal Title
TI - New Quick And Easy Publication - Will be edited by LibreCat team
ER -
TY - JOUR
AU - An, YW
AU - Lobacz, AD
AU - Baumeister, Jochen
AU - Rose, WC
AU - Higginson, JS
AU - Rosen, J
AU - Swanik, CB
ID - 15420
JF - J Athl Train
SN - 1062-6050
TI - Negative Emotion and Joint-Stiffness Regulation Strategies After Anterior Cruciate Ligament Injury.
ER -
TY - JOUR
AU - Vogt, Sarah
AU - Skjæret-Maroni, N
AU - Neuhaus, D
AU - Baumeister, Jochen
ID - 15421
JF - Int J Med Inform
SN - 1386-5056
TI - Virtual reality interventions for balance prevention and rehabilitation after musculoskeletal lower limb impairments in young up to middle-aged adults: A comprehensive review on used technology, balance outcome measures and observed effects.
VL - 126
ER -
TY - CONF
AU - Ho, Nam
AU - Kaufmann, Paul
AU - Platzner, Marco
ID - 15422
T2 - World Congress on Nature and Biologically Inspired Computing (NaBIC)
TI - Optimization of Application-specific L1 Cache Translation Functions of the LEON3 Processor
ER -
TY - GEN
AU - Lehmann, Tim
AU - Büchel, Daniel
AU - Cockcroft, John
AU - Louw, Quinette
AU - Baumeister, Jochen
ID - 15423
TI - Phase Coupling of Bilateral Motor Areas Decreases from Bipedal to Single Leg Stance
ER -
TY - JOUR
AU - Gokeler, Alli
AU - Neuhaus, D
AU - Benjaminse, A
AU - Grooms, DR
AU - Baumeister, Jochen
ID - 15425
IS - 6
JF - Sports Med
SN - 0112-1642
TI - Principles of Motor Learning to Support Neuroplasticity After ACL Injury: Implications for Optimizing Performance and Reducing Risk of Second ACL Injury.
VL - 49
ER -
TY - JOUR
AU - An, YW
AU - DiTrani Lobacz, A
AU - Lehmann, T
AU - Baumeister, Jochen
AU - Rose, WC
AU - Higginson, JS
AU - Rosen, J
AU - Swanik, CB
ID - 15426
IS - 2
JF - Scand J Med Sci Sports
SN - 0905-7188
TI - Neuroplastic changes in anterior cruciate ligament reconstruction patients from neuromechanical decoupling.
VL - 29
ER -
TY - JOUR
AU - Dingenen, B
AU - Truijen, J
AU - Bellemans, J
AU - Gokeler, A
ID - 15429
IS - 5
JF - Knee
SN - 0968-0160
TI - Test-retest reliability and discriminative ability of forward, medial and rotational single-leg hop tests.
VL - 26
ER -
TY - THES
AU - Yigitbas, Enes
ID - 15430
TI - Model-Driven Engineering of Self-Adaptive User Interfaces
ER -
TY - CONF
AB - Die Achse als einzige Verbindung zwischen Fahrzeugaufbau und Rad hat die Hauptaufgabe das Rad auf der Straße zuführen. Kinematisch betrachtet übernimmt die Radaufhängung, als Teil der Achse, die Funktion, zwischen Rad und Fahrzeugaufbaueinen vertikalen Freiheitsgrad zur Aufnahme von Fahrbahnunebenheiten zu realisieren. Die aus der RadhubundElastokinematik resultierenden Radstellungsänderungen bestimmen dabei maßgeblich die Fahrdynamik. Zur objektivenBeurteilung von Radaufhängungen ist eine genaue Charakterisierung der Radhub- und Elastokinematik erforderlich.Daher wurde zur Identifikation der kinematischen, elastokinematischen und dynamischen Radaufhängungseigenschaftenam Lehrstuhl für Dynamik und Mechatronik der Universität Paderborn ein Halbachsprüfstand entwickelt. Bei der Auslegungwurde Wert auf ein möglichst breites Einsatzspektrum gelegt. Es können verschiedene Typen von Einzelradaufhängungenin Serien- oder Prototypenkonfiguration am Prüfstand analysiert werden. Er ermöglicht eine Identifikation derdynamischen Radstellungsänderungen unter verschiedenen fahrdynamischen Lastfällen und regellosen Anregungen.
AU - Schütte, Jan
AU - Sextro, Walter
AU - Kohl, Sergej
ID - 15475
T2 - Fachtagung Mechatronik 2019
TI - Halbachsprüfstand zur kinematischen, elastokinematischen und dynamischen Charakterisierung von Radaufhängungen
ER -
TY - CONF
AB - Stratix 10 FPGA cards have a good potential for the acceleration of HPC workloads since the Stratix 10 product line introduces devices with a large number of DSP and memory blocks. The high level synthesis of OpenCL codes can play a fundamental role for FPGAs in HPC, because it allows to implement different designs with lower development effort compared to hand optimized HDL. However, Stratix 10 cards are still hard to fully exploit using the Intel FPGA SDK for OpenCL. The implementation of designs with thousands of concurrent arithmetic operations often suffers from place and route problems that limit the maximum frequency or entirely prevent a successful synthesis. In order to overcome these issues for the implementation of the matrix multiplication, we formulate Cannon's matrix multiplication algorithm with regard to its efficient synthesis within the FPGA logic. We obtain a two-level block algorithm, where the lower level sub-matrices are multiplied using our Cannon's algorithm implementation. Following this design approach with multiple compute units, we are able to get maximum frequencies close to and above 300 MHz with high utilization of DSP and memory blocks. This allows for performance results above 1 TeraFLOPS.
AU - Gorlani, Paolo
AU - Kenter, Tobias
AU - Plessl, Christian
ID - 15478
T2 - Proceedings of the International Conference on Field-Programmable Technology (FPT)
TI - OpenCL Implementation of Cannon's Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs
ER -
TY - CONF
AB - The continuous refinement of sensor technologies enables the manufacturing industry to capture increasing amounts of data during the production process. As processes take time to complete, sensors register large amounts of time-series-like data for each product. In order to make this data usable, a feature extraction is mandatory. In this work, we discuss and evaluate different network architectures, input pre-processing and cost functions regarding, among other aspects, their suitability for time series of different lengths.
AU - Thiel, Christian
AU - Steidl, Carolin
AU - Henning, Bernd
ID - 15488
KW - Dynamic Time Warping
KW - Feature Extraction
KW - Masking
KW - Neural Networks
SN - 978-3-9819376-0-2
T2 - 20. GMA/ITG-Fachtagung. Sensoren und Messsysteme 2019
TI - P2.9 Comparison of deep feature extraction techniques for varying-length time series from an industrial piercing press
ER -
TY - JOUR
AB - ZusammenfassungTraining mit ergänzendem verzögertem Feedback zeigt sich zum Erlernen einer postoperativen Teilbelastung beim Gehen an Unterarmgehstützen effektiv. Insbesondere die Verwendung von Bandbreitenfeedback hat sich bei anderen Bewegungsaufgaben im Hinblick auf die Ausführungspräzision, -konstanz und -automatizität als vorteilhaft erwiesen. In einer Studie mit 31 jungen gesunden Erwachsenen untersuchten wir diese Parameter im Rahmen eines Feedbacktrainings während einer Teilbelastungsaufgabe und verglichen dabei eine Bandbreitenmethode mit einem 100 %-Feedback und einer Kontrollbedingung.Die in anderen Studien aufgezeigten Vorteile des Bandbreitenfeedbacks konnten in diesem Kontext für keinen der 3 Zielparameter gezeigt werden. Darüber hinaus ergeben sich aus den Daten 2 wichtige Hinweise für die rehabilitative Praxis: Zum einen konnten mit nur wenigen feedbackgestützten Übungsversuchen deutliche und zudem relativ behaltensstabile Reduktionen der Teilbelastung erreicht werden, zum anderen zeigte sich, dass das Teilbelastungsgehen einen hohen kognitiven Aufwand erfordert, der sich auch nach 2 umfangreichen Übungssitzungen nicht verringert und dazu führt, dass die Einhaltung der Teilbelastung bei Aufmerksamkeitsablenkung im Alltag beeinträchtigt sein könnte.
AU - Krause, Daniel
AU - Paschen, Linda
AU - Vogt, Sarah
ID - 15492
JF - B&G Bewegungstherapie und Gesundheitssport
SN - 1613-0863
TI - Zur Gestaltung von Feedbackprozeduren zum Erlernen der postoperativen Teilbelastung beim Gehen mit Unterarmgehstützen im Kontext der Bewegungsautomatisierung
ER -
TY - CONF
AU - Purrmann, Maren
AU - Wünderlich, Nancy
ID - 15532
T2 - Proceedings of the 2019 Frontiers in Service Conference
TI - Value Co-Creation Patterns in Multi-Actor Service Interactions: A Framework for Collaborative Consumption Platforms
ER -
TY - CONF
AU - Izu, Cruz
AU - Schulte, Carsten
AU - Aggarwal, Ashish
AU - I. Cutts, Quintin
AU - Duran, Rodrigo
AU - Gutica, Mirela
AU - Heinemann, Birte
AU - Kraemer, Eileen
AU - Lonati, Violetta
AU - Mirolo, Claudio
AU - Weeda, Renske
ID - 15578
T2 - Proceedings of the 2019 (ACM) Conference on Innovation and Technology in Computer Science Education, Aberdeen, Scotland, UK, July 15-17, 2019
TI - Program Comprehension: Identifying Learning Trajectories for Novice Programmers
ER -
TY - CONF
AU - Kapp, Florian
AU - Schulte, Carsten
ID - 15579
T2 - Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund
TI - Einsatz von Jupyter Notebooks am Beispiel eines fiktiven Kriminalfalls
ER -
TY - CONF
AU - Müller, Kathrin
AU - Schulte, Carsten
AU - Magenheim, Johannes
ID - 15581
T2 - Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund
TI - Zur Relevanz eines Prozessbereiches Interaktion und Exploration im Kontext informatischer Bildung im Primarbereich
ER -
TY - CONF
AU - Schmidt, Ann-Katrin
AU - Schulte, Carsten
ID - 15583
T2 - Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund
TI - Das RetiBNE Café
ER -
TY - CONF
AU - Augustine, John
AU - Hinnenthal, Kristian
AU - Kuhn, Fabian
AU - Scheideler, Christian
AU - Schneider, Philipp
ID - 15627
SN - 9781611975994
T2 - Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
TI - Shortest Paths in a Hybrid Network Model
ER -
TY - CONF
AU - Wilke, Adrian
AU - Magenheim, Johannes
ID - 15720
T2 - IEEE Global Engineering Education Conference, EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019
TI - Critical Incidents for Technology Enhanced Learning in Vocational Education and Training
ER -
TY - BOOK
AU - Köller, Olaf
AU - Magenheim, Johannes
AU - Molitor, Heike
AU - Pfenning, Uwe
AU - Ramseger, J{\
AU - Steffensky, Mirjam
AU - Wiesmüller, Christian
AU - Winther, Esther
AU - Wollring, Bernd
ID - 15721
TI - Zieldimensionen für Multiplikatorinnen und Multiplikatoren früher MINT-Bildung
ER -
TY - JOUR
AU - Ojha, Deepak
AU - Kaliannan, Naveen Kumar
AU - Kühne, Thomas D.
ID - 15724
IS - 1
JF - Communications Chemistry
SN - 2399-3669
TI - Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface
VL - 2
ER -
TY - JOUR
AU - Ohto, Tatsuhiko
AU - Dodia, Mayank
AU - Xu, Jianhang
AU - Imoto, Sho
AU - Tang, Fujie
AU - Zysk, Frederik
AU - Kühne, Thomas D.
AU - Shigeta, Yasuteru
AU - Bonn, Mischa
AU - Wu, Xifan
AU - Nagata, Yuki
ID - 15738
JF - The Journal of Physical Chemistry Letters
SN - 1948-7185
TI - Accessing the Accuracy of Density Functional Theory through Structure and Dynamics of the Water–Air Interface
VL - 10
ER -
TY - JOUR
AU - Azadi, Sam
AU - Kühne, Thomas D.
ID - 15739
JF - Physical Review B
SN - 2469-9950
TI - Unconventional phase III of high-pressure solid hydrogen
VL - 100
ER -
TY - JOUR
AU - Guc, Maxim
AU - Kodalle, Tim
AU - Kormath Madam Raghupathy, Ramya
AU - Mirhosseini, Hossein
AU - Kühne, Thomas D.
AU - Becerril-Romero, Ignacio
AU - Pérez-Rodríguez, Alejandro
AU - Kaufmann, Christian A.
AU - Izquierdo-Roca, Victor
ID - 15740
JF - The Journal of Physical Chemistry C
SN - 1932-7447
TI - Vibrational Properties of RbInSe2: Raman Scattering Spectroscopy and First-Principle Calculations
VL - 124
ER -
TY - JOUR
AB -
In many cyber–physical systems, we encounter the problem of remote state estimation of geo- graphically distributed and remote physical processes. This paper studies the scheduling of sensor transmissions to estimate the states of multiple remote, dynamic processes. Information from the different sensors has to be transmitted to a central gateway over a wireless network for monitoring purposes, where typically fewer wireless channels are available than there are processes to be monitored. For effective estimation at the gateway, the sensors need to be scheduled appropriately, i.e., at each time instant one needs to decide which sensors have network access and which ones do not. To address this scheduling problem, we formulate an associated Markov decision process (MDP). This MDP is then solved using a Deep Q-Network, a recent deep reinforcement learning algorithm that is at once scalable and model-free. We compare our scheduling algorithm to popular scheduling algorithms such as round-robin and reduced-waiting-time, among others. Our algorithm is shown to significantly outperform these algorithms for many example scenario
AU - Leong, Alex S.
AU - Ramaswamy, Arunselvan
AU - Quevedo, Daniel E.
AU - Karl, Holger
AU - Shi, Ling
ID - 15741
JF - Automatica
SN - 0005-1098
TI - Deep reinforcement learning for wireless sensor scheduling in cyber–physical systems
ER -
TY - GEN
AU - Otte, Oliver
ID - 15746
TI - Outsourced Decryption of Attribute-based Ciphertexts
ER -
TY - GEN
AU - Wördenweber, Nico Christof
ID - 15747
TI - On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model
ER -
TY - CONF
AB - Connectionist temporal classification (CTC) is a sequence-level loss that has been successfully applied to train recurrent neural network (RNN) models for automatic speech recognition. However, one major weakness of CTC is the conditional independence assumption that makes it difficult for the model to learn label dependencies. In this paper, we propose stimulated CTC, which uses stimulated learning to help CTC models learn label dependencies implicitly by using an auxiliary RNN to generate the appropriate stimuli. This stimuli comes in the form of an additional stimulation loss term which encourages the model to learn said label dependencies. The auxiliary network is only used during training and the inference model has the same structure as a standard CTC model. The proposed stimulated CTC model achieves about 35% relative character error rate improvements on a synthetic gesture keyboard recognition task and over 30% relative word error rate improvements on the Librispeech automatic speech recognition tasks over a baseline model trained with CTC only.
AU - Heymann, Jahn
AU - Khe Chai Sim, Bo Li
ID - 15812
T2 - ICASSP 2019, Brighton, UK
TI - Improving CTC Using Stimulated Learning for Sequence Modeling
ER -
TY - CONF
AB - Despite the strong modeling power of neural network acoustic models, speech enhancement has been shown to deliver additional word error rate improvements if multi-channel data is available. However, there has been a longstanding debate whether enhancement should also be carried out on the ASR training data. In an extensive experimental evaluation on the acoustically very challenging CHiME-5 dinner party data we show that: (i) cleaning up the training data can lead to substantial error rate reductions, and (ii) enhancement in training is advisable as long as enhancement in test is at least as strong as in training. This approach stands in contrast and delivers larger gains than the common strategy reported in the literature to augment the training database with additional artificially degraded speech. Together with an acoustic model topology consisting of initial CNN layers followed by factorized TDNN layers we achieve with 41.6% and 43.2% WER on the DEV and EVAL test sets, respectively, a new single-system state-of-the-art result on the CHiME-5 data. This is a 8% relative improvement compared to the best word error rate published so far for a speech recognizer without system combination.
AU - Zorila, Catalin
AU - Boeddeker, Christoph
AU - Doddipatla, Rama
AU - Haeb-Umbach, Reinhold
ID - 15816
T2 - ASRU 2019, Sentosa, Singapore
TI - An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription
ER -
TY - GEN
AU - Leutnant, Matthias
ID - 15819
TI - Experimentelle Untersuchung des SEM-Algorithmus
ER -
TY - CONF
AB - In the field of software analysis a trade-off between scalability and accuracy always exists. In this respect, Android app analysis is no exception, in particular, analyzing large or many apps can be challenging. Dealing with many small apps is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH. These particular benchmarks are not only used for the evaluation of novel tools but also in continuous integration pipelines of existing mature tools to maintain and guarantee a certain quality-level. Considering this latter usage it becomes very important to be able to achieve benchmark results as fast as possible. Hence, benchmarks have to be optimized for this purpose. One approach to do so is app merging. We implemented the Android Merge Tool (AMT) following this approach and show that its novel aspects can be used to produce scaled up and accurate benchmarks. For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy trade-off anymore. We show this throughout detailed experiments on DROIDBENCH employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark execution times are largely reduced without losing benchmark accuracy. Moreover, we argue why AMT is an advantageous successor of the state-of-the-art app merging tool (APKCOMBINER) in analysis lift-up scenarios.
AU - Pauck, Felix
AU - Zhang, Shikun
ID - 15838
KW - Program Analysis
KW - Android App Analysis
KW - Taint Analysis
KW - App Merging
KW - Benchmark
SN - 9781728141367
T2 - 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)
TI - Android App Merging for Benchmark Speed-Up and Analysis Lift-Up
ER -
TY - JOUR
AU - Camberg, Alan Adam
AU - Tröster, Thomas
AU - Bohner, F.
AU - Tölle, J.
ID - 15875
JF - IOP Conference Series: Materials Science and Engineering
SN - 1757-899X
TI - Predicting plasticity and fracture of severe pre-strained EN AW-5182 by Yld2000 yield locus and Hosford-Coulomb fracture model in sheet forming applications
VL - 651
ER -
TY - GEN
AU - Kumar Jeyakumar, Shankar
ID - 15883
TI - Incremental learning with Support Vector Machine on embedded platforms
ER -
TY - CONF
AU - Müller, Jens
AU - Brinkmann, Marcus
AU - Poddebniak, Damian
AU - Böck, Hanno
AU - Schinzel, Sebastian
AU - Somorovsky, Juraj
AU - Schwenk, Jörg
ID - 15908
SN - 978-1-939133-06-9
T2 - 28th {USENIX} Security Symposium ({USENIX} Security 19)
TI - "Johnny, you are fired!" -- Spoofing OpenPGP and S/MIME Signatures in Emails
ER -
TY - CONF
AU - Merget, Robert
AU - Somorovsky, Juraj
AU - Aviram, Nimrod
AU - Young, Craig
AU - Fliegenschmidt, Janis
AU - Schwenk, Jörg
AU - Shavitt, Yuval
ID - 15909
SN - 978-1-939133-06-9
T2 - 28th {USENIX} Security Symposium ({USENIX} Security 19)
TI - Scalable Scanning and Automatic Classification of TLS Padding Oracle Vulnerabilities
ER -
TY - CONF
AU - Engelbertz, Nils
AU - Mladenov, Vladislav
AU - Somorovsky, Juraj
AU - Herring, David
AU - Erinola, Nurullah
AU - Schwenk, Jörg
ED - Roßnagel, Heiko
ED - Wagner, Sven
ED - Hühnlein, Detlef
ID - 15910
T2 - Open Identity Summit 2019
TI - Security Analysis of XAdES Validation in the CEF Digital Signature Services (DSS)
ER -
TY - GEN
AB - Secure hardware design is the most important aspect to be considered in addition to functional correctness. Achieving hardware security in today’s globalized Integrated Cir- cuit(IC) supply chain is a challenging task. One solution that is widely considered to help achieve secure hardware designs is Information Flow Tracking(IFT). It provides an ap- proach to verify that the systems adhere to security properties either by static verification during design phase or dynamic checking during runtime.
Proof-Carrying Hardware(PCH) is an approach to verify a functional design prior to using it in hardware. It is a two-party verification approach, where the target party, the consumer requests new functionalities with pre-defined properties to the producer. In response, the producer designs the IP (Intellectual Property) cores with the requested functionalities that adhere to the consumer-defined properties. The producer provides the IP cores and a proof certificate combined into a proof-carrying bitstream to the consumer to verify it. If the verification is successful, the consumer can use the IP cores in his hardware. In essence, the consumer can only run verified IP cores. Correctly applied, PCH techniques can help consumers to defend against many unintentional modifications and malicious alterations of the modules they receive. There are numerous published examples of how to use PCH to detect any change in the functionality of a circuit, i.e., pairing a PCH approach with functional equivalence checking for combinational or sequential circuits. For non-functional properties, since opening new covert channels to leak secret information from secure circuits is a viable attack vector for hardware trojans, i.e., intentionally added malicious circuitry, IFT technique is employed to make sure that secret/untrusted information never reaches any unclassified/trusted outputs.
This master thesis aims to explore the possibility of adapting Information Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream level enabling consumers to validate the trustworthiness of a module’s information flow without the computational costs of a complete flow analysis.
AU - Keerthipati, Monica
ID - 15920
TI - A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking
ER -
TY - CONF
AB - Ranking plays a central role in a large number of applications driven by RDF knowledge graphs. Over the last years, many popular RDF knowledge graphs have grown so large that rankings for the facts they contain cannot be computed directly using the currently common 64-bit platforms. In this paper, we tackle two problems:
Computing ranks on such large knowledge bases efficiently and incrementally. First, we present D-HARE, a distributed approach for computing ranks on very large knowledge graphs. D-HARE assumes the random surfer model and relies on data partitioning to compute matrix multiplications and transpositions on disk for matrices of arbitrary size. Moreover, the data partitioning underlying D-HARE allows the execution of most of its steps in parallel.
As very large knowledge graphs are often updated periodically, we tackle the incremental computation of ranks on large knowledge bases as a second problem. We address this problem by presenting
I-HARE, an approximation technique for calculating the overall ranking scores of a knowledge without the need to recalculate the ranking from scratch at each new revision. We evaluate our approaches by calculating ranks on the 3 × 10^9 and 2.4 × 10^9 triples from Wikidata resp. LinkedGeoData. Our evaluation demonstrates
that D-HARE is the first holistic approach for computing ranks on very large RDF knowledge graphs. In addition, our incremental approach achieves a root mean squared error of less than 10E−7 in the best case. Both D-HARE
and I-HARE are open-source and are available at: https://github.com/dice-group/incrementalHARE.
AU - Desouki, Abdelmoneim Amer
AU - Röder, Michael
AU - Ngonga Ngomo, Axel-Cyrille
ID - 15921
KW - Knowledge Graphs
KW - Ranking
KW - RDF
SN - 9781450368858
T2 - Proceedings of the 30th ACM Conference on Hypertext and Social Media - HT '19
TI - Ranking on Very Large Knowledge Graphs
ER -
TY - CONF
AU - Heindorf, Stefan
AU - Scholten, Yan
AU - Engels, Gregor
AU - Potthast, Martin
ID - 14568
T2 - INFORMATIK
TI - Debiasing Vandalism Detection Models at Wikidata (Extended Abstract)
ER -
TY - JOUR
AU - Sommer, Christoph
AU - Basagni, Stefano
ID - 14817
JF - Ad Hoc Networks
SN - 1570-8705
TI - Advances and novel applications of mobile wireless networking
ER -
TY - CONF
AU - Heinovski, Julian
AU - Stratmann, Lukas
AU - Buse, Dominik S.
AU - Klingler, Florian
AU - Franke, Mario
AU - Oczko, Marie-Christin H.
AU - Sommer, Christoph
AU - Scharlau, Ingrid
AU - Dressler, Falko
ID - 14819
SN - 9781728102702
T2 - 2019 IEEE 20th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)
TI - Modeling Cycling Behavior to Improve Bicyclists' Safety at Intersections - A Networking Perspective
ER -
TY - JOUR
AU - Seipelt, Agnes Regina
ID - 14821
JF - Weberiana
KW - Weber
KW - Wien
KW - Zensur
SN - 978-3-96233-182-5
TI - Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien
VL - 29
ER -