Hybrid Gene Selection Methods for High-Dimensional Lung Cancer Data Using Improved Arithmetic Optimization Algorithm

Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression microarrays have made it possible to find genetic biomarkers for cancer diagnosis and prediction in a high-throughput manner.Machine Learning(ML)has been widely used to diagnose and classify lung cancer where the performance of ML methods is evaluated to identify the appropriate technique.Identifying and selecting the gene expression patterns can help in lung cancer diagnoses and classification.Normally,microarrays include several genes and may cause confusion or false prediction.Therefore,the Arithmetic Optimization Algorithm(AOA)is used to identify the optimal gene subset to reduce the number of selected genes.Which can allow the classifiers to yield the best performance for lung cancer classification.In addition,we proposed a modified version of AOA which can work effectively on the high dimensional dataset.In the modified AOA,the features are ranked by their weights and are used to initialize the AOA population.The exploitation process of AOA is then enhanced by developing a local search algorithm based on two neighborhood strategies.Finally,the efficiency of the proposed methods was evaluated on gene expression datasets related to Lung cancer using stratified 4-fold cross-validation.The method’s efficacy in selecting the optimal gene subset is underscored by its ability to maintain feature proportions between 10%to 25%.Moreover,the approach significantly enhances lung cancer prediction accuracy.For instance,Lung_Harvard1 achieved an accuracy of 97.5%,Lung_Harvard2 and Lung_Michigan datasets both achieved 100%,Lung_Adenocarcinoma obtained an accuracy of 88.2%,and Lung_Ontario achieved an accuracy of 87.5%.In conclusion,the results indicate the potential promise of the proposed modified AOA approach in classifying microarray cancer data.

Enhanced Arithmetic Optimization Algorithm Guided by a Local Search for the Feature Selection Problem

High-dimensional datasets present significant challenges for classification tasks.Dimensionality reduction,a crucial aspect of data preprocessing,has gained substantial attention due to its ability to improve classification per-formance.However,identifying the optimal features within high-dimensional datasets remains a computationally demanding task,necessitating the use of efficient algorithms.This paper introduces the Arithmetic Optimization Algorithm(AOA),a novel approach for finding the optimal feature subset.AOA is specifically modified to address feature selection problems based on a transfer function.Additionally,two enhancements are incorporated into the AOA algorithm to overcome limitations such as limited precision,slow convergence,and susceptibility to local optima.The first enhancement proposes a new method for selecting solutions to be improved during the search process.This method effectively improves the original algorithm’s accuracy and convergence speed.The second enhancement introduces a local search with neighborhood strategies(AOA_NBH)during the AOA exploitation phase.AOA_NBH explores the vast search space,aiding the algorithm in escaping local optima.Our results demonstrate that incorporating neighborhood methods enhances the output and achieves significant improvement over state-of-the-art methods.

Improved Arithmetic Optimization Algorithm with Multi-Strategy Fusion Mechanism and Its Application in Engineering Design

This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a multi-strategy mechanism (BSFAOA). This algorithm introduces three strategies within the standard AOA framework: an adaptive balance factor SMOA based on sine functions, a search strategy combining Spiral Search and Brownian Motion, and a hybrid perturbation strategy based on Whale Fall Mechanism and Polynomial Differential Learning. The BSFAOA algorithm is analyzed in depth on the well-known 23 benchmark functions, CEC2019 test functions, and four real optimization problems. The experimental results demonstrate that the BSFAOA algorithm can better balance the exploration and exploitation capabilities, significantly enhancing the stability, convergence mode, and search efficiency of the AOA algorithm.

A Comparison of Arithmetic Operations for Dynamic Process Optimization Approach

A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.

Effective arithmetic optimization algorithm with probabilistic search strategy for function optimization problems

This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.

