Search Results (4,385)

Background/Objectives: Oral cancer is one of the most common types of cancer, with high mortality rates if not detected early. Traditional diagnostic methods based on clinical examination rely on experience, leading to delays in early and reliable diagnosis. In recent years, medical imaging and AI-based computer-aided diagnostic systems have shown promising results in the automated identification of oral cancer. In particular, the efficient management of high-dimensional feature spaces in machine learning and deep learning approaches directly impacts classification performance. In this context, metaheuristic-based feature selection technics is a critical component because of eliminating redundant and irrelevant features. To address these challenges, this study proposes a metaheuristic-based feature selection method to reduce feature dimensionality and enhance the classification performance of oral cancer detection. Methods: This study proposes an improved Honey Badger Algorithm-based feature selection approach for the automated detection of oral cancer. In the proposed method, the distance vector used in the HBA method has been redefined to improve the balance between exploration and exploitation. Additionally, a new Cauchy mutation-based migration strategy was integrated into the proposed method to increase diversity in the search space and avoid getting stuck in local minima. The continuous-valued iHBA method was discretized with a modified sin–cos transfer function for feature selection. Oral cancer images were filtered using the CLAHE method, and after extracting deep features with the ResNet50 architecture, the proposed metaheuristic-based method was used to select discriminative features. Results: The proposed method was first tested for reliability and limitations through repeated runs on problems with different characteristics, such as unimodal and multimodal classical test functions. Then, the method was applied to extract significant features for oral cancer detection using a Histopathological Imaging Database containing 1224 histopathological oral tissue images at 100× and 400× magnification levels from 230 patients. The proposed approach was assessed in terms of accuracy, precision, recall, F1-score, and convergence curves in comparison with various classical feature selection techniques, such as wrapper-based, filter-based, and embedded-based methods, as well as other metaheuristic-based methods. The experimental results demonstrated that the suggested strategy outperformed both traditional feature selection techniques and alternative metaheuristic approaches. Conclusions: The effectiveness of the proposed method in improving diagnostic accuracy was evaluated through comprehensive experimental analyses. The obtained findings show that the proposed iHBA-based feature selection approach can reduce feature dimensionality, eliminate redundant and irrelevant features, and improve the classification performance of oral cancer detection. Therefore, the proposed method provides an effective and competitive computer-aided diagnostic framework for the automated classification of histopathological oral cancer images. Full article

3D magnetotelluric (MT) inversion based on the Gauss–Newton (GN) framework plays an important role in deep mineral exploration by imaging subsurface electrical conductivity structures. However, large-scale 3D MT inversion remains computationally expensive due to the high cost of sensitivity-matrix construction. To address this challenge, we develop a stochastic Gauss–Newton (SGN) framework that reduces computational cost through random data subsampling while preserving the practical convergence behavior of GN inversion. In the proposed framework, only a randomly selected subset of data is used to approximate the GN search direction. By exploiting a key property of MT forward modelling, namely that responses at all receivers are obtained simultaneously for each frequency, the line search is performed using the full dataset, ensuring stable convergence of the inversion process. The SGN framework is validated using both a synthetic multiblock model and a field dataset from the Akebasitao area in Xinjiang, China. The recovered models remain highly consistent with those obtained using conventional full-data Gauss–Newton inversion across a wide range of sampling ratios. For the synthetic example, reducing the sampling ratio from 100% to 10% decreases peak memory consumption from approximately 433 GB to 242 GB and reduces runtime from 86.8 h to 23.9 h while maintaining comparable inversion quality. Similar computational savings are achieved for the field-data inversion. The field application successfully recovers the major conductive structures along the margins of the intrusion that are associated with hydrothermal alteration and fluid activity, highlighting the capability of SGN to delineate geologically meaningful targets relevant to deep mineral exploration. These results demonstrate that SGN provides an efficient and scalable approach for large-scale 3D MT inversion. Full article

