We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,th...We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,the rigid-flexible multi-body system of the UWG was simplified as a rigid system composed of“thruster+float body”,based on which a planar motion model of the UWG was established.Second,we obtained the model parameters using an empirical method combined with parameter identification,which means that some parameters were estimated by the empirical method.In view of the specificity and importance of the heading control,heading model parameters were identified through the artificial fish swarm algorithm based on tank test data,so that we could take full advantage of the limited trial data to factually describe the dynamic characteristics of the system.Based on the established heading motion model,parameters of the heading S-surface controller were optimized using the artificial fish swarm algorithm.Heading motion comparison and maritime control experiments of the“Ocean Rambler”UWG were completed.Tank test results show high precision of heading motion prediction including heading angle and yawing angular velocity.The UWG shows good control performance in tank tests and sea trials.The efficiency of the proposed method is verified.展开更多
The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor net...The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.展开更多
To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The se...To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.展开更多
Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the patte...Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult.Since OM find useful in business sectors to improve the quality of the product as well as services,machine learning(ML)and deep learning(DL)models can be considered into account.Besides,the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process.Therefore,in this paper,a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory(AFSO-BLSTM)model has been developed for OM process.The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data.In addition,the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process.Besides,BLSTM model is employed for the effectual detection and classification of opinions.Finally,the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model,shows the novelty of the work.A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
In this paper, a static weapon target assignment（WTA）problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, ...In this paper, a static weapon target assignment（WTA）problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, it is indispensable to design a target assignment model that can ensure minimizing targets survivability and weapons consumption simultaneously. Afterwards an algorithm named as improved artificial fish swarm algorithm-improved harmony search algorithm（IAFSA-IHS） is proposed to solve the problem. The effect of the proposed algorithm is demonstrated in numerical simulations, and results show that it performs positively in searching the optimal solution and solving the WTA problem.展开更多
Purpose-Conventional diagnostic techniques,on the other hand,may be prone to subjectivity since they depend on assessment of motions that are often subtle to individual eyes and hence hard to classify,potentially resu...Purpose-Conventional diagnostic techniques,on the other hand,may be prone to subjectivity since they depend on assessment of motions that are often subtle to individual eyes and hence hard to classify,potentially resulting in misdiagnosis.Meanwhile,early nonmotor signs of Parkinson’s disease(PD)can be mild and may be due to variety of other conditions.As a result,these signs are usually ignored,making early PD diagnosis difficult.Machine learning approaches for PD classification and healthy controls or individuals with similar medical symptoms have been introduced to solve these problems and to enhance the diagnostic and assessment processes of PD(like,movement disorders or other Parkinsonian syndromes).Design/methodology/approach-Medical observations and evaluation of medical symptoms,including characterization of a wide range of motor indications,are commonly used to diagnose PD.The quantity of the data being processed has grown in the last five years;feature selection has become a prerequisite before any classification.This study introduces a feature selection method based on the score-based artificial fish swarm algorithm(SAFSA)to overcome this issue.Findings-This study adds to the accuracy of PD identification by reducing the amount of chosen vocal features while to use the most recent and largest publicly accessible database.Feature subset selection in PD detection techniques starts by eliminating features that are not relevant or redundant.According to a few objective functions,features subset chosen should provide the best performance.Research limitations/implications-In many situations,this is an Nondeterministic Polynomial Time(NPHard)issue.This method enhances the PD detection rate by selecting the most essential features from the database.To begin,the data set’s dimensionality is reduced using Singular Value Decomposition dimensionality technique.Next,Biogeography-Based Optimization(BBO)for feature selection;the weight value is a vital parameter for finding the best features in PD classification.Originality/value-PD classification is done by using ensemble learning classification approaches such as hybrid classifier of fuzzy K-nearest neighbor,kernel support vector machines,fuzzy convolutional neural network and random forest.The suggested classifiers are trained using data from UCIMLrepository,and their results are verified using leave-one-person-out cross validation.The measures employed to assess the classifier efficiency include accuracy,F-measure,Matthews correlation coefficient.展开更多
Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Softwar...Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.展开更多
基金Project(51779052)supported by the National Natural Science Foundation of ChinaProject(QC2016062)supported by the Natural Science Foundation of Heilongjiang Province,China+2 种基金Project(614221503091701)supported by the Research Fund from Science and Technology on Underwater Vehicle Laboratory,ChinaProject(LBH-Q17046)supported by the Heilongjiang Postdoctoral Funds for Scientific Research Initiation,ChinaProject(HEUCFP201741)supported by the Fundamental Research Funds for the Central Universities,China
文摘We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,the rigid-flexible multi-body system of the UWG was simplified as a rigid system composed of“thruster+float body”,based on which a planar motion model of the UWG was established.Second,we obtained the model parameters using an empirical method combined with parameter identification,which means that some parameters were estimated by the empirical method.In view of the specificity and importance of the heading control,heading model parameters were identified through the artificial fish swarm algorithm based on tank test data,so that we could take full advantage of the limited trial data to factually describe the dynamic characteristics of the system.Based on the established heading motion model,parameters of the heading S-surface controller were optimized using the artificial fish swarm algorithm.Heading motion comparison and maritime control experiments of the“Ocean Rambler”UWG were completed.Tank test results show high precision of heading motion prediction including heading angle and yawing angular velocity.The UWG shows good control performance in tank tests and sea trials.The efficiency of the proposed method is verified.
基金financially supported by Natural Science Foundation of Heilongjiang Province of China[Grant No.LH2019F042].
文摘The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.
文摘To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number(RGP 2/142/43).
文摘Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult.Since OM find useful in business sectors to improve the quality of the product as well as services,machine learning(ML)and deep learning(DL)models can be considered into account.Besides,the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process.Therefore,in this paper,a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory(AFSO-BLSTM)model has been developed for OM process.The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data.In addition,the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process.Besides,BLSTM model is employed for the effectual detection and classification of opinions.Finally,the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model,shows the novelty of the work.A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.
文摘In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
基金supported by the National Natural Science Foundation of China(61472441)
文摘In this paper, a static weapon target assignment（WTA）problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, it is indispensable to design a target assignment model that can ensure minimizing targets survivability and weapons consumption simultaneously. Afterwards an algorithm named as improved artificial fish swarm algorithm-improved harmony search algorithm（IAFSA-IHS） is proposed to solve the problem. The effect of the proposed algorithm is demonstrated in numerical simulations, and results show that it performs positively in searching the optimal solution and solving the WTA problem.
文摘Purpose-Conventional diagnostic techniques,on the other hand,may be prone to subjectivity since they depend on assessment of motions that are often subtle to individual eyes and hence hard to classify,potentially resulting in misdiagnosis.Meanwhile,early nonmotor signs of Parkinson’s disease(PD)can be mild and may be due to variety of other conditions.As a result,these signs are usually ignored,making early PD diagnosis difficult.Machine learning approaches for PD classification and healthy controls or individuals with similar medical symptoms have been introduced to solve these problems and to enhance the diagnostic and assessment processes of PD(like,movement disorders or other Parkinsonian syndromes).Design/methodology/approach-Medical observations and evaluation of medical symptoms,including characterization of a wide range of motor indications,are commonly used to diagnose PD.The quantity of the data being processed has grown in the last five years;feature selection has become a prerequisite before any classification.This study introduces a feature selection method based on the score-based artificial fish swarm algorithm(SAFSA)to overcome this issue.Findings-This study adds to the accuracy of PD identification by reducing the amount of chosen vocal features while to use the most recent and largest publicly accessible database.Feature subset selection in PD detection techniques starts by eliminating features that are not relevant or redundant.According to a few objective functions,features subset chosen should provide the best performance.Research limitations/implications-In many situations,this is an Nondeterministic Polynomial Time(NPHard)issue.This method enhances the PD detection rate by selecting the most essential features from the database.To begin,the data set’s dimensionality is reduced using Singular Value Decomposition dimensionality technique.Next,Biogeography-Based Optimization(BBO)for feature selection;the weight value is a vital parameter for finding the best features in PD classification.Originality/value-PD classification is done by using ensemble learning classification approaches such as hybrid classifier of fuzzy K-nearest neighbor,kernel support vector machines,fuzzy convolutional neural network and random forest.The suggested classifiers are trained using data from UCIMLrepository,and their results are verified using leave-one-person-out cross validation.The measures employed to assess the classifier efficiency include accuracy,F-measure,Matthews correlation coefficient.
文摘Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.
