Search Results (163)

Recent advances in machine learning have enabled highly effective ciphertext-based cryptographic algorithm identification, posing a potential threat to encrypted communication. Inspired by adversarial example techniques, we present CSPM (Class-Specific Perturbation Mask Generation), a novel adversarial-defense framework that enhances ciphertext unidentifiability through misleading machine-learning-based cipher classifiers. CPSM constructs lightweight, reversible bit-level perturbations that alter statistical ciphertext features without affecting legitimate decryption. The method leverages class prototypes to capture representative bit-distribution patterns for each cryptographic algorithm and integrates two complementary mechanisms—mimicry-based perturbing, which steers ciphertexts toward similar cipher classes, and distortion-based perturbing, which disrupts distinctive statistical traits—through a ranking-based greedy search. Extensive experiments on seven widely used cryptographic algorithms and fifteen NIST statistical feature configurations demonstrate that CSPM consistently reduces algorithm-identification accuracy by over 25%. These results confirm that perturbation position selection, rather than magnitude, dominates attack efficacy. CSPM provides a practical defense mechanism, offering a new perspective for safeguarding encrypted communications against statistical and machine-learning-based traffic analysis. Full article

Digital microfluidic biochips (DMFBs) find extensive applications in biochemical experiments, medical diagnostics, and safety-critical domains, with their reliability dependent on efficient online testing technologies. However, traditional random search algorithms suffer from slow convergence and susceptibility to local optima under complex fluidic constraints. This paper proposes a hybrid optimization method based on priority strategy and an improved sparrow search algorithm for DMFB online test path planning. At the algorithmic level, the improved sparrow search algorithm incorporates three main components: tent chaotic mapping for population initialization, cosine adaptive weights together with Elite Opposition-based Learning (EOBL) to balance global exploration and local exploitation, and a Gaussian perturbation mechanism for fine-grained refinement of promising solutions. Concurrently, this paper proposes an intelligent rescue strategy that integrates global graph-theoretic pathfinding, local greedy heuristics, and space–time constraint verification to establish a closed-loop decision-making system. The experimental results show that the proposed algorithm is efficient. On the standard 7 × 7–15 × 15 DMFB benchmark chips, the shortest offline test path length obtained by the algorithm is equal to the length of the Euler path, indicating that, for these regular layouts, the shortest test path has reached the known optimal value. In both offline and online testing, the shortest paths found by the proposed method are better than or equal to those of existing mainstream algorithms. In particular, for the 15 × 15 chip under online testing, the proposed method reduces the path length from 543 and 471 to 446 compared with the IPSO and IACA algorithms, respectively, and reduces the standard deviation by 53.14% and 39.4% compared with IGWO in offline and online testing. Full article

To address the problem of insufficient user fairness in multi-user multiple-input single-output visible light communication systems, this paper proposes a joint design scheme of intelligent reflecting surface configuration and precoding to maximize the minimum signal-to-interference-plus-noise ratio among users. To tackle the constructed non-convex optimization problem, this paper proposes an alternating optimization algorithm, which alternately fixes the intelligent reflecting surface configuration matrix and the precoding matrix, decomposes the original problem into subproblems that can be transformed into convex forms for efficient solution, and iteratively solves them using the bisection search and relaxation–quantization methods. Simulation results show that, compared with the minimum mean square error and zero-forcing precoding schemes based on distance greedy matching, the proposed method improves the minimum signal-to-interference-plus-noise ratio of users by 12 and 16 percent. Furthermore, when user locations are fixed, the minimum signal-to-interference-plus-noise ratio under the optimal deployment position of the intelligent reflecting surface increases by 8 percent compared with the random user distribution scenario. Full article

This work investigates how different language modeling techniques affect the performance of an end-to-end automatic speech recognition (ASR) system for the Amazigh language. A (CNN-BiLSTM-CTC) model enhanced with an attention mechanism was used as the baseline. During decoding, two external language models were integrated using shallow fusion: a trigram N-gram model built with KenLM and a recurrent neural network language model (RNN-LM) trained on the same Tifdigit corpus. Four decoding methods were compared: greedy decoding; beam search; beam search with an N-gram language model; and beam search with a compact recurrent neural network language model. Experimental results on the Tifdigit dataset reveal a clear trade-off: the N-gram language model produces the best results compared to RNN-LM, with a phonetic error rate (PER) of 0.0268, representing a relative improvement of 4.0% over the greedy baseline model, and translates into an accuracy of 97.32%. This suggests that N-gram models can outperform neural approaches when reliable, limited data and lexical resources are available. The improved N-gram approach notably outperformed both simple beam search and the RNN neural language model. This improvement is due to higher-order context modeling, its optimized interpolation weights, and its adaptive lexical weighting tailored to the phonotactic structure of the Amazigh language. Full article