The Graduate Student Evolutionary Algorithm (GSEA) has demonstrated promising optimization capability in several engineering tasks; however, its performance may deteriorate when dealing with high-dimensional and complex multimodal problems due to insufficient adaptive search behavior, weak diversity preservation, and stagnation during later optimization stages. To alleviate these limitations, this paper proposes a Multi-Strategy Improved Graduate Student Evolutionary Algorithm (MIGSEA) for numerical optimization and artistic image multi-threshold segmentation. First, an adaptive mentor-guided learning mechanism is introduced to dynamically regulate the influence of mentors and peers throughout the optimization process, enabling a more effective transition from global exploration to local exploitation. Second, an elite–random cooperative learning strategy is designed to combine high-quality solution guidance with stochastic perturbation, thereby improving population diversity and enhancing the ability to escape local optima. Third, a stagnation-aware local refinement mechanism is developed to activate adaptive neighborhood search when the optimization process becomes trapped, which further accelerates convergence and improves solution precision. To verify the effectiveness of the proposed algorithm, MIGSEA is evaluated on the IEEE CEC2017 and CEC2020 benchmark suites and compared with 11 advanced metaheuristic algorithms under identical experimental conditions. Experimental results demonstrate that MIGSEA achieves competitive optimization accuracy, convergence speed, robustness, and statistical superiority in most benchmark functions. Furthermore, MIGSEA is applied to Otsu-based artistic image multi-threshold segmentation using multiple benchmark images with different threshold levels. Quantitative evaluation based on PSNR, FSIM, and SSIM, together with visual analysis, confirms that the proposed method can generate more accurate and visually consistent segmentation results than existing competitors. Overall, the proposed MIGSEA provides an effective and robust optimization framework for both benchmark optimization and practical image segmentation applications. Full article

Background/Objectives: The double-strand break repair protein MRE11 forms the core of the MRE11/RAD50/NBS1 (MRN) complex. Cancers with reduced MRE11 expression have been suggested to be more sensitive to radio-chemotherapy and may be subject to synthetic lethality. The aim of this study was to assess the prevalence of MRE11 deficiency and the potential role and clinical significance of elevated and/or reduced MRE11 expression in human cancer. Methods: A tissue microarray containing 14,966 samples from 134 different tumor entities was analyzed for MRE11 by immunohistochemistry. Results: In normal tissues, strong nuclear MRE11 staining occurred in almost all cell types. In cancers, nuclear MRE11 staining was strong in 11,797 (91.0%), moderate in 1018 (7.9%), weak in 86 (0.7%), and completely absent (MRE11 deficiency) in 55 (0.4%) of 12,956 informative tumor samples. Only six tumor entities had more than one MRE11-deficient cases including hepatocellular carcinoma (9 of 193), intestinal type gastric adenocarcinoma (4 of 208), endometrioid endometrial carcinoma (5 of 268), pulmonary adenocarcinoma (2 of 165), colorectal adenocarcinoma (CRC, 16 of 2183), and clear cell renal cell carcinoma (ccRCC, 7 of 1011). Reduced MRE11 staining was associated with mismatch repair deficiency (dMMR) in CRC and in gastric adenocarcinoma (p < 0.0001 each), advanced pT stage (p = 0.0003) and L1 status (p = 0.0019) in testicular seminoma, high grade (p < 0.05), advanced pT (p < 0.0001), and high UICC stage (p = 0.0014) in ccRCC, advanced pT stage in high-grade serous ovarian carcinoma (p = 0.0396), and nodal metastases in papillary thyroid cancer (p = 0.0332). Conclusions: MRE11 is highly expressed in most cancers. Reduced MRE11 expression is associated with aggressive phenotype in multiple cancer types. The potential to exploit MRE11 deficiency as a target for synthetic lethality deserves to be further explored. Full article

