Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Adaptive Particle Swarm Optimization Data Hiding for High Security Secret Image Sharing

The main aim of this work is to improve the security of data hiding forsecret image sharing. The privacy and security of digital information have becomea primary concern nowadays due to the enormous usage of digital technology.The security and the privacy of users’ images are ensured through reversible datahiding techniques. The efficiency of the existing data hiding techniques did notprovide optimum performance with multiple end nodes. These issues are solvedby using Separable Data Hiding and Adaptive Particle Swarm Optimization(SDHAPSO) algorithm to attain optimal performance. Image encryption, dataembedding, data extraction/image recovery are the main phases of the proposedapproach. DFT is generally used to extract the transform coefficient matrix fromthe original image. DFT coefficients are in float format, which assists in transforming the image to integral format using the round function. After obtainingthe encrypted image by data-hider, additional data embedding is formulated intohigh-frequency coefficients. The proposed SDHAPSO is mainly utilized for performance improvement through optimal pixel location selection within the imagefor secret bits concealment. In addition, the secret data embedding capacityenhancement is focused on image visual quality maintenance. Hence, it isobserved from the simulation results that the proposed SDHAPSO techniqueoffers high-level security outcomes with respect to higher PSNR, security level,lesser MSE and higher correlation than existing techniques. Hence, enhancedsensitive information protection is attained, which improves the overall systemperformance.

ECGID:a human identification method based on adaptive particle swarm optimization and the bidirectional LSTM model

Physiological signal based biometric analysis has recently attracted attention as a means of meeting increasing privacy and security requirements.The real-time nature of an electrocardiogram(ECG)and the hidden nature of the information make it highly resistant to attacks.This paper focuses on three major bottlenecks of existing deep learning driven approaches:the lengthy time requirements for optimizing the hyperparameters,the slow and computationally intense identification process,and the unstable and complicated nature of ECG acquisition.We present a novel deep neural network framework for learning human identification feature representations directly from ECG time series.The proposed framework integrates deep bidirectional long short-term memory(BLSTM)and adaptive particle swarm optimization(APSO).The overall approach not only avoids the inefficient and experience-dependent search for hyperparameters,but also fully exploits the spatial information of ordinal local features and the memory characteristics of a recognition algorithm.The effectiveness of the proposed approach is thoroughly evaluated in two ECG datasets,using two protocols,simulating the influence of electrode placement and acquisition sessions in identification.Comparing four recurrent neural network structures and four classical machine learning and deep learning algorithms,we prove the superiority of the proposed algorithm in minimizing overfitting and self-learning of time series.The experimental results demonstrated an average identification rate of 97.71%,99.41%,and 98.89% in training,validation,and test sets,respectively.Thus,this study proves that the application of APSO and LSTM techniques to biometric human identification can achieve a lower algorithm engineering effort and higher capacity for generalization.

Adaptive particle swarm optimized fuzzy algorithm to predict water table elevation

This study helps to select the length for fuzzy sets in fuzzy time series prediction.In order to examine the effect of intervals and evaluate the efficiency of the proposed algorithm,numerical data of water recharge and discharge are considered to predict water table elevation fluctuation(WTEF).Particle swarm optimization(PSO)is an influential tool to handle optimization of multi-model problems,whereas fuzzy logic can handle uncertainty.In this paper,adaptive inertia weights are adopted rather than static inertia weights for PSO,which further improves efficiency of PSO.This modified PSO is termed as adaptive particle swarm optimization(APSO).APSO optimizes the intervals and these intervals are further used to generate fuzzy sets for prediction.The results indicate that the APSO performs better than PSO and genetic algorithm approaches for the same problem.

A New Clustering Algorithm Using Adaptive Discrete Particle Swarm Optimization in Wireless Sensor Network

Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.

Improved Prediction of Metamaterial Antenna Bandwidth Using Adaptive Optimization of LSTM

The design of an antenna requires a careful selection of its parameters to retain the desired performance.However,this task is time-consuming when the traditional approaches are employed,which represents a significant challenge.On the other hand,machine learning presents an effective solution to this challenge through a set of regression models that can robustly assist antenna designers to find out the best set of design parameters to achieve the intended performance.In this paper,we propose a novel approach for accurately predicting the bandwidth of metamaterial antenna.The proposed approach is based on employing the recently emerged guided whale optimization algorithm using adaptive particle swarm optimization to optimize the parameters of the long-short-term memory(LSTM)deep network.This optimized network is used to retrieve the metamaterial bandwidth given a set of features.In addition,the superiority of the proposed approach is examined in terms of a comparison with the traditional multilayer perceptron(ML),Knearest neighbors(K-NN),and the basic LSTM in terms of several evaluation criteria such as root mean square error(RMSE),mean absolute error(MAE),and mean bias error(MBE).Experimental results show that the proposed approach could achieve RMSE of(0.003018),MAE of(0.001871),and MBE of(0.000205).These values are better than those of the other competing models.

An intelligent approach for flight risk prediction under icing conditions

Flight risk prediction is significant in improving the flight crew's situational awareness because it allows them to adopt appropriate operation strategies to prevent risk expansion caused by abnormal conditions,especially aircraft icing conditions.The flight risk space representing the nonlinear mapping relations between risk degree and the three-dimensional commanded vector(commanded airspeed,commanded bank angle,and commanded vertical velocity)is developed to provide the crew with practical risk information.However,the construction of flight risk space by means of computational flight dynamics suffers from certain defects,including slow computing speed.Accordingly,an intelligent approach for flight risk prediction is proposed to address these defects based on neural networks.Radial Basis Function Neural Network(RBFNN)is optimized using Adaptive Particle Swarm Optimization(APSO).To optimize both the parameters and the structure of APSO-RBFNN,a fitness function containing the training accuracy and network structure size is proposed.Extensive experimental results demonstrate that the flight risk predicted by APSO-RBFNN is very close to that obtained via computational flight dynamics.The average error(RMSE)is less than 10^(-1).The approach achieves a speedup close to 1000x compared with computational flight dynamics.In addition,some flight upset and recovery cases are presented to illustrate the efficiency of the intelligent approach for flight risk prediction.