With the expansion of unmanned aerial vehicles (UAVs) into complex three-dimensional (3D) terrains for reconnaissance, rescue, and related missions, traditional path planning methods struggle to meet multi-constraint and multi-objective requirements. Existing swarm intelligence algorithms, limited by the “no free lunch” theorem, also face challenges when the standard Information Acquisition Optimizer (IAO) is applied to such tasks, including low exploration efficiency in high-dimensional search spaces, rapid loss of population diversity, and improper boundary handling. To address these issues, this study proposes a Multi-Strategy Enhanced Information Acquisition Optimizer (MEIAO). First, a Levy Flight-based information collection strategy is introduced to leverage its combination of short-range local searches and long-distance jumps, thereby broadening global exploration. Second, an adaptive differential evolution operator is designed to dynamically balance exploration and exploitation via a variable mutation factor, while crossover and greedy selection mechanisms help maintain population diversity. Third, a globally guided boundary handling strategy adjusts out-of-bound dimensions to feasible regions, preventing the generation of low-quality paths. Performance was evaluated on the CEC2017 (dim = 30/50/100) and CEC2022 (dim = 10/20) benchmark suites by comparing MEIAO with eight algorithms, including VPPSO and IAO. Based on the mean, standard deviation, Friedman mean rank, and Wilcoxon rank-sum tests, MEIAO demonstrated superior performance in local exploitation of unimodal functions, global exploration of multimodal functions, and complex adaptation on composite functions while exhibiting stronger robustness. Finally, MEIAO was applied to 3D mountainous UAV path planning, where a cost model considering path length, altitude standard deviation, and turning smoothness was established. The experimental results show that MEIAO achieved an average path cost of 253.9190, a 25.7% reduction compared to IAO (341.9324), with the lowest standard deviation (60.6960) among all algorithms. The generated paths were smoother, collision-free, and achieved faster convergence, offering an efficient and reliable solution for UAV operations in complex environments. Full article

The Rapidly Exploring Random Tree (RRT) is widely employed in the field of intelligent vehicles, but traditional RRT has issues like inefficient blind expansion, tortuous/discontinuous paths, and slow convergence. Thus, a multi-dimensional optimized RRT is proposed. First, a heuristic search method is adopted to reduce blind sampling, guiding sampling toward the target and cutting irrelevant searches. Second, to fix RRT’s inability to adjust step size dynamically (limiting complex road adaptability), step size is optimized based on environmental information. Third, since treating vehicles as mass points leads to unreasonable paths, sampling points are expanded for practicality. Finally, redundant points are removed via a greedy strategy, and paths are smoothed with quasi-uniform cubic B-splines to meet ride comfort needs. MATLAB R2022b simulations validate the algorithm: in simple scenarios, optimized RRT reduces sampling points to 232 (24.4% of traditional RRT), runtime to 3.25 s (79.4% cut), path length to 673.84 m (15.6% reduction); in complex scenarios, 636 points (37.0%), 11.07 s runtime (58.8% cut), 699.61 m path (21.6% reduction), outperforming traditional RRT and Q-RRT*. Full article

Surrogate-assisted evolutionary algorithms (SAEAs) have emerged as a powerful class of optimization methods that utilize surrogate models to address expensive optimization problems (EOPs), where fitness evaluations (FEs) are expensive or limited. By leveraging previously evaluated solutions to learn predictive models, SAEAs enable efficient search under constrained evaluation budgets. However, the performance of SAEAs heavily depends on the quality and utilization of surrogate models, and balancing the accuracy and generalization ability makes effective model construction and management a key challenge. Therefore, this paper introduces a novel probability selection-based surrogate-assisted evolutionary algorithm (PS-SAEA) to enhance optimization performance under FE-constrained conditions. The PS-SAEA has two novel designs. First, a probabilistic model selection (PMS) strategy is proposed to stochastically select surrogate models, striking a balance between prediction accuracy and generalization by avoiding overfitting commonly caused by greedy selection. Second, a weighted model ensemble (WME) mechanism is developed to integrate selected models, assigning weights based on individual prediction errors to improve the accuracy and reliability of fitness estimation. Extensive experiments on benchmark problems with varying dimensionalities demonstrate that PS-SAEA consistently outperforms several state-of-the-art SAEAs, validating its effectiveness and robustness in dealing with various complex EOPs. Full article

