TY - JOUR A1 - Golland, Alexander T1 - Datenschutzrechtliche Fragen personalisierter Preise — Herausforderungen von Algorithmen im Schnittbereich von Ethik, Ökonomie und Datenschutz JF - CR Computer und Recht Y1 - 2020 SN - 2194-4172 U6 - https://doi.org/10.9785/cr-2020-360313 VL - 36 IS - 3 SP - 186 EP - 194 PB - Verlag Dr. Otto Schmidt CY - Köln ER - TY - JOUR A1 - Golland, Alexander T1 - Rezension zu: Kipker – Rechtshandbuch Cybersecurity (2020) JF - DSB Datenschutz-Berater Y1 - 2020 SN - 0170-7256 VL - 44 IS - 7-8 SP - 192 PB - DFV Mediengruppe CY - Frankfurt a.M. ER - TY - JOUR A1 - Golland, Alexander T1 - Rezension zu: Gabel/Heinrich/Kiefner – Rechtshandbuch Cyber-Security (2019) JF - K&R Kommunikation & Recht Y1 - 2020 SN - 1434-6354 IS - 6 SP - VII ER - TY - JOUR A1 - Golland, Alexander ED - Hoeren, Thomas ED - Schneider, Jochen ED - Selmayr, Martin ED - Spies, Axel ED - Wybitul, Tim T1 - Die „private“ Datenverarbeitung im Internet. Verantwortlichkeiten und Rechtmäßigkeit bei Nutzung von Plattformdiensten durch natürliche Personen JF - ZD Zeitschrift für Datenschutz Y1 - 2020 SN - 2192-5593 VL - 10 IS - 8 SP - 397 EP - 403 PB - Beck CY - München ER - TY - GEN A1 - Golland, Alexander T1 - Anspruch gegen einen Suchmaschinenbetreiber auf Löschung von Suchergebnissen T2 - ZD Zeitschrift für Datenschutz Y1 - 2020 SN - 2192-5593 N1 - Anmerkung zu OLG Karlsruhe, Urteil vom 10.6.2020 (6 U 129/18) VL - 2020 IS - 10 SP - 531 EP - 532 PB - Beck CY - München ER - TY - JOUR A1 - Golland, Alexander T1 - Weckruf für deutsche Großunternehmen? – Der neue Entwurf des IT-Sicherheitsgesetz 2.0 JF - K&R Kommunikation & Recht Y1 - 2020 SN - 1434-6354 VL - 23 IS - 7-8 SP - I PB - DFV Mediengruppe CY - Frankfurt a.M. ER - TY - JOUR A1 - Golland, Alexander T1 - Rezension zu: Auernhammer – DSGVO/BDSG, Kommentar (7. Auflage, 2020) JF - DSB Datenschutz-Berater Y1 - 2020 SN - 0170-7256 N1 - Rezensiertes Werk: Auernhammer – Datenschutz-Grundverordnung, Bundesdatenschutzgesetz und Nebengesetze. Kommentar, 7. Auflage, Köln 2020 VL - 44 IS - 10 SP - 260 PB - DFV Mediengruppe CY - Frankfurt a.M. ER - TY - JOUR A1 - Gerhards, Michael A1 - Sander, Volker A1 - Zivkovic, Miroslav A1 - Belloum, Adam A1 - Bubak, Marian T1 - New approach to allocation planning of many‐task workflows on clouds JF - Concurrency and Computation: Practice and Experience N2 - Experience has shown that a priori created static resource allocation plans are vulnerable to runtime deviations and hence often become uneconomic or highly exceed a predefined soft deadline. The assumption of constant task execution times during allocation planning is even more unlikely in a cloud environment where virtualized resources vary in performance. Revising the initially created resource allocation plan at runtime allows the scheduler to react on deviations between planning and execution. Such an adaptive rescheduling of a many-task application workflow is only feasible, when the planning time can be handled efficiently at runtime. In this paper, we present the static low-complexity resource allocation planning algorithm (LCP) applicable to efficiently schedule many-task scientific application workflows on cloud resources of different capabilities. The benefits of the presented algorithm are benchmarked against alternative approaches. The benchmark results show that LCP is not only able to compete against higher complexity algorithms in terms of planned costs and planned makespan but also outperforms them significantly by magnitudes of 2 to 160 in terms of required planning time. Hence, LCP is superior in terms of practical usability where low planning time is essential such as in our targeted online rescheduling scenario. Y1 - 2020 U6 - https://doi.org/10.1002/cpe.5404 SN - 1532-0634 VL - 32 IS - 2 Article e5404 SP - 1 EP - 16 PB - Wiley CY - Chichester ER - TY - CHAP A1 - Geiben, Benedikt A1 - Götten, Falk A1 - Havermann, Marc T1 - Aerodynamic analysis of a winged sub-orbital spaceplane N2 - This paper primarily presents an aerodynamic CFD analysis of a winged spaceplane geometry based on the Japanese Space Walker proposal. StarCCM was used to calculate aerodynamic coefficients for a typical space flight trajectory including super-, trans- and subsonic Mach numbers and two angles of attack. Since the solution of the RANS equations in such supersonic flight regimes is still computationally expensive, inviscid Euler simulations can principally lead to a significant reduction in computational effort. The impact on accuracy of aerodynamic properties is further analysed by comparing both methods for different flight regimes up to a Mach number of 4. Y1 - 2020 U6 - https://doi.org/10.25967/530170 N1 - 69. Deutscher Luft- und Raumfahrtkongress 2020, 1. September 2020 - 3. September 2020, online PB - DGLR CY - Bonn ER - TY - JOUR A1 - Gazda, Quentin A1 - Maurischat, Andreas T1 - Special functions and Gauss-Thakur sums in higher rank and dimension Y1 - 2020 PB - De Gruyter CY - Berlin ER -