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.

Improved Ant Colony Algorithm for Vehicle Scheduling Problem in Airport Ground Service Support

Support vehicles are part of the main body of airport ground operations,and their scheduling efficiency directly impacts flight delays.A mathematical model is constructed and the responsiveness of support vehicles for current operational demands is proposed to study optimization algorithms for vehicle scheduling.The model is based on the constraint relationship of the initial operation time,time window,and gate position distribution,which gives an improvement to the ant colony algorithm(ACO).The impacts of the improved ACO as used for support vehicle optimization are compared and analyzed.The results show that the scheduling scheme of refueling trucks based on the improved ACO can reduce flight delays caused by refueling operations by 56.87%,indicating the improved ACO can improve support vehicle scheduling.Besides,the improved ACO can jump out of local optima,which can balance the working time of refueling trucks.This research optimizes the scheduling scheme of support vehicles under the existing conditions of airports,which has practical significance to fully utilize ground service resources,improve the efficiency of airport ground operations,and effectively reduce flight delays caused by ground service support.

Estimation of state of health based on charging characteristics and back-propagation neural networks with improved atom search optimization algorithm

With the rapid development of new energy technologies, lithium batteries are widely used in the field of energy storage systems and electric vehicles. The accurate prediction for the state of health(SOH) has an important role in maintaining a safe and stable operation of lithium-ion batteries. To address the problems of uncertain battery discharge conditions and low SOH estimation accuracy in practical applications, this paper proposes a SOH estimation method based on constant-current battery charging section characteristics with a back-propagation neural network with an improved atom search optimization algorithm. A temperature characteristic, equal-time temperature variation(Dt_DT), is proposed by analyzing the temperature data of the battery charging section with the incremental capacity(IC) characteristics obtained from an IC analysis as an input to the data-driven prediction model. Testing and analysis of the proposed prediction model are carried out using publicly available datasets. Experimental results show that the maximum error of SOH estimation results for the proposed method in this paper is below 1.5%.

THE RIEMANN PROBLEM WITH DELTA INITIAL DATA FOR THE NON-ISENTROPIC IMPROVED AW-RASCLE-ZHANG MODEL

In this paper,we study the Radon measure initial value problem for the nonisentropic improved Aw-Rascle-Zhang model.For arbitrary convex F(u)in this model we construct the Riemann solutions by elementary waves andδ-shock waves using the method of generalized characteristic analysis.We obtain the solutions constructively for initial data containing the Dirac measure by taking the limit of the solutions for that with three piecewise constants.Moreover,we analyze different kinds of wave interactions,including the interactions of theδ-shock waves with elementary waves.

Improved Ant Colony Optimization and Machine Learning Based Ensemble Intrusion Detection Model

Internet of things(IOT)possess cultural,commercial and social effect in life in the future.The nodes which are participating in IOT network are basi-cally attracted by the cyber-attack targets.Attack and identification of anomalies in IoT infrastructure is a growing problem in the IoT domain.Machine Learning Based Ensemble Intrusion Detection(MLEID)method is applied in order to resolve the drawback by minimizing malicious actions in related botnet attacks on Message Queue Telemetry Transport(MQTT)and Hyper-Text Transfer Proto-col(HTTP)protocols.The proposed work has two significant contributions which are a selection of features and detection of attacks.New features are chosen from Improved Ant Colony Optimization(IACO)in the feature selection,and then the detection of attacks is carried out based on a combination of their possible proper-ties.The IACO approach is focused on defining the attacker’s important features against HTTP and MQTT.In the IACO algorithm,the constant factor is calculated against HTTP and MQTT based on the mean function for each element.Attack detection,the performance of several machine learning models are Distance Deci-sion Tree(DDT),Adaptive Neuro-Fuzzy Inference System(ANFIS)and Mahala-nobis Distance Support Vector Machine(MDSVM)were compared with predicting accurate attacks on the IoT network.The outcomes of these classifiers are combined into the ensemble model.The proposed MLEID strategy has effec-tively established malicious incidents.The UNSW-NB15 dataset is used to test the MLEID technique using data from simulated IoT sensors.Besides,the pro-posed MLEID technique has a greater detection rate and an inferior rate of false-positive compared to other conventional techniques.

