New Antenna Array Beamforming Techniques Based on Hybrid Convolution/Genetic Algorithm for 5G and Beyond Communications

Side lobe level reduction(SLL)of antenna arrays significantly enhances the signal-to-interference ratio and improves the quality of service(QOS)in recent and future wireless communication systems starting from 5G up to 7G.Furthermore,it improves the array gain and directivity,increasing the detection range and angular resolution of radar systems.This study proposes two highly efficient SLL reduction techniques.These techniques are based on the hybridization between either the single convolution or the double convolution algorithms and the genetic algorithm(GA)to develop the Conv/GA andDConv/GA,respectively.The convolution process determines the element’s excitations while the GA optimizes the element spacing.For M elements linear antenna array(LAA),the convolution of the excitation coefficients vector by itself provides a new vector of excitations of length N=(2M−1).This new vector is divided into three different sets of excitations including the odd excitations,even excitations,and middle excitations of lengths M,M−1,andM,respectively.When the same element spacing as the original LAA is used,it is noticed that the odd and even excitations provide a much lower SLL than that of the LAA but with amuch wider half-power beamwidth(HPBW).While the middle excitations give the same HPBWas the original LAA with a relatively higher SLL.Tomitigate the increased HPBWof the odd and even excitations,the element spacing is optimized using the GA.Thereby,the synthesized arrays have the same HPBW as the original LAA with a two-fold reduction in the SLL.Furthermore,for extreme SLL reduction,the DConv/GA is introduced.In this technique,the same procedure of the aforementioned Conv/GA technique is performed on the resultant even and odd excitation vectors.It provides a relatively wider HPBWthan the original LAA with about quad-fold reduction in the SLL.

NOVEL APPROACH TO LOCATOR LAYOUT OPTIMIZATION BASED ON GENETIC ALGORITHM

Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture design process. However, the design of a fixture relies heavily on the designerts expertise and experience up to now. Therefore, a new approach to loeator layout determination for workpieces with arbitrary complex surfaces is pro- posed for the first time. Firstly, based on the fuzzy judgment method, the proper locating reference and locator - numbers are determined with consideration of surface type, surface area and position tolerance. Secondly, the lo- cator positions are optimized by genetic algorithm（GA）. Finally, a typical example shows that the approach is su- perior to the experiential method and can improve positioning accuracy effectively.

PHUI-GA: GPU-based efficiency evolutionary algorithm for mining high utility itemsets

Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining performance,but they still require huge computational resource and may miss many HUIs.Due to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded processors.Experiments show that the mining performance of PHUI-GA outperforms the existing EAs.When mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach.

A New Image Watermarking Scheme Using Genetic Algorithm and Residual Numbers with Discrete Wavelet Transform

Transmission of data over the internet has become a critical issue as a result of the advancement in technology, since it is possible for pirates to steal the intellectual property of content owners. This paper presents a new digital watermarking scheme that combines some operators of the Genetic Algorithm (GA) and the Residue Number (RN) System (RNS) to perform encryption on an image, which is embedded into a cover image for the purposes of watermarking. Thus, an image watermarking scheme uses an encrypted image. The secret image is embedded in decomposed frames of the cover image achieved by applying a three-level Discrete Wavelet Transform (DWT). This is to ensure that the secret information is not exposed even when there is a successful attack on the cover information. Content creators can prove ownership of the multimedia content by unveiling the secret information in a court of law. The proposed scheme was tested with sample data using MATLAB2022 and the results of the simulation show a great deal of imperceptibility and robustness as compared to similar existing schemes.

Parameters selection in gene selection using Gaussian kernel support vector machines by genetic algorithm

In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.

FPGA PLACEMENT OPTIMIZATION BY TWO-STEP UNIFIED GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM

Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool.

An Effective Non-Commutative Encryption Approach with Optimized Genetic Algorithm for Ensuring Data Protection in Cloud Computing

Nowadays,succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers.Hence,to secure both data and keys ensuring secured data storage and access,our proposed work designs a Novel Quantum Key Distribution(QKD)relying upon a non-commutative encryption framework.It makes use of a Novel Quantum Key Distribution approach,which guarantees high level secured data transmission.Along with this,a shared secret is generated using Diffie Hellman(DH)to certify secured key generation at reduced time complexity.Moreover,a non-commutative approach is used,which effectively allows the users to store and access the encrypted data into the cloud server.Also,to prevent data loss or corruption caused by the insiders in the cloud,Optimized Genetic Algorithm(OGA)is utilized,which effectively recovers the data and retrieve it if the missed data without loss.It is then followed with the decryption process as if requested by the user.Thus our proposed framework ensures authentication and paves way for secure data access,with enhanced performance and reduced complexities experienced with the prior works.

