Ability Of Algorithm Research Articles

Arctic puffin optimization: A bio-inspired metaheuristic algorithm for solving engineering design optimization

In this paper, we innovatively propose the Arctic Puffin Optimization (APO), a metaheuristic optimization algorithm inspired by the survival and predation behaviors of the Arctic puffin. The APO consists of an aerial flight (exploration) and an underwater foraging (exploitation) phase. In the exploration phase, the Levy flight and velocity factor mechanisms are introduced to enhance the algorithm's ability to jump out of local optima and improve the convergence speed. In the exploitation phase, strategies such as the synergy and adaptive change factors are used to ensure that the algorithm can effectively utilize the current best solution and guide the search direction. In addition, the dynamic transition between the exploration and development phases is realized through the behavioral conversion factor, which effectively balances global search and local development. In order to verify the advancement and applicability of the APO algorithm, it is compared with nine advanced optimization algorithms. In the three test sets of CEC2017, CEC2019, and CEC2022, the APO algorithm outperforms the other compared algorithms in 72%, 70%, and 75% of the cases, respectively. Meanwhile, the Wilcoxon signed-rank test results and Friedman rank-mean statistically prove the superiority of the APO algorithm. Furthermore, on thirteen real-world engineering problems, APO outperforms the other compared algorithms in 85% of the test cases, demonstrating its potential in solving complex real-world optimization problems. In summary, APO proves its practical value and advantages in solving various complex optimization problems by its excellent performance.

An Improved Multi-Strategy Crayfish Optimization Algorithm for Solving Numerical Optimization Problems.

The crayfish optimization algorithm (COA), proposed in 2023, is a metaheuristic optimization algorithm that is based on crayfish's summer escape behavior, competitive behavior, and foraging behavior. COA has a good optimization performance, but it still suffers from the problems of slow convergence speed and sensitivity to the local optimum. To solve these problems, an improved multi-strategy crayfish optimization algorithm for solving numerical optimization problems, called IMCOA, is proposed to address the shortcomings of the original crayfish optimization algorithm for each behavioral strategy. Aiming at the imbalance between local exploitation and global exploration in the summer heat avoidance and competition phases, this paper proposes a cave candidacy strategy and a fitness-distance balanced competition strategy, respectively, so that these two behaviors can better coordinate the global and local optimization capabilities and escape from falling into the local optimum prematurely. The directly foraging formula is modified during the foraging phase. The food covariance learning strategy is utilized to enhance the population diversity and improve the convergence accuracy and convergence speed. Finally, the introduction of an optimal non-monopoly search strategy to perturb the optimal solution for updates improves the algorithm's ability to obtain a global best solution. We evaluated the effectiveness of IMCOA using the CEC2017 and CEC2022 test suites and compared it with eight algorithms. Experiments were conducted using different dimensions of CEC2017 and CEC2022 by performing numerical analyses, convergence analyses, stability analyses, Wilcoxon rank-sum tests and Friedman tests. Experiments on the CEC2017 and CEC2022 test suites show that IMCOA can strike a good balance between exploration and exploitation and outperforms the traditional COA and other optimization algorithms in terms of its convergence speed, optimization accuracy, and ability to avoid premature convergence. Statistical analysis shows that there is a significant difference between the performance of the IMCOA algorithm and other algorithms. Additionally, three engineering design optimization problems confirm the practicality of IMCOA and its potential to solve real-world problems.

K-Mean Based Hyper-Metaheuristic Grey Wolf and Cuckoo Search Optimizers for Automatic MRI Medical Image Clustering

In this paper a new clustering algorithm is proposed for optimal clustering of MRI medical image. In our proposed algorithm, the clustering process implemented by K-means clustering algorithm, due to its simplicity and speed. The optimization process was done by a well-known metaheuristic algorithms Grey Wolf Optimizer (GWO) and Cuckoo Search Optimizer. GWO is a metaheuristic algorithm inspired by the social hierarchy and hunting behavior of grey wolves. It mimics the leadership hierarchy and hunting strategies of wolves to explore the search space efficiently. GWO has shown promising performance in finding high-quality solutions compared to other well-established optimizers. It explores the solution space to find better cluster assignments that minimize the overall intra-cluster variance. By leveraging the exploration potential of GWO, the proposed algorithm aims to improve the quality of the clustering results. Furthermore, the Cuckoo Search Optimizer (CS) is combined with GWO to enhance the algorithm's ability to find a global solution. Cuckoo Search is a metaheuristic algorithm inspired by the breeding behavior of cuckoo birds. It employs random search and Levy flights to diversify the search process and avoid getting trapped in local optima. By combining CS with GWO, the proposed algorithm aims to increase the likelihood of finding the optimal clustering solution.

