Search Results (380)

Network connectivity and area coverage are the most important aspects in the applications of wireless sensor networks (WSNs). The resource and energy constraints of sensor nodes, operational conditions, and network size pose challenges to the optimal coverage of targets in the region of interest (ROI). The main idea is to achieve maximum area coverage and connectivity with strategic deployment and the minimal number of sensor nodes. This work addresses the problem of network area coverage in randomly distributed WSNs and provides an efficient deployment strategy using an enhanced version of cuckoo search optimization (ECSO). The “sequential update evaluation” mechanism is used to mitigate the dependency among dimensions and provide highly accurate solutions, particularly during the local search phase. During the preference random walk phase of conventional CSO, particle swarm optimization (PSO) with adaptive inertia weights is defined to accelerate the local search capabilities. The “opposition-based learning (OBL)” strategy is applied to ensure high-quality initial solutions that help to enhance the balance between exploration and exploitation. By considering the opposite of current solutions to expand the search space, we achieve higher convergence speed and population diversity. The performance of ECSO-OBL is evaluated using eight benchmark functions, and the results of three cases are compared with the existing methods. The proposed method enhances network coverage with a non-uniform distribution of sensor nodes and attempts to cover the whole ROI with a minimal number of sensor nodes. In a WSN with a 100 m² area, we achieved a maximum coverage rate of 98.45% and algorithm convergence in 143 iterations, and the execution time was limited to 2.85 s. The simulation results of various cases prove the higher efficiency of the ECSO-OBL method in terms of network coverage and connectivity in WSNs compared with existing state-of-the-art works. Full article

As a new generation of mobile communication networks, 6G security faces many new security challenges. Vehicle to Everything (V2X) will be an important part of 6G. In V2X, connected and automated vehicles (CAVs) need to frequently share data with other vehicles and infrastructures. Therefore, identity revocation technology in the authentication is an important way to secure CAVs and other 6G scenario applications. This paper proposes an efficient credential revocation scheme with a four-layer architecture. First, a rapid pre-filtration layer is constructed based on the cuckoo filter, responsible for the initial screening of credentials. Secondly, a directed routing layer and the precision judgement layer are designed based on the consistency hash and the dynamic RSA accumulator. By proposing the dynamic expansion of the RSA accumulator and load-balancing algorithm, a smaller and more stable revocation delay can be achieved when many users and terminal devices access 6G. Finally, a trusted storage layer is built based on the blockchain, and the key revocation parameters are uploaded to the blockchain to achieve a tamper-proof revocation mechanism and trusted data traceability. Based on this architecture, this paper also proposes a detailed identity credential revocation and verification process. Compared to existing solutions, this paper’s solution has a combined average improvement of 59.14% in the performance of the latency of the cancellation of the inspection, and the system has excellent load balancing, with a standard deviation of only 11.62, and the maximum deviation is controlled within the range of ±4%. Full article

Photovoltaic (PV) energy generation has seen rapid growth in recent years due to its sustainability and environmental benefits. However, accurately identifying PV panel parameters is crucial for enhancing system performance, especially under varying environmental conditions. This study presents an enhanced approach for estimating PV panel parameters using a Modified Quasi-Opposition-Based Killer Whale Optimization (MQOB-KWO) technique. The research aims to improve parameter extraction accuracy by optimizing the one-diode model (ODM), a widely used representation of PV cells, using a modified metaheuristic optimization technique. The proposed algorithm leverages a Quasi-Opposition-Based Learning (QOBL) mechanism to enhance search efficiency and convergence speed. The methodology involves implementing the MQOB-KWO in MATLAB R2021a and evaluating its effectiveness through experimental I-V data from two unlike photovoltaic panels. The findings are contrasted to established optimization techniques from the literature, such as the original Killer Whale Optimization (KWO), Improved Opposition-Based Particle Swarm Optimization (IOB-PSO), Improved Cuckoo Search Algorithm (ImCSA), and Chaotic Improved Artificial Bee Colony (CIABC). The findings demonstrate that the proposed MQOB-KWO achieves superior accuracy with the lowest Root Mean Square Error (RMSE) compared to other methods, and the lowest error rates (Root Mean Square Error—RMSE, and Integral Absolute Error—IAE) compared to the original KWO, resulting in a better value of the coefficient of determination (${\mathrm{R}}^2$), hence effectively capturing PV module characteristics. Additionally, the algorithm shows fast convergence, making it suitable for real-time PV system modeling. The study confirms that the proposed optimization technique is a reliable and efficient tool for improving PV parameter estimation, contributing to better system efficiency and operational performance. Full article

