@article{1683, author = {{Krimphove, Dieter and Lüke, Christoph}}, journal = {{Finanzierung Leasing Factoring }}, number = {{Nr. 2}}, pages = {{82 ff.}}, title = {{{Finetrading – Neue Finanzierungsmöglichkeit im grenzüberschreitenden Handel}}}, year = {{2017}}, } @article{1684, author = {{Krimphove, Dieter and Michel, Julia}}, journal = {{Zeitschrift für Vertriebsrecht (ZVertriebsR)}}, pages = {{149 ff.}}, title = {{{Cookies zu Werbezwecken im Vertrieb}}}, year = {{2017}}, } @article{1685, author = {{Krimphove, Dieter}}, journal = {{Zeitschrift für Versicherungsrecht, Haftung-und Schadensrecht VersR }}, pages = {{326 ff.}}, title = {{{Das BaFin-Rundschreiben „aufsichtsrechtliche Mindestanforderungen an die Geschäftsorganisationen von Versicherungsunternehmen“ (MaGo)}}}, year = {{2017}}, } @article{1686, author = {{Krimphove, Dieter}}, journal = {{Zeitschrift für Bank- und Kapitalmarktrecht BKR}}, number = {{Heft 9}}, pages = {{353 ff.}}, title = {{{Was ist Proportionalität?}}}, year = {{2017}}, } @article{1687, author = {{Krimphove, Dieter}}, journal = {{Neue Zeitschrift für Arbeitsrecht NZA }}, pages = {{1374 ff.}}, title = {{{Neue Arbeitszeitrechtsprechung für familienadäquate Erziehungs- und Betreuungstätigkeit}}}, year = {{2017}}, } @article{1688, author = {{Krimphove, Dieter}}, journal = {{ArbR – Arbeitsrecht Aktuell }}, number = {{Heft 24}}, pages = {{583 ff.}}, title = {{{Clash of Regulations oder Der Kampf der Richtlinien}}}, year = {{2017}}, } @article{17158, author = {{Beverungen, Daniel and Müller, Oliver and Matzner, Martin and Mendling, Jan and vom Brocke, Jan}}, issn = {{1019-6781}}, journal = {{Electronic Markets}}, pages = {{7--18}}, title = {{{Conceptualizing smart service systems}}}, doi = {{10.1007/s12525-017-0270-5}}, year = {{2017}}, } @misc{104, author = {{Diemert, Denis}}, publisher = {{Universität Paderborn}}, title = {{{EAX - An Authenticated Encryption Mode for Block Ciphers}}}, year = {{2017}}, } @inproceedings{1042, author = {{Van Rossem, Steven and Peuster, Manuel and Conceicao, Luıs and Razzaghi Kouchaksaraei, Hadi and Tavernier, Wouter and Colle, Didier and Pickavet, Mario and Demeester, Piet}}, location = {{Berlin, Germany}}, title = {{{A Network Service Development Kit Supporting the End-to-End Lifecycle of NFV-based Telecom Services}}}, year = {{2017}}, } @misc{1048, author = {{Schenk, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}}}, year = {{2017}}, } @misc{1049, author = {{Beckendorfer, Björn}}, publisher = {{Universität Paderborn}}, title = {{{Visualisierung zu Algorithmen verteilter Netzwerksysteme}}}, year = {{2017}}, } @inproceedings{105, abstract = {{We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.}}, author = {{Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}}, booktitle = {{Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}}, pages = {{137:1----137:15}}, title = {{{Distributed Monitoring of Network Properties: The Power of Hybrid Networks}}}, doi = {{10.4230/LIPIcs.ICALP.2017.137}}, year = {{2017}}, } @article{1054, abstract = {{We explore how competition between physicians affects medical service provision. Previous research has shown that, without competition, physicians deviate from patient‐optimal treatment under payment systems like capitation and fee‐for‐service. Although competition might reduce these distortions, physicians usually interact with each other repeatedly over time and only a fraction of patients switches providers at all. Both patterns might prevent competition to work in the desired direction. To analyze the behavioral effects of competition, we develop a theoretical benchmark that is then tested in a controlled laboratory experiment. Experimental conditions vary physician payment and patient characteristics. Real patients benefit from provision decisions made in the experiment. Our results reveal that, in line with the theoretical prediction, introducing competition can reduce overprovision and underprovision, respectively. The observed effects depend on patient characteristics and the payment system, though. Tacit collusion is observed and particularly pronounced with fee‐for‐service payment, but it appears to be less frequent than in related experimental research on price competition. }}, author = {{Brosig-Koch, Janet and Hehenkamp, Burkhard and Kokot, Johanna}}, journal = {{Health Economics}}, number = {{53}}, pages = {{6--20}}, publisher = {{Wiley Online Library}}, title = {{{The effects of competition on medical service provision}}}, doi = {{10.1002/hec.3583}}, volume = {{26}}, year = {{2017}}, } @techreport{1055, author = {{Hehenkamp, Burkhard and Kaarboe, Oddvar}}, publisher = {{Universität Paderborn}}, title = {{{Location Choice and Quality Competition in Mixed Hospital Markets}}}, year = {{2017}}, } @techreport{1056, author = {{Gu, Yiguan and Hehenkamp, Burkhard and Leininger, Wolfgang}}, publisher = {{Universität Paderborn}}, title = {{{Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation}}}, year = {{2017}}, } @techreport{1057, author = {{Sürücü, Oktay and Mir Djawadi, Behnud and Brangewitz, Sonja}}, publisher = {{Universität Paderborn}}, title = {{{Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries}}}, year = {{2017}}, } @misc{10589, author = {{Fürnkranz, J. and Hüllermeier, Eyke}}, booktitle = {{Encyclopedia of Machine Learning and Data Mining}}, pages = {{1000--1005}}, title = {{{Preference Learning}}}, year = {{2017}}, } @phdthesis{10594, abstract = {{Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since – in contrast to the solution of a single objective optimization problem – the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging. This is even more the case when many problems have to be solved, when the number of objectives is high, or when the objectives are costly to evaluate. Consequently, this thesis is devoted to the identification and exploitation of structure both in the Pareto set and the dynamics of the underlying model as well as to the development of efficient algorithms for solving problems with additional parameters, with a high number of objectives or with PDE-constraints. These three challenges are addressed in three respective parts. In the first part, predictor-corrector methods are extended to entire Pareto sets. When certain smoothness assumptions are satisfied, then the set of parameter dependent Pareto sets possesses additional structure, i.e. it is a manifold. The tangent space can be approximated numerically which yields a direction for the predictor step. In the corrector step, the predicted set converges to the Pareto set at a new parameter value. The resulting algorithm is applied to an example from autonomous driving. In the second part, the hierarchical structure of Pareto sets is investigated. When considering a subset of the objectives, the resulting solution is a subset of the Pareto set of the original problem. Under additional smoothness assumptions, the respective subsets are located on the boundary of the Pareto set of the full problem. This way, the “skeleton” of a Pareto set can be computed and due to the exponential increase in computing time with the number of objectives, the computations of these subsets are significantly faster which is demonstrated using an example from industrial laundries. In the third part, PDE-constrained multiobjective optimal control problems are addressed by reduced order modeling methods. Reduced order models exploit the structure in the system dynamics, for example by describing the dynamics of only the most energetic modes. The model reduction introduces an error in both the function values and their gradients, which has to be taken into account in the development of algorithms. Both scalarization and set-oriented approaches are coupled with reduced order modeling. Convergence results are presented and the numerical benefit is investigated. The algorithms are applied to semi-linear heat flow problems as well as to the Navier-Stokes equations. }}, author = {{Peitz, Sebastian}}, title = {{{ Exploiting structure in multiobjective optimization and optimal control}}}, doi = {{10.17619/UNIPB/1-176}}, year = {{2017}}, } @misc{106, author = {{Krammer, Isabel}}, publisher = {{Universität München}}, title = {{{Denn wir wissen, was gemeint ist: Erweiterung bestehender Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz}}}, year = {{2017}}, } @article{10600, author = {{H.W. Leong, Philip and Amano, Hideharu and Anderson, Jason and Bertels, Koen and M.P. Cardoso, Jo\~{a}o and Diessel, Oliver and Gogniat, Guy and Hutton, Mike and Lee, JunKyu and Luk, Wayne and Lysaght, Patrick and Platzner, Marco and K. Prasanna, Viktor and Rissa, Tero and Silvano, Cristina and So, Hayden and Wang, Yu}}, journal = {{ACM Transactions on Reconfigurable Technology and Systems}}, title = {{{The First 25 Years of the FPL Conference – Significant Papers}}}, doi = {{10.1145/2996468}}, year = {{2017}}, }