Structural static testing is paramount for validating the structural integrity of critical aerospace components. However, conventional test rigs are often constrained to fixed loading axes and frequently induce parasitic torques. Accurate reproduction of aero-engine pylon flight loads therefore requires a mechanism that combines omnidirectional vector loading, high stiffness, and efficient force transmission. Achieving these coupled requirements is primarily a geometric synthesis problem, yet the associated workspace, stiffness, and load–capacity indices are nonlinear, mutually coupled, and expensive to evaluate over dense pose samples. To address this optimization bottleneck, this work develops a task-specific 6-UPS loading mechanism and a bio-inspired sensitivity-weighted NSGA-II algorithm for its geometric synthesis. Inspired by gene/locus-specific heterogeneity in biological evolution, the algorithm assigns variable-wise search intensities according to design-variable sensitivities, which are estimated using Multivariate Adaptive Regression Splines (MARS). In this way, influential design genes receive stronger local exploitation, whereas less sensitive ones retain broader exploration. Numerical simulations demonstrate that the proposed approach reduces computation time from about 30 h to 3 h relative to direct optimization with the baseline NSGA-II, while simultaneously improving workspace, stiffness, and load-carrying capacity. A hybrid physical prototype was further tested under 240 loaded pose conditions; the system maintained force magnitude errors below 0.64% (63.42 N) and directional deviations below 1.15°. These results support the efficacy of the proposed bio-inspired optimization-based design methodology for high-fidelity static testing of aero-engine pylons under the adopted hybrid setup. Full article

With the deep integration of artificial intelligence and big data, intelligent optimization algorithms have become key tools for solving many complex problems. However, as problem scale and complexity grow rapidly, the performance of traditional algorithms often faces significant challenges. The Teaching Learning Based Optimization algorithm has attracted widespread attention for its simple structure, few parameters, and high solution efficiency, and has been successfully applied across various engineering and scientific fields. Nevertheless, when dealing with high-dimensional, multimodal global optimization problems and real-world applications, the standard Teaching Learning Based Optimization still exhibits certain limitations, such as reduced accuracy of the optimal solution due to insufficient initial population diversity, and difficulty in escaping local optima caused by premature convergence. To address these issues, this paper proposes an Improved Teaching Learning Based Optimization algorithm. The improved ITLBO upgrades original TLBO from three perspectives: first, a population interaction strategy combining chaotic disturbance and Gaussian mutation is designed to enrich initial population diversity; second, bipolar cooperative search utilizing dynamic weighting of optimal and worst individuals balances global exploration and local exploitation to avoid premature convergence; third, oscillatory random mapping learning with sinusoidal oscillation factor periodically perturbs individuals to continuously replenish population diversity in iterations. Numerical results show that the proposed method exhibits superior convergence performance and stability on classical global optimization benchmarks. Furthermore, the algorithm is applied to practical cloud resource scheduling problems, and experimental outcomes verify that ITLBO improves solution accuracy by approximately one order of magnitude over original TLBO and reduces small-scale cloud scheduling cost by 12% while achieving preferable robustness. Full article

