Toward developing a systematic approach to generate benchmark datasets for intrusion detection

EvoCOMNET Contributions.- New Research in Nature Inspired Algorithms for Mobility Management in GSM Networks.- Adaptive Local Search for a New Military Frequency Hopping Planning Problem.- SS vs PBIL to Solve a Real-World Frequency Assignment Problem in GSM Networks.- Reconstruction of Networks from Their Betweenness Centrality.- A Self-learning Optimization Technique for Topology Design of Computer Networks.- A Comparative Study of Fuzzy Inference Systems, Neural Networks and Adaptive Neuro Fuzzy Inference Systems for Portscan Detection.- EvoFIN Contributions.- Evolutionary Single-Position Automated Trading.- Genetic Programming in Statistical Arbitrage.- Evolutionary System for Generating Investment Strategies.- Horizontal Generalization Properties of Fuzzy Rule-Based Trading Models.- Particle Swarm Optimization for Tackling Continuous Review Inventory Models.- Option Model Calibration Using a Bacterial Foraging Optimization Algorithm.- A SOM and GP Tool for Reducing the Dimensionality of a Financial Distress Prediction Problem.- Quantum-Inspired Evolutionary Algorithms for Financial Data Analysis.- EvoHOT Contributions.- Analysis of Reconfigurable Logic Blocks for Evolvable Digital Architectures.- Analogue Circuit Control through Gene Expression.- Discovering Several Robot Behaviors through Speciation.- Architecture Performance Prediction Using Evolutionary Artificial Neural Networks.- Evolving a Vision-Driven Robot Controller for Real-World Indoor Navigation.- Evolving an Automatic Defect Classification Tool.- Deterministic Test Pattern Generator Design.- An Evolutionary Methodology for Test Generation for Peripheral Cores Via Dynamic FSM Extraction.- Exploiting MOEA to Automatically Geneate Test Programs for Path-Delay Faults in Microprocessors.- EvoIASP Contributions.- Evolutionary Object Detection by Means of Naive Bayes Models Estimation.- An Evolutionary Framework for Colorimetric Characterization of Scanners.- Artificial Creatures for Object Tracking and Segmentation.- Automatic Recognition of Hand Gestures with Differential Evolution.- Optimizing Computed Tomographic Angiography Image Segmentation Using Fitness Based Partitioning.- A GA-Based Feature Selection Algorithm for Remote Sensing Images.- An Evolutionary Approach for Ontology Driven Image Interpretation.- Hybrid Genetic Algorithm Based on Gene Fragment Competition for Polyphonic Music Transcription.- Classification of Seafloor Habitats Using Genetic Programming.- Selecting Local Region Descriptors with a Genetic Algorithm for Real-World Place Recognition.- Object Detection Using Neural Networks and Genetic Programming.- Direct 3D Metric Reconstruction from Multiple Views Using Differential Evolution.- Discrete Tomography Reconstruction through a New Memetic Algorithm.- A Fuzzy Hybrid Method for Image Decomposition Problem.- Triangulation Using Differential Evolution.- Fast Multi-template Matching Using a Particle Swarm Optimization Algorithm for PCB Inspection.- EvoMUSART Contributions.- A Generative Representation for the Evolution of Jazz Solos.- Automatic Invention of Fitness Functions with Application to Scene Generation.- Manipulating Artificial Ecosystems.- Evolved Diffusion Limited Aggregation Compositions.- Scaffolding for Interactively Evolving Novel Drum Tracks for Existing Songs.- AtomSwarm: A Framework for Swarm Improvisation.- Using DNA to Generate 3D Organic Art Forms.- Towards Music Fitness Evaluation with the Hierarchical SOM.- Evolutionary Pointillist Modules: Evolving Assemblages of 3D Objects.- An Artificial-Chemistry Approach to Generating Polyphonic Musical Phrases.- Implicit Fitness Functions for Evolving a Drawing Robot.- Free Flight in Parameter Space: A Dynamic Mapping Strategy for Expressive Free Impro.- Modelling Video Games' Landscapes by Means of Genetic Terrain Programming - A New Approach for Improving Users' Experience.- Virtual Constructive Swarm Compositions and Inspirations.- New-Generation Methods in an Interpolating EC Synthesizer Interface.- Composing Music with Neural Networks and Probabilistic Finite-State Machines.- TransFormer #13: Exploration and Adaptation of Evolution Expressed in a Dynamic Sculpture.- EvoNUM Contributions.- Multiobjective Tuning of Robust PID Controllers Using Evolutionary Algorithms.- Truncation Selection and Gaussian EDA: Bounds for Sustainable Progress in High-Dimensional Spaces.- Scalable Continuous Multiobjective Optimization with a Neural Network-Based Estimation of Distribution Algorithm.- Cumulative Step Length Adaptation for Evolution Strategies Using Negative Recombination Weights.- Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies.- A Critical Assessment of Some Variants of Particle Swarm Optimization.- An Evolutionary Game-Theoretical Approach to Particle Swarm Optimisation.- A Hybrid Particle Swarm Optimization Algorithm for Function Optimization.- EvoSTOC Contributions.- Memory Based on Abstraction for Dynamic Fitness Functions.- A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems.- Compound Particle Swarm Optimization in Dynamic Environments.- An Evolutionary Algorithm for Adaptive Online Services in Dynamic Environment.- EvoTHEORY Contributions.- A Study of Some Implications of the No Free Lunch Theorem.- Negative Slope Coefficient and the Difficulty of Random 3-SAT Instances.- EvoTRANSLOG Contributions.- A Memetic Algorithm for the Team Orienteering Problem.- Decentralized Evolutionary Optimization Approach to the p-Median Problem.- Genetic Computation of Road Network Design and Pricing Stackelberg Games with Multi-class Users.- Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change.- Evolutionary System with Precedence Constraints for Ore Harbor Schedule Optimization.

