Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability...Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.展开更多
A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates...A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates and the other contains the remaining coordinates. Three inequalities based on the characteristics of the sums and variances of a vector and its two subvectors were introduced to reject those codewords which are impossible to be the nearest codeword. The simulation results show that the proposed algorithm is faster than the improved equal average eaual variance nearest neighbor search (EENNS) algorithm.展开更多
Myocardial infarction(MI)is one of the leading causes of death globally among cardiovascular diseases,necessitating modern and accurate diagnostics for cardiac patient conditions.Among the available functional diagnos...Myocardial infarction(MI)is one of the leading causes of death globally among cardiovascular diseases,necessitating modern and accurate diagnostics for cardiac patient conditions.Among the available functional diagnostic methods,electrocardiography(ECG)is particularly well-known for its ability to detect MI.However,confirming its accuracy—particularly in identifying the localization of myocardial damage—often presents challenges in practice.This study,therefore,proposes a new approach based on machine learning models for the analysis of 12-lead ECG data to accurately identify the localization of MI.In particular,the learning vector quantization(LVQ)algorithm was applied,considering the contribution of each ECG lead in the 12-channel system,which obtained an accuracy of 87%in localizing damaged myocardium.The developed model was tested on verified data from the PTB database,including 445 ECG recordings from both healthy individuals and MI-diagnosed patients.The results demonstrated that the 12-lead ECG system allows for a comprehensive understanding of cardiac activities in myocardial infarction patients,serving as an essential tool for the diagnosis of myocardial conditions and localizing their damage.A comprehensive comparison was performed,including CNN,SVM,and Logistic Regression,to evaluate the proposed LVQ model.The results demonstrate that the LVQ model achieves competitive performance in diagnostic tasks while maintaining computational efficiency,making it suitable for resource-constrained environments.This study also applies a carefully designed data pre-processing flow,including class balancing and noise removal,which improves the reliability and reproducibility of the results.These aspects highlight the potential application of the LVQ model in cardiac diagnostics,opening up prospects for its use along with more complex neural network architectures.展开更多
The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and wi...The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.展开更多
Double self-adaptive fuzzy PID algorithm-based control strategy was proposed to construct quasi-cascade control system to control the speed of the acid-pickling process of titanium plates and strips. It is very useful...Double self-adaptive fuzzy PID algorithm-based control strategy was proposed to construct quasi-cascade control system to control the speed of the acid-pickling process of titanium plates and strips. It is very useful in overcoming non-linear dynamic behavior, uncertain and time-varying parameters, un-modeled dynamics, and couples between the automatic turbulence control (ATC) and the automatic acid temperature control (AATC) with varying parameters during the operation process. The quasi-cascade control system of inner and outer loop self-adaptive fuzzy PID controller was built, which could effectively control the pickling speed of plates and strips. The simulated results and real application indicate that the plates and strips acid pickling speed control system has good performances of adaptively tracking the parameter variations and anti-disturbances, which ensures the match of acid pickling temperature and turbulence of flowing with acid pickling speed, improving the surface quality of plates and strips acid pickling, and energy efficiency.展开更多
A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neut...A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.展开更多
In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied...In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied improved self-adaptive crossover and mutation formulae that can provide appropriate crossover operator and mutation operator based on different functions of the objects and the number of iterations. The performance of ISMC was tested by the benchmark functions. The simulation results for residue hydrogenating kinetics model parameter estimation show that the proposed method is superior to the traditional intelligent algorithms in terms of convergence accuracy and stability in solving the complex parameter optimization problems.展开更多
There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced se...There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.展开更多
In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation fa...In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.展开更多
Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index ...Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.展开更多
Defect detection is vital in the nonwoven material industry,ensuring surface quality before producing finished products.Recently,deep learning and computer vision advancements have revolutionized defect detection,maki...Defect detection is vital in the nonwoven material industry,ensuring surface quality before producing finished products.Recently,deep learning and computer vision advancements have revolutionized defect detection,making it a widely adopted approach in various industrial fields.This paper mainly studied the defect detection method for nonwoven materials based on the improved Nano Det-Plus model.Using the constructed samples of defects in nonwoven materials as the research objects,transfer learning experiments were conducted based on the Nano DetPlus object detection framework.Within this framework,the Backbone,path aggregation feature pyramid network(PAFPN)and Head network models were compared and trained through a process of freezing,with the ultimate aim of bolstering the model's feature extraction abilities and elevating detection accuracy.The half-precision quantization method was used to optimize the model after transfer learning experiments,reducing model weights and computational complexity to improve the detection speed.Performance comparisons were conducted between the improved model and the original Nano Det-Plus model,YOLO,SSD and other common industrial defect detection algorithms,validating that the improved methods based on transfer learning and semi-precision quantization enabled the model to meet the practical requirements of industrial production.展开更多
In this paper, a new amplitude quantization synthesis method for ultralow sidelobe phased arrays is proposed, which is based on the constrained nonlinear optimization algorithm. By introducing a set of critical constr...In this paper, a new amplitude quantization synthesis method for ultralow sidelobe phased arrays is proposed, which is based on the constrained nonlinear optimization algorithm. By introducing a set of critical constraint conditions into the optimization model, we can directly quantize the amplitude distribution instead of replacing it with a continuous equivalent aperture antenna. The mutual coupling and the element patterns are also considered in the quantization synthesis. Finally, some array simulation results are given to show the effectiveness of the method.展开更多
In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed init...In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.展开更多
The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can b...The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.展开更多
In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insuffi...In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insufficient glucose addition limits cell growth.To properly regulate glucose feed,a different evolution algorithm based on self-adaptive control strategy was proposed,consisting of three modules(PID,system identification and parameter optimization).Performance of the proposed and conventional PID controllers was validated and compared in simulated and experimental cultivations.In the simulation,cultivation with the self-adaptive control strategy had a more stable glucose feed rate and concentration,more stable ethanol concentration around the set-point(1.0 g·L^(-1)),and final biomass concentration of 34.5 g-DCW·L^(-1),29.2%higher than that with a conventional PID control strategy.In the experiment,the cultivation with the self-adaptive control strategy also had more stable glucose and ethanol concentrations,as well as a final biomass concentration that was 37.4%higher than that using the conventional strategy.展开更多
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.展开更多
The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper...The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.展开更多
Effective guidance is one of the most important tasks to the performance of air-to-air missile. The fuzzy logic controller is able to perform effectively even in situations where the information about the plant is ina...Effective guidance is one of the most important tasks to the performance of air-to-air missile. The fuzzy logic controller is able to perform effectively even in situations where the information about the plant is inaccurate and the operating conditions are uncertain. Based on the proportional navigation, the fuzzy logic and the genetic algorithm are combined to develop an evolutionary fuzzy navigation law with self-adapt region for the air-to-air missile guidance. The line of sight (LOS) rate and the closing speed between the missile and the target are inputs of the fuzzy controller. The output of the fuzzy controller is the commanded acceleration. Then a nonlinear function based on the conventional fuzzy logic control is imported to change the region. This nonlinear function can be changed with the input variables. So the dynamic change of the fuzzy variable region is achieved. The guidance law is optimized by the genetic algorithm. Simulation results of air-to-air missile attack using MATLAB show that the method needs less acceleration and shorter flying time, and its realization is simple.[KH*3/4D]展开更多
文摘Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.
文摘A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates and the other contains the remaining coordinates. Three inequalities based on the characteristics of the sums and variances of a vector and its two subvectors were introduced to reject those codewords which are impossible to be the nearest codeword. The simulation results show that the proposed algorithm is faster than the improved equal average eaual variance nearest neighbor search (EENNS) algorithm.
基金funded by the Ministry of Science and Higher Education of the Republic of Kazakhstan,grant numbers AP14969403 and AP23485820.
文摘Myocardial infarction(MI)is one of the leading causes of death globally among cardiovascular diseases,necessitating modern and accurate diagnostics for cardiac patient conditions.Among the available functional diagnostic methods,electrocardiography(ECG)is particularly well-known for its ability to detect MI.However,confirming its accuracy—particularly in identifying the localization of myocardial damage—often presents challenges in practice.This study,therefore,proposes a new approach based on machine learning models for the analysis of 12-lead ECG data to accurately identify the localization of MI.In particular,the learning vector quantization(LVQ)algorithm was applied,considering the contribution of each ECG lead in the 12-channel system,which obtained an accuracy of 87%in localizing damaged myocardium.The developed model was tested on verified data from the PTB database,including 445 ECG recordings from both healthy individuals and MI-diagnosed patients.The results demonstrated that the 12-lead ECG system allows for a comprehensive understanding of cardiac activities in myocardial infarction patients,serving as an essential tool for the diagnosis of myocardial conditions and localizing their damage.A comprehensive comparison was performed,including CNN,SVM,and Logistic Regression,to evaluate the proposed LVQ model.The results demonstrate that the LVQ model achieves competitive performance in diagnostic tasks while maintaining computational efficiency,making it suitable for resource-constrained environments.This study also applies a carefully designed data pre-processing flow,including class balancing and noise removal,which improves the reliability and reproducibility of the results.These aspects highlight the potential application of the LVQ model in cardiac diagnostics,opening up prospects for its use along with more complex neural network architectures.
基金Project(51090385) supported by the Major Program of National Natural Science Foundation of ChinaProject(2011IB001) supported by Yunnan Provincial Science and Technology Program,China+1 种基金Project(2012DFA70570) supported by the International Science & Technology Cooperation Program of ChinaProject(2011IA004) supported by the Yunnan Provincial International Cooperative Program,China
文摘The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.
基金Project(51090385) supported by the National Natural Science Foundation of ChinaProject(2001IB001) supported by Yunnan Provincial Science and Technology Fund, China
文摘Double self-adaptive fuzzy PID algorithm-based control strategy was proposed to construct quasi-cascade control system to control the speed of the acid-pickling process of titanium plates and strips. It is very useful in overcoming non-linear dynamic behavior, uncertain and time-varying parameters, un-modeled dynamics, and couples between the automatic turbulence control (ATC) and the automatic acid temperature control (AATC) with varying parameters during the operation process. The quasi-cascade control system of inner and outer loop self-adaptive fuzzy PID controller was built, which could effectively control the pickling speed of plates and strips. The simulated results and real application indicate that the plates and strips acid pickling speed control system has good performances of adaptively tracking the parameter variations and anti-disturbances, which ensures the match of acid pickling temperature and turbulence of flowing with acid pickling speed, improving the surface quality of plates and strips acid pickling, and energy efficiency.
基金supported by the National Key R&D Program of the MOST of China(No.2016YFA0300204)the National Natural Science Foundation of China(Nos.11227902)as part of the Si PáME2beamline project+1 种基金supported by the National Natural Science Foundation of China(No.41774120)the Sichuan Science and Technology Program(No.2021YJ0329)。
文摘A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.
基金Projects(61203020,61403190)supported by the National Natural Science Foundation of ChinaProject(BK20141461)supported by the Jiangsu Province Natural Science Foundation,China
文摘In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied improved self-adaptive crossover and mutation formulae that can provide appropriate crossover operator and mutation operator based on different functions of the objects and the number of iterations. The performance of ISMC was tested by the benchmark functions. The simulation results for residue hydrogenating kinetics model parameter estimation show that the proposed method is superior to the traditional intelligent algorithms in terms of convergence accuracy and stability in solving the complex parameter optimization problems.
基金supported by the Aviation Science Funds of China(2010ZC13012)the Fund of Jiangsu Innovation Program for Graduate Education (CXLX11 0203)
文摘There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.
基金Supported by the Major State Basic Research Development Program of China (2012CB720500)the National Natural Science Foundation of China (Key Program: U1162202)+1 种基金the National Natural Science Foundation of China (General Program:61174118)Shanghai Leading Academic Discipline Project (B504)
文摘In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.
基金Project(61273187)supported by the National Natural Science Foundation of ChinaProject(61321003)supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China
文摘Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.
基金National Key Research and Development Program of China(Nos.2022YFB4700600 and 2022YFB4700605)National Natural Science Foundation of China(Nos.61771123 and 62171116)+1 种基金Fundamental Research Funds for the Central UniversitiesGraduate Student Innovation Fund of Donghua University,China(No.CUSF-DH-D-2022044)。
文摘Defect detection is vital in the nonwoven material industry,ensuring surface quality before producing finished products.Recently,deep learning and computer vision advancements have revolutionized defect detection,making it a widely adopted approach in various industrial fields.This paper mainly studied the defect detection method for nonwoven materials based on the improved Nano Det-Plus model.Using the constructed samples of defects in nonwoven materials as the research objects,transfer learning experiments were conducted based on the Nano DetPlus object detection framework.Within this framework,the Backbone,path aggregation feature pyramid network(PAFPN)and Head network models were compared and trained through a process of freezing,with the ultimate aim of bolstering the model's feature extraction abilities and elevating detection accuracy.The half-precision quantization method was used to optimize the model after transfer learning experiments,reducing model weights and computational complexity to improve the detection speed.Performance comparisons were conducted between the improved model and the original Nano Det-Plus model,YOLO,SSD and other common industrial defect detection algorithms,validating that the improved methods based on transfer learning and semi-precision quantization enabled the model to meet the practical requirements of industrial production.
文摘In this paper, a new amplitude quantization synthesis method for ultralow sidelobe phased arrays is proposed, which is based on the constrained nonlinear optimization algorithm. By introducing a set of critical constraint conditions into the optimization model, we can directly quantize the amplitude distribution instead of replacing it with a continuous equivalent aperture antenna. The mutual coupling and the element patterns are also considered in the quantization synthesis. Finally, some array simulation results are given to show the effectiveness of the method.
文摘In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.
基金This research was supported in part by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(NRF-2021R1A6A1A03039493)in part by the NRF grant funded by the Korea government(MSIT)(NRF-2022R1A2C1004401)in part by the 2022 Yeungnam University Research Grant.
文摘The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.
文摘In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insufficient glucose addition limits cell growth.To properly regulate glucose feed,a different evolution algorithm based on self-adaptive control strategy was proposed,consisting of three modules(PID,system identification and parameter optimization).Performance of the proposed and conventional PID controllers was validated and compared in simulated and experimental cultivations.In the simulation,cultivation with the self-adaptive control strategy had a more stable glucose feed rate and concentration,more stable ethanol concentration around the set-point(1.0 g·L^(-1)),and final biomass concentration of 34.5 g-DCW·L^(-1),29.2%higher than that with a conventional PID control strategy.In the experiment,the cultivation with the self-adaptive control strategy also had more stable glucose and ethanol concentrations,as well as a final biomass concentration that was 37.4%higher than that using the conventional strategy.
文摘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 split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.
文摘Effective guidance is one of the most important tasks to the performance of air-to-air missile. The fuzzy logic controller is able to perform effectively even in situations where the information about the plant is inaccurate and the operating conditions are uncertain. Based on the proportional navigation, the fuzzy logic and the genetic algorithm are combined to develop an evolutionary fuzzy navigation law with self-adapt region for the air-to-air missile guidance. The line of sight (LOS) rate and the closing speed between the missile and the target are inputs of the fuzzy controller. The output of the fuzzy controller is the commanded acceleration. Then a nonlinear function based on the conventional fuzzy logic control is imported to change the region. This nonlinear function can be changed with the input variables. So the dynamic change of the fuzzy variable region is achieved. The guidance law is optimized by the genetic algorithm. Simulation results of air-to-air missile attack using MATLAB show that the method needs less acceleration and shorter flying time, and its realization is simple.[KH*3/4D]
