@inproceedings{16837,
  author       = {{Lüttenberg, Hedda}},
  booktitle    = {{Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. DESRIST 2020}},
  editor       = {{Hofmann, Sara and Müller, Oliver and Rossi, Matti}},
  issn         = {{1611-3349}},
  location     = {{Kristiansand, Norway}},
  publisher    = {{Springer}},
  title        = {{{PS³—A Domain-specific Modeling Language for Platform-based Smart Service Systems}}},
  doi          = {{10.1007/978-3-030-64823-7_42}},
  volume       = {{12388}},
  year         = {{2020}},
}

@article{16839,
  author       = {{Sain, Basudeb and Zentgraf, Thomas}},
  issn         = {{2047-7538}},
  journal      = {{Light: Science & Applications}},
  pages        = {{67}},
  title        = {{{Metasurfaces help lasers to mode-lock}}},
  doi          = {{10.1038/s41377-020-0312-1}},
  volume       = {{9}},
  year         = {{2020}},
}

@article{16848,
  author       = {{Javed, Muhammad Ali and Rüther, Moritz and Baumhögger, Elmar and Vrabec, Jadran}},
  issn         = {{0021-9568}},
  journal      = {{Journal of Chemical & Engineering Data}},
  title        = {{{Density and Thermodynamic Speed of Sound of Liquid Vinyl Chloride}}},
  doi          = {{10.1021/acs.jced.9b01133}},
  year         = {{2020}},
}

@article{16862,
  author       = {{Bohn, Nicolai and Kundisch, Dennis}},
  journal      = {{Information & Management}},
  number       = {{6}},
  title        = {{{What Are We Talking About When We Talk About Technology Pivots? – A Delphi Study}}},
  volume       = {{57}},
  year         = {{2020}},
}

@article{16873,
  author       = {{Peitz, Christian and Feng, Yuanhua and Gilroy, Bernard Michael and Stöckmann, Nico}},
  journal      = {{Asian Economic and Financial Review}},
  number       = {{4}},
  pages        = {{427--438}},
  publisher    = {{Asian Economic and Social Society}},
  title        = {{{The Shanghai-Hong Kong Stock Connect: An Application of the Semi-CGARCH and Semi-EGARCH}}},
  volume       = {{10}},
  year         = {{2020}},
}

@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}},
}

@article{16902,
  abstract     = {{The maintenance of efficient and robust overlay networks is one
of the most fundamental and reoccurring themes in networking.
This paper presents a survey of state-of-the-art 
algorithms to design and repair overlay networks in a distributed
manner. In particular, we discuss basic algorithmic primitives
to preserve connectivity, review algorithms for the fundamental
problem of graph linearization, and then survey self-stabilizing
algorithms for metric and scalable topologies. 
We also identify open problems and avenues for future research.
}},
  author       = {{Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}},
  journal      = {{ACM Computing Surveys}},
  publisher    = {{ACM}},
  title        = {{{Survey on Algorithms for Self-Stabilizing Overlay Networks}}},
  doi          = {{10.1145/3397190}},
  year         = {{2020}},
}