Improved synergistic swarm optimization algorithm to optimize task scheduling problems in cloud computing

Cloud computing has emerged as a cornerstone technology for modern computational paradigms due to its scalability and flexibility. One critical aspect of cloud computing is efficient task scheduling, which directly impacts system performance and resource utilization. In this paper, we propose an enhanced optimization algorithm tailored for task scheduling in cloud environments. Building upon the foundation of the Jaya algorithm and Synergistic Swarm Optimization (SSO), our approach integrates a Levy flight mechanism to enhance exploration-exploitation trade-offs and improve convergence speed. The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. Moreover, the incorporation of Levy flights injects stochasticity into the search process, enabling the algorithm to escape local optima and navigate complex solution spaces more effectively. We evaluate the proposed algorithm against state-of-the-art approaches using benchmark task scheduling problems in cloud environments. Experimental results demonstrate the superiority of our method in terms of solution quality, convergence speed, and scalability. Overall, our proposed Improved Jaya Synergistic Swarm Optimization Algorithm offers a promising solution for optimizing TSCC (TSCC), contributing to enhanced resource utilization and system performance in cloud-based applications. The proposed method got 88 % accuracy overall and 10 % enhancement compared to the original method.

Application of multi-objective artificial gorilla troops optimization algorithm in intelligent evacuation path planning for building fires

In the event of a sudden incident in large buildings, optimizing personnel evacuation paths has a direct and significant impact on overall evacuation efficiency. To address personnel evacuation scenarios caused by building fires in complex environments, this study presents a path planning approach based on the Multi-Objective Gorilla Optimization (MIGTO) algorithm. The objective function comprises path risk, congestion cost, and path length. However, traditional GTO algorithms face limitations in addressing such problems, including slow convergence, premature convergence, and susceptibility to local optima. To address the aforementioned challenges, this study introduces variable updates to the spiral position during the algorithm development phase to improve search efficiency. The nonlinear parameters are adjusted to achieve a harmonious balance between global and local search capabilities. In addition, the alert perturbation mechanism is implemented before each optimization iteration, which improves the algorithm's ability to overcome local optima. Furthermore, a compound chaotic mapping is introduced to increase the diversity of the population. Experimental results demonstrate the outstanding performance of the MIGTO algorithm in various grid map path planning scenarios. Whether faced with complex obstacles, multiple exits, or multiple fire sources, the path inferiority indices of MIGTO in path planning are significantly superior to other algorithms. The MIGTO algorithm is not only suitable for dynamic planning of fire evacuation paths, but can also be used in the Pathfinder evacuation simulation software, where it outperforms the software's built-in algorithms.

An Efficient Growth Pattern Algorithm (GrowPAL) for Cluster Structure Prediction.

Identifying the lowest energy isomers in large clusters is a major challenge. Here, we introduce the Growth Pattern Algorithm (GrowPAL), a new approach that generates initial seeds composed of n+1 atoms from the system with n atoms through an interstitial-type addition (I-type) mechanism. We evaluated the effectiveness of GrowPAL on Lennard-Jones (LJ) clusters with up to n = 80 atoms, verifying the algorithm's ability to find challenging minima such as LJ38 and the partially icosahedral LJ69 with fewer optimizations than existing methods. In addition, we discuss the advantages and limitations of GrowPAL using our deconstruction scheme, which identifies "forebears" structures to study growth pathways. Having evaluated the strengths and weaknesses of GrowPAL, we employed it to explore Sutton-Chen clusters containing 5 to 80 atoms, uncovering three new lowest energy forms. We then applied GrowPAL to boron clusters containing 8 to 15 atoms, successfully identifying all reported minima. Overall, GrowPAL offers a practical solution for efficiently identifying global minima in hierarchical systems, thereby reducing computational costs.

Gas engine CCHP system optimization: An energy, exergy, economic, and environment analysis and optimization based on developed northern goshawk optimization algorithm

