TY - GEN A1 - Vogel, Michael A1 - Schmerl, Sebastian A1 - König, Hartmut T1 - Analyseverlagerung in P2P-Overlaynetzen Y1 - 2009 ER - TY - CHAP A1 - Schmerl, Sebastian A1 - Vogel, Michael A1 - König, Hartmut T1 - Cooperating Intrusion Detection Overlay Structures T2 - 4th GI/ITG KuVS Workshop on Future Internet and 2nd Workshop on Economic Traffic Management (ETM), Zürich, Switzerland, 9 - 10. November 2009 Y1 - 2009 ER - TY - CHAP A1 - Schmerl, Sebastian A1 - Vogel, Michael A1 - König, Hartmut T1 - Identifying Modeling Errors in Signatures by Model Checking. Y1 - 2009 ER - TY - CHAP A1 - Vogel, Michael ED - Flegel, Ulrich ED - Holz, Thorsten T1 - P2P-basierte Analyseverteilung für Intrusion Detection Systeme. T2 - Proceedings of the 3rd GI Graduate Workshop on Reactive Security (SPRING), Mannheim, August 2008, SIDAR-Report SR-2008-01 Y1 - 2008 UR - http://docplayer.org/3686739-3-gi-fg-sidar-graduierten-workshop-ueber-reaktive-sicherheit-spring-ulrich-flegel-thorsten-holz-hrsg-08-august-2008-mannheim.html ER - TY - CHAP A1 - Schmerl, Sebastian A1 - Vogel, Michael T1 - Efficient Analysis Distribution for Intrusion Detection T2 - Proceedings of the NATO RTO Information Systems and Technology Panel (IST) Symposium on Information Assurance for Emerging and Future Military Systems, 2008, Ljubljana, Slovenia Y1 - 2008 N1 - Originator's Reference RTO-MP-IST-076 AC/323(IST-076)TP/238 ER - TY - CHAP A1 - Schmerl, Sebastian A1 - Vogel, Michael A1 - Rietz, René A1 - König, Hartmut T1 - Explorative Visualization of Log Data to Support Forensic Analysis and Signature Development T2 - 2010 Fifth IEEE International Workshop on Systematic Approaches to Digital Forensic Engineering (SADFE 2010), Oakland, California, USA, 20 May 2010 Y1 - 2010 SN - 978-1-424-47220-8 SP - 109 EP - 118 PB - IEEE CY - Piscataway, NJ ER - TY - GEN A1 - Vogel, Michael A1 - Rietz, René A1 - Schmerl, Sebastian T1 - Automated Generation of Precise Signatures T2 - Praxis der Informationsverarbeitung und Kommunikation : (PIK) Y1 - 2012 U6 - https://doi.org/10.1515/pik-2012-0007 SN - 0930-5157 VL - 35 IS - 1 SP - 40 EP - 45 ER - TY - CHAP A1 - Rietz, René A1 - Vogel, Michael A1 - Schuster, Franka A1 - König, Hartmut ED - Dietrich, Sven T1 - Parallelization of Network Intrusion Detection Systems under Attack Conditions T2 - Detection of Intrusions and Malware, and Vulnerability Assessment, 11th International Conference, DIMVA 2014, Egham, UK, July 10-11, 2014 Y1 - 2014 SN - 978-3-319-08508-1 SP - 172 EP - 191 PB - Springer International Publishing CY - Cham ER - TY - GEN A1 - Breuß, Michael A1 - Cristiani, Emiliano A1 - Durou, Jean-Denis A1 - Falcone, Maurizio A1 - Vogel, Oliver T1 - Perspective Shape from Shading: Ambiguity Analysis and Numerical Approximations T2 - SIAM Journal on Imaging Sciences Y1 - 2012 SN - 1936-4954 VL - 5 IS - 1 SP - 311 EP - 342 ER - TY - CHAP A1 - Weickert, Joachim A1 - Hagenburg, Kai Uwe A1 - Breuß, Michael A1 - Vogel, Oliver ED - Heyden, A. ED - Kahl, F. ED - Olsson, C. ED - Oskarsson, M. ED - Tai, X.-C. T1 - Linear osmosis models for visual computing T2 - Energy Minimization Methods in Computer Vision and Pattern Recognition, EMMCVPR 2013, Lund, Sweden, August 2013 Y1 - 2013 SN - 978-3-642-40394-1 SN - 978-3-642-40395-8 SP - 26 EP - 39 PB - Springer CY - Berlin ER - TY - GEN A1 - Breuß, Michael A1 - Kemm, Friedemann A1 - Vogel, Oliver T1 - A numerical study of Newton interpolation with extremely high degrees T2 - Kybernetika : international journal published by Institute of Information Theory and Automation N2 - In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the approximation quality obtained by Newton interpolation with Fast Leja (FL) points is competitive to the use of Chebyshev nodes, even for extremely high degree interpolation. This is an experimental account of the analytic result that the limit distribution of FL points and Chebyshev nodes is the same when letting the number of points go to infinity. Since the FL construction is easy to perform and allows to add interpolation nodes on the fly in contrast to the use of Chebyshev nodes, our study suggests that Newton interpolation with FL points is currently the most efficient numerical technique for polynomial interpolation. Moreover, we give numerical evidence that any reasonable function can be approximated up to machine accuracy by Newton interpolation with FL points if desired, which shows the potential of this method. KW - polynomial interpolation KW - Newton interpolation KW - interpolation nodes KW - Chebyshev nodes KW - Leja ordering KW - fast Leja points Y1 - 2018 U6 - https://doi.org/10.14736/kyb-2018-2-0279 SN - 0023-5954 VL - 54 IS - 2 SP - 279 EP - 288 ER - TY - GEN A1 - Cwalinski, Radoslaw A1 - Rietz, René A1 - Vogel, Michael A1 - König, Hartmut T1 - An SDN-based Approach to Protect Communication Between Virtual Machines T2 - IEEE 44th Conference on Local Computer Networks (LCN), October 14-17, 2019, Osnabrück, Germany. Y1 - 2019 UR - https://www.ieeelcn.org/prior/LCN44/index.html SN - 978-1-7281-1028-8 SP - 465 EP - 468 PB - IEEE ER - TY - GEN A1 - Vogel, Michael A1 - Schuster, Franka A1 - Kopp, Fabian Malte A1 - König, Hartmut T1 - Data Volume Reduction for Deep Packet Inspection by Multi-layer Application Determination T2 - 2022 IEEE International Conference on Cyber Security and Resilience (CSR), 27-29 July 2022, Rhodes, Greece N2 - Attack detection in enterprise networks is increasingly faced with large data volumes, in part high data bursts, and heavily fluctuating data flows that often cause arbitrary discarding of data packets in overload situations which can be used by attackers to hide attack activities. Attack detection systems usually configure a comprehensive set of signatures for known vulnerabilities in different operating systems, protocols, and applications. Many of these signatures, however, are not relevant in each context, since certain vulnerabilities have already been eliminated, or the vulnerable applications or operating system versions, respectively, are not installed on the involved systems. In this paper, we present an approach for clustering data flows to assign them to dedicated analysis units that contain only signature sets relevant for the analysis of these flows. We discuss the performance of this clustering and show how it can be used in practice to improve the efficiency of an analysis pipeline. Y1 - 2022 UR - https://ieeexplore.ieee.org/abstract/document/9850293 SN - 978-1-6654-9952-1 SN - 978-1-6654-9953-8 U6 - https://doi.org/10.1109/CSR54599.2022.9850293 PB - IEEE ER -