@inbook{21542, abstract = {{Using near-field (NF) scan data to predict the far-field (FF) behaviour of radiating electronic systems represents a novel method to accompany the whole RF design process. This approach involves so-called Huygens' box as an efficient radiation model inside an electromagnetic (EM) simulation tool and then transforms the scanned NF measured data into the FF. For this, the basic idea of the Huygens'box principle and the NF-to-FF transformation are briefly presented. The NF is measured on the Huygens' box around a device under test using anNF scanner, recording the magnitude and phase of the site-related magnetic and electric components. A comparison between a fullwave simulation and the measurement results shows a good similarity in both the NF and the simulated and transformed FF.Thus, this method is applicable to predict the FF behaviour of any electronic system by measuring the NF. With this knowledge, the RF design can be improved due to allowing a significant reduction of EM compatibility failure at the end of the development flow. In addition, the very efficient FF radiation model can be used for detailed investigations in various environments and the impact of such an equivalent radiation source on other electronic systems can be assessed.}}, author = {{Schröder, Dominik and Lange, Sven and Hangmann, Christian and Hedayat, Christian}}, booktitle = {{Tensorial Analysis of Networks (TAN) Modelling for PCB Signal Integrity and EMC Analysis}}, isbn = {{9781839530494}}, keywords = {{Huygens' box, NF-to-FF transformation, efficient FF radiation model, FF behaviour, EMI assessment, PCB, near-field measurements, efficient radiation model, far-field behaviour, RF design process, far-field prediction, Huygens'box principle, fullwave simulation, electronic system radiation, equivalent radiation source, electromagnetic simulation tool, near-field scan data, EM compatibility failure reduction}}, pages = {{315--346 (32)}}, publisher = {{ The Institution of Engineering and Technology (IET)}}, title = {{{Far-field prediction combining simulations with near-field measurements for EMI assessment of PCBs}}}, doi = {{10.1049/pbcs072e_ch14}}, year = {{2020}}, } @inbook{21579, author = {{Berger, Thomas and Lanza, Lukas Johannes}}, booktitle = {{Progress in Differential-Algebraic Equations II}}, isbn = {{9783030539047}}, issn = {{2199-7497}}, title = {{{Observers for Differential-Algebraic Systems with Lipschitz or Monotone Nonlinearities}}}, doi = {{10.1007/978-3-030-53905-4_9}}, year = {{2020}}, } @inproceedings{21584, author = {{Gatica, Carlos Paiz and Platzner, Marco}}, booktitle = {{Machine Learning for Cyber Physical Systems (ML4CPS 2017)}}, isbn = {{9783662590836}}, issn = {{2522-8579}}, title = {{{Adaptable Realization of Industrial Analytics Functions on Edge-Devices using Reconfigurable Architectures}}}, doi = {{10.1007/978-3-662-59084-3_9}}, year = {{2020}}, } @article{21608, author = {{Meschede, Henning}}, issn = {{0960-1481}}, journal = {{Renewable Energy}}, pages = {{1480--1491}}, title = {{{Analysis on the demand response potential in hotels with varying probabilistic influencing time-series for the Canary Islands}}}, doi = {{10.1016/j.renene.2020.06.024}}, year = {{2020}}, } @article{17331, author = {{Graf-Schlattmann, Marcel and Meister, Dorothee M. and Oevel, Gudrun and Wilde, Melanie}}, journal = {{Forschungsperspektiven auf Digitalisierung in Hochschulen, Zeitschrift für Hochschulentwicklung}}, number = {{1}}, title = {{{Kollektive Veränderungsbereitschaft als zentraler Erfolgsfaktor von Digitalisierungsprozessen an Hochschulen}}}, volume = {{15}}, year = {{2020}}, } @article{17335, author = {{Hampel, Uwe and Schubert, Markus and Döß, Alexander and Sohr, Johanna and Vishwakarma, Vineet and Repke, Jens‐Uwe and Gerke, Sören J. and Leuner, Hannes and Rädle, Matthias and Kapoustina, Viktoria and Schmitt, Lucas and Grünewald, Marcus and Brinkmann, Jost H. and Plate, Dominik and Kenig, Eugeny and Lutters, Nicole and Bolenz, Lukas and Buckmann, Felix and Toye, Dominique and Arlt, Wolfgang and Linder, Thomas and Hoffmann, Rainer and Klein, Harald and Rehfeldt, Sebastian and Winkler, Thomas and Bart, Hans‐Jörg and Wirz, Dominic and Schulz, Jonas and Scholl, Stephan and Augustin, Wolfgang and Jasch, Katharina and Schlüter, Florian and Schwerdtfeger, Natalie and Jahnke, Stefan and Jupke, Andreas and Kabatnik, Christoph and Braeuer, Andreas Siegfried and D'Auria, Mirko and Runowski, Thomas and Casal, Maria Francisco and Becker, Karsten and David, Anna‐Lena and Górak, Andrzej and Skiborowski, Mirko and Groß, Kai and Qammar, Hina}}, issn = {{0009-286X}}, journal = {{Chemie Ingenieur Technik}}, pages = {{926--948}}, title = {{{Recent Advances in Experimental Techniques for Flow and Mass Transfer Analyses in Thermal Separation Systems}}}, doi = {{10.1002/cite.202000076}}, volume = {{92}}, year = {{2020}}, } @inbook{17337, author = {{Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}}, booktitle = {{Advanced Information Systems Engineering}}, isbn = {{9783030494346}}, issn = {{0302-9743}}, title = {{{Modeling and Analyzing Architectural Diversity of Open Platforms}}}, doi = {{10.1007/978-3-030-49435-3_3}}, year = {{2020}}, } @inbook{17347, abstract = {{Peer-to-Peer news portals allow Internet users to write news articles and make them available online to interested readers. Despite the fact that authors are free in their choice of topics, there are a number of quality characteristics that an article must meet before it is published. In addition to meaningful titles, comprehensibly written texts and meaning- ful images, relevant tags are an important criteria for the quality of such news. In this case study, we discuss the challenges and common mistakes that Peer-to-Peer reporters face when tagging news and how incorrect information can be corrected through the orchestration of existing Natu- ral Language Processing services. Lastly, we use this illustrative example to give insight into the challenges of dealing with bottom-up taxonomies.}}, author = {{Bäumer, Frederik Simon and Kersting, Joschka and Buff, Bianca and Geierhos, Michaela}}, booktitle = {{Information and Software Technologies}}, editor = {{Audrius, Lopata and Rita, Butkienė and Daina, Gudonienė and Vilma, Sukackė}}, location = {{Kaunas, Litauen}}, pages = {{368----382}}, publisher = {{Springer}}, title = {{{Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging}}}, doi = {{https://doi.org/10.1007/978-3-030-59506-7_30}}, volume = {{1283}}, year = {{2020}}, } @inproceedings{17348, author = {{Kucklick, Jan-Peter and Müller, Oliver}}, booktitle = {{Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)}}, title = {{{Location, location, location: Satellite image-based real-estate appraisal}}}, year = {{2020}}, } @inproceedings{17349, author = {{Grabo, Matti and Staggenborg, Christoph and Kenig, Eugeny}}, location = {{Frankfurt am Main}}, title = {{{Modellierung und Optimierung makroverkapselter Latentwärmespeicherelemente für ein luftgeführtes Wärmespeichersystem}}}, year = {{2020}}, } @inbook{17352, author = {{Moritzer, Elmar and Hüttner, Matthias and Henning, Bernd and Webersen, Manuel}}, booktitle = {{Advances in Polymer Processing 2020}}, editor = {{Hopmann, Christian and Dahlmann, Rainer}}, isbn = {{9783662608081}}, location = {{Aachen}}, publisher = {{Springer}}, title = {{{The Influence of Hydrothermal Aging on the Material Properties of Continuous Fiber-Reinforced Thermoplastics and its Non-Destructive Characterization}}}, doi = {{10.1007/978-3-662-60809-8_16}}, year = {{2020}}, } @article{17358, abstract = {{Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework.}}, author = {{Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}}, issn = {{1557-9999}}, journal = {{IEEE Transactions On Very Large Scale Integration Systems}}, keywords = {{Approximate circuit synthesis, approximate computing, error metrics, formal verification, proof-carrying hardware}}, number = {{9}}, pages = {{2084 -- 2088}}, publisher = {{IEEE}}, title = {{{Proof-carrying Approximate Circuits}}}, doi = {{10.1109/TVLSI.2020.3008061}}, volume = {{28}}, year = {{2020}}, } @article{17359, abstract = {{In this article, we focus on the acceleration of a chemical reaction simulation that relies on a system of stiff ordinary differential equation (ODEs) targeting heterogeneous computing systems with CPUs and field-programmable gate arrays (FPGAs). Specifically, we target an essential kernel of the coupled chemistry aerosol-tracer transport model to the Brazilian developments on the regional atmospheric modeling system (CCATT-BRAMS). We focus on a linear solve step using the QR factorization based on the modified Gram-Schmidt method as the basis of the ODE solver in this application. We target Intel hardware accelerator research program (HARP) architecture with the OpenCL programming environment for these early experiments. Our design exploration reveals a hardware design that is up to 4 times faster than the original iterative Jacobi method used in this solver. Still, even with hardware support, the overall performance of our QR-based hardware is lower than its original software version.}}, author = {{Alberto Oliveira de Souza Junior, Carlos and Bispo, João and Cardoso, João M. P. and Diniz, Pedro C. and Marques, Eduardo}}, issn = {{2079-9292}}, journal = {{Electronics}}, keywords = {{pc2-harp-ressources}}, title = {{{Exploration of FPGA-Based Hardware Designs for QR Decomposition for Solving Stiff ODE Numerical Methods Using the HARP Hybrid Architecture}}}, doi = {{10.3390/electronics9050843}}, year = {{2020}}, } @article{17361, author = {{Johansson-Pajala, Rose-Marie and Thommes, Kirsten and Hoppe, Julia Amelie and Tuisku, Outi and Hennala, Lea and Pekkarinen, Satu and Melkas, Helina and Gustafsson, Christine}}, journal = {{International Journal of Social Robotics}}, pages = {{1--15}}, title = {{{Care Robot Orientation: What, Who and How? Potential Users` Perceptions}}}, doi = {{10.1007/s12369-020-00619-y}}, year = {{2020}}, } @article{17366, author = {{Hoppe, Julia Amelie and Johansson-Pajala, Rose-Marie and Gustafsson, Christine and Melkas, Helinä and Tusku, Outi and Pekkarinen, Satu and Hennala, Lea}}, issn = {{2364-9208}}, journal = {{Industrie 4.0 Management}}, title = {{{Technologieorientierung zu Assistenzrobotik – Welche Akzeptanz besteht bei der Einführung von Assistenzrobotik für die Pflege älterer Menschen?}}}, volume = {{2}}, year = {{2020}}, } @inbook{17367, author = {{Hoppe, Julia Amelie and Johansson-Pajala, Rose-Marie and Gustafsson, Christine and Melkas, Helinä and Tusku, Outi and Pekkarinen, Satu and Hennala, Lea and Thommes, Kirsten}}, booktitle = {{Aging between Participation and Simulation - Ethical Dimensions of Socially Assistive Technologies in elderly care }}, editor = {{Haltaufderheide, Joschka and Hovemann, Johanna and Vollmann, Jochen}}, pages = {{139--156}}, publisher = {{De Gruyter}}, title = {{{Assistive robots in care: Expectations and perceptions of older people}}}, doi = {{10.1515/9783110677485-009}}, year = {{2020}}, } @inproceedings{17368, author = {{Vorbohle, Christian and Szopinski, Daniel and Kundisch, Dennis}}, editor = {{Shishkov, B.}}, isbn = {{978-3-030-52305-3}}, location = {{Potsdam, Germany}}, publisher = {{Springer}}, title = {{{Business Model Dependencies: Towards conceptualizing dependencies for extending modeling languages for business models}}}, volume = {{391}}, year = {{2020}}, } @article{17369, author = {{Ho, Nam and Kaufmann, Paul and Platzner, Marco}}, journal = {{International Journal of Hybrid intelligent Systems}}, publisher = {{IOS Press}}, title = {{{Evolution of Application-Specific Cache Mappings}}}, year = {{2020}}, } @inproceedings{17370, abstract = {{ We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \( S \) of commodities. Ravi and Sinha (SODA 2004) introduced the model as the \emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem. The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances. In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$. A request has to be connected to a set of facilities jointly offering the commodities demanded by it. In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each. To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time. We present results regarding the competitive ratio. On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \( \Omega ( \sqrt{|S|} + \frac{\log n}{\log \log n} ) \) that already holds for simple line metrics. Here, \( n \) is the number of requests. On the other side, we establish a deterministic \( \mathcal{O}(\sqrt{|S|} \cdot \log n) \)-competitive algorithm and a randomized \( \mathcal{O}(\sqrt{|S|} \cdot \frac{\log n}{\log \log n} ) \)-competitive algorithm. Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.}}, author = {{Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}}, isbn = {{9781450369350}}, keywords = {{Online Multi-Commodity Facility Location, Competitive Ratio, Online Optimization, Facility Location Problem}}, title = {{{The Online Multi-Commodity Facility Location Problem}}}, doi = {{10.1145/3350755.3400281}}, year = {{2020}}, } @inproceedings{17371, author = {{Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}}, isbn = {{9781450369350}}, title = {{{Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up}}}, doi = {{10.1145/3350755.3400263}}, year = {{2020}}, }