Research on AGV task path planning based on improved A^(*) algorithm

Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.

Improved AHP–TOPSIS model for the comprehensive risk evaluation of oil and gas pipelines

A comprehensive and objective risk evaluation model of oil and gas pipelines based on an improved analytic hierarchy process(AHP)and technique for order preference by similarity to an ideal solution(TOPSIS)is established to identify potential hazards in time.First,a barrier model and fault tree analysis are used to establish an index system for oil and gas pipeline risk evaluation on the basis of five important factors:corrosion,external interference,material/construction,natural disasters,and function and operation.Next,the index weight for oil and gas pipeline risk evaluation is computed by applying the improved AHP based on the five-scale method.Then,the TOPSIS of a multi-attribute decision-making theory is studied.The method for determining positive/negative ideal solutions and the normalized equation for benefit/cost indexes is improved to render TOPSIS applicable for the comprehensive risk evaluation of pipelines.The closeness coefficient of oil and gas pipelines is calculated by applying the improved TOPSIS.Finally,the weight and the closeness coefficient are combined to determine the risk level of pipelines.Empirical research using a long-distance pipeline as an example is conducted,and adjustment factors are used to verify the model.Results show that the risk evaluation model of oil and gas pipelines based on the improved AHP–TOPSIS is valuable and feasible.The model comprehensively considers the risk factors of oil and gas pipelines and provides comprehensive,rational,and scientific evaluation results.It represents a new decision-making method for systems engineering in pipeline enterprises and provides a comprehensive understanding of the safety status of oil and gas pipelines.The new system engineering decision-making method is important for preventing oil and gas pipeline accidents.

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

A Novel Improved Artificial Bee Colony and Blockchain-Based Secure Clustering Routing Scheme for FANET

Flying Ad hoc Network(FANET)has drawn significant consideration due to its rapid advancements and extensive use in civil applications.However,the characteristics of FANET including high mobility,limited resources,and distributed nature,have posed a new challenge to develop a secure and ef-ficient routing scheme for FANET.To overcome these challenges,this paper proposes a novel cluster based secure routing scheme,which aims to solve the routing and data security problem of FANET.In this scheme,the optimal cluster head selection is based on residual energy,online time,reputation,blockchain transactions,mobility,and connectivity by using Improved Artificial Bee Colony Optimization(IABC).The proposed IABC utilizes two different search equations for employee bee and onlooker bee to enhance convergence rate and exploitation abilities.Further,a lightweight blockchain consensus algorithm,AI-Proof of Witness Consensus Algorithm(AI-PoWCA)is proposed,which utilizes the optimal cluster head for mining.In AI-PoWCA,the concept of the witness for block verification is also involved to make the proposed scheme resource efficient and highly resilient against 51%attack.Simulation results demonstrate that the proposed scheme outperforms its counterparts and achieves up to 90%packet delivery ratio,lowest end-to-end delay,highest throughput,resilience against security attacks,and superior in block processing time.

Research on the Collision-Free Path Planning of Multi-AGVs System Based on Improved A* Algorithm

Path planning problem is the core and hot research topic of multiple Automatic Guided Vehicles (multi-AGVs) system. Although there are many research results, they do not solve the path planning problem from the perspective of reducing traffic congestion. A collision-free path planning method based on improved A* Algorithm for multi-AGVs logistics sorting system is proposed in this paper. In the method, the environment of warehouse operation for AGVs is described by using grid method. The estimated cost of A* algorithm is improved by adding the penalty value of the paths that AGVs share with each other to alleviate traffic congestion and collision resolution rules are made according to different types of collisions. Then the collision-free path planning is done by combing the improved A* algorithm and collision resolution rules. The sorting efficiency of the method is compared with that of original A* algorithm. Simulation results show that the new collision-free path planning method can improve the sorting efficiency of multi-AGVs system and relieve traffic congestion.