Brent oil holds a significant position in the global energy market, as oil prices in many regions are indexed to it. Therefore, forecasting the future price of Brent oil is of great importance. In recent years, artificial intelligence techniques have been widely applied in modeling and prediction tasks. In this study, an Adaptive Neuro-Fuzzy Inference System (ANFIS), a well-established AI approach, was employed for the time-series forecasting of Brent oil prices. To ensure effective learning and improve prediction accuracy, ANFIS was trained using nine different metaheuristic algorithms: Artificial Bee Colony (ABC), Selfish Herd Optimizer (SHO), Biogeography-Based Optimization (BBO), Multi-Verse Optimizer (MVO), Teaching–Learning-Based Optimization (TLBO), Cuckoo Search (CS), Moth Flame Optimization (MFO), Marine Predator Algorithm (MPA), and Flower Pollination Algorithm (FPA). Symmetric training procedures were applied across all algorithms to ensure fair and consistent evaluation. The analyses were conducted on the lowest and highest daily, weekly, and monthly Brent oil prices. Mean squared error (MSE) was used as the primary performance metric. The results showed that all algorithms achieved effective prediction performance. Among them, BBO and TLBO demonstrated superior accuracy and stability, particularly in handling the complexities of Brent oil forecasting. This study contributes to the literature by combining ANFIS and metaheuristics within a symmetric framework of experimentation and evaluation. Full article

The Quantum Snowflake Algorithm (QSA) is a novel metaheuristic for both continuous and discrete optimization problems, combining collision-based diversity, quantum-inspired tunneling, superposition-based partial solution sharing, and local refinement steps. The QSA embeds candidate solutions in a continuous auxiliary space, where collision operators ensure that agents—snowflakes—reject each other and remain diverse. This approach is inspired by snowflakes which prevent collisions while retaining unique crystalline patterns. Large leaps to escape deep local minima are simultaneously provided by quantum tunneling, which is particularly useful in highly multimodal environments. Tests on challenging functions like Lévy and HyperSphere showed that the QSA can more reliably obtain very low objective values in continuous domains than conventional swarm or evolutionary approaches. A 200-city Traveling Salesman Problem (TSP) confirmed the excellent tour quality of the QSA for discrete optimization. It drastically reduces the route length compared to Artificial Bee Colony (ABC), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Quantum Particle Swarm Optimization (QPSO), and Cuckoo Search (CS). These results show that quantum tunneling accelerates escape from local traps, superposition and local search increase exploitation, and collision-based repulsion maintains population diversity. Together, these elements provide a well-rounded search method that is easy to adapt to different problem areas. In order to establish the QSA as a versatile solution framework for a range of large-scale optimization challenges, future research could investigate multi-objective extensions, adaptive parameter control, and more domain-specific hybridisations. Full article

