Optimized multi-head self-attention and gated-dilated convolutional neural network for quantum key distribution and error rate reduction.

Quantum key distribution (QKD) is a secure communication method that enables two parties to securely exchange a secret key. The secure key rate is a crucial metric for assessing the efficiency and practical viability of a QKD system. There are several approaches that are utilized in practice to calculate the secure key rate. In this manuscript, QKD and error rate optimization based on optimized multi-head self-attention and gated-dilated convolutional neural network (QKD-ERO-MSGCNN) is proposed. Initially, the input signals are gathered from 6G wireless networks which face obstacles to channel. For extending maximum transmission distances and improving secret key rates, the signals are fed to the variable velocity strategy particle swarm optimization algorithm, then the signals are fed to MSGCNN for analysing the quantum bit error rate reduction. The MSGCNN is optimized by intensified sand cat swarm optimization. The performance of the QKD-ERO-MSGCNN approach attains 15.57%, 23.89%, and 31.75% higher accuracy when analysed with existing techniques, like device-independent QKD utilizing random quantum states, practical continuous-variable QKD and feasible optimization parameters, entanglement and teleportation in QKD for secure wireless systems, and QKD for large scale networks methods, respectively.

Estimating maize evapotranspiration based on hybrid back-propagation neural network models and meteorological, soil, and crop data.

Crop evapotranspiration is a key parameter influencing water-saving irrigation and water resources management of agriculture. However, current models for estimating maize evapotranspiration primarily rely on meteorological data and empirical coefficients, and the estimated evapotranspiration contains uncertainties. In this study, the evapotranspiration data of summer maize were collected from typical stations in Northern China (Yucheng Station), and a back-propagation neural network (BP) model for predicting maize evapotranspiration was constructed based on meteorological data, soil data, and crop data. To further improve its accuracy, the maize evapotranspiration model was optimized using three bionic optimization algorithms, namely the sand cat swarm optimization (SCSO) algorithms, hunter-prey optimizer (HPO) algorithm, and golden jackal optimization (GJO) algorithm. The results showed that the fusion of meteorological, soil moisture, and crop data can effectively improve the accuracy of the maize evapotranspiration model. The model showed higher accuracy with the hybrid optimization model SCSO-BP compared to the stand-alone BP neural network model, with improvements of 2.7-4.8%, 17.2-25.5%, 13.9-26.8%, and 3.3-5.6% in terms of R2, RMSE, MAE, and NSE, respectively. Comprehensively compared with existing maize evapotranspiration models, the SCSO-BP model presented the highest accuracy, with R2 = 0.842, RMSE = 0.433 mm/day, MAE = 0.316 mm/day, NSE = 0.840, and overall global evaluation index (GPI) ranking the first. The results have reference value for the calculation of daily evapotranspiration of maize in similar areas of northern China.

An improved sand cat swarm optimization with lens opposition-based learning and sparrow search algorithm.

The sand cat swarm optimization (SCSO) is a recently proposed meta-heuristic algorithm. It inspires hunting behavior with sand cats based on hearing ability. However, in the later stage of SCSO, it is easy to fall into local optimality and cannot find a better position. In order to improve the search ability of SCSO and avoid falling into local optimal, an improved algorithm is proposed - Improved sand cat swarm optimization based on lens opposition-based learning and sparrow search algorithm (LSSCSO). A dynamic spiral search is introduced in the exploitation stage to make the algorithm search for better positions in the search space and improve the convergence accuracy of the algorithm. The lens opposition-based learning and the sparrow search algorithm are introduced in the later stages of the algorithm to make the algorithm jump out of the local optimum and improve the global search capability of the algorithm. To verify the effectiveness of LSSCSO in solving global optimization problems, CEC2005 and CEC2022 test functions are used to test the optimization performance of LSSCSO in different dimensions. The data results, convergence curve and Wilcoxon rank sum test are analyzed, and the results show that it has a strong optimization ability and can reach the optimal in most cases. Finally, LSSCSO is used to verify the effectiveness of the algorithm in solving engineering optimization problems.

Sand cat swarm optimization algorithm and its application integrating elite decentralization and crossbar strategy.