Design of artificial neural networks using a genetic algorithm to predict saturates of vacuum gas oil

Accurate prediction of chemical composition of vacuum gas oil （VGO） is essential for the routine operation of refineries. In this work, a new approach for auto-design of artificial neural networks （ANN） based on a genetic algorithm （GA） is developed for predicting VGO saturates. The number of neurons in the hidden layer, the momentum and the learning rates are determined by using the genetic algorithm. The inputs for the artificial neural networks model are five physical properties, namely, average boiling point, density, molecular weight, viscosity and refractive index. It is verified that the genetic algorithm could find the optimal structural parameters and training parameters of ANN. In addition, an artificial neural networks model based on a genetic algorithm was tested and the results indicated that the VGO saturates can be efficiently predicted. Compared with conventional artificial neural networks models, this approach can improve the prediction accuracy.

Optimization of Fairhurst-Cook Model for 2-D Wing Cracks Using Ant Colony Optimization (ACO), Particle Swarm Intelligence (PSO), and Genetic Algorithm (GA)

The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.

Multiple-Objective Optimization and Design of Series-Parallel Systems Using Novel Hybrid Genetic Algorithm Meta-Heuristic Approach

In this study, we develop a new meta-heuristic-based approach to solve a multi-objective optimization problem, namely the reliability-redundancy allocation problem (RRAP). Further, we develop a new simulation process to generate practical tools for designing reliable series-parallel systems. Because the?RRAP is an NP-hard problem, conventional techniques or heuristics cannot be used to find the optimal solution. We propose a genetic algorithm (GA)-based hybrid meta-heuristic algorithm, namely the hybrid genetic algorithm (HGA), to find the optimal solution. A simulation process based on the HGA is developed to obtain different alternative solutions that are required to generate application tools for optimal design of reliable series-parallel systems. Finally, a practical case study regarding security control of a gas turbine in the overspeed state is presented to validate the proposed algorithm.

Reconstruction of the linac photon spectrum based on prior knowledge and the genetic algorithm

In order to derive the linac photon spectrum accurately both the prior constrained model and the genetic algorithm GA are employed using the measured percentage depth dose PDD data and the Monte Carlo simulated monoenergetic PDDs where two steps are involved.First the spectrum is modeled as a prior analytical function with two parameters αand Ep optimized with the GA.Secondly the linac photon spectrum is modeled as a discretization constrained model optimized with the GA. The solved analytical function in the first step is used to generate initial solutions for the GA’s first run in this step.The method is applied to the Varian iX linear accelerator to derive the energy spectra of its 6 and 15 MV photon beams.The experimental results show that both the reconstructed spectrums and the derived PDDs with the proposed method are in good agreement with those calculated using the Monte Carlo simulation.

基于SPA-GA-SVR模型的土壤水分及温度预测

土壤湿度和温度是影响水文循环和气候变化的重要参数,在农业实践活动和生态平衡中起着重要作用。为及时、准确地监测土壤含水量(Soil Moisture Content,SMC)及温度,提出了一种基于高光谱数据的预测方法。实验数据集来自为期5天的实地测量,所获得的高光谱数据包含大量的噪声及冗余信息,因此首先用Savitzky-Golay卷积平滑对光谱数据进行降噪处理,利用连续投影算法(Successive Projection Algorithm,SPA)提取数据特征波长,然后通过遗传算法(Genetic Algorithm,GA)对支持向量机回归(Support Vector Regression,SVR)的超参数权值和偏置进行优化,构建SPA-GASVR混合算法模型对土壤水分和温度进行预测,并与BP神经网络(Back Propagation Neural Network,BPNN)、SPA-BP、SVR、SPA-SVR、GA-SVR这5种模型的预测性能进行比较。实验结果表明:各模型在土壤湿度低于30%的情况下,表现出的预测能力差异并不显著。但整体上,复合模型相比于单一的神经网络或机器学习模型具有明显的优势,且经过连续投影算法优化的模型进一步的提高其预测能力,最终SPA-GA-SVR算法在各项指标上均优于其他模型,土壤水分预测模型的R^(2)=0.981、RMSE=0.473%,土壤温度预测模型R^(2)=0.963、RMSE=0.883℃。实验证明基于高光谱数据,经过SPA和GA优化的SVR模型能实现对土壤湿度和温度精准的预测。该方法具有一定的应用价值和现实意义,可应用于便携式高光谱仪和无人机上,实现对土壤水分和温度的实时监测,为今后的播种及灌溉提供理论参考。

基于GA-LSTM自适应卡尔曼滤波的路面不平度识别