Hyperspectral imaging (HSI) provides rich spatial and spectral information for remote sensing, mineral exploration, and biomedical analysis, but its limited spatial resolution and sensor imperfections lead to blurred, noisy, and mixed-pixel observations. Addressing these degradations jointly—rather than sequentially—has been shown to improve physical interpretability, yet existing joint deblurring–unmixing methods rely primarily on hand-crafted regularizers that do not fully exploit spatial–spectral structure. Meanwhile, recent plug-and-play (PnP) approaches applied to HSI leverage deep priors but focus solely on either deconvolution or unmixing in isolation. To bridge this gap, we formulate the joint inverse problem of hyperspectral deblurring and spectral unmixing and propose, to our knowledge, the first plug-and-play framework tailored for this coupled task using the Alternating Direction Method of Multipliers (ADMM) and a pretrained deep denoiser (DnCNN) as an implicit PnP prior. Our method uses the natural splitting properties of ADMM to separate a physics-driven subproblem that enforces fidelity to the hyperspectral forward model, which includes linear mixing and blur under a linear, space-invariant convolution approximation, from the data-driven prior step. This synergy of model-based fidelity and learned spatial prior enables more accurate abundance estimates than those obtained with approaches relying solely on analytical regularizers. Experimental results on real hyperspectral datasets demonstrate that the proposed Plug-and-Play Joint Deconvolution and Unmixing (PnP-JDU) method outperforms conventional unmixing baselines, stand-alone PnP unmixing methods, and the Deblurring and Sparse Unmixing via the Alternating Direction Method with Total Variation (DSUnADM-TV) baseline in reconstruction and abundance accuracy metrics. Across the tested datasets and imaging conditions, PnP-JDU achieves lower RMSE, higher PSNR, lower reconstruction and abundance errors, and lower SAD values, while preserving fine spatial details and producing physically meaningful abundance maps. Full article

As the complexity, scale, and nonlinearity of modern engineering optimization problems continue to increase, traditional optimization algorithms face significant challenges in achieving high solution accuracy, fast convergence, and robust performance. To address these issues, this paper proposes a Rural Tourism Migration-based Improved Equilibrium Optimizer (RTM-IEO), aiming to enhance the global search capability and adaptive balance between exploration and exploitation. Specifically, an adaptive lens imaging opposition-based learning strategy is introduced to effectively expand the search space and maintain population diversity. A dynamic elite-guided elimination mechanism is designed to strengthen exploitation capability and accelerate convergence by reconstructing inferior individuals using high-quality solutions. In addition, a multi-stage rural tourism migration strategy is developed to dynamically regulate the search behavior across different optimization phases, enabling a more flexible and efficient search process. The effectiveness of the proposed algorithm is comprehensively validated on the CEC2021 and CEC2022 benchmark suites, where RTM-IEO demonstrates superior performance in terms of convergence accuracy, convergence speed, and robustness compared with several representative state-of-the-art algorithms. The statistical superiority of the proposed method is further confirmed through Friedman mean ranking and Wilcoxon rank-sum tests. To further evaluate its practical applicability, RTM-IEO is applied to the sustainable economic dispatch problem of a microgrid integrating renewable energy sources, including wind power and photovoltaic generation, along with energy storage systems and controllable units. The optimization objective simultaneously considers economic cost minimization and sustainable operation requirements, such as improving renewable energy utilization and reducing dependence on fossil-fuel-based generation. Experimental results indicate that the proposed method achieves a significant reduction in daily operating cost (exceeding 52% compared with benchmark algorithms), while effectively promoting low-carbon energy utilization and enhancing overall system sustainability. Overall, the proposed RTM-IEO provides an efficient and reliable optimization framework for addressing complex global optimization problems, particularly in scenarios requiring a coordinated balance between economic performance and sustainable development. Full article

Complex optimization problems are widely encountered in engineering design, intelligent manufacturing, communication systems, and wireless sensor network deployment. However, the original Enterprise Development Optimization Algorithm (EDOA) still suffers from insufficient population diversity, weak search guidance, and limited adaptability in balancing exploration and exploitation when solving high-dimensional and multimodal optimization problems. To address these issues, this paper proposes a Multi-Strategy Improved Enterprise Development Optimization Algorithm (MIEDOA). First, a Strategic Diversification Initialization (SDI) strategy is developed by integrating Sobol sequence sampling, random initialization, and Gaussian perturbation to improve the diversity and distribution quality of the initial population. Second, an Organizational Synergy Learning (OSL) mechanism is introduced to enhance search guidance through the collaborative utilization of elite information, population mean information, and peer interaction. Third, an Adaptive Governance with Feedback Regulation (AGFR) strategy is designed to dynamically regulate the exploration–exploitation behavior according to the current population fitness state. The proposed MIEDOA is evaluated on the CEC2017 and CEC2020 benchmark suites and compared with representative EDOA variants, CEC winner algorithms, and other advanced optimization methods. The experimental results indicate that MIEDOA generally achieves competitive performance in terms of solution quality, convergence behavior, and robustness across different benchmark scenarios. In addition, strategy effectiveness analysis, parameter sensitivity analysis, and statistical tests further provide evidence supporting the effectiveness of the proposed strategies. Finally, MIEDOA is applied to a three-dimensional wireless sensor network deployment problem. The results suggest that the proposed algorithm can obtain competitive deployment solutions and satisfactory coverage performance under different node scales, demonstrating its potential applicability to practical engineering optimization problems. Full article