This paper aims to enhance the design and operation of a Combined Cooling, Heating, and Power (CCHP) system utilizing a gas engine as the primary energy source for a residential building in China. An Energy, Exergy, Economic, and Environment (4E) analysis is employed to assess the system's performance and impact based on energy, exergy, economic, and environmental criteria. The effectiveness of the DNGO algorithm is evaluated on a case study site and compared with Northern Goshawk Optimization (NGO) and Genetic Algorithm (GA). The findings demonstrate that the DNGO algorithm identifies the optimal gas engine size of 130 kW. The algorithm's search capabilities are greatly enhanced by this unique blend, surpassing what traditional methods can offer. The DNGO algorithm brings several advantages, including unparalleled energy efficiency, reduced exergy destruction, and a substantial decrease in CO2 emissions. This not only supports environmental sustainability but also aligns with global standards. Economically, the algorithm enhances the performance of the CCHP system, evident through a reduced payback period and increased annual profit. Additionally, the algorithm's rapid convergence rate allows it to reach the optimal solution faster than its counterparts, making it advantageous for time-sensitive applications. Incorporating innovative methods like chaos theory, the DNGO algorithm effectively avoids local optima, enabling a broader search for the best solution. The utilization of Lévy flight further enhances the algorithm's ability to escape local optima and navigate the search space more efficiently. Additionally, swarm intelligence is employed to simulate the collective behavior of decentralized systems, aiding in problem-solving. This research represents a significant advancement in optimization techniques for CCHP systems and offers a fresh perspective to the field of swarm-based optimization algorithms.

Multi-Strategy Improved Dung Beetle Optimization Algorithm and Its Applications.

The dung beetle optimization (DBO) algorithm, a swarm intelligence-based metaheuristic, is renowned for its robust optimization capability and fast convergence speed. However, it also suffers from low population diversity, susceptibility to local optima solutions, and unsatisfactory convergence speed when facing complex optimization problems. In response, this paper proposes the multi-strategy improved dung beetle optimization algorithm (MDBO). The core improvements include using Latin hypercube sampling for better population initialization and the introduction of a novel differential variation strategy, termed "Mean Differential Variation", to enhance the algorithm's ability to evade local optima. Moreover, a strategy combining lens imaging reverse learning and dimension-by-dimension optimization was proposed and applied to the current optimal solution. Through comprehensive performance testing on standard benchmark functions from CEC2017 and CEC2020, MDBO demonstrates superior performance in terms of optimization accuracy, stability, and convergence speed compared with other classical metaheuristic optimization algorithms. Additionally, the efficacy of MDBO in addressing complex real-world engineering problems is validated through three representative engineering application scenarios namely extension/compression spring design problems, reducer design problems, and welded beam design problems.

Multi-strategy enhanced snake optimizer for quantitative structure-activity relationship modeling

Quantitative structure-activity relationship modeling techniques are widely employed in diverse areas of chemistry, including environmental risk assessment of compounds and virtual screening of drugs. The modeling process entails optimizing the hyper parameters of the model and selecting appropriate molecular descriptors. It is a typical optimization problem with high-dimensional, nonlinear, continuous and discrete variables coexisting. To address this challenge, this paper proposes an enhanced snake optimizer with multiple strategies. First, new food emergence and temperature change mechanisms are introduced to balance the exploration and exploitation. Second, a death and regeneration mechanism is employed to enhance the algorithm's ability to escape from local optima. Third, new formulas for food searching, fighting, mating and eating are designed to simplify the complexity of the algorithm and improve its search efficiency and accuracy. Fourth, the performance of the proposed algorithm is evaluated using the CEC2017 benchmark functions, eight engineering cases with continuous variables, and six feature selection cases with discrete variables. Experimental results demonstrate that the algorithm significantly outperforms comparison algorithms. Finally, the algorithm was applied to quantitative structure-activity relationship modeling for environmental toxicity prediction. Compared with other algorithms, the algorithm can better configure hyper-parameters and select fewer and more effective features for environmental toxicity prediction model. It will be an effective tool to improve the performance of quantitative structure-activity relationship models.

A thermal infrared target tracking based on multi-feature fusion and adaptive model update

