@article{16095,
  author       = {{Krimphove, Dieter}},
  issn         = {{0034-1398}},
  journal      = {{Rechtstheorie}},
  number       = {{1}},
  pages        = {{107--113}},
  publisher    = {{Duncker&Humblot}},
  title        = {{{Die „Logik“ der Überzeugungskraft}}},
  volume       = {{50}},
  year         = {{2020}},
}

@article{16100,
  author       = {{Prince, Nicholas R. and Bruce Prince, J. and Kabst, Rüdiger}},
  issn         = {{1090-9516}},
  journal      = {{Journal of World Business}},
  number       = {{3}},
  title        = {{{National culture and incentives: Are incentive practices always good?}}},
  doi          = {{10.1016/j.jwb.2020.101075}},
  volume       = {{55}},
  year         = {{2020}},
}

@inproceedings{16116,
  author       = {{Purrmann, Maren and Wünderlich, Nancy}},
  booktitle    = {{Proceedings of the 2020 AMA Winter Academic Conference}},
  location     = {{San Diego, CA, USA}},
  title        = {{{How to Build Trust on Peer-to-Peer Platforms: An Investigation of the Antecedents of Peer and Platform Trust}}},
  year         = {{2020}},
}

@article{16197,
  abstract     = {{Nonlinear Pancharatnam–Berry phase metasurfaces facilitate the nontrivial phase modulation for frequency conversion processes by leveraging photon‐spin dependent nonlinear geometric‐phases. However, plasmonic metasurfaces show some severe limitation for nonlinear frequency conversion due to the intrinsic high ohmic loss and low damage threshold of plasmonic nanostructures. Here, the nonlinear geometric‐phases associated with the third‐harmonic generation process occurring in all‐dielectric metasurfaces is studied systematically, which are composed of silicon nanofins with different in‐plane rotational symmetries. It is found that the wave coupling among different field components of the resonant fundamental field gives rise to the appearance of different nonlinear geometric‐phases of the generated third‐harmonic signals. The experimental observations of the nonlinear beam steering and nonlinear holography realized in this work by all‐dielectric geometric‐phase metasurfaces are well explained with the developed theory. This work offers a new physical picture to understand the nonlinear optical process occurring at nanoscale dielectric resonators and will help in the design of nonlinear metasurfaces with tailored phase properties.}},
  author       = {{Liu, Bingyi and Sain, Basudeb and Reineke, Bernhard and Zhao, Ruizhe and Meier, Cedrik and Huang, Lingling and Jiang, Yongyuan and Zentgraf, Thomas}},
  issn         = {{2195-1071}},
  journal      = {{Advanced Optical Materials}},
  number       = {{9}},
  publisher    = {{Wiley}},
  title        = {{{Nonlinear Wavefront Control by Geometric-Phase Dielectric Metasurfaces: Influence of Mode Field and Rotational Symmetry}}},
  doi          = {{10.1002/adom.201902050}},
  volume       = {{8}},
  year         = {{2020}},
}

@inproceedings{16203,
  author       = {{Bolenz, Lukas and Gutperl, Sven and Toye, Dominique and Scholl, Stephan and Kenig, Eugeny}},
  location     = {{Berchtesgaden}},
  title        = {{{Beschreibung der Rektifikation viskoser Systeme mit Hydrodynamischen Analogien}}},
  year         = {{2020}},
}

@inproceedings{16204,
  author       = {{Gutperl, Sven and Bolenz, Lukas and Kriese, Friederike  and Jasch, Katharina and Kenig, Eugeny and Scholl, Stephan}},
  location     = {{Berchtesgaden}},
  title        = {{{Simulation und Bewertung eines Anlagenkonzepts für Trennleistungsmessungen mit nicht-verdampfenden Komponenten}}},
  year         = {{2020}},
}

@inproceedings{16207,
  author       = {{Heine, Jens and Wecker, Christian and Kenig, Eugeny and Bart, Hans-Joerg}},
  publisher    = {{Jahrestreffen der ProcessNet-Fachgruppe Extraktion}},
  title        = {{{Stofftransportmessung am ruhenden und bewegten Einzeltropfen}}},
  year         = {{2020}},
}

@inproceedings{16208,
  author       = {{Wecker, Christian and Schulz, Andreas and Heine, Jens and Bart, Hans-Joerg and Kenig, Eugeny}},
  publisher    = {{Jahrestreffen der ProcessNet-Fachgruppe Extraktion}},
  title        = {{{CFD-basierte Untersuchung stofftransportinduzierter Marangoni-konvektion in Flüssig-Flüssig-Systemen}}},
  year         = {{2020}},
}