Differential Evolution with Arithmetic Optimization Algorithm Enabled Multi-Hop Routing Protocol

Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is challenging to design energy-efficient WSN.The routing approaches are leveraged to reduce the utilization of energy and prolonging the lifespan of network.In order to solve the restricted energy problem,it is essential to reduce the energy utilization of data,transmitted from the routing protocol and improve network development.In this background,the current study proposes a novel Differential Evolution with Arithmetic Optimization Algorithm Enabled Multi-hop Routing Protocol(DEAOA-MHRP)for WSN.The aim of the proposed DEAOA-MHRP model is select the optimal routes to reach the destination in WSN.To accomplish this,DEAOA-MHRP model initially integrates the concepts of Different Evolution(DE)and Arithmetic Optimization Algorithms(AOA)to improve convergence rate and solution quality.Besides,the inclusion of DE in traditional AOA helps in overcoming local optima problems.In addition,the proposed DEAOA-MRP technique derives a fitness function comprising two input variables such as residual energy and distance.In order to ensure the energy efficient performance of DEAOA-MHRP model,a detailed comparative study was conducted and the results established its superior performance over recent approaches.

An Optimal Double Inequality among the One-Parameter, Arithmetic and Geometric Means

In the present paper, we answer the question: for 0a what are the greatest value p(a) and the least value q(a) such that the double inequality Jp(a,b)aA(a,b)+ (1-a)G(a,b)Jq(a,b) holds for all a,b>0 with a is not equal to?b ?

Method of Fire Image Identification Based on Optimization Theory

In view of some distinctive characteristics of the early-stage flame image, a corresponding method of characteristic extraction is presented. Also introduced is the application of the improved BP algorithm based on the optimization theory to identifying fire image characteristics. First the optimization of BP neural network adopting Levenberg-Marquardt algorithm with the property of quadratic convergence is discussed, and then a new system of fire image identification is devised. Plenty of experiments and field tests have proved that this system can detect the early-stage fire flame quickly and reliably.

Combinatorial Optimization Based Analog Circuit Fault Diagnosis with Back Propagation Neural Network

Electronic components' reliability has become the key of the complex system mission execution. Analog circuit is an important part of electronic components. Its fault diagnosis is far more challenging than that of digital circuit. Simulations and applications have shown that the methods based on BP neural network are effective in analog circuit fault diagnosis. Aiming at the tolerance of analog circuit,a combinatorial optimization diagnosis scheme was proposed with back propagation( BP) neural network( BPNN).The main contributions of this scheme included two parts:( 1) the random tolerance samples were added into the nominal training samples to establish new training samples,which were used to train the BP neural network based diagnosis model;( 2) the initial weights of the BP neural network were optimized by genetic algorithm( GA) to avoid local minima,and the BP neural network was tuned with Levenberg-Marquardt algorithm( LMA) in the local solution space to look for the optimum solution or approximate optimal solutions. The experimental results show preliminarily that the scheme substantially improves the whole learning process approximation and generalization ability,and effectively promotes analog circuit fault diagnosis performance based on BPNN.

Hybrid method for global optimization using more accuracy interval computation

In this paper, a novel hybrid method is presented for finding global optimization of an objective function. Based on the interval computation, this hybrid method combines interval deterministic method and stochastic evolution method. It can find global optimization quickly while ensuring the deterministic and stability of the algorithm. When using interval computation, extra width constraints accuracy of interval computation results. In this paper, a splitting method to reduce the extra width is introduced. This method is easy and it can get a more precise interval computation result. When finding the global optimization, it can increase the efficiency of pruning. Several experiments are given to illustrate the advantage of the new hybrid method.

Fuzzy optimization neural network model based on LM algorithm

A new fuzzy optimization neural network model is proposed based on the Levenberg-Marquardt (LM) algorithm on account of the disadvantages of slow convergence of traditional fuzzy optimization neural network model. In this new model,the gradient descent algorithm is replaced by the LM algorithm to obtain the minimum of output errors during network training,which changes the weights adjusting equations of the network and increases the training speed. Moreover,to avoid the results yielding to local minimum,the transfer function is also revised to sigmoid function. A case study is utilized to validate this new model,and the results reveal that the new model fast training speed and better forecasting capability.

Weigh in Motion Based on Parameters Optimization

