TY - JOUR
AU - Gilroy, Bernard Michael
AU - Peitz, Christian
ID - 16879
IS - 1
JF - WISU – Das Wirtschaftsstudium
TI - Die Niedrigzinspolitik der Europäischen Zentralbank
ER -
TY - GEN
AB - 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.
AU - Lass, Michael
AU - Schade, Robert
AU - Kühne, Thomas
AU - Plessl, Christian
ID - 16898
TI - A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K
ER -
TY - GEN
AB - 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}$.
AU - Mattiolo, Davide
AU - Steffen, Eckhard
ID - 16747
T2 - arXiv:2001.02484
TI - Edge colorings and circular flows on regular graphs
ER -
TY - CONF
AU - Bartelheimer, Christian
AU - Wolf, Verena
AU - Langhorst, Nico
AU - Seegers, Florian
ID - 16800
T2 - Proceedings of the 15th International Conference on Design Science Research in Information Systems and Technology
TI - Designing Digital Community Service Platforms for Crowd-Based Services in Urban Areas
ER -
TY - CONF
AU - El Baff, Roxanne
AU - Wachsmuth, Henning
AU - Al-Khatib, Khalid
AU - Stein, Benno
ED - Tsujii, Junichi
ED - Hajic, Jan
ID - 3878
T2 - Proceedings of 58th Annual Meeting of the Association for Computational Linguistics
TI - Analyzing the Persuasive Effect of Style in News Editorial Argumentation
ER -
TY - JOUR
AU - Chatwell, René Spencer
AU - Vrabec, Jadran
ID - 16956
JF - The Journal of Chemical Physics
KW - pc2-ressources
SN - 0021-9606
TI - Bulk viscosity of liquid noble gases
ER -
TY - CHAP
AU - Kuklinski, Christiane
AU - Leis, Elena
AU - Liebendörfer, Michael
AU - Hochmuth, Reinhard
ED - Frank, Andreas
ED - Krauss, Stefan
ED - Binder, Karin
ID - 16963
T2 - Beiträge zum {Mathematikunterricht} 2019 53. {Jahrestagung} der {Gesellschaft} für {Didaktik} der {Mathematik}.
TI - Erklärung von Mathematikleistung im Ingenieursstudium
ER -
TY - CONF
AB - 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.
AU - Wagner, Gerit
AU - Empl, Philipp
AU - Schryen, Guido
ID - 17055
KW - Reading and skimming
KW - Exploring literature
KW - Review methodology
KW - Design science research
KW - Schemata theory
T2 - 28th European Conference on Information Systems (ECIS 2020)
TI - Designing a Novel Strategy for Exploring Literature Corpora
ER -
TY - JOUR
AU - Speiser, Eugen
AU - Esser, Norbert
AU - Halbig, Benedikt
AU - Geurts, Jean
AU - Schmidt, Wolf Gero
AU - Sanna, Simone
ID - 17067
IS - 1
JF - Surface Science Reports
SN - 0167-5729
TI - Vibrational Raman spectroscopy on adsorbate-induced low-dimensional surface structures
VL - 75
ER -
TY - JOUR
AU - Gries, Thomas
AU - Grundmann, Rainer
ID - 17074
JF - Review of Development Economics
SN - 1363-6669
TI - Modern sector development: The role of exports and institutions in developing countries
ER -