An Improved Jump Spider Optimization for Network Traffic Identification Feature Selection

The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks.Recently,machine learning has beenwidely applied to network traffic recognition.Still,high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms.Taking advantage of the faster optimizationseeking capability of the jumping spider optimization algorithm(JSOA),this paper proposes a jumping spider optimization algorithmthat incorporates the harris hawk optimization(HHO)and small hole imaging(HHJSOA).We use it in network traffic identification feature selection.First,the method incorporates the HHO escape energy factor and the hard siege strategy to forma newsearch strategy for HHJSOA.This location update strategy enhances the search range of the optimal solution of HHJSOA.We use small hole imaging to update the inferior individual.Next,the feature selection problem is coded to propose a jumping spiders individual coding scheme.Multiple iterations of the HHJSOA algorithmfind the optimal individual used as the selected feature for KNN classification.Finally,we validate the classification accuracy and performance of the HHJSOA algorithm using the UNSW-NB15 dataset and KDD99 dataset.Experimental results show that compared with other algorithms for the UNSW-NB15 dataset,the improvement is at least 0.0705,0.00147,and 1 on the accuracy,fitness value,and the number of features.In addition,compared with other feature selectionmethods for the same datasets,the proposed algorithmhas faster convergence,better merit-seeking,and robustness.Therefore,HHJSOAcan improve the classification accuracy and solve the problem that the network traffic recognition algorithm needs to be faster to converge and easily fall into local optimum due to high-dimensional features.

Intelligent risk identification of gas drilling based on nonlinear classification network

During the transient process of gas drilling conditions,the monitoring data often has obvious nonlinear fluctuation features,which leads to large classification errors and time delays in the commonly used intelligent classification models.Combined with the structural features of data samples obtained from monitoring while drilling,this paper uses convolution algorithm to extract the correlation features of multiple monitoring while drilling parameters changing with time,and applies RBF network with nonlinear classification ability to classify the features.In the training process,the loss function component based on distance mean square error is used to effectively adjust the best clustering center in RBF.Many field applications show that,the recognition accuracy of the above nonlinear classification network model for gas production,water production and drill sticking is 97.32%,95.25%and 93.78%.Compared with the traditional convolutional neural network(CNN)model,the network structure not only improves the classification accuracy of conditions in the transition stage of conditions,but also greatly advances the time points of risk identification,especially for the three common risk identification points of gas production,water production and drill sticking,which are advanced by 56,16 and 8 s.It has won valuable time for the site to take correct risk disposal measures in time,and fully demonstrated the applicability of nonlinear classification neural network in oil and gas field exploration and development.

A new PQ disturbances identification method based on combining neural network with least square weighted fusion algorithm

A new method for power quality (PQ) disturbances identification is brought forward based on combining a neural network with least square (LS) weighted fusion algorithm. The characteristic components of PQ disturbances are distilled through an improved phase-located loop (PLL) system at first, and then five child BP ANNs with different structures are trained and adopted to identify the PQ disturbances respectively. The combining neural network fuses the identification results of these child ANNs with LS weighted fusion algorithm, and identifies PQ disturbances with the fused result finally. Compared with a single neural network, the combining one with LS weighted fusion algorithm can identify the PQ disturbances correctly when noise is strong. However, a single neural network may fail in this case. Furthermore, the combining neural network is more reliable than a single neural network. The simulation results prove the conclusions above.

Identification Simulation for Dynamical System Based on Genetic Algorithm and Recurrent Multilayer Neural Network

Identification simulation for dynamical system which is based on genetic algorithm (GA) and recurrent multilayer neural network (RMNN) is presented. In order to reduce the inputs of the model, RMNN which can remember and store some previous parameters is used for identifier. And for its high efficiency and optimization, genetic algorithm is introduced into training RMNN. Simulation results show the effectiveness of the proposed scheme. Under the same training algorithm, the identification performance of RMNN is superior to that of nonrecurrent multilayer neural network (NRMNN).

A Physical Layer Network Coding Based Tag Anti-Collision Algorithm for RFID System

In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.

An Improved Differential Evolution Trained Neural Network Scheme for Nonlinear System Identification

This paper presents an improved nonlinear system identification scheme using di？erential evolution （DE）, neural network （NN） and Levenberg Marquardt algorithm （LM）. With a view to achieve better convergence of NN weights optimization during the training, the DE and LM are used in a combined framework to train the NN. We present the convergence analysis of the DE and demonstrate the efficacy of the proposed improved system identification algorithm by exploiting the combined DE and LM training of the NN and suitably implementing it together with other system identification methods, namely NN and DE＋NN on a number of examples including a practical case study. The identification results obtained through a series of simulation studies of these methods on different nonlinear systems demonstrate that the proposed DE and LM trained NN approach to nonlinear system identification can yield better identification results in terms of time of convergence and less identification error.

An Optimized Damage Identification Method of Beam Using Wavelet and Neural Network

