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.

An Algorithm for Short-Circuit Current Interval in Distribution Networks with Inverter Type Distributed Generation Based on Affine Arithmetic

During faults in a distribution network,the output power of a distributed generation(DG)may be uncertain.Moreover,the output currents of distributed power sources are also affected by the output power,resulting in uncertainties in the calculation of the short-circuit current at the time of a fault.Additionally,the impacts of such uncertainties around short-circuit currents will increase with the increase of distributed power sources.Thus,it is very important to develop a method for calculating the short-circuit current while considering the uncertainties in a distribution network.In this study,an affine arithmetic algorithm for calculating short-circuit current intervals in distribution networks with distributed power sources while considering power fluctuations is presented.The proposed algorithm includes two stages.In the first stage,normal operations are considered to establish a conservative interval affine optimization model of injection currents in distributed power sources.Constrained by the fluctuation range of distributed generation power at the moment of fault occurrence,the model can then be used to solve for the fluctuation range of injected current amplitudes in distributed power sources.The second stage is implemented after a malfunction occurs.In this stage,an affine optimization model is first established.This model is developed to characterizes the short-circuit current interval of a transmission line,and is constrained by the fluctuation range of the injected current amplitude of DG during normal operations.Finally,the range of the short-circuit current amplitudes of distribution network lines after a short-circuit fault occurs is predicted.The algorithm proposed in this article obtains an interval range containing accurate results through interval operation.Compared with traditional point value calculation methods,interval calculation methods can provide more reliable analysis and calculation results.The range of short-circuit current amplitude obtained by this algorithm is slightly larger than those obtained using the Monte Carlo algorithm and the Latin hypercube sampling algorithm.Therefore,the proposed algorithm has good suitability and does not require iterative calculations,resulting in a significant improvement in computational speed compared to the Monte Carlo algorithm and the Latin hypercube sampling algorithm.Furthermore,the proposed algorithm can provide more reliable analysis and calculation results,improving the safety and stability of power systems.

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.

Probability Distribution of Arithmetic Average of China Aviation Network Edge Vertices Nearest Neighbor Average Degree Value and Its Evolutionary Trace Based on Complex Network

In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average degree values of China aviation network were studied based on the statistics data of China civil aviation network in 1988,1994,2001,2008 and 2015.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network.Based on the statistical data,the arithmetic averages of edge vertices nearest neighbor average degree values of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Using the probability statistical analysis method,it was found that the arithmetic average of edge vertices nearest neighbor average degree values had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.

On the Equality of Weighted BajratarevićMeans to Quasi-Arithmetic Means

In this paper, we considered the equality problem of weighted Bajraktarević means with weighted quasi-arithmetic means. Using the method of substituting for functions, we first transform the equality problem into solving an equivalent functional equation. We obtain the necessary and sufficient conditions for the equality equation.

Solving Arithmetic Word Problems of Entailing Deep Implicit Relations by Qualia Syntax-Semantic Model

Solving arithmetic word problems that entail deep implicit relations is still a challenging problem.However,significant progress has been made in solving Arithmetic Word Problems(AWP)over the past six decades.This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations(DIR-AWP),such as entailing commonsense or subject-domain knowledge involved in the problem-solving process.This paper proposes to take three steps to solve DIR-AWPs,in which the first three steps are used to conduct the qualia inference process.The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic(S2)method from the given problem.The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models,respectively.The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations.The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities.The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.

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.

Fin Field Effect Transistor with Active 4-Bit Arithmetic Operations in 22 nm Technology

A design of a high-speed multi-core processor with compact size is a trending approach in the Integrated Circuits(ICs)fabrication industries.Because whenever device size comes down into narrow,designers facing many power den-sity issues should be reduced by scaling threshold voltage and supply voltage.Initially,Complementary Metal Oxide Semiconductor(CMOS)technology sup-ports power saving up to 32 nm gate length,but further scaling causes short severe channel effects such as threshold voltage swing,mobility degradation,and more leakage power(less than 32)at gate length.Hence,it directly affects the arithmetic logic unit(ALU),which suffers a significant power density of the scaled multi-core architecture.Therefore,it losses reliability features to get overheating and increased temperature.This paper presents a novel power mini-mization technique for active 4-bit ALU operations using Fin Field Effect Tran-sistor(FinFET)at 22 nm technology.Based on this,a diode is directly connected to the load transistor,and it is active only at the saturation region as a function.Thereby,the access transistor can cutoff of the leakage current,and sleep transis-tors control theflow of leakage current corresponding to each instant ALU opera-tion.The combination of transistors(access and sleep)reduces the leakage current from micro to nano-ampere.Further,the power minimization is achieved by con-necting the number of transistors(6T and 10T)of the FinFET structure to ALU with 22 nm technology.For simulation concerns,a Tanner(T-Spice)with 22 nm technology implements the proposed design,which reduces threshold vol-tage swing,supply power,leakage current,gate length delay,etc.As a result,it is quite suitable for the ALU architecture of a high-speed multi-core processor.