Sand cat swarm optimization algorithm is a meta-heuristic algorithm created to replicate the hunting behavior observed by sand cats. The presented sand cat swarm optimization method (CWXSCSO) addresses the issues of low convergence precision and local optimality in the standard sand cat swarm optimization algorithm. It accomplished this through the utilization of elite decentralization and a crossbar approach. To begin with, a novel dynamic exponential factor is introduced. Furthermore, throughout the developmental phase, the approach of elite decentralization is incorporated to augment the capacity to transcend the confines of the local optimal. Ultimately, the crossover technique is employed to produce novel solutions and augment the algorithm's capacity to emerge from local space. The techniques were evaluated by performing a comparison with 15 benchmark functions. The CWXSCSO algorithm was compared with six advanced upgraded algorithms using CEC2019 and CEC2021. Statistical analysis, convergence analysis, and complexity analysis use statistics for assessing it. The CWXSCSO is employed to verify its efficacy in solving engineering difficulties by handling six traditional engineering optimization problems. The results demonstrate that the upgraded sand cat swarm optimization algorithm exhibits higher global optimization capability and demonstrates proficiency in dealing with real-world optimization applications.

Improved Multi-Strategy Sand Cat Swarm Optimization for Solving Global Optimization.

The sand cat swarm optimization algorithm (SCSO) is a novel metaheuristic algorithm that has been proposed in recent years. The algorithm optimizes the search ability of individuals by mimicking the hunting behavior of sand cat groups in nature, thereby achieving robust optimization performance. It is characterized by few control parameters and simple operation. However, due to the lack of population diversity, SCSO is less efficient in solving complex problems and is prone to fall into local optimization. To address these shortcomings and refine the algorithm's efficacy, an improved multi-strategy sand cat optimization algorithm (IMSCSO) is proposed in this paper. In IMSCSO, a roulette fitness-distance balancing strategy is used to select codes to replace random agents in the exploration phase and enhance the convergence performance of the algorithm. To bolster population diversity, a novel population perturbation strategy is introduced, aiming to facilitate the algorithm's escape from local optima. Finally, a best-worst perturbation strategy is developed. The approach not only maintains diversity throughout the optimization process but also enhances the algorithm's exploitation capabilities. To evaluate the performance of the proposed IMSCSO, we conducted experiments in the CEC 2017 test suite and compared IMSCSO with seven other algorithms. The results show that the IMSCSO proposed in this paper has better optimization performance.

Binary Sand Cat Swarm Optimization Algorithm for Wrapper Feature Selection on Biological Data.

In large datasets, irrelevant, redundant, and noisy attributes are often present. These attributes can have a negative impact on the classification model accuracy. Therefore, feature selection is an effective pre-processing step intended to enhance the classification performance by choosing a small number of relevant or significant features. It is important to note that due to the NP-hard characteristics of feature selection, the search agent can become trapped in the local optima, which is extremely costly in terms of time and complexity. To solve these problems, an efficient and effective global search method is needed. Sand cat swarm optimization (SCSO) is a newly introduced metaheuristic algorithm that solves global optimization algorithms. Nevertheless, the SCSO algorithm is recommended for continuous problems. bSCSO is a binary version of the SCSO algorithm proposed here for the analysis and solution of discrete problems such as wrapper feature selection in biological data. It was evaluated on ten well-known biological datasets to determine the effectiveness of the bSCSO algorithm. Moreover, the proposed algorithm was compared to four recent binary optimization algorithms to determine which algorithm had better efficiency. A number of findings demonstrated the superiority of the proposed approach both in terms of high prediction accuracy and small feature sizes.

An Efficient Binary Sand Cat Swarm Optimization for Feature Selection in High-Dimensional Biomedical Data.