Network interdiction problems involving edge deletion on shortest paths have wide applications. However, in many practical scenarios, the complete removal of edges is infeasible. The minimum-cost shortest-path interdiction problem for trees with the weighted $l_{\infty }$ norm (MCSPIT_∞) is studied in this paper. The goal is to upgrade selected edges at minimum total cost such that the shortest root–leaf distance is bounded below by a given value. We designed an $O(nlogn)$ algorithm based on greedy techniques combined with a binary search method to solve this problem efficiently. We then extended the framework to the minimum-cost shortest-path double interdiction problem for trees with the weighted $l_{\infty }$ norm, which imposes an additional requirement that the sum of root–leaf distances exceed a given threshold. Building upon the solution to (MCSPIT_∞), we developed an equally efficient $O(nlogn)$ algorithm for this variant. Finally, numerical experiments are presented to demonstrate both the effectiveness and practical performance of the proposed algorithms. Full article

Educational institutions face complex challenges when allocating limited teaching resources to specialized seminars, where budget, capacity, and balanced disciplinary representation must all be satisfied simultaneously. We address this for the first time in the educational domain by formulating the teacher seminar selection problem as a multi-dimensional knapsack variant with category-specific benefit multipliers. To solve it, we design a constraint-aware genetic algorithm that incorporates smart initialization, category-sensitive operators, adaptive penalties, and targeted repair mechanisms. In experiments on a realistic dataset representing multiple academic categories, our method achieved an 11.5% improvement in solution quality compared to the best constraint-aware greedy baseline while maintaining perfect constraint satisfaction (100% feasibility) vs. 0–30% for baseline methods. Statistical tests confirmed significant and practically meaningful advantages. For comprehensive benchmarking, we also implemented binary particle swarm optimization (PSO) and Tabu Search (TS) solvers with standard parameterizations. While PSO consistently produced feasible solutions with high budget utilization, its optimization quality was substantially lower than that of the GA. Notably, Tabu Search achieved the highest performance, with a mean fitness of 1557.3 compared to GA’s 1533.2, demonstrating that memory-based local search can be highly competitive for this problem structure. These findings show that metaheuristic approaches, particularly those integrating constraint-awareness into evolutionary or memory-based search, provide effective, scalable decision-support frameworks for complex, multi-constraint educational resource allocation. Full article

The Planet Optimization Algorithm (POA) is a meta-heuristic inspired by celestial mechanics, drawing on Newtonian gravitational principles to simulate planetary dynamics in optimization search spaces. While the POA demonstrates a strong performance in continuous domains, we propose an Improved Binary Planet Optimization Algorithm (IBPOA) tailored to the classical 0-1 knapsack problem (0-1 KP). Building upon the POA, the IBPOA introduces a novel improved transfer function (ITF) and a greedy repair operator (GRO). Unlike general binarization methods, the ITF integrates theoretical foundations from branch-and-bound (B&B) and reduction algorithms, reducing the search space while guaranteeing optimal solutions. This improvement is strengthened further through the incorporation of the GRO, which significantly improves the searching capability. Extensive computational experiments on large-scale instances demonstrate the IBPOA’s effectiveness for the 0-1 KP, showing a superior performance in its convergence rate, population diversity, and exploration–exploitation balance. The results from 30 independent runs confirm that the IBPOA consistently obtains the optimal solutions across all 15 benchmark instances, spanning three categories. Wilcoxon’s rank-sum tests against seven state-of-the-art algorithms reveal that the IBPOA significantly outperforms all competitors $(p<0.05)$, though it is occasionally matched in its solution quality by the binary reptile search algorithm (BinRSA). Crucially, the IBPOA achieves solutions 4.16 times faster than the BinRSA on average, establishing an optimal balance between solution quality and computational efficiency. Full article

The Max+Sum Spanning Tree (MSST) problem, with applications in secure communication systems, seeks a spanning tree T minimizing ${max}_{e\in T}w\left(e\right)+{\sum }_{e\in T}c\left(e\right)$ on a given edge-weighted undirected network $G(V,E,c,w)$, where the sets V and E are the sets of vertices and edges, respectively. The functions c and w are defined on the edge set, representing transmission cost and verification delay in secure communication systems, respectively. This problem can be solved within $O\left(\right|E|log|V\left|\right)$ time. We investigate its interdiction (MSSTID) and improvement (MSSTIP) problems under the weighted $l_{\infty }$ norm. MSSTID seeks minimal edge weight adjustments (to either c or w) to degrade network performance by ensuring the optimal MSST’s weight is at least K, while MSSTIP similarly aims to enhance performance by making the optimal MSST’s weight at most K through minimal weight modifications. These problems naturally arise in adversarial and proactive performance enhancement scenarios, respectively, where network robustness or efficiency must be guaranteed through constrained resource allocation. We first establish their mathematical models. Subsequently, we analyze the properties of the optimal value to determine the relationship between the magnitude of a given number and the optimal value. Then, utilizing binary search methods and greedy techniques, we design four algorithms with time complexity $O\left(\right|E{|}^{2}log\left|V\right|)$ to solve the above problems by modifying w or c. Finally, numerical experiments are conducted to demonstrate the effectiveness of the algorithms. Full article

