Search

Background: Mutations occurring in nucleic acids or proteins may affect the binding affinities of protein-nucleic acid interactions. Although many efforts have been devoted to the impact of protein mutations, few computational studies have addressed the effect of nucleic acid mutations and explored whether the identical methodology could be applied to the prediction of binding affinity changes caused by these two mutation types., Results: Here, we developed a generalized algorithm named PNBACE for both DNA and protein mutations. We first demonstrated that DNA mutations could induce varying degrees of changes in binding affinity from multiple perspectives. We then designed a group of energy-based topological features based on different energy networks, which were combined with our previous partition-based energy features to construct individual prediction models through feature selections. Furthermore, we created an ensemble model by integrating the outputs of individual models using a differential evolution algorithm. In addition to predicting the impact of single-point mutations, PNBACE could predict the influence of multiple-point mutations and identify mutations significantly reducing binding affinities. Extensive comparisons indicated that PNBACE largely performed better than existing methods on both regression and classification tasks., Conclusions: PNBACE is an effective method for estimating the binding affinity changes of protein-nucleic acid complexes induced by DNA or protein mutations, therefore improving our understanding of the interactions between proteins and DNA/RNA., (© 2024. The Author(s).)

Image segmentation plays a pivotal role in medical image analysis, particularly for accurately isolating tumors and lesions. Effective segmentation improves diagnostic precision and facilitates quantitative analysis, which is vital for medical professionals. However, traditional segmentation methods often struggle with multilevel thresholding due to the associated computational complexity. Therefore, determining the optimal threshold set is an NP-hard problem, highlighting the pressing need for efficient optimization strategies to overcome these challenges. This paper introduces a multi-threshold image segmentation (MTIS) method that integrates a hybrid approach combining Differential Evolution (DE) and the Crayfish Optimization Algorithm (COA), known as HADECO. Utilizing two-dimensional (2D) Kapur's entropy and a 2D histogram, this method aims to enhance the efficiency and accuracy of subsequent image analysis and diagnosis. HADECO is a hybrid algorithm that combines DE and COA by exchanging information based on predefined rules, leveraging the strengths of both for superior optimization results. It employs Latin Hypercube Sampling (LHS) to generate a high-quality initial population. HADECO introduces an improved DE algorithm (IDE) with adaptive and dynamic adjustments to key DE parameters and new mutation strategies to enhance its search capability. In addition, it incorporates an adaptive COA (ACOA) with dynamic adjustments to the switching probability parameter, effectively balancing exploration and exploitation. To evaluate the effectiveness of HADECO, its performance is initially assessed using CEC'22 benchmark functions. HADECO is evaluated against several contemporary algorithms using the Wilcoxon signed rank test (WSRT) and the Friedman test (FT) to integrate the results. The findings highlight HADECO's superior optimization abilities, demonstrated by its lowest average Friedman ranking of 1.08. Furthermore, the HADECO-based MTIS method is evaluated using MRI images for knee and CT scans for brain intracranial hemorrhage (ICH). Quantitative results in brain hemorrhage image segmentation show that the proposed method achieves a superior average peak signal-to-noise ratio (PSNR) and feature similarity index (FSIM) of 1.5 and 1.7 at the 6-level threshold. In knee image segmentation, it attains an average PSNR and FSIM of 1.3 and 1.2 at the 5-level threshold, demonstrating the method's effectiveness in solving image segmentation problems., Competing Interests: Declaration of competing interest No conflict of interest exists. No funding was received for this work. The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. We confirm that the manuscript has been read and approved by all named authors., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Differential Evolution (DE) stands as a potent global optimization algorithm, renowned for its application in addressing a myriad of practical engineering issues. The efficacy of DE is profoundly influenced by its control parameters and mutation strategies. In light of this, we introduce a refined DE algorithm characterized by adaptive parameters and dual mutation strategies (APDSDE). APDSDE inaugurates an adaptive switching mechanism that alternates between two innovative mutation strategies: DE/current-to-pBest-w/1 and DE/current-to-Amean-w/1. Furthermore, a novel parameter adaptation technique rooted in cosine similarity is established, with the derivation of explicit calculation formulas for both the scaling factor weight and crossover rate weight. In pursuit of optimizing convergence speed whilst preserving population diversity, a sophisticated nonlinear population size reduction method is proposed. The robustness of each algorithm is rigorously evaluated against the CEC2017 benchmark functions, with empirical evidence underscoring the superior performance of APDSDE in comparison to a host of advanced DE variants., (© 2024. The Author(s).)

