@misc{49767, author = {{Huybrechts, Yves}}, publisher = {{BelgienNet}}, title = {{{"Die Bombardierung von Brüssel - teil 1" (PODCAST)}}}, year = {{2020}}, } @misc{49756, author = {{Huybrechts, Yves}}, publisher = {{BelgienNet}}, title = {{{"Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen." (VIDEO)}}}, year = {{2020}}, } @misc{49750, author = {{Huybrechts, Yves}}, publisher = {{BelgienNet}}, title = {{{Interview zur Ausstellung "Rubens und der Barock im Norden" - 2 Teile (VIDEO)}}}, year = {{2020}}, } @inbook{49869, author = {{Neiske, Iris and Bücker, Diana}}, booktitle = {{Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37}}, issn = {{1424-3636}}, pages = {{299--312}}, title = {{{Medienpädagogik und Hochschuldidaktik}}}, year = {{2020}}, } @article{32154, author = {{Karsten, Andrea and Weisberg, Jan}}, journal = {{JoSch - Journal der Schreibwissenschaft}}, pages = {{34 -- 42}}, publisher = {{wbv}}, title = {{{Profession und Disziplin. Ein Schreibgespräch über den Weg durch die Fächer, Schreibdidaktik als Feldforschung (und - nebenbei - die Rettung der Schriftkultur). }}}, doi = {{10.3278/JOS2002W}}, volume = {{2}}, year = {{2020}}, } @article{50279, author = {{Daniel-Söltenfuß, Desiree}}, journal = {{bwp@}}, title = {{{Aushandlungsprozesse über Freiheiten und Grenzen im selbstregulierten Lernen. Erwartungen und Handlungsmuster bei Schüler*innen und Lehrpersonen im Übergangssystem}}}, volume = {{38}}, year = {{2020}}, } @article{25806, author = {{Lübbecke, Silvia and Schnedler, Wendelin}}, issn = {{1058-6407}}, journal = {{Journal of Economics & Management Strategy}}, pages = {{420--438}}, title = {{{Don't patronize me! An experiment on preferences for authorship}}}, doi = {{10.1111/jems.12347}}, year = {{2020}}, } @inbook{50697, author = {{Albus, Vanessa}}, booktitle = {{Handbuch Lehrerinnen- und Lehrerbildung}}, editor = {{Cramer, Coli and König, Johannes and Rothland, Martin and Blömeke, Sigrid}}, pages = {{495--500}}, title = {{{Philosophie und Ethik in der Lehrerinnen und Lehrerbildung}}}, year = {{2020}}, } @article{50865, author = {{Blank, Andreas}}, journal = {{Journal of Modern Philosophy}}, number = {{10}}, pages = {{1--18}}, title = {{{“D’Holbach on (Dis-)Esteeming Talent.” }}}, volume = {{2}}, year = {{2020}}, } @article{50926, author = {{Blank, Andreas}}, journal = {{Tópicos. Revista de filosofía de la Universidad de Santa Fe }}, number = {{1}}, pages = {{149--176}}, title = {{{“Leibniz: sobre las presunciones y la simplicidad cognitiva” }}}, volume = {{39}}, year = {{2020}}, } @article{50866, author = {{Blank, Andreas}}, journal = {{European Journal of Philosophy}}, number = {{4}}, pages = {{337--349}}, title = {{{“Helvétius’s Challenge: Moral Luck, Political Constitutions and the Economy of Esteem.” }}}, volume = {{28}}, year = {{2020}}, } @article{51316, abstract = {{AbstractRight-wing populism has strongly polarizing effects in politics, education and science—a problem which this article aims to adress. Instead of claiming a demarcation between science and education on the one hand and right-wing populist ideology on the other, we initially focus on continuities. At the same time, we are concerned with finding a critical distance towards right-wing populism. Using the theoretical framework of boundary-work we therefore analyse a case of right-wing populist educational and scientific efforts. Boundary-work can occur in an institutional, content-related and epistemic dimension. While we identify strong continuities in the institutional and content-related dimensions, we see the main difference in the epistemic dimension. In conclusion, we use the results of our analysis to develop a critical position as scientists and educationists towards right-wing populism, drawing consequences for the epistemic, content-related and institutional dimensions.}}, author = {{Haker, Christoph and Otterspeer, Lukas}}, issn = {{2364-0014}}, journal = {{Zeitschrift für Weiterbildungsforschung}}, keywords = {{General Earth and Planetary Sciences, General Environmental Science}}, number = {{3}}, pages = {{357--376}}, title = {{{Neither demarcation nor confrontation. Finding a critical position towards right-wing populism}}}, doi = {{10.1007/s40955-020-00174-z}}, volume = {{43}}, year = {{2020}}, } @article{51317, author = {{Haker, Christoph and Otterspeer, Lukas}}, issn = {{2195-867X}}, journal = {{Zeitschrift für Diskursforschung}}, number = {{2}}, pages = {{250--271}}, publisher = {{Beltz Juventa}}, title = {{{Right-Wing Populism and Educational Research. Exploring theoretical and methodological perspectives}}}, doi = {{10.3262/ZFD2002250}}, year = {{2020}}, } @article{51319, abstract = {{Frank Beier, Franziska Wyßuwa und Elisa Wagner diskutieren in ihrem aktuellen Beitrag Fallinterpretationen zwischen Theorieund Anwendungsbezug den praktischen Nutzen wissenschaftlicher Erkenntnisse, insbesondere von Theorie, für die Schule und Erwachsenenbildung. Wir greifen ihre Position in einer dialogischen Replik kritisch auf. Die Form des Dialogs bietet uns die Möglichkeit, unsere Perspektiven als Erziehungswissenschaftler, Lehrer und Soziologe in die Debatte einzubringen. Wir möchten so die eingespielten Grenzziehungen in ‚Theorie- Praxis-Debatten‘ irritieren und Beiers, Wyßuwas und Wagners Plädoyer für die Stärke wissenschaftlicher Theorie ergänzen. Diese Stärke kommt weniger zur Geltung, wenn Theorie Kontingenz schließende und mehr, wenn sie Kontingenz öffnende Effekte hat. Zudem sollte Theorie nicht auf Modelle oder auf Theorien begrenzter Reichweite beschränkt und die konkrete Verwendung von Theorie zum Gegenstand der (Selbst)Reflexion und (Selbst)Kritik werden.}}, author = {{Haker, Christoph and Otterspeer, Lukas}}, issn = {{2567-5974}}, journal = {{Debatte. Beiträge zur Erwachsenenbildung}}, keywords = {{Rehabilitation, Physical Therapy, Sports Therapy and Rehabilitation, General Medicine}}, number = {{1-2020}}, pages = {{49--63}}, publisher = {{Verlag Barbara Budrich GmbH}}, title = {{{Zum praktischen Nutzen von Theorie. Ein Dialog über die Grenzen von Bildungspraxis, Erziehungswissenschaft und Soziologie}}}, doi = {{10.3224/debatte.v3i1.05}}, volume = {{3}}, year = {{2020}}, } @article{51318, author = {{Alvear, Rafael and Haker, Christoph}}, journal = {{MAD}}, number = {{42}}, pages = {{1–9}}, title = {{{Teoría de sistemas crítica y teoría crítica de sistemas sociales: Alegato por una distinción necesaria}}}, year = {{2020}}, } @book{48045, editor = {{Münzmay, Andreas and Aquavella-RauchJ, Stefanie and Veit, Joachim}}, publisher = {{Musikwissenschaftliches Seminar der Universität Paderborn und der Hochschule für Musik Detmold}}, title = {{{Brückenschläge zwischen Musikwissenschaft und Informatik. Theoretische und praktische Aspekte der Kooperation}}}, doi = {{10.25366/2020.87}}, volume = {{3}}, year = {{2020}}, } @inbook{47474, author = {{Münzmay, Andreas and Aquavella-Rauch, Stefanie and Veit, Joachim}}, booktitle = {{Brückenschläge zwischen Musikwissenschaft und Informatik. Theoretische und praktische Aspekte der Kooperation}}, editor = {{Münzmay, Andreas and Acquavella-Rauch, Stefanie and Veit, Joachim}}, pages = {{XI--XV}}, publisher = {{Musikwissenschaftliches Seminar der Universität Paderborn und der Hochschule für Musik Detmold}}, title = {{{Brückenschläge zwischen Musikwissenschaft und Informatik – Vorbemerkung}}}, doi = {{10.25366/2020.88}}, volume = {{3}}, year = {{2020}}, } @article{47476, abstract = {{Digital data on tangible and intangible cultural assets is an essential part of daily life, communication and experience. It has a lasting influence on the perception of cultural identity as well as on the interactions between research, the cultural economy and society. Throughout the last three decades, many cultural heritage institutions have contributed a wealth of digital representations of cultural assets (2D digital reproductions of paintings, sheet music, 3D digital models of sculptures, monuments, rooms, buildings), audio-visual data (music, film, stage performances), and procedural research data such as encoding and annotation formats. The long-term preservation and FAIR availability of research data from the cultural heritage domain is fundamentally important, not only for future academic success in the humanities but also for the cultural identity of individuals and society as a whole. Up to now, no coordinated effort for professional research data management on a national level exists in Germany. NFDI4Culture aims to fill this gap and create a user-centered, research-driven infrastructure that will cover a broad range of research domains from musicology, art history and architecture to performance, theatre, film, and media studies. The research landscape addressed by the consortium is characterized by strong institutional differentiation. Research units in the consortium's community of interest comprise university institutes, art colleges, academies, galleries, libraries, archives and museums. This diverse landscape is also characterized by an abundance of research objects, methodologies and a great potential for data-driven research. In a unique effort carried out by the applicant and co-applicants of this proposal and ten academic societies, this community is interconnected for the first time through a federated approach that is ideally suited to the needs of the participating researchers. To promote collaboration within the NFDI, to share knowledge and technology and to provide extensive support for its users have been the guiding principles of the consortium from the beginning and will be at the heart of all workflows and decision-making processes. Thanks to these principles, NFDI4Culture has gathered strong support ranging from individual researchers to high-level cultural heritage organizations such as the UNESCO, the International Council of Museums, the Open Knowledge Foundation and Wikimedia. On this basis, NFDI4Culture will take innovative measures that promote a cultural change towards a more reflective and sustainable handling of research data and at the same time boost qualification and professionalization in data-driven research in the domain of cultural heritage. This will create a long-lasting impact on science, cultural economy and society as a whole.}}, author = {{Altenhöner, Reinhard and Blümel, Ina and Boehm, Franziska and Bove, Jens and Bicher, Katrin and Bracht, Christian and Brand, Ortrun and Dieckmann, Lisa and Effinger, Maria and Hagener, Malte and Hammes, Andrea and Heller, Lambert and Kailus, Angela and Kohle, Hubertus and Ludwig, Jens and Münzmay, Andreas and Pittroff, Sarah and Razum, Matthias and Röwenstrunk, Daniel and Sack, Harald and Simon, Holger and Schmidt, Dörte and Schrade, Torsten and Walzel, Annika-Valeska and Wiermann, Barbara}}, issn = {{2367-7163}}, journal = {{Research Ideas and Outcomes}}, keywords = {{Research Data Management}}, publisher = {{Pensoft Publishers}}, title = {{{NFDI4Culture - Consortium for research data on material and immaterial cultural heritage}}}, doi = {{10.3897/rio.6.e57036}}, volume = {{6}}, year = {{2020}}, } @unpublished{51520, author = {{Hilgert, Joachim and Brennecken, D. and Ciardo, L.}}, title = {{{Algebraically Independent Generators for the Algebra of Invariant Differential Operators on SLn(ℝ)/SOn(ℝ)}}}, year = {{2020}}, } @techreport{51690, author = {{Maaz, Kai and Jungkamp, Burkhard and Antony, Johanna and Becker-Mrotzek, Michael and Chapman, Azalea and Diedrich, Martina and Eger, Joanna and Eickelmann, Birgit and Hanschmann, Felix and Hebborn, Klaus and Heinrich, Martin and Iscan-Pilic, Gülay and Leiss, Dominik and Mülhens-Hackbarth, Ines and Pech, Miriam and Scheinkönig, Christine and Siebert, Matthias and Teichert, Ute and Wagner, Lucia and Wassmuth, Stephan and Werner, Birgit and Wojciechowicz, Anna Aleksandra and Wrase, Michael}}, title = {{{Schule in Zeiten der Pandemie. Empfehlungen für die Gestaltung des Schuljahres 2020/21. Stellungnahme der Expert*innenkommission der Friedrich-Ebert-Stiftung}}}, year = {{2020}}, } @misc{51813, author = {{Schmitt, Martin}}, title = {{{Die Geschichte des Potsdamer Rechenzentrums: Sozialistische Computernutzung und die Digitalisierung in Ostdeutschland}}}, year = {{2020}}, } @techreport{14901, abstract = {{This study investigates whether country risk factors, including political and fiscal budget risk, attenuate the effectiveness of tax policy tools that aim to encourage corporate risk-taking. Exploiting a cross-country panel, we predict and find that the effectiveness of loss offset rules and tax rate changes is fully attenuated for firms located in high-risk countries. We document the attenuating effect of country risk is more pronounced in high-tax countries or when countries increase their corporate tax rate. Additional tests around the U.S. federal budget crises from 2011 to 2013 indicate that temporarily heightened fiscal budget risk attenuates the effectiveness of loss offset rules even in countries with low political risk. We identify conditions (low political and low fiscal budget risk) under which targeted tax policy tools effectively stimulate risk-taking. This suggests that ensuring taxpayers receive tax refunds is important in times of economic crises with budgetary or political challenges. }}, author = {{Osswald, Benjamin and Sureth-Sloane, Caren}}, title = {{{Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?}}}, doi = {{10.2139/ssrn.3297418}}, volume = {{TRR 266 Accounting for Transparency Working Paper Series No. 28}}, year = {{2020}}, } @article{23827, author = {{Dawood, Abbas O. and Al-Lami, Abbas Jarullah Sangoor and Al-Rkaby, Alaa H.J.}}, issn = {{2214-5095}}, journal = {{Case Studies in Construction Materials}}, title = {{{Behavior of tall masonry chimneys under wind loadings using CFD technique}}}, doi = {{10.1016/j.cscm.2020.e00451}}, year = {{2020}}, } @article{52711, author = {{Jenert, Tobias}}, journal = {{Zeitschrift für Hochschulentwicklung}}, number = {{4}}, pages = {{203--222}}, title = {{{Überlegungen auf dem Weg zu einer Theorie lehrbezogenen Wandels an Hochschulen}}}, volume = {{15}}, year = {{2020}}, } @phdthesis{48925, author = {{Peitz, Nina-Madeleine}}, publisher = {{Friedrich-Alexander Universität Erlangen-Nürnberg}}, title = {{{Professional Development of Vocational Teachers in Language-Sensitive Content Teaching–A Study Visit Abroad as Design-Based Research Intervention for Vocational Teachers Working in School-to-Work Transition Phases}}}, year = {{2020}}, } @inbook{24959, author = {{Bauer, Anna and Reinhold, Peter and Sacher, Marc}}, booktitle = {{Naturwissenschaftliche Bildung als Grundlage für berufliche und gesellschaftliche Teilhabe}}, editor = {{Maurer, Christian}}, pages = {{632--635}}, publisher = {{Gesellschaft für Didaktik der Chemie und Physik}}, title = {{{Erhebung der experimentellen Performanz (Physik-)Studierender}}}, year = {{2019}}, } @article{19945, abstract = {{Many PDEs (Burgers' equation, KdV, Camassa-Holm, Euler's fluid equations, …) can be formulated as infinite-dimensional Lie-Poisson systems. These are Hamiltonian systems on manifolds equipped with Poisson brackets. The Poisson structure is connected to conservation properties and other geometric features of solutions to the PDE and, therefore, of great interest for numerical integration. For the example of Burgers' equations and related PDEs we use Clebsch variables to lift the original system to a collective Hamiltonian system on a symplectic manifold whose structure is related to the original Lie-Poisson structure. On the collective Hamiltonian system a symplectic integrator can be applied. Our numerical examples show excellent conservation properties and indicate that the disadvantage of an increased phase-space dimension can be outweighed by the advantage of symplectic integration.}}, author = {{McLachlan, Robert I and Offen, Christian and Tapley, Benjamin K}}, issn = {{2158-2505}}, journal = {{Journal of Computational Dynamics}}, number = {{1}}, pages = {{111--130}}, publisher = {{American Institute of Mathematical Sciences (AIMS)}}, title = {{{Symplectic integration of PDEs using Clebsch variables}}}, doi = {{10.3934/jcd.2019005}}, volume = {{6}}, year = {{2019}}, } @inproceedings{3287, abstract = {{For optimal placement and orchestration of network services, it is crucial that their structure and semantics are specified clearly and comprehensively and are available to an orchestrator. Existing specification approaches are either ambiguous or miss important aspects regarding the behavior of virtual network functions (VNFs) forming a service. We propose to formally and unambiguously specify the behavior of these functions and services using Queuing Petri Nets (QPNs). QPNs are an established method that allows to express queuing, synchronization, stochastically distributed processing delays, and changing traffic volume and characteristics at each VNF. With QPNs, multiple VNFs can be connected to complete network services in any structure, even specifying bidirectional network services containing loops. We discuss how management and orchestration systems can benefit from our clear and comprehensive specification approach, leading to better placement of VNFs and improved Quality of Service. Another benefit of formally specifying network services with QPNs are diverse analysis options, which allow valuable insights such as the distribution of end-to-end delay. We propose a tool-based workflow that supports the specification of network services and the automatic generation of corresponding simulation code to enable an in-depth analysis of their behavior and performance.}}, author = {{Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}}, booktitle = {{2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}}, location = {{Washington, DC, USA}}, pages = {{116----124}}, publisher = {{IFIP}}, title = {{{Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}}}, year = {{2019}}, } @inproceedings{21177, abstract = {{Attention mechanisms have seen some success for natural language processing downstream tasks in recent years and generated new state-of-the-art results. A thorough evaluation of the attention mechanism for the task of Argumentation Mining is missing. With this paper, we report a comparative evaluation of attention layers in combination with a bidirectional long short-term memory network, which is the current state-of-the-art approach for the unit segmentation task. We also compare sentence-level contextualized word embeddings to pre-generated ones. Our findings suggest that for this task, the additional attention layer does not improve the performance. In most cases, contextualized embeddings do also not show an improvement on the score achieved by pre-defined embeddings.}}, author = {{Spliethöver, Maximilian and Klaff, Jonas and Heuer, Hendrik}}, booktitle = {{Proceedings of the 6th Workshop on Argument Mining}}, location = {{Florence, Italy}}, pages = {{74--82}}, publisher = {{Association for Computational Linguistics}}, title = {{{Is It Worth the Attention? A Comparative Evaluation of Attention Layers for Argument Unit Segmentation}}}, doi = {{10.18653/v1/W19-4509}}, year = {{2019}}, } @inbook{21426, abstract = {{This chapter examines the drivers of corporate income tax complexity for multinational corporations in South Africa. Based on unique data from a global survey of tax consultants which was conducted in 2016 by Hoppe et al, novel insights can be provided into the complexity of the South African tax system. The data enable a comparison of South Africa with the global mean of tax complexity, as well as with its major trade and investment partners. It is further possible to distinguish between different areas of tax complexity, ie, tax code complexity (complexity inherent in the different regulations of the tax code) and tax framework complexity (complexity that arises from the features and processes of a tax system). Frequent changes in tax regulations, ambiguity and interpretation, as well as record-keeping, are found to be the most important complexity drivers in the tax code of South Africa. The analysis further highlights that anti-avoidance provisions, such as transfer pricing and controlled foreign corporation rules, are perceived as most complex. With respect to tax framework complexity, the poor disclosure of audit selection criteria, the lack of experience or technical skills of tax officers in the audit process and problems associated with tax refunds appear to be serious concerns. Even though South Africa’s overall tax system complexity does not seem to differ very much from other related countries, a closer look into the details reveals a number of future challenges.}}, author = {{Hoppe, Thomas and Safaei, Reyhaneh and Singleton, Amanda and Sureth-Sloane, Caren}}, booktitle = {{Tax Simplification - An African Perspective}}, editor = {{Evans, Chris and Franzsen, Riël and Stack, Elizabeth}}, isbn = {{978-1-920538-96-5}}, pages = {{267--293}}, publisher = {{Pretoria University Law Press}}, title = {{{Tax Complexity for Multinational Corporations in South Africa - Evidence from a Global Survey}}}, year = {{2019}}, } @inproceedings{17329, author = {{Graf-Schlattmann, Marcel and Meister, Dorothee M. and Oevel, Gudrun and Wilde, Melanie}}, booktitle = {{Hochschulforum Digitalisierung (2019). Strategies Beyond Borders – Transforming Higher Education in a Digital Age. Book of Abstracts}}, publisher = {{Hochschulforum Digitalisierung}}, title = {{{Success Factors for the Consolidation and Anchoring of Digitalisation Projects}}}, year = {{2019}}, } @inbook{17330, author = {{Graf-Schlattmann, Marcel and Meister, Dorothee M. and Oevel, Gudrun and Wilde, Melanie}}, booktitle = {{Teilhabe an Bildung und Wissenschaft}}, editor = {{Hafer, J.}}, publisher = {{Waxmann}}, title = {{{Digitalisierungsstrategien auf dem Prüfstand – eine empirische Untersuchung auf Basis der Grounded-Theory-Methodologie an deutschen Hochschulen}}}, volume = {{75}}, year = {{2019}}, } @misc{17332, author = {{Oevel, Gudrun}}, title = {{{Stellungnahme der DFG-Kommission zur Evaluierung des Förderprogramms „Fachinformationsdienste für die Wissenschaft“}}}, year = {{2019}}, } @inproceedings{18874, author = {{Reinhold, Jannik and Frank, Maximilian and Koldewey, Christian and Dumitrescu, Roman and Gausemeier, Jürgen}}, booktitle = {{Proceedings of the ISPIM Connects Ottawa – Innovation for Local and Global Impact}}, publisher = {{LUT Scientific and Expertise Publications}}, title = {{{Competence-based Planning of Value Networks for Smart Services}}}, year = {{2019}}, } @article{19446, abstract = {{We present a multi-channel database of overlapping speech for training, evaluation, and detailed analysis of source separation and extraction algorithms: SMS-WSJ -- Spatialized Multi-Speaker Wall Street Journal. It consists of artificially mixed speech taken from the WSJ database, but unlike earlier databases we consider all WSJ0+1 utterances and take care of strictly separating the speaker sets present in the training, validation and test sets. When spatializing the data we ensure a high degree of randomness w.r.t. room size, array center and rotation, as well as speaker position. Furthermore, this paper offers a critical assessment of recently proposed measures of source separation performance. Alongside the code to generate the database we provide a source separation baseline and a Kaldi recipe with competitive word error rates to provide common ground for evaluation.}}, author = {{Drude, Lukas and Heitkaemper, Jens and Boeddeker, Christoph and Haeb-Umbach, Reinhold}}, journal = {{ArXiv e-prints}}, title = {{{SMS-WSJ: Database, performance measures, and baseline recipe for multi-channel source separation and recognition}}}, year = {{2019}}, } @article{19449, abstract = {{Wenn akustische Signalverarbeitung mit automatisiertem Lernen verknüpft wird: Nachrichtentechniker arbeiten mit mehreren Mikrofonen und tiefen neuronalen Netzen an besserer Spracherkennung unter widrigsten Bedingungen. Von solchen Sensornetzwerken könnten langfristig auch digitale Sprachassistenten profitieren.}}, author = {{Haeb-Umbach, Reinhold}}, journal = {{DFG forschung 1/2019}}, pages = {{12--15}}, title = {{{Lektionen für Alexa und Co?!}}}, doi = {{10.1002/fors.201970104}}, year = {{2019}}, } @inproceedings{9270, abstract = {{As 5G and network function virtualization (NFV) are maturing, it becomes crucial to demonstrate their feasibility and benefits by means of vertical scenarios. While 5GPPP has identified smart manufacturing as one of the most important vertical industries, there is still a lack of specific, practical use cases. Using the experience from a large-scale manufacturing company, Weidm{\"u}ller Group, we present a detailed use case that reflects the needs of real-world manufacturers. We also propose an architecture with specific network services and virtual network functions (VNFs) that realize the use case in practice. As a proof of concept, we implement the required services and deploy them on an emulation-based prototyping platform. Our experimental results indicate that a fully virtualized smart manufacturing use case is not only feasible but also reduces machine interconnection and configuration time and thus improves productivity by orders of magnitude.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Behnke, Daniel and Marcel, Müller and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{European Conference on Networks and Communications (EuCNC)}}, keywords = {{5g, vertical, smart manufacturing, nfv}}, publisher = {{IEEE}}, title = {{{Putting 5G into Production: Realizing a Smart Manufacturing Vertical Scenario}}}, doi = {{10.1109/eucnc.2019.8802016}}, year = {{2019}}, } @inproceedings{9275, abstract = {{In the last years, store-oriented software ecosystems are gaining more and more attention from a business perspective. In these ecosystems, third-party developers upload extensions to a store which can be downloaded by end users. While the functional scope of such ecosystems is relatively similar, the underlying business models differ greatly in and between their different product domains (e.g. Mobile Phone, Smart TV). This variability, in turn, makes it challenging for store providers to find a business model that fits their own needs. To handle this variability, we introduce the Business Variability Model (BVM) for modeling business model decisions. The basis of these decisions is the analysis of 60 store-oriented software ecosystems in eight different product domains. We map their business model decisions to the Business Model Canvas, condense them to a variability model and discuss particular variants and their dependencies. Our work provides store providers a new approach for modeling business model decisions together with insights of existing business models. This, in turn, supports them in creating new and improving existing business models.}}, author = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}}, booktitle = {{Business Modeling and Software Design}}, editor = {{Shishkov, Boris}}, keywords = {{Software Ecosystems, Business Models, Variabilities}}, location = {{Lisbon}}, pages = {{153--169}}, publisher = {{Springer International Publishing}}, title = {{{Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach}}}, doi = {{10.1007/978-3-030-24854-3_10}}, year = {{2019}}, } @article{8113, abstract = {{The ongoing softwarization of networks creates a big need for automated testing solutions to ensure service quality. This becomes even more important if agile environments with short time to market and high demands, in terms of service performance and availability, are considered. In this paper, we introduce a novel testing solution for virtualized, microservice-based network functions and services, which we base on TTCN-3, a well known testing language defined by the European standards institute (ETSI). We use TTCN-3 not only for functional testing but also answer the question whether TTCN-3 can be used for performance profiling tasks as well. Finally, we demonstrate the proposed concepts and solutions in a case study using our open-source prototype to test and profile a chained network service.}}, author = {{Peuster, Manuel and Dröge, Christian and Boos, Clemens and Karl, Holger}}, issn = {{2405-9595}}, journal = {{ICT Express}}, publisher = {{Elsevier BV}}, title = {{{Joint testing and profiling of microservice-based network services using TTCN-3}}}, doi = {{10.1016/j.icte.2019.02.001}}, year = {{2019}}, } @misc{8312, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{encyclopedia.pub}}, keywords = {{OTF Computing, Natural Language Processing, Requirements Engineering}}, publisher = {{MDPI}}, title = {{{Requirements Engineering in OTF-Computing}}}, year = {{2019}}, } @article{5674, abstract = {{In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{European Journal of Operational Research}}, keywords = {{OR in disaster relief, disaster operations management, scheduling, branch-and-price}}, number = {{1}}, pages = {{352 -- 363}}, publisher = {{Elsevier}}, title = {{{An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}}}, volume = {{272}}, year = {{2019}}, } @inbook{7430, author = {{Rittmeier, Florian and Engels, Gregor and Teetz, Alexander}}, booktitle = {{Business Process Management Workshops}}, editor = {{Daniel, Florian and Sheng, Quan Z. and Motahari, Hamid}}, isbn = {{9783030116408}}, issn = {{1865-1348}}, pages = {{531--542}}, publisher = {{Springer International Publishing}}, title = {{{Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes}}}, doi = {{10.1007/978-3-030-11641-5_42}}, volume = {{342}}, year = {{2019}}, } @inproceedings{7668, author = {{Heindorf, Stefan and Scholten, Yan and Engels, Gregor and Potthast, Martin}}, booktitle = {{WWW}}, location = {{San Francisco, USA}}, pages = {{670--680}}, publisher = {{ACM}}, title = {{{Debiasing Vandalism Detection Models at Wikidata}}}, doi = {{10.1145/3308558.3313507}}, year = {{2019}}, } @article{8424, abstract = {{The vision of On-the-Fly (OTF) Computing is to compose and provide software services ad hoc, based on requirement descriptions in natural language. Since non-technical users write their software requirements themselves and in unrestricted natural language, deficits occur such as inaccuracy and incompleteness. These deficits are usually met by natural language processing methods, which have to face special challenges in OTF Computing because maximum automation is the goal. In this paper, we present current automatic approaches for solving inaccuracies and incompletenesses in natural language requirement descriptions and elaborate open challenges. In particular, we will discuss the necessity of domain-specific resources and show why, despite far-reaching automation, an intelligent and guided integration of end users into the compensation process is required. In this context, we present our idea of a chat bot that integrates users into the compensation process depending on the given circumstances. }}, author = {{Bäumer, Frederik Simon and Kersting, Joschka and Geierhos, Michaela}}, issn = {{2073-431X}}, journal = {{Computers}}, keywords = {{Inaccuracy Detection, Natural Language Software Requirements, Chat Bot}}, location = {{Vilnius, Lithuania}}, number = {{1}}, publisher = {{MDPI AG, Basel, Switzerland}}, title = {{{Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches}}}, doi = {{10.3390/computers8010022}}, volume = {{8}}, year = {{2019}}, } @inproceedings{8529, author = {{Seemann, Nina and Merten, Marie-Luis}}, booktitle = {{DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}}, editor = {{Sahle, Patrick}}, isbn = {{978-3-00-062166-6}}, location = {{Mainz and Frankfurt am Main, Germany}}, pages = {{352--353}}, publisher = {{Zenodo}}, title = {{{UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte}}}, doi = {{10.5281/ZENODO.2596094}}, year = {{2019}}, } @inproceedings{8532, author = {{Bäumer, Frederik Simon and Buff, Bianca and Geierhos, Michaela}}, booktitle = {{DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}}, editor = {{Sahle, Patrick}}, isbn = {{978-3-00-062166-6}}, location = {{Mainz and Frankfurt am Main, Germany}}, pages = {{192--193}}, publisher = {{Zenodo}}, title = {{{Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen}}}, doi = {{10.5281/zenodo.2596095}}, year = {{2019}}, } @inproceedings{8792, abstract = {{5G together with software defined networking (SDN) and network function virtualisation (NFV) will enable a wide variety of vertical use cases. One of them is the smart man- ufacturing case which utilises 5G networks to interconnect production machines, machine parks, and factory sites to enable new possibilities in terms of flexibility, automation, and novel applications (industry 4.0). However, the availability of realistic and practical proof-of-concepts for those smart manufacturing scenarios is still limited. This demo fills this gap by not only showing a real-world smart manufacturing application entirely implemented using NFV concepts, but also a lightweight prototyping framework that simplifies the realisation of vertical NFV proof-of-concepts. Dur- ing the demo, we show how an NFV-based smart manufacturing scenario can be specified, on-boarded, and instantiated before we demonstrate how the presented NFV services simplify machine data collection, aggregation, and analysis.}}, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{5th IEEE International Conference on Network Softwarization (NetSoft 2019)}}, location = {{Paris}}, title = {{{Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case}}}, doi = {{10.1109/NETSOFT.2019.8806685}}, year = {{2019}}, } @article{8795, abstract = {{Softwarized networks are the key enabler for elastic, on-demand service deployments of virtualized network functions. They allow to dynamically steer traffic through the network when new network functions are instantiated, or old ones are terminated. These scenarios become in particular challenging when stateful functions are involved, necessitating state management solutions to migrate state between the functions. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded virtualized network functions (VNFs), eg, solution-specific state management interfaces. To change this, we introduce the seamless handover protocol (SHarP). An easy-to-use, loss-less, and order-preserving flow rerouting mechanism that is not fixed to a single state management approach. Using SHarP, VNF vendors are empowered to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. In this paper, we present SHarP's design, its open source prototype implementation, and show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in state-of-the-art solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state.}}, author = {{Peuster, Manuel and Küttner, Hannes and Karl, Holger}}, issn = {{1055-7148}}, journal = {{International Journal of Network Management}}, title = {{{A flow handover protocol to support state migration in softwarized networks}}}, doi = {{10.1002/nem.2067}}, year = {{2019}}, } @article{8797, abstract = {{Free from phase-matching constraints, plasmonic metasurfaces have contributed significantly to the control of optical nonlinearity and enhancement of nonlinear generation efficiency by engineering subwavelength meta-atoms. However, high dissipative losses and inevitable thermal heating limit their applicability in nonlinear nanophotonics. All-dielectric metasurfaces, supporting both electric and magnetic Mie-type resonances in their nanostructures, have appeared as a promising alternative to nonlinear plasmonics. High-index dielectric nanostructures, allowing additional magnetic resonances, can induce magnetic nonlinear effects, which, along with electric nonlinearities, increase the nonlinear conversion efficiency. In addition, low dissipative losses and high damage thresholds provide an extra degree of freedom for operating at high pump intensities, resulting in a considerable enhancement of the nonlinear processes. We discuss the current state of the art in the intensely developing area of all-dielectric nonlinear nanostructures and metasurfaces, including the role of Mie modes, Fano resonances, and anapole moments for harmonic generation, wave mixing, and ultrafast optical switching. Furthermore, we review the recent progress in the nonlinear phase and wavefront control using all-dielectric metasurfaces. We discuss techniques to realize all-dielectric metasurfaces for multifunctional applications and generation of second-order nonlinear processes from complementary metal–oxide–semiconductor-compatible materials.}}, author = {{Sain, Basudeb and Meier, Cedrik and Zentgraf, Thomas}}, issn = {{2577-5421}}, journal = {{Advanced Photonics}}, number = {{2}}, pages = {{024002}}, title = {{{Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review}}}, doi = {{10.1117/1.ap.1.2.024002}}, volume = {{1}}, year = {{2019}}, } @article{9824, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and Kyriazis, Dimosthenis and Karl, Holger}}, issn = {{0163-6804}}, journal = {{IEEE Communications Magazine}}, pages = {{96--102}}, title = {{{Introducing Automated Verification and Validation for Virtualized Network Functions and Services}}}, doi = {{10.1109/mcom.2019.1800873}}, year = {{2019}}, } @article{6512, abstract = {{Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{Computers & Operations Research}}, keywords = {{parallel machine scheduling with setup times, parallel branch-and-price algorithm, high performance computing, master/worker parallelization}}, number = {{104}}, pages = {{338--357}}, publisher = {{Elsevier}}, title = {{{Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm}}}, year = {{2019}}, } @inproceedings{6514, abstract = {{Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners.}}, author = {{Schuhbeck, Veronika and Siegfried, Nils and Dorner, Verena and Benlian, Alexander and Scholz, Michael and Schryen, Guido}}, booktitle = {{Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik}}, keywords = {{Recommender Agents, Preference Elicitation Method, Trade-off Exposure, Customer Satisfaction}}, location = {{Siegen, Germany}}, pages = {{55--64}}, title = {{{Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents}}}, year = {{2019}}, } @inproceedings{6860, author = {{Afifi, Haitham and Karl, Holger}}, booktitle = {{2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)}}, publisher = {{IEEE}}, title = {{{Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding}}}, year = {{2019}}, } @techreport{16847, abstract = {{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.}}, author = {{Skitalinskaya, Gabriella and Klaff, Jonas and Spliethöver, Maximilian}}, pages = {{7}}, title = {{{CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction}}}, volume = {{2380}}, year = {{2019}}, } @inproceedings{11965, abstract = {{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.}}, author = {{Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}}, booktitle = {{INTERSPEECH 2019, Graz, Austria}}, title = {{{Unsupervised training of neural mask-based beamforming}}}, year = {{2019}}, } @inproceedings{12874, abstract = {{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.}}, author = {{Drude, Lukas and Hasenklever, Daniel and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2019, Brighton, UK}}, title = {{{Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation}}}, year = {{2019}}, } @inproceedings{12875, abstract = {{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.}}, author = {{Heymann, Jahn and Drude, Lukas and Haeb-Umbach, Reinhold and Kinoshita, Keisuke and Nakatani, Tomohiro}}, booktitle = {{ICASSP 2019, Brighton, UK}}, title = {{{Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR}}}, year = {{2019}}, } @inproceedings{12876, abstract = {{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.}}, author = {{Kurz, Gerhard and Gilitschenski, Igor and Pfaff, Florian and Drude, Lukas and Hanebeck, Uwe D. and Haeb-Umbach, Reinhold and Siegwart, Roland Y.}}, booktitle = {{Journal of Statistical Software 89(4)}}, title = {{{Directional Statistics and Filtering Using libDirectional}}}, year = {{2019}}, } @inproceedings{12882, abstract = {{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.}}, author = {{Afifi, Haitham and Karl, Holger and Eikenberg, Sebastian and Mueller, Arnold and Gansel, Lars and Makejkin, Alexander and Hannemann, Kai and Schellenberg, Rafael}}, booktitle = {{2019 IEEE Wireless Communications and Networking Conference (WCNC) (IEEE WCNC 2019) (Demo)}}, keywords = {{WSN, virtualization, VNE}}, title = {{{A Rapid Prototyping for Wireless Virtual Network Embedding using MARVELO}}}, year = {{2019}}, } @article{12890, abstract = {{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.}}, author = {{Drude, Lukas and Haeb-Umbach, Reinhold}}, issn = {{1941-0484}}, journal = {{IEEE Journal of Selected Topics in Signal Processing}}, title = {{{Integration of Neural Networks and Probabilistic Spatial Models for Acoustic Blind Source Separation}}}, doi = {{10.1109/JSTSP.2019.2912565}}, year = {{2019}}, } @article{12908, author = {{Hammer, Manfred and Ebers, Lena and Förstner, Jens}}, issn = {{0740-3224}}, journal = {{Journal of the Optical Society of America B}}, keywords = {{tet_topic_waveguides}}, pages = {{2395}}, title = {{{Oblique quasi-lossless excitation of a thin silicon slab waveguide: a guided-wave variant of an anti-reflection coating}}}, doi = {{10.1364/josab.36.002395}}, volume = {{36}}, year = {{2019}}, } @inproceedings{15371, abstract = {{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. }}, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Karl, Holger}}, booktitle = {{IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)}}, publisher = {{IEEE/IFIP}}, title = {{{The Softwarised Network Data Zoo}}}, year = {{2019}}, } @inproceedings{15373, abstract = {{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.}}, author = {{Moro, Daniele and Peuster, Manuel and Karl, Holger and Capone, Antonio}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}}, publisher = {{IEEE}}, title = {{{FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios}}}, year = {{2019}}, } @inproceedings{15374, abstract = {{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.}}, author = {{Moro, Daniele and Peuster, Manuel and Karl, Holger and Capone, Antonio}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}}, publisher = {{IEEE}}, title = {{{Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios}}}, year = {{2019}}, } @article{15416, author = {{Jochen Baumeister}}, journal = {{Quick And Easy Journal Title}}, title = {{{New Quick And Easy Publication - Will be edited by LibreCat team}}}, year = {{2019}}, } @inproceedings{15812, abstract = {{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.}}, author = {{Heymann, Jahn and Khe Chai Sim, Bo Li}}, booktitle = {{ICASSP 2019, Brighton, UK}}, title = {{{Improving CTC Using Stimulated Learning for Sequence Modeling}}}, year = {{2019}}, } @inproceedings{15816, abstract = {{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.}}, author = {{Zorila, Catalin and Boeddeker, Christoph and Doddipatla, Rama and Haeb-Umbach, Reinhold}}, booktitle = {{ASRU 2019, Sentosa, Singapore}}, title = {{{An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription}}}, year = {{2019}}, } @inproceedings{15908, author = {{Müller, Jens and Brinkmann, Marcus and Poddebniak, Damian and Böck, Hanno and Schinzel, Sebastian and Somorovsky, Juraj and Schwenk, Jörg}}, booktitle = {{28th {USENIX} Security Symposium ({USENIX} Security 19)}}, isbn = {{978-1-939133-06-9}}, pages = {{1011--1028}}, publisher = {{{USENIX} Association}}, title = {{{"Johnny, you are fired!" -- Spoofing OpenPGP and S/MIME Signatures in Emails}}}, year = {{2019}}, } @inproceedings{15909, author = {{Merget, Robert and Somorovsky, Juraj and Aviram, Nimrod and Young, Craig and Fliegenschmidt, Janis and Schwenk, Jörg and Shavitt, Yuval}}, booktitle = {{28th {USENIX} Security Symposium ({USENIX} Security 19)}}, isbn = {{978-1-939133-06-9}}, pages = {{1029--1046}}, publisher = {{{USENIX} Association}}, title = {{{Scalable Scanning and Automatic Classification of TLS Padding Oracle Vulnerabilities}}}, year = {{2019}}, } @inproceedings{14568, author = {{Heindorf, Stefan and Scholten, Yan and Engels, Gregor and Potthast, Martin}}, booktitle = {{INFORMATIK}}, pages = {{289--290}}, title = {{{Debiasing Vandalism Detection Models at Wikidata (Extended Abstract)}}}, doi = {{10.18420/inf2019_48}}, year = {{2019}}, } @inproceedings{14822, abstract = {{Multi-talker speech and moving speakers still pose a significant challenge to automatic speech recognition systems. Assuming an enrollment utterance of the target speakeris available, the so-called SpeakerBeam concept has been recently proposed to extract the target speaker from a speech mixture. If multi-channel input is available, spatial properties of the speaker can be exploited to support the source extraction. In this contribution we investigate different approaches to exploit such spatial information. In particular, we are interested in the question, how useful this information is if the target speaker changes his/her position. To this end, we present a SpeakerBeam-based source extraction network that is adapted to work on moving speakers by recursively updating the beamformer coefficients. Experimental results are presented on two data sets, one with articially created room impulse responses, and one with real room impulse responses and noise recorded in a conference room. Interestingly, spatial features turn out to be advantageous even if the speaker position changes.}}, author = {{Heitkaemper, Jens and Feher, Thomas and Freitag, Michael and Haeb-Umbach, Reinhold}}, booktitle = {{International Conference on Statistical Language and Speech Processing 2019, Ljubljana, Slovenia}}, title = {{{A Study on Online Source Extraction in the Presence of Changing Speaker Positions}}}, year = {{2019}}, } @inproceedings{14824, abstract = {{This paper deals with multi-channel speech recognition in scenarios with multiple speakers. Recently, the spectral characteristics of a target speaker, extracted from an adaptation utterance, have been used to guide a neural network mask estimator to focus on that speaker. In this work we present two variants of speakeraware neural networks, which exploit both spectral and spatial information to allow better discrimination between target and interfering speakers. Thus, we introduce either a spatial preprocessing prior to the mask estimation or a spatial plus spectral speaker characterization block whose output is directly fed into the neural mask estimator. The target speaker’s spectral and spatial signature is extracted from an adaptation utterance recorded at the beginning of a session. We further adapt the architecture for low-latency processing by means of block-online beamforming that recursively updates the signal statistics. Experimental results show that the additional spatial information clearly improves source extraction, in particular in the same-gender case, and that our proposal achieves state-of-the-art performance in terms of distortion reduction and recognition accuracy.}}, author = {{Martin-Donas, Juan M. and Heitkaemper, Jens and Haeb-Umbach, Reinhold and Gomez, Angel M. and Peinado, Antonio M.}}, booktitle = {{INTERSPEECH 2019, Graz, Austria}}, title = {{{Multi-Channel Block-Online Source Extraction based on Utterance Adaptation}}}, year = {{2019}}, } @inproceedings{14826, abstract = {{In this paper, we present Hitachi and Paderborn University’s joint effort for automatic speech recognition (ASR) in a dinner party scenario. The main challenges of ASR systems for dinner party recordings obtained by multiple microphone arrays are (1) heavy speech overlaps, (2) severe noise and reverberation, (3) very natural onversational content, and possibly (4) insufficient training data. As an example of a dinner party scenario, we have chosen the data presented during the CHiME-5 speech recognition challenge, where the baseline ASR had a 73.3% word error rate (WER), and even the best performing system at the CHiME-5 challenge had a 46.1% WER. We extensively investigated a combination of the guided source separation-based speech enhancement technique and an already proposed strong ASR backend and found that a tight combination of these techniques provided substantial accuracy improvements. Our final system achieved WERs of 39.94% and 41.64% for the development and evaluation data, respectively, both of which are the best published results for the dataset. We also investigated with additional training data on the official small data in the CHiME-5 corpus to assess the intrinsic difficulty of this ASR task.}}, author = {{Kanda, Naoyuki and Boeddeker, Christoph and Heitkaemper, Jens and Fujita, Yusuke and Horiguchi, Shota and Haeb-Umbach, Reinhold}}, booktitle = {{INTERSPEECH 2019, Graz, Austria}}, title = {{{Guided Source Separation Meets a Strong ASR Backend: Hitachi/Paderborn University Joint Investigation for Dinner Party ASR}}}, year = {{2019}}, } @techreport{14902, author = {{Mair, Christina and Scheffler, Wolfram and Senger, Isabell and Sureth-Sloane, Caren}}, title = {{{Analyse der Veränderung der zwischenstaatlichen Gewinnaufteilung bei Einführung einer standardisierten Gewinnverteilungsmethode am Beispiel des Einsatzes von 3D-Druckern}}}, volume = {{42}}, year = {{2019}}, } @article{14990, abstract = {{We investigate optical microresonators consisting of either one or two coupled rectangular strips between upper and lower slab waveguides. The cavities are evanescently excited under oblique angles by thin-film guided, in-plane unguided waves supported by one of the slab waveguides. Beyond a specific incidence angle, losses are fully suppressed. The interaction between the guided mode of the cavity-strip and the incoming slab modes leads to resonant behavior for specific incidence angles and gaps. For a single cavity, at resonance, the input power is equally split among each of the four output ports, while for two cavities an add-drop filter can be realized that, at resonance, routes the incoming power completely to the forward drop waveguide via the cavity. For both applications, the strength of the interaction is controlled by the gaps between cavities and waveguides.}}, author = {{Ebers, Lena and Hammer, Manfred and Berkemeier, Manuel B. and Menzel, Alexander and Förstner, Jens}}, issn = {{2578-7519}}, journal = {{OSA Continuum}}, keywords = {{tet_topic_waveguides}}, pages = {{3288}}, title = {{{Coupled microstrip-cavities under oblique incidence of semi-guided waves: a lossless integrated optical add-drop filter}}}, doi = {{10.1364/osac.2.003288}}, volume = {{2}}, year = {{2019}}, } @article{15002, abstract = {{Many problem settings in machine learning are concerned with the simultaneous prediction of multiple target variables of diverse type. Amongst others, such problem settings arise in multivariate regression, multi-label classification, multi-task learning, dyadic prediction, zero-shot learning, network inference, and matrix completion. These subfields of machine learning are typically studied in isolation, without highlighting or exploring important relationships. In this paper, we present a unifying view on what we call multi-target prediction (MTP) problems and methods. First, we formally discuss commonalities and differences between existing MTP problems. To this end, we introduce a general framework that covers the above subfields as special cases. As a second contribution, we provide a structured overview of MTP methods. This is accomplished by identifying a number of key properties, which distinguish such methods and determine their suitability for different types of problems. Finally, we also discuss a few challenges for future research.}}, author = {{Waegeman, Willem and Dembczynski, Krzysztof and Hüllermeier, Eyke}}, issn = {{1573-756X}}, journal = {{Data Mining and Knowledge Discovery}}, number = {{2}}, pages = {{293--324}}, title = {{{Multi-target prediction: a unifying view on problems and methods}}}, doi = {{10.1007/s10618-018-0595-5}}, volume = {{33}}, year = {{2019}}, } @inproceedings{15007, author = {{Melnikov, Vitaly and Hüllermeier, Eyke}}, booktitle = {{Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)}}, title = {{{Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA}}}, doi = {{10.1016/j.jmva.2019.02.017}}, year = {{2019}}, } @inproceedings{15011, author = {{Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}}, booktitle = {{Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019}}, editor = {{Hoffmann, Frank and Hüllermeier, Eyke and Mikut, Ralf}}, isbn = {{978-3-7315-0979-0}}, location = {{Dortmund}}, pages = {{135--146}}, publisher = {{KIT Scientific Publishing, Karlsruhe}}, title = {{{Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking}}}, year = {{2019}}, } @article{16337, author = {{Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, issn = {{0167-7055}}, journal = {{Computer Graphics Forum}}, location = {{Seoul, South Korea}}, number = {{7}}, pages = {{413--424}}, title = {{{Visibility‐Aware Progressive Farthest Point Sampling on the GPU}}}, doi = {{10.1111/cgf.13848}}, volume = {{38}}, year = {{2019}}, } @unpublished{16341, abstract = {{We present a technique for rendering highly complex 3D scenes in real-time by generating uniformly distributed points on the scene's visible surfaces. The technique is applicable to a wide range of scene types, like scenes directly based on complex and detailed CAD data consisting of billions of polygons (in contrast to scenes handcrafted solely for visualization). This allows to visualize such scenes smoothly even in VR on a HMD with good image quality, while maintaining the necessary frame-rates. In contrast to other point based rendering methods, we place points in an approximated blue noise distribution only on visible surfaces and store them in a highly GPU efficient data structure, allowing to progressively refine the number of rendered points to maximize the image quality for a given target frame rate. Our evaluation shows that scenes consisting of a high amount of polygons can be rendered with interactive frame rates with good visual quality on standard hardware.}}, author = {{Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, booktitle = {{arXiv:1904.08225}}, title = {{{Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels}}}, year = {{2019}}, } @misc{13128, author = {{Bröcher, Henrik}}, publisher = {{Universität Paderborn}}, title = {{{Rational Secure Multiparty Computation}}}, year = {{2019}}, } @inproceedings{13138, abstract = {{Mobile app stores like Apple's AppStore or Google's PlayStore are highly competitive markets for third-party developers wanting to develop successful applications. During the development process, many developers focus on the multitude of product functions but neglect the business model as an equally important part. As a result, developers often fail to meet customer needs, leading to unnecessary development costs and poor market penetration. This, in turn, raises the question of how we intertwine the business model and product functions during the development process to ensure a better alignment between the two. In this paper, we show this intertwined development by adapting the concept of Twin Peaks to the business model and product functions. Based on feature modeling as an abstraction layer, we introduce the concept of a Business Model Decision Line (BMDL) to structure the business model decisions and their relation to product functions structured in a Software Product Line (SPL). The basis of our feature models is the analysis of top listed applications in the app stores of Apple and Google. To create and modify both models, we provide an incremental feature structuring and iterative feature selection process. This combination of abstraction layer and development process supports third-party developers to build successful applications both from a business and a product perspective. }}, author = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}}, booktitle = {{Software Business}}, editor = {{Hyrynsalmi, Sami and Suoranta, Mari and Nguyen-Duc, Anh and Tyrväinen, Pasi and Abrahamsson, Pekka}}, keywords = {{Intertwined Development, Twin Peaks, Feature Model, Business Model, Product Functions}}, location = {{ Jyväskylä}}, number = {{1}}, pages = {{192--207}}, publisher = {{Springer International Publishing}}, title = {{{Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach}}}, doi = {{10.1007/978-3-030-33742-1_16}}, volume = {{370}}, year = {{2019}}, } @book{13139, editor = {{Rezat, Sebastian and Fan, Lianghuo and Hattermann, Mathias and Schumacher, Jan and Wuschke, Holger}}, location = {{Paderborn}}, pages = {{392}}, publisher = {{Universitätsbibliothek Paderborn}}, title = {{{Proceedings of the Third International Conference on Mathematics Textbook Research and Development: 16-19 September 2019 Paderborn, Germany}}}, doi = {{10.17619/UNIPB/1-768}}, year = {{2019}}, } @inproceedings{13271, abstract = {{Automatic meeting analysis comprises the tasks of speaker counting, speaker diarization, and the separation of overlapped speech, followed by automatic speech recognition. This all has to be carried out on arbitrarily long sessions and, ideally, in an online or block-online manner. While significant progress has been made on individual tasks, this paper presents for the first time an all-neural approach to simultaneous speaker counting, diarization and source separation. The NN-based estimator operates in a block-online fashion and tracks speakers even if they remain silent for a number of time blocks, thus learning a stable output order for the separated sources. The neural network is recurrent over time as well as over the number of sources. The simulation experiments show that state of the art separation performance is achieved, while at the same time delivering good diarization and source counting results. It even generalizes well to an unseen large number of blocks.}}, author = {{von Neumann, Thilo and Kinoshita, Keisuke and Delcroix, Marc and Araki, Shoko and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2019, Brighton, UK}}, title = {{{All-neural Online Source Separation, Counting, and Diarization for Meeting Analysis}}}, year = {{2019}}, } @inproceedings{13292, abstract = {{Building on 5G and network function virtualization (NFV), smart manufacturing has the potential to drastically increase productivity, reduce cost, and introduce novel, flexible manufacturing services. Current work mostly focuses on high-level scenarios or emulation-based prototype deployments. Extending our previous work, we showcase one of the first cloud-native 5G verticals focusing on the deployment of smart manufacturing use cases on production infrastructure. In particular, we use the 5GTANGO service platform to deploy our developed network services on Kubernetes. For this demo, we implemented a series of cloud-native virtualized network functions (VNFs) and created suitable service descriptors. Their light-weight, stateless deployment on Kubernetes enables quick instantiation, scalability, and robustness.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Hannemann, Kai and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Demo Track}}, keywords = {{5G, NFV, Smart Manufacturing, Cloud-Native, Kubernetes}}, location = {{Dallas, TX, USA}}, publisher = {{IEEE}}, title = {{{"Producing Cloud-Native": Smart Manufacturing Use Cases on Kubernetes}}}, year = {{2019}}, } @inproceedings{13443, abstract = {{This work considers the problem of control and resource allocation in networked systems. To this end, we present DIRA a Deep reinforcement learning based Iterative Resource Allocation algorithm, which is scalable and control-aware. Our algorithm is tailored towards large-scale problems where control and scheduling need to act jointly to optimize performance. DIRA can be used to schedule general time-domain optimization based controllers. In the present work, we focus on control designs based on suitably adapted linear quadratic regulators. We apply our algorithm to networked systems with correlated fading communication channels. Our simulations show that DIRA scales well to large scheduling problems.}}, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Quevedo, Daniel}}, booktitle = {{Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems}}, keywords = {{Networked control systems, deep reinforcement learning, large-scale systems, resource scheduling, stochastic control}}, location = {{Chicago, USA}}, title = {{{Deep reinforcement learning for scheduling in large-scale networked control systems}}}, year = {{2019}}, } @inproceedings{10232, abstract = {{Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn, and more recently ML-Plan, have shown impressive results for the tasks of single-label classification and regression. Yet, there is only little work on other types of machine learning problems so far. In particular, there is almost no work on automating the engineering of machine learning solutions for multi-label classification (MLC). We show how the scope of ML-Plan, an AutoML-tool for multi-class classification, can be extended towards MLC using MEKA, which is a multi-label extension of the well-known Java library WEKA. The resulting approach recursively refines MEKA's multi-label classifiers, nesting other multi-label classifiers for meta algorithms and single-label classifiers provided by WEKA as base learners. In our evaluation, we find that the proposed approach yields strong results and performs significantly better than a set of baselines we compare with.}}, author = {{Wever, Marcel Dominik and Mohr, Felix and Tornede, Alexander and Hüllermeier, Eyke}}, location = {{Long Beach, CA, USA}}, title = {{{Automating Multi-Label Classification Extending ML-Plan}}}, year = {{2019}}, } @article{10282, author = {{Lin, Zemeng and Huang, Lingling and Zhao, Ruizhe and Wei, Qunshuo and Zentgraf, Thomas and Wang, Yongtian and Li, Xiaowei}}, issn = {{1094-4087}}, journal = {{Optics Express}}, number = {{13}}, pages = {{18740--18750}}, title = {{{Dynamic control of mode modulation and spatial multiplexing using hybrid metasurfaces}}}, doi = {{10.1364/oe.27.018740}}, volume = {{27}}, year = {{2019}}, } @misc{10306, author = {{Porzenheim, Laurens Alexander}}, title = {{{Post-Quantum Secure Group Signatures}}}, year = {{2019}}, } @article{10325, author = {{Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and Karl, Holger}}, issn = {{1687-1499}}, journal = {{EURASIP Journal on Wireless Communications and Networking}}, publisher = {{Springer}}, title = {{{Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing}}}, doi = {{10.1186/s13638-019-1493-2}}, year = {{2019}}, } @inproceedings{13554, abstract = {{We propose a novel personal reputation system for cross-platform reputation. We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity property typically imposed on reputation systems is not necessary. Instead, we propose a relaxed notion of rater anonymity that is more applicable in the crowd work scenario. This allows us to construct a secure personal reputation system from simple cryptographic primitives.}}, author = {{Blömer, Johannes and Löken, Nils}}, booktitle = {{Security and Trust Management, STM 2019}}, title = {{{Personal Cross-Platform Reputation}}}, doi = {{10.1007/978-3-030-31511-5_9}}, volume = {{11738}}, year = {{2019}}, } @inproceedings{13557, abstract = {{We present a searchable encryption scheme for dynamic document collections in a multi-user scenario. Our scheme features fine-grained access control to search results, as well as access control to operations such as adding documents to the document collection, or changing individual documents. The scheme features verifiability of search results. Our scheme also satisfies the forward privacy notion crucial for the security of dynamic searchable encryption schemes.}}, author = {{Blömer, Johannes and Löken, Nils}}, booktitle = {{12th International Symposium on Foundations and Practice of Security, FPS 2019}}, publisher = {{Springer}}, title = {{{Dynamic Searchable Encryption with Access Control}}}, volume = {{12056}}, year = {{2019}}, } @misc{13648, author = {{Scholz, Swante}}, publisher = {{Universität Paderborn}}, title = {{{Implementation and Comparison of Elliptic Curve Algorithms in Java}}}, year = {{2019}}, } @article{30093, author = {{Ficara, Elena}}, journal = {{Argumenta}}, title = {{{Hegel on the Naturalness of Logic}}}, year = {{2019}}, } @inproceedings{7626, author = {{Schubert, Philipp and Hermann, Ben and Bodden, Eric}}, booktitle = {{Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)}}, location = {{Prague, Czech Republic}}, pages = {{393--410}}, title = {{{PhASAR: An Inter-Procedural Static Analysis Framework for C/C++}}}, doi = {{10.1007/978-3-030-17465-1_22}}, volume = {{II}}, year = {{2019}}, } @unpublished{16711, abstract = {{Embedding techniques allow the approximations of finite dimensional attractors and manifolds of infinite dimensional dynamical systems via subdivision and continuation methods. These approximations give a topological one-to-one image of the original set. In order to additionally reveal their geometry we use diffusion mapst o find intrinsic coordinates. We illustrate our results on the unstable manifold of the one-dimensional Kuramoto--Sivashinsky equation, as well as for the attractor of the Mackey-Glass delay differential equation.}}, author = {{Gerlach, Raphael and Koltai, Péter and Dellnitz, Michael}}, booktitle = {{arXiv:1902.08824}}, title = {{{Revealing the intrinsic geometry of finite dimensional invariant sets of infinite dimensional dynamical systems}}}, year = {{2019}}, } @article{13549, author = {{Hagengruber, Ruth Edith}}, issn = {{0026-9662}}, journal = {{British Journal for the History of Philosophy. Vol. 27}}, number = {{4}}, publisher = {{Routledge}}, title = {{{Women Philosophers in Early Modern Philosophy}}}, doi = {{10.1080/09608788.2019.1610861}}, year = {{2019}}, } @book{34492, abstract = {{Cooperation between teachers and special educators is a central requirement for inclusive schools in which students both with and without special educational needs are taught together. In many studies the autonomy/equity norm is reported as a significant obstacle for cooperation. It implies that teachers strive towards a high amount of autonomy in the sense of ‘privacy in their classroom’ as a reaction to endemic uncertainties of pedagogical work and specific work conditions in schools. Nevertheless, some studies point out that general and special educators strive for and engage in intense forms of cooperation. In this study it is argued from a self-determination theory perspective that cooperation can be accompanied by high values of perceived autonomy if teachers internalized the need for cooperation as part of their professional identity. Furthermore, factors affecting the frequency of cooperation, perception of goal conflict frequency, and stress caused by goal conflicts relating to the endemic uncertainties of pedagogical work are investigated. Analyses were carried out using survey data collected from 222 general and special educators working in either inclusive primary schools, or special schools where pupils had specific special educational needs in the domain of ‘learning’. A key outcome of the study is the absence of the anticipated negative effect of cooperation on the perception of autonomy. This underlines doubts regarding the relevance of the autonomy/equity norm. In addition to that, having special educators with greater levels of experience, as well as the support of the principal through providing fixed time slots for cooperation are identified as central factors supporting cooperation in inclusive schools. Moreover, increased levels of cooperation were found to reduce the perception of goal conflict frequency and stress relating to goal conflicts for general educators. The results of the study are discussed with regard to theoretical implications,the professionalization of general and special educators and opportunities to enhance cooperation and supportive settings in inclusive schools. Die Kooperation von Lehrkräften und Sonderpädagog_innen stellt eine zentrale Bedingung inklusiver Beschulung von Schüler_innen mit und ohne sonderpädagogische Förderbedarfe dar. Als ein maßgebliches Hemmnis der Zusammenarbeit gilt das Autonomie-Paritäts-Muster. Dieses besagt, dass Lehrkräfte aufgrund spezifischer Arbeitsbedingungen und Strukturmerkmale pädagogischer Arbeit in Schule und Unterricht ein hohes Ausmaß an Autonomie i.S.v. ‚Privatheit im Unterricht‘ anstreben. Dennoch weisen Studien darauf hin, dass Lehrkräfte und Sonderpädagog_innen dennoch intensive Kooperationsformen praktizieren und anstreben. In der Arbeit wird mit einem Rückgriff auf die Selbstbestimmungstheorie argumentiert, dass Kooperation auch mit einem hohen Autonomieerleben einhergehen kann, wenn Lehrkräfte und Sonderpädagog_innen Kooperation als Teil ihrer eigenen Professionalität internalisiert haben. Zudem werden Einflussfaktoren auf die Häufigkeit von Kooperation sowie die Wahrnehmung und Belastung von Antinomien und Zielkonflikten als Strukturmerkmale des pädagogischen Handelns untersucht. Grundlage der quantitativ-empirischen Analysen ist eine Stichprobe von insgesamt 222 Lehrkräften und Sonderpädagog_innen in inklusiven Grundschulen und Förderschulen für den Förderschwerpunkt Lernen. Als ein wesentliches Ergebnis der Arbeit zeigt sich, dass negative Effekte der Kooperation auf das Autonomieerleben ausbleiben, sodass die aufgeworfenen Zweifel an der Relevanz des Autonomie-Paritäts-Musters bestärkt werden. Darüber hinaus erweisen sich die Berufserfahrung sowie der Rückhalt der Schulleitung durch geschaffene Zeitfenster im Stundenplan als relevante Einflussfaktoren auf die Häufigkeit der Kooperation von Sonderpädagog_innen in inklusiven Grundschulen. Lehrkräfte in inklusiven Grundschulen nehmen weniger Zielkonflikte und Antinomien wahr und erleben diese weniger belastend, je häufiger sie mit Sonderpädagog_innen kooperieren. Die Ergebnisse werden hinsichtlich theoretischer Implikationen, der Professionalisierung von Lehrkräften und Sonderpädagog_innen sowie Möglichkeiten der Förderung von Kooperation und kooperativer Strukturen diskutiert.}}, author = {{Neumann, Phillip}}, isbn = {{9783830940432}}, keywords = {{Kooperation, Inklusion, Sonderpädagogik, Schulentwicklung, BiLieF}}, pages = {{258}}, publisher = {{Waxmann Verlag GmbH}}, title = {{{Kooperation selbst bestimmt? Interdisziplinäre Kooperation und Zielkonflikte in inklusiven Grundschulen und Förderschulen}}}, doi = {{10.31244/9783830990437}}, volume = {{73}}, year = {{2019}}, } @book{35055, author = {{Süßmann, Johannes}}, pages = {{37 S.}}, publisher = {{Bonifatius}}, title = {{{Die sprechende Stadt. Stadtumbau in Paderborn um 1600 und in der Gegenwart}}}, volume = {{152}}, year = {{2019}}, } @inbook{29320, author = {{Herzig, Bardo and Wiethoff, Christoph}}, booktitle = {{Praxissemester (Religion) in NRW: Bilanz und Perspektiven}}, editor = {{Caruso, C. and Woppowa, J.}}, publisher = {{Universität Paderborn}}, title = {{{Konzeptionelle, strukturelle und inhaltliche Gestaltungsaspekte des Praxissemesters an der Universität Paderborn}}}, year = {{2019}}, }