Recent breakthroughs are making a significant contribution to big data in biomedicine which are anticipated to assist in disease diagnosis and patient care management. To obtain relevant information from this data, effective administration and analysis are required. One of the major challenges associated with biomedical data analysis is the so-called "curse of dimensionality". For this issue, a new version of Binary Sand Cat Swarm Optimization (called PILC-BSCSO), incorporating a pinhole-imaging-based learning strategy and crossover operator, is presented for selecting the most informative features. First, the crossover operator is used to strengthen the search capability of BSCSO. Second, the pinhole-imaging learning strategy is utilized to effectively increase exploration capacity while avoiding premature convergence. The Support Vector Machine (SVM) classifier with a linear kernel is used to assess classification accuracy. The experimental results show that the PILC-BSCSO algorithm beats 11 cutting-edge techniques in terms of classification accuracy and the number of selected features using three public medical datasets. Moreover, PILC-BSCSO achieves a classification accuracy of 100% for colon cancer, which is difficult to classify accurately, based on just 10 genes. A real Liver Hepatocellular Carcinoma (TCGA-HCC) data set was also used to further evaluate the effectiveness of the PILC-BSCSO approach. PILC-BSCSO identifies a subset of five marker genes, including prognostic biomarkers HMMR, CHST4, and COL15A1, that have excellent predictive potential for liver cancer using TCGA data.

Sand cat swarm optimization-based feedback controller design for nonlinear systems.

The control of the open loop unstable systems with nonlinear structure is challenging work. In this paper, for the first time, we present a sand cat swarm optimization (SCSO) algorithm-based state feedback controller design for open-loop unstable systems. The SCSO algorithm is a newly proposed metaheuristic algorithm with an easy-to-implement structure that can efficiently find the optimal solution for optimization problems. The proposed SCSO-based state feedback controller can successfully optimize the control parameters with efficient convergence curve speed. In order to show the performance of the proposed method, three different nonlinear control systems such as an Inverted pendulum, a Furuta pendulum, and an Acrobat robot arm are considered. The control and optimization performances of the proposed SCSO algorithm are compared with well-known metaheuristic algorithms. The simulation results show that the proposed control method can either outperform the compared metaheuristic-based algorithms or have competitive results.

Multi-Strategy Improved Sand Cat Swarm Optimization: Global Optimization and Feature Selection.

The sand cat is a creature suitable for living in the desert. Sand cat swarm optimization (SCSO) is a biomimetic swarm intelligence algorithm, which inspired by the lifestyle of the sand cat. Although the SCSO has achieved good optimization results, it still has drawbacks, such as being prone to falling into local optima, low search efficiency, and limited optimization accuracy due to limitations in some innate biological conditions. To address the corresponding shortcomings, this paper proposes three improved strategies: a novel opposition-based learning strategy, a novel exploration mechanism, and a biological elimination update mechanism. Based on the original SCSO, a multi-strategy improved sand cat swarm optimization (MSCSO) is proposed. To verify the effectiveness of the proposed algorithm, the MSCSO algorithm is applied to two types of problems: global optimization and feature selection. The global optimization includes twenty non-fixed dimensional functions (Dim = 30, 100, and 500) and ten fixed dimensional functions, while feature selection comprises 24 datasets. By analyzing and comparing the mathematical and statistical results from multiple perspectives with several state-of-the-art (SOTA) algorithms, the results show that the proposed MSCSO algorithm has good optimization ability and can adapt to a wide range of optimization problems.

An Adaptive Sand Cat Swarm Algorithm Based on Cauchy Mutation and Optimal Neighborhood Disturbance Strategy.

Sand cat swarm optimization algorithm (SCSO) keeps a potent and straightforward meta-heuristic algorithm derived from the distant sense of hearing of sand cats, which shows excellent performance in some large-scale optimization problems. However, the SCSO still has several disadvantages, including sluggish convergence, lower convergence precision, and the tendency to be trapped in the topical optimum. To escape these demerits, an adaptive sand cat swarm optimization algorithm based on Cauchy mutation and optimal neighborhood disturbance strategy (COSCSO) are provided in this study. First and foremost, the introduction of a nonlinear adaptive parameter in favor of scaling up the global search helps to retrieve the global optimum from a colossal search space, preventing it from being caught in a topical optimum. Secondly, the Cauchy mutation operator perturbs the search step, accelerating the convergence speed and improving the search efficiency. Finally, the optimal neighborhood disturbance strategy diversifies the population, broadens the search space, and enhances exploitation. To reveal the performance of COSCSO, it was compared with alternative algorithms in the CEC2017 and CEC2020 competition suites. Furthermore, COSCSO is further deployed to solve six engineering optimization problems. The experimental results reveal that the COSCSO is strongly competitive and capable of being deployed to solve some practical problems.