In classification, feature selection is an essential pre-processing step that selects a small subset of features to improve classification performance. Existing feature selection approaches can be divided into three main approaches: wrapper approaches, filter approaches, and embedded approaches. In comparison with two other approaches, embedded approaches usually have better trade-off between classification performance and computation time. One of the most well-known embedded approaches is sparsity regularisation-based feature selection which generates sparse solutions for feature selection. Despite its good performance, sparsity regularisation-based feature selection outputs only a feature ranking which requires the number of selected features to be predefined. More importantly, the ranking mechanism introduces a risk of ignoring feature interactions which leads to the fact that many top-ranked but redundant features are selected. This work addresses the above problems by proposing a new representation that considers the interactions between features and can automatically determine an appropriate number of selected features. The proposed representation is used in a differential evolutionary (DE) algorithm to optimise the feature subset. In addition, a novel initialisation mechanism is proposed to let DE consider various numbers of selected features at the beginning. The proposed algorithm is examined on both synthetic and real-world datasets. The results on the synthetic dataset show that the proposed algorithm can select complementary features while existing sparsity regularisation-based feature selection algorithms are at risk of selecting redundant features. The results on real-world datasets show that the proposed algorithm achieves better classification performance than well-known wrapper, filter, and embedded approaches. The algorithm is also as efficient as filter feature selection approaches., (© 2024 Massachusetts Institute of Technology.)

The microstrip devices based on multimode resonators represent a class of electromagnetic microwave devices, promising use in tropospheric communication, radar, and navigation systems. The design of wideband bandpass filters, diplexers, and multiplexers with required frequency-selective properties, i.e., bandpass filters, is a complex problem, as electrodynamic modeling is a time-consuming and computationally intensive process. Various planar microstrip resonator topologies can be developed, differing in their topology type, and the search for high-quality structures with unique frequency-selective properties is an important research direction. In this study, we propose an approach for performing an automated search for multimode resonators' conductor topology parameters using a combination of evolutionary computation approach and surrogate modeling. In particular, a variant of differential evolution optimizer is applied, and the model of the target function landscape is built using Gaussian processes. At every iteration of the algorithm, the model is used to search for new high-quality solutions. In addition, a general approach for target function formulation is presented and applied in the proposed approach. The experiments with two microwave filters have demonstrated that the proposed algorithm is capable of solving the problem of tuning two types of topologies, namely three-mode resonators and six-mode resonators, to the required parameters, and the application of surrogated-assisted algorithm has significantly improved overall performance.

The objective measurements of the real-world optimization problems are mostly subject to noise which occurs due to several reasons like human measurement or environmental factors. The performance of the optimization algorithm gets affected if the effect of noise is higher than the negligible limit. The previous noise handling optimization algorithms use a large population size or multiple sampling at same region which increases the total count of function evaluations, and few methods work for a particular problem type. To address the above challenges, a Differential Evolution based Noise handling Optimization algorithm (NDE) to solve and optimize noisy bi-objective optimization problems is proposed. NDE is a Differential Evolution (DE) based optimization algorithm where the strategies for trial vector generation and the control parameters of DE algorithm are self-adapted using fuzzy inference system to improve the population diversity along the evolution process. In NDE, explicit averaging based method for denoising is used when the noise level is higher than negligible limit. Extending noise handling method enhances the performance of the optimization algorithm in solving real world optimization problems. To improve the convergence characteristics of the proposed algorithm, a restricted local search procedure is proposed. The performance of NDE algorithm is experimented using DTLZ and WFG problems, which are benchmark bi-objective optimization problems. The obtained results are compared with other SOTA algorithm using modified Inverted Generational Distance and Hypervolume performance metrics, from which it is confirmed that the proposed NDE algorithm is better in solving noisy bi-objective problems when compared to the other methods. To further strengthen the claim, statistical tests are conducted using the Wilcoxon and Friedman rank tests, and the proposed NDE algorithm shows significance over the other algorithms rejecting the null hypothesis., (© 2024. The Author(s).)

