Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
All Elephants Are Bigger Than All Mice, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler
All Elephants Are Bigger Than All Mice, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler
Computer Science and Engineering Faculty Publications
We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural type of statement, it can be simulated only by the very expressive DL SROIQ for which no tight worst-case complexity is known. However, we show that concept products can also be added to the DLs SHOIQ and SHOI, and to the tractable DL EL++ without increasing the worst-case complexities in any of those cases. We therefore argue that concept products provide practically relevant expressivity at little cost, making them a good candidate …
The State Of The Art In Flow Visualization: Partition-Based Techniques, Tobias Salzbrunn, Heike Janicke, Thomas Wischgoll, Gerik Scheuermann
The State Of The Art In Flow Visualization: Partition-Based Techniques, Tobias Salzbrunn, Heike Janicke, Thomas Wischgoll, Gerik Scheuermann
Computer Science and Engineering Faculty Publications
Flow visualization has been a very active subfield of scientific visualization in recent years. From the resulting large variety of methods this paper discusses partition-based techniques. The aim of these approaches is to partition the flow in areas of common structure. Based on this partitioning, subsequent visualization techniques can be applied. A classification is suggested and advantages/disadvantages of the different techniques are discussed as well.
Botsniffer: Detecting Botnet Command And Control Channels In Network Traffic, Guofei Gu, Junjie Zhang, Wenke Lee
Botsniffer: Detecting Botnet Command And Control Channels In Network Traffic, Guofei Gu, Junjie Zhang, Wenke Lee
Computer Science and Engineering Faculty Publications
Botnets are now recognized as one of the most serious security threats. In contrast to previous malware, botnets have the characteristic of a command and control (C&C) channel. Botnets also often use existing common protocols, e.g., IRC, HTTP, and in protocol-conforming manners. This makes the detection of botnet C&C a challenging problem. In this paper, we propose an approach that uses network-based anomaly detection to identify botnet C&C channels in a local area network without any prior knowledge of signatures or C&C server addresses. This detection approach can identify both the C&C servers and infected hosts in the network. Our …
Botminer: Clustering Analysis Of Network Traffic For Protocol- And Structure-Independent Botnet Detection, Guofei Gu, Roberto Perdisci, Junjie Zhang, Wenke Lee
Botminer: Clustering Analysis Of Network Traffic For Protocol- And Structure-Independent Botnet Detection, Guofei Gu, Roberto Perdisci, Junjie Zhang, Wenke Lee
Computer Science and Engineering Faculty Publications
Botnets are now the key platform for many Internet attacks, such as spam, distributed denial-of-service (DDoS), identity theft, and phishing. Most of the current botnet detection approaches work only on specific botnet command and control (C&C) protocols (e.g., IRC) and structures (e.g., centralized), and can become ineffective as botnets change their C&C techniques. In this paper, we present a general detection framework that is independent of botnet C&C protocol and structure, and requires no a priori knowledge of botnets (such as captured bot binaries and hence the botnet signatures, and C&C server names/addresses). We start from the definition and essential …
What Is Approximate Reasoning?, Sebastian Rudolph, Tuvshintur Tserendorj, Pascal Hitzler
What Is Approximate Reasoning?, Sebastian Rudolph, Tuvshintur Tserendorj, Pascal Hitzler
Computer Science and Engineering Faculty Publications
Approximate reasoning for the Semantic Web is based on the idea of sacrificing soundness or completeness for a significant speed-up of reasoning. This is to be done in such a way that the number of introduced mistakes is at least outweighed by the obtained speed-up. When pursuing such approximate reasoning approaches, however, it is important to be critical not only about appropriate application domains, but also about the quality of the resulting approximate reasoning procedures. With different approximate reasoning algorithms discussed and developed in the literature, it needs to be clarified how these approaches can be compared, i.e. what it …