An optimized damage identification method of beam combined wavelet with neural network is presented in an attempt to improve the calculation iterative speed and accuracy damage identification. The mathematical model is developed to identify the structure damage based on the theory of finite elements and rotation modal parameters. The model is integrated with BP neural network optimization approach which utilizes the Genetic algorithm optimization method. The structural rotation modal parameters are performed with the continuous wavelet transform through the Mexico hat wavelet. The location of structure damage is identified by the maximum of wavelet coefficients. Then, the multi-scale wavelet coefficients modulus maxima are used as the inputs of the BP neural network, and through training and updating the optimal weight and threshold value to obtain the ideal output which is used to describe the degree of structural damage. The obtained results demonstrate the effectiveness of the proposed approach in simultaneously improving the structural damage identification precision including the damage locating and severity.

PARAMETER IDENTIFICATION FOR MODELING RIVER NETWORK USING A GENETIC ALGORITHM

The simulation of a one-dimensional river network needs to solve the Saint-Venant equations,in which the variable parameters normally have a significant influence on the model accuracy.A Trial-and-Error approach is a most commonly adopted method of parameter calibration,however,this method is time-consuming and requires experience to select the appropriate values of parameter.Consequently,simulated results obtained via this method usually differ between practitioners.This article combines a hydrodynamic model with an intelligent model originated from the Genetic Algorithm（GA） technique,in order to provide an intelligent simulation method that can optimize the parameters automatically.Compared with current approaches,the method presented in this article is simpler,its dependence on field data is lower,and the model accuracy is higher.When the optimized parameters are taken into the hydrodynamic numerical model,a good agreement is attained between the simulated results and the field data.

Using genetic algorithm to learn neural network identifier for modeling gyro startup drift rate

Studies the modeling of gyro startup drift rate from acquired experimental gyro startup drift rate data and the nonlinear dynamic models of gyro startup drift rate related temperature established by time delay neural network which enables the gyro temperature drift rate to be compensated in the process of startup and the gyro instant startup to be implemented. And introduces an improved genetic algorithm to learn the weights of neural network identifier to avoid stacking into the local minimal value and achieve rapid convergence.

An Improved Gravitational Search Algorithm for Dynamic Neural Network Identification

Gravitational search algorithm(GSA) is a newly developed and promising algorithm based on the law of gravity and interaction between masses. This paper proposes an improved gravitational search algorithm(IGSA) to improve the performance of the GSA, and first applies it to the field of dynamic neural network identification. The IGSA uses trial-and-error method to update the optimal agent during the whole search process. And in the late period of the search, it changes the orbit of the poor agent and searches the optimal agent s position further using the coordinate descent method. For the experimental verification of the proposed algorithm,both GSA and IGSA are testified on a suite of four well-known benchmark functions and their complexities are compared. It is shown that IGSA has much better efficiency, optimization precision, convergence rate and robustness than GSA. Thereafter, the IGSA is applied to the nonlinear autoregressive exogenous(NARX) recurrent neural network identification for a magnetic levitation system.Compared with the system identification based on gravitational search algorithm neural network(GSANN) and other conventional methods like BPNN and GANN, the proposed algorithm shows the best performance.

Neural Network Predictive Control of Variable-pitch Wind Turbines Based on Small-world Optimization Algorithm

通过将混沌映射用于产生初始节点集和进行算子构造,提出一种新的基于实数编码的混沌小世界优化算法。采用4种算法对多例复杂函数的优化问题进行仿真试验,表明所提算法具有能够有效避免陷入局部极小值、快速搜索到最优值的能力。将上述方法应用于变桨距风电机组启动并网时的转速控制,提出一种基于混沌小世界优化算法的神经网络预测控制策略,其预测模型由基于现场数据的神经网络模型建立。仿真与实际测试结果表明,该系统可以根据风速扰动提前预测电机的转速变化,使控制器超前动作,保证系统输出跟踪参考轨迹的方向稳步改变,确保风电机组平稳并网。

Improved sparrow search algorithm for RFID network planning

To solve the problem that the performance of the coverage,interference rate,load balance andweak power in the radio frequency identification(RFID)network planning.This paper proposes an elite opposition-based learning and Lévy flight sparrow search algorithm(SSA),which is named elite opposition-based learning and Levy flight SSA(ELSSA).First,the algorithm initializes the population by an elite opposed-based learning strategy to enhance the diversity of the population.Second,Lévy flight is introduced into the scrounger’s position update formula to solve the situation that the algorithm falls into the local optimal solution.It has a probability that the current position is changed by Lévy flight.This method can jump out of the local optimal solution.In the end,the proposed method is compared with particle swarm optimization(PSO)algorithm,grey wolf optimzer(GWO)algorithm and SSA in the multiple simulation tests.The simulated results showed that,under the same number of readers,the average fitness of the ELSSA is improved respectively by 3.36%,5.67%and 18.45%.By setting the different number of readers,ELSSA uses fewer readers than other algorithms.The conclusion shows that the proposed method can ensure a satisfying coverage by using fewer readers and achieving higher comprehensive performance.