Thermal infrared target tracking has attracted increasing attention from researchers due to its unique imaging advantages. In response to common issues encountered in correlation filtering algorithms during the tracking process, such as background clutter, distractors, and occlusion, a framework for improving infrared target tracking is proposed. This paper proposes to extend multi-channel stepped grayscale features and optimize the feature set, fully leveraging the complementarity between multiple features and enhancing their ability to represent tracking targets. The tracking results are evaluated using the peak energy of the position weighted average, enabling an adaptive model update that improves the algorithm's ability to resist occlusion. The proposed algorithm is evaluated on the LSOTB-TIR and PTB-TIR infrared tracking datasets in terms of precision, success rate, and processing speed. In addition, the algorithm is also experimented on a self-collected dataset. The experimental results indicate that the proposed optimization framework can be integrated into correlation filtering trackers with a certain level of applicability. The improved algorithm demonstrates effective handling of various complex infrared scenarios and interferences, achieving high-precision and real-time tracking of infrared targets.

Artemisinin optimization based on malaria therapy: Algorithm and applications to medical image segmentation

This study proposes an efficient metaheuristic algorithm called the Artemisinin Optimization (AO) algorithm. This algorithm draws inspiration from the process of artemisinin medicine therapy for malaria, which involves the comprehensive eradication of malarial parasites within the human body. AO comprises three optimization stages: a comprehensive eliminations phase simulating global exploration, a local clearance phase for local exploitation, and a post-consolidation phase to enhance the algorithm's ability to escape local optima. In the experimental, this paper conducts a qualitative analysis experiment on the AO, explaining its characteristics in searching for the optimal solution. Subsequently, AO is then tested on the classical IEEE CEC 2014, and the latest IEEE CEC 2022 benchmark function sets to assess its adaptability. Comparative analyses are conducted against eight well-established algorithms and eight high-performance improved algorithms. Statistical analyses of convergence curves and qualitative metrics revealed AO's robust competitiveness. Lastly, the AO is incorporated into breast cancer pathology image segmentation applications. Using 15 authentic medical images at six threshold levels, AO's segmentation performance is compared against eight distinguished algorithms. Experimental results demonstrated AO's superiority in terms of image segmentation accuracy, Feature Similarity Index (FSIM), Peak Signal-to-Noise Ratio (PSNR), and Structural Similarity Index (SSIM) over the contrast algorithms. These results emphasize AO's efficiency and its potential in real-world optimization applications. The source codes22https://github.com/aliasgharheidaricom/Artemisinin-Optimizer-using-Malaria-Therapy-Algorithm-and-Applications-to-Medical-Image-Segmentation. of this paper are available in https://aliasgharheidari.com/AO.html and other public websites33https://ch.mathworks.com/matlabcentral/fileexchange/165791-artemisinin-optimization-ao-based-on-malaria-therapy..

Enhanced differential evolution algorithm for feature selection in tuberculous pleural effusion clinical characteristics analysis

Tuberculous pleural effusion poses a significant threat to human health due to its potential for severe disease and mortality. Without timely treatment, it may lead to fatal consequences. Therefore, early identification and prompt treatment are crucial for preventing problems such as chronic lung disease, respiratory failure, and death. This study proposes an enhanced differential evolution algorithm based on colony predation and dispersed foraging strategies. A series of experiments conducted on the IEEE CEC 2017 competition dataset validated the global optimization capability of the method. Additionally, a binary version of the algorithm is introduced to assess the algorithm's ability to address feature selection problems. Comprehensive comparisons of the effectiveness of the proposed algorithm with 8 similar algorithms were conducted using public datasets with feature sizes ranging from 10 to 10,000. Experimental results demonstrate that the proposed method is an effective feature selection approach. Furthermore, a predictive model for tuberculous pleural effusion is established by integrating the proposed algorithm with support vector machines. The performance of the proposed model is validated using clinical records collected from 140 tuberculous pleural effusion patients, totaling 10,780 instances. Experimental results indicate that the proposed model can identify key correlated indicators such as pleural effusion adenosine deaminase, temperature, white blood cell count, and pleural effusion color, aiding in the clinical feature analysis of tuberculous pleural effusion and providing early warning for its treatment and prediction.

Personalized Learning Path Recommendation Algorithm for English Listening Learning

