Intrusion Detection Systems (IDSs) have become an essential component to improve security in networked environments. The increasing set of available IDSs has stimulated research projects that investigate means to assess them and to find out their strengths and limitations (in order to improve the IDSs themselves) and to assist the security manager in selecting the product that best suits specif...

This document describes a rule learning framework called SeCo (derived from Separate-and-Conquer). This framework uses building blocks to specify each component that is needed to build up a configuration for a rule learner. It is based on a general separate-and-conquer algorithm. The framework allows to configurate any given rule learner that fulfills some properties. These are mainly that it e...

Enhanced sensitivity to information of negative (compared to positive) valence has an adaptive value, for example, by expediting the correct choice of avoidance behavior. However, previous evidence for such enhanced sensitivity has been inconclusive. Here we report a clear advantage for negative over positive words in categorizing them as emotional. In 3 experiments, participants classified bri...

Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...

Techniques for solving divide-and-conquer recurrences are routinely taught to thousands of Computer Science students each year. The dominant approach to solving such recurrences is known as the Master Method [2]. Recently, Akra and Bazzi [1] discovered a surprisingly elegant generalization of the Master Method that yields a very simple formula for solving most divideand-conquer recurrences. In ...

The parity based divide and conquer recursion trees are introduced where the sizes of the tree do not grow monotonically as n grows. These non-monotonic recursive functions called fogk(n) and f̃ogk(n) are strictly less than linear, o(n) but greater than logarithm, Ω(logn). Properties of fogk(n) such as non-monotonicity, upper and lower bounds, etc. are examined and proven. These functions are us...

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...

We characterize the classes of functions computable by uniform log-depth (NC) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent to ALOGTIME, the latter to polylogarithmic space.) The closures involve the \safe" composition of Bellantoni and Cook as well as a safe \divide and conquer" recursion; a simple change to the de nition of the latter dis...