@article{16879,
author = {Gilroy, Bernard Michael and Peitz, Christian},
journal = {WISU – Das Wirtschaftsstudium},
number = {1},
pages = {94},
title = {{Die Niedrigzinspolitik der Europäischen Zentralbank}},
year = {2020},
}
@unpublished{16898,
abstract = {Electronic structure calculations based on density-functional theory (DFT)
represent a significant part of today's HPC workloads and pose high demands on
high-performance computing resources. To perform these quantum-mechanical DFT
calculations on complex large-scale systems, so-called linear scaling methods
instead of conventional cubic scaling methods are required. In this work, we
take up the idea of the submatrix method and apply it to the DFT computations
in the software package CP2K. For that purpose, we transform the underlying
numeric operations on distributed, large, sparse matrices into computations on
local, much smaller and nearly dense matrices. This allows us to exploit the
full floating-point performance of modern CPUs and to make use of dedicated
accelerator hardware, where performance has been limited by memory bandwidth
before. We demonstrate both functionality and performance of our implementation
and show how it can be accelerated with GPUs and FPGAs.},
author = {Lass, Michael and Schade, Robert and Kühne, Thomas and Plessl, Christian},
title = {{A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K}},
year = {2020},
}
@unpublished{16747,
abstract = {Let $\phi_c(G)$ be the circular flow number of a bridgeless graph $G$. In [Edge-colorings and circular flow numbers of regular graphs, J. Graph Theory 79 (2015) 1-7] it was proved that, for every $t \geq 1$, $G$ is a bridgeless $(2t+1)$-regular graph with $\phi_c(G) \in \{2+\frac{1}{t}, 2 + \frac{2}{2t-1}\}$ if and only if $G$ has a perfect matching $M$ such that $G-M$ is bipartite. This implies that $G$ is a class 1 graph. For $t=1$, all graphs with circular flow number bigger than 4 are class 2 graphs. We show for all $t \geq 1$, that $2 + \frac{2}{2t-1} = \inf \{ \phi_c(G)\colon G \text{ is a } (2t+1) \text{-regular class } 2 \text{ graph}\}$. This was conjectured to be true in [Edge-colorings and circular flow numbers of regular graphs, J. Graph Theory 79 (2015) 1-7]. Moreover we prove that $\inf\{ \phi_c(G)\colon G $ is a $ (2t+1)$-regular class $1$ graph with no perfect matching whose removal leaves a bipartite graph$ \} = 2 + \frac{2}{2t-1}$. We further disprove the conjecture that every $(2t+1)$-regular class $1$ graph has circular flow number at most $2+\frac{2}{t}$.},
author = {Mattiolo, Davide and Steffen, Eckhard},
booktitle = {arXiv:2001.02484},
title = {{Edge colorings and circular flows on regular graphs}},
year = {2020},
}
@inproceedings{16800,
author = {Bartelheimer, Christian and Wolf, Verena and Langhorst, Nico and Seegers, Florian},
booktitle = {Proceedings of the 15th International Conference on Design Science Research in Information Systems and Technology},
title = {{Designing Digital Community Service Platforms for Crowd-Based Services in Urban Areas}},
year = {2020},
}
@inproceedings{3878,
author = {El Baff, Roxanne and Wachsmuth, Henning and Al-Khatib, Khalid and Stein, Benno},
booktitle = {Proceedings of 58th Annual Meeting of the Association for Computational Linguistics},
editor = {Tsujii, Junichi and Hajic, Jan},
pages = {553--564},
title = {{Analyzing the Persuasive Effect of Style in News Editorial Argumentation}},
year = {2020},
}
@article{16956,
author = {Chatwell, René Spencer and Vrabec, Jadran},
issn = {0021-9606},
journal = {The Journal of Chemical Physics},
keyword = {pc2-ressources},
title = {{Bulk viscosity of liquid noble gases}},
doi = {10.1063/1.5142364},
year = {2020},
}
@inbook{16963,
author = {Kuklinski, Christiane and Leis, Elena and Liebendörfer, Michael and Hochmuth, Reinhard},
booktitle = {Beiträge zum {Mathematikunterricht} 2019 53. {Jahrestagung} der {Gesellschaft} für {Didaktik} der {Mathematik}.},
editor = {Frank, Andreas and Krauss, Stefan and Binder, Karin},
publisher = {WTM-Verlag},
title = {{Erklärung von Mathematikleistung im Ingenieursstudium}},
year = {2020},
}
@inproceedings{17055,
abstract = {Understanding a new literature corpus can be a grueling experience for junior scholars. Nevertheless, corresponding guidelines have not been updated for decades. We contend that the traditional strategy of skimming all papers and reading selected papers afterwards needs to be revised. Therefore, we design a new strategy that guides the overall exploratory process by prioritizing influential papers for initial reading, followed by skimming the remaining papers. Consistent with schemata theory, starting with in-depth reading allows readers to acquire more substantial prior content schemata, which are representa-tive for the literature corpus and useful in the following skimming process. To this end, we develop a prototype that identifies the influential papers from a set of PDFs, which is illustrated in a case study in the IT business value domain. With the new strategy, we envision a more efficient process of exploring unknown literature corpora.},
author = {Wagner, Gerit and Empl, Philipp and Schryen, Guido},
booktitle = {28th European Conference on Information Systems (ECIS 2020)},
keyword = {Reading and skimming, Exploring literature, Review methodology, Design science research, Schemata theory},
title = {{Designing a Novel Strategy for Exploring Literature Corpora}},
year = {2020},
}
@article{17067,
author = {Speiser, Eugen and Esser, Norbert and Halbig, Benedikt and Geurts, Jean and Schmidt, Wolf Gero and Sanna, Simone},
issn = {0167-5729},
journal = {Surface Science Reports},
number = {1},
title = {{Vibrational Raman spectroscopy on adsorbate-induced low-dimensional surface structures}},
doi = {10.1016/j.surfrep.2020.100480},
volume = {75},
year = {2020},
}
@article{17074,
author = {Gries, Thomas and Grundmann, Rainer},
issn = {1363-6669},
journal = {Review of Development Economics},
pages = {644--667},
title = {{Modern sector development: The role of exports and institutions in developing countries}},
doi = {10.1111/rode.12663},
year = {2020},
}