A multi-objective strategy in genetic algorithms for gene selection of gene expression data

A microarray machine offers the capacity to measure the expression levels of thousands of genes simultaneously. It is used to collect information from tissue and cell samples regarding gene expression differences that could be useful for cancer classification. However, the urgent problems in the use of gene expression data are the availability of a huge number of genes relative to the small number of available samples, and the fact that many of the genes are not relevant to the classification. It has been shown that selecting a small subset of genes can lead to improved accuracy in the classification. Hence, this paper proposes a solution to the problems by using a multiobjective strategy in a genetic algorithm. This approach was tried on two benchmark gene expression data sets. It obtained encouraging results on those data sets as compared with an approach that used a single-objective strategy in a genetic algorithm. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Selecting informative genes from microarray data by using hybrid methods for cancer classification

Gene expression technology, namely microarrays, offers the ability to measure the expression levels of thousands of genes simultaneously in biological organisms. Microarray data are expected to be of significant help in the development of an efficient cancer diagnosis and classification platform. A major problem in these data is that the number of genes greatly exceeds the number of tissue samples. These data also have noisy genes. It has been shown in literature reviews that selecting a small subset of informative genes can lead to improved classification accuracy. Therefore, this paper aims to select a small subset of informative genes that are most relevant for cancer classification. To achieve this aim, an approach using two hybrid methods has been proposed. This approach is assessed and evaluated on two well-known microarray data sets, showing competitive results. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Feature Selection for Detecting ICMPv6-Based DDoS Attacks Using Binary Flower Pollination Algorithm

Internet Protocol version 6 (IPv6) is the latest version of IP that goal to host 3.4 × 10³⁸ unique IP addresses of devices in the network. IPv6 has introduced new features like Neighbour Discovery Protocol (NDP) and Address Auto-configuration Scheme. IPv6 needed several protocols like the Address Auto-configuration Scheme and Internet Control Message Protocol (ICMPv6). IPv6 is vulnerable to numerous attacks like Denial of Service (DoS) and Distributed Denial of Service (DDoS) which is one of the most dangerous attacks executed through ICMPv6 messages that impose security and financial implications. Therefore, an Intrusion Detection System (IDS) is a monitoring system of the security of a network that detects suspicious activities and deals with a massive amount of data comprised of repetitive and inappropriate features which affect the detection rate. A feature selection (FS) technique helps to reduce the computation time and complexity by selecting the optimum subset of features. This paper proposes a method for detecting DDoS flooding attacks (FA) based on ICMPv6 messages using a Binary Flower Pollination Algorithm (BFPA-FA). The proposed method (BFPA-FA) employs FS technology with a support vector machine (SVM) to identify the most relevant, influential features. Moreover, The ICMPv6-DDoS dataset was used to demonstrate the effectiveness of the proposed method through different attack scenarios. The results show that the proposed method BFPA-FA achieved the best accuracy rate (97.96%) for the ICMPv6 DDoS detection with a reduced number of features (9) to half the total (19) features. The proven proposed method BFPA-FA is effective in the ICMPv6 DDoS attacks via IDS.     

Hybrid image steganography method using Lempel Ziv Welch and genetic algorithms for hiding confidential data

Multidimensional Systems and Signal Processing - Digital images are commonly used in steganography due to the popularity of digital image transfer and exchange through the Internet. However, the...     

Quantification of the inherent uncertainty in the relaxation modulus and creep compliance of asphalt mixes

Advanced material characterization of asphalt concrete is essential for realistic and accurate performance prediction of flexible pavements. However, such characterization requires rigorous testing regimes that involve mechanical testing of a large number of laboratory samples at various conditions and set-ups. Advanced measurement instrumentation in addition to meticulous and accurate data analysis and analytical representation are also of high importance. Such steps as well as the heterogeneous nature of asphalt concrete (AC) constitute major factors of inherent variability. Thus, it is imperative to model and quantify the variability of the needed asphalt material’s properties, mainly the linear viscoelastic response functions such as: relaxation modulus, \(E(t)\), and creep compliance, \(D(t)\). The objective of this paper is to characterize the inherent uncertainty of both \(E(t)\) and \(D(t)\) over the time domain of their master curves. This is achieved through a probabilistic framework using Monte Carlo simulations and First Order approximations, utilizing \(E^{*}\) data for six AC mixes with at least eight replicates per mix. The study shows that the inherent variability, presented by the coefficient of variation (COV), in \(E(t)\) and \(D(t)\) is low at small reduced times, and increases with the increase in reduced time. At small reduced times, the COV in \(E(t)\) and \(D(t)\) are similar in magnitude; however, differences become significant at large reduced times. Additionally, the probability distributions and COVs of \(E(t)\) and \(D(t)\) are mix dependent. Finally, a case study is considered in which the inherent uncertainty in \(D(t)\) is forward propagated to assess the effect of variability on the predicted number of cycles to fatigue failure of an asphalt mix.     