Random mating mayfly algorithm for RFID network planning

In order to improve robustness and efficiency of the radio frequency identification(RFID)network,a random mating mayfly algorithm(RMMA)was proposed.Firstly,RMMA introduced the mechanism of random mating into the mayfly algorithm(MA),which improved the population diversity and enhanced the exploration ability of the algorithm in the early stage,and find a better solution to the RFID nework planning(RNP)problem.Secondly,in RNP,tags are usually placed near the boundaries of the working space,so the minimum boundary mutation strategy was proposed to make sure the mayflies which beyond the boundary can keep the original search direction,as to enhance the ability of searching near the boundary.Lastly,in order to measure the performance of RMMA,the algorithm is then benchmarked on three well-known classic test functions,and the results are verified by a comparative study with particle swarm optimization(PSO),grey wolf optimization(GWO),and MA.The results show that the RMMA algorithm is able to provide very competitive results compared to these well-known meta-heuristics,RMMA is also applied to solve RNP problems.The performance evaluation shows that RMMA achieves higher coverage than the other three algorithms.When the number of readers is the same,RMMA can obtain lower interference and get a better load balance in each instance compared with other algorithms.RMMA can also solve RNP problem stably and efficiently when the number and position of tags change over time.

An optimized Parkinson’s disorder identification through evolutionary fast learning network

Purpose-Parkinson’s disease(PD)is a well-known complex neurodegenerative disease.Typically,its identification is based on motor disorders,while the computer estimation of its main symptoms with computational machine learning(ML)has a high exposure which is supported by researches conducted.Nevertheless,ML approaches required first to refine their parameters and then to work with the best model generated.This process often requires an expert user to oversee the performance of the algorithm.Therefore,an attention is required towards new approaches for better forecasting accuracy.Design/methodology/approach-To provide an available identification model for Parkinson disease as an auxiliary function for clinicians,the authors suggest a new evolutionary classification model.The core of the prediction model is a fast learning network(FLN)optimized by a genetic algorithm(GA).To get a better subset of features and parameters,a new coding architecture is introduced to improve GA for obtaining an optimal FLN model.Findings-The proposed model is intensively evaluated through a series of experiments based on Speech and HandPD benchmark datasets.The very popular wrappers induction models such as support vector machine(SVM),K-nearest neighbors(KNN)have been tested in the same condition.The results support that the proposed model can achieve the best performances in terms of accuracy and g-mean.Originality/value-A novel efficient PD detectionmodel is proposed,which is called A-W-FLN.The A-W-FLN utilizes FLN as the base classifier;in order to take its higher generalization ability,and identification capability is alsoembedded to discover themost suitable featuremodel in the detection process.Moreover,the proposedmethod automatically optimizes the FLN’s architecture to a smaller number of hidden nodes and solid connecting weights.This helps the network to train on complex PD datasets with non-linear features and yields superior result.

On-Line Real Time Realization and Application of Adaptive Fuzzy Inference Neural Network

In this paper, a modeling algorithm developed by transferring the adaptive fuzzy inference neural network into an on-line real time algorithm, combining the algorithm with conventional system identification method and applying them to separate identification of nonlinear multi-variable systems is introduced and discussed.

Efficient Numerical Optimization Algorithm Based on New Real-Coded Genetic Algorithm, AREX + JGG, and Application to the Inverse Problem in Systems Biology

In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.

AN ENHANCEMENT SCHEME OF TCP PROTOCOL IN MOBILE AD HOC NETWORKS:MME-TCP

Transmission Control Protocol (TCP) optimization in Mobile Ad hoc NETworks (MANETs) is a challenging issue because of some unique characteristics of MANETs. In this paper,a new end-to-end mechanism based on multiple metrics measurement is proposed to improve TCP performance in MANETs. Multi-metric Measurement based Enhancement of TCP (MME-TCP) designs the metrics and the identification algorithm according to the characteristics of MANETs and the experiment results. Furthermore,these metrics are measured at the sender node to reduce the overhead of control information over networks. Simulation results show that MME-TCP mechanism achieves a significant performance improvement over standard TCP in MANETs.

Automatic Identification Fingerprint Based on Machine Learning Method

The fingerprint identification technology has been developed and applied effectively to security systems in financial transactions,personal information security,national security,and other fields.In this paper,we proposed the development of a fingerprint identification system based on image processing methods that clarify fingerprint contours,using machine learning methods to increase processing speed and increase the accuracy of the fingerprint identification process.The identification system consists of the following main steps:improving image quality and image segmentation to identify the fingerprint area,extracting features,and matching the database.The accuracy of the system reached 97.75%on the mixed high-and low-quality fingerprint database.