@inproceedings{16213,
  abstract     = {{Automated synthesis of approximate circuits via functional approximations is of prominent importance to provide efficiency in energy, runtime, and chip area required to execute an application. Approximate circuits are usually obtained either through analytical approximation methods leveraging approximate transformations such as bit-width scaling or via iterative search-based optimization methods when a library of approximate components, e.g., approximate adders and multipliers, is available. For the latter, exploring the extremely large design space is challenging in terms of both computations and quality of results. While the combination of both methods can create more room for further approximations, the \textit{Design Space Exploration}~(DSE) becomes a crucial issue. In this paper, we present such a hybrid synthesis methodology that applies a low-cost analytical method followed by parallel stochastic search-based optimization. We address the DSE challenge through efficient pruning of the design space and skipping unnecessary expensive testing and/or verification steps. The experimental results reveal up to 10.57x area savings in comparison with both purely analytical or search-based approaches. }},
  author       = {{Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}},
  booktitle    = {{Proceedings of the 30th ACM Great Lakes Symposium on VLSI (GLSVLSI) 2020}},
  location     = {{Beijing, China}},
  pages        = {{421--426}},
  publisher    = {{ACM}},
  title        = {{{A Hybrid Synthesis Methodology for Approximate Circuits}}},
  doi          = {{10.1145/3386263.3406952}},
  year         = {{2020}},
}

@inproceedings{16218,
  abstract     = {{Despite recent progress in orchestration of Virtual Network Functions (VNFs) and in multi-technology SDN connectivity, the automated provisioning of end-to-end network services composed of virtual functions deployed across distributed compute locations remains an open challenge. This problem is especially relevant to support the deployment of future 5G networks, comprising virtual access and core network functions connected through a potentially multi-domain transport network.
In this paper, we present and demonstrate the 5GOS, a lightweight end-to-end orchestration framework that enables the
automated provisioning of virtual radio access network services. Using an experimental multi-domain testbed we demonstrate that the 5GOS can provision multi-domain virtual Wi-Fi and LTE services in less than three minutes.}},
  author       = {{Camps-Mur, Daniel and  Canellas, Ferran and Machwe, Azahar and Paracuellos, Jorge and Choumas, Kostas and Giatsios, Dimitris and Korakis, Thanasis and Razzaghi Kouchaksaraei, Hadi}},
  booktitle    = {{the 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)}},
  keywords     = {{Orchestration, multi-domain, cellular network virtualization, SDN, 5G}},
  location     = {{Ghent, Belgium}},
  title        = {{{5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services}}},
  year         = {{2020}},
}

@inproceedings{16219,
  abstract     = {{Network function virtualization (NFV) proposes
to replace physical middleboxes with more flexible virtual
network functions (VNFs). To dynamically adjust to everchanging
traffic demands, VNFs have to be instantiated and
their allocated resources have to be adjusted on demand.
Deciding the amount of allocated resources is non-trivial.
Existing optimization approaches often assume fixed resource
requirements for each VNF instance. However, this can easily
lead to either waste of resources or bad service quality if too
many or too few resources are allocated.

To solve this problem, we train machine learning models
on real VNF data, containing measurements of performance
and resource requirements. For each VNF, the trained models
can then accurately predict the required resources to handle
a certain traffic load. We integrate these machine learning
models into an algorithm for joint VNF scaling and placement
and evaluate their impact on resulting VNF placements. Our
evaluation based on real-world data shows that using suitable
machine learning models effectively avoids over- and underallocation
of resources, leading to up to 12 times lower resource
consumption and better service quality with up to 4.5 times
lower total delay than using standard fixed resource allocation.}},
  author       = {{Schneider, Stefan Balthasar and Satheeschandran, Narayanan Puthenpurayil and Peuster, Manuel and Karl, Holger}},
  booktitle    = {{IEEE Conference on Network Softwarization (NetSoft)}},
  location     = {{Ghent, Belgium}},
  publisher    = {{IEEE}},
  title        = {{{Machine Learning for Dynamic Resource Allocation in Network Function Virtualization}}},
  year         = {{2020}},
}

