TY - CONF AU - Gottschalk, Sebastian AU - Kirchhoff, Jonas AU - Engels, Gregor ED - Shishkov, Boris ID - 20244 T2 - Business Modeling and Software Design TI - Extending Business Model Development Tools with Consolidated Expert Knowledge ER - TY - JOUR AB - N-body methods are one of the essential algorithmic building blocks of high-performance and parallel computing. Previous research has shown promising performance for implementing n-body simulations with pairwise force calculations on FPGAs. However, to avoid challenges with accumulation and memory access patterns, the presented designs calculate each pair of forces twice, along with both force sums of the involved particles. Also, they require large problem instances with hundreds of thousands of particles to reach their respective peak performance, limiting the applicability for strong scaling scenarios. This work addresses both issues by presenting a novel FPGA design that uses each calculated force twice and overlaps data transfers and computations in a way that allows to reach peak performance even for small problem instances, outperforming previous single precision results even in double precision, and scaling linearly over multiple interconnected FPGAs. For a comparison across architectures, we provide an equally optimized CPU reference, which for large problems actually achieves higher peak performance per device, however, given the strong scaling advantages of the FPGA design, in parallel setups with few thousand particles per device, the FPGA platform achieves highest performance and power efficiency. AU - Menzel, Johannes AU - Plessl, Christian AU - Kenter, Tobias ID - 28099 IS - 1 JF - ACM Transactions on Reconfigurable Technology and Systems SN - 1936-7406 TI - The Strong Scaling Advantage of FPGAs in HPC for N-body Simulations VL - 15 ER - TY - CONF AU - Triebus, Marcel AU - Reitz, Alexander AU - Grydin, Olexandr AU - Grenz, Julian AU - Schneidt, Andreas AU - Erhardt, Rüdiger AU - Tröster, Thomas AU - Schaper, Mirko ID - 28440 T2 - 13th European LS-DYNA Conference 2021 TI - Forming Simulation of Tailored Press Hardened Parts ER - TY - JOUR AU - Droß, M. AU - Heyser, Per AU - Meschut, Gerson AU - Hürkamp, A. AU - Dröder, K. ID - 28448 JF - Journal of Advanced Joining Processes SN - 2666-3309 TI - Fiber response to pin penetration in dry woven fabric using numerical analysis ER - TY - GEN AU - Moritzer, Elmar AU - Hecker, Felix AU - Hirsch, André ID - 24095 IS - 2 T2 - Kunststoffland NRW report TI - Aus der Forschung in die Anwendung - Materialqualifizierung im Kunststoff Freiformen VL - 2021 ER - TY - CONF AB - This paper deals with a novel method for the online fitting of a microscopic traffic simulation model to the current state of a real world traffic area. The traffic state estimation is based on limited data of different measurement sources and guarantees general accordance of reality and simulation in terms of multimodal road traffic counts and vehicle speeds. The research is embedded in the challenge of improving the traffic by controlling the traffic light systems (TLS) of the examined area. Therefore, the current traffic state and the predicted route choices of individual road users are the matter of interest. The concept is generally transferable to any road traffic system. To give an impression of the accuracy and potential of the approach, the validation and first application results are presented. AU - Malena, Kevin AU - Link, Christopher AU - Mertin, Sven AU - Gausemeier, Sandra AU - Trächtler, Ansgar ID - 24166 SN - 978-1-7281-7584-3 T2 - 2021 IEEE Transportation Electrification Conference & Expo (ITEC) TI - Validation of an Online State Estimation Concept for Microscopic Traffic Simulations◆ ER - TY - CONF AU - zur Heiden, Philipp AU - Priefer, Jennifer ED - Breitner, Michael H. ED - Lehnhoff, Sebastian ED - Nieße, Astrid ED - Staudt, Philipp ED - Weinhardt, Christof ED - Werth, Oliver ID - 24534 T2 - Pre-Conference 16th International Congress on Wirtschaftsinformatik at Universität Duisburg-Essen TI - Transitioning to Condition-Based Maintenance on the Distribution Grid: Deriving Design Principles from a Qualitative Study ER - TY - JOUR AU - Lahme, Simon AU - Bauer, Anna AU - Reinhold, Peter ID - 26039 JF - Phydid B, Didaktik der Physik, Beiträge zur DPG-Frühjahrstagung TI - Ansätze zur Diagnose und Förderung von Problemlösefähigkeiten in der Studieneingangsphase Physik ER - TY - CONF AU - Pollmeier, Pascal AU - Fechner, Sabine ED - Habig, Sebastian ID - 26718 T2 - Naturwissenschaftlicher Unterricht und Lehrerbildung im Umbruch? TI - Erweiterung des epistemologischen Verständnisses durch Konfrontation mit anomalen Daten. ER - TY - THES AB - Previous research in proof-carrying hardware has established the feasibility and utility of the approach, and provided a concrete solution for employing it for the certification of functional equivalence checking against a specification, but fell short in connecting it to state-of-the-art formal verification insights, methods and tools. Due to the immense complexity of modern circuits, and verification challenges such as the state explosion problem for sequential circuits, this restriction of readily-available verification solutions severely limited the applicability of the approach in wider contexts. This thesis closes the gap between the PCH approach and current advances in formal hardware verification, provides methods and tools to express and certify a wide range of circuit properties, both functional and non-functional, and presents for the first time prototypes in which circuits that are implemented on actual reconfigurable hardware are verified with PCH methods. Using these results, designers can now apply PCH to establish trust in more complex circuits, by using more diverse properties which they can express using modern, efficient property specification techniques. AU - Wiersema, Tobias ID - 26746 KW - Proof-Carrying Hardware KW - Formal Verification KW - Sequential Circuits KW - Non-Functional Properties KW - Functional Properties TI - Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware ER - TY - JOUR AU - Bothe, Mike AU - Lutters, Nicole AU - Kenig, Eugeny ID - 28989 JF - Chemical Engineering Transactions TI - Examination of hazardous situations in industrial closed-loop processes using dynamic simulations ER - TY - GEN AU - Eberbach, Jelena AU - Sureth-Sloane, Caren AU - Uhrig-Homburg, Marliese ID - 29057 TI - Option Implied Tax Rate Expectations ER - TY - JOUR AB - Due to the lack of established real-world benchmark suites for static taint analyses of Android applications, evaluations of these analyses are often restricted and hard to compare. Even in evaluations that do use real-world apps, details about the ground truth in those apps are rarely documented, which makes it difficult to compare and reproduce the results. To push Android taint analysis research forward, this paper thus recommends criteria for constructing real-world benchmark suites for this specific domain, and presents TaintBench, the first real-world malware benchmark suite with documented taint flows. TaintBench benchmark apps include taint flows with complex structures, and addresses static challenges that are commonly agreed on by the community. Together with the TaintBench suite, we introduce the TaintBench framework, whose goal is to simplify real-world benchmarking of Android taint analyses. First, a usability test shows that the framework improves experts’ performance and perceived usability when documenting and inspecting taint flows. Second, experiments using TaintBench reveal new insights for the taint analysis tools Amandroid and FlowDroid: (i) They are less effective on real-world malware apps than on synthetic benchmark apps. (ii) Predefined lists of sources and sinks heavily impact the tools’ accuracy. (iii) Surprisingly, up-to-date versions of both tools are less accurate than their predecessors. AU - Luo, Linghui AU - Pauck, Felix AU - Piskachev, Goran AU - Benz, Manuel AU - Pashchenko, Ivan AU - Mory, Martin AU - Bodden, Eric AU - Hermann, Ben AU - Massacci, Fabio ID - 27045 JF - Empirical Software Engineering SN - 1382-3256 TI - TaintBench: Automatic real-world malware benchmarking of Android taint analyses ER - TY - CONF AU - Lugovtsova, Yevgeniya AU - Zeipert, Henning AU - Johannesmann, Sarah AU - Nicolai, Marcel AU - Prager, Jens AU - Henning, Bernd ID - 27847 T2 - МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ В ЕСТЕСТВЕННЫХ НАУКАХ - XXX Всероссийская школа-конференция TI - К ОПРЕДЕЛЕНИЮ ПРОЧНОСТИ КЛЕЕВОГО СОЕДИНЕНИЯ В МНОГОСЛОЙНЫХ МАТЕРИАЛАХ ПУТЕМ ИССЛЕДОВАНИЯ ОБЛАСТЕЙ РАСТАЛКИВАНИЯ БЕГУЩИХ УПРУГИХ ВОЛН ER - TY - JOUR AB - ZusammenfassungLehrkräftekooperation wird generell eine positive Bedeutung in Bezug auf Schul- und Unterrichtsentwicklung zugeschrieben. Dabei sind empirische Belege für eine positive Wirksamkeit nach wie vor kaum vorhanden, es gibt sogar Befunde zu ‚negativen‘ Konsequenzen von Lehrkräftekooperation. Um diese Widersprüchlichkeit zu klären, wurde in der vorliegenden Arbeit Kooperation nicht als Instrument bzw. als Technik betrachtet, sondern als soziale Praxis verstanden, in der eigenlogisches, kollektiv-implizites Wissen (re)produziert wird (Community of Practice). Parallel dazu wurde ein praxeologisches Kompetenzverständnis (Praxiskompetenz) eingeführt, das wesentlich auf die Praxeologie Pierre Bourdieus zurückgeht und den Zusammenhang zwischen Lehrkräftekooperation als Community of Practice und kollektiv strukturierter, individueller Kompetenz theoretisch verdeutlicht. Die empirischen Befunde, welche mittels der Dokumentarischen Methode generiert wurden, verweisen auf die Bedeutung unterschiedlicher Relationslogiken (Nicht-Passung, Entfaltung, Herausforderung) für das ‚Lernen‘ von oder innerhalb von Praxiskompetenz(en) und damit auch auf die Wichtigkeit einer grundlegend kollektiv gerahmten Perspektive auf Lehrkräftekooperation. Vor diesem Hintergrund ist ein allzu positiver Blick auf Lehrkräftekooperationsprozesse kritisch zu betrachten. AU - Bloh, Thiemo ID - 27881 JF - Zeitschrift für Bildungsforschung SN - 2190-6890 TI - Entwicklung von Praxiskompetenz durch Kooperationsprozesse von Lehrkräften ER - TY - JOUR AB - The machine recognition of speech spoken at a distance from the microphones, known as far-field automatic speech recognition (ASR), has received a significant increase of attention in science and industry, which caused or was caused by an equally significant improvement in recognition accuracy. Meanwhile it has entered the consumer market with digital home assistants with a spoken language interface being its most prominent application. Speech recorded at a distance is affected by various acoustic distortions and, consequently, quite different processing pipelines have emerged compared to ASR for close-talk speech. A signal enhancement front-end for dereverberation, source separation and acoustic beamforming is employed to clean up the speech, and the back-end ASR engine is robustified by multi-condition training and adaptation. We will also describe the so-called end-to-end approach to ASR, which is a new promising architecture that has recently been extended to the far-field scenario. This tutorial article gives an account of the algorithms used to enable accurate speech recognition from a distance, and it will be seen that, although deep learning has a significant share in the technological breakthroughs, a clever combination with traditional signal processing can lead to surprisingly effective solutions. AU - Haeb-Umbach, Reinhold AU - Heymann, Jahn AU - Drude, Lukas AU - Watanabe, Shinji AU - Delcroix, Marc AU - Nakatani, Tomohiro ID - 21065 IS - 2 JF - Proceedings of the IEEE TI - Far-Field Automatic Speech Recognition VL - 109 ER - TY - CONF AU - Kucklick, Jan-Peter AU - Müller, Oliver ID - 21204 T2 - The AAAI-21 Workshop on Knowledge Discovery from Unstructured Data in Financial Services TI - A Comparison of Multi-View Learning Strategies for Satellite Image-based Real Estate Appraisal ER - TY - JOUR AB - We present a flexible trust region descend algorithm for unconstrained and convexly constrained multiobjective optimization problems. It is targeted at heterogeneous and expensive problems, i.e., problems that have at least one objective function that is computationally expensive. The method is derivative-free in the sense that neither need derivative information be available for the expensive objectives nor are gradients approximated using repeated function evaluations as is the case in finite-difference methods. Instead, a multiobjective trust region approach is used that works similarly to its well-known scalar pendants. Local surrogate models constructed from evaluation data of the true objective functions are employed to compute possible descent directions. In contrast to existing multiobjective trust region algorithms, these surrogates are not polynomial but carefully constructed radial basis function networks. This has the important advantage that the number of data points scales linearly with the parameter space dimension. The local models qualify as fully linear and the corresponding general scalar framework is adapted for problems with multiple objectives. Convergence to Pareto critical points is proven and numerical examples illustrate our findings. AU - Berkemeier, Manuel Bastian AU - Peitz, Sebastian ID - 21337 IS - 2 JF - Mathematical and Computational Applications TI - Derivative-Free Multiobjective Trust Region Descent Method Using Radial Basis Function Surrogate Models VL - 26 ER - TY - JOUR AU - Frese, Daniel AU - Wei, Qunshuo AU - Wang, Yongtian AU - Cinchetti, Mirko AU - Huang, Lingling AU - Zentgraf, Thomas ID - 21475 IS - 4 JF - ACS Photonics SN - 2330-4022 TI - Nonlinear Bicolor Holography Using Plasmonic Metasurfaces VL - 8 ER - TY - CONF AB - Services often consist of multiple chained components such as microservices in a service mesh, or machine learning functions in a pipeline. Providing these services requires online coordination including scaling the service, placing instance of all components in the network, scheduling traffic to these instances, and routing traffic through the network. Optimized service coordination is still a hard problem due to many influencing factors such as rapidly arriving user demands and limited node and link capacity. Existing approaches to solve the problem are often built on rigid models and assumptions, tailored to specific scenarios. If the scenario changes and the assumptions no longer hold, they easily break and require manual adjustments by experts. Novel self-learning approaches using deep reinforcement learning (DRL) are promising but still have limitations as they only address simplified versions of the problem and are typically centralized and thus do not scale to practical large-scale networks. To address these issues, we propose a distributed self-learning service coordination approach using DRL. After centralized training, we deploy a distributed DRL agent at each node in the network, making fast coordination decisions locally in parallel with the other nodes. Each agent only observes its direct neighbors and does not need global knowledge. Hence, our approach scales independently from the size of the network. In our extensive evaluation using real-world network topologies and traffic traces, we show that our proposed approach outperforms a state-of-the-art conventional heuristic as well as a centralized DRL approach (60% higher throughput on average) while requiring less time per online decision (1 ms). AU - Schneider, Stefan Balthasar AU - Qarawlus, Haydar AU - Karl, Holger ID - 21543 KW - network management KW - service management KW - coordination KW - reinforcement learning KW - distributed T2 - IEEE International Conference on Distributed Computing Systems (ICDCS) TI - Distributed Online Service Coordination Using Deep Reinforcement Learning ER -