A personalized learning path recommendation algorithm for English listening learning leverages data on users' proficiency levels, learning preferences, and past performance to suggest tailored learning paths. By incorporating natural language processing (NLP) techniques, the algorithm can analyze audio content, transcripts, and user interactions to assess comprehension and identify areas for improvement. It then recommends a sequence of listening exercises, podcasts, audiobooks, or other resources matched to the user's skill level and interests. This paper introduces the Ranked Path Recommendation (RPR) algorithm, designed to facilitate personalized English listening learning. Leveraging data analytics and machine learning techniques, the RPR algorithm aims to provide tailored recommendations of listening materials based on individual learners' preferences, proficiency levels, and learning objectives. Through a series of experiments and analyses, the effectiveness of the algorithm is evaluated, considering factors such as recommendation accuracy, learner satisfaction, and adaptability. Results demonstrate the algorithm's ability to curate diverse and relevant listening materials, enhancing learner engagement and comprehension. However, challenges such as algorithmic biases and the need for ongoing refinement are acknowledged. Ultimately, the RPR algorithm represents a promising approach to adaptive learning in language education, contributing to the advancement of personalized and effective language learning experiences. Results demonstrate that the RPR algorithm achieved recommendation accuracy ranging from 85% to 92% across ten different scenarios, with corresponding learner satisfaction ratings ranging from 6.9 to 8.8 on a scale of 1 to 10. Learner feedback indicates that recommended materials were perceived as relevant, engaging, and diverse, contributing to enhanced comprehension and motivation.

COLLECT AND PREPARE DATASET FROM HUMAN-DEMONSTRATIONS OF SIMPLE MANIPULATION TASKS USING XARM7 ROBOTIC ARM FOR TRAINING BEHAVIOUR CLONING ALGORITHM

The goal of the study is to understand what data structure is necessary to teach a robot to perform simple manipulation tasks. Training will take place thanks to Imitation learning, using the behavior cloning algorithm. Imitation learning is extremely useful for training any robotic system, especially with multi-jointed robots. This approach allows you to avoid writing complex and cumbersome heuristic algorithms. Heuristic algorithms often contain many hyperparameters that must be chosen empirically. Imitation learning algorithms allow you to develop an End-to-End policy from the collected data, which simplifies the system and increases its reliability. In the realm of training robotic systems through Imitation Learning, the criticality of data collection cannot be overstated. The efficacy of the Behavior Cloning algorithm hinges on the quality and speed at which data is gathered. Properly curated and swiftly acquired datasets serve as the bedrock for training algorithms that emulate human behavior, allowing the robot to seamlessly replicate intricate manipulations. The efficiency of data gathering is paramount in addressing the challenges posed by the dynamic nature of real-world environments. Swift adaptation to varying conditions and unforeseen scenarios necessitates a data collection process that is not only rapid but also comprehensive. A well-curated dataset not only expedites the training process but also enhances the model's adaptability and robustness in real-world applications. In conclusion, the success of Imitation Learning algorithms, particularly those underpinned by the Behavior Cloning approach, is contingent on the meticulous and expeditious gathering of data. This underscores the importance of streamlined data collection processes, ensuring that the resultant models are not only accurate but also capable of navigating the complexities of diverse and dynamic environments. Fastidious attention to data gathering is imperative to ensure a diverse and representative dataset. The xArm7 robot, in collaboration with the Realsense D435 camera, serves as an ideal synergy for capturing a myriad of movements and scenarios. The precision of data collection directly influences the algorithm's ability to generalize, making it adept at handling a spectrum of manipulation tasks.

Improvement and optimization of coal dust concentration detection technology: Based on the 3σ criterion and the kalman filtering composite algorithm

