Research on Euclidean Algorithm and Reection on Its Teaching

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.

An Algorithm for Cloud-based Web Service Combination Optimization Through Plant Growth Simulation

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.

Method for Estimating the State of Health of Lithium-ion Batteries Based on Differential Thermal Voltammetry and Sparrow Search Algorithm-Elman Neural Network

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%.

Short-TermWind Power Forecast Based on STL-IAOA-iTransformer Algorithm:A Case Study in Northwest China

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.

Unveiling Effective Heuristic Strategies: A Review of Cross-Domain Heuristic Search Challenge Algorithms

The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamically choose heuristics during the search process.Numerous selection hyper-heuristics have different imple-mentation strategies.However,comparisons between them are lacking in the literature,and previous works have not highlighted the beneficial and detrimental implementation methods of different components.The question is how to effectively employ them to produce an efficient search heuristic.Furthermore,the algorithms that competed in the inaugural CHeSC have not been collectively reviewed.This work conducts a review analysis of the top twenty competitors from this competition to identify effective and ineffective strategies influencing algorithmic performance.A summary of the main characteristics and classification of the algorithms is presented.The analysis underlines efficient and inefficient methods in eight key components,including search points,search phases,heuristic selection,move acceptance,feedback,Tabu mechanism,restart mechanism,and low-level heuristic parameter control.This review analyzes the components referencing the competition’s final leaderboard and discusses future research directions for these components.The effective approaches,identified as having the highest quality index,are mixed search point,iterated search phases,relay hybridization selection,threshold acceptance,mixed learning,Tabu heuristics,stochastic restart,and dynamic parameters.Findings are also compared with recent trends in hyper-heuristics.This work enhances the understanding of selection hyper-heuristics,offering valuable insights for researchers and practitioners aiming to develop effective search algorithms for diverse problem domains.

Multi-Objective Hybrid Sailfish Optimization Algorithm for Planetary Gearbox and Mechanical Engineering Design Optimization Problems

This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.

Enhanced Multi-Object Dwarf Mongoose Algorithm for Optimization Stochastic Data Fusion Wireless Sensor Network Deployment

Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.

Application of QPSO-KM Algorithm in Wine Quality Classification

Since there are many factors affecting the quality of wine, total 17 factors were screened out using principle component analysis. The difference test was conducted on the evaluation data of the two groups of testers. The results showed that the evaluation data of the second group were more reliable compared with those of the first group. At the same time, the KM algorithm was optimized using the QPSO algorithm. The wine classification model was established. Compared with the other two algorithms, the QPSO-KM algorithm was more capable of searching the globally optimum solution, and it could be used to classify the wine samples. In addition,the QPSO-KM algorithm could also be used to solve the issues about clustering.

基于GA-QPSO-ELM的边坡位移组合预测

为了提高水利工程边坡位移预测精度,在QPSO算法寻优过程中引入遗传算法的交叉和变异操作,形成GA-QPSO算法。采用GA-QPSO算法对ELM参数进行优化,建立基于GA-QPSO-ELM的边坡位移组合预测模型,采用实际水利工程的边坡位移监测数据进行仿真分析,并与其他边坡位移预测方法进行对比。结果表明,GA-QPSO-ELM组合模型的平均相对误差为1.186%,预测精度高于其他方法,验证了模型的正确性和优越性。

基于CEEMDAN-QPSO-BLS模型的径流预测研究

准确的径流预测是水资源优化配置和高效利用的前提,是制定防洪减灾决策的基础,然而受到人类活动、环境、气候等因素的影响,径流序列呈现出非线性、非稳态、多尺度变化的特点,这为径流的精准预测增加了难度。为提高径流预测的精准度和可信度,结合自适应噪声完备集合经验模态分解(Complete Ensemble Empirical Mode Decomposition with Adaptive Noise,CEEMDAN)方法,量子粒子群优化算法(Quantum Particle Swarm Optimization,QPSO)、宽度学习系统(Broad Learning System,BLS)模型,提出了一种基于CEEMDAN-QPSO-BLS组合式的径流预测模型。该组合模型首先使用CEEMDAN方法对原始径流信号进行分解,得到若干相对平稳的本征模态分量。其次利用QPSO算法对BLS模型的特征层节点组数、增强层节点组数和组内节点数进行寻优,得到最优的宽度学习网络拓扑结构,进而使用最优的QPSOBLS对多个稳态分量进行预测,并对预测分量进行重构,从而获得更高的预测精度。以黄河流域小浪底水库的日径流值为实验数据,将EMD-QPSO-BLS、QPSO-BLS作为CEEMDAN-QPSO-BLS的对比模型,并采用纳什效率系数(NSE)、均方根误差(RMSE)、平均绝对误差(MAE)和平均绝对百分比误差(MAPE)作为模型预测可信度和精准度的评价指标。实验表明,在预见期4天内,与QPSO-BLS、EMD-QPSO-BLS模型相比,CEEMDAN-QPSO-BLS的预测精准度分别提高了79.87%、19.80%,可信度分别提高了131.2%、10.98%,径流预测精度的提高,可为防洪抗旱保护人民生命财产和可持续发展提供决策支持。