@inproceedings{16222,
  author       = {{Zafeiropoulos, A. and Fotopoulou, E. and Peuster, Manuel and Schneider, Stefan Balthasar and Gouvas, P. and Behnke, D. and Müller, M. and Bök, P. and Trakadas, P. and Karkazis, P. and Karl, Holger}},
  booktitle    = {{IEEE Conference on Network Softwarization (NetSoft)}},
  title        = {{{Benchmarking and Profiling 5G Verticals' Applications: An Industrial IoT Use Case}}},
  year         = {{2020}},
}

@inproceedings{16248,
  author       = {{Wende, Marc and Kenig, Eugeny}},
  booktitle    = {{Jahrestreffen der ProcessNet-Fachgruppen Fluidverfahrenstechnik, Adsorption und Extraktion}},
  location     = {{Berchtesgaden}},
  title        = {{{Numerische Simulation von Gravidestillationsapparaten mit Metallschäumen}}},
  year         = {{2020}},
}

@article{16249,
  abstract     = {{Timing plays a crucial role in the context of information security investments. We regard timing in two dimensions, namely the time of announcement in relation to the time of investment and the time of announcement in relation to the time of a fundamental security incident. The financial value of information security investments is assessed by examining the relationship between the investment announcements and their stock market reaction focusing on the two time dimensions. Using an event study methodology, we found that both dimensions influence the stock market return of the investing organization. Our results indicate that (1) after fundamental security incidents in a given industry, the stock price will react more positively to a firm’s announcement of actual information security investments than to announcements of the intention to invest; (2) the stock price will react more positively to a firm’s announcements of the intention to invest after the fundamental security incident compared to before; and (3) the stock price will react more positively to a firm’s announcements of actual information security investments after the fundamental security incident compared to before. Overall, the lowest abnormal return can be expected when the intention to invest is announced before a fundamental information security incident and the highest return when actual investing after a fundamental information security incident in the respective industry.}},
  author       = {{Szubartowicz, Eva and Schryen, Guido}},
  journal      = {{Journal of Information System Security}},
  keywords     = {{Event Study, Information Security, Investment Announcements, Stock Price Reaction, Value of Information Security Investments}},
  number       = {{1}},
  pages        = {{3 -- 31}},
  publisher    = {{Information Institute Publishing, Washington DC, USA}},
  title        = {{{Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements}}},
  volume       = {{16}},
  year         = {{2020}},
}

@article{16273,
  abstract     = {{This study examines the gender gap in competitiveness in an educational setting
and tests whether this gap depends on the difficulty of the task at hand. For this purpose,
we administered a series of experiments during the final exam of a university
course. We confronted three cohorts of undergraduate students with a set of bonus
questions and the choice between an absolute and a tournament grading scheme
for these questions. To test the moderating impact of task difficulty, we (randomly)
varied the difficulty of the questions between treatment groups. We find that, on
average, women are significantly less likely to select the tournament scheme. However,
the results show that the gender gap in tournament entry is sizable when the
questions are relative easy, but much smaller and statistical insignificant when the
questions are difficult.}},
  author       = {{Hoyer, Britta and van Huizen, Thomas and Keijzer, Linda  and Rezaei, Sarah  and Rosenkranz, Stephanie and Westbrock, Bastian }},
  journal      = {{Labour Economics}},
  title        = {{{Gender, competitiveness, and task difficulty: Evidence from the field}}},
  doi          = {{10.1016/j.labeco.2020.101815}},
  year         = {{2020}},
}

@inproceedings{16274,
  author       = {{Jovanovikj, Ivan and Nagaraj, Achyuth and Yigitbas, Enes and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor}},
  booktitle    = {{Proceedings of the 1st IEEE/ACM International Conference on Automation of Software Test AST}},
  location     = {{Seoul}},
  pages        = {{31--40}},
  publisher    = {{ACM}},
  title        = {{{Validating Test Case Migration via Mutation Analysis }}},
  year         = {{2020}},
}

@article{16278,
  abstract     = {{Currently, the coexistence of multiple users and devices challenges the network's ability to reliably connect them. This article proposes a novel communication architecture that satisfies the requirements of fifth-generation (5G) mobile network applications. In particular, this architecture extends and combines ultra-dense networking (UDN), multi-access edge computing (MEC), and virtual infrastructure manager (VIM) concepts to provide a flexible network of moving radio access (RA) nodes, flying or moving to areas where users and devices struggle for connectivity and data rate. Furthermore, advances in radio communications and non-orthogonal multiple access (NOMA), virtualization technologies and energy-awareness mechanisms are integrated towards a mobile UDN that not only allows RA nodes to follow the user but also enables the virtualized network functions (VNFs) to adapt to user mobility by migrating from one node to another. Performance evaluation shows that the underlying network improves connectivity of users and devices through the flexible deployment of moving RA nodes and the use of NOMA.}},
  author       = {{Nomikos, Nikolaos and Michailidis, Emmanouel T. and Trakadas, Panagiotis and Vouyioukas, Demosthenes and Karl, Holger and Martrat, Josep and Zahariadis, Theodore and Papadopoulos, Konstantinos and Voliotis, Stamatis}},
  issn         = {{2214-2096}},
  journal      = {{Vehicular Communications}},
  title        = {{{A UAV-based moving 5G RAN for massive connectivity of mobile users and IoT devices}}},
  doi          = {{10.1016/j.vehcom.2020.100250}},
  year         = {{2020}},
}

@article{16280,
  abstract     = {{Assigning bands of the wireless spectrum as resources to users is a common problem in wireless networks. Typically, frequency bands were assumed to be available in a stable manner. Nevertheless, in recent scenarios where wireless networks may be deployed in unknown environments, spectrum competition is considered, making it uncertain whether a frequency band is available at all or at what quality. To fully exploit such resources with uncertain availability, the multi-armed bandit (MAB) method, a representative online learning technique, has been applied to design spectrum scheduling algorithms. This article surveys such proposals. We describe the following three aspects: how to model spectrum scheduling problems within the MAB framework, what the main thread is following which prevalent algorithms are designed, and how to evaluate algorithm performance and complexity. We also give some promising directions for future research in related fields.}},
  author       = {{Li, Feng and Yu, Dongxiao and Yang, Huan and Yu, Jiguo and Karl, Holger and Cheng, Xiuzhen}},
  issn         = {{1536-1284}},
  journal      = {{IEEE Wireless Communications}},
  pages        = {{24--30}},
  title        = {{{Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey}}},
  doi          = {{10.1109/mwc.001.1900280}},
  year         = {{2020}},
}

@inproceedings{16285,
  abstract     = {{To  decide  in  which  part  of  town to  open  stores,  high  street  retailers consult  statistical  data  on  customers  and  cities,  but  they  cannot  analyze  their customers’  shopping  behavior  and  geospatial  features  of  a  city  due  to  missing data.  While  previous  research  has  proposed  recommendation  systems  and decision  aids  that  address  this  type  of  decision  problem –  including  factory location  and  assortment  planning –  there  currently  is no design  knowledge available  to  prescribe  the  design  of  city  center  area  recommendation  systems (CCARS).   We   set   out   to   design   a   software   prototype   considering   local customers’  shopping  interests  and  geospatial  data  on  their  shopping  trips  for retail site selection.  With real data on 500 customers and 1,100 shopping trips, we demonstrate and evaluate our IT artifact. Our results illustrate how retailers and public town center managers can use CCARS for spatial location selection, growing retailers’ profits and a city center’s attractiveness for its citizens.}},
  author       = {{zur Heiden, Philipp and Berendes, Carsten Ingo and Beverungen, Daniel}},
  booktitle    = {{Proceedings of the 15th International Conference on Wirtschaftsinformatik}},
  keywords     = {{Town Center Management, High Street Retail, Recommender Systems, Geospatial Recommendations, Design Science Research}},
  location     = {{Potsdam}},
  title        = {{{Designing City Center Area Recommendation Systems }}},
  doi          = {{doi.org/10.30844/wi_2020_e1-heiden}},
  year         = {{2020}},
}

@article{16288,
  abstract     = {{We derive a data-driven method for the approximation of the Koopman generator called gEDMD, which can be regarded as a straightforward extension of EDMD (extended dynamic mode decomposition). This approach is applicable to deterministic and stochastic dynamical systems. It can be used for computing eigenvalues, eigenfunctions, and modes of the generator and for system identification. In addition to learning the governing equations of deterministic systems, which then reduces to SINDy (sparse identification of nonlinear dynamics), it is possible to identify the drift and diffusion terms of stochastic differential equations from data. Moreover, we apply gEDMD to derive coarse-grained models of high-dimensional systems, and also to determine efficient model predictive control strategies. We highlight relationships with other methods and demonstrate the efficacy of the proposed methods using several guiding examples and prototypical molecular dynamics problems.}},
  author       = {{Klus, Stefan and Nüske, Feliks and Peitz, Sebastian and Niemann, Jan-Hendrik and Clementi, Cecilia and Schütte, Christof}},
  issn         = {{0167-2789}},
  journal      = {{Physica D: Nonlinear Phenomena}},
  title        = {{{Data-driven approximation of the Koopman generator: Model reduction, system identification, and control}}},
  doi          = {{10.1016/j.physd.2020.132416}},
  volume       = {{406}},
  year         = {{2020}},
}