This review highlights the recent advances in the synthesis of 1,4-diazatriphenylenes and their various structural analogs. It focuses on several methodologies, including condensation reactions and intramolecular cyclizations of 2,3-di(het)aryl-substituted pyrazine derivatives. These methods exploit either oxidative photocyclization (the Mallory reaction), intramolecular cyclodehydrogenation (the Scholl reaction), or intramolecular S_N^H reactions (nucleophilic aromatic substitution of hydrogen) involving 2-bis(het)aryl-substituted 1,4-diazine derivatives. Additionally, the review explores the potential applications of these compounds as fluorescent and/or semiconducting materials in organic electronics, as well as their role in coordination chemistry and biological issues. It summarizes the literature from 2018 to March 2026, complementing the data discussed in our previous review. Full article

The large-scale integration of distributed photovoltaics (DPVs) into the distribution network exacerbates voltage fluctuations and substantially increases network losses. To improve the voltage quality and economic efficiency of distribution networks, a Volt/Var optimization (VVO) model is established. Coordinating multiple heterogeneous devices, the model aims to minimize the total voltage deviation, the total network losses, and the regulation cost of discrete equipment simultaneously. Considering multi-constraint coupling characteristics, a quantitative method is proposed to evaluate the reactive power regulation potential of DPVs under intricate operating conditions. Then, the multi-strategy integrated rime optimization algorithm (MSIRIME) is utilized for the model solution. Fuch chaotic mapping generates uniformly distributed and ergodic initial populations. A dual-branch search mechanism combining the snow ablation optimizer with the rime optimization significantly enhances global exploration capabilities. The guided learning strategy balances exploration and exploitation for high-dimensional VVO, preventing local optima. Case tests on a modified IEEE 33-bus system demonstrate that the proposed model exhibits excellent effectiveness and robustness. Moreover, MSIRIME exhibits better optimization performance than some classic and recently proposed strategies, reducing the average network losses and voltage deviation over 30 independent runs by at least 5.87% and 52.22%, respectively, relative to those of the compared methods. Full article

Image contrast enhancement is widely used to improve visual perception in digital images; however, it often amplifies noise and introduces artifacts that distort structural information. To address this issue, CLAHE-based contrast enhancement is formulated as a constrained optimization problem, in which distortion control is enforced via PSNR constraints. In this work, a behavioral analysis of the decision variables is conducted, revealing distinct objective-function responses that are exploited to guide the optimization process. Based on these observations, a hybrid evolutionary–numerical framework is developed, combining evolutionary search for discrete parameter exploration with numerical optimization for stable adjustment of continuous parameters. The proposed methods are evaluated on a benchmark set of 30 medical images and compared against fully evolutionary, numerical, and recent population-based optimization approaches reported in the literature. Experimental results show that the hybrid variants, particularly NR-EVO, consistently achieve the best overall performance across different computational budgets, producing higher-quality enhancements for the evaluated benchmark problems. On average, the enhanced images exhibit an increase in entropy of approximately 22% while maintaining competitive structural similarity and satisfying the predefined distortion constraints. Full article