Financial Time Series Forecasting (TSF) remains a critical challenge in Artificial Intelligence (AI) due to the inherent complexity of financial data, characterized by strong non-linearity, dynamic non-stationarity, and multi-factor coupling. To address the performance limitations of Spiking Neural Networks (SNNs) caused by hyperparameter sensitivity, this study proposes an SNN model optimized by an Improved Cuckoo Search (ICS) algorithm (termed ICS-SNN). The ICS algorithm enhances global search capability through piecewise-mapping-based population initialization and introduces a dynamic discovery probability mechanism that adaptively increases with iteration rounds, thereby balancing exploration and exploitation. Applied to futures market price difference prediction, experimental results demonstrate that ICS-SNN achieves reductions of 13.82% in MAE, 21.27% in MSE, and 15.21% in MAPE, while improving the coefficient of determination (R²) from 0.9790 to 0.9822, compared to the baseline SNN. Furthermore, ICS-SNN significantly outperforms mainstream models such as Long Short-Term Memory (LSTM) and Backpropagation (BP) networks, reducing prediction errors by 10.8% (MAE) and 34.9% (MSE), respectively, without compromising computational efficiency. This work highlights that ICS-SNN provides a biologically plausible and computationally efficient framework for complex financial TSF, bridging the gap between neuromorphic principles and real-world financial analytics. The proposed method not only reduces manual intervention in hyperparameter tuning but also offers a scalable solution for high-frequency trading and multi-modal data fusion in future research. Full article

As technology advances, the services provided by domain servers require new innovative techniques that can be optimized for frequent changes. Man-in-the-Middle (MitM) attacks on Domain Name Servers (DNS) pose a security threat, enabling attackers to intercept, modify, and redirect network traffic to malicious sites or users. This study designed an anomaly-based detection scheme that identifies and mitigates MitM attacks on DNS. The proposed model utilizes machine learning algorithms and statistical analysis techniques to ensure that the analysis of DNS query patterns can efficiently detect anomalies associated with the MitM. By integrating the Cuckoo Search Algorithm, the scheme minimizes false positives while improving the detection rate. The Proposed scheme was evaluated using the Internet of Things Intrusion Detection (IoTID) and Intrusion Detection System (IDS) datasets, achieving a detection accuracy of 99.6% and demonstrating its effectiveness in minimizing the MitM attacks on DNS. Full article

Meta-heuristic algorithms are computational methods inspired by evolutionary processes, animal or plant behaviors, physical events, and other natural phenomena. Due to their success in solving optimization problems, meta-heuristic algorithms are widely used in the literature, leading to the development of novel variants. In this paper, new swarm-based meta-heuristic algorithms, called Improved Roosters Algorithm (IRA), Bipolar Roosters Algorithm (BRA), and Bipolar Improved Roosters Algorithm (BIRA), which are mainly based on Roosters Algorithm (RA), are presented. First, the new versions of RA (IRA, BRA, and BIRA) were compared in terms of performance, revealing that BIRA achieved significantly better results than the other variants. Then, the performance of the BIRA algorithm was compared with the performances of meta-heuristic algorithms widely used in the literature, Standard Genetic Algorithm (SGA), Differential Evolution (DE), Particle Swarm Optimization (PSO), Cuckoo Search (CS), and Grey Wolf Optimizer (GWO), and thus, its success in the literature was tested. Moreover, RA was also included in this test to show that the new version, BIRA, is more successful than the previous one (RA). For all comparisons, 20 well-known benchmark optimization functions, 11 CEC2014 test functions, and 17 CEC2018 test functions, which are also in the CEC2020 test suite, were employed. To validate the significance of the results, Friedman and Wilcoxon Signed Rank statistical tests were conducted. In addition, three commonly used problems in the field of engineering were used to test the success of algorithms in real-life scenarios: pressure vessel, gear train, and tension/compression spring design. The results indicate that the proposed algorithm (BIRA) provides better performance compared to the other meta-heuristic algorithms. Full article

Photovoltaic (PV) systems are increasingly recognized as a viable renewable energy source due to their clean, abundant, silent, and environmentally friendly nature. However, their efficiency is significantly influenced by environmental conditions, necessitating advanced control strategies to ensure optimal power extraction. This study aims to enhance the performance of PV systems by developing and evaluating maximum power point tracking (MPPT) algorithms capable of operating effectively under both uniform irradiance and partial shading conditions (PSCs). Specifically, two metaheuristic algorithms—Particle Swarm Optimization (PSO) and Cuckoo Search Optimization (CSO)—are modeled, implemented, and tested for tracking the global peak power (GPP) in various static and dynamic scenarios. Simulation results indicate that both algorithms accurately and efficiently track the GPP under static uniform and PSCs. Under dynamic conditions, while both the PSO and CSO can initially locate the GPP, they fail to maintain accurate tracking during subsequent intervals. Notably, CSO exhibits reduced oscillations and faster response time compared with PSO. These findings suggest that while metaheuristic MPPT methods are effective in static environments, their performance in dynamic conditions remains a challenge requiring further enhancement. Full article