Method for Fault Feature Selection for a Baler Gearbox Based on an Improved Adaptive Genetic Algorithm

The performance and efficiency of a baler deteriorate as a result of gearbox failure.One way to overcome this challenge is to select appropriate fault feature parameters for fault diagnosis and monitoring gearboxes.This paper proposes a fault feature selection method using an improved adaptive genetic algorithm for a baler gearbox.This method directly obtains the minimum fault feature parameter set that is most sensitive to fault features through attribute reduction.The main benefit of the improved adaptive genetic algorithm is its excellent performance in terms of the efficiency of attribute reduction without requiring prior information.Therefore,this method should be capable of timely diagnosis and monitoring.Experimental validation was performed and promising findings highlighting the relationship between diagnosis results and faults were obtained.The results indicate that when using the improved genetic algorithm to reduce 12 fault characteristic parameters to three without a priori information,100%fault diagnosis accuracy can be achieved based on these fault characteristics and the time required for fault feature parameter selection using the improved genetic algorithm is reduced by half compared to traditional methods.The proposed method provides important insights into the instant fault diagnosis and fault monitoring of mechanical devices.

Time-optimal trajectory planning based on improved adaptive genetic algorithm

This paper investiga tes a trajectory planning algorithm to reduce the manipulator’s working time.A t ime-optimal trajectory planning(TOTP)is conducted based on improved ad aptive genetic algorithm(IAGA)and combined with cubic triangular Bezier spline(CTBS).The CTBS based trajectory planning we did before can achieve continuous second and third derivation,hence it meets the stability requirements of the m anipulator.The working time can be greatly reduced by applying IAGA to the puma 560 trajectory planning when considering physical constraints such as angular ve locity,angular acceleration and jerk.Simulation experiments in both Matlab and ADAMS illustrate that TOTP based on IAGA can give a time optimal result with sm oothness and stability.

Two-Dimension Path Planning Method Based on Improved Ant Colony Algorithm

Nowadays, path planning has become an important field of research focus. Considering that the ant colony algorithm has numerous advantages such as the distributed computing and the characteristics of heuristic search, how to combine the algorithm with two-dimension path planning effectively is much important. In this paper, an improved ant colony algorithm is used in resolving this path planning problem, which can improve convergence rate by using this improved algorithm. MAKLINK graph is adopted to establish the two-dimensional space model at first, after that the Dijkstra algorithm is selected as the initial planning algorithm to get an initial path, immediately following, optimizing the select parameters relating on the ant colony algorithm and its improved algorithm. After making the initial parameter, the authors plan out an optimal path from start to finish in a known environment through ant colony algorithm and its improved algorithm. Finally, Matlab is applied as software tool for coding and simulation validation. Numerical experiments show that the improved algorithm can play a more appropriate path planning than the origin algorithm in the completely observable.

Improved algorithm for solving nonlinear parabolized stability equations

Due to its high computational efficiency and ability to consider nonparallel and nonlinear effects, nonlinear parabolized stability equations（NPSE） approach has been widely used to study the stability and transition mechanisms. However,it often diverges in hypersonic boundary layers when the amplitude of disturbance reaches a certain level. In this study, an improved algorithm for solving NPSE is developed. In this algorithm, the mean flow distortion is included into the linear operator instead of into the nonlinear forcing terms in NPSE. An under-relaxation factor for computing the nonlinear terms is introduced during the iteration process to guarantee the robustness of the algorithm. Two case studies, the nonlinear development of stationary crossflow vortices and the fundamental resonance of the second mode disturbance in hypersonic boundary layers, are presented to validate the proposed algorithm for NPSE. Results from direct numerical simulation（DNS） are regarded as the baseline for comparison. Good agreement can be found between the proposed algorithm and DNS, which indicates the great potential of the proposed method on studying the crossflow and streamwise instability in hypersonic boundary layers.

Improved algorithm of atmospheric refraction error in Longley-Rice channel model