Arithmetic Operations of Generalized Trapezoidal Picture Fuzzy Numbers by Vertex Method

In this article, we define the arithmetic operations of generalized trapezoidal picture fuzzy numbers by vertex method which is assembled on a combination of the (α, γ, β)-cut concept and standard interval analysis. Various related properties are explored. Finally, some computations of picture fuzzy functions over generalized picture fuzzy variables are illustrated by using our proposed technique.

阻尼改进抗差L-M匹配下全景图像拼接平滑优化

为了解决大面积视觉全景图像受拼接缝影响,拼接平滑面积较小的问题,提出阻尼改进抗差L-M匹配下全景图像拼接平滑优化方法。阻尼因子改进抗差L-M算法,计算抗差L-M迭代向量;利用改进抗差L-M算法,融合球面投影理论,对特征匹配误差目标函数进行优化。融合拉普拉斯算法和高斯滤波金字塔对图像进行分解重构,确定图像拼接缝重叠区域后完成全景图像拼接平滑优化。实验结果表明,所提方法的拼接缝平滑面积能够达到95.8%,解决了拼接平滑面积较小的问题。

Calculation connectivity reliability of road networks based on recursive decomposition arithmetic

In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.

On the Extension of Goldbach-Vinogradov's Theorem in Arithmetical Progressions(续)

设ｋ，ｌ１，ｌ２，ｌ３是适合ｋ≥１，（ｌｊ，ｋ）＝１，１≤ｊ≤３的整数．Ｎ是满足同余条件Ｎ≡ｌ１＋ｌ２＋ｌ３（ｍｏｄｋ）的大奇数。则存在实效可计算常数０＜θ＜１使得对任何整数ｋ≤Ｎθ，方程Ｎ＝ｐ１＋ｐ２＋ｐ３对于素变数ｐｊ＝ｌｊ（ｍｏｄｋ）。

Cryptanalysis of a chaos-based cryptosystem with an embedded adaptive arithmetic coder

In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure.

Interval arithmetic operations for uncertainty analysis with correlated interval variables

A new interval arithmetic method is proposed to solve interval functions with correlated intervals through which the overestimation problem existing in interval analysis could be significantly alleviated. The correlation between interval parameters is defined by the multidimensional parallelepiped model which is convenient to describe the correlative and independent interval variables in a unified framework. The original interval variables with correlation are transformed into the standard space without correlation,and then the relationship between the original variables and the standard interval variables is obtained. The expressions of four basic interval arithmetic operations, namely addition, subtraction, multiplication, and division, are given in the standard space. Finally, several numerical examples and a two-step bar are used to demonstrate the effectiveness of the proposed method.

Vertical 2D Modeling of Free Surface Flow with Hydrodynamic Pressure Using SIMPLE Arithmetic in σ Coordinates

A numerical model for shallow water flow has been developed based on the unsteady Reynolds-averaged Navier-Stokes equations with the hydrodynamic pressure instead of hydrostatic pressure assumption. The equations are transformed into the σ-coordinate system and the eddy viscosity is calculated with the standard k-ε turbulence model. The control volume method is used to discrete the equations, and the boundary conditions at the bed for shallow water models only include vertical diffusion terms expressed with wall functions. And the semi-implicit method for pressure linked equation arithmetic is adopted to solve the equations. The model is applied to the 2D vertical plane flow of a current over two steep-sided trenches for which experiment data are available for comparison and good agreement is obtained. And the model is used to predicting the flow in a channel with a steep-sided submerged breakwater at the bottom, and the streamline is drawn.

Reversible Natural Language Watermarking Using Synonym Substitution and Arithmetic Coding

For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution operations.By analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary sequence.The quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional data.Then,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible manner.On the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original synonyms.Experimental results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original text.Additionally,it achieves a high embedding capacity.

On the Distribution of Values of Euler＇s Function over Integers in Arithmetic Progressions

Let φ(n) denote the Euler-totient function, we study the distribution of solutions of φ(n) ≤ x in arithmetic progressions, where n ≡ l(mod q) and an asymptotic formula was obtained by Perron formula.

ON POINTS CONTAIN ARITHMETIC PROGRESSIONS IN THEIR LROTH EXPANSION

For any x ∈ （0, 1] （except at most countably many points）, there exists a unique sequence {dn（x）}n≥1 of integers, called the digit sequence of x, such that x =∞ ∑j=1 1/d1（x）（d1（x）-1）……dj-1（x）（dj-1（x）-1）dj（x）. The dexter infinite series expansion is called the Liiroth expansion of x. This paper is con- cerned with the size of the set of points x whose digit sequence in its Liiroth expansion is strictly increasing and contains arbitrarily long arithmetic progressions with arbitrary com- mon difference. More precisely, we determine the Hausdorff dimension of the above set.

An Adaptive Joint Source/Channel Coding Using Error Correcting Arithmetic Codes

An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.