准确、快速地识别出车辆当前行驶的路面激励信息,是实现智能底盘控制进而保证车辆平顺性的关键。针对传统路面不平度识别算法准确率低、自适应性差等问题,提出了基于遗传算法(genetic algorithm,GA)优化长短期记忆神经网络(long short-term memory networks,LSTM)自适应卡尔曼滤波的路面不平度识别算法。基于2自由度车辆悬架模型,通过灰色关联法选择LSTM神经网络的特征输入变量,并采用GA优化LSTM神经网络的模型参数以准确识别路面等级,并据此实时更新卡尔曼滤波器算法中的噪声矩阵,实现了在复杂路况下对路面不平度的自适应识别。仿真和试验研究表明,所提出的基于GA-LSTM自适应卡尔曼滤波算法能够快速准确的识别路面不平度与路面等级,与传统卡尔曼滤波算法相比,相关系数、均方根误差和最大绝对误差分别提高3.11%、37.5%和51.2%,表明所提算法对复杂工况具有很好的自适应能力。

基于GA的RBF神经网络气液两相流持液率预测模型优化

为了提高气液两相流持液率预测精度,针对传统径向基函数(RBF)神经网络预测气液两相流持液率网络拓扑结构困难和收敛速度慢等问题,提出一种基于遗传算法(GA)优化径向基函数神经网络的气液两相流持液率预测模型。通过系统聚类算法和灰色关联度分析(GRA)对收集的实验数据进行处理,优选出最优模型特征,同时结合遗传算法确定了RBF神经网络结构参数。基于室内实验数据进行训练,并与常用于持液率预测的反向传播(BP)神经网络、GA-BP神经网络及RBF神经网络进行对比,评估了模型的准确性及可行性。结果表明:GA-RBF神经网络模型均方误差为0.0017,均方根误差为0.0416,平均绝对误差为0.0281,拟合度为0.9483。相较于其他神经网络模型,该预测模型表现出更高的计算精度和更强的泛化能力。

基于GA-BP神经网络的大型客机气流角估计方法

为了解决硬件冗余难以克服的气流角传感器共因故障问题,进一步提高飞机气流角信号的可靠性,研究了基于GABP神经网络的气流角估计方法。通过BP神经网络融合姿态角、加速度、风速等参数来实现不依赖气流角传感器的气流角估计;引入遗传算法对神经网络权值和阈值进行全局优化,提高估计精度;对某大型客机的试飞数据预处理后用于模型的训练和测试。仿真结果表明,训练完成的GA-BP神经网络模型对气流角的估计值贴近实际值,稳定性和精度明显高于BP神经网络。上述方法给飞机增加一个余度的气流角信号,可用于传感器故障时为飞机提供可靠的气流角信号。

基于GA-BP神经网络的新疆南疆核桃树生长模型研究

文章提出了一种利用遗传算法优化BP神经网络的核桃树生长模型来预测核桃树的树高、胸径的方法,通过优化BP神经网络的权值和阈值建立GA-BP模型,与多元线性回归模型的预测结果进行比较。结果表明:采用遗传算法优化后的模型具有更高的预测精度,对核桃树生长预测具有指导意义。

基于GRA-GASA-SVM的煤层瓦斯含量预测方法研究

为提升煤层瓦斯含量预测精度,提出一种采用遗传模拟退火算法混合优化支持向量机(SVM)参数的瓦斯含量预测模型(GRA-GASA-SVM模型)。该模型将GA和SA整合为遗传模拟退火算法协同优化SVM的参数,以解决传统网格寻优算法取值范围无法确定和单一智能算法优化程度有限等问题。利用灰色关联分析(GRA)压缩数据集维度,建立瓦斯含量预测参数体系并作为GASA-SVM的输入数据集。结果表明:SVM模型、GA-SVM模型和GASA-SVM模型10折交叉验证瓦斯含量预测总平均相对误差分别为15.98%、13.55%和10.58%。相比SVM模型和GA-SVM模型,GASA-SVM模型预测稳定性更优、预测精准度更高且对新样本泛化能力更强。

RESEARCH ON THE MINIMUM ZONE CYLINDRICITY EVALUATION BASED ON GENETIC ALGORITHMS

A genetic algorithm (GA)-based method is proposed to solve the nonlinearoptimization problem of minimum zone cylindricity evaluation. First, the background of the problemis introduced. Then the mathematical model and the fitness function are derived from themathematical definition of dimensioning and tolerancing principles. Thirdly with the least squaressolution as the initial values, the whole implementation process of the algorithm is realized inwhich some key techniques, for example, variables representing, population initializing and suchbasic operations as selection, crossover and mutation, are discussed in detail. Finally, examplesare quoted to verify the proposed algorithm. The computation results indicate that the GA-basedoptimization method performs well on cylindricity evaluation. The outstanding advantages concludehigh accuracy, high efficiency and capabilities of solving complicated nonlinear and large spaceproblems.

Improved genetic algorithm for nonlinear programming problems

An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.