Recent Super-Resolution(SR)algorithms often suffer from excessive model complexity,high computational costs,and limited flexibility across varying image scales.To address these challenges,we propose DDNet,a dynamic an...Recent Super-Resolution(SR)algorithms often suffer from excessive model complexity,high computational costs,and limited flexibility across varying image scales.To address these challenges,we propose DDNet,a dynamic and lightweight SR framework designed for arbitrary scaling factors.DDNet integrates a residual learning structure with an Adaptively fusion Feature Block(AFB)and a scale-aware upsampling module,effectively reducing parameter overhead while preserving reconstruction quality.Additionally,we introduce DDNetGAN,an enhanced variant that leverages a relativistic Generative Adversarial Network(GAN)to further improve texture realism.To validate the proposed models,we conduct extensive training using the DIV2K and Flickr2K datasets and evaluate performance across standard benchmarks including Set5,Set14,Urban100,Manga109,and BSD100.Our experiments cover both symmetric and asymmetric upscaling factors and incorporate ablation studies to assess key components.Results show that DDNet and DDNetGAN achieve competitive performance compared with mainstream SR algorithms,demonstrating a strong balance between accuracy,efficiency,and flexibility.These findings highlight the potential of our approach for practical real-world super-resolution applications.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid infrastructure.Analyzing the fluctuations in power generation and consumption patterns of smart ...Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid infrastructure.Analyzing the fluctuations in power generation and consumption patterns of smart cities assists in effectively managing continuous power supply in the grid.It also possesses a better impact on averting overloading and permitting effective energy storage.Even though many traditional techniques have predicted the consumption rate for preserving stability,enhancement is required in prediction measures with minimized loss.To overcome the complications in existing studies,this paper intends to predict stability from the smart grid stability prediction dataset using machine learning algorithms.To accomplish this,pre-processing is performed initially to handle missing values since it develops biased models when missing values are mishandled and performs feature scaling to normalize independent data features.Then,the pre-processed data are taken for training and testing.Following that,the regression process is performed using Modified PSO(Particle Swarm Optimization)optimized XGBoost Technique with dynamic inertia weight update,which analyses variables like gamma(G),reaction time(tau1–tau4),and power balance(p1–p4)for providing effective future stability in SG.Since PSO attains optimal solution by adjusting position through dynamic inertial weights,it is integrated with XGBoost due to its scalability and faster computational speed characteristics.The hyperparameters of XGBoost are fine-tuned in the training process for achieving promising outcomes on prediction.Regression results are measured through evaluation metrics such as MSE(Mean Square Error)of 0.011312781,MAE(Mean Absolute Error)of 0.008596322,and RMSE(Root Mean Square Error)of 0.010636156 and MAPE(Mean Absolute Percentage Error)value of 0.0052 which determine the efficacy of the system.展开更多
In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel.Most studies focus on optimizing base station deploym...In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel.Most studies focus on optimizing base station deployment under the assumption of static obstacles,aiming to maximize the perception coverage of wireless RF(Radio Frequency)signals and reduce positioning blind spots.However,in practical security systems,obstacles are subject to change,necessitating the consideration of base station deployment in dynamic environments.Nevertheless,research in this area still needs to be conducted.This paper proposes a Dynamic Indoor Environment Beacon Deployment Algorithm(DIE-BDA)to address this problem.This algorithm considers the dynamic alterations in obstacle locations within the designated area.It determines the requisite number of base stations,the requisite time,and the area’s practical and overall signal coverage rates.The experimental results demonstrate that the algorithm can calculate the deployment strategy in 0.12 s following a change in obstacle positions.Experimental results show that the algorithm in this paper requires 0.12 s to compute the deployment strategy after the positions of obstacles change.With 13 base stations,it achieves an effective coverage rate of 93.5%and an overall coverage rate of 97.75%.The algorithm can rapidly compute a revised deployment strategy in response to changes in obstacle positions within security systems,thereby ensuring the efficacy of signal coverage.展开更多
The uncertain nature of mapping user tasks to Virtual Machines(VMs) causes system failure or execution delay in Cloud Computing.To maximize cloud resource throughput and decrease user response time,load balancing is n...The uncertain nature of mapping user tasks to Virtual Machines(VMs) causes system failure or execution delay in Cloud Computing.To maximize cloud resource throughput and decrease user response time,load balancing is needed.Possible load balancing is needed to overcome user task execution delay and system failure.Most swarm intelligent dynamic load balancing solutions that used hybrid metaheuristic algorithms failed to balance exploitation and exploration.Most load balancing methods were insufficient to handle the growing uncertainty in job distribution to VMs.Thus,the Hybrid Spotted Hyena and Whale Optimization Algorithm-based Dynamic Load Balancing Mechanism(HSHWOA) partitions traffic among numerous VMs or servers to guarantee user chores are completed quickly.This load balancing approach improved performance by considering average network latency,dependability,and throughput.This hybridization of SHOA and WOA aims to improve the trade-off between exploration and exploitation,assign jobs to VMs with more solution diversity,and prevent the solution from reaching a local optimality.Pysim-based experimental verification and testing for the proposed HSHWOA showed a 12.38% improvement in minimized makespan,16.21% increase in mean throughput,and 14.84% increase in network stability compared to baseline load balancing strategies like Fractional Improved Whale Social Optimization Based VM Migration Strategy FIWSOA,HDWOA,and Binary Bird Swap.展开更多
In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update ...In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.展开更多
For non-stationary complex dynamic systems,a standardized algorithm is developed to compute time correlation functions,addressing the limitations of traditional methods reliant on the stationary assumption.The propose...For non-stationary complex dynamic systems,a standardized algorithm is developed to compute time correlation functions,addressing the limitations of traditional methods reliant on the stationary assumption.The proposed algorithm integrates two-point and multi-point time correlation functions into a unified framework.Further,it is verified by a practical application in complex financial systems,demonstrating its potential in various complex dynamic systems.展开更多
Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among air...Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among airlines.The allocation process must operate within the prescribed capacity limits of the airport while adhering to established priorities and regulations.Additionally,ensuring market fairness is a key objective,as the value of airport slots plays a significant role in the adjustment process.This transforms the traditional time-shift-based problem into a complex multi-objective optimization problem.Addressing such complications is of significant importance to airlines,airports,and passengers alike.Due to the complexity of fairness metrics,traditional integer programming models encounter difficulties in finding effective solutions.This study proposes a neighborhood search strategy to tackle the single airport slot allocation,making it adaptable to both static and rolling capacity scenarios.Two Genetic Algorithms(GAs)are introduced,corresponding to time adjustment and sequence adjustment strategies,respectively.The GA based on the time adjustment strategy demonstrates high robustness,while the sequence adjustment strategy builds upon this GA to develop a simple heuristic algorithm that offers rapid convergence.Case studies conducted at seven airports in China confirm that all three algorithms yield high-quality adjustment solutions suitable for the majority of applications.Further,Pareto analysis reveals that these algorithms effectively balance the adjustment shifts and fairness metrics,demonstrating high practical value and broad applicability.展开更多
For strapdown stabilized platform used in automatic vertical drilling system,a new dynamic measurement algorithm based on three-axis accelerometer and three-axis fluxgate measurement signals is proposed and simulated ...For strapdown stabilized platform used in automatic vertical drilling system,a new dynamic measurement algorithm based on three-axis accelerometer and three-axis fluxgate measurement signals is proposed and simulated under the condition of small inclination dynamic rotation.The error compensation algorithm is also proposed.The bench test of strapdown stabilized platform is designed and carried out.The results show that:When the azimuth angle is the same,the larger the inclination angle is,the greater the error of the measurement results will be.When the inclination angle is the same,the measurement error is the largest when the azimuth angle is 90°and 270°,and the measurement error curve presents a sinusoidal change with the change of azimuth angle.After the error function compensation,the error curve between the calculation results and the true value is basically not affected by the inclination angle and the azimuth angle,and the calculation accuracy is signifi cantly improved.Under the random rotating speed of 0-180 rpm,the minimum error of the measured well inclination value was no more than 0.03°and the maximum was no more than 1.58°.The feasibility of the proposed dynamic azimuth measurement algorithm is verifi ed.This article provides a technical reference for the strapdown automatic drilling system.展开更多
The Dynamical Density Functional Theory(DDFT)algorithm,derived by associating classical Density Functional Theory(DFT)with the fundamental Smoluchowski dynamical equation,describes the evolution of inhomo-geneous flui...The Dynamical Density Functional Theory(DDFT)algorithm,derived by associating classical Density Functional Theory(DFT)with the fundamental Smoluchowski dynamical equation,describes the evolution of inhomo-geneous fluid density distributions over time.It plays a significant role in studying the evolution of density distributions over time in inhomogeneous systems.The Sunway Bluelight II supercomputer,as a new generation of China’s developed supercomputer,possesses powerful computational capabilities.Porting and optimizing industrial software on this platform holds significant importance.For the optimization of the DDFT algorithm,based on the Sunway Bluelight II supercomputer and the unique hardware architecture of the SW39000 processor,this work proposes three acceleration strategies to enhance computational efficiency and performance,including direct parallel optimization,local-memory constrained optimization for CPEs,and multi-core groups collaboration and communication optimization.This method combines the characteristics of the program’s algorithm with the unique hardware architecture of the Sunway Bluelight II supercomputer,optimizing the storage and transmission structures to achieve a closer integration of software and hardware.For the first time,this paper presents Sunway-Dynamical Density Functional Theory(SW-DDFT).Experimental results show that SW-DDFT achieves a speedup of 6.67 times within a single-core group compared to the original DDFT implementation,with six core groups(a total of 384 CPEs),the maximum speedup can reach 28.64 times,and parallel efficiency can reach 71%,demonstrating excellent acceleration performance.展开更多
In this study,we construct a bi-level optimization model based on the Stackelberg game and propose a robust optimization algorithm for solving the bi-level model,assuming an actual situation with several participants ...In this study,we construct a bi-level optimization model based on the Stackelberg game and propose a robust optimization algorithm for solving the bi-level model,assuming an actual situation with several participants in energy trading.Firstly,the energy trading process is analyzed between each subject based on the establishment of the operation framework of multi-agent participation in energy trading.Secondly,the optimal operation model of each energy trading agent is established to develop a bi-level game model including each energy participant.Finally,a combination algorithm of improved robust optimization over time(ROOT)and CPLEX is proposed to solve the established game model.The experimental results indicate that under different fitness thresholds,the robust optimization results of the proposed algorithm are increased by 56.91%and 68.54%,respectively.The established bi-level game model effectively balances the benefits of different energy trading entities.The proposed algorithm proposed can increase the income of each participant in the game by an average of 8.59%.展开更多
Gaze estimation,a crucial non-verbal communication cue,has achieved remarkable progress through convolutional neural networks.However,accurate gaze prediction in uncon-strained environments,particularly in extreme hea...Gaze estimation,a crucial non-verbal communication cue,has achieved remarkable progress through convolutional neural networks.However,accurate gaze prediction in uncon-strained environments,particularly in extreme head poses,partial occlusions,and abnormal lighting,remains challenging.Existing models often struggle to effectively focus on discriminative ocular features,leading to suboptimal performance.To address these limitations,this paper proposes dual-branch gaze estimation with Gaussian mixture distribution heatmaps and dynamic adaptive loss function(DMGDL),a novel dual-branch gaze estimation algorithm.By introducing Gaussian mixture distribution heatmaps centered on pupil positions as spatial attention guides,the model is enabled to prioritize ocular regions.Additionally,a dual-branch network architecture is designed to separately extract features for yaw and pitch angles,enhancing flexibility and mitigating cross-angle interference.A dynamic adaptive loss function is further formulated to address discontinuities in angle estimation,improving robustness and convergence stability.Experimental evaluations on three benchmark datasets demonstrate that DMGDL outperforms state-of-the-art methods,achiev-ing a mean angular error of 3.98°on the Max-Planck institute for informatics face gaze(MPI-IFaceGaze)dataset,10.21°on the physically unconstrained gaze estimation in the wild(Gaze360)dataset and 6.14°on the real-time eye gaze estimation in natural environments(RT-Gene)dataset,exhibiting superior generalization and robustness.展开更多
Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service lif...Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.展开更多
Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,curr...Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.展开更多
Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently...Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.展开更多
Accurate short-term wind power forecast technique plays a crucial role in maintaining the safety and economic efficiency of smart grids.Although numerous studies have employed various methods to forecast wind power,th...Accurate short-term wind power forecast technique plays a crucial role in maintaining the safety and economic efficiency of smart grids.Although numerous studies have employed various methods to forecast wind power,there remains a research gap in leveraging swarm intelligence algorithms to optimize the hyperparameters of the Transformer model for wind power prediction.To improve the accuracy of short-term wind power forecast,this paper proposes a hybrid short-term wind power forecast approach named STL-IAOA-iTransformer,which is based on seasonal and trend decomposition using LOESS(STL)and iTransformer model optimized by improved arithmetic optimization algorithm(IAOA).First,to fully extract the power data features,STL is used to decompose the original data into components with less redundant information.The extracted components as well as the weather data are then input into iTransformer for short-term wind power forecast.The final predicted short-term wind power curve is obtained by combining the predicted components.To improve the model accuracy,IAOA is employed to optimize the hyperparameters of iTransformer.The proposed approach is validated using real-generation data from different seasons and different power stations inNorthwest China,and ablation experiments have been conducted.Furthermore,to validate the superiority of the proposed approach under different wind characteristics,real power generation data fromsouthwestChina are utilized for experiments.Thecomparative results with the other six state-of-the-art prediction models in experiments show that the proposed model well fits the true value of generation series and achieves high prediction accuracy.展开更多
It is of great scientific significance to construct a 3D dynamic structural color with a special color effect based on the microlens array.However,the problems of imperfect mechanisms and poor color quality need to be...It is of great scientific significance to construct a 3D dynamic structural color with a special color effect based on the microlens array.However,the problems of imperfect mechanisms and poor color quality need to be solved.A method of 3D structural color turning on periodic metasurfaces fabricated by the microlens array and self-assembly technology was proposed in this study.In the experiment,Polydimethylsiloxane(PDMS)flexible film was used as a substrate,and SiO2 microspheres were scraped into grooves of the PDMS film to form 3D photonic crystal structures.By adjusting the number of blade-coated times and microsphere concentrations,high-saturation structural color micropatterns were obtained.These films were then matched with microlens arrays to produce dynamic graphics with iridescent effects.The results showed that by blade-coated two times and SiO2 microsphere concentrations of 50%are the best conditions.This method demonstrates the potential for being widely applied in the anticounterfeiting printing and ultra-high-resolution display.展开更多
In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms...In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.展开更多
The hot deformation behavior of Pt−10Ir alloy was studied under a wide range of deformation parameters.At a low deformation temperature(950−1150℃),the softening mechanism is primarily dynamic recovery.In addition,dyn...The hot deformation behavior of Pt−10Ir alloy was studied under a wide range of deformation parameters.At a low deformation temperature(950−1150℃),the softening mechanism is primarily dynamic recovery.In addition,dynamic recrystallization by progressive lattice rotation near grain boundaries(DRX by LRGBs)and microshear bands assisted dynamic recrystallization(MSBs assisted DRX)coordinate the deformation.However,it is difficult for the dynamic softening to offset the stain hardening due to a limited amount of DRXed grains.At a high deformation temperature(1250−1350℃),three main DRX mechanisms associated with strain rates occur:DRX by LRGBs,DRX by a homogeneous increase in misorientation(HIM)and geometric DRX(GDRX).With increasing strain,DRX by LRGBs is enhanced gradually under high strain rates;the“pinch-off”effect is enhanced at low strain rates,which was conducive to the formation of a uniform and fine microstructure.展开更多
The path planning problem of complex wild environment with multiple elements still poses challenges.This paper designs an algorithm that integrates global and local planning to apply to the wild environmental path pla...The path planning problem of complex wild environment with multiple elements still poses challenges.This paper designs an algorithm that integrates global and local planning to apply to the wild environmental path planning.The modeling process of wild environment map is designed.Three optimization strategies are designed to improve the A-Star in overcoming the problems of touching the edge of obstacles,redundant nodes and twisting paths.A new weighted cost function is designed to achieve different planning modes.Furthermore,the improved dynamic window approach(DWA)is designed to avoid local optimality and improve time efficiency compared to traditional DWA.For the necessary path re-planning of wild environment,the improved A-Star is integrated with the improved DWA to solve re-planning problem of unknown and moving obstacles in wild environment with multiple elements.The improved fusion algorithm effectively solves problems and consumes less time,and the simulation results verify the effectiveness of improved algorithms above.展开更多
基金supported by Sichuan Science and Technology Program[2023YFSY0026,2023YFH0004].
文摘Recent Super-Resolution(SR)algorithms often suffer from excessive model complexity,high computational costs,and limited flexibility across varying image scales.To address these challenges,we propose DDNet,a dynamic and lightweight SR framework designed for arbitrary scaling factors.DDNet integrates a residual learning structure with an Adaptively fusion Feature Block(AFB)and a scale-aware upsampling module,effectively reducing parameter overhead while preserving reconstruction quality.Additionally,we introduce DDNetGAN,an enhanced variant that leverages a relativistic Generative Adversarial Network(GAN)to further improve texture realism.To validate the proposed models,we conduct extensive training using the DIV2K and Flickr2K datasets and evaluate performance across standard benchmarks including Set5,Set14,Urban100,Manga109,and BSD100.Our experiments cover both symmetric and asymmetric upscaling factors and incorporate ablation studies to assess key components.Results show that DDNet and DDNetGAN achieve competitive performance compared with mainstream SR algorithms,demonstrating a strong balance between accuracy,efficiency,and flexibility.These findings highlight the potential of our approach for practical real-world super-resolution applications.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
基金Prince Sattam bin Abdulaziz University project number(PSAU/2023/R/1445)。
文摘Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid infrastructure.Analyzing the fluctuations in power generation and consumption patterns of smart cities assists in effectively managing continuous power supply in the grid.It also possesses a better impact on averting overloading and permitting effective energy storage.Even though many traditional techniques have predicted the consumption rate for preserving stability,enhancement is required in prediction measures with minimized loss.To overcome the complications in existing studies,this paper intends to predict stability from the smart grid stability prediction dataset using machine learning algorithms.To accomplish this,pre-processing is performed initially to handle missing values since it develops biased models when missing values are mishandled and performs feature scaling to normalize independent data features.Then,the pre-processed data are taken for training and testing.Following that,the regression process is performed using Modified PSO(Particle Swarm Optimization)optimized XGBoost Technique with dynamic inertia weight update,which analyses variables like gamma(G),reaction time(tau1–tau4),and power balance(p1–p4)for providing effective future stability in SG.Since PSO attains optimal solution by adjusting position through dynamic inertial weights,it is integrated with XGBoost due to its scalability and faster computational speed characteristics.The hyperparameters of XGBoost are fine-tuned in the training process for achieving promising outcomes on prediction.Regression results are measured through evaluation metrics such as MSE(Mean Square Error)of 0.011312781,MAE(Mean Absolute Error)of 0.008596322,and RMSE(Root Mean Square Error)of 0.010636156 and MAPE(Mean Absolute Percentage Error)value of 0.0052 which determine the efficacy of the system.
文摘In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel.Most studies focus on optimizing base station deployment under the assumption of static obstacles,aiming to maximize the perception coverage of wireless RF(Radio Frequency)signals and reduce positioning blind spots.However,in practical security systems,obstacles are subject to change,necessitating the consideration of base station deployment in dynamic environments.Nevertheless,research in this area still needs to be conducted.This paper proposes a Dynamic Indoor Environment Beacon Deployment Algorithm(DIE-BDA)to address this problem.This algorithm considers the dynamic alterations in obstacle locations within the designated area.It determines the requisite number of base stations,the requisite time,and the area’s practical and overall signal coverage rates.The experimental results demonstrate that the algorithm can calculate the deployment strategy in 0.12 s following a change in obstacle positions.Experimental results show that the algorithm in this paper requires 0.12 s to compute the deployment strategy after the positions of obstacles change.With 13 base stations,it achieves an effective coverage rate of 93.5%and an overall coverage rate of 97.75%.The algorithm can rapidly compute a revised deployment strategy in response to changes in obstacle positions within security systems,thereby ensuring the efficacy of signal coverage.
文摘The uncertain nature of mapping user tasks to Virtual Machines(VMs) causes system failure or execution delay in Cloud Computing.To maximize cloud resource throughput and decrease user response time,load balancing is needed.Possible load balancing is needed to overcome user task execution delay and system failure.Most swarm intelligent dynamic load balancing solutions that used hybrid metaheuristic algorithms failed to balance exploitation and exploration.Most load balancing methods were insufficient to handle the growing uncertainty in job distribution to VMs.Thus,the Hybrid Spotted Hyena and Whale Optimization Algorithm-based Dynamic Load Balancing Mechanism(HSHWOA) partitions traffic among numerous VMs or servers to guarantee user chores are completed quickly.This load balancing approach improved performance by considering average network latency,dependability,and throughput.This hybridization of SHOA and WOA aims to improve the trade-off between exploration and exploitation,assign jobs to VMs with more solution diversity,and prevent the solution from reaching a local optimality.Pysim-based experimental verification and testing for the proposed HSHWOA showed a 12.38% improvement in minimized makespan,16.21% increase in mean throughput,and 14.84% increase in network stability compared to baseline load balancing strategies like Fractional Improved Whale Social Optimization Based VM Migration Strategy FIWSOA,HDWOA,and Binary Bird Swap.
文摘In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.
基金Project supported by the Postdoctoral Fellowship Program of China Postdoctoral Science Foundation(Grant No.GZC20231050)the National Natural Science Foundation of China(Grant Nos.12175193 and 11905183)the 13th Five-year plan for Education Science Funding of Guangdong Province(Grant No.2021GXJK349)。
文摘For non-stationary complex dynamic systems,a standardized algorithm is developed to compute time correlation functions,addressing the limitations of traditional methods reliant on the stationary assumption.The proposed algorithm integrates two-point and multi-point time correlation functions into a unified framework.Further,it is verified by a practical application in complex financial systems,demonstrating its potential in various complex dynamic systems.
基金supported in part by the National Natural Science Foundation of China(Nos.62167003,52302421)in part by the Diversified Investment Fund of Tianjin,China(No.23JCQNJC00210)。
文摘Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among airlines.The allocation process must operate within the prescribed capacity limits of the airport while adhering to established priorities and regulations.Additionally,ensuring market fairness is a key objective,as the value of airport slots plays a significant role in the adjustment process.This transforms the traditional time-shift-based problem into a complex multi-objective optimization problem.Addressing such complications is of significant importance to airlines,airports,and passengers alike.Due to the complexity of fairness metrics,traditional integer programming models encounter difficulties in finding effective solutions.This study proposes a neighborhood search strategy to tackle the single airport slot allocation,making it adaptable to both static and rolling capacity scenarios.Two Genetic Algorithms(GAs)are introduced,corresponding to time adjustment and sequence adjustment strategies,respectively.The GA based on the time adjustment strategy demonstrates high robustness,while the sequence adjustment strategy builds upon this GA to develop a simple heuristic algorithm that offers rapid convergence.Case studies conducted at seven airports in China confirm that all three algorithms yield high-quality adjustment solutions suitable for the majority of applications.Further,Pareto analysis reveals that these algorithms effectively balance the adjustment shifts and fairness metrics,demonstrating high practical value and broad applicability.
基金The financial supports from National key plan project for research and development of China (2019YFA0708300) and (2023YFC3009200)。
文摘For strapdown stabilized platform used in automatic vertical drilling system,a new dynamic measurement algorithm based on three-axis accelerometer and three-axis fluxgate measurement signals is proposed and simulated under the condition of small inclination dynamic rotation.The error compensation algorithm is also proposed.The bench test of strapdown stabilized platform is designed and carried out.The results show that:When the azimuth angle is the same,the larger the inclination angle is,the greater the error of the measurement results will be.When the inclination angle is the same,the measurement error is the largest when the azimuth angle is 90°and 270°,and the measurement error curve presents a sinusoidal change with the change of azimuth angle.After the error function compensation,the error curve between the calculation results and the true value is basically not affected by the inclination angle and the azimuth angle,and the calculation accuracy is signifi cantly improved.Under the random rotating speed of 0-180 rpm,the minimum error of the measured well inclination value was no more than 0.03°and the maximum was no more than 1.58°.The feasibility of the proposed dynamic azimuth measurement algorithm is verifi ed.This article provides a technical reference for the strapdown automatic drilling system.
基金supported by National Key Research and Development Program of China under Grant 2024YFE0210800National Natural Science Foundation of China under Grant 62495062Beijing Natural Science Foundation under Grant L242017.
文摘The Dynamical Density Functional Theory(DDFT)algorithm,derived by associating classical Density Functional Theory(DFT)with the fundamental Smoluchowski dynamical equation,describes the evolution of inhomo-geneous fluid density distributions over time.It plays a significant role in studying the evolution of density distributions over time in inhomogeneous systems.The Sunway Bluelight II supercomputer,as a new generation of China’s developed supercomputer,possesses powerful computational capabilities.Porting and optimizing industrial software on this platform holds significant importance.For the optimization of the DDFT algorithm,based on the Sunway Bluelight II supercomputer and the unique hardware architecture of the SW39000 processor,this work proposes three acceleration strategies to enhance computational efficiency and performance,including direct parallel optimization,local-memory constrained optimization for CPEs,and multi-core groups collaboration and communication optimization.This method combines the characteristics of the program’s algorithm with the unique hardware architecture of the Sunway Bluelight II supercomputer,optimizing the storage and transmission structures to achieve a closer integration of software and hardware.For the first time,this paper presents Sunway-Dynamical Density Functional Theory(SW-DDFT).Experimental results show that SW-DDFT achieves a speedup of 6.67 times within a single-core group compared to the original DDFT implementation,with six core groups(a total of 384 CPEs),the maximum speedup can reach 28.64 times,and parallel efficiency can reach 71%,demonstrating excellent acceleration performance.
基金supported by the National Nature Science Foundation of China(Nos.62063019)Natural Science Foundation of Gansu Province(22JR5RA241,2023CXZX-465).
文摘In this study,we construct a bi-level optimization model based on the Stackelberg game and propose a robust optimization algorithm for solving the bi-level model,assuming an actual situation with several participants in energy trading.Firstly,the energy trading process is analyzed between each subject based on the establishment of the operation framework of multi-agent participation in energy trading.Secondly,the optimal operation model of each energy trading agent is established to develop a bi-level game model including each energy participant.Finally,a combination algorithm of improved robust optimization over time(ROOT)and CPLEX is proposed to solve the established game model.The experimental results indicate that under different fitness thresholds,the robust optimization results of the proposed algorithm are increased by 56.91%and 68.54%,respectively.The established bi-level game model effectively balances the benefits of different energy trading entities.The proposed algorithm proposed can increase the income of each participant in the game by an average of 8.59%.
基金supported by the Key Project of the NationalLanguage Commission(No.ZDI145-110)the AcademicResearch Projects of Beijing Union University(No.ZK20202514)+1 种基金the Key Laboratory Project(No.YYZN-2024-6)the Project for the Construction and Support of High-Level Innovative Teams in Beijing Municipal Institutions(No.BPHR20220121).
文摘Gaze estimation,a crucial non-verbal communication cue,has achieved remarkable progress through convolutional neural networks.However,accurate gaze prediction in uncon-strained environments,particularly in extreme head poses,partial occlusions,and abnormal lighting,remains challenging.Existing models often struggle to effectively focus on discriminative ocular features,leading to suboptimal performance.To address these limitations,this paper proposes dual-branch gaze estimation with Gaussian mixture distribution heatmaps and dynamic adaptive loss function(DMGDL),a novel dual-branch gaze estimation algorithm.By introducing Gaussian mixture distribution heatmaps centered on pupil positions as spatial attention guides,the model is enabled to prioritize ocular regions.Additionally,a dual-branch network architecture is designed to separately extract features for yaw and pitch angles,enhancing flexibility and mitigating cross-angle interference.A dynamic adaptive loss function is further formulated to address discontinuities in angle estimation,improving robustness and convergence stability.Experimental evaluations on three benchmark datasets demonstrate that DMGDL outperforms state-of-the-art methods,achiev-ing a mean angular error of 3.98°on the Max-Planck institute for informatics face gaze(MPI-IFaceGaze)dataset,10.21°on the physically unconstrained gaze estimation in the wild(Gaze360)dataset and 6.14°on the real-time eye gaze estimation in natural environments(RT-Gene)dataset,exhibiting superior generalization and robustness.
基金fundings supported by Sichuan Science and Technology Program(2025YFHZ0065).
文摘Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant(No.51677058).
文摘Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.
基金National Natural Science Foundation of China(11971211,12171388).
文摘Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.
基金supported by Yunnan Provincial Basic Research Project(202401AT070344,202301AT070443)National Natural Science Foundation of China(62263014,52207105)+1 种基金Yunnan Lancang-Mekong International Electric Power Technology Joint Laboratory(202203AP140001)Major Science and Technology Projects in Yunnan Province(202402AG050006).
文摘Accurate short-term wind power forecast technique plays a crucial role in maintaining the safety and economic efficiency of smart grids.Although numerous studies have employed various methods to forecast wind power,there remains a research gap in leveraging swarm intelligence algorithms to optimize the hyperparameters of the Transformer model for wind power prediction.To improve the accuracy of short-term wind power forecast,this paper proposes a hybrid short-term wind power forecast approach named STL-IAOA-iTransformer,which is based on seasonal and trend decomposition using LOESS(STL)and iTransformer model optimized by improved arithmetic optimization algorithm(IAOA).First,to fully extract the power data features,STL is used to decompose the original data into components with less redundant information.The extracted components as well as the weather data are then input into iTransformer for short-term wind power forecast.The final predicted short-term wind power curve is obtained by combining the predicted components.To improve the model accuracy,IAOA is employed to optimize the hyperparameters of iTransformer.The proposed approach is validated using real-generation data from different seasons and different power stations inNorthwest China,and ablation experiments have been conducted.Furthermore,to validate the superiority of the proposed approach under different wind characteristics,real power generation data fromsouthwestChina are utilized for experiments.Thecomparative results with the other six state-of-the-art prediction models in experiments show that the proposed model well fits the true value of generation series and achieves high prediction accuracy.
文摘It is of great scientific significance to construct a 3D dynamic structural color with a special color effect based on the microlens array.However,the problems of imperfect mechanisms and poor color quality need to be solved.A method of 3D structural color turning on periodic metasurfaces fabricated by the microlens array and self-assembly technology was proposed in this study.In the experiment,Polydimethylsiloxane(PDMS)flexible film was used as a substrate,and SiO2 microspheres were scraped into grooves of the PDMS film to form 3D photonic crystal structures.By adjusting the number of blade-coated times and microsphere concentrations,high-saturation structural color micropatterns were obtained.These films were then matched with microlens arrays to produce dynamic graphics with iridescent effects.The results showed that by blade-coated two times and SiO2 microsphere concentrations of 50%are the best conditions.This method demonstrates the potential for being widely applied in the anticounterfeiting printing and ultra-high-resolution display.
基金supported by the National Natural Science Foundation of China(No.62373027).
文摘In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.
基金financial supports from the National Natural Science Foundation of China(Nos.52161023,51901204)Science and Technology Project of Yunnan Precious Metal Laboratory,China(No.YPML-2023050208)+1 种基金Yunnan Science and Technology Planning Project,China(Nos.202201AU070010,202301AT070276,202302AB080008,202303AA080001)Postgraduate Research and Innovation Foundation of Yunnan University,China(No.2021Y338).
文摘The hot deformation behavior of Pt−10Ir alloy was studied under a wide range of deformation parameters.At a low deformation temperature(950−1150℃),the softening mechanism is primarily dynamic recovery.In addition,dynamic recrystallization by progressive lattice rotation near grain boundaries(DRX by LRGBs)and microshear bands assisted dynamic recrystallization(MSBs assisted DRX)coordinate the deformation.However,it is difficult for the dynamic softening to offset the stain hardening due to a limited amount of DRXed grains.At a high deformation temperature(1250−1350℃),three main DRX mechanisms associated with strain rates occur:DRX by LRGBs,DRX by a homogeneous increase in misorientation(HIM)and geometric DRX(GDRX).With increasing strain,DRX by LRGBs is enhanced gradually under high strain rates;the“pinch-off”effect is enhanced at low strain rates,which was conducive to the formation of a uniform and fine microstructure.
基金Industry-University-Research Cooperation Fund Project of the Eighth Research Institute of China Aerospace Science and Technology Corporation(No.USCAST2022-11)。
文摘The path planning problem of complex wild environment with multiple elements still poses challenges.This paper designs an algorithm that integrates global and local planning to apply to the wild environmental path planning.The modeling process of wild environment map is designed.Three optimization strategies are designed to improve the A-Star in overcoming the problems of touching the edge of obstacles,redundant nodes and twisting paths.A new weighted cost function is designed to achieve different planning modes.Furthermore,the improved dynamic window approach(DWA)is designed to avoid local optimality and improve time efficiency compared to traditional DWA.For the necessary path re-planning of wild environment,the improved A-Star is integrated with the improved DWA to solve re-planning problem of unknown and moving obstacles in wild environment with multiple elements.The improved fusion algorithm effectively solves problems and consumes less time,and the simulation results verify the effectiveness of improved algorithms above.