Applications of evolutionary computing: EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings.

Text Summarization is condensing the source text into a shorter version preserving its information content and overall meaning. It is very difficult for human beings to manually summarize large documents of text. Text Summarization methods can be classified into extractive and Abstractive summarization. An extractive summarization method consists of selecting important sentences, paragraphs etc. from the original document and concatenating them into shorter form. The importance of sentences is decided based on statistical and linguistic features of sentences. An Abstractive summarization method consists of understanding the original text and re-telling it in fewer words. It uses linguistic methods to examine and interpret the text and then to find the new concepts and expressions to best describe it by generating a new shorter text that conveys the most important information from the original text document. In this paper, a Survey of Text Summarization Extractive techniques has been presented.

/pdf/a-survey-of-text-summarization-extractive-techniques-4md66thl90.pdf

A Survey of Text Summarization Extractive Techniques

While automatic keyphrase extraction has been examined extensively, state-of-theart performance on this task is still much lower than that on many core natural language processing tasks. We present a survey of the state of the art in automatic keyphrase extraction, examining the major sources of errors made by existing systems and discussing the challenges ahead.

/pdf/automatic-keyphrase-extraction-a-survey-of-the-state-of-the-1pso91xi6f.pdf

Automatic Keyphrase Extraction: A Survey of the State of the Art

Search-based software testing is the application of metaheuristic search techniques to generate software tests. The test adequacy criterion is transformed into a fitness function and a set of solutions in the search space are evaluated with respect to the fitness function using a metaheuristic search technique. The application of metaheuristic search techniques for testing is promising due to the fact that exhaustive testing is infeasible considering the size and complexity of software under test. Search-based software testing has been applied across the spectrum of test case design methods; this includes white-box (structural), black-box (functional) and grey-box (combination of structural and functional) testing. In addition, metaheuristic search techniques have also been applied to test non-functional properties. The overall objective of undertaking this systematic review is to examine existing work into non-functional search-based software testing (NFSBST). We are interested in types of non-functional testing targeted using metaheuristic search techniques, different fitness functions used in different types of search-based non-functional testing and challenges in the application of these techniques. The systematic review is based on a comprehensive set of 35 articles obtained after a multi-stage selection process and have been published in the time span 1996-2007. The results of the review show that metaheuristic search techniques have been applied for non-functional testing of execution time, quality of service, security, usability and safety. A variety of metaheuristic search techniques are found to be applicable for non-functional testing including simulated annealing, tabu search, genetic algorithms, ant colony methods, grammatical evolution, genetic programming (and its variants including linear genetic programming) and swarm intelligence methods. The review reports on different fitness functions used to guide the search for each of the categories of execution time, safety, usability, quality of service and security; along with a discussion of possible challenges in the application of metaheuristic search techniques.

