Now showing items 21-30 of 58
Algorithms for string searching on a Beowulf cluster
String matching is a subject of both theoretical and practical interest in computer science. Theoretically, time and space complexity of the algorithms and on the practical side searching for keywords, names, phrases etc., ...
An automated Oracle for verifying GUI objects
The promise of test automation - the automatic application of software inputs to find bugs - is tempered by the difficulty of automatically verifying behavior. Indeed, the lack of tools for behavior verification is a major ...
A machine learning approach to anomaly detection
Learning rules for anomaly detection of hostile network traffic
We introduce an algorithm called LERAD that learns rules for finding rare events in nominal time-series data with long range dependencies. We use LERAD to find anomalies in network packets and TCP sessions to detect novel ...
Pair programming to facilitate the training of newly-hired programmers
Pair programming is touted by some software professionals as a style which allows developers to produce superior code in less time, and with fewer defects, than code produced by individuals. However, the acclaim for the ...
Migration from a Waterfall/non SEI CMM compliant process to a RUP/SEI CMM compliant process
Software Life Cycle processes play a key role in the successful development of software products. Software processes continue to evolve as the field of software development progresses toward being a true engineering ...
A new approach to scalable Linda-systems based on swarms (EXTENDED VERSION)
Natural forming multi-agent systems (aka Swarms) have the ability to grow to enormous sizes without requiring any of the agents to oversee the entire system. The success of these systems comes from the fact that agents are ...
Identifying outliers via clustering for anomaly detection
Detecting known vulnerabilities (Signature Detection) is not sufficient for complete security. This has raised recent interest in Anomaly Detection (AD), in which a model is built from normal behavior and significant ...
An algorithm for clearing combinatorial markets
It was recently shown possible to solve single item auctions without revealing any secret except for the solution. Namely, with vMB-share , the seller and the buyer only learn each other's identity and the selling price ...
An analysis of the 1999 DARPA/Lincoln Laboratory evaluation data for network anomaly detection
We investigate potential simulation artifacts and their effects on the evaluation of network anomaly detection systems in the 1999 DARPA/MIT Lincoln Laboratory off-line intrusion detection evaluation data set. A statistical ...