Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
The adaptive filtering algorithm with a fixed projection order is unable to adjust its performance in response to changes in the external environment of airborne radars.To overcome this limitation,a new approach is in...The adaptive filtering algorithm with a fixed projection order is unable to adjust its performance in response to changes in the external environment of airborne radars.To overcome this limitation,a new approach is introduced,which is the variable projection order Ekblom norm-promoted adaptive algorithm(VPO-EPAA).The method begins by examining the mean squared deviation(MSD)of the EPAA,deriving a formula for its MSD.Next,it compares the MSD of EPAA at two different projection orders and selects the one that minimizes the MSD as the parameter for the current iteration.Furthermore,the algorithm’s computational complexity is analyzed theoretically.Simulation results from system identification and self-interference cancellation show that the proposed algorithm performs exceptionally well in airborne radar signal self-interference cancellation,even under various noise intensities and types of interference.展开更多
An automated method to optimize the definition of the progress variables in the flamelet-based dimension reduction is proposed. The performance of these optimized progress variables in coupling the flamelets and flow ...An automated method to optimize the definition of the progress variables in the flamelet-based dimension reduction is proposed. The performance of these optimized progress variables in coupling the flamelets and flow solver is presented. In the proposed method, the progress variables are defined according to the first two principal components （PCs） from the principal component analysis （PCA） or kernel-density-weighted PCA （KEDPCA） of a set of flamelets. These flamelets can then be mapped to these new progress variables instead of the mixture fraction/conventional progress variables. Thus, a new chemistry look-up table is constructed. A priori validation of these optimized progress variables and the new chemistry table is implemented in a CH4/N2/air lift-off flame. The reconstruction of the lift-off flame shows that the optimized progress variables perform better than the conventional ones, especially in the high temperature area. The coefficient determinations （R2 statistics） show that the KEDPCA performs slightly better than the PCA except for some minor species. The main advantage of the KEDPCA is that it is less sensitive to the database. Meanwhile, the criteria for the optimization are proposed and discussed. The constraint that the progress variables should monotonically evolve from fresh gas to burnt gas is analyzed in detail.展开更多
The character variable discrete numeralization destroyed the disorder of character variables. As text classification problem contains more character variable, discrete numeralization approach affects the classificatio...The character variable discrete numeralization destroyed the disorder of character variables. As text classification problem contains more character variable, discrete numeralization approach affects the classification performance of classifiers. In this paper, we propose a character variable numeralization algorithm based on dimension expanding. Firstly, the algorithm computes the number of different values which the character variable takes. Then it replaces the original values with the natural bases in the m-dimensional Euclidean space. Though the algorithm causes a dimension expanding, it reserves the disorder of character variables because the natural bases are no difference in size, so this algorithm is a better character variable numerical processing algorithm. Experiments on text classification data sets show that though the proposed algorithm costs a little more running time, its classification performance is better.展开更多
With the help of the variable-coefficient generalized projected Ricatti equation expansion method, we present exact solutions for the generalized （2＋1）-dimensional nonlinear SchrSdinger equation with variable coeff...With the help of the variable-coefficient generalized projected Ricatti equation expansion method, we present exact solutions for the generalized （2＋1）-dimensional nonlinear SchrSdinger equation with variable coefficients. These solutions include solitary wave solutions, soliton-like solutions and trigonometric function solutions. Among these solutions, some are found for the first time.展开更多
Genetic algorithm(GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes(VLCs) in a GA-based network i...Genetic algorithm(GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes(VLCs) in a GA-based network intrusion detection system.Fewer chromosomes with relevant features are used for rule generation. An effective fitness function is used to define the fitness of each rule. Each chromosome will have one or more rules in it. As each chromosome is a complete solution to the problem, fewer chromosomes are sufficient for effective intrusion detection. This reduces the computational time. The proposed approach is tested using Defense Advanced Research Project Agency(DARPA) 1998 data. The experimental results show that the proposed approach is efficient in network intrusion detection.展开更多
Instead of establishing mathematical hydraulic system models from physical laws usually done with the problems of complex modelling processes, low reliability and practicality caused by large uncertainties, a novel mo...Instead of establishing mathematical hydraulic system models from physical laws usually done with the problems of complex modelling processes, low reliability and practicality caused by large uncertainties, a novel modelling method for a highly nonlinear system of a hydraulic excavator is presented. Based on the data collected in the excavator＇s arms driving experiments, a data-based excavator dynamic model using Simplified Refined Instrumental Variable （SRIV） identification and estimation algorithms is established. The validity of the proposed data-based model is indirectly demonstrated by the performance of computer simulation and the.real machine motion control exoeriments.展开更多
A novel genetic algorithm (NGA) is proposed, which possesses micro-regulation and renascence operation. The optimized variable searching interval is regulated gradually according to the sub-group of excellent individu...A novel genetic algorithm (NGA) is proposed, which possesses micro-regulation and renascence operation. The optimized variable searching interval is regulated gradually according to the sub-group of excellent individuals. The NGA is used to optimize the parameters of the variable structure control (VSC), which satisfies the new reaching law and sliding mode. It is used in robot control systems. Simulation results are given.展开更多
Coastal wetlands are characterized by complex patterns both in their geomorphlc and ecological teatures. Besides field observations, it is necessary to analyze the land cover of wetlands through the color infrared （...Coastal wetlands are characterized by complex patterns both in their geomorphlc and ecological teatures. Besides field observations, it is necessary to analyze the land cover of wetlands through the color infrared （CIR） aerial photography or remote sensing image. In this paper, we designed an evolving neural network classifier using variable string genetic algorithm （VGA） for the land cover classification of CIR aerial image. With the VGA, the classifier that we designed is able to evolve automatically the appropriate number of hidden nodes for modeling the neural network topology optimally and to find a near-optimal set of connection weights globally. Then, with backpropagation algorithm （BP）, it can find the best connection weights. The VGA-BP classifier, which is derived from hybrid algorithms mentioned above, is demonstrated on CIR images classification effectively. Compared with standard classifiers, such as Bayes maximum-likelihood classifier, VGA classifier and BP-MLP （multi-layer perception） classifier, it has shown that the VGA-BP classifier can have better performance on highly resolution land cover classification.展开更多
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro...In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.展开更多
Vertical hot ring rolling(VHRR) process has the characteristics of nonlinearity,time-variation and being susceptible to disturbance.Furthermore,the ring's growth is quite fast within a short time,and the rolled ri...Vertical hot ring rolling(VHRR) process has the characteristics of nonlinearity,time-variation and being susceptible to disturbance.Furthermore,the ring's growth is quite fast within a short time,and the rolled ring's position is asymmetrical.All of these cause that the ring's dimensions cannot be measured directly.Through analyzing the relationships among the dimensions of ring blanks,the positions of rolls and the ring's inner and outer diameter,the soft measurement model of ring's dimensions is established based on the radial basis function neural network(RBFNN).A mass of data samples are obtained from VHRR finite element(FE) simulations to train and test the soft measurement NN model,and the model's structure parameters are deduced and optimized by genetic algorithm(GA).Finally,the soft measurement system of ring's dimensions is established and validated by the VHRR experiments.The ring's dimensions were measured artificially and calculated by the soft measurement NN model.The results show that the calculation values of GA-RBFNN model are close to the artificial measurement data.In addition,the calculation accuracy of GA-RBFNN model is higher than that of RBFNN model.The research results suggest that the soft measurement NN model has high precision and flexibility.The research can provide practical methods and theoretical guidance for the accurate measurement of VHRR process.展开更多
In conventional computed tomography （CT） reconstruction based on fixed voltage, the projective data often ap- pear overexposed or underexposed, as a result, the reconstructive results are poor. To solve this problem...In conventional computed tomography （CT） reconstruction based on fixed voltage, the projective data often ap- pear overexposed or underexposed, as a result, the reconstructive results are poor. To solve this problem, variable voltage CT reconstruction has been proposed. The effective projective sequences of a structural component are obtained through the variable voltage. The total variation is adjusted and minimized to optimize the reconstructive results on the basis of iterative image using algebraic reconstruction technique （ART）. In the process of reconstruction, the reconstructive image of low voltage is used as an initial value of the effective proiective reconstruction of the adjacent high voltage, and so on until to the highest voltage according to the gray weighted algorithm. Thereby the complete structural information is reconstructed. Simulation results show that the proposed algorithm can completely reflect the information of a complicated structural com- ponent, and the pixel values are more stable than those of the conventional.展开更多
A novel computational reconstruction method called the Lucy–Richardson–Rosen algorithm(LRRA)for the construction of a single-shot infrared 3D imaging microscope was reported in Opto-Electronic Science.In that study,...A novel computational reconstruction method called the Lucy–Richardson–Rosen algorithm(LRRA)for the construction of a single-shot infrared 3D imaging microscope was reported in Opto-Electronic Science.In that study,a commonly available optical element,the Cassegrain objective lens,was used as a coded aperture for 3D imaging using LRRA.Unlike regular coded aperture imaging systems,achieving 3D imaging using commonly available imaging devices leads to the development of hybrid imaging systems where direct and indirect imaging concepts coexist.The development above will make 3D imaging more commonly used in daily life.展开更多
Satisfactory results cannot be obtained when three-dimensional (3D) targets with complex maneuvering characteristics are tracked by the commonly used two-dimensional coordinated turn (2DCT) model. To address the probl...Satisfactory results cannot be obtained when three-dimensional (3D) targets with complex maneuvering characteristics are tracked by the commonly used two-dimensional coordinated turn (2DCT) model. To address the problem of 3D target tracking with strong maneuverability, on the basis of the modified three-dimensional variable turn (3DVT) model, an adaptive tracking algorithm is proposed by combining with the cubature Kalman filter (CKF) in this paper. Through ideology of real-time identification, the parameters of the model are changed to adjust the state transition matrix and the state noise covariance matrix. Therefore, states of the target are matched in real-time to achieve the purpose of adaptive tracking. Finally, four simulations are analyzed in different settings by the Monte Carlo method. All results show that the proposed algorithm can update parameters of the model and identify motion characteristics in real-time when targets tracking also has a better tracking accuracy.展开更多
We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponen...We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.展开更多
The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly...The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.展开更多
The special fingers of the gripper on the space robot have been developed based on genetic algorithmfor the space application.Therefore,the symmetrical wedgelike finger composed of the 4-1ink mechanismand the relevant...The special fingers of the gripper on the space robot have been developed based on genetic algorithmfor the space application.Therefore,the symmetrical wedgelike finger composed of the 4-1ink mechanismand the relevant track were designed.To decrease the weight and optimize the kinematics and grip force,the compositive fitness function for dynamics and kinematics was created.The calculation efficiency couldbe improved by novel methods which overcame the problem of too many constraints in the solution space,such as introducing the specialist's experience and punishment function and simplifying the variables.The solutions show that the optimized finger could perform well and the methods were effectual.展开更多
Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,...Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,given their global search capabilities and ability to locate multiple roots of a NES simultaneously within one run.Currently,the majority of research on using EAs to solve NESs focuses on transformation techniques and improving the performance of the used EAs.By contrast,problem domain knowledge of NESs is investigated in this study,where we propose the incorporation of a variable reduction strategy(VRS)into EAs to solve NESs.The VRS makes full use of the systems of expressing a NES and uses some variables(i.e.,core variable)to represent other variables(i.e.,reduced variables)through variable relationships that exist in the equation systems.It enables the reduction of partial variables and equations and shrinks the decision space,thereby reducing the complexity of the problem and improving the search efficiency of the EAs.To test the effectiveness of VRS in dealing with NESs,this paper mainly integrates the VRS into two existing state-of-the-art EA methods(i.e.,MONES and DR-JADE)according to the integration framework of the VRS and EA,respectively.Experimental results show that,with the assistance of the VRS,the EA methods can produce better results than the original methods and other compared methods.Furthermore,extensive experiments regarding the influence of different reduction schemes and EAs substantiate that a better EA for solving a NES with more reduced variables tends to provide better performance.展开更多
The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and sym...The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and symbolic function and step size factor is proposed.It establishes a new updating method of step factor that is related to step factor and error signal.This work makes an analysis from 3 aspects:theoretical analysis,theoretical verification and specific experiments.The experimental results show that the proposed algorithm is superior to other variable step size algorithms in convergence speed and steady-state error.展开更多
Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classic...Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.展开更多
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
基金supported by the Shan⁃dong Provincial Natural Science Foundation(No.ZR2022MF314).
文摘The adaptive filtering algorithm with a fixed projection order is unable to adjust its performance in response to changes in the external environment of airborne radars.To overcome this limitation,a new approach is introduced,which is the variable projection order Ekblom norm-promoted adaptive algorithm(VPO-EPAA).The method begins by examining the mean squared deviation(MSD)of the EPAA,deriving a formula for its MSD.Next,it compares the MSD of EPAA at two different projection orders and selects the one that minimizes the MSD as the parameter for the current iteration.Furthermore,the algorithm’s computational complexity is analyzed theoretically.Simulation results from system identification and self-interference cancellation show that the proposed algorithm performs exceptionally well in airborne radar signal self-interference cancellation,even under various noise intensities and types of interference.
基金Project supported by the National Natural Science Foundation of China(Nos.50936005,51576182,and 11172296)
文摘An automated method to optimize the definition of the progress variables in the flamelet-based dimension reduction is proposed. The performance of these optimized progress variables in coupling the flamelets and flow solver is presented. In the proposed method, the progress variables are defined according to the first two principal components （PCs） from the principal component analysis （PCA） or kernel-density-weighted PCA （KEDPCA） of a set of flamelets. These flamelets can then be mapped to these new progress variables instead of the mixture fraction/conventional progress variables. Thus, a new chemistry look-up table is constructed. A priori validation of these optimized progress variables and the new chemistry table is implemented in a CH4/N2/air lift-off flame. The reconstruction of the lift-off flame shows that the optimized progress variables perform better than the conventional ones, especially in the high temperature area. The coefficient determinations （R2 statistics） show that the KEDPCA performs slightly better than the PCA except for some minor species. The main advantage of the KEDPCA is that it is less sensitive to the database. Meanwhile, the criteria for the optimization are proposed and discussed. The constraint that the progress variables should monotonically evolve from fresh gas to burnt gas is analyzed in detail.
基金This work is sponsored by the National Natural Science Foundation of China (Nos. 61402246, 61402126, 61370083, 61370086, 61303193, and 61572268), a Project of Shandong Province Higher Educational Science and Technology Program (No. J15LN38), Qingdao indigenous innovation program (No. 15-9-1-47-jch), the National Research Foundation for the Doctoral Program of Higher Education of China (No. 20122304110012), the Natural Science Foundation of Heilongjiang Province of China (No. F201101), the Science and Technology Research Project Foundation of Heilongjiang Province Education Department (No. 12531105), Heilongjiang Province Postdoctoral Research Start Foundation (No. LBH-Q13092), and the National Key Technology R&D Program of the Ministry of Science and Technology under Grant No. 2012BAH81F02.
文摘The character variable discrete numeralization destroyed the disorder of character variables. As text classification problem contains more character variable, discrete numeralization approach affects the classification performance of classifiers. In this paper, we propose a character variable numeralization algorithm based on dimension expanding. Firstly, the algorithm computes the number of different values which the character variable takes. Then it replaces the original values with the natural bases in the m-dimensional Euclidean space. Though the algorithm causes a dimension expanding, it reserves the disorder of character variables because the natural bases are no difference in size, so this algorithm is a better character variable numerical processing algorithm. Experiments on text classification data sets show that though the proposed algorithm costs a little more running time, its classification performance is better.
基金Supported by the Science Research Foundation of Zhanjiang Normal University(L0803)
文摘With the help of the variable-coefficient generalized projected Ricatti equation expansion method, we present exact solutions for the generalized （2＋1）-dimensional nonlinear SchrSdinger equation with variable coefficients. These solutions include solitary wave solutions, soliton-like solutions and trigonometric function solutions. Among these solutions, some are found for the first time.
文摘Genetic algorithm(GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes(VLCs) in a GA-based network intrusion detection system.Fewer chromosomes with relevant features are used for rule generation. An effective fitness function is used to define the fitness of each rule. Each chromosome will have one or more rules in it. As each chromosome is a complete solution to the problem, fewer chromosomes are sufficient for effective intrusion detection. This reduces the computational time. The proposed approach is tested using Defense Advanced Research Project Agency(DARPA) 1998 data. The experimental results show that the proposed approach is efficient in network intrusion detection.
文摘Instead of establishing mathematical hydraulic system models from physical laws usually done with the problems of complex modelling processes, low reliability and practicality caused by large uncertainties, a novel modelling method for a highly nonlinear system of a hydraulic excavator is presented. Based on the data collected in the excavator＇s arms driving experiments, a data-based excavator dynamic model using Simplified Refined Instrumental Variable （SRIV） identification and estimation algorithms is established. The validity of the proposed data-based model is indirectly demonstrated by the performance of computer simulation and the.real machine motion control exoeriments.
文摘A novel genetic algorithm (NGA) is proposed, which possesses micro-regulation and renascence operation. The optimized variable searching interval is regulated gradually according to the sub-group of excellent individuals. The NGA is used to optimize the parameters of the variable structure control (VSC), which satisfies the new reaching law and sliding mode. It is used in robot control systems. Simulation results are given.
文摘Coastal wetlands are characterized by complex patterns both in their geomorphlc and ecological teatures. Besides field observations, it is necessary to analyze the land cover of wetlands through the color infrared （CIR） aerial photography or remote sensing image. In this paper, we designed an evolving neural network classifier using variable string genetic algorithm （VGA） for the land cover classification of CIR aerial image. With the VGA, the classifier that we designed is able to evolve automatically the appropriate number of hidden nodes for modeling the neural network topology optimally and to find a near-optimal set of connection weights globally. Then, with backpropagation algorithm （BP）, it can find the best connection weights. The VGA-BP classifier, which is derived from hybrid algorithms mentioned above, is demonstrated on CIR images classification effectively. Compared with standard classifiers, such as Bayes maximum-likelihood classifier, VGA classifier and BP-MLP （multi-layer perception） classifier, it has shown that the VGA-BP classifier can have better performance on highly resolution land cover classification.
基金supported by the National Key R&D Plan(2020YFB1712902)the National Natural Science Foundation of China(52075036).
文摘In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.
基金Project(51205299)supported by the National Natural Science Foundation of ChinaProject(2015M582643)supported by the China Postdoctoral Science Foundation+2 种基金Project(2014BAA008)supported by the Science and Technology Support Program of Hubei Province,ChinaProject(2014-IV-144)supported by the Fundamental Research Funds for the Central Universities of ChinaProject(2012AAA07-01)supported by the Major Science and Technology Achievements Transformation&Industrialization Program of Hubei Province,China
文摘Vertical hot ring rolling(VHRR) process has the characteristics of nonlinearity,time-variation and being susceptible to disturbance.Furthermore,the ring's growth is quite fast within a short time,and the rolled ring's position is asymmetrical.All of these cause that the ring's dimensions cannot be measured directly.Through analyzing the relationships among the dimensions of ring blanks,the positions of rolls and the ring's inner and outer diameter,the soft measurement model of ring's dimensions is established based on the radial basis function neural network(RBFNN).A mass of data samples are obtained from VHRR finite element(FE) simulations to train and test the soft measurement NN model,and the model's structure parameters are deduced and optimized by genetic algorithm(GA).Finally,the soft measurement system of ring's dimensions is established and validated by the VHRR experiments.The ring's dimensions were measured artificially and calculated by the soft measurement NN model.The results show that the calculation values of GA-RBFNN model are close to the artificial measurement data.In addition,the calculation accuracy of GA-RBFNN model is higher than that of RBFNN model.The research results suggest that the soft measurement NN model has high precision and flexibility.The research can provide practical methods and theoretical guidance for the accurate measurement of VHRR process.
文摘In conventional computed tomography （CT） reconstruction based on fixed voltage, the projective data often ap- pear overexposed or underexposed, as a result, the reconstructive results are poor. To solve this problem, variable voltage CT reconstruction has been proposed. The effective projective sequences of a structural component are obtained through the variable voltage. The total variation is adjusted and minimized to optimize the reconstructive results on the basis of iterative image using algebraic reconstruction technique （ART）. In the process of reconstruction, the reconstructive image of low voltage is used as an initial value of the effective proiective reconstruction of the adjacent high voltage, and so on until to the highest voltage according to the gray weighted algorithm. Thereby the complete structural information is reconstructed. Simulation results show that the proposed algorithm can completely reflect the information of a complicated structural com- ponent, and the pixel values are more stable than those of the conventional.
文摘A novel computational reconstruction method called the Lucy–Richardson–Rosen algorithm(LRRA)for the construction of a single-shot infrared 3D imaging microscope was reported in Opto-Electronic Science.In that study,a commonly available optical element,the Cassegrain objective lens,was used as a coded aperture for 3D imaging using LRRA.Unlike regular coded aperture imaging systems,achieving 3D imaging using commonly available imaging devices leads to the development of hybrid imaging systems where direct and indirect imaging concepts coexist.The development above will make 3D imaging more commonly used in daily life.
基金supported by the National Natural Science Foundation of China(51467013)
文摘Satisfactory results cannot be obtained when three-dimensional (3D) targets with complex maneuvering characteristics are tracked by the commonly used two-dimensional coordinated turn (2DCT) model. To address the problem of 3D target tracking with strong maneuverability, on the basis of the modified three-dimensional variable turn (3DVT) model, an adaptive tracking algorithm is proposed by combining with the cubature Kalman filter (CKF) in this paper. Through ideology of real-time identification, the parameters of the model are changed to adjust the state transition matrix and the state noise covariance matrix. Therefore, states of the target are matched in real-time to achieve the purpose of adaptive tracking. Finally, four simulations are analyzed in different settings by the Monte Carlo method. All results show that the proposed algorithm can update parameters of the model and identify motion characteristics in real-time when targets tracking also has a better tracking accuracy.
基金supported by the National Natural Science Foundation of China(Grant No.11971486)。
文摘We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.
基金the Liaoning Province Nature Fundation Project(2022-MS-291)the National Programme for Foreign Expert Projects(G2022006008L)+2 种基金the Basic Research Projects of Liaoning Provincial Department of Education(LJKMZ20220781,LJKMZ20220783,LJKQZ20222457)King Saud University funded this study through theResearcher Support Program Number(RSPD2023R704)King Saud University,Riyadh,Saudi Arabia.
文摘The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.
基金the High Technology Research and Development Program of China(No.2004AA742201)
文摘The special fingers of the gripper on the space robot have been developed based on genetic algorithmfor the space application.Therefore,the symmetrical wedgelike finger composed of the 4-1ink mechanismand the relevant track were designed.To decrease the weight and optimize the kinematics and grip force,the compositive fitness function for dynamics and kinematics was created.The calculation efficiency couldbe improved by novel methods which overcame the problem of too many constraints in the solution space,such as introducing the specialist's experience and punishment function and simplifying the variables.The solutions show that the optimized finger could perform well and the methods were effectual.
基金This work was supported by the National Natural Science Foundation of China(62073341)in part by the Natural Science Fund for Distinguished Young Scholars of Hunan Province(2019JJ20026).
文摘Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,given their global search capabilities and ability to locate multiple roots of a NES simultaneously within one run.Currently,the majority of research on using EAs to solve NESs focuses on transformation techniques and improving the performance of the used EAs.By contrast,problem domain knowledge of NESs is investigated in this study,where we propose the incorporation of a variable reduction strategy(VRS)into EAs to solve NESs.The VRS makes full use of the systems of expressing a NES and uses some variables(i.e.,core variable)to represent other variables(i.e.,reduced variables)through variable relationships that exist in the equation systems.It enables the reduction of partial variables and equations and shrinks the decision space,thereby reducing the complexity of the problem and improving the search efficiency of the EAs.To test the effectiveness of VRS in dealing with NESs,this paper mainly integrates the VRS into two existing state-of-the-art EA methods(i.e.,MONES and DR-JADE)according to the integration framework of the VRS and EA,respectively.Experimental results show that,with the assistance of the VRS,the EA methods can produce better results than the original methods and other compared methods.Furthermore,extensive experiments regarding the influence of different reduction schemes and EAs substantiate that a better EA for solving a NES with more reduced variables tends to provide better performance.
基金the National Natural Science Foundation of China(No.51575328,61503232).
文摘The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and symbolic function and step size factor is proposed.It establishes a new updating method of step factor that is related to step factor and error signal.This work makes an analysis from 3 aspects:theoretical analysis,theoretical verification and specific experiments.The experimental results show that the proposed algorithm is superior to other variable step size algorithms in convergence speed and steady-state error.
基金Supported by the National Natural Science Foundation of China under Grant Nos 11504024,61502041,61602045 and 61602046the National Key Research and Development Program of China under Grant No 2016YFA0302600
文摘Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.