/pdf/a-systematic-review-of-search-based-testing-for-non-5etq5ii26p.pdf

A systematic review of search-based testing for non-functional system properties

Summaries of Web sites help Web users get an idea of the site contents without having to spend time browsing the sites. Currently, manually constructed summaries of Web sites by volunteer experts are available, such as the DMOZ Open Directory Project. This research is directed towards automating the Web site summarization task. To achieve this objective, an approach which applies machine learning and natural language processing techniques is developed to summarize a Web site automatically. The information content of the automatically generated summaries is compared, via a formal evaluation process involving human subjects, to DMOZ summaries, home page browsing and time-limited site browsing, for a number of academic and commercial Web sites. Statistical evaluation of the scores of the answers to a list of questions about the sites demonstrates that the automatically generated summaries convey the same information to the reader as DMOZ summaries do, and more information than the two browsing options.

http://web.cs.dal.ca/~eem/cvWeb/pubs/w3ss.pdf

World wide web site summarization

Automatic key phrase extraction is a useful tool in many text related applications such as clustering and summarization. State-of-the-art methods are aimed towards extracting key phrases from traditional text such as technical papers. Application of these methods on Web documents, which often contain diverse and heterogeneous contents, is of particular interest and challenge in the information age. In this work, we investigate the significance of narrative text classification in the task of automatic key phrase extraction in Web document corpora. We benchmark three methods, TFIDF, KEA, and Keyterm, used to extract key phrases from all the plain text and from only the narrative text of Web pages. ANOVA tests are used to analyze the ranking data collected in a user study using quantitative measures of acceptable percentage and quality value. The evaluation shows that key phrases extracted from the narrative text only are significantly better than those obtained from all plain text of Web pages. This demonstrates that narrative text classification is indispensable for effective key phrase extraction in Web document corpora.

http://web.cs.dal.ca/~eem/cvWeb/pubs/Zhang-widm05.pdf

Narrative text classification for automatic key phrase extraction in web document corpora

Netpal is a web-based dynamic knowledge base system designed to assist network administrators in their troubleshooting tasks, in recalling and storing experience, and in identifying new failure cases and their symptoms. In the context of web hosting environments, Netpal summarises network data and and supports retrieval of relevant organisational experience for system administrators. The system design draws on a variety of domains including knowledge management, information retrieval, machine learning and network management. We describe the system architecture, user interface design, user software testing and future directions for development.

https://web.cs.dal.ca/~zincir/bildiri/cascon08-atenms.pdf

NetPal: a dynamic network administration knowledge base

Malicious insider attacks represent one of the most damaging threats to networked systems of companies and government agencies. There is a unique set of challenges that come with insider threat detection in terms of hugely unbalanced data, limited ground truth, as well as behaviour drifts and shifts. This work proposes and evaluates a machine learning based system for user-centered insider threat detection. Using machine learning, analysis of data is performed on multiple levels of granularity under realistic conditions for identifying not only malicious behaviours, but also malicious insiders. Detailed analysis of popular insider threat scenarios with different performance measures are presented to facilitate the realistic estimation of system performance. Evaluation results show that the machine learning based detection system can learn from limited ground truth and detect new malicious insiders in unseen data with a high accuracy. Specifically, up to 85% of malicious insiders are detected at only 0.78% false positive rate. The system is also able to quickly detect the malicious behaviours, as low as 14 minutes after the first malicious action. Comprehensive result reporting allows the system to provide valuable insights to analysts in investigating insider threat cases.

Analyzing Data Granularity Levels for Insider Threat Detection Using Machine Learning

In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better detectors. Assuming a generic buffer overflow exploit, we evolve variants of the generic attack, with the objective of evading detection by signature-based methods. To do so, we pay particular attention to the formulation of an appropriate fitness function and partnering instruction set. Moreover, by making use of the intron behavior inherent in the genetic programming paradigm, we are able to explicitly obfuscate the true intent of the code. All the resulting attacks defeat the widely used 'Snort' Intrusion Detection System.

https://web.cs.dal.ca/~zincir/bildiri/gecco06-gmn.pdf

Nur Zincir-Heywood

Papers

World wide web site summarization

Narrative text classification for automatic key phrase extraction in web document corpora

NetPal: a dynamic network administration knowledge base

Analyzing Data Granularity Levels for Insider Threat Detection Using Machine Learning

On evolving buffer overflow attacks using genetic programming