Dynamic tire forces are the main factor affecting the measurement accuracy of the axle weight of moving vehicle.This paper presents a novel method to reduce the influence of the dynamic tire forces on the weighing accuracy.On the basis of analyzing the characteristic of the dynamic tire forces,the objective optimization equation is constructed.The optimization algorithm is presented to get the optimal estimations of the objective parameters.According to the estimations of the parameters,the dynamic tire forces are separated from the axle weigh signal.The results of simulation and field experiments prove the effectiveness of the proposed method.

Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm

The permanent magnet eddy current coupler(PMEC)solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems.It provides torque to the load and generates heat and losses,reducing its energy transfer efficiency.This issue has become an obstacle for PMEC to develop toward a higher power.This paper aims to improve the overall performance of PMEC through multi-objective optimization methods.Firstly,a PMEC modeling method based on the Levenberg-Marquardt back propagation(LMBP)neural network is proposed,aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC.Then,a novel competition mechanism-based multi-objective particle swarm optimization algorithm(NCMOPSO)is proposed to find the optimal structural parameters of PMEC.Chaotic search and mutation strategies are used to improve the original algorithm,which improves the shortcomings of multi-objective particle swarm optimization(MOPSO),which is too fast to converge into a global optimum,and balances the convergence and diversity of the algorithm.In order to verify the superiority and applicability of the proposed algorithm,it is compared with several popular multi-objective optimization algorithms.Applying them to the optimization model of PMEC,the results show that the proposed algorithm has better comprehensive performance.Finally,a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results.Compared with the prototype,the optimized PMEC has reduced eddy current losses by 1.7812 kW,increased output torque by 658.5 N·m,and decreased costs by 13%,improving energy transfer efficiency.

Optimized CUDA Implementation to Improve the Performance of Bundle Adjustment Algorithm on GPUs

The 3D reconstruction pipeline uses the Bundle Adjustment algorithm to refine the camera and point parameters. The Bundle Adjustment algorithm is a compute-intensive algorithm, and many researchers have improved its performance by implementing the algorithm on GPUs. In the previous research work, “Improving Accuracy and Computational Burden of Bundle Adjustment Algorithm using GPUs,” the authors demonstrated first the Bundle Adjustment algorithmic performance improvement by reducing the mean square error using an additional radial distorting parameter and explicitly computed analytical derivatives and reducing the computational burden of the Bundle Adjustment algorithm using GPUs. The naïve implementation of the CUDA code, a speedup of 10× for the largest dataset of 13,678 cameras, 4,455,747 points, and 28,975,571 projections was achieved. In this paper, we present the optimization of the Bundle Adjustment algorithm CUDA code on GPUs to achieve higher speedup. We propose a new data memory layout for the parameters in the Bundle Adjustment algorithm, resulting in contiguous memory access. We demonstrate that it improves the memory throughput on the GPUs, thereby improving the overall performance. We also demonstrate an increase in the computational throughput of the algorithm by optimizing the CUDA kernels to utilize the GPU resources effectively. A comparative performance study of explicitly computing an algorithm parameter versus using the Jacobians instead is presented. In the previous work, the Bundle Adjustment algorithm failed to converge for certain datasets due to several block matrices of the cameras in the augmented normal equation, resulting in rank-deficient matrices. In this work, we identify the cameras that cause rank-deficient matrices and preprocess the datasets to ensure the convergence of the BA algorithm. Our optimized CUDA implementation achieves convergence of the Bundle Adjustment algorithm in around 22 seconds for the largest dataset compared to 654 seconds for the sequential implementation, resulting in a speedup of 30×. Our optimized CUDA implementation presented in this paper has achieved a 3× speedup for the largest dataset compared to the previous naïve CUDA implementation.

基于RIME-IAOA的混合模型短期光伏功率预测

光伏发电在如今的新能源发展中逐渐成为重点,其中光伏功率预测成为研究的主要方向.为了提升光伏功率预测的精度和效率,提出了RIME-VMD-IAOA-LSTM模型.该模型通过霜冰优化算法(RIME)优化变分模态分解(VMD)的参数来提升分解效率;引入余弦控制因子的动态边界策略来控制算数优化算法(AOA)数值的增长速率从而提升算法的精度和稳定性;利用自适应T分布变异策略来改进AOA的局部搜索能力和全局开发能力,更好地避免局部最优解.两种智能优化算法的加入使得整体模型的预测效率和速度都有很大提升,实验结果表明组合模型RIMEVMD-IAOA-LSTM相比于其他预测模型有较高的光伏功率预测精度.

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.