Due to the inherent time delay in dust concentration data transmission, dust reduction equipment is unable to respond according to the current moment's dust concentration. Hence, the focus of mine dust concentration detection technology extends beyond the current dust concentration to accurately predicting the next moment's dust concentration, allowing a response window for dust reduction equipment, leading to more optimal dust reduction effects. This necessitates the introduction of the Kalman filtering algorithm. Despite the traditional single Kalman filtering algorithm's ability to make certain dust concentration predictions, it is constrained by high-temperature, high-humidity underground environments and electromagnetic pulse signal interference from fan and coal mining machine operations, with an error rate reaching up to 40 %, seriously disrupting underground dust reduction equipment. However, the composite Kalman filtering algorithm incorporating the 3σ rule effectively eliminates bad values and removes instability from the underground environment and noise, rendering it applicable to most complex environments, providing accurate predicted concentrations for dust reduction equipment, and boosting overall universality. This study designed a fusion algorithm based on the Pauta criterion and Kalman filter to further optimize the dust concentration detection technology based on electrostatic induction. The sensor's model and measuring principle were first analyzed, and the initial calibration and precision testing of the sensor using the experimental system were completed. The dust concentration fluctuation characteristics were then modeled with Matlab, and the noise variance was estimated to process and filter the dust concentration data with the Pauta criterion, Kalman filter, and fusion algorithm respectively. The accuracy of the dust concentration sensor was tested again after applying the fusion algorithm, which proved to significantly enhance the stability and accuracy of the electrostatic induction-based dust concentration sensor. This study has critical implications for coal mine dust concentration monitoring and coal miner occupational health protection.

Hybrid Artificial Bee Colony Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem

Aiming at the capacitated vehicle routing problem, a hybrid integer programming model with goal of lowest path cost is constructed, and a hybrid artificial bee colony algorithm with variable neighborhood search based on the model and the characteristics of the CVRP problem is proposed to solve the problem. The hybrid algorithm integrates the artificial bee colony algorithm and the variable neighborhood search algorithm, embeds a multi-variable neighborhood operator in the local search link of the artificial bee colony to carry out iteration. And the operator contains targeted transformation operations on path nodes, strings, and sub paths to ensure the diversity of the bee population. In addition, a variable neighborhood perturbation strategy is used to strengthen the algorithm's ability to escape from local optima. The comparative analysis of the literature study set and its algorithm solution shows that the designed hybrid variable neighborhood artificial bee colony algorithm has strong global search ability and high solution accuracy, especially in solution stability. HABC-VNS can obtain 47 optimal solutions in 74 examples. The average minimum deviation of the optimal solution is 0.34%, and the average deviation of the average CVRP set is 0.57%. The overall performance is better than the algorithm in the comparative literature.

Hypertrophic cardiomyopathy detection with artificial intelligence electrocardiography in international cohorts: an external validation study.

Recently, deep learning artificial intelligence (AI) models have been trained to detect cardiovascular conditions, including hypertrophic cardiomyopathy (HCM), from the 12-lead electrocardiogram (ECG). In this external validation study, we sought to assess the performance of an AI-ECG algorithm for detecting HCM in diverse international cohorts. A convolutional neural network-based AI-ECG algorithm was developed previously in a single-centre North American HCM cohort (Mayo Clinic). This algorithm was applied to the raw 12-lead ECG data of patients with HCM and non-HCM controls from three external cohorts (Bern, Switzerland; Oxford, UK; and Seoul, South Korea). The algorithm's ability to distinguish HCM vs. non-HCM status from the ECG alone was examined. A total of 773 patients with HCM and 3867 non-HCM controls were included across three sites in the merged external validation cohort. The HCM study sample comprised 54.6% East Asian, 43.2% White, and 2.2% Black patients. Median AI-ECG probabilities of HCM were 85% for patients with HCM and 0.3% for controls (P < 0.001). Overall, the AI-ECG algorithm had an area under the receiver operating characteristic curve (AUC) of 0.922 [95% confidence interval (CI) 0.910-0.934], with diagnostic accuracy 86.9%, sensitivity 82.8%, and specificity 87.7% for HCM detection. In age- and sex-matched analysis (case-control ratio 1:2), the AUC was 0.921 (95% CI 0.909-0.934) with accuracy 88.5%, sensitivity 82.8%, and specificity 90.4%. The AI-ECG algorithm determined HCM status from the 12-lead ECG with high accuracy in diverse international cohorts, providing evidence for external validity. The value of this algorithm in improving HCM detection in clinical practice and screening settings requires prospective evaluation.

Translation Algorithm of Proper Nouns in English-Chinese Translation Based on Lexical Knowledge Spectrum Map