Traditional job shop scheduling research primarily focuses on regular performance measures such as makespan. However, in a Just-in-Time (JIT) production environment, the objective shifts toward minimizing non-regular measures, specifically the weighted sum of earliness and tardiness (E/T) penalties, as excessive earliness leads to increased work-in-process inventory costs. Addressing the JIT scheduling problem in Assembly Job-shop Scheduling Problem (AJSP) is challenging, as traditional genetic algorithms (GAs) often suffer from premature convergence due to the randomness of initial populations. This paper proposes an Improved Genetic Algorithm (IGA) based on a multi-rule collaborative initialization mechanism. The algorithm explicitly incorporates assembly tree structure constraints during the encoding phase. For population initialization, a hybrid strategy is designed by integrating forward scheduling, backward scheduling, and forward-scheduling-based delay adjustment rules to ensure both the quality and diversity of the initial solutions. Simulation experiments and ablation studies demonstrate that the proposed IGA consistently achieves lower total weighted costs across various problem scales compared to standard algorithms. The results validate that the collaborative initialization strategy effectively balances global exploration and local exploitation, providing a robust solution for AJSP under JIT constraints. Full article

Efficient cooperative task allocation is essential for multiple unmanned aerial vehicles (UAVs) performing complex missions. However, diverse dynamic events in real-world scenarios require rapid response through dynamic task allocation (DTA). Although evolutionary algorithms have been widely adopted for DTA, existing methods often fail to maintain consistency between allocation decisions and actual operational states, consider only limited classes of dynamic events, and still leave room for performance improvement. This paper formulates multi-UAV DTA as a dynamic multi-objective optimization problem (DMOP) that jointly minimizes the residual target value and mission makespan, incorporating a state inheritance mechanism and a comprehensive set of dynamic events covering multiple facets of disruptions in observation task scenarios. To solve this DMOP, a multi-swarm dynamic crow search algorithm for task allocation (MDCSATA) is proposed, which integrates five strategies: violation-tolerant multi-swarm co-evolution for feasibility and diversity; objective-oriented heuristic initialization to accelerate convergence; an adaptive position update for better exploration and exploitation; stagnation and elite guided perturbation for intensified local exploitation; and an event-aware change response for rapid adaptation to dynamic events. Experiments on three constructed scenarios against seven state-of-the-art algorithms show that MDCSATA achieves superior performance on the evaluation metrics with acceptable runtime. It obtains the best MHV and MIGD in all scenarios, improving MHV by at least 0.93% and reducing MIGD by at least 12.92% across scenarios. These results confirm its effectiveness for DTA. Full article

This study introduces the Morabaraba Optimization Algorithm (MOA), a new global optimization method derived from the sequential and strategic dynamics of the traditional Morabaraba board game. The algorithm translates the main stages of the game into computational search mechanisms, including team allocation, piece placement, movement, flying, mill construction, and cow shooting. In MOA, candidate solutions are assigned competitive roles by separating the population into two rival groups, allowing each solution to adjust its position according to team leaders, board-line structures, and previously generated mill patterns. A new alignment-driven mill formation mechanism is also developed to model strategic player behavior, enabling the algorithm to create mills and weaken the opposing group. The performance of MOA is evaluated on 50 benchmark functions, including unimodal, multimodal, and fixed-dimensional test problems, and compared with 16 established optimization algorithms. The experimental outcomes indicate that MOA achieves rapid convergence while maintaining strong exploration during the early search stages. This behavior is mainly attributed to the integration of mill formation, cow shooting, phase-based position updating, and the structured division of the population into two competing teams. Non-parametric statistical analysis further confirms that MOA provides statistically significant improvements over several competing methods. The results also show that the proposed algorithm performs reliably across a broad set of benchmark functions, demonstrating its robustness and adaptability. In addition, MOA maintains an effective balance between exploration and exploitation, performs consistently in high-dimensional search spaces, and shows strong potential as a Morabaraba-inspired metaheuristic for solving global optimization problems. Full article