An Improved Hybrid Indoor Positioning Algorithm via QPSO and MLP Signal Weighting

Accurate location or positioning of people and self-driven devices in large indoor environments has become an important necessity The application of increasingly automated self-operating moving transportation units, in large indoor spaces demands a precise knowledge of their positions. Technologies like WiFi and Bluetooth, despite their low-cost and availability, are sensitive to signal noise and fading effects. For these reasons, a hybrid approach, which uses two different signal sources, has proven to be more resilient and accurate for the positioning determination in indoor environments. Hence, this paper proposes an improved hybrid technique to implement a fingerprinting based indoor positioning, using Received Signal Strength information from available Wireless Local Area Network access points, together with the Wireless Sensor Networks technology. Six signals were recorded on a regular grid of anchor points, covering the research space. An optimization was performed by relative signal weighting, to minimize the average positioning error over the research space. The optimization process was conducted using a standard Quantum Particle Swarm Optimization, while the position error estimate for all given sets of weighted signals was performed using a Multilayer Perceptron (MLP) neural network. Compared to our previous research works, the MLP architecture was improved to three hidden layers and its learning parameters were finely tuned. These experimental results led to the 20% reduction of the positioning error when a suitable set of signal weights was calculated in the optimization process. Our final achieved value of 0.725 m of the location incertitude shows a sensible improvement compared to our previous results.     

The use of coevolution and the artificial immune system for ensemble learning

This paper presents two new approaches for constructing an ensemble of neural networks (NN) using coevolution and the artificial immune system (AIS). These approaches are extensions of the CLONal Selection Algorithm for building ENSembles (CLONENS) algorithm. An explicit diversity promotion technique was added to CLONENS and a novel coevolutionary approach to build neural ensembles is introduced, whereby two populations representing the gates and the individual NN are coevolved. The former population is responsible for defining the ensemble size and selecting the members of the ensemble. This population is evolved using the differential evolution algorithm. The latter population supplies the best individuals for building the ensemble, which is evolved by AIS. Results show that it is possible to automatically define the ensemble size being also possible to find smaller ensembles with good generalization performance on the tested benchmark regression problems. More interestingly, the use of the diversity measure during the evolutionary process did not necessarily improve generalization. In this case, diverse ensembles may be found using only implicit diversity promotion techniques.     

Simulation model for natural gas transmission pipeline network system

This paper focuses on developing a simulation model for the analysis of transmission pipeline network system (TPNS) with detailed characteristics of compressor stations. Compressor station is the key element in the TPNS since it provides energy to keep the gas moving. The simulation model is used to create a system that simulates TPNS with different configurations to get pressure and flow parameters. The mathematical formulations for the TPNS simulation were derived from the principles of flow of fluid through pipe, mass balance and compressor characteristics. In order to determine the unknown pressure and flow parameters, a visual C++ code was developed based on Newton–Raphson solution technique. Using the parameters obtained, the model evaluates the energy consumption for various configurations in order to guide for the selection of optimal TPNS. Results from the evaluations of the model with the existing TPNS and comparison with the existing approaches showed that the developed simulation model enabled to determine the operational parameters with less than 10 iterations. Hence, the simulation model could assist in decisions regarding the design and operations of the TPNS.     

Estimation of the minimum machining performance in the abrasive waterjet machining using integrated ANN-SA

In this study, Artificial Neural Network (ANN) and Simulated Annealing (SA) techniques were integrated labeled as integrated ANN-SA to estimate optimal process parameters in abrasive waterjet (AWJ) machining operation. The considered process parameters include traverse speed, waterjet pressure, standoff distance, abrasive grit size and abrasive flow rate. The quality of the cutting of machined-material is assessed by looking to the roughness average value (R_a). The optimal values of the process parameters are targeted for giving a minimum value of R_a. It was evidence that integrated ANN-SA is capable of giving much lower value of R_a at the recommended optimal process parameters compared to the result of experimental and ANN single-based modeling. The number of iterations for the optimal solutions is also decreased compared to the result of SA single-based optimization.     

Dynamic hybrid automatic repeat request (DHARQ) for WiMAX – Mobile multihop relay using adaptive power control

Wireless multihop network is currently attracting much attention as a new wireless broadband access technology due to numerous benefits. This work proposes a power control scheme for WiMAX multihop relay system. In contrast to existing power control and optimization approaches, our proposed method uses an adaptive Channel Quality Measurement for a relay station to reduce interferences to other mobile station (MS) or relay station (RS) within the same cell and hence increase the number of hops per link and consequently maximize the spatial reuse. The proposed power control is applied to a new dynamic HARQ algorithm for adaptive channel quality enhancement. Simulation results have indicated that the proposed approach achieves superior BER/PER performance enhancement in comparison to previous related works.