Muddassar Farooq

Bio: Muddassar Farooq is an academic researcher from National University of Computer and Emerging Sciences. The author has contributed to research in topics: Routing protocol & Malware. The author has an hindex of 28, co-authored 89 publications receiving 3854 citations. Previous affiliations of Muddassar Farooq include Institute of Space Technology & Center for Advanced Studies in Engineering.

Applications of Evolutionary Computing

Abstract: EvoCOMNET Contributions.- Web Application Security through Gene Expression Programming.- Location Discovery in Wireless Sensor Networks Using a Two-Stage Simulated Annealing.- Wireless Communications for Distributed Navigation in Robot Swarms.- An Evolutionary Algorithm for Survivable Virtual Topology Mapping in Optical WDM Networks.- Extremal Optimization as a Viable Means for Mapping in Grids.- Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach.- A Framework for Evolutionary Peer-to-Peer Overlay Schemes.- Multiuser Scheduling in HSDPA with Particle Swarm Optimization.- Efficient Signal Processing and Anomaly Detection in Wireless Sensor Networks.- Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms.- Evolving High-Speed, Easy-to-Understand Network Intrusion Detection Rules with Genetic Programming.- Soft Computing Techniques for Internet Backbone Traffic Anomaly Detection.- Testing Detector Parameterization Using Evolutionary Exploit Generation.- Ant Routing with Distributed Geographical Localization of Knowledge in Ad-Hoc Networks.- Discrete Particle Swarm Optimization for Multiple Destination Routing Problems.- EvoENVIRONMENT Contributions.- Combining Back-Propagation and Genetic Algorithms to Train Neural Networks for Ambient Temperature Modeling in Italy.- Estimating the Concentration of Nitrates in Water Samples Using PSO and VNS Approaches.- Optimal Irrigation Scheduling with Evolutionary Algorithms.- Adaptive Land-Use Management in Dynamic Ecological System.- EvoFIN Contributions.- Evolutionary Money Management.- Prediction of Interday Stock Prices Using Developmental and Linear Genetic Programming.- An Introduction to Natural Computing in Finance.- Evolutionary Approaches for Estimating a Coupled Markov Chain Model for Credit Portfolio Risk Management.- Knowledge Patterns in Evolutionary Decision Support Systems for Financial Time Series Analysis.- Predicting Turning Points in Financial Markets with Fuzzy-Evolutionary and Neuro-Evolutionary Modeling.- Comparison of Multi-agent Co-operative Co-evolutionary and Evolutionary Algorithms for Multi-objective Portfolio Optimization.- Dynamic High Frequency Trading: A Neuro-Evolutionary Approach.- EvoGAMES Contributions.- Decay of Invincible Clusters of Cooperators in the Evolutionary Prisoner's Dilemma Game.- Evolutionary Equilibria Detection in Non-cooperative Games.- Coevolution of Competing Agent Species in a Game-Like Environment.- Simulation Minus One Makes a Game.- Evolving Simple Art-Based Games.- Swarming for Games: Immersion in Complex Systems.- Fitness Diversity Parallel Evolution Algorithms in the Turtle Race Game.- Evolving Strategies for Non-player Characters in Unsteady Environments.- Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go.- Evolving Teams of Cooperating Agents for Real-Time Strategy Game.- EvoHOT Contributions.- Design Optimization of Radio Frequency Discrete Tuning Varactors.- An Evolutionary Path Planner for Multiple Robot Arms.- Evolutionary Optimization of Number of Gates in PLA Circuits Implemented in VLSI Circuits.- Particle Swarm Optimisation as a Hardware-Oriented Meta-heuristic for Image Analysis.- EvoIASP Contributions.- A Novel GP Approach to Synthesize Vegetation Indices for Soil Erosion Assessment.- Flies Open a Door to SLAM.- Genetic Image Network for Image Classification.- Multiple Network CGP for the Classification of Mammograms.- Evolving Local Descriptor Operators through Genetic Programming.- Evolutionary Optimization for Plasmon-Assisted Lithography.- An Improved Multi-objective Technique for Fuzzy Clustering with Application to IRS Image Segmentation.- EvoINTERACTION Contributions.- Interactive Evolutionary Evaluation through Spatial Partitioning of Fitness Zones.- Fractal Evolver: Interactive Evolutionary Design of Fractals with Grid Computing.- Humorized Computational Intelligence towards User-Adapted Systems with a Sense of Humor.- Innovative Chance Discovery - Extracting Customers' Innovative Concept.- EvoMUSART Contributions.- Evolving Approximate Image Filters.- On the Role of Temporary Storage in Interactive Evolution.- Habitat: Engineering in a Simulated Audible Ecosystem.- The Evolution of Evolutionary Software: Intelligent Rhythm Generation in Kinetic Engine.- Filterscape: Energy Recycling in a Creative Ecosystem.- Evolved Ricochet Compositions.- Life's What You Make: Niche Construction and Evolutionary Art.- Global Expectation-Violation as Fitness Function in Evolutionary Composition.- Composing Using Heterogeneous Cellular Automata.- On the Socialization of Evolutionary Art.- An Evolutionary Music Composer Algorithm for Bass Harmonization.- Generation of Pop-Rock Chord Sequences Using Genetic Algorithms and Variable Neighborhood Search.- Elevated Pitch: Automated Grammatical Evolution of Short Compositions.- A GA-Based Control Strategy to Create Music with a Chaotic System.- Teaching Evolutionary Design Systems by Extending "Context Free".- Artificial Nature: Immersive World Making.- Evolving Indirectly Represented Melodies with Corpus-Based Fitness Evaluation.- Hearing Thinking.- EvoNUM Contributions.- Memetic Variation Local Search vs. Life-Time Learning in Electrical Impedance Tomography.- Estimating HMM Parameters Using Particle Swarm Optimisation.- Modeling Pheromone Dispensers Using Genetic Programming.- NK Landscapes Difficulty and Negative Slope Coefficient: How Sampling Influences the Results.- On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies.- Adaptability of Algorithms for Real-Valued Optimization.- A Stigmergy-Based Algorithm for Continuous Optimization Tested on Real-Life-Like Environment.- Stochastic Local Search Techniques with Unimodal Continuous Distributions: A Survey.- Evolutionary Optimization Guided by Entropy-Based Discretization.- EvoSTOC Contributions.- The Influence of Population and Memory Sizes on the Evolutionary Algorithm's Performance for Dynamic Environments.- Differential Evolution with Noise Analyzer.- An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems.- Dynamic Time-Linkage Problems Revisited.- The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation.- Impact of Frequency and Severity on Non-Stationary Optimization Problems.- A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation.- EvoTRANSLOG Contributions.- Evolutionary Freight Transportation Planning.- An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem.- A Corridor Method-Based Algorithm for the Pre-marshalling Problem.- Comparison of Metaheuristic Approaches for Multi-objective Simulation-Based Optimization in Supply Chain Inventory Management.- Heuristic Algorithm for Coordination in Public Transport under Disruptions.- Optimal Co-evolutionary Strategies for the Competitive Maritime Network Design Problem.

BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior

Abstract: Bees organize their foraging activities as a social and communicative effort, indicating both the direction, distance and quality of food sources to their fellow foragers through a ”dance” inside the bee hive (on the ”dance floor”). In this paper we present a novel routing algorithm, BeeHive, which has been inspired by the communicative and evaluative methods and procedures of honey bees. In this algorithm, bee agents travel through network regions called foraging zones. On their way their information on the network state is delivered for updating the local routing tables. BeeHive is fault tolerant, scalable, and relies completely on local, or regional, information, respectively. We demonstrate through extensive simulations that BeeHive achieves a similar or better performance compared to state-of-the-art algorithms.

PE-Miner: Mining Structural Information to Detect Malicious Executables in Realtime

Abstract: In this paper, we present an accurate and realtime PE-Miner framework that automatically extracts distinguishing features from portable executables (PE) to detect zero-day (i.e. previously unknown) malware. The distinguishing features are extracted using the structural information standardized by the Microsoft Windows operating system for executables, DLLs and object files. We follow a threefold research methodology: (1) identify a set of structural features for PE files which is computable in realtime, (2) use an efficient preprocessor for removing redundancy in the features' set, and (3) select an efficient data mining algorithm for final classification between benign and malicious executables. We have evaluated PE-Miner on two malware collections, VX Heavens and Malfease datasets which contain about 11 and 5 thousand malicious PE files respectively. The results of our experiments show that PE-Miner achieves more than 99% detection rate with less than 0.5% false alarm rate for distinguishing between benign and malicious executables. PE-Miner has low processing overheads and takes only 0.244 seconds on the average to scan a given PE file. Finally, we evaluate the robustness and reliability of PE-Miner under several regression tests. Our results show that the extracted features are robust to different packing techniques and PE-Miner is also resilient to majority of crafty evasion strategies.

BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior

Abstract: In this paper we present BeeAdHoc, a new routing algorithm for energy efficient routing in mobile ad hoc networks. The algorithm is inspired by the foraging principles of honey bees. The algorithm mainly utilizes two types of agents, scouts and foragers, for doing routing in mobile ad hoc networks. BeeAdHoc is a reactive source routing algorithm and it consumes less energy as compared to existing state-of-the-art routing algorithms because it utilizes less control packets to do routing. The results of our extensive simulation experiments show that BeeAdHoc consumes significantly less energy as compared to DSR, AODV, and DSDV, which are state-of-the-art routing algorithms, without making any compromise on traditional performance metrics (packet delivery ratio, delay and throughput).

A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm

Abstract: Swarm intelligence is a research branch that models the population of interacting agents or swarms that are able to self-organize. An ant colony, a flock of birds or an immune system is a typical example of a swarm system. Bees' swarming around their hive is another example of swarm intelligence. Artificial Bee Colony (ABC) Algorithm is an optimization algorithm based on the intelligent behaviour of honey bee swarm. In this work, ABC algorithm is used for optimizing multivariable functions and the results produced by ABC, Genetic Algorithm (GA), Particle Swarm Algorithm (PSO) and Particle Swarm Inspired Evolutionary Algorithm (PS-EA) have been compared. The results showed that ABC outperforms the other algorithms.

On the performance of artificial bee colony (ABC) algorithm

Abstract: Artificial bee colony (ABC) algorithm is an optimization algorithm based on a particular intelligent behaviour of honeybee swarms. This work compares the performance of ABC algorithm with that of differential evolution (DE), particle swarm optimization (PSO) and evolutionary algorithm (EA) for multi-dimensional numeric problems. The simulation results show that the performance of ABC algorithm is comparable to those of the mentioned algorithms and can be efficiently employed to solve engineering problems with high dimensionality.