基于WLS-AUKF混合算法的主动配电网联合状态估计

响应负载和分布式能源的随机性和波动性、相量测量单元(Phasor Measurement Unit,PMU)配置的经济性需求对配电网状态估计提出了更高要求。文中提出了考虑PMU配置优化的加权最小二乘法(Weighted Least Squares,WLS)-自适应无迹卡尔曼滤波(Adaptive Untraced Kalman Filtering,AUKF)的主动配电网联合状态估计。通过改进粒子群优化算法(Metropolis-Hastings Crossover Particle Swarm Optimization,MHCPSO)实现PMU优化配置,再结合WLS和AUKF提出联合状态估计。联合方式是WLS为AUKF馈送稳健的量测数据,AUKF为WLS提供先验预测值并补充量测冗余。仿真结果表明,在相同PMU数量下,MHCPSO算法比遗传粒子群算法(Genetic Algorithm Particle Swarm Optimization,GAPSO)估计精度更高。在相同状态估计误差情况下,MHCPSO算法配置的PMU数量比GAPSO算法可最多减少4个。在光伏(Photovoltaic,PV)/电动汽车(Electric Vehicles,EV)并网无序充放电和某一时刻负荷突变情况下,WLS-AUKF算法均体现出了比UKF(Untraced Kalman Filtering)算法更好的估计性能。在PMU配置优化、PV/VE并网以及负荷突变3个场景中体现出了WLS-AUKF状态估计的高精度、经济性、抗差性和稳健性。

Target maneuver trajectory prediction based on RBF neural network optimized by hybrid algorithm

Target maneuver trajectory prediction plays an important role in air combat situation awareness and threat assessment.To solve the problem of low prediction accuracy of the traditional prediction method and model,a target maneuver trajectory prediction model based on phase space reconstruction-radial basis function(PSR-RBF)neural network is established by combining the characteristics of trajectory with time continuity.In order to further improve the prediction performance of the model,the rival penalized competitive learning(RPCL)algorithm is introduced to determine the structure of RBF,the Levenberg-Marquardt(LM)and the hybrid algorithm of the improved particle swarm optimization(IPSO)algorithm and the k-means are introduced to optimize the parameter of RBF,and a PSR-RBF neural network is constructed.An independent method of 3D coordinates of the target maneuver trajectory is proposed,and the target manuver trajectory sample data is constructed by using the training data selected in the air combat maneuver instrument(ACMI),and the maneuver trajectory prediction model based on the PSR-RBF neural network is established.In order to verify the precision and real-time performance of the trajectory prediction model,the simulation experiment of target maneuver trajectory is performed.The results show that the prediction performance of the independent method is better,and the accuracy of the PSR-RBF prediction model proposed is better.The prediction confirms the effectiveness and applicability of the proposed method and model.

NEW DEMODULATION TECHNOLOGY OF OPTIMIZING ENERGY OPERATOR AND APPLICATION TO GEAR FAULT DIAGNOSIS

Although many methods have been applied to diagnose the gear thult currently, the sensitivity of them is not very good. In order to make the diagnosis methods have more excellent integrated ability in such aspects as precision, sensitivity, reliability and compact algorithm, and so on, and enlightened by the energy operator separation algorithm （EOSA）, a new demodulation method which is optimizing energy operator separation algorithm （OEOSA） is presented. In the algorithm, the non-linear differential operator is utilized to its differential equation： Choosing the unit impulse response length of filter and fixing the weighting coefficient for inportant points. The method has been applied in diagnosing tooth broden and fatiguing crack of gear faults successfully. It provides demodulation analysis of machine signal with a new approach.

An Optimal Inequality for One-Parameter Mean

In the present paper, we answer the question: for 0 what are the greatest value p(a) and the least value q(a) such that the inequality. For more information about abstract,please download the PDF file.