@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}}, } @article{17375, author = {{Zhou, Jiaqi and Khazaei, Mohammad and Ranjbar, Ahmad and Wang, Vei and Kühne, Thomas D. and Ohno, Kaoru and Kawazoe, Yoshiyuki and Liang, Yunye}}, journal = {{J. Mater. Chem. C}}, pages = {{5211--5221}}, publisher = {{The Royal Society of Chemistry}}, title = {{{Modulation of nearly free electron states in hydroxyl-functionalized MXenes: a first-principles study}}}, doi = {{10.1039/C9TC06837F}}, volume = {{8}}, year = {{2020}}, } @article{17379, author = {{Kumar Sahoo, Sudhir and Heske, Julian Joachim and Azadi, Sam and Zhang, Zhenzhe and V Tarakina, Nadezda and Oschatz, Martin and Z. Khaliullin, Rustam and Antonietti, Markus and Kühne, Thomas}}, journal = {{Scientific Reports}}, number = {{1}}, title = {{{On the Possibility of Helium Adsorption in Nitrogen Doped Graphitic Materials}}}, doi = {{10.1038/s41598-020-62638-z}}, volume = {{10}}, year = {{2020}}, } @article{17381, author = {{Elgabarty, Hossam and Kampfrath, Tobias and Bonthuis, Douwe Jan and Balos, Vasileios and Kaliannan, Naveen Kumar and Loche, Philip and Netz, Roland R. and Wolf, Martin and K{\, Thomas D. and Sajadi, Mohsen}}, journal = {{Science Advances}}, number = {{17}}, publisher = {{American Association for the Advancement of Science}}, title = {{{Energy transfer within the hydrogen bonding network of water following resonant terahertz excitation}}}, doi = {{10.1126/sciadv.aay7074}}, volume = {{6}}, year = {{2020}}, } @article{17382, author = {{Rengaraj, Varadarajan and Lass, Michael and Plessl, Christian and Kühne, Thomas D.}}, issn = {{2079-3197}}, journal = {{Computation}}, number = {{2}}, pages = {{39}}, publisher = {{MDPI AG}}, title = {{{Accurate Sampling with Noisy Forces from Approximate Computing}}}, doi = {{10.3390/computation8020039}}, volume = {{8}}, year = {{2020}}, } @article{17384, author = {{Elgabarty, Hossam and Kühne, Thomas D.}}, journal = {{Phys. Chem. Chem. Phys.}}, pages = {{10397--10411}}, publisher = {{The Royal Society of Chemistry}}, title = {{{Tumbling with a limp: local asymmetry in water's hydrogen bond network and its consequences}}}, doi = {{10.1039/C9CP06960G}}, volume = {{22}}, year = {{2020}}, } @article{17386, author = {{Kühne, Thomas D. and Iannuzzi, Marcella and Del Ben, Mauro and Rybkin, Vladimir V. and Seewald, Patrick and Stein, Frederick and Laino, Teodoro and Khaliullin, Rustam Z. and Schütt, Ole and Schiffmann, Florian and al., et}}, issn = {{1089-7690}}, journal = {{The Journal of Chemical Physics}}, number = {{19}}, pages = {{194103}}, publisher = {{AIP Publishing}}, title = {{{CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations}}}, doi = {{10.1063/5.0007045}}, volume = {{152}}, year = {{2020}}, } @article{17390, author = {{Chantakit, Teanchai and Schlickriede, Christian and Sain, Basudeb and Meyer, Fabian and Weiss, Thomas and Chattham, Nattaporn and Zentgraf, Thomas}}, issn = {{2327-9125}}, journal = {{Photonics Research}}, number = {{9}}, pages = {{1435--1440}}, publisher = {{OSA}}, title = {{{All-dielectric silicon metalens for two-dimensional particle manipulation in optical tweezers}}}, doi = {{10.1364/prj.389200}}, volume = {{8}}, year = {{2020}}, } @inproceedings{17398, author = {{Turcanu, Ion and Engel, Thomas and Sommer, Christoph}}, booktitle = {{2019 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781728145716}}, title = {{{Fog Seeding Strategies for Information-Centric Heterogeneous Vehicular Networks}}}, doi = {{10.1109/vnc48660.2019.9062816}}, year = {{2020}}, } @inproceedings{17405, author = {{Frank, Maximilian and Gausemeier, Juergen and Hennig-Cardinal von Widdern, Nils and Koldewey, Christian and Menzefricke, Joern Steffen and Reinhold, Jannik}}, booktitle = {{Proceedings of the ISPIM connects}}, publisher = {{International Society for Professional Innovation Management (ISPIM)}}, title = {{{A reference process for the Smart Service business: development and practical implications}}}, year = {{2020}}, }