Polychlorinated dibenzo-p-dioxins and polychlorinated dibenzofurans (PCDD/Fs) are involuntary by-products of incomplete combustion and are highly toxic to humans and the environment. The Malaysian peat is often acidic or extremely acidic having high levels of chlorine and/or other organic acids that act as catalysts or precursors in PCDD/Fs formation. This study aims to predict PCDD/Fs emissions in peat soil using an artificial neural network (ANN) approach based on limited emission data and selected physico-chemical properties. The ANN's prediction performance is affected by uncertainties in its initial connection weights. To improve prediction performance, an optimisation algorithm, termed differential evolution (DE), is used to optimise the ANN's initial connection weights and bias. The study adopts several ANNs with fixed architecture to predict PCDD/Fs emissions, each consisting of a multilayer perceptron (MLP) with a backpropagation algorithm. Eight input variables and one output variable were adopted to train and test various neural network architectures using real-world datasets. The model optimisation procedure was conducted to ascertain the network architecture with the best predictive accuracy. The evolved ANN based on 5 hidden neurons, with the assistance of self-adaptive ensemble-based differential evolution with enhanced population sizing (SAEDE-EP), successfully produced the lowest MSE test (6.1790 × 10 -3 ) and highest R 2 (0.97447) based on the mean among the other HNs. An evolutionary-optimised ANN-based methodology is a viable solution to predict PCDD/Fs in peat soil. It is cost-effective for pollution control, environmental monitoring and capable of aiding authorities prevent PCDD/Fs exposure, e.g., during a fire., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Speech emotion recognition (SER) technology involves feature extraction and prediction models. However, recognition efficiency tends to decrease because of gender differences and the large number of extracted features. Consequently, this paper introduces a SER system based on gender. First, gender and emotion features are extracted from speech signals to develop gender recognition and emotion classification models. Second, according to gender differences, distinct emotion recognition models are established for male and female speakers. The gender of speakers is determined before executing the corresponding emotion model. Third, the accuracy of these emotion models is enhanced by utilizing an advanced differential evolution algorithm (ADE) to select optimal features. ADE incorporates new difference vectors, mutation operators, and position learning, which effectively balance global and local searches. A new position repairing method is proposed to address gender differences. Finally, experiments on four English datasets demonstrate that ADE is superior to comparison algorithms in recognition accuracy, recall, precision, F1-score, the number of used features and execution time. The findings highlight the significance of gender in refining emotion models, while mel-frequency cepstral coefficients are important factors in gender differences., (© 2024. The Author(s).)

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., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

In recent years, remotely controlling an unmanned aerial vehicle (UAV) to perform coverage search missions has become increasingly popular due to the advantages of the UAV, such as small size, high maneuverability, and low cost. However, due to the distance limitations of the remote control and endurance of a UAV, a single UAV cannot effectively perform a search mission in various and complex regions. Thus, using a group of UAVs to deal with coverage search missions has become a research hotspot in the last decade. In this paper, a differential evolution (DE)-based multi-UAV cooperative coverage algorithm is proposed to deal with the coverage tasks in different regions. In the proposed algorithm, named DECSMU, the entire coverage process is divided into many coverage stages. Before each coverage stage, every UAV automatically plans its flight path based on DE. To obtain a promising flight trajectory for a UAV, a dynamic reward function is designed to evaluate the quality of the planned path in terms of the coverage rate and the energy consumption of the UAV. In each coverage stage, an information interaction between different UAVs is carried out through a communication network, and a distributed model predictive control is used to realize the collaborative coverage of multiple UAVs. The experimental results show that the strategy can achieve high coverage and a low energy consumption index under the constraints of collision avoidance. The favorable performance in DECSMU on different regions also demonstrate that it has outstanding stability and generality.

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation.

As a preprocessing for machine learning and data mining, Feature Selection plays an important role. Feature selection aims to streamline high-dimensional data by eliminating irrelevant and redundant features, which reduces the potential curse of dimensionality of a given large dataset. When working with datasets containing many features, algorithms that aim to identify the most valuable features to improve dataset accuracy may encounter difficulties because of local optima. Many studies have been conducted to solve this problem. One of the solutions is to use meta-heuristic techniques. This paper presents a combination of the Differential evolution and the sailfish optimizer algorithms (DESFO) to tackle the feature selection problem. To assess the effectiveness of the proposed algorithm, a comparison between Differential Evolution, sailfish optimizer, and nine other modern algorithms, including different optimization algorithms, is presented. The evaluation used Random forest and key nearest neighbors as quality measures. The experimental results show that the proposed algorithm is a superior algorithm compared to others. It significantly impacts high classification accuracy, achieving 85.7% with the Random Forest classifier and 100% with the Key Nearest Neighbors classifier across 14 multi-scale benchmarks. According to fitness values, it gained 71% with the Random forest and 85.7% with the Key Nearest Neighbors classifiers., (© 2024. The Author(s).)

Mixed integer nonlinear programming (MINLP) addresses optimization problems that involve continuous and discrete/integer decision variables, as well as nonlinear functions. These problems often exhibit multiple discontinuous feasible parts due to the presence of integer variables. Discontinuous feasible parts can be analyzed as subproblems, some of which may be highly constrained. This significantly impacts the performance of evolutionary algorithms (EAs), whose operators are generally insensitive to constraints, leading to the generation of numerous infeasible solutions. In this article, a variant of the differential evolution algorithm (DE) with a gradient-based repair method for MINLP problems (G-DEmi) is proposed. The aim of the repair method is to fix promising infeasible solutions in different subproblems using the gradient information of the constraint set. Extensive experiments were conducted to evaluate the performance of G-DEmi on a set of MINLP benchmark problems and a real-world case. The results demonstrated that G-DEmi outperformed several state-of-the-art algorithms. Notably, G-DEmi did not require novel improvement strategies in the variation operators to promote diversity; instead, an effective exploration within each subproblem is under consideration. Furthermore, the gradient-based repair method was successfully extended to other DE variants, emphasizing its capacity in a more general context., Competing Interests: The authors declare that they have no competing interests., (© 2024 Molina-Pérez et al.)

The near-infinite compositional space of high-entropy-alloys (HEAs) is a huge resource-intensive task for developing exceptional materials. In the present study, an algorithmic framework has been developed to optimize the composition of an alloy with chosen set of elements, aiming to maximize the hardness of the former. The influence of phase on hardness prediction of HEAs was thoroughly examined. This study aims to establish generalized prediction models that aren't confined by any specific set of elements. We trained the HEA identification model to classify HEAs from non-HEAs, the multi-labeled phase classification model to predict phases of HEAs also considering the processing route involved in the synthesis of the alloy, and the hardness prediction model for predicting hardness and optimizing the composition of the given alloy. The purposed algorithmic framework uses twenty-nine alloy descriptors to compute the composition that demonstrates maximum hardness for the given set of elements along with its phase(s) and a label stating whether it is classified as HEA or not., (© 2024. The Author(s).)

DNA-binding proteins are a class of proteins that can interact with DNA molecules through physical and chemical interactions. Their main functions include regulating gene expression, maintaining chromosome structure and stability, and more. DNA-binding proteins play a crucial role in cellular and molecular biology, as they are essential for maintaining normal cellular physiological functions and adapting to environmental changes. The prediction of DNA-binding proteins has been a hot topic in the field of bioinformatics. The key to accurately classifying DNA-binding proteins is to find suitable feature sources and explore the information they contain. Although there are already many models for predicting DNA-binding proteins, there is still room for improvement in mining feature source information and calculation methods. In this study, we created a model called DBPboost to better identify DNA-binding proteins. The innovation of this study lies in the use of eight feature extraction methods, the improvement of the feature selection step, which involves selecting some features first and then performing feature selection again after feature fusion, and the optimization of the differential evolution algorithm in feature fusion, which improves the performance of feature fusion. The experimental results show that the prediction accuracy of the model on the UniSwiss dataset is 89.32%, and the sensitivity is 89.01%, which is better than most existing models., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Differential evolution (DE) is a robust optimizer designed for solving complex domain research problems in the computational intelligence community. In the present work, a multi-hybrid DE (MHDE) is proposed for improving the overall working capability of the algorithm without compromising the solution quality. Adaptive parameters, enhanced mutation, enhanced crossover, reducing population, iterative division and Gaussian random sampling are some of the major characteristics of the proposed MHDE algorithm. Firstly, an iterative division for improved exploration and exploitation is used, then an adaptive proportional population size reduction mechanism is followed for reducing the computational complexity. It also incorporated Weibull distribution and Gaussian random sampling to mitigate premature convergence. The proposed framework is validated by using IEEE CEC benchmark suites (CEC 2005, CEC 2014 and CEC 2017). The algorithm is applied to four engineering design problems and for the weight minimization of three frame design problems. Experimental results are analysed and compared with recent hybrid algorithms such as laplacian biogeography based optimization, adaptive differential evolution with archive (JADE), success history based DE, self adaptive DE, LSHADE, MVMO, fractional-order calculus-based flower pollination algorithm, sine cosine crow search algorithm and others. Statistically, the Friedman and Wilcoxon rank sum tests prove that the proposed algorithm fares better than others., (© 2024. The Author(s).)

The exploration of premium and new locations is regarded as a fundamental function of every evolutionary algorithm. This is achieved using the crossover and mutation stages of the differential evolution (DE) method. A best-and-worst position-guided novel exploration approach for the DE algorithm is provided in this study. The proposed version, known as "Improved DE with Best and Worst positions (IDEBW)", offers a more advantageous alternative for exploring new locations, either proceeding directly towards the best location or evacuating the worst location. The performance of the proposed IDEBW is investigated and compared with other DE variants and meta-heuristics algorithms based on 42 benchmark functions, including 13 classical and 29 non-traditional IEEE CEC-2017 test functions and 3 real-life applications of the IEEE CEC-2011 test suite. The results prove that the proposed approach successfully completes its task and makes the DE algorithm more efficient.

Purpose: Graph coloring approach has emerged as a valuable problem-solving tool for both theoretical and practical aspects across various scientific disciplines, including biology. In this study, we demonstrate the graph coloring's effectiveness in computational network biology, more precisely in analyzing protein-protein interaction (PPI) networks to gain insights about the viral infections and its consequences on human health. Accordingly, we propose a generic model that can highlight important hub proteins of virus-associated disease manifestations, changes in disease-associated biological pathways, potential drug targets and respective drugs. We test our model on SARS-CoV-2 infection, a highly transmissible virus responsible for the COVID-19 pandemic. The pandemic took significant human lives, causing severe respiratory illnesses and exhibiting various symptoms ranging from fever and cough to gastrointestinal, cardiac, renal, neurological, and other manifestations., Methods: To investigate the underlying mechanisms of SARS-CoV-2 infection-induced dysregulation of human pathobiology, we construct a two-level PPI network and employed a differential evolution-based graph coloring (DEGCP) algorithm to identify critical hub proteins that might serve as potential targets for resolving the associated issues. Initially, we concentrate on the direct human interactors of SARS-CoV-2 proteins to construct the first-level PPI network and subsequently applied the DEGCP algorithm to identify essential hub proteins within this network. We then build a second-level PPI network by incorporating the next-level human interactors of the first-level hub proteins and use the DEGCP algorithm to predict the second level of hub proteins., Results: We first identify the potential crucial hub proteins associated with SARS-CoV-2 infection at different levels. Through comprehensive analysis, we then investigate the cellular localization, interactions with other viral families, involvement in biological pathways and processes, functional attributes, gene regulation capabilities as transcription factors, and their associations with disease-associated symptoms of these identified hub proteins. Our findings highlight the significance of these hub proteins and their intricate connections with disease pathophysiology. Furthermore, we predict potential drug targets among the hub proteins and identify specific drugs that hold promise in preventing or treating SARS-CoV-2 infection and its consequences., Conclusion: Our generic model demonstrates the effectiveness of DEGCP algorithm in analyzing biological PPI networks, provides valuable insights into disease biology, and offers a basis for developing novel therapeutic strategies for other viral infections that may cause future pandemic., (© 2024. The Author(s).)

This paper explores the energy-intensive cement industry, focusing on a plant in Greece and its mill and kiln unit. The data utilized include manipulated, non-manipulated, and uncontrolled variables. The non-manipulated variables are computed based on the machine learning (ML) models and selected by the minimum value of the normalized root mean square error ( NRMSE ) across nine (9) methods. In case the distribution of the data displayed in the user interface changes, the user should trigger the retrain of the AI models to ensure their accuracy and robustness. To form the objective function, the expert user should define the desired weight for each manipulated or non-manipulated variable through the user interface (UI), along with its corresponding constraints or target value. The user selects the variables involved in the objective function based on the optimization strategy, and the evaluation is based on the comparison of the optimized and the active value of the objective function. The differential evolution (DE) method optimizes the objective function that is formed by the linear combination of the selected variables. The results indicate that using DE improves the operation of both the cement mill and kiln, yielding a lower objective function value compared to the current values.

Evolutionary multitasking optimization (EMTO) handles multiple tasks simultaneously by transferring and sharing valuable knowledge from other relevant tasks. How to effectively identify transferred knowledge and reduce negative knowledge transfer are two key issues in EMTO. Many existing EMTO algorithms treat the elite solutions in tasks as transferred knowledge between tasks. However, these algorithms may not be effective enough when the global optimums of the tasks are far apart. In this paper, we study an adaptive evolutionary multitasking optimization algorithm based on population distribution information to find valuable transferred knowledge and weaken the negative transfer between tasks. In this paper, we first divide each task population into K sub-populations based on the fitness values of the individuals, and then the maximum mean discrepancy (MMD) is utilized to calculate the distribution difference between each sub-population in the source task and the sub-population where the best solution of the target task is located. Among the sub-populations of the source task, the sub-population with the smallest MMD value is selected, and the individuals in it are used as transferred individuals. In this way, the solution chosen for the transfer may be an elite solution or some other solution. In addition, an improved randomized interaction probability is also included in the proposed algorithm to adjust the intensity of inter-task interactions. The experimental results on two multitasking test suites demonstrate that the proposed algorithm achieves high solution accuracy and fast convergence for most problems, especially for problems with low relevance.

Glioblastoma is a primary brain tumor with high incidence and mortality rates, posing a significant threat to human health. It is crucial to provide necessary diagnostic assistance for its management. Among them, Multi-threshold Image Segmentation (MIS) is considered the most efficient and intuitive method in image processing. In recent years, many scholars have combined different metaheuristic algorithms with MIS to improve the quality of Image Segmentation (IS). Slime Mould Algorithm (SMA) is a metaheuristic approach inspired by the foraging behavior of slime mould populations in nature. In this investigation, we introduce a hybridized variant named BDSMA, aimed at overcoming the inherent limitations of the original algorithm. These limitations encompass inadequate exploitation capacity and a tendency to converge prematurely towards local optima when dealing with complex multidimensional problems. To bolster the algorithm's optimization prowess, we integrate the original algorithm with a robust exploitative operator called Differential Evolution (DE). Additionally, we introduce a strategy for handling solutions that surpass boundaries. The incorporation of an advanced cooperative mixing model accelerates the convergence of BDSMA, refining its precision and preventing it from becoming trapped in local optima. To substantiate the effectiveness of our proposed approach, we conduct a comprehensive series of comparative experiments involving 30 benchmark functions. The results of these experiments demonstrate the superiority of our method in terms of both convergence speed and precision. Moreover, within this study, we propose a MIS technique. This technique is subsequently employed to conduct experiments on IS at both low and high threshold levels. The effectiveness of the BDSMA-based MIS technique is further showcased through its successful application to the medical image of brain glioblastoma. The evaluation of these experimental outcomes, utilizing image quality metrics, conclusively underscores the exceptional efficacy of the algorithm we have put forth., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

Breast cancer poses a significant risk to women's health, and it is essential to provide proper diagnostic support. Medical image processing technology is a key component of all supporting diagnostic techniques, with Image Segmentation (IS) being one of its primary steps. Among various methods, Multilevel Image Segmentation (MIS) is considered one of the most effective and straightforward approaches. Many researchers have attempted to improve the quality of image segmentation by combining different metaheuristic algorithms with MIS. However, these methods often suffer from issues such as low convergence accuracy and a proclivity for converging towards Local Optima (LO). To overcome these challenges, this study introduces an integrated approach that combines the Salp Swarm Algorithm (SSA), Slime Mould Algorithm (SMA) and Differential Evolution (DE) algorithm. In this manuscript, we introduce an innovative hybrid MIS model termed SDSSA, which leverages elements from the SSA, SMA and DE algorithms. The SDSSA model fundamentally relies on non-local means 2D histogram and 2D Kapur's entropy. To evaluate the proposed method effectively, we compare it initially with similar algorithms using the IEEE CEC2014 benchmark functions. The SDSSA showcases enhanced convergence velocity and precision relative to similar algorithms. Furthermore, this paper proposes an excellent MIS method. Subsequently, IS experiments were conducted separately at both low and high threshold levels. The test results demonstrate that the segmentation outcomes of MIS, at both low and high threshold levels, outperform other methods. This validates SDSSA as a superior segmentation technique that provides practical assistance for future research in breast cancer pathology image processing., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

The possibility of pigment detection and recognition in different environments such as solvents or proteins is a challenging, and at the same time demanding, task. It may be needed in very different situations: from the nondestructive in situ identification of pigments in paintings to the early detection of fungal infection in major agro-industrial crops and products. So, we propose a prototype method, the key feature of which is a procedure analyzing the lineshape of a spectrum. The shape of the absorption spectrum corresponding to this transition strongly depends on the immediate environment of a pigment and can serve as a marker to detect the presence of a particular pigment molecule in a sample. Considering carotenoids as an object of study, we demonstrate that the combined operation of the differential evolution algorithm and semiclassical quantum modeling of the optical response based on a generalized spectral density (the number of vibronic modes is arbitrary) allows us to distinguish quantum models of the pigment for different solvents. Moreover, it is determined that to predict the optical properties of monomeric pigments in protein, it is necessary to create a database containing, for each pigment, in addition to the absorption spectra measured in a predefined set of solvents, the parameters of the quantum model found using differential evolution.

Cutting parameter optimisation is an effective way to realise energy-efficient machining. In previous studies, the cutting parameters of machining features of turning, milling, grinding, drilling, hobbing, and threading were optimised to decrease energy consumed by machine tools, and considerable energy savings were achieved. However, the energy consumption (EC) for each feature was separately optimised without systematic consideration of the negative effects on the EC for other features. The total EC for all features together probably increases. Hence, the trade-off amongst the reductions of EC for each feature needs to be jointly optimised. In our study, the external turning and drilling features are selected as examples to be combined. As a key novel contribution, we propose the integrated dimensional and cutting parameter optimisation problem about minimising the EC of Machine Tools for the combination of Turning and Drilling features (EMT-TD). In terms of optimisation, differential evolution (DE) is adopted to minimise the EMT-TD. According to case studies, DE obtained the optimal solutions within a computation time of 1 second. The optimal solutions achieved savings of 5.41%, 10.85%, and 7.19% of EMT-TD and savings of 2.23%, 5.90%, and 2.73% of machining time for three typical cases, respectively., (© 2023. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.)

Differential evolution (DE) is a proficient optimizer and has been broadly implemented in real life applications of various fields. Several mutation based adaptive approaches have been suggested to improve the algorithm efficiency in recent years. In this paper, a novel self-adaptive method called SaMDE has been designed and implemented on the mutation-based modified DE variants such as modified randomized localization-based DE (MRLDE), donor mutation based DE (DNDE), and sequential parabolic interpolation based DE (SPIDE), which were proposed by the authors in previous research. Using the proposed adaptive technique, an appropriate mutation strategy from DNDE and SPIDE can be selected automatically for the MRLDE algorithm. The experimental results on 50 benchmark problems taken of various test suits and a real-world application of minimization of the potential molecular energy problem validate the superiority of SaMDE over other DE variations.

In this paper, a procedure for obtaining undistorted high derivatives (up to the eighth order) of the optical absorption spectra of biomolecule pigments has been developed. To assess the effectiveness of the procedure, the theoretical spectra of bacteriochlorophyll a , chlorophyll a , spheroidene, and spheroidenone were simulated by fitting the experimental spectra using the differential evolution algorithm. The experimental spectra were also approximated using sets of Gaussians to calculate the model absorption spectra. Theoretical and model spectra can be differentiated without smoothing (high-frequency noise filtering) to obtain high derivatives. Superimposition of the noise track on the model spectra allows us to obtain test spectra similar to the experimental ones. Comparison of the high derivatives of the model spectra with those of the test spectra allows us to find the optimal parameters of the filter, the application of which leads to minimal differences between the high derivatives of the model and test spectra. For all four studied pigments, it was shown that smoothing the experimental spectra with optimal filters makes it possible to obtain the eighth derivatives of the experimental spectra, which were close to the eighth derivatives of their theoretical spectra.

Differential evolution (DE) is a heuristic global search algorithm based on population. It has exhibited great adaptability in solving continuous-domain problems, but sometimes suffered from insufficient local search ability and being trapped in local optimum when dealing with complicated optimization problems. To solve these problems, an improved differential evolution algorithm with population diversity mechanism based on covariance matrix (CM-DE) is proposed. First, a new parameter adaptation strategy is used to adapt the control parameters, in which the scale factor F is updated according to the improved wavelet basis function in the early stage and Cauchy distribution in the later stage and the crossover rate CR is generated according to normal distribution. The diversity of population and convergence speed are improved by employing the method above. Second, the perturbation strategy is incorporated into crossover operator to enhance the search ability of DE. Finally, the covariance matrix of the population is constructed, where the variance in the covariance matrix is used as indicator to measure the similarity between individuals in the population in order to prevent the algorithm from falling into local optimum resulted by low population diversity. The CM-DE is compared with the state-of-art DE variants including LSHADE (Tanabe and Fukunaga, 2014), jSO [1], LPalmDE [2], PaDE [3] and LSHADE-cnEpSin [4] under 88 test functions from CEC2013 [5], CEC2014 [6] and CEC2017 (Wu et al., 2017) test suites. From the experiment results, it is obvious that among 30 benchmark functions from CEC2017 on 50D optimization, the CM-DE algorithm has 22, 20, 24, 23, 28 better performances comparing with LSHADE, jSO, LPalmDE, PaDE, and LSHADE-cnEpsin. For CEC2017 on 30D optimization, the proposed algorithm secures better performance on 19 out of 30 benchmark functions in terms of convergence speed. In addition, a real-world application is also used to verify the feasibility of the proposed algorithm. The experiment results validate the highly competitive performance in terms of solution accuracy and convergence speed., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 ISA. Published by Elsevier Ltd. All rights reserved.)