钻孔瞬变电磁法扫描探测RCQPSO-LMO组合算法2.5D反演

利用钻孔进行超前探测地质构造及含水体是地下开挖工程中的常规手段,如何利用这些钻孔进行钻孔瞬变电磁法扫描探测,从而实现钻孔孔壁外围地质异常体的精细探测,对实现地下工程地质透明化具有重要的指导意义.本文提出钻孔瞬变电磁法扫描探测2.5D反演的数据解译方法,首先针对随机性反演算法时效性低,易陷入局部最优解,而确定性反演算法依赖初始模型的问题,提出了组合策略的量子粒子群优化算法用来随机搜索最优初始模型.在此基础上,利用Levenberg-Marquarat方法求解Occam反演的目标函数,形成了RCQPSO-LMO组合算法进行2.5D反演,通过对比组合算法和单一算法,验证了组合算法具有更精确的反演结果.其次结合屏蔽条件下扫描探测,对比分析了有无屏蔽的2.5D反演结果,通过设定屏蔽系数对非探测方向信号进行部分压制,可以较好地解决钻孔径向扫描探测中对非探测方向信号部分屏蔽下的反演及成像.最后建立三组理论模型进行组合算法2.5D反演,结果表明:组合算法反演结果与理论模型的一致性较好,对低阻异常体的反演精度较高,验证了组合算法对钻孔孔壁外围低阻异常体具有较高的反演精度和分辨能力.

QPSO-based algorithm of CSO joint infrared super-resolution and trajectory estimation

The midcourse ballistic closely spaced objects（CSO） create blur pixel-cluster on the space-based infrared focal plane,making the super-resolution of CSO quite necessary.A novel algorithm of CSO joint super-resolution and trajectory estimation is presented.The algorithm combines the focal plane CSO dynamics and radiation models,proposes a novel least square objective function from the space and time information,where CSO radiant intensity is excluded and initial dynamics（position and velocity） are chosen as the model parameters.Subsequently,the quantum-behaved particle swarm optimization（QPSO） is adopted to optimize the objective function to estimate model parameters,and then CSO focal plane trajectories and radiant intensities are computed.Meanwhile,the estimated CSO focal plane trajectories from multiple space-based infrared focal planes are associated and filtered to estimate the CSO stereo ballistic trajectories.Finally,the performance（CSO estimation precision of the focal plane coordinates,radiant intensities,and stereo ballistic trajectories,together with the computation load） of the algorithm is tested,and the results show that the algorithm is effective and feasible.

Nonlinear Inversion for Complex Resistivity Method Based on QPSO-BP Algorithm

The significant advantage of the complex resistivity method is to reflect the abnormal body through multi-parameters, but its inversion parameters are more than the resistivity tomography method. Therefore, how to effectively invert these spectral parameters has become the focused area of the complex resistivity inversion. An optimized BP neural network (BPNN) approach based on Quantum Particle Swarm Optimization (QPSO) algorithm was presented, which was able to improve global search ability for complex resistivity multi-parameter nonlinear inversion. In the proposed method, the nonlinear weight adjustment strategy and mutation operator were used to enhance the optimization ability of QPSO algorithm. Implementation of proposed QPSO-BPNN was given, the network had 56 hidden neurons in two hidden layers (the first hidden layer has 46 neurons and the second hidden layer has 10 neurons) and it was trained on 48 datasets and tested on another 5 synthetic datasets. The training and test results show that BP neural network optimized by the QPSO algorithm performs better than the BP neural network without initial optimization on the inversion training and test models, and the mean square error distribution is better. At the same time, a double polarized anomalous bodies model was also used to verify the feasibility and effectiveness of the proposed method, the inversion results show that the QPSO-BP algorithm inversion clearly characterizes the anomalous boundaries and is closer to the values of the parameters.

基于QPSO的密闭空间混叠冲击波的分离解算方法

针对在密闭空间中爆炸产生的冲击波导致混叠冲击波对内壁毁伤较为复杂的问题,提出一种分离混叠冲击波的解算方法。通过正演模拟分析密闭空间内混叠冲击波对内壁面的毁伤,得到壁面上的冲击波是多次混叠的。建立独立冲击波的全波形模型,并采用量子粒子群优化(QPSO)算法,对多次混叠冲击波进行分解和拟合。QPSO算法拟合出独立的冲击波,其仿真结果相较于遗传算法,均方根误差从0.2506降至0.1216,平均相对误差从0.1079%降至0.1059%。

