In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t...In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.展开更多
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice ...In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice matrix under unfold operator,and then the fold operator is used to form the next iteration tensor such that the computing time can be decreased.In theory,we analyze the global convergence of the algorithm.In numerical experiment,the simulation data and real image inpainting are carried out.Experiment results show the parallel algorithm outperform its original algorithm in CPU times under the same precision.展开更多
The improved cross-correlation algorithm for the strain demodulation of Vernier-effect-based optical fiber sensor(VE-OFS)is proposed in this article.The algorithm identifies the most similar spectrum to the measured o...The improved cross-correlation algorithm for the strain demodulation of Vernier-effect-based optical fiber sensor(VE-OFS)is proposed in this article.The algorithm identifies the most similar spectrum to the measured one from the database of the collected spectra by employing the cross-correlation operation,subsequently deriving the predicted value via weighted calculation.As the algorithm uses the complete information in the measured raw spectrum,more accurate results and larger measurement range can be obtained.Additionally,the improved cross-correlation algorithm also has the potential to improve the measurement speed compared to current standards due to the possibility for the collection using low sampling rate.This work presents an important algorithm towards a simpler,faster way to improve the demodulation performance of VE-OFS.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
The liquid cooling system(LCS)of fuel cells is challenged by significant time delays,model uncertainties,pump and fan coupling,and frequent disturbances,leading to overshoot and control oscillations that degrade tempe...The liquid cooling system(LCS)of fuel cells is challenged by significant time delays,model uncertainties,pump and fan coupling,and frequent disturbances,leading to overshoot and control oscillations that degrade temperature regulation performance.To address these challenges,we propose a composite control scheme combining fuzzy logic and a variable-gain generalized supertwisting algorithm(VG-GSTA).Firstly,a one-dimensional(1D)fuzzy logic controler(FLC)for the pump ensures stable coolant flow,while a two-dimensional(2D)FLC for the fan regulates the stack temperature near the reference value.The VG-GSTA is then introduced to eliminate steady-state errors,offering resistance to disturbances and minimizing control oscillations.The equilibrium optimizer is used to fine-tune VG-GSTA parameters.Co-simulation verifies the effectiveness of our method,demonstrating its advantages in terms of disturbance immunity,overshoot suppression,tracking accuracy and response speed.展开更多
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
Thinning of antenna arrays has been a popular topic for the last several decades.With increasing computational power,this optimization task acquired a new hue.This paper suggests a genetic algorithm as an instrument f...Thinning of antenna arrays has been a popular topic for the last several decades.With increasing computational power,this optimization task acquired a new hue.This paper suggests a genetic algorithm as an instrument for antenna array thinning.The algorithm with a deliberately chosen fitness function allows synthesizing thinned linear antenna arrays with low peak sidelobe level(SLL)while maintaining the half-power beamwidth(HPBW)of a full linear antenna array.Based on results from existing papers in the field and known approaches to antenna array thinning,a classification of thinning types is introduced.The optimal thinning type for a linear thinned antenna array is determined on the basis of a maximum attainable SLL.The effect of thinning coefficient on main directional pattern characteristics,such as peak SLL and HPBW,is discussed for a number of amplitude distributions.展开更多
Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and ...Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.展开更多
An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and sa...An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.展开更多
Performance-based warranties(PBWs)are widely used in industry and manufacturing.Given that PBW can impose financial burdens on manufacturers,rational maintenance decisions are essential for expanding profit margins.Th...Performance-based warranties(PBWs)are widely used in industry and manufacturing.Given that PBW can impose financial burdens on manufacturers,rational maintenance decisions are essential for expanding profit margins.This paper proposes an optimization model for PBW decisions for systems affected by Gamma degradation processes,incorporating periodic inspection.A system performance degradation model is established.Preventive maintenance probability and corrective renewal probability models are developed to calculate expected warranty costs and system availability.A benefits function,which includes incentives,is constructed to optimize the initial and subsequent inspection intervals and preventive maintenance thresholds,thereby maximizing warranty profit.An improved sparrow search algorithm is developed to optimize the model,with a case study on large steam turbine rotor shafts.The results suggest the optimal PBW strategy involves an initial inspection interval of approximately 20 months,with subsequent intervals of about four months,and a preventive maintenance threshold of approximately 37.39 mm wear.When compared to common cost-minimization-based condition maintenance strategies and PBW strategies that do not differentiate between initial and subsequent inspection intervals,the proposed PBW strategy increases the manufacturer’s profit by 1%and 18%,respectively.Sensitivity analyses provide managerial recommendations for PBW implementation.The PBW strategy proposed in this study significantly increases manufacturers’profits by optimizing inspection intervals and preventive maintenance thresholds,and manufacturers should focus on technological improvement in preventive maintenance and cost control to further enhance earnings.展开更多
Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of t...Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process,reducing the uncertainty in the random search process.Due to the ability of the Bayesian algorithm to reduce uncertainty,a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection.In addition,this paper has the following two innovations on the basis of the classical algorithm,one of which is to add random perturbations after completing the pheromone update.The second is the use of adaptive pheromone heuristics.Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm,due to the improvement of the pheromone utilization rate.Moreover,Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.展开更多
The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to...The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.展开更多
基金Supported by the Natural Science Foundation of Chongqing(General Program,NO.CSTB2022NSCQ-MSX0884)Discipline Teaching Special Project of Yangtze Normal University(csxkjx14)。
文摘In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
基金Supported by National Nature Science Foundation(12371381)Nature Science Foundation of Shanxi(202403021222270)。
文摘In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice matrix under unfold operator,and then the fold operator is used to form the next iteration tensor such that the computing time can be decreased.In theory,we analyze the global convergence of the algorithm.In numerical experiment,the simulation data and real image inpainting are carried out.Experiment results show the parallel algorithm outperform its original algorithm in CPU times under the same precision.
文摘The improved cross-correlation algorithm for the strain demodulation of Vernier-effect-based optical fiber sensor(VE-OFS)is proposed in this article.The algorithm identifies the most similar spectrum to the measured one from the database of the collected spectra by employing the cross-correlation operation,subsequently deriving the predicted value via weighted calculation.As the algorithm uses the complete information in the measured raw spectrum,more accurate results and larger measurement range can be obtained.Additionally,the improved cross-correlation algorithm also has the potential to improve the measurement speed compared to current standards due to the possibility for the collection using low sampling rate.This work presents an important algorithm towards a simpler,faster way to improve the demodulation performance of VE-OFS.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
基金Supported by the Major Science and Technology Project of Jilin Province(20220301010GX)the International Scientific and Technological Cooperation(20240402071GH).
文摘The liquid cooling system(LCS)of fuel cells is challenged by significant time delays,model uncertainties,pump and fan coupling,and frequent disturbances,leading to overshoot and control oscillations that degrade temperature regulation performance.To address these challenges,we propose a composite control scheme combining fuzzy logic and a variable-gain generalized supertwisting algorithm(VG-GSTA).Firstly,a one-dimensional(1D)fuzzy logic controler(FLC)for the pump ensures stable coolant flow,while a two-dimensional(2D)FLC for the fan regulates the stack temperature near the reference value.The VG-GSTA is then introduced to eliminate steady-state errors,offering resistance to disturbances and minimizing control oscillations.The equilibrium optimizer is used to fine-tune VG-GSTA parameters.Co-simulation verifies the effectiveness of our method,demonstrating its advantages in terms of disturbance immunity,overshoot suppression,tracking accuracy and response speed.
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
文摘Thinning of antenna arrays has been a popular topic for the last several decades.With increasing computational power,this optimization task acquired a new hue.This paper suggests a genetic algorithm as an instrument for antenna array thinning.The algorithm with a deliberately chosen fitness function allows synthesizing thinned linear antenna arrays with low peak sidelobe level(SLL)while maintaining the half-power beamwidth(HPBW)of a full linear antenna array.Based on results from existing papers in the field and known approaches to antenna array thinning,a classification of thinning types is introduced.The optimal thinning type for a linear thinned antenna array is determined on the basis of a maximum attainable SLL.The effect of thinning coefficient on main directional pattern characteristics,such as peak SLL and HPBW,is discussed for a number of amplitude distributions.
基金supported by the National Natural Science Foundation of China(724701189072431011).
文摘Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.
基金supported by the National Key Research and Development Program(2021YFB3502500).
文摘An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.
基金supported by the National Natural Science Foundation of China(71871219).
文摘Performance-based warranties(PBWs)are widely used in industry and manufacturing.Given that PBW can impose financial burdens on manufacturers,rational maintenance decisions are essential for expanding profit margins.This paper proposes an optimization model for PBW decisions for systems affected by Gamma degradation processes,incorporating periodic inspection.A system performance degradation model is established.Preventive maintenance probability and corrective renewal probability models are developed to calculate expected warranty costs and system availability.A benefits function,which includes incentives,is constructed to optimize the initial and subsequent inspection intervals and preventive maintenance thresholds,thereby maximizing warranty profit.An improved sparrow search algorithm is developed to optimize the model,with a case study on large steam turbine rotor shafts.The results suggest the optimal PBW strategy involves an initial inspection interval of approximately 20 months,with subsequent intervals of about four months,and a preventive maintenance threshold of approximately 37.39 mm wear.When compared to common cost-minimization-based condition maintenance strategies and PBW strategies that do not differentiate between initial and subsequent inspection intervals,the proposed PBW strategy increases the manufacturer’s profit by 1%and 18%,respectively.Sensitivity analyses provide managerial recommendations for PBW implementation.The PBW strategy proposed in this study significantly increases manufacturers’profits by optimizing inspection intervals and preventive maintenance thresholds,and manufacturers should focus on technological improvement in preventive maintenance and cost control to further enhance earnings.
基金supported by the National Natural Science Foundation of China(62276055).
文摘Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process,reducing the uncertainty in the random search process.Due to the ability of the Bayesian algorithm to reduce uncertainty,a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection.In addition,this paper has the following two innovations on the basis of the classical algorithm,one of which is to add random perturbations after completing the pheromone update.The second is the use of adaptive pheromone heuristics.Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm,due to the improvement of the pheromone utilization rate.Moreover,Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.
基金supported by the National Social Science Fund of China(2022-SKJJ-B-084).
文摘The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.