@inproceedings{16903,
  abstract     = {{We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\delta(v) \in \{0,\ldots T-1\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.
As is standard in clock synchronization, we assume \emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\{0,\ldots,T-1\}$).
We give an asymptotically optimal algorithm that runs in $4D + \Bigl\lfloor \frac{D}{\lfloor T/4 \rfloor} \Bigr \rfloor \cdot (T \mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.
Once all nodes are in sync, they beep at the same round every $T$ rounds.
The algorithm drastically improves on the $O(T D)$-bound of \cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).
Our algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\lceil \log T \rceil$ bits needed to maintain the clock.
Furthermore we investigate the complexity of \emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\Omega(\max\{T,n\})$ rounds on the runtime and $\Omega(\log(\max\{T,n\}))$ bits of memory required for any such protocol.
Afterwards we present a protocol that runs in $O(\max\{T,n\})$ rounds using at most $O(\log(\max\{T,n\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.}},
  author       = {{Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  publisher    = {{ACM}},
  title        = {{{Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}}},
  doi          = {{10.1145/3350755.3400246}},
  year         = {{2020}},
}

@phdthesis{16910,
  author       = {{Stroh-Maraun, Nadja}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Mechanisms, Preferences, and Heterogeneity in Matching Markets}}},
  doi          = {{10.17619/UNIPB/1-958}},
  year         = {{2020}},
}

@article{16931,
  author       = {{Zhou, Hongqiang and Sain, Basudeb and Wang, Yongtian and Schlickriede, Christian and Zhao, Ruizhe and Zhang, Xue and Wei, Qunshuo and Li, Xiaowei and Huang, Lingling and Zentgraf, Thomas}},
  issn         = {{1936-0851}},
  journal      = {{ACS Nano}},
  number       = {{5}},
  pages        = {{5553–5559}},
  title        = {{{Polarization-Encrypted Orbital Angular Momentum Multiplexed Metasurface Holography}}},
  doi          = {{10.1021/acsnano.9b09814}},
  volume       = {{14}},
  year         = {{2020}},
}

@inproceedings{16933,
  abstract     = {{The continuous innovation of its business models is an important task for a company to stay competitive. During this process, the company has to validate various hypotheses about its business models by adapting to uncertain and changing customer needs effectively and efficiently. This adaptation, in turn, can be supported by the concept of Software Product Lines (SPLs). SPLs reduce the time to market by deriving products for customers with changing requirements using a common set of features, structured as a feature model. Analogously, we support the process of business model adaptation by applying the engineering process of SPLs to the structure of the Business Model Canvas (BMC). We call this concept a Business Model Decision Line (BMDL). The BMDL matches business domain knowledge in the form of a feature model with customer needs to derive hypotheses about the business model together with experiments for validation. Our approach is effective by providing a comprehensive overview of possible business model adaptations and efficient by reusing experiments for different hypotheses. We implement our approach in a tool and illustrate the usefulness with an example of developing business models for a mobile application.}},
  author       = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}},
  booktitle    = {{Proceedings of the 22nd IEEE International Conference on Business Informatics}},
  keywords     = {{Business Model Decision Line, Business Model Adaptation, Hypothesis-driven Adaptation, Software Product Line, Feature Model}},
  location     = {{Antwerp}},
  publisher    = {{IEEE}},
  title        = {{{Hypothesis-driven Adaptation of Business Models based on Product Line Engineering}}},
  doi          = {{10.1109/CBI49978.2020.00022}},
  year         = {{2020}},
}

@inproceedings{16934,
  abstract     = {{To build successful products, the developers have to adapt their product features and business models to uncertain customer needs. This adaptation is part of the research discipline of Hypotheses Engineering (HE) where customer needs can be seen as hypotheses that need to be tested iteratively by conducting experiments together with the customer. So far, modeling support and associated traceability of this iterative process are missing. Both, in turn, are important to document the adaptation to the customer needs and identify experiments that provide most evidence to the customer needs. To target this issue, we introduce a model-based HE approach with a twofold contribution: First, we develop a modeling language that models hypotheses and experiments as interrelated hierarchies together with a mapping between them. While the hypotheses are labeled with a score level of their current evidence, the experiments are labeled with a score level of maximum evidence that can be achieved during conduction. Second, we provide an iterative process to determine experiments that offer the most evidence improvement to the modeled hypotheses. We illustrate the usefulness of the approach with an example of testing the business model of a mobile application.}},
  author       = {{Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor}},
  booktitle    = {{Business Modeling and Software Design}},
  editor       = {{Shishkov, Boris}},
  keywords     = {{Hypothesis Engineering, Model-based, Customer Need Adaptation, Business Model, Product Features}},
  location     = {{Potsdam}},
  pages        = {{276--286}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs}}},
  doi          = {{10.1007/978-3-030-52306-0_18}},
  volume       = {{391}},
  year         = {{2020}},
}