Longley-Rice channel model modifies the atmospheric refraction by the equivalent earth radius method, which is simple calculation but is not accurate. As it only uses the horizontal difference, but does not make use of the vertical section information, it does not agree with the actual propagation path. The atmospheric refraction error correction method of the Longley-Rice channel model has been improved. The improved method makes use of the vertical section information sufficiently and maps the distance between the receiver and transmitter to the radio wave propagation distance, It can exactly reflect the infection of propagation distance for the radio wave propagation loss. It is predicted to be more close to the experimental results by simulation in comparison with the measured data. The effectiveness of improved methods is proved by simulation.

An improved algorithm for weighting keywords in web documents

In this paper, an improved algorithm, web-based keyword weight algorithm （WKWA）, is presented to weight keywords in web documents. WKWA takes into account representation features of web documents and advantages of the TF＊IDF, TFC and ITC algorithms in order to make it more appropriate for web documents. Meanwhile, the presented algorithm is applied to improved vector space model （IVSM）. A real system has been implemented for calculating semantic similarities of web documents. Four experiments have been carried out. They are keyword weight calculation, feature item selection, semantic similarity calculation, and WKWA time performance. The results demonstrate accuracy of keyword weight, and semantic similarity is improved.

A Gender Analysis on the Participation and Choice of Improved and Local Haricot Bean (<i>Phaseolus vulgaris L</i>.) by Farmers in Cameroon

Men and women farmer participation and choice of variety could guide breeding and drive the adoption of different haricot bean varieties. Thus, understanding how gender influences participation and choice of bean cultivation and marketing is fundamental. The study sought to analyse how socio-cultural norms determine women and men, participation and choice of variety for cultivation and sale in Cameroon’s West region. A mixed-method was used in collecting data from men and women farmers in six subdivisions in the West region of Cameroon in 2019. Result reveals that women provide most of the labour on haricot bean production than men, who are more involved in selling to national and regional markets. Participation and role were driven by socio-cultural norms of what is expected of men and women in a society where women provide food and men income for household upkeep. Women preferred varieties that were less labour intensive and food taste for household consumption while men went for labour intensive as long as they were market-oriented and high yielding. Thus, breeders should develop varieties that are mostly preferred by women, which meet the market and household demand.

An improved algorithm for numerical calculation of seismic response spectra

The information of seismic response spectra is key to many problems concerned with aseismic structure and is also helpful for earthquake disaster relief if it is generated in time when earthquake happens. While current numerical calculation methods suffer from poor precision, especially in frequency band near Nyquist frequency, we present a set of improved parameters for precision improvement. It is shown that precision of displacement and velocity response spectra are both further improved compared to current numerical algorithms. A uniform fitting formula is given for computing these parameters for damping ratio range of 0.01-0.9, quite convenient for practical application.

Assessing Reactions of Genetically Improved and Local Cassava Varieties to Cassava Mosaic Disease (CMD) Infection in a Savannah Region of the DR-Congo

The responses of eight genetically improved and eight local cassava varieties to cassava mosaic disease (CMD) were evaluated under field conditions at two sites, in Eastern Kasa?, region of the DR-Congo). The varieties were planted using randomized complete block design with three replications. The rate of cuttings sprouted varied significantly from variety to variety and from location to location. Local varieties were severely infected than improved varieties throughout the trial period. In general, the level of CMD incidence for genetically improved varieties was below 15% while it reached 100% for the local cassava varieties six months after planting (MAP). This trend was also observed for the CMD severity and gravity. The mean scores for CMD severity were 2 and 3.6 for genetically improved and local varieties, respectively at 6 MAP. CMD gravity for improved varieties was below 21% for genetically improved varieties and exceeded 85% for local varieties at the end of trials. Area Under the Severity index Progress Curve (AUSiPC) and Area Under Disease Progress Curve (AUDPC) estimates confirmed that improved varieties were moderately infested comparatively to local varieties. Molecular analysis is being conducted to determine the genetic variability and complexity of the cassava mosaic virus strains involved.