Learn More
Each day, anti-virus companies receive tens of thousands samples of potentially harmful executables. Many of the malicious samples are variations of previously encountered malware, created by their authors to evade pattern-based detection. Dealing with these large amounts of data requires robust, automatic detection approaches. This paper studies malware(More)
The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone minor changes. Examining malware executables using their call graphs view is a suitable approach for(More)
This paper presents an exact algorithm for the Lock Scheduling Problem (LSP) based on a Combinatorial Benders decomposition. LSP consists of three strongly interconnected sub problems: scheduling the lockages, assigning ships to chambers, and positioning the ships inside the chambers. These three sub problems are interpreted resp. as a scheduling, an(More)
[Kinable]; frits.spieksma@kuleuven.be [Spieksma]; greet.vandenberghe@cs.kuleuven.be [Vanden Berghe] Abstract The School Bus Routing Problem (SBRP), a generalization of the well-known Vehicle Routing Problem, involves the routing, planning, and scheduling of public school bus transportation. The problem can be divided into several subproblems, including bus(More)
Current Network Scan Detection Systems (NSDS), usually implement detection schemes which depend on the ability to analyze every single network packet in detail. In order to scale NSDS to high speed networks, processing gigabits every second, a different approach is required since packet level inspection is no longer feasible. In this paper we will(More)