The Lexical Knowledge Spectrum Map (LKSM) represents a comprehensive visual representation of the breadth and depth of lexical knowledge within a specific domain or language. By categorizing words and phrases along a spectrum ranging from basic to advanced levels of complexity, the LKSM provides learners and educators with a clear overview of vocabulary proficiency and progression. This dynamic tool not only helps individuals track their language learning journey but also guides instructional planning by identifying areas of focus and potential gaps in lexical understanding. With its intuitive interface and adaptable framework, the LKSM serves as a valuable resource for promoting effective vocabulary acquisition and mastery across diverse linguistic contexts and educational settings. This paper introduces a novel translation algorithm designed specifically for handling proper nouns in English-Chinese translation, leveraging the Lexical Knowledge Spectrum Map (LKSM) and Feature Vector Optimization with Statistical (FVOS) techniques. Proper nouns pose a unique challenge in translation due to their cultural and contextual significance, often requiring specialized handling to ensure accuracy and coherence in the target language. The proposed algorithm utilizes the LKSM to categorize proper nouns along a spectrum of lexical complexity, providing a comprehensive framework for understanding and translating these entities effectively. Additionally, FVOS techniques are employed to optimize feature vectors for proper noun translation, enhancing the algorithm's ability to capture and preserve semantic nuances across languages. With FVOS model English proper nouns translated into Chinese, the proposed algorithm achieves an average accuracy of 85%, outperforming baseline translation methods by 15%. Moreover, specific proper noun categories exhibit notable improvements, with names of people achieving an accuracy of 90%, followed by locations at 85%, and organizations at 80%.

Application of Using Improved Genetic Algorithm in Art Design

Art design encompasses the creative process of conceptualizing and crafting visual and aesthetic elements to convey messages, evoke emotions, and stimulate thought. It involves the deliberate selection and arrangement of colors, shapes, textures, and forms to create meaningful and impactful compositions across various mediums such as painting, sculpture, graphic design, and multimedia. This paper proposes an innovative approach to enhance art design through the application of an improved genetic algorithm (GA) coupled with Statistical Spider Swarm Optimization (SS-O). By integrating GA's evolutionary principles with the adaptive capabilities of SS-O, the proposed framework aims to optimize the generation of artistic compositions across various media. Through a series of experiments and simulations, the effectiveness of the hybrid algorithm is evaluated in terms of its ability to generate aesthetically pleasing designs while balancing artistic diversity and coherence. The improved GA component facilitates the exploration of diverse design solutions, while SS-O provides dynamic optimization capabilities by leveraging statistical analysis of swarm behavior. Simulation results demonstrate the efficacy of the approach, with generated designs achieving fitness scores ranging from 0.88 to 0.95, indicative of high aesthetic appeal. Moreover, the diversity index values ranging from 0.75 to 0.82 underscore the algorithm's ability to produce a varied range of artistic compositions. These numerical outcomes signify the potential of the proposed approach to revolutionize the creative process in art and design domains, offering new avenues for generating captivating visual expressions.

Improved differential evolution algorithm based on cooperative multi-population

This paper introduces an improved differential evolution algorithm based on cooperative multi-population (CMp-DE for short), which combines diverse population collaboration mechanisms and catalytic factors into an improved differential evolution framework. By harnessing various population collaboration mechanisms, the algorithm enhances the diversity of individuals within populations during initial iterations and reduces it during later iterations, thereby harmonizing the algorithm's exploratory and exploitative capabilities. Furthermore, a novel mutation operator is proposed that divides the iterative process into exploration and exploitation phases, thereby augmenting the algorithm's global exploration prowess. Lastly, a catalytic operator is introduced to generate new individuals near post-crossover individuals based on a specified rule, which enhances the algorithm's ability to escape local optima and increasing stability. The proposed CMp-DE is benchmarked against the CEC2017 benchmark test functions and compared against 13 algorithms, including five differential evolution algorithms and their variants, as well as eight state-of-the-art metaheuristic optimization algorithms. This evaluation assesses the CMp-DE's solution accuracy, convergence, stability, and scalability. Finally, the applicability of CMp-DE is validated by addressing six practical optimization problems. The experimental results show that CMp-DE surpasses other algorithms in terms of both convergence accuracy and robustness. Moreover, integrating a catalytic operator with other optimization algorithms notably boosts performance in convergence accuracy and stability. The inclusion of the catalytic operator has significantly enhanced the performance of algorithms compared to their performance before its addition. This underscores the potential of the catalytic operator in improving the performance of various algorithms, particularly in terms of convergence accuracy and robustness.