基于QPSO的震动传感器片上相位补偿器设计方法

震动传感器的系统相位非一致性会对地震波到时时差提取产生很大的误差,严重影响震源定位精度;针对这一问题,提出了一种基于量子粒子群优化算法(QPSO)的震动传感器片上相位补偿器设计方法;首先对震动传感器进行相位标定,获得传感器与参考传感器的相位差;其次设计基于QPSO算法的相位补偿滤波器对相位差进行修正,使其无限趋近于0;最后,将相位补偿滤波器封装成FPGA软核部署于FPGA上,完成对震动传感器的相位片上实时补偿;为了验证该方法的性能,将相位补偿滤波器部署于自研的多通道震动信号采集系统上,对8个相同型号震动传感器进行相位一致性校准;试验结果表明,在震动传感器频响范围内,该方法可以将2.5°内的传感器相位差实时修正至0.004 4°以下,实现了震动传感器阵列的相位一致性实时校准;该成果在地下浅层震源定位领域具有较强的应用价值。

An Improved Hybrid Indoor Positioning Algorithm via QPSO and MLP Signal Weighting

Accurate location or positioning of people and self-driven devices in large indoor environments has become an important necessity The application of increasingly automated self-operating moving transportation units,in large indoor spaces demands a precise knowledge of their positions.Technologies like WiFi and Bluetooth,despite their low-cost and availability,are sensitive to signal noise and fading effects.For these reasons,a hybrid approach,which uses two different signal sources,has proven to be more resilient and accurate for the positioning determination in indoor environments.Hence,this paper proposes an improved hybrid technique to implement a fingerprinting based indoor positioning,using Received Signal Strength information from available Wireless Local Area Network access points,together with the Wireless Sensor Networks technology.Six signals were recorded on a regular grid of anchor points,covering the research space.An optimization was performed by relative signal weighting,to minimize the average positioning error over the research space.The optimization process was conducted using a standard Quantum Particle Swarm Optimization,while the position error estimate for all given sets of weighted signals was performed using aMultilayer Perceptron(MLP)neural network.Compared to our previous research works,the MLP architecture was improved to three hidden layers and its learning parameters were finely tuned.These experimental results led to the 20%reduction of the positioning error when a suitable set of signal weights was calculated in the optimization process.Our final achieved value of 0.725 m of the location incertitude shows a sensible improvement compared to our previous results.

基于DIR-QPSO的弹丸落点定位声阵列优化布设方法

为了满足有限测点下声阵列定位精度提升的需求,提出了基于双种群量子粒子群(dual-group interaction quantum particle swarm optimization, DIR-QPSO)联合到达时差定位技术(time difference of arrival, TDOA)的单基站声阵列拓扑结构优化布设方法。首先,将声阵列中的声传感器作为粒子,利用Logistic混沌模型全局遍历性的优势初始化种群;其次,利用双种群之间信息共享优势,消除迭代过程中陷入局部最优点;再次,以TDOA模型构建适应度评价函数,得到声传感器最优布设位置;最后,通过仿真验证,得到优化后的声阵列拓扑结构。仿真结果表明,与传统六元正四棱锥阵列及QPSO优化后的阵列相比,方法将几何精度因子减小至1.351 8 m,克拉美罗下界减小至0.481 7 m,均方根误差减小至0.556 4 m。最后进行实验对比验证,实验结果表明,提出的单基站阵列具有更高的定位精度,极大提升了弹丸落点定位精度。

Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm

The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.

基于QPSO-BP神经网络的数学学科质量评价模型

为降低BP神经网络初始权值和阈值随机选取导致的评价误差,在BP神经网络中融合QPSO算法构建数学学科质量评价模型。以19个学科质量评价二级指标为范围,基于主成分分析法提取关键指标成分,并计算二级指标贡献率,数据降维后选出累计贡献率不低于85%的指标,输入BP神经网络模型;采用QPSO算法优化BP神经网络初始权值和阈值,更新了粒子位置,考虑了当前粒子局部最优位置与全局最优位置,引入“粒子平均最优位置”,强化了粒子之间的相互作用,同时利用权重系数平衡了粒子收敛能力;由此构建QPSO-BP数学学科质量评价模型,可将数学学科质量评价的效果划分为优秀、良好、中等、较差4个等级。实验结果显示,融合QPSO算法的数学学科质量评价模型可将累计贡献率达到85%的指标保留下来,且评价误差均低于预设误差0.01。该模型收敛性能较好,得出的数学学科质量评价结果符合实际情况,避免人为主观随意性,为数学学科建设提供了有效的质量反馈。

MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing

Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO).