Prairie Dog Optimization Algorithm

Analysis of medical images super-resolution via a wavelet pyramid recursive neural network constrained by wavelet energy entropy

Recently, multi-resolution pyramid-based techniques have emerged as the prevailing research approach for image super-resolution. However, these methods typically rely on a single mode of information transmission between levels. In our approach, a wavelet pyramid recursive neural network (WPRNN) based on wavelet energy entropy (WEE) constraint is proposed. This network transmits previous-level wavelet coefficients and additional shallow coefficient features to capture local details. Besides, the parameter of low- and high-frequency wavelet coefficients within each pyramid level and across pyramid levels is shared. A multi-resolution wavelet pyramid fusion (WPF) module is devised to facilitate information transfer across network pyramid levels. Additionally, a wavelet energy entropy loss is proposed to constrain the reconstruction of wavelet coefficients from the perspective of signal energy distribution. Finally, our method achieves the competitive reconstruction performance with the minimal parameters through an extensive series of experiments conducted on publicly available datasets, which demonstrates its practical utility.

Nonlinear FOPID controller design for pressure regulation of steam condenser via improved metaheuristic algorithm

Shell and tube heat exchangers are pivotal for efficient heat transfer in various industrial processes. Effective control of these structures is essential for optimizing energy usage and ensuring industrial system reliability. In this regard, this study focuses on adopting a fractional-order proportional-integral-derivative (FOPID) controller for efficient control of shell and tube heat exchanger. The novelty of this work lies in the utilization of an enhanced version of cooperation search algorithm (CSA) for FOPID controller tuning, offering a novel approach to optimization. The enhanced optimizer (en-CSA) integrates a control randomization operator, linear transfer function, and adaptive p-best mutation integrated with original CSA. Through rigorous testing on CEC2020 benchmark functions, en-CSA demonstrates robust performance, surpassing other optimization algorithms. Specifically, en-CSA achieves an average convergence rate improvement of 23% and an enhancement in solution accuracy by 17% compared to standard CSAs. Subsequently, en-CSA is applied to optimize the FOPID controller for steam condenser pressure regulation, a crucial aspect of heat exchanger operation. Nonlinear comparative analysis with contemporary optimization algorithms confirms en-CSA's superiority, achieving up to 11% faster settling time and up to 55% reduced overshooting. Additionally, en-CSA improves the steady-state error by 8% and enhances the overall stability margin by 12%.

Enhanced Prairie Dog Optimization with Differential Evolution for solving engineering design problems and network intrusion detection system

This paper introduces a novel hybrid optimization algorithm, PDO-DE, which integrates the Prairie Dog Optimization (PDO) algorithm with the Differential Evolution (DE) strategy. This research aims to develop an algorithm that efficiently addresses complex optimization problems in engineering design and network intrusion detection systems. Our method enhances the PDO's search capabilities by incorporating the DE's principal mechanisms of mutation and crossover, facilitating improved solution exploration and exploitation. We evaluate the effectiveness of the PDO-DE algorithm through rigorous testing on 23 classical benchmark functions, five engineering design problems, and a network intrusion detection system (NIDS). The results indicate that PDO-DE outperforms several state-of-the-art optimization algorithms regarding convergence speed and accuracy, demonstrating its robustness and adaptability across different problem domains. The PDO-DE algorithm's potential applications extend to engineering challenges and cybersecurity issues, where efficient and reliable solutions are critical; for example, the NIDS results show significant results in detection rate, false alarm, and accuracy with 98.1%, 2.4%, and 96%, respectively. The innovative integration of PDO and DE contributes significantly to stochastic optimization and swarm intelligence, offering a promising new tool for tackling diverse optimization problems. In conclusion, the PDO-DE algorithm represents a significant scientific advancement in hybrid optimization techniques, providing a more effective approach for solving real-world problems that require high precision and optimal resource utilization.

Are deep learning classification results obtained on CT scans fair and interpretable?

Following the great success of various deep learning methods in image and object classification, the biomedical image processing society is also overwhelmed with their applications to various automatic diagnosis cases. Unfortunately, most of the deep learning-based classification attempts in the literature solely focus on the aim of extreme accuracy scores, without considering interpretability, or patient-wise separation of training and test data. For example, most lung nodule classification papers using deep learning randomly shuffle data and split it into training, validation, and test sets, causing certain images from the Computed Tomography (CT) scan of a person to be in the training set, while other images of the same person to be in the validation or testing image sets. This can result in reporting misleading accuracy rates and the learning of irrelevant features, ultimately reducing the real-life usability of these models. When the deep neural networks trained on the traditional, unfair data shuffling method are challenged with new patient images, it is observed that the trained models perform poorly. In contrast, deep neural networks trained with strict patient-level separation maintain their accuracy rates even when new patient images are tested. Heat map visualizations of the activations of the deep neural networks trained with strict patient-level separation indicate a higher degree of focus on the relevant nodules. We argue that the research question posed in the title has a positive answer only if the deep neural networks are trained with images of patients that are strictly isolated from the validation and testing patient sets.

CGJO: a novel complex-valued encoding golden jackal optimization

Golden jackal optimization (GJO) is inspired by mundane characteristics and collaborative hunting behaviour, which mimics foraging, trespassing and encompassing, and capturing prey to refresh a jackal's position. However, the GJO has several limitations, such as a slow convergence rate, low computational accuracy, premature convergence, poor solution efficiency, and weak exploration and exploitation. To enhance the global detection ability and solution accuracy, this paper proposes a novel complex-valued encoding golden jackal optimization (CGJO) to achieve function optimization and engineering design. The complex-valued encoding strategy deploys a dual-diploid organization to encode the real and imaginary portions of the golden jackal and converts the dual-dimensional encoding region to the single-dimensional manifestation region, which increases population diversity, restricts search stagnation, expands the exploration area, promotes information exchange, fosters collaboration efficiency and improves convergence accuracy. CGJO not only exhibits strong adaptability and robustness to achieve supplementary advantages and enhance optimization efficiency but also balances global exploration and local exploitation to promote computational precision and determine the best solution. The CEC 2022 test suite and six real-world engineering designs are utilized to evaluate the effectiveness and feasibility of CGJO. CGJO is compared with three categories of existing optimization algorithms: (1) WO, HO, NRBO and BKA are recently published algorithms; (2) SCSO, GJO, RGJO and SGJO are highly cited algorithms; and (3) L-SHADE, LSHADE-EpsSin and CMA-ES are highly performing algorithms. The experimental results reveal that the effectiveness and feasibility of CGJO are superior to those of other algorithms. The CGJO has strong superiority and reliability to achieve a quicker convergence rate, greater computation precision, and greater stability and robustness.

Optimal truss design with MOHO: A multi-objective optimization perspective

This research article presents the Multi-Objective Hippopotamus Optimizer (MOHO), a unique approach that excels in tackling complex structural optimization problems. The Hippopotamus Optimizer (HO) is a novel approach in meta-heuristic methodology that draws inspiration from the natural behaviour of hippos. The HO is built upon a trinary-phase model that incorporates mathematical representations of crucial aspects of Hippo's behaviour, including their movements in aquatic environments, defense mechanisms against predators, and avoidance strategies. This conceptual framework forms the basis for developing the multi-objective (MO) variant MOHO, which was applied to optimize five well-known truss structures. Balancing safety precautions and size constraints concerning stresses on individual sections and constituent parts, these problems also involved competing objectives, such as reducing the weight of the structure and the maximum nodal displacement. The findings of six popular optimization methods were used to compare the results. Four industry-standard performance measures were used for this comparison and qualitative examination of the finest Pareto-front plots generated by each algorithm. The average values obtained by the Friedman rank test and comparison analysis unequivocally showed that MOHO outperformed other methods in resolving significant structure optimization problems quickly. In addition to finding and preserving more Pareto-optimal sets, the recommended algorithm produced excellent convergence and variance in the objective and decision fields. MOHO demonstrated its potential for navigating competing objectives through diversity analysis. Additionally, the swarm plots effectively visualize MOHO's solution distribution of MOHO across iterations, highlighting its superior convergence behaviour. Consequently, MOHO exhibits promise as a valuable method for tackling complex multi-objective structure optimization issues.

Identifying highly-valued bank customers with current accounts based on the frequency and amount of transactions

We hypothesize that highly-valued bank customers with current accounts can be identified by a high frequency of transactions in large amounts of money. To test our hypothesis, we employ machine learning predictive models to real data, including 407851 transactions of 4760 customers with current accounts in a local bank in Jordan. Thus, we exploit three clustering algorithms: density-based spatial clustering of applications with noise, spectral clustering, and ordering points to identify the clustering structure. The two segments of customers (generated from the clustering process) have different transactional characteristics. Our customer behavioral segmentation accuracy is, at best, 0.99 and at least 0.82. Likewise, we build three classification models using our segmented data: a neural network, a support vector machine, and a decision tree. Our predictive models have an accuracy of 0.97 at best and 0.90 at least. Our experimental results confirm that the frequency and amount of transactions of bank customers with current accounts are most likely sufficient indicators for recognizing those customers whom banks highly value. Our predictive models state that the two most critical indicators are the deposit and withdrawal transactions performed on ATMs. In contrast, the least significant indicators are the transactions of credit cards and credit cheques.

An enhanced jellyfish search optimizer for stochastic energy management of multi-microgrids with wind turbines, biomass and PV generation systems considering uncertainty

The energy management (EM) solution of the multi-microgrids (MMGs) is a crucial task to provide more flexibility, reliability, and economic benefits. However, the energy management (EM) of the MMGs became a complex and strenuous task with high penetration of renewable energy resources due to the stochastic nature of these resources along with the load fluctuations. In this regard, this paper aims to solve the EM problem of the MMGs with the optimal inclusion of photovoltaic (PV) systems, wind turbines (WTs), and biomass systems. In this regard, this paper proposed an enhanced Jellyfish Search Optimizer (EJSO) for solving the EM of MMGs for the 85-bus MMGS system to minimize the total cost, and the system performance improvement concurrently. The proposed algorithm is based on the Weibull Flight Motion (WFM) and the Fitness Distance Balance (FDB) mechanisms to tackle the stagnation problem of the conventional JSO technique. The performance of the EJSO is tested on standard and CEC 2019 benchmark functions and the obtained results are compared to optimization techniques. As per the obtained results, EJSO is a powerful method for solving the EM compared to other optimization method like Sand Cat Swarm Optimization (SCSO), Dandelion Optimizer (DO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), and the standard Jellyfish Search Optimizer (JSO). The obtained results reveal that the EM solution by the suggested EJSO can reduce the cost by 44.75% while the system voltage profile and stability are enhanced by 40.8% and 10.56%, respectively.

Boosting prairie dog optimizer for optimal planning of multiple wind turbine and photovoltaic distributed generators in distribution networks considering different dynamic load models

Deploying distributed generators (DGs) supplied by renewable energy resources poses a significant challenge for efficient power grid operation. The proper sizing and placement of DGs, specifically photovoltaics (PVs) and wind turbines (WTs), remain crucial due to the uncertain characteristics of renewable energy. To overcome these challenges, this study explores an enhanced version of a meta-heuristic technique called the prairie dog optimizer (PDO). The modified prairie dogs optimizer (mPDO) incorporates a novel exploration phase inspired by the slime mold algorithm (SMA) food approach. The mPDO algorithm is proposed to analyze the substantial effects of different dynamic load characteristics on the performance of the distribution networks and the designing of the PV-based and WT-based DGs. The optimization problem incorporates various operational constraints to mitigate energy loss in the distribution networks. Further, the study addresses uncertainties related to the random characteristics of PV and WT power outputs by employing appropriate probability distributions. The mPDO algorithm is evaluated using cec2020 benchmark suit test functions and rigorous statistical analysis to mathematically measure its success rate and efficacy while considering different type of optimization problems. The developed mPDO algorithm is applied to incorporate both PV and WT units, individually and simultaneously, into the IEEE 69-bus distribution network. This is achieved considering residential, commercial, industrial, and mixed time-varying voltage-dependent load demands. The efficacy of the modified algorithm is demonstrated using the standard benchmark functions, and a comparative analysis is conducted with the original PDO and other well-known algorithms, utilizing various statistical metrics. The numerical findings emphasize the significant influence of load type and time-varying generation in DG planning. Moreover, the mPDO algorithm beats the alternatives and improves distributed generators' technical advantages across all examined scenarios.

Greater cane rat algorithm (GCRA): A nature-inspired metaheuristic for optimization problems

This paper introduces a new metaheuristic technique known as the Greater Cane Rat Algorithm (GCRA) for addressing optimization problems. The optimization process of GCRA is inspired by the intelligent foraging behaviors of greater cane rats during and off mating season. Being highly nocturnal, they are intelligible enough to leave trails as they forage through reeds and grass. Such trails would subsequently lead to food and water sources and shelter. The exploration phase is achieved when they leave the different shelters scattered around their territory to forage and leave trails. It is presumed that the alpha male maintains knowledge about these routes, and as a result, other rats modify their location according to this information. Also, the males are aware of the breeding season and separate themselves from the group. The assumption is that once the group is separated during this season, the foraging activities are concentrated within areas of abundant food sources, which aids the exploitation. Hence, the smart foraging paths and behaviors during the mating season are mathematically represented to realize the design of the GCR algorithm and carry out the optimization tasks. The performance of GCRA is tested using twenty-two classical benchmark functions, ten CEC 2020 complex functions, and the CEC 2011 real-world continuous benchmark problems. To further test the performance of the proposed algorithm, six classic problems in the engineering domain were used. Furthermore, a thorough analysis of computational and convergence results is presented to shed light on the efficacy and stability levels of GCRA. The statistical significance of the results is compared with ten state-of-the-art algorithms using Friedman's and Wilcoxon's signed rank tests. These findings show that GCRA produced optimal or nearly optimal solutions and evaded the trap of local minima, distinguishing it from the rival optimization algorithms employed to tackle similar problems. The GCRA optimizer source code is publicly available at: https://www.mathworks.com/matlabcentral/fileexchange/165241-greater-cane-rat-algorithm-gcra.

A hybrid swarm intelligence algorithm for region-based image fusion

This paper proposes a novel multi-hybrid algorithm named DHPN, using the best-known properties of dwarf mongoose algorithm (DMA), honey badger algorithm (HBA), prairie dog optimizer (PDO), cuckoo search (CS), grey wolf optimizer (GWO) and naked mole rat algorithm (NMRA). It follows an iterative division for extensive exploration and incorporates major parametric enhancements for improved exploitation operation. To counter the local optima problems, a stagnation phase using CS and GWO is added. Six new inertia weight operators have been analyzed to adapt algorithmic parameters, and the best combination of these parameters has been found. An analysis of the suitability of DHPN towards population variations and higher dimensions has been performed. For performance evaluation, the CEC 2005 and CEC 2019 benchmark data sets have been used. A comparison has been performed with differential evolution with active archive (JADE), self-adaptive DE (SaDE), success history based DE (SHADE), LSHADE-SPACMA, extended GWO (GWO-E), jDE100, and others. The DHPN algorithm is also used to solve the image fusion problem for four fusion quality metrics, namely, edge-based similarity index ( Q A B / F ), sum of correlation difference (SCD), structural similarity index measure (SSIM), and artifact measure ( N A B / F ). The averageQ A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , andN A B / F = 0.006617 shows the best combination of results obtained by DHPN with respect to the existing algorithms such as DCH, CBF, GTF, JSR and others. Experimental and statistical Wilcoxon's and Friedman's tests show that the proposed DHPN algorithm performs significantly better in comparison to the other algorithms under test.

Automated angular measurement for puncture angle using a computer-aided method in ultrasound-guided peripheral insertion

Ultrasound guidance has become the gold standard for obtaining vascular access. Angle information, which indicates the entry angle of the needle into the vein, is required to ensure puncture success. Although various image processing-based methods, such as deep learning, have recently been applied to improve needle visibility, these methods have limitations, in that the puncture angle to the target organ is not measured. We aim to detect the target vessel and puncture needle and to derive the puncture angle by combining deep learning and conventional image processing methods such as the Hough transform. Median cubital vein US images were obtained from 20 healthy volunteers, and images of simulated blood vessels and needles were obtained during the puncture of a simulated blood vessel in four phantoms. The U-Net architecture was used to segment images of blood vessels and needles, and various image processing methods were employed to automatically measure angles. The experimental results indicated that the mean dice coefficients of median cubital veins, simulated blood vessels, and needles were 0.826, 0.931, and 0.773, respectively. The quantitative results of angular measurement showed good agreement between the expert and automatic measurements of the puncture angle with 0.847 correlations. Our findings indicate that the proposed method achieves extremely high segmentation accuracy and automated angular measurements. The proposed method reduces the variability and time required in manual angle measurements and presents the possibility where the operator can concentrate on delicate techniques related to the direction of the needle.

Optimizing AVR system performance via a novel cascaded RPIDD2-FOPI controller and QWGBO approach

Maintaining stable voltage levels is essential for power systems' efficiency and reliability. Voltage fluctuations during load changes can lead to equipment damage and costly disruptions. Automatic voltage regulators (AVRs) are traditionally used to address this issue, regulating generator terminal voltage. Despite progress in control methodologies, challenges persist, including robustness and response time limitations. Therefore, this study introduces a novel approach to AVR control, aiming to enhance robustness and efficiency. A custom optimizer, the quadratic wavelet-enhanced gradient-based optimization (QWGBO) algorithm, is developed. QWGBO refines the gradient-based optimization (GBO) by introducing exploration and exploitation improvements. The algorithm integrates quadratic interpolation mutation and wavelet mutation strategy to enhance search efficiency. Extensive tests using benchmark functions demonstrate the QWGBO's effectiveness in optimization. Comparative assessments against existing optimization algorithms and recent techniques confirm QWGBO's superior performance. In AVR control, QWGBO is coupled with a cascaded real proportional-integral-derivative with second order derivative (RPIDD2) and fractional-order proportional-integral (FOPI) controller, aiming for precision, stability, and quick response. The algorithm's performance is verified through rigorous simulations, emphasizing its effectiveness in optimizing complex engineering problems. Comparative analyses highlight QWGBO's superiority over existing algorithms, positioning it as a promising solution for optimizing power system control and contributing to the advancement of robust and efficient power systems.

Artificial multi-verse optimisation for predicting the effect of ideological and political theory course

Enhancing teaching sufficiency is crucial because low teaching efficiency has always been a widespread issue in ideological and political theory course. Evaluating data on the course is obtained from a freshmen class of 2022 using questionnaires. The data is organised and condensed for mining and analysis. Subsequently, an intelligent artificial multi-verse optimizer (AMVO) method s developed to predict the effect of ideological and political theory course. The proposed AMVO approach was tested against various cutting-edge algorithms to demonstrate its effectiveness and stability on the benchmark functions. The experimental results indicated that AMVO ranked first among the 23 test functions. Furthermore, the binary AMVO enhanced k-nearest neighbour classifier had excellent performance in the art ideological and political theory course in terms of error rate, accuracy, specificity and sensitivity. This model can predict the overall evaluation attitude of freshmen towards the course based on the dataset. In addition, we can further analyse the potential correlations between factors that enhance the intellectual and political content of the course. This model can further refine the evaluation of ideological and political courses by teachers and students in our school, thereby achieving the fundamental goal of moral cultivation.

Algorithm for community security risk assessment and influencing factors analysis by back propagation neural network

This paper aims to accurately assess and effectively manage various security risks in the community and overcome the challenges faced by traditional models in handling large amounts of features and high-dimensional data. Hence, this paper utilizes the back propagation neural network (BPNN) to optimize the security risk assessment model. A key challenge of researching community security risk assessment lies in accurately identifying and predicting a range of potential security threats. These threats may encompass natural disasters, public health crises, accidents, and social security issues. The intricate interplay of these risk factors, combined with the dynamic nature of community environments, presents difficulties for traditional risk assessment methodologies to address effectively. Initially, this paper delves into the factors influencing safety incidents within communities and establishes a comprehensive system of safety risk assessment indicators. Leveraging the adaptable and generalizable nature of the BPNN model, the paper proceeds to optimize the BPNN model, enhancing the security risk assessment model through this optimization. Subsequent comparison experiments with traditional models validate the rationality and effectiveness of the proposed model, with hidden layer nodes set at various levels like 10, 15, 20, 25, 30, and 35. These traditional models include Convolutional Neural Network (CNN), Long Short-Term Memory Network (LSTM), Bidirectional Encoder Representations from Transformers (BERT), Generative Pre-trained Transformer (GPT), and eXtreme Gradient Boosting (XGBOOST). Experimental findings demonstrate that with 20 hidden layer nodes, the optimized model achieves a remarkable final recognition accuracy of 99.1 %. Moreover, the optimized model exhibits significantly lower final function loss compared to models with different node numbers. Increasing the number of hidden layer nodes may diminish the optimized model's fit and accuracy. Comparison with traditional models reveals that the average accuracy of the optimized model in community risk identification reaches 98.5 %, with a maximum accuracy of 99.6 %. This marks an improvement of 9%-11 % in recognition accuracy across various risk factors compared to traditional models. Regarding system response time and resource utilization, the optimized model exhibits a response time ranging from 100 ms to 120 ms and consistently lower resource utilization rates across all scenarios, underscoring its efficiency in community security risk assessment. In conclusion, this experiment sheds light on the underlying mechanisms and patterns of community safety risk formation, offering novel perspectives and methodologies for researching community safety risk assessment. The paper concludes by presenting recommendations and strategies for addressing community safety risks based on experimental analysis.

Applications of nature-inspired metaheuristic algorithms for tackling optimization problems across disciplines

Nature-inspired metaheuristic algorithms are important components of artificial intelligence, and are increasingly used across disciplines to tackle various types of challenging optimization problems. This paper demonstrates the usefulness of such algorithms for solving a variety of challenging optimization problems in statistics using a nature-inspired metaheuristic algorithm called competitive swarm optimizer with mutated agents (CSO-MA). This algorithm was proposed by one of the authors and its superior performance relative to many of its competitors had been demonstrated in earlier work and again in this paper. The main goal of this paper is to show a typical nature-inspired metaheuristic algorithmi, like CSO-MA, is efficient for tackling many different types of optimization problems in statistics. Our applications are new and include finding maximum likelihood estimates of parameters in a single cell generalized trend model to study pseudotime in bioinformatics, estimating parameters in the commonly used Rasch model in education research, finding M-estimates for a Cox regression in a Markov renewal model, performing matrix completion tasks to impute missing data for a two compartment model, and selecting variables optimally in an ecology problem in China. To further demonstrate the flexibility of metaheuristics, we also find an optimal design for a car refueling experiment in the auto industry using a logistic model with multiple interacting factors. In addition, we show that metaheuristics can sometimes outperform optimization algorithms commonly used in statistics.

Efficient parameter extraction of photovoltaic models with a novel enhanced prairie dog optimization algorithm

The growing demand for solar energy conversion underscores the need for precise parameter extraction methods in photovoltaic (PV) plants. This study focuses on enhancing accuracy in PV system parameter extraction, essential for optimizing PV models under diverse environmental conditions. Utilizing primary PV models (single diode, double diode, and three diode) and PV module models, the research emphasizes the importance of accurate parameter identification. In response to the limitations of existing metaheuristic algorithms, the study introduces the enhanced prairie dog optimizer (En-PDO). This novel algorithm integrates the strengths of the prairie dog optimizer (PDO) with random learning and logarithmic spiral search mechanisms. Evaluation against the PDO, and a comprehensive comparison with eighteen recent algorithms, spanning diverse optimization techniques, highlight En-PDO's exceptional performance across different solar cell models and CEC2020 functions. Application of En-PDO to single diode, double diode, three diode, and PV module models, using experimental datasets (R.T.C. France silicon and Photowatt-PWP201 solar cells) and CEC2020 test functions, demonstrates its consistent superiority. En-PDO achieves competitive or superior root mean square error values, showcasing its efficacy in accurately modeling the behavior of diverse solar cells and performing optimally on CEC2020 test functions. These findings position En-PDO as a robust and reliable approach for precise parameter estimation in solar cell models, emphasizing its potential and advancements compared to existing algorithms.

Exercise quantification from single camera view markerless 3D pose estimation

Sports physiotherapists and coaches are tasked with evaluating the movement quality of athletes across the spectrum of ability and experience. However, the accuracy of visual observation is low and existing technology outside of expensive lab-based solutions has limited adoption, leading to an unmet need for an efficient and accurate means to measure static and dynamic joint angles during movement, converted to movement metrics useable by practitioners. This paper proposes a set of pose landmarks for computing frequently used joint angles as metrics of interest to sports physiotherapists and coaches in assessing common strength-building human exercise movements. It then proposes a set of rules for computing these metrics for a range of common exercises (single and double drop jumps and counter-movement jumps, deadlifts and various squats) from anatomical key-points detected using video, and evaluates the accuracy of these using a published 3D human pose model trained with ground truth data derived from VICON motion capture of common rehabilitation exercises. Results show a set of mathematically defined metrics which are derived from the chosen pose landmarks, and which are sufficient to compute the metrics for each of the exercises under consideration. Comparison to ground truth data showed that root mean square angle errors were within 10° for all exercises for the following metrics: shin angle, knee varus/valgus and left/right flexion, hip flexion and pelvic tilt, trunk angle, spinal flexion lower/upper/mid and rib flare. Larger errors (though still all within 15°) were observed for shoulder flexion and ASIS asymmetry in some exercises, notably front squats and drop-jumps. In conclusion, the contribution of this paper is that a set of sufficient key-points and associated metrics for exercise assessment from 3D human pose have been uniquely defined. Further, we found generally very good accuracy of the Strided Transformer 3D pose model in predicting these metrics for the chosen set of exercises from a single mobile device camera, when trained on a suitable set of functional exercises recorded using a VICON motion capture system. Future assessment of generalization is needed.

Uncovering driver genes in breast cancer through an innovative machine learning mutational analysis method

Breast cancer has become a severe public health concern and one of the leading causes of cancer-related death in women worldwide. Several genes and mutations in these genes linked to breast cancer have been identified using sophisticated techniques, despite the fact that the exact cause of breast cancer is still unknown. A commonly used feature for identifying driver mutations is the recurrence of a mutation in patients. Nevertheless, some mutations are more likely to occur than others for various reasons. Sequencing analysis has shown that cancer-driving genes operate across complex networks, often with mutations appearing in a modular pattern. In this work, as a retrospective study, we used TCGA data, which is gathered from breast cancer patients. We introduced a new machine-learning approach to examine gene functionality in networks derived from mutation associations, gene-gene interactions, and graph clustering for breast cancer analysis. These networks have uncovered crucial biological components in critical pathways, particularly those that exhibit low-frequency mutations. The statistical strength of the clinical study is significantly boosted by evaluating the network as a whole instead of just single gene effects. Our method successfully identified essential driver genes with diverse mutation frequencies. We then explored the functions of these potential driver genes and their related pathways. By uncovering low-frequency genes, we shed light on understudied pathways associated with breast cancer. Additionally, we present a novel Monte Carlo-based algorithm to identify driver modules in breast cancer. Our findings highlight the significance and role of these modules in critical signaling pathways in breast cancer, providing a comprehensive understanding of breast cancer development. Materials and implementations are available at: [https://github.com/MahnazHabibi/BreastCancer].

Hippopotamus optimization algorithm: a novel nature-inspired optimization algorithm

The novelty of this article lies in introducing a novel stochastic technique named the Hippopotamus Optimization (HO) algorithm. The HO is conceived by drawing inspiration from the inherent behaviors observed in hippopotamuses, showcasing an innovative approach in metaheuristic methodology. The HO is conceptually defined using a trinary-phase model that incorporates their position updating in rivers or ponds, defensive strategies against predators, and evasion methods, which are mathematically formulated. It attained the top rank in 115 out of 161 benchmark functions in finding optimal value, encompassing unimodal and high-dimensional multimodal functions, fixed-dimensional multimodal functions, as well as the CEC 2019 test suite and CEC 2014 test suite dimensions of 10, 30, 50, and 100 and Zigzag Pattern benchmark functions, this suggests that the HO demonstrates a noteworthy proficiency in both exploitation and exploration. Moreover, it effectively balances exploration and exploitation, supporting the search process. In light of the results from addressing four distinct engineering design challenges, the HO has effectively achieved the most efficient resolution while concurrently upholding adherence to the designated constraints. The performance evaluation of the HO algorithm encompasses various aspects, including a comparison with WOA, GWO, SSA, PSO, SCA, FA, GOA, TLBO, MFO, and IWO recognized as the most extensively researched metaheuristics, AOA as recently developed algorithms, and CMA-ES as high-performance optimizers acknowledged for their success in the IEEE CEC competition. According to the statistical post hoc analysis, the HO algorithm is determined to be significantly superior to the investigated algorithms. The source codes of the HO algorithm are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/160088-hippopotamus-optimization-algorithm-ho .

Designing a medical information diagnosis platform with IoT integration

In order to enhance the operational efficiency of the healthcare industry, this paper investigates a medical information diagnostic platform through the application of swarm and evolutionary algorithms. This paper begins with an analysis of the current development status of medical information diagnostic platforms based on Chat Generative Pre-trained Transformer (ChatGPT) and Internet of Things (IoT) technology. Subsequently, a comprehensive exploration of the advantages and disadvantages of swarm and evolutionary algorithms within the medical information diagnostic platform is presented. Further, the optimization of the swarm algorithm is achieved through reverse learning and Gaussian functions. The rationality and effectiveness of the proposed optimization algorithm are validated through horizontal comparative experiments. Experimental results demonstrate that the optimized model achieves favorable performance at the levels of minimum, average, and maximum algorithm fitness values. Additionally, preprocessing data in a 10 * 10 server configuration enhances the algorithm's fitness values. The minimum fitness value obtained by the optimized algorithm is 3.56, representing a 3 % improvement compared to the minimum value without sorting. In comparative experiments on algorithm stability, the optimized algorithm exhibits the best stability, with further enhancement observed when using sorting algorithms. Therefore, this paper not only provides a new perspective for the field of medical information diagnostics but also offers effective technical support for practical applications in medical information processing.

Mental image reconstruction from human brain activity: Neural decoding of mental imagery via deep neural network-based Bayesian estimation

Visual images observed by humans can be reconstructed from their brain activity. However, the visualization (externalization) of mental imagery is challenging. Only a few studies have reported successful visualization of mental imagery, and their visualizable images have been limited to specific domains such as human faces or alphabetical letters. Therefore, visualizing mental imagery for arbitrary natural images stands as a significant milestone. In this study, we achieved this by enhancing a previous method. Specifically, we demonstrated that the visual image reconstruction method proposed in the seminal study by Shen et al. (2019) heavily relied on low-level visual information decoded from the brain and could not efficiently utilize the semantic information that would be recruited during mental imagery. To address this limitation, we extended the previous method to a Bayesian estimation framework and introduced the assistance of semantic information into it. Our proposed framework successfully reconstructed both seen images (i.e., those observed by the human eye) and imagined images from brain activity. Quantitative evaluation showed that our framework could identify seen and imagined images highly accurately compared to the chance accuracy (seen: 90.7%, imagery: 75.6%, chance accuracy: 50.0%). In contrast, the previous method could only identify seen images (seen: 64.3%, imagery: 50.4%). These results suggest that our framework would provide a unique tool for directly investigating the subjective contents of the brain such as illusions, hallucinations, and dreams.

A method for optimizing text preprocessing and text classification using multiple cycles of learning with an application on shipbrokers emails

Optimizing text preprocessing and text classification algorithms is an important, everyday task in large organizations and companies and it usually involves a labor-intensive and time-consuming effort. For example, the filtering and sorting of a large number of electronic mails (emails) are crucial to keeping track of the received information and converting it automatically into useful and profitable knowledge. Business emails are often unstructured, noisy, and with many abbreviations and acronyms, which makes their handling a challenging procedure. To overcome those challenges, a two-step classification approach is proposed, along with a two-cycle labeling procedure in order to speed up the labeling process. Every step incorporates a heuristic classification approach to assign emails to predefined classes by comparing several classification and text vectorization algorithms. These algorithms are compared and evaluated using the F1 score and balanced accuracy. The implementation of the proposed algorithm is demonstrated in a shipbroker agent operating in Greece with excellent performance, improving organization and administration while reducing expenses.

Smart Resource Allocation in Mobile Cloud Next-Generation Network (NGN) Orchestration with Context-Aware Data and Machine Learning for the Cost Optimization of Microservice Applications

Mobile cloud computing (MCC) provides resources to users to handle smart mobile applications. In MCC, task scheduling is the solution for mobile users' context-aware computation resource-rich applications. Most existing approaches have achieved a moderate service reliability rate due to a lack of instance-centric resource estimations and task offloading, a statistical NP-hard problem. The current intelligent scheduling process cannot address NP-hard problems due to traditional task offloading approaches. To address this problem, the authors design an efficient context-aware service offloading approach based on instance-centric measurements. The revised machine learning model/algorithm employs task adaptation to make decisions regarding task offloading. The proposed MCVS scheduling algorithm predicts the usage rates of individual microservices for a practical task scheduling scheme, considering mobile device time, cost, network, location, and central processing unit (CPU) power to train data. One notable feature of the microservice software architecture is its capacity to facilitate the scalability, flexibility, and independent deployment of individual components. A series of simulation results show the efficiency of the proposed technique based on offloading, CPU usage, and execution time metrics. The experimental results efficiently show the learning rate in training and testing in comparison with existing approaches, showing efficient training and task offloading phases. The proposed system has lower costs and uses less energy to offload microservices in MCC. Graphical results are presented to define the effectiveness of the proposed model. For a service arrival rate of 80%, the proposed model achieves an average 4.5% service offloading rate and 0.18% CPU usage rate compared with state-of-the-art approaches. The proposed method demonstrates efficiency in terms of cost and energy savings for microservice offloading in mobile cloud computing (MCC).

Novel statistical time series data augmentation and machine learning based classification of unobtrusive respiration data for respiration Digital Twin model

Digital Twin (DT), a concept of Healthcare (4.0), represents the subject's biological properties and characteristics in a digital model. DT can help in monitoring respiratory failures, enabling timely interventions, personalized treatment plans to improve healthcare, and decision-support for healthcare professionals. Large-scale implementation of DT technology requires extensive patient data for accurate monitoring and decision-making with Machine Learning (ML) and Deep Learning (DL). Initial respiration data was collected unobtrusively with the ESP32 Wi-Fi Channel State Information (CSI) sensor. Due to limited respiration data availability, the paper proposes a novel statistical time series data augmentation method for generating larger synthetic respiration data. To ensure accuracy and validity in the augmentation method, correlation methods (Pearson, Spearman, and Kendall) are implemented to provide a comparative analysis of experimental and synthetic datasets. Data processing methodologies of denoising (smoothing and filtering) and dimensionality reduction with Principal Component Analysis (PCA) are implemented to estimate a patient's Breaths Per Minute (BPM) from raw respiration sensor data and the synthetic version. The methodology provided the BPM estimation accuracy of 92.3% from raw respiration data. It was observed that out of 27 supervised classifications with k-fold cross-validation, the Bagged Tree ensemble algorithm provided the best ML-supervised classification. In the case of binary-class and multi-class, the Bagged Tree ensemble showed accuracies of 89.2% and 83.7% respectively with combined real and synthetic respiration dataset with the larger synthetic dataset. Overall, this provides a blueprint of methodologies for the development of the respiration DT model.

Revisiting multi-view learning: A perspective of implicitly heterogeneous Graph Convolutional Network

Graph Convolutional Network (GCN) has become a hotspot in graph-based machine learning due to its powerful graph processing capability. Most of the existing GCN-based approaches are designed for single-view data. In numerous practical scenarios, data is expressed through multiple views, rather than a single view. The ability of GCN to model homogeneous graphs is indisputable, while it is insufficient in facing the heterophily property of multi-view data. In this paper, we revisit multi-view learning to propose an implicit heterogeneous graph convolutional network that efficiently captures the heterogeneity of multi-view data while exploiting the powerful feature aggregation capability of GCN. We automatically assign optimal importance to each view when constructing the meta-path graph. High-order cross-view meta-paths are explored based on the obtained graph, and a series of graph matrices are generated. Combining graph matrices with learnable global feature representation to obtain heterogeneous graph embeddings at various levels. Finally, in order to effectively utilize both local and global information, we introduce a graph-level attention mechanism at the meta-path level that allocates private information to each node individually. Extensive experimental results convincingly support the superior performance of the proposed method compared to other state-of-the-art approaches.

A comparative study of GNN and MLP based machine learning for the diagnosis of Alzheimer's Disease involving data synthesis

Alzheimer's Disease (AD) is a neurodegenerative disease that commonly occurs in older people. It is characterized by both cognitive and functional impairment. However, as AD has an unclear pathological cause, it can be hard to diagnose with confidence. This is even more so in the early stage of Mild Cognitive Impairment (MCI). This paper proposes a U-Net based Generative Adversarial Network (GAN) to synthesize fluorodeoxyglucose - positron emission tomography (FDG-PET) from magnetic resonance imaging - T1 weighted imaging (MRI-T1WI) for further usage in AD diagnosis including its early-stage MCI. The experiments have displayed promising results with Structural Similarity Index Measure (SSIM) reaching 0.9714. Furthermore, three types of classifiers are developed, i.e., one Multi-Layer Perceptron (MLP) based classifier, two Graph Neural Network (GNN) based classifiers where one is for graph classification and the other is for node classification. 10-fold cross-validation has been conducted on all trials of experiments for classifier comparison. The performance of these three types of classifiers has been compared with the different input modalities setting and data fusion strategies. The results have shown that GNN based node classifier surpasses the other two types of classifiers, and has achieved the state-of-the-art (SOTA) performance with the best accuracy at 90.18% for 3-class classification, namely AD, MCI and normal control (NC) with the synthesized fluorodeoxyglucose - positron emission tomography (FDG-PET) features fused at the input level. Moreover, involving synthesized FDG-PET as part of the input with proper data fusion strategies has also proved to enhance all three types of classifiers' performance. This work provides support for the notion that machine learning-derived image analysis may be a useful approach to improving the diagnosis of AD.

ShuffleTrans: Patch-wise weight shuffle for transparent object segmentation

Transparent objects widely exist in the world. The task of transparent object segmentation is challenging as the object lacks its own texture. The cue of shape information therefore gets more critical. Most existing methods, however, rely on the mechanism of simple convolution, which is good at local cues and performs weakly on global cues like shape. To solve this problem, an operation named Patch-wise Weight Shuffle is proposed to bring in the global context cue by being combined with the dynamic convolution. A network ShuffleTrans that recognizes shape better is then designed based on this operation. Besides, fitter for this task, two auxiliary modules are presented in ShuffleTrans: a Boundary and Direction Refinement Module which collects two additional information, and a Channel Attention Enhancement Module that assists the above operation. Experiments on four texture-less object segmentation datasets and two normal datasets verify the effectiveness and generality of the method. Especially, the ShuffleTrans achieved 74.93% mIoU on the Trans10k v2 test set, which is more accurate than existing methods.

A Multi-Stage Faster RCNN-Based iSPLInception for Skin Disease Classification Using Novel Optimization

Nowadays, skin cancer is considered a serious disorder in which early identification and treatment of the disease are essential to ensure the stability of the patients. Several existing skin cancer detection methods are introduced by employing deep learning (DL) to perform skin disease classification. Convolutional neural networks (CNNs) can classify melanoma skin cancer images. But, it suffers from an overfitting problem. Therefore, to overcome this problem and to classify both benign and malignant tumors efficiently, the multi-stage faster RCNN-based iSPLInception (MFRCNN-iSPLI) method is proposed. Then, the test dataset is used for evaluating the proposed model performance. The faster RCNN is employed directly to perform image classification. This may heavily raise computation time and network complications. So, the iSPLInception model is applied in the multi-stage classification. In this, the iSPLInception model is formulated using the Inception-ResNet design. For candidate box deletion, the prairie dog optimization algorithm is utilized. We have utilized two skin disease datasets, namely, ISIC 2019 Skin lesion image classification and the HAM10000 dataset for conducting experimental results. The methods' accuracy, precision, recall, and F1 score values are calculated, and the results are compared with the existing methods such as CNN, hybrid DL, Inception v3, and VGG19. With 95.82% accuracy, 96.85% precision, 96.52% recall, and 0.95% F1 score values, the output analysis of each measure verified the prediction and classification effectiveness of the method.

An elite approach to re-design Aquila optimizer for efficient AFR system control

Controlling the air-fuel ratio system (AFR) in lean combustion spark-ignition engines is crucial for mitigating emissions and addressing climate change. In this regard, this study proposes an enhanced version of the Aquila optimizer (ImpAO) with a modified elite opposition-based learning technique to optimize the feedforward (FF) mechanism and proportional-integral (PI) controller parameters for AFR control. Simulation results demonstrate ImpAO's outstanding performance compared to state-of-the-art algorithms. It achieves a minimum cost function value of 0.6759, exhibiting robustness and stability with an average ± standard deviation range of 0.6823±0.0047. The Wilcoxon signed-rank test confirms highly significant differences (p<0.001) between ImpAO and other algorithms. ImpAO also outperforms competitors in terms of elapsed time, with an average of 43.6072 s per run. Transient response analysis reveals that ImpAO achieves a lower rise time of 1.1845 s, settling time of 3.0188 s, overshoot of 0.1679%, and peak time of 4.0371 s compared to alternative algorithms. The algorithm consistently achieves lower error-based cost function values, indicating more accurate control. ImpAO demonstrates superior capabilities in tracking the desired input signal compared to other algorithms. Comparative assessment with recent metaheuristic algorithms further confirms ImpAO's superior performance in terms of transient response metrics and error-based cost functions. In summary, the simulation results provide strong evidence of the exceptional performance and effectiveness of the proposed ImpAO algorithm. It establishes ImpAO as a reliable and superior solution for optimizing the FF mechanism-supported PI controller for the AFR system, surpassing state-of-the-art algorithms and recent metaheuristic optimizers.

Online view enhancement for exploration inside medical volumetric data using virtual reality

BACKGROUND AND OBJECTIVE

Medical image visualization is an essential tool for conveying anatomical information. Ray-casting-based volume rendering is commonly used for generating visualizations of raw medical images. However, exposing a target area inside the skin often requires manual tuning of transfer functions or segmentation of original images, as preset parameters in volume rendering may not work well for arbitrary scanned data. This process is tedious and unnatural. To address this issue, we propose a volume visualization system that enhances the view inside the skin, enabling flexible exploration of medical volumetric data using virtual reality.

METHODS

In our proposed system, we design a virtual reality interface that allows users to walk inside the data. We introduce a view-dependent occlusion weakening method based on geodesic distance transform to support this interaction. By combining these methods, we develop a virtual reality system with intuitive interactions, facilitating online view enhancement for medical data exploration and annotation inside the volume.

RESULTS

Our rendering results demonstrate that the proposed occlusion weakening method effectively weakens obstacles while preserving the target area. Furthermore, comparative analysis with other alternative solutions highlights the advantages of our method in virtual reality. We conducted user studies to evaluate our system, including area annotation and line drawing tasks. The results showed that our method with enhanced views achieved 47.73% and 35.29% higher accuracy compared to the group with traditional volume rendering. Additionally, subjective feedback from medical experts further supported the effectiveness of the designed interactions in virtual reality.

CONCLUSIONS

We successfully address the occlusion problems in the exploration of medical volumetric data within a virtual reality environment. Our system allows for flexible integration of scanned medical volumes without requiring extensive manual preprocessing. The results of our user studies demonstrate the feasibility and effectiveness of walk-in interaction for medical data exploration.

A hierarchical multi-leadership sine cosine algorithm to dissolving global optimization and data classification: The COVID-19 case study

The Sine Cosine Algorithm (SCA) is an outstanding optimizer that is appreciably used to dissolve complicated real-world problems. Nevertheless, this algorithm lacks sufficient population diversification and a sufficient balance between exploration and exploitation. So, effective techniques are required to tackle the SCA's fundamental shortcomings. Accordingly, the present paper suggests an improved version of SCA called Hierarchical Multi-Leadership SCA (HMLSCA) which uses an effective hierarchical multi-leadership search mechanism to lead the search process on multiple paths. The efficiency of the HMLSCA has been appraised and compared with a set of famous metaheuristic algorithms to dissolve the classical eighteen benchmark functions and thirty CEC 2017 test suites. The results demonstrate that the HMLSCA outperforms all compared algorithms and that the proposed algorithm provided a promising efficiency. Moreover, the HMLSCA was applied to handle the medicine data classification by optimizing the support vector machine's (SVM) parameters and feature weighting in eight datasets. The experiential outcomes verify the productivity of the HMLSCA with the highest classification accuracy and a gain scoring 1.00 Friedman mean rank versus the other evaluated metaheuristic algorithms. Furthermore, the proposed algorithm was used to diagnose COVID-19, in which it attained the topmost accuracy of 98% in diagnosing the infection on the COVID-19 dataset, which proves the performance of the proposed search strategy.

A Novel Prairie Dog-Based Meta-Heuristic Optimization Algorithm for Improved Control, Better Transient Response, and Power Quality Enhancement of Hybrid Microgrids

The growing demand for electricity driven by population growth and industrialization is met by integrating hybrid renewable energy sources (HRESs) into the grid. HRES integration improves reliability, reduces losses, and addresses power quality issues for safe and effective microgrid (MG) operation, requiring efficient controllers. In this regard, this article proposes a prairie dog optimization (PDO) algorithm for the photovoltaic (PV)-, fuel cell (FC)-, and battery-based HRESs designed in MATLAB/Simulink architecture. The proposed PDO method optimally tunes the proportional integral (PI) controller gain parameters to achieve effective compensation of load demand and mitigation of PQ problems. The MG system has been applied to various intentional PQ issues such as swell, unbalanced load, oscillatory transient, and notch conditions to study the response of the proposed PDO controller. For evaluating the efficacy of the proposed PDO algorithm, the simulation results obtained are compared with those of earlier popular methodologies utilized in the current literature such as bee colony optimization (BCO), thermal exchange optimization, and PI techniques. A detailed analysis of the results found emphasizes the efficiency, robustness, and potential of the suggested PDO controller in significantly improving the overall system operation by minimizing the THD, improving the control of active and reactive power, enhancing the power factor, lowering the voltage deviation, and keeping the terminal voltage, DC-link voltage, grid voltage, and grid current almost constant in the event of PQ fault occurrence. As a result, the proposed PDO method paves the way for real-time employment in the MG system.

An improved multi-strategy beluga whale optimization for global optimization problems

This paper presents an improved beluga whale optimization (IBWO) algorithm, which is mainly used to solve global optimization problems and engineering problems. This improvement is proposed to solve the imbalance between exploration and exploitation and to solve the problem of insufficient convergence accuracy and speed of beluga whale optimization (BWO). In IBWO, we use a new group action strategy (GAS), which replaces the exploration phase in BWO. It was inspired by the group hunting behavior of beluga whales in nature. The GAS keeps individual belugas whales together, allowing them to hide together from the threat posed by their natural enemy, the tiger shark. It also enables the exchange of location information between individual belugas whales to enhance the balance between local and global lookups. On this basis, the dynamic pinhole imaging strategy (DPIS) and quadratic interpolation strategy (QIS) are added to improve the global optimization ability and search rate of IBWO and maintain diversity. In a comparison experiment, the performance of the optimization algorithm (IBWO) was tested by using CEC2017 and CEC2020 benchmark functions of different dimensions. Performance was analyzed by observing experimental data, convergence curves, and box graphs, and the results were tested using the Wilcoxon rank sum test. The results show that IBWO has good optimization performance and robustness. Finally, the applicability of IBWO to practical engineering problems is verified by five engineering problems.

A Comprehensive Survey on Aquila Optimizer

Aquila Optimizer (AO) is a well-known nature-inspired optimization algorithm (NIOA) that was created in 2021 based on the prey grabbing behavior of Aquila. AO is a population-based NIOA that has demonstrated its effectiveness in the field of complex and nonlinear optimization in a short period of time. As a result, the purpose of this study is to provide an updated survey on the topic. This survey accurately reports on the designed enhanced AO variations and their applications. In order to properly assess AO, a rigorous comparison between AO and its peer NIOAs is conducted over mathematical benchmark functions. The experimental results show the AO provides competitive outcomes.

An improved golden jackal optimization for multilevel thresholding image segmentation

Aerial photography is a long-range, non-contact method of target detection technology that enables qualitative or quantitative analysis of the target. However, aerial photography images generally have certain chromatic aberration and color distortion. Therefore, effective segmentation of aerial images can further enhance the feature information and reduce the computational difficulty for subsequent image processing. In this paper, we propose an improved version of Golden Jackal Optimization, which is dubbed Helper Mechanism Based Golden Jackal Optimization (HGJO), to apply multilevel threshold segmentation to aerial images. The proposed method uses opposition-based learning to boost population diversity. And a new approach to calculate the prey escape energy is proposed to improve the convergence speed of the algorithm. In addition, the Cauchy distribution is introduced to adjust the original update scheme to enhance the exploration capability of the algorithm. Finally, a novel "helper mechanism" is designed to improve the performance for escape the local optima. To demonstrate the effectiveness of the proposed algorithm, we use the CEC2022 benchmark function test suite to perform comparison experiments. the HGJO is compared with the original GJO and five classical meta-heuristics. The experimental results show that HGJO is able to achieve competitive results in the benchmark test set. Finally, all of the algorithms are applied to the experiments of variable threshold segmentation of aerial images, and the results show that the aerial photography images segmented by HGJO beat the others. Noteworthy, the source code of HGJO is publicly available at https://github.com/Vang-z/HGJO.

Modified reptile search algorithm with multi-hunting coordination strategy for global optimization problems

The reptile search algorithm (RSA) is a bionic algorithm proposed by Abualigah. et al. in 2020. RSA simulates the whole process of crocodiles encircling and catching prey. Specifically, the encircling stage includes high walking and belly walking, and the hunting stage includes hunting coordination and cooperation. However, in the middle and later stages of the iteration, most search agents will move towards the optimal solution. However, if the optimal solution falls into local optimum, the population will fall into stagnation. Therefore, RSA cannot converge when solving complex problems. To enable RSA to solve more problems, this paper proposes a multi-hunting coordination strategy by combining Lagrange interpolation and teaching-learning-based optimization (TLBO) algorithm's student stage. Multi-hunting cooperation strategy will make multiple search agents coordinate with each other. Compared with the hunting cooperation strategy in the original RSA, the multi-hunting cooperation strategy has been greatly improved RSA's global capability. Moreover, considering RSA's weak ability to jump out of the local optimum in the middle and later stages, this paper adds the Lens pposition-based learning (LOBL) and restart strategy. Based on the above strategy, a modified reptile search algorithm with a multi-hunting coordination strategy (MRSA) is proposed. To verify the above strategies' effectiveness for RSA, 23 benchmark and CEC2020 functions were used to test MRSA's performance. In addition, MRSA's solutions to six engineering problems reflected MRSA's engineering applicability. It can be seen from the experiment that MRSA has better performance in solving test functions and engineering problems.

WG-ICRN: Protein 8-state secondary structure prediction based on Wasserstein generative adversarial networks and residual networks with Inception modules

Protein secondary structure is the basis of studying the tertiary structure of proteins, drug design and development, and the 8-state protein secondary structure can provide more adequate protein information than the 3-state structure. Therefore, this paper proposes a novel method WG-ICRN for predicting protein 8-state secondary structures. First, we use the Wasserstein generative adversarial network (WGAN) to extract protein features in the position-specific scoring matrix (PSSM). The extracted features are combined with PSSM into a new feature set of WG-data, which contains richer feature information. Then, we use the residual network (ICRN) with Inception to further extract the features in WG-data and complete the prediction. Compared with the residual network, ICRN can reduce parameter calculations and increase the width of feature extraction to obtain more feature information. We evaluated the prediction performance of the model using six datasets. The experimental results show that the WGAN has excellent feature extraction capabilities, and ICRN can further improve network performance and improve prediction accuracy. Compared with four popular models, WG-ICRN achieves better prediction performance.

An Improved Gradient-Based Optimization Algorithm for Solving Complex Optimization Problems

In this paper, an improved gradient-based optimizer (IGBO) is proposed with the target of improving the performance and accuracy of the algorithm for solving complex optimization and engineering problems. The proposed IGBO has the added features of adjusting the best solution by adding inertia weight, fast convergence rate with modified parameters, as well as avoiding the local optima using a novel functional operator (G). These features make it feasible for solving the majority of the nonlinear optimization problems which is quite hard to achieve with the original version of GBO. The effectiveness and scalability of IGBO are evaluated using well-known benchmark functions. Moreover, the performance of the proposed algorithm is statistically analyzed using ANOVA analysis, and Holm–Bonferroni test. In addition, IGBO was assessed by solving well-known real-world problems. The results of benchmark functions show that the IGBO is very competitive, and superior compared to its competitors in finding the optimal solutions with high convergence and coverage. The results of the studied real optimization problems prove the superiority of the proposed algorithm in solving real optimization problems with difficult and indefinite search domains.

Improved Reptile Search Algorithm by Salp Swarm Algorithm for Medical Image Segmentation

This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding, called RSA-SSA. The proposed method introduces a better search space to find the optimal solution at each iteration. However, we proposed RSA-SSA to avoid the searching problem in the same area and determine the optimal multi-level thresholds. The obtained solutions by the proposed method are represented using the image histogram. The proposed RSA-SSA employed Otsu's variance class function to get the best threshold values at each level. The performance measure for the proposed method is valid by detecting fitness function, structural similarity index, peak signal-to-noise ratio, and Friedman ranking test. Several benchmark images of COVID-19 validate the performance of the proposed RSA-SSA. The results showed that the proposed RSA-SSA outperformed other metaheuristics optimization algorithms published in the literature.

Intelligent decision support tool for optimizing stochastic inventory systems under uncertainty

Pricing and production policies play a key role in ensuring the added value of supply chain systems. For perishable inventory management, the pricing and production lines must be manipulated dynamically since several uncertainties are involved in the system’s behavior. This study discusses the impact of dynamic pricing and production policies on an uncertain stochastic inventory system with perishable products. The mathematical model of the inventory management system under external disturbance is formulated using a continuous differential equation in which the price and production rates are considered as control factors to optimize total profits, which is described as an objective function. An analytical solution for the optimal pricing and production rate was obtained using the Hamilton-Jacobi-Bellman equation. The unknown disturbance was approximated using an intelligent approach called radial basis function neural network. Finally, extensive numerical simulations were presented to validate the theoretical results and optimization solutions (including the efficiency of the approximation of the unknown disturbance) for the dynamic pricing and production management strategy of an uncertain stochastic inventory system against volatile markets. The performance of the proposed method was analyzed under different stock level conditions, which highlighted the importance of keeping the inventory levels at an optimal range to ensure the profitability of business operations. This management strategy can assist a business with solutions for inventory policies while supporting decision-making processes to facilitate coping with production management disruptions.

Velocity pausing particle swarm optimization: a novel variant for global optimization

Particle swarm optimization (PSO) is one of the most well-regard metaheuristics with remarkable performance when solving diverse optimization problems. However, PSO faces two main problems that degrade its performance: slow convergence and local optima entrapment. In addition, the performance of this algorithm substantially degrades on high-dimensional problems. In the classical PSO, particles can move in each iteration with either slower or faster speed. This work proposes a novel idea called velocity pausing where particles in the proposed velocity pausing PSO (VPPSO) variant are supported by a third movement option that allows them to move with the same velocity as they did in the previous iteration. As a result, VPPSO has a higher potential to balance exploration and exploitation. To avoid the PSO premature convergence, VPPSO modifies the first term of the PSO velocity equation. In addition, the population of VPPSO is divided into two swarms to maintain diversity. The performance of VPPSO is validated on forty three benchmark functions and four real-world engineering problems. According to the Wilcoxon rank-sum and Friedman tests, VPPSO can significantly outperform seven prominent algorithms on most of the tested functions on both low- and high-dimensional cases. Due to its superior performance in solving complex high-dimensional problems, VPPSO can be applied to solve diverse real-world optimization problems. Moreover, the velocity pausing concept can be easily integrated with new or existing metaheuristic algorithms to enhance their performances. The Matlab code of VPPSO is available at: https://uk.mathworks.com/matlabcentral/fileexchange/119633-vppso.

Protein secondary structure prediction based on Wasserstein generative adversarial networks and temporal convolutional networks with convolutional block attention modules

As an important task in bioinformatics, protein secondary structure prediction (PSSP) is not only beneficial to protein function research and tertiary structure prediction, but also to promote the design and development of new drugs. However, current PSSP methods cannot sufficiently extract effective features. In this study, we propose a novel deep learning model WGACSTCN, which combines Wasserstein generative adversarial network with gradient penalty (WGAN-GP), convolutional block attention module (CBAM) and temporal convolutional network (TCN) for 3-state and 8-state PSSP. In the proposed model, the mutual game of generator and discriminator in WGAN-GP module can effectively extract protein features, and our CBAM-TCN local extraction module can capture key deep local interactions in protein sequences segmented by sliding window technique, and the CBAM-TCN long-range extraction module can further capture the key deep long-range interactions in sequences. We evaluate the performance of the proposed model on seven benchmark datasets. Experimental results show that our model exhibits better prediction performance compared to the four state-of-the-art models. The proposed model has strong feature extraction ability, which can extract important information more comprehensively.

Gradient-Based Optimizer (GBO): A Review, Theory, Variants, and Applications

This paper introduces a comprehensive survey of a new population-based algorithm so-called gradient-based optimizer (GBO) and analyzes its major features. GBO considers as one of the most effective optimization algorithm where it was utilized in different problems and domains, successfully. This review introduces set of related works of GBO where distributed into; GBO variants, GBO applications, and evaluate the efficiency of GBO compared with other metaheuristic algorithms. Finally, the conclusions concentrate on the existing work on GBO, showing its disadvantages, and propose future works. The review paper will be helpful for the researchers and practitioners of GBO belonging to a wide range of audiences from the domains of optimization, engineering, medical, data mining and clustering. As well, it is wealthy in research on health, environment and public safety. Also, it will aid those who are interested by providing them with potential future research.