With the increasing severity of global climate change, low-carbon development has become a key issue in the energy industry. As an effective way to optimize energy utilization and reduce carbon emissions, integrated energy system is receiving increasing attention. However, existing low-carbon control methods still face many challenges in improving system efficiency and reducing carbon emissions, and the ability of multi-energy cooperative scheduling and optimal control is insufficient. Therefore, a hybrid algorithm combining the particle swarm optimization and cuckoo search algorithms is designed to adjust the integrated energy low-carbon control capability. The proposed algorithm required fewer iterations than the genetic cuckoo algorithm, which only went through 43 iterations. The convergence speed was improved by 34.8% compared with a single cuckoo algorithm. Among the four scenarios, scenario 4 and scenario 3 had the highest utilization rates of 99.75%, while scenario 1 had the lowest utilization rate of 61.96%. This indicates that the integrated energy system controlled by the particle swarm optimization cuckoo algorithm, while considering carbon capture and storage as well as power-to-gas conversion, can effectively utilize solar energy resources for power generation and achieve energy-saving and emission reduction effects. In summary, this method can help the integrated energy system adapt to various optimization strategies, which promotes the development of low-carbon control technologies in the energy industry. Full article

In this study, we introduce an innovative approach for addressing fractional partial differential equations (fPDEs) by combining Monte Carlo-based physics-informed neural networks (PINNs) with the cuckoo search (CS) optimization algorithm, termed PINN-CS. There is a further enhancement in the application of quasi-Monte Carlo assessment that comes with high efficiency and computational solutions to estimates of fractional derivatives. By employing structured sampling nodes comparable to techniques used in finite difference approaches on staggered or irregular grids, the proposed PINN-CS minimizes storage and computation costs while maintaining high precision in estimating solutions. This is supported by numerous numerical simulations to analyze various high-dimensional phenomena in various environments, comprising two-dimensional space-fractional Poisson equations, two-dimensional time-space fractional diffusion equations, and three-dimensional fractional Bloch–Torrey equations. The results demonstrate that PINN-CS achieves superior numerical accuracy and computational efficiency compared to traditional fPINN and Monte Carlo fPINN methods. Furthermore, the extended use to problem areas with irregular geometries and difficult-to-define boundary conditions makes the method immensely practical. This research thus lays a foundation for more adaptive and accurate use of hybrid techniques in the development of the fractional differential equations and in computing science and engineering. Full article

With the increasingly busy transportation of cargo at container terminals (CTs), the requirements for terminal throughput and operational efficiency are constantly increasing. The operational efficiency and cost of CTs are closely related to the seamless docking of terminal facilities, especially the joint operation between berths and quay cranes (QCs). Therefore, a joint allocation problem of berths and QCs (BACASP) is presented in this paper and formalized as a mathematical model to minimize terminal operation costs and shipowner dissatisfaction. Given that BACASP is an NP-hard problem, an improved multi-objective cuckoo search (IMOCS) algorithm is proposed to solve this problem, in which an elite-guided tangent flight strategy is presented to speed up the convergence for making up the lack of random search direction of the traditional cuckoo search algorithm; and an information-enhanced abandonment strategy is put forward to increase the possibility of escaping from local optima. Numerical experimental results show the effectiveness of the proposed algorithm. Full article