Hyperspectral band selection (BS) is an important technique to reduce data dimensionality for the classification applications of hyperspectral remote sensing images (HSIs). Recently, searching-based BS methods have received increasing attention for their ability to select the best subset of bands while preserving the essential information of the original data. However, existing searching-based BS methods neglect effective exploitation of the spatial and spectral prior information inherent in the data, thus limiting their performance. To address this problem, in this study, a novel unsupervised BS method called Spectral–Spatial Iterative Greedy Algorithm (SSIGA) is proposed. Specifically, to facilitate efficient local search using spectral information, SSIGA conducts clustering on all the bands by employing a K-means clustering method with balanced cluster size constraints and constructs a K-nearest neighbor graph for each cluster. Based on the nearest neighbor graphs, SSIGA can effectively explore the neighborhood solutions in local search. In addition, to efficiently evaluate the discriminability and information redundancy of the solution given by SSIGA using the spatial and spectral information of HSIs, we designed an effective objective function for SSIGA. The value of the objective function is derived by calculating the Fisher score for each band in the solution based on the results of the superpixel segmentation performed on the target HSI, as well as by computing the average information entropy and mutual information of the bands in the solution. Experimental results on three publicly available real HSI datasets demonstrate that the SSIG algorithm achieves superior performance compared to several state-of-the-art methods. Full article

In modern urban planning, the problem of bank location requires not only considering geographical factors but also integrating competitive elements to optimize resource allocation and enhance market competitiveness. This study addresses the multi-size bank location problem by incorporating competitive factors into the optimization process through a novel reinforcement learning-enhanced genetic algorithm (RL-GA) framework. Building upon an attraction-based model with competitive decay functions, we propose an innovative hybrid optimization approach that combines evolutionary computation with intelligent decision-making capabilities. The RL-GA framework employs Q-learning principles to adaptively select optimal genetic operators based on real-time population states and search progress, enabling meta-learning where the algorithm learns how to optimize rather than simply optimizing. Unlike traditional genetic algorithms with fixed operator probabilities, our approach dynamically adjusts its search strategy through an $\epsilon$-greedy exploration mechanism and multi-objective reward functions. Experimental results demonstrate that the RL-GA achieves improvements in early-stage convergence speed while maintaining solution quality comparable to traditional methods. The algorithm exhibits enhanced convergence characteristics in the initial optimization phases and demonstrates consistent performance across multiple optimization trials. These findings provide evidence for the potential of intelligence-guided evolutionary computation in facility location optimization, offering moderate computational efficiency gains and adaptive strategic guidance for banking facility deployment in competitive environments. Full article

Unmanned aerial vehicles (UAVs) play an increasingly vital role in wilderness search and rescue (SAR) operations by enhancing situational awareness and extending the capabilities of human teams. Yet, a lack of standardized benchmarks has impeded the systematic evaluation of single- and multi-agent path-planning algorithms. This paper introduces an open-source dataset and evaluation framework to address this gap. The framework comprises 60 geospatial scenarios across four distinct European environments, featuring high-resolution probability maps. We present a lost person probabilistic model derived from statistical models of lost person behavior. We provide a suite of tools for evaluating search paths against four baseline methods: Concentric Circles, Pizza Zigzag, Greedy, and Random Exploration, using three quantitative metrics: Accumulated probability of detection, time-discounted probability of detection, and lost person discovery score. We provide an evaluation framework to facilitate the comparative analysis of single- and multi-agent path-planning algorithms, supporting both the baseline methods presented and custom user-defined path generators. By providing a structured and extensible framework, this work establishes a foundation for the rigorous and reproducible assessment of UAV search strategies in complex wilderness environments. Full article

This study proposes a biomimetic optimization approach for maritime Search and Rescue (SAR) planning using a Genetic Algorithm (GA). The goal is to maximize the number of detected drifting targets by optimally deploying both official and civilian Search and Rescue Units (SRUs). The proposed method incorporates a POD-adjusted fitness function with collision-avoidance constraints and is enhanced by a greedy initialization strategy. To validate its effectiveness, we compare the GA against a baseline method (EAGD) that combines a (1 + 1)-Evolutionary Algorithm with greedy deployment, across 24 experiments involving 2 realistic maritime scenarios and 12 coverage conditions. Results show that GA consistently achieves higher average fitness and stability, particularly under stress-test settings involving only civilian vessels. The findings underscore the potential of biomimetic algorithms for real-time, flexible, and scalable SAR planning, while highlighting the value of civilian participation in emergency maritime operations. Full article