@article{16936,
  author       = {{Bohn, Nicolai and Kundisch, Dennis}},
  journal      = {{Wirtschaftsinformatik & Management}},
  number       = {{4}},
  pages        = {{290--297}},
  title        = {{{Technologie Pivots – Warum und wie digitale Startups ihr Technologiedesign umfassend anpassen}}},
  volume       = {{12}},
  year         = {{2020}},
}

@inproceedings{16939,
  author       = {{Triebus, Marcel and Tröster, Thomas}},
  booktitle    = {{Proceedings 4th International Conference Hybrid Materials & Structures}},
  location     = {{Web-Conference}},
  title        = {{{A Holistic Approach to Optimization-Based Design of Hybrid Materials}}},
  year         = {{2020}},
}

@article{16944,
  author       = {{Schlickriede, Christian and Kruk, Sergey S. and Wang, Lei and Sain, Basudeb and Kivshar, Yuri and Zentgraf, Thomas}},
  issn         = {{1530-6984}},
  journal      = {{Nano Letters}},
  number       = {{6}},
  pages        = {{4370–4376}},
  title        = {{{Nonlinear imaging with all-dielectric metasurfaces}}},
  doi          = {{10.1021/acs.nanolett.0c01105}},
  volume       = {{20}},
  year         = {{2020}},
}

@inproceedings{16946,
  author       = {{Wolf, Verena}},
  booktitle    = {{Proceedings of the 28th European Conference on Information Systems}},
  location     = {{Marrakech, Morroco}},
  title        = {{{Understanding Smart Service Systems Transformation – A Socio-Technical Perspective}}},
  year         = {{2020}},
}

@inproceedings{16947,
  author       = {{Weinzierl, Sven and Wolf, Verena and Pauli, Tobias and Beverungen, Daniel and Matzner, Martin}},
  booktitle    = {{Proceedings of the 28th European Conference on Information Systems}},
  location     = {{Marrakech, Morroco}},
  title        = {{{Detecting Workarounds in Business Processes — A Deep Learning Method for Analyzing Event Logs}}},
  year         = {{2020}},
}

@inproceedings{16951,
  author       = {{Seutter, Janina and Neumann, Jürgen}},
  booktitle    = {{Proceedings of the 28th European Conference on Information Systems (ECIS)}},
  location     = {{Virtual Conference/Workshop}},
  title        = {{{Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior}}},
  year         = {{2020}},
}

@inproceedings{16952,
  author       = {{Poniatowski, Martin and Neumann, Jürgen}},
  booktitle    = {{Proceedings of the 28th European Conference on Information Systems (ECIS)}},
  location     = {{Virtual Conference/Workshop}},
  title        = {{{Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior}}},
  year         = {{2020}},
}

@unpublished{16953,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The C-type lectin receptor langerin plays a vital role in the mammalian defense against invading pathogens. Its function hinges on the affinity to its co-factor Ca<jats:sup>2+</jats:sup> which in turn is regulated by the pH. We studied the structural consequences of pro-tonating the allosteric pH-sensor histidine H294 by molecular dynamics simulations (total simulation time: about 120 μs) and Markov models. We discovered a mechanism in which the signal that the pH has dropped is transferred to the Ca<jats:sup>2+</jats:sup>-binding site without transferring the initial proton. Instead, protonation of H294 unlocks a conformation in which a protonated lysine side-chain forms a hydrogen bond with a Ca<jats:sup>2+</jats:sup>-coordinating aspartic acid. This destabilizes Ca<jats:sup>2+</jats:sup> in the binding pocket, which we probed by steered molecular dynamics. After Ca<jats:sup>2+</jats:sup>-release, the proton is likely transferred to the aspartic acid and stabilized by a dyad with a nearby glutamic acid, triggering a conformational transition and thus preventing Ca<jats:sup>2+</jats:sup>-rebinding.</jats:p>}},
  author       = {{Joswig, Jan-O. and Anders, Jennifer and Zhang, Hengxi and Rademacher, Christoph and Keller, Bettina G.}},
  booktitle    = {{bioRxiv}},
  keywords     = {{pc2-ressources}},
  title        = {{{Molecular Mechanism of the pH-Dependent Calcium Affinity in Langerin}}},
  year         = {{2020}},
}