The optimization of wireless sensor network (WSN) deployment is a current research hotspot, particularly significant in industrial applications. While some existing optimization methods focus more on balancing network coverage, connectivity, and deployment costs, aligning them with practical needs compared to single-performance optimization schemes, they still tend to be overly idealized. In practical applications, networks often face monitoring requirements for different data types, and some single-function sensors can be integrated into multifunctional sensors capable of monitoring multiple types of data. When encountering diverse data detection needs in a target area, this integration can be further considered to reduce deployment costs. Therefore, this paper designs a new multi-objective optimization problem aimed at optimizing heterogeneous-function wireless sensor networks, balancing coverage, connectivity, and cost, while introducing an additional cost dimension to meet the monitoring needs of different functional sensors in specific areas. This problem is a typical non-convex, multimodal, NP-hard problem. To address this, an improved Secretary Bird Optimization Algorithm (ISBOA) is proposed, incorporating Gaussian Cuckoo Mutation and a smooth exploitation mechanism. The algorithm is compared with the original SBOA, Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA), and Northern Goshawk Optimization (NGO). Simulation results demonstrate that ISBOA exhibits a faster convergence speed and higher accuracy in both the 23 benchmark functions and the newly designed multi-objective optimization problem, significantly overcoming the shortcomings of the compared algorithms. Finally, for large-scale optimization problems, a minimum spanning tree domain reduction strategy is proposed, which significantly improves solving efficiency with a moderate sacrifice in accuracy. Full article

This paper focuses on the crucial task of automatic recognition and understanding of table structures in engineering drawings and document processing. Given the importance of tables in information display and the urgent need for automated processing of tables in the digitalization process, an intelligent verification method is proposed. This method integrates multiple key techniques: YOLOv10 is used for table object recognition, achieving a precision of 0.891, a recall rate of 0.899, mAP50 of 0.922, and mAP50-95 of 0.677 in table recognition, demonstrating strong target detection capabilities; the improved LORE algorithm is adopted to extract table structures, breaking through the limitations of the original algorithm by segmenting large-sized images, with a table extraction accuracy rate reaching 91.61% and significantly improving the accuracy of handling complex tables; RapidOCR is utilized to achieve text recognition and cell correspondence, solving the problem of text-cell matching; for equipment name semantic matching, a method based on BERT is introduced and calculated using a comprehensive scoring method. Meanwhile, an improved cuckoo search algorithm is proposed to optimize the adjustment factors, avoiding local optima through sine optimization and the catfish effect. Experiments show the accuracy of equipment name matching in semantic similarity calculation approaches 100%. Finally, the paper provides a concrete system practice to prove the effectiveness of the algorithm. In conclusion, through experimental comparisons, this method exhibits excellent performance in table area location, structure recognition, and semantic matching and is of great significance and practical value in advancing table data processing technology in engineering drawings. Full article

The rapid proliferation of ransomware variants necessitates more effective detection mechanisms, as traditional signature-based methods are increasingly inadequate. These conventional methods rely on manual feature extraction and matching, which are time-consuming and limited to known threats. This study addresses the escalating challenge of ransomware threats in cybersecurity by proposing a novel deep learning model, LSTM-EDadver, which leverages Generative Adversarial Networks (GANs) and Carlini and Wagner (CW) attacks to enhance malware detection capabilities. LSTM-EDadver innovatively generates adversarial examples (AEs) using sequential features derived from ransomware behaviors, thus training deep learning models to improve their robustness and accuracy. The methodology combines Cuckoo sandbox analysis with conceptual lattice ontology to capture a wide range of ransomware families and their variants. This approach not only addresses the shortcomings of existing models but also simulates real-world adversarial conditions during the validation phase by subjecting the models to CW attacks. The experimental results demonstrate that LSTM-EDadver achieves a classification accuracy of 96.59%. This performance was achieved using a dataset of 1328 ransomware samples (across 32 ransomware families) and 519 normal instances, outperforming traditional RNN, LSTM, and GCU models, which recorded accuracies of 90.01%, 93.95%, and 94.53%, respectively. The proposed model also shows significant improvements in F1-score, ranging from 2.49% to 6.64% compared to existing models without adversarial training. This advancement underscores the effectiveness of integrating GAN-generated attack command sequences into model training. Full article