Search

The calculation of the spectral blueing operator in the traditional spectral blueing method has singularity, which leads to poor performance in post-stack seimic frequency expansion. To this end, a frequency spreading technique based on matching pursuit (MP) and spectral blueing is proposed. Through time–frequency analysis processing, it is shown that the seismic signal extracted by matching tracking method has good stability and higher resolution. The specific process of the method in this paper firstly uses the matching tracking method to accurately divide the post-stack seismic data into multiple frequency-division seismic bodies; then, in the process of calculating the spectral blueing ization operators for each frequency band, the weighting idea is used to calculate the weights of the optimized spectral blueing ization operators for each frequency band based on the differences in energy in different frequency bands; finally, the optimized spectral blueing operator is convolved with seismic reflection coefficients to obtain high-resolution seismic data. The actual test results of poststack seismic data have proven that the frequency raising method proposed in this paper is superior to the traditional spectral blueing ization algorithm, greatly improving the high-frequency component information of poststack seismic data. After frequency extension, there are more seismic events and higher resolution. Finally, the practicability and rationality of the seismic data after frequency extraction are verified by a series of operations such as attribute extraction, well seismic calibration and inversion. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles are useful tools for many applications. However, autonomous path planning for Unmanned Aerial Vehicles in unfamiliar environments is a challenging problem when facing a series of problems such as poor consistency, high influence by the native controller of the Unmanned Aerial Vehicles. In this paper, we investigate reinforcement learning-based autonomous local path planning methods for Unmanned Aerial Vehicles with high autonomous decision-making capability and locally high portability. We propose an autonomous local path planning algorithm based on the TD3 strategy to solve the problem of local obstacle avoidance and path planning in unfamiliar environments using autonomous decision-making of Unmanned Aerial Vehicles. The simulation results on Gazebo show that our method can effectively realize the autonomous local path planning task for Unmanned Aerial Vehicles, the success rate of path planning with our method can reach 93% under the interference of no obstacles, and 92% in the environment with obstacles. Finally, our method can be used for autonomous path planning of Unmanned Aerial Vehicles in unfamiliar environments. [ABSTRACT FROM AUTHOR]

In industry, the task of defect classification and defect localization is an important part of defect detection system. However, existing studies only focus on one task and it is difficult to ensure the accuracy of both tasks. This paper proposes a defect detection system based on improved Yolo_v4, which greatly improves the detection ability of minor defects. For K_Means algorithm clustering prianchors question with strong subjectivity, the paper proposes the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to determine the number of Anchors. To solve the problem of low detection rate of small targets caused by insufficient reuse rate of low-level features in CSPDarknet53 feature extraction network, this paper proposes an ECA-DenseNet-BC-121 feature extraction network to improve it. And the Dual Channel Feature Enhancement (DCFE) module is proposed to improve the local information loss and gradient propagation obstruction caused by quad chain convolution in PANet networks to improve the robustness of the model. The experimental results on the fabric surface defect detection datasets show that the mAP of the improved Yolo_v4 is 98.97%, which is 7.67% higher than SSD, 3.75% higher than Faster_RCNN, 10.82% higher than Yolo_v4 tiny, and 5.35% higher than Yolo_v4, and the detection speed reaches 39.4 fps. It can meet the real-time monitoring needs of industrial sites. [ABSTRACT FROM AUTHOR]

In the petroleum and coal industries, digital image technology and acoustic emission technology are employed to study rock properties, but both exhibit flaws during data processing. Digital image technology is vulnerable to interference from fractures and scaling, leading to potential loss of image data; while acoustic emission technology is not hindered by these issues, noise from rock destruction can interfere with the electrical signals, causing errors. The monitoring errors of these techniques can undermine the effectiveness of rock damage analysis. To address this issue, this paper focuses on the restoration of image data acquired through digital image technology, leveraging deep learning techniques, and using soft and hard rocks made of similar materials as research subjects, an improved Incremental Transformer image algorithm is employed to repair distorted or missing strain nephograms during uniaxial compression experiments. The concrete implementation entails using a comprehensive training set of strain nephograms derived from digital image technology, fabricating masks for absent image segments, and predicting strain nephograms with full strain detail. Additionally, we adopt deep separable convolutional networks to optimize the algorithm's operational efficiency. Based on this, the analysis of rock damage is conducted using the repaired strain nephograms, achieving a closer correlation with the actual physical processes of rock damage compared to conventional digital image technology and acoustic emission techniques. The improved incremental Transformer algorithm presented in this paper will contribute to enhancing the efficiency of digital image technology in the realm of rock damage, saving time and money, and offering an innovative approach to traditional rock damage analysis. [ABSTRACT FROM AUTHOR]

This paper aims to propose a table tennis target detection (TD) method based on deep learning (DL) and multi-scale feature fusion (MFF) to improve the detection accuracy of the ball in table tennis competition, optimize the training process of athletes, and improve the technical level. In this paper, DL technology is used to improve the accuracy of table tennis TD through MFF guidance. Initially, based on the FAST Region-based Convolutional Neural Network (FAST R-CNN), the TD is carried out in the table tennis match. Then, through the method of MFF guidance, different levels of feature information are fused, which improves the accuracy of TD. Through the experimental verification on the test set, it is found that the mean Average Precision (mAP) value of the target detection algorithm (TDA) proposed here reaches 87.3%, which is obviously superior to other TDAs and has higher robustness. The DL TDA combined with the proposed MFF can be applied to various detection fields and can help the application of TD in real life. [ABSTRACT FROM AUTHOR]

Some special manufacturing fields such as aerospace may encounter mixed production of multiple research and development projects and multiple batch production projects. Under these special production conditions resource conflicts are more severe, resulting in uncertain operating times that are difficult to predict. In addition, a single project may have tens of thousands of supporting products, making it difficult to effectively control the total construction process. To address these challenges this paper proposes new methods. A model, EMA-DCPM (dynamic critical path method) incorporating attention mechanisms in Enterprise Resource Planning and Mechanical Engineering Society) has been proposed. This model predicts product job time through machine learning methods and discovers the predictive advantage of the attention mechanism through data comparison. The CPM control algorithm was improved to enhance its robustness and an efficient modeling method, "5+X" was proposed. This new method is suitable for mixed line planning management in sophisticated manufacturing projects and has value for practical applications. [ABSTRACT FROM AUTHOR]

Remote Sensing Image Object Detection (RSIOD) faces the challenges of multi-scale objects, dense overlap of objects and uneven data distribution in practical applications. In order to solve these problems, this paper proposes a YOLO-ACPHD RSIOD algorithm. The algorithm adopts Adaptive Condition Awareness Technology (ACAT), which can dynamically adjust the parameters of the convolution kernel, so as to adapt to the objects of different scales and positions. Compared with the traditional fixed convolution kernel, this dynamic adjustment can better adapt to the diversity of scale, direction and shape of the object, thus improving the accuracy and robustness of Object Detection (OD). In addition, a High-Dimensional Decoupling Technology (HDDT) is used to reduce the amount of calculation to 1/N by performing deep convolution on the input data and then performing spatial convolution on each channel. When dealing with large-scale Remote Sensing Image (RSI) data, this reduction in computation can significantly improve the efficiency of the algorithm and accelerate the speed of OD, so as to better adapt to the needs of practical application scenarios. Through the experimental verification of the RSOD RSI data set, the YOLO-ACPHD model in this paper shows very satisfactory performance. The F1 value reaches 0.99, the Precision value reaches 1, the Precision-Recall value reaches 0.994, the Recall value reaches 1, and the mAP value reaches 99.36 % , which indicates that the model shows the highest level in the accuracy and comprehensiveness of OD. [ABSTRACT FROM AUTHOR]

Recent research has focused on applying blockchain technology to solve security-related problems in Internet of Things (IoT) networks. However, the inherent scalability issues of blockchain technology become apparent in the presence of a vast number of IoT devices and the substantial data generated by these networks. Therefore, in this paper, we use a lightweight consensus algorithm to cater to these problems. We propose a scalable blockchain-based framework for managing IoT data, catering to a large number of devices. This framework utilizes the Delegated Proof of Stake (DPoS) consensus algorithm to ensure enhanced performance and efficiency in resource-constrained IoT networks. DPoS being a lightweight consensus algorithm leverages a selected number of elected delegates to validate and confirm transactions, thus mitigating the performance and efficiency degradation in the blockchain-based IoT networks. In this paper, we implemented an Interplanetary File System (IPFS) for distributed storage, and Docker to evaluate the network performance in terms of throughput, latency, and resource utilization. We divided our analysis into four parts: Latency, throughput, resource utilization, and file upload time and speed in distributed storage evaluation. Our empirical findings demonstrate that our framework exhibits low latency, measuring less than 0.976 ms. The proposed technique outperforms Proof of Stake (PoS), representing a state-of-the-art consensus technique. We also demonstrate that the proposed approach is useful in IoT applications where low latency or resource efficiency is required. [ABSTRACT FROM AUTHOR]

In order to address the challenges of identifying, detecting, and tracking moving objects in video surveillance, this paper emphasizes image-based dynamic entity detection. It delves into the complexities of numerous moving objects, dense targets, and intricate backgrounds. Leveraging the You Only Look Once (YOLOv3) algorithm framework, this paper proposes improvements in image segmentation and data filtering to address these challenges. These enhancements form a novel multi-object detection algorithm based on an improved YOLOv3 framework, specifically designed for video applications. Experimental validation demonstrates the feasibility of this algorithm, with success rates exceeding 60% for videos such as "jogging", "subway", "video 1", and "video 2". Notably, the detection success rates for "jogging" and "video 1" consistently surpass 80%, indicating outstanding detection performance. Although the accuracy slightly decreases for "Bolt" and "Walking2", success rates still hover around 70%. Comparative analysis with other algorithms reveals that this method's tracking accuracy surpasses that of particle filters, Discriminative Scale Space Tracker (DSST), and Scale Adaptive Multiple Features (SAMF) algorithms, with an accuracy of 0.822. This indicates superior overall performance in target tracking. Therefore, the improved YOLOv3-based multi-object detection and tracking algorithm demonstrates robust filtering and detection capabilities in noise-resistant experiments, making it highly suitable for various detection tasks in practical applications. It can address inherent limitations such as missed detections, false positives, and imprecise localization. These improvements significantly enhance the efficiency and accuracy of target detection, providing valuable insights for researchers in the field of object detection, tracking, and recognition in video surveillance. [ABSTRACT FROM AUTHOR]

Wireless sensor network (WSN) location is a significant research area. In complex environments like forests, inaccurate signal intensity ranging is a major challenge. To address this issue, this paper presents a reliable WSN distance measurement-positioning algorithm for forest environments. The algorithm divides the positioning area into several sub-regions based on the discrete coefficient of the collected signal strength. Then, using the fitting method based on the signal intensity value of each sub-region, the algorithm derives the reference points of the logarithmic distance path loss model and path loss index. Finally, the algorithm locates target nodes using anchor nodes in different regions. Additionally, to enhance the positioning accuracy, weight values are assigned to the positioning result based on the discrete coefficient of the signal intensity in each sub-region. Experimental results demonstrate that the proposed WSN algorithm has high precision in forest environments. [ABSTRACT FROM AUTHOR]

Recent rank-based attacks have reduced the security of Rainbow, which is one of the multi-layer UOV signatures, below the NIST security requirements by speeding up iterative kernel-finding operations using classical mathematics techniques. If quantum algorithms are applied to perform these iterative operations, the rank-based attacks may be more threatening to multi-layer UOV, including Rainbow. In this paper, we propose a quantum rectangular MinRank attack called the Q-rMinRank attack, the first quantum approach to key recovery attacks on multi-layer UOV signatures. Our attack is a general model applicable to multi-layer UOV signature schemes, and in this paper, we provide examples of its application to Rainbow and the Korean TTA standard, HiMQ. We design two quantum oracle circuits to find the kernel in consideration of the depth-width trade-off of quantum circuits. One is to reduce the width of the quantum circuits using qubits as a minimum, and the other is to reduce the depth using parallelization instead of using a lot of qubits. By designing quantum circuits to find kernels with fewer quantum resources and complexity by adding mathematical techniques, we achieve quadratic speedup for the MinRank attack to recover the private keys of multi-layer UOV signatures. We also estimate quantum resources for the designed quantum circuits and analyze quantum complexity based on them. The width-optimized circuit recovers the private keys of Rainbow parameter set V with only 1089 logical qubits. The depth-optimized circuit recovers the private keys of Rainbow parameter set V with a quantum complexity of 2 174 , which is lower than the complexity of 2 221 recovering the secret key of AES-192, which provides the same security level as parameter set III. [ABSTRACT FROM AUTHOR]

In recent times, video inpainting techniques have intended to fill the missing areas or gaps in a video by utilizing known pixels. The variety in brightness or difference of the patches causes the state-of-the-art video inpainting techniques to exhibit high computation complexity and create seams in the target areas. To resolve these issues, this paper introduces a novel video inpainting technique that employs the Morphological Haar Wavelet Transform combined with the Krill Herd based Criminisi algorithm (MHWT-KHCA) to address the challenges of high computational demand and visible seam artifacts in current inpainting practices. The proposed MHWT-KHCA algorithm strategically reduces computation times and enhances the seamlessness of the inpainting process in videos. Through a series of experiments, the technique is validated against standard metrics such as peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM), where it demonstrates superior performance compared to existing methods. Additionally, the paper outlines potential real-world applications ranging from video restoration to real-time surveillance enhancement, highlighting the technique's versatility and effectiveness. Future research directions include optimizing the algorithm for diverse video formats and integrating machine learning models to advance its capabilities further. [ABSTRACT FROM AUTHOR]

Advances in computer image recognition have significantly impacted many industries, including healthcare, security and autonomous systems. This paper aims to explore the potential of improving image algorithms to enhance computer image recognition. Specifically, we will focus on regression methods as a means to improve the accuracy and efficiency of identifying images. In this study, we will analyze various regression techniques and their applications in computer image recognition, as well as the resulting performance improvements through detailed examples and data analysis. This paper deals with the problems related to visual image processing in outdoor unstructured environment. Finally, the heterogeneous patterns are converted into the same pattern, and the heterogeneous patterns are extracted from the fusion features of data modes. The simulation results show that the perception ability and recognition ability of outdoor image recognition in complex environment are improved. [ABSTRACT FROM AUTHOR]

As the terminal of the power system, the distribution network is the main area where failures occur. In addition, with the integration of distributed generation, the traditional distribution network becomes more complex, rendering the conventional fault location algorithms based on a single power supply obsolete. Therefore, it is necessary to seek a new algorithm to locate the fault of the distributed power distribution network. In existing fault localization algorithms for distribution networks, since there are only two states of line faults, which can usually be represented by 0 and 1, most algorithms use discrete algorithms with this characteristic for iterative optimization. Therefore, this paper combines the advantages of the particle swarm algorithm and genetic algorithm and uses continuous real numbers for iteration to construct a successive particle swarm genetic algorithm (SPSO-GA) different from previous algorithms. The accuracy, speed, and fault tolerance of SPSO-GA, discrete particle swarm Genetic algorithm, and artificial fish swarm algorithm are compared in an IEEE33-node distribution network with the distributed power supply. The simulation results show that the SPSO-GA algorithm has high optimization accuracy and stability for single, double, or triple faults. Furthermore, SPSO-GA has a rapid convergence velocity, requires fewer particles, and can locate the fault segment accurately for the distribution network containing distorted information. [ABSTRACT FROM AUTHOR]

Aiming at the problems of identifying storage pest tobacco pest beetles from images that have few object pixels and considerable image noise, and therefore suffer from lack of information and identifiable features, this paper proposes an automatic monitoring method of tobacco beetle based on Multi-scale Global residual Feature Pyramid Network and Dual-path Deformable Attention (MGrFPN-DDrGAM). Firstly, a Multi-scale Global residual Feature Pyramid Network (MGrFPN) is constructed to obtain rich high-level semantic features and more complete information on low-level features to reduce missed detection; Then, a Dual-path Deformable receptive field Guided Attention Module (DDrGAM) is designed to establish long-range channel dependence, guide the effective fusion of features and improve the localization accuracy of tobacco beetles by fitting the spatial geometric deformation features of and capturing the spatial information of feature maps with different scales to enrich the feature information in the channel and spatial. Finally, to simulate a real scene, a multi-scene tobacco beetle dataset is created. The dataset includes 28,080 images and manually labeled tobacco beetle objects. The experimental results show that under the framework of the Faster R-CNN algorithm, the detection precision and recall rate of this method can reach 91.4% and 98.4% when the intersection ratio (IoU) is 0.5. Compared with Faster R-CNN and FPN, when the intersection ratio (IoU) is 0.7, the detection precision is improved by 32.9% and 6.9%, respectively. The proposed method is superior to the current mainstream methods. [ABSTRACT FROM AUTHOR]

This paper presents an improved genetic algorithm focused on multi-threshold optimization for image segmentation in digital pathology. By innovatively enhancing the selection mechanism and crossover operation, the limitations of traditional genetic algorithms are effectively addressed, significantly improving both segmentation accuracy and computational efficiency. Experimental results demonstrate that the improved genetic algorithm achieves the best balance between precision and recall within the threshold range of 0.02 to 0.05, and it significantly outperforms traditional methods in terms of segmentation performance. Segmentation quality is quantified using metrics such as precision, recall, and F1 score, and statistical tests confirm the superior performance of the algorithm, especially in its global search capabilities for complex optimization problems. Although the algorithm's computation time is relatively long, its notable advantages in segmentation quality, particularly in handling high-precision segmentation tasks for complex images, are highly pronounced. The experiments also show that the algorithm exhibits strong robustness and stability, maintaining reliable performance under different initial conditions. Compared to general segmentation models, this algorithm demonstrates significant advantages in specialized tasks, such as pathology image segmentation, especially in resource-constrained environments. Therefore, this improved genetic algorithm offers an efficient and precise multi-threshold optimization solution for image segmentation, providing valuable reference for practical applications. [ABSTRACT FROM AUTHOR]

In practical engineering applications, factors like dust adhesion and environmental changes can cause photovoltaic arrays to exhibit multiple peaks in output power. An optimization algorithm with global optimization capability is needed to track its maximum power. In this regard, this paper proposes an improved marine predator algorithm (IMPA) to extract the maximum power point of photovoltaic system under complex solar irradiation conditions. To overcome the issues in the traditional marine predator algorithm (MPA), the opposition-based learning(OBL) strategy is introduced in IMPA, and the sine cosine algorithm (SCA) is integrated into the iteration stage to enhance the search ability of the algorithm. Furthermore, the low-order converter in the traditional MPPT control system is replaced by the Zeta converter, which increases the operating voltage range. Ultimately, simulation results demonstrate that the MPPT based on IMPA has higher tracking efficiency and shorter response time.The experimental results also indicate the practical feasibility of this method, as well as its high level of stability and robustness. [ABSTRACT FROM AUTHOR]

In this paper, an enhanced equilibrium optimization (EO) version named Levy-opposition-equilibrium optimization (LOEO) is proposed to select effective features in network intrusion detection systems (IDSs). The opposition-based learning (OBL) approach is applied by this algorithm to improve the diversity of the population. Also, the Levy flight method is utilized to escape local optima. Then, the binary rendition of the algorithm called BLOEO is employed to feature selection in IDSs. One of the main challenges in IDSs is the high-dimensional feature space, with many irrelevant or redundant features. The BLOEO algorithm is designed to intelligently select the most informative subset of features. The empirical findings on NSL-KDD, UNSW-NB15, and CIC-IDS2017 datasets demonstrate the effectiveness of the BLOEO algorithm. This algorithm has an acceptable ability to effectively reduce the number of data features, maintaining a high intrusion detection accuracy of over 95%. Specifically, on the UNSW-NB15 dataset, BLOEO selected only 10.8 features on average, achieving an accuracy of 97.6% and a precision of 100%. [ABSTRACT FROM AUTHOR]

With the rapid development of AI and big data mining technologies, computerized medical decision-making has become increasingly prominent. The aim of high-utility pattern mining (HUPM) is to discover meaningful patterns in medical databases that contribute to maximizing the utility from the perspective of diagnosis. However, HUPM pays less attention to the interpretability and explainability of these patterns in medical decision-making scenarios. This paper proposes a novel algorithm called the Improved fuzzy high-utility pattern mining (IF-HUPM) to address this problem. First, the paper applies a fuzzy preprocessing method to divide the fuzzy intervals of a medical quantitative data set, which enhances the fuzziness and interpretability of the data. Next, in the process of IF-HUPM, both fuzzy tree and list structures are employed to calculate fuzzy high-utility values. By combining the characteristics of the one-stage and two-stage algorithms of HUPM, an adaptive-phase Fuzzy HUPM hybrid frame is proposed. The experimental results demonstrate that the proposed IF-HUPM algorithm enhances both accuracy and efficiency and the mining process requires less time and space on average. [ABSTRACT FROM AUTHOR]

Consensus plays a crucial role in blockchain technology, with the deleted proof of stake (DPoS) consensus mechanism commonly utilized in both public and hybrid chains. However, the current DPoS mechanism faces challenges such as low node engagement in voting and potential security risks posed by malicious nodes. In response, we propose the DL-DPoS (deep link–delegated proof of stake) mechanism, which builds upon the DPoS framework. The DL-DPoS incorporates the LINK incentive mechanism to encourage inactive nodes to participate in voting and leader selection. Furthermore, a comprehensive credit scoring system based on wealth, performance, and stability is introduced to enhance the security of elected nodes. The verification process is optimized to involve all nodes except the leader node, and mechanisms are in place to handle malicious attacks by degrading or removing offending nodes and redistributing their responsibilities to the LINK group. Performance testing of the DL-DPoS mechanism, conducted through blockchain simulation tests using the GO language, shows a 23% increase in throughput compared to DPoS, with over 95% node participation and improved distribution of rights and equity. These results indicate the enhanced performance, security, and stability of the DL-DPoS consensus mechanism. [ABSTRACT FROM AUTHOR]

Cardiac monitoring systems in Internet of Things (IoT) healthcare, reliant on limited battery and computational capacity, need efficient local processing and wireless transmission for comprehensive analysis. Due to the power-intensive wireless transmission in IoT devices, ECG signal compression is essential to minimize data transfer. This paper presents a real-time, low-complexity algorithm for compressing electrocardiogram (ECG) signals. The algorithm uses just nine arithmetic operations per ECG sample point, generating a hybrid Pulse Width Modulation (PWM) signal storable in a compact 4-bit resolution format. Despite its simplicity, it performs comparably to existing methods in terms of Percentage Root-Mean-Square Difference (PRD) and space-saving while significantly reducing complexity and maintaining robustness against signal noise. It achieves an average Bit Compression Ratio (BCR) of 4 and space savings of 90.4% for ECG signals in the MIT-BIH database, with a PRD of 0.33% and a Quality Score (QS) of 12. The reconstructed signal shows no adverse effects on QRS complex detection and heart rate variability, preserving both the signal amplitude and periodicity. This efficient method for transferring ECG data from wearable devices enables real-time cardiac activity monitoring with reduced data storage requirements. Its versatility suggests potential broader applications, extending to compression of various signal types beyond ECG. [ABSTRACT FROM AUTHOR]

In quantum computing there are quite a few universal gate sets, each having their own characteristics. In this paper we study the Clifford+CS universal fault-tolerant gate set. The CS gate is used is many applications and this gate set is an important alternative to Clifford+T. We introduce a generating set in order to represent any unitary implementable by this gate set and with this we derive a bound on the CS-count of arbitrary multi-qubit unitaries. Analysing the channel representation of the generating set elements, we infer J n CS ⊂ J n T , where J n CS and J n T are the set of unitaries exactly implementable by the Clifford+CS and Clifford+T gate sets, respectively. We develop CS-count optimal synthesis algorithms for both approximately and exactly implementable multi-qubit unitaries. With the help of these we derive a CS-count-optimal circuit for Toffoli, implying J n Tof = J n CS , where J n Tof is the set of unitaries exactly implementable by the Clifford+Toffoli gate set. Such conclusions can have an important impact on resource estimates of quantum algorithms. [ABSTRACT FROM AUTHOR]

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 average Q A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , and N 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. [ABSTRACT FROM AUTHOR]

Remote sensing image fusion is dedicated to obtain a high-resolution multispectral (HRMS) image without spatial or spectral distortion compared to the single source image. In this paper, a novel fusion algorithm based on Bayesian estimation for remote sensing images is proposed from the new perspective of risk decisions. In this study, an observation model based on Bayesian estimation for remote sensing image fusion is constructed. Three categories of probabilities including prior, conditional and posterior probabilities are calculated after an intensity-hue-saturation (IHS) transformation is applied to the original low-resolution MS image. To obtain the desired HRMS image, with the corrected posterior probability, a fusion rule based on Bayesian decisions is designed to estimate which pixels to select from the panchromatic (PAN) image and the intensity component of the MS image. The selected pixels constitute a new component that will participate in an IHS inverse transformation to yield the fused image. Extensive experiments were performed on the Pleiades, WorldView-3, and IKONOS datasets, and the results demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

The Mini-Mental State Examination (MMSE) is a widely employed screening tool for the severity of cognitive impairment. Among the MMSE items, the pentagon copying test (PCT) requires participants to accurately replicate a sample of two interlocking pentagons. While the PCT is traditionally scored on a binary scale, there have been limited developments of granular scoring scale to assess task performance. In this paper, we present a novel three-stage algorithm, called Quantification of Interlocking Pentagons (QIP) which quantifies PCT performance by computing the areas of individual pentagons and their intersection areas, and a balance ratio between the areas of the two individual pentagons. The three stages of the QIP algorithm include: (1) detection of line segments, (2) unraveling of the interlocking pentagons, and (3) quantification of areas. A set of 497 PCTs from 84 participants including their baseline and follow-up PCTs from the Rush Memory and Aging Project was selected blinded about their cognitive and clinical status. Analysis of the quantified data revealed a significant inverse relationship between age and balance ratio (beta = − 0.49, p = 0.0033), indicating that older age was associated with a smaller balance ratio. In addition, balance ratio was associated with perceptual speed (r = 0.71, p = 0.0135), vascular risk factors (beta = − 3.96, p = 0.0269), and medical conditions (beta = − 2.78, p = 0.0389). The QIP algorithm can serve as a useful tool for enhancing the scoring of performance in the PCT. [ABSTRACT FROM AUTHOR]

High precision is a very important index in target tracking. In order to improve the prediction accuracy of target tracking, an optimized Kalman filter approach based on improved Gray Wolf algorithm (IGWO-OKF) is proposed in this paper. Since the convergence speed of traditional Gray Wolf algorithm is slow, meanwhile, the number of gray wolves and the choice of the maximum number of iterations has a great influence on the algorithm, a nonlinear control parameter combination adjustment strategy is proposed. An improved Grey Wolf Optimization algorithm (IGWO) is formed by determining the best combination of adjustment parameters through the fastest iteration speed of the algorithm. The improved Grey Wolf Optimization algorithm (IGWO) is formed, and the process noise covariance matrix and observation noise covariance matrix in Kalman filter are optimized by IGWO. The proposed approach is applied into. The experiment results show that the proposed IGWO-OKF approach has low error, high accuracy and good prediction effect. [ABSTRACT FROM AUTHOR]

This paper presents a fusion algorithm based on the enhanced RRT* TEB algorithm. The enhanced RRT* algorithm is utilized for generating an optimal global path. Firstly, proposing an adaptive sampling function and extending node bias to accelerate global path generation and mitigate local optimality. Secondly, eliminating path redundancy to minimize path length. Thirdly, imposing constraints on the turning angle of the path to enhance path smoothness. Conducting kinematic modeling of the mobile robot and optimizing the TEB algorithm to align the trajectory with the mobile robot's kinematics. The integration of these two algorithms culminates in the development of a fusion algorithm. Simulation and experimental results demonstrate that, in contrast to the traditional RRT* algorithm, the enhanced RRT* algorithm achieves a 5.8% reduction in path length and a 62.5% decrease in the number of turning points. Utilizing the fusion algorithm for path planning, the mobile robot generates a superior, seamlessly smooth global path, adept at circumventing obstacles. Furthermore, the local trajectory meticulously conforms to the kinematic constraints of the mobile robot. [ABSTRACT FROM AUTHOR]

There are a series of challenges in microgrid transactions, and blockchain technology holds the promise of addressing these challenges. However, with the increasing number of users in microgrid transactions, existing blockchain systems may struggle to meet the growing demands for transactions. Therefore, this paper proposes an efficient and secure blockchain consensus algorithm designed to meet the demands of large-scale microgrid electricity transactions. The algorithm begins by utilizing a Spectral clustering algorithm to partition the blockchain network into different lower-level consensus set based on the transaction characteristics of nodes. Subsequently, a dual-layer consensus process is employed to enhance the efficiency of consensus. Additionally, we have designed a secure consensus set leader election strategy to promptly identify leaders with excellent performance. Finally, we have introduced an authentication method that combines zero-knowledge proofs and key sharing to further mitigate the risk of malicious nodes participating in the consensus. Theoretical analysis indicates that our proposed consensus algorithm, incorporating multiple layers of security measures, effectively withstands blockchain attacks such as denial of service. Simulation experiment results demonstrate that our algorithm outperforms similar blockchain algorithms significantly in terms of communication overhead, consensus latency, and throughput. [ABSTRACT FROM AUTHOR]

During the manufacturing process of printed circuit boards (PCBs), quality defects can occur, which can affect the performance and reliability of PCBs. Existing deep learning-based PCB defect detection methods are difficult to simultaneously achieve the goals of high detection accuracy, fast detection speed, and small number of parameters. Therefore, this paper proposes a PCB defect detection algorithm based on CDI-YOLO. Firstly, the coordinate attention mechanism (CA) is introduced to improve the backbone and neck network of YOLOv7-tiny, enhance the feature extraction capability of the model, and thus improve the accuracy of model detection. Secondly, DSConv is used to replace part of the common convolution in YOLOv7-tiny to achieve lower computing costs and faster detection speed. Finally, Inner-CIoU is used as the bounding box regression loss function of CDI-YOLO to speed up the bounding box regression process. The experimental results show that the method achieves 98.3% mAP on the PCB defect dataset, the detection speed is 128 frames per second (FPS), the parameters is 5.8 M, and the giga floating-point operations per second (GFLOPs) is 12.6 G. Compared with the existing methods, the comprehensive performance of this method has advantages. [ABSTRACT FROM AUTHOR]

The paper proposes a nonlinear controller called dual super-twisting sliding mode command (DSTSMC) for controlling and regulating the rotor side converter (RSC) of multi-rotor wind power systems that use doubly-fed induction generators. It was proposed that this controller be developed as an alternative to the direct power control (DPC), which makes use of a pulse width modulation (PWM) strategy to regulate the RSC's functioning. Overcoming the power/current quality issue with the proposed technique (DPC-DSTSMC-PWM) is characterized by great robustness and excellent performance. The designed strategy was contrasted with the standard method of control and other methods already in use. So, the unique proposed control strategy's robustness, performance, efficiency, and efficacy in enhancing system characteristics were tested and validated in Matlab/Simulink. In both tests, the proposed method resulted in significant improvements, reducing active power ripples by 83.33%, 57.14%, and 48.57% in the proposed tests. When compared with the traditional regulation method, the reduction rates of reactive power ripples are 64.06%, 52.47%, and 68.7% in the tests. However, in contrast to the conventional method, the proposed tests showed a decrease of between 72.46%, 50%, and 76.22% in the value of total harmonic distortion (THD) of the provided currents. These ratios show how effective the proposed plan is in ameliorating and enhancing aspects of the energy system. [ABSTRACT FROM AUTHOR]

In this paper, a Cluster-based Synthetic minority oversampling technique (SMOTE) Both-sampling (CSBBoost) ensemble algorithm is proposed for classifying imbalanced data. In this algorithm, a combination of over-sampling, under-sampling, and different ensemble algorithms, including Extreme Gradient Boosting (XGBoost), random forest, and bagging, is employed in order to achieve a balanced dataset and address the issues including redundancy of data after over-sampling, information loss in under-sampling, and random sample selection for sampling and sample generation. The performance of the proposed algorithm is evaluated and compared to different state-of-the-art competing algorithms based on 20 benchmark imbalanced datasets in terms of the harmonic mean of precision and recall (F1) and area under the receiver operating characteristics curve (AUC) measures. Based on the results, the proposed CSBBoost algorithm performs significantly better than the competing algorithms. In addition, a real-world dataset is used to demonstrate the applicability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

For state estimation of multi-source asynchronous measurement systems with measurement missing phenomena, this paper proposes a distributed sequential inverse covariance intersection (DSICI) fusion algorithm based on conditional Kalman filtering method. It is mainly divided into synchronized state space module, local filtering module and fusion estimation module. The missing measurements occurring in the system are modelled and described by a set of random variables obeying a Bernoulli distribution. The synchronized state space module uses a state iteration method to synchronize the asynchronous measurement system at the moment of measurement update and it ensures the integrity of the measurement information. The local filtering module uses a conditional Kalman filtering algorithm for filter estimation. The reliability of the local filtering results is guaranteed because the local estimator designs a method to interact information with the domain sensors. The fusion estimation module designs a DSICI fusion algorithm with higher accuracy and satisfying consistency, which fuses the filtering results provided by each sensor when the relevant information between multiple sensors is unknown. Simulation examples demonstrate the excellent performance of the proposed algorithm, with a 33% improvement in accuracy over existing algorithms and an iteration time of less than 3 ms. [ABSTRACT FROM AUTHOR]

This paper presents a numerical algorithm for environmental/economic load dispatch (EELD) with emissions constraints, which takes into account the emissions trading system's effect on electricity generation cost and is implemented using a Python computer program. The developed program is applied to a power system of six (6) fossil-fueled electricity generating units with NOx, SO2 and CO2 constraints and proved to be significantly beneficial not only for the environment but also for the power company and the consumers. The proposed algorithm uses multi-objective optimization and incorporates both fuel and emissions allowances costs. The schedule of generating units is calculated and the testing of all possible weighting factor combinations with resolution of 0.01 is carried out showing that the proposed algorithm is fast, cost effective and environmentally friendly. [ABSTRACT FROM AUTHOR]

Metaheuristic algorithms, widely applied across various domains due to their simplicity and strong optimization capabilities, play a crucial role in problem-solving. While the Aquila Optimizer is recognized for its effectiveness, it often exhibits slow convergence rates and susceptibility to local optima in certain scenarios. To address these concerns, this paper introduces an enhanced version, termed Tent-enhanced Aquila Optimizer (TEAO). TEAO incorporates the Tent chaotic map to initialize the Aquila population, promoting a more uniform distribution within the solution space. To balance exploration and exploitation, novel formulas are proposed, accelerating convergence while ensuring precision. The effectiveness of the TEAO algorithm is validated through a comprehensive comparison with 14 state-of-the-art algorithms using 23 classical benchmark test functions. Additionally, to assess the practical feasibility of the approach, TEAO is applied to six constrained engineering problems and benchmarked against the performance of the same 14 algorithms. All experimental results consistently demonstrate that TEAO outperforms other advanced algorithms in terms of solution quality and stability, establishing it as a more competitive choice for optimization tasks. [ABSTRACT FROM AUTHOR]

The paper proposes a SOC (State of Charge) estimation method for lead–carbon batteries based on the GA-MIUKF algorithm. The GA-MIUKF algorithm combines GA (Genetic Algorithm) for global search and optimization with the MI-UKF (Multi-innovation Unscented Kalman Filter) algorithm for estimating the SOC of lead–carbon batteries. By establishing an equivalent circuit model for the battery, the GA is employed to globally search and optimize the battery model parameters and the noise variance parameters in the MI-UKF algorithm. Comparative analyses with the UKF (Unscented Kalman Filter) algorithms and MI-UKF algorithms reveal that the SOC estimation method based on the GA-MIUKF algorithm yields more accurate results for lead–carbon battery SOC estimation, with an average estimation error of 2.0%. This highlights the efficacy of the proposed approach in enhancing SOC estimation precision. [ABSTRACT FROM AUTHOR]

The paper focuses on the correction of Illumina WGS sequencing reads. We provide an extensive evaluation of the existing correctors. To this end, we measure an impact of the correction on variant calling (VC) as well as de novo assembly. It shows, that in selected cases read correction improves the VC results quality. We also examine the algorithms behaviour in a processing of Illumina NovaSeq reads, with different reads quality characteristics than in older sequencers. We show that most of the algorithms are ready to cope with such reads. Finally, we introduce a new version of RECKONER, our read corrector, by optimizing it and equipping with a new correction strategy. Currently, RECKONER allows to correct high-coverage human reads in less than 2.5 h, is able to cope with two types of reads errors: indels and substitutions, and utilizes a new, based on a two lengths of oligomers, correction verification technique. [ABSTRACT FROM AUTHOR]

To quickly determine the blasting block degree and conduct an accurate and objective analysis of the tunnel blasting effect, this study has enhanced and improved upon the traditional genetic algorithm and Otsu algorithm. It has combined it with the marking watershed method and utilized ground digital acquisition to capture images of blasting debris. These images are then used in our custom-developed blasting analysis software to calculate the blasting block degree distribution and provide a quantitative analysis of blasting block degree. The research results show that the optimized image segmentation algorithm effectively improves the traditional threshold segmentation method on the poor effect of segmentation of the edge of the adherent block or the direct application of the watershed segmentation of the over-segmentation problem, to improve the segmentation accuracy based on the new segmentation technology is close to the traditional technology in terms of time. Through the self-developed software, the construction personnel in the project site to quickly obtain the blasting block degree histogram, block degree cumulative curve and other important indicators of the evaluation of the effect of blasting block degree, to provide data support for on-site construction, to assist in the modification of the blasting program, and to improve the efficiency of construction. This study realizes the rapid detection and block identification of blasting blocks, provides data support for the optimization of blasting parameters, and has good application and promotion value. [ABSTRACT FROM AUTHOR]

Due to their high flexibility, low cost, and ease of handling, Unmanned Aerial Vehicles (UAVs) are often used to perform difficult tasks in complex environments. Stable and reliable path planning capability is the fundamental demand for UAVs to accomplish their flight tasks. Most researches on UAV path planning are carried out under the premise of known environmental information, and it is difficult to safely reach the target position in the face of unknown environment. Thus, an autonomous collision-free path planning algorithm for UAVs in unknown complex environments (APPA-3D) is proposed. An anti-collision control strategy is designed using the UAV collision safety envelope, which relies on the UAV's environmental awareness capability to continuously interact with external environmental information. A dynamic reward function of reinforcement learning combined with the actual flight environment is designed and an optimized reinforcement learning action exploration strategy based on the action selection probability is proposed. Then, an improved RL algorithm is used to simulate the UAV flight process in unknown environment, and the algorithm is trained by interacting with the environment, which finally realizes autonomous collision-free path planning for UAVs. The comparative experimental results in the same environment show that APPA-3D can effectively guide the UAV to plan a safe and collision-free path from the starting point to the target point in an unknown complex 3D environment. [ABSTRACT FROM AUTHOR]

In the realm of deep learning-based networks for dehazing using paired clean-hazy image datasets to address complex real-world haze scenarios in daytime environments and cross-dataset challenges remains a significant concern due to algorithmic inefficiencies and color distortion. To tackle these issues, we propose SwinTieredHazymers (STH), a dehazing network designed to adaptively discern pixel intensities in hazy images and compute haze residue for clarity restoration. Through a unique three-branch design, we hierarchically modulate haze residuals by leveraging the global features brought by Transformer and the local features brought by Convolutional Neural Network (CNN) which has led to the algorithm's widespread applicability. Experimental results demonstrate that our approach surpasses advanced single-image dehazing methods in both quantitative metrics and visual fidelity for real-world hazy image dehazing, while also exhibiting strong performance in cross-dataset dehazing scenarios. [ABSTRACT FROM AUTHOR]

Segmentation of multiple sclerosis (MS) lesions on brain MRI scans is crucial for diagnosis, disease and treatment monitoring but is a time-consuming task. Despite several automated algorithms have been proposed, there is still no consensus on the most effective method. Here, we applied a consensus-based framework to improve lesion segmentation on T1-weighted and FLAIR scans. The framework is designed to combine publicly available state-of-the-art deep learning models, by running multiple segmentation tasks before merging the outputs of each algorithm. To assess the effectiveness of the approach, we applied it to MRI datasets from two different centers, including a private and a public dataset, with 131 and 30 MS patients respectively, with manually segmented lesion masks available. No further training was performed for any of the included algorithms. Overlap and detection scores were improved, with Dice increasing by 4-8% and precision by 3-4% respectively for the private and public dataset. High agreement was obtained between estimated and true lesion load (ρ = 0.92 and ρ = 0.97) and count (ρ = 0.83 and ρ = 0.94). Overall, this framework ensures accurate and reliable results, exploiting complementary features and overcoming some of the limitations of individual algorithms. [ABSTRACT FROM AUTHOR]

The worldwide exploration of the ethanolysis protocol (EP) has decreased despite the multifaceted benefits of ethanol, such as lower toxicity, higher oxygen content, higher renewability, and fewer emission tail compared to methanol, and the enhanced fuel properties with improved engine characteristics of multiple-oily feedstocks (MOFs) compared to single-oily feedstocks. The study first proposed a strategy for the optimisation of ethylic biodiesel synthesis from MOFs: neem, animal fat, and jatropha oil (NFJO) on a batch reactor. The project's goals were to ensure environmental benignity and encourage the use of totally biobased products. This was made possible by the introduction of novel population based algorithms such as Driving Training-Based Optimization (DTBO) and Election-Based Optimization (EBOA), which were compared with the widely used Grey Wolf Optimizer (GWO) combined with Response Surface Methodology (RSM). The yield of NFJO ethyl ester (NFJOEE) was predicted using the RSM technique, and the ideal transesterification conditions were determined using the DTBO, EBOA, and GWO algorithms. Reaction time showed a strong linear relationship with ethylic biodiesel yield, while ethanol-to-NFJO molar ratio, catalyst dosage, and reaction temperature showed nonlinear effects. Reaction time was the most significant contributor to NFJOEE yield.The important fundamental characteristics of the fuel categories were investigated using the ASTM test procedures. The maximum NFJOEE yield (86.3%) was obtained at an ethanol/NFJO molar ratio of 5.99, KOH content of 0.915 wt.%, ethylic duration of 67.43 min, and reaction temperature of 61.55 °C. EBOA outperforms DTBO and GWO regarding iteration and computation time, converging towards a global fitness value equal to 7 for 4 s, 20 for 5 s and 985 for 34 s. The key fuel properties conformed to the standards outlined by ASTMD6751 and EN 14,214 specifications. The NFJOEE fuel processing cost is 0.9328 USD, and is comparatively lesser than that of conventional diesel. The new postulated population based algorithm models can be a prospective approach for enhancing biodiesel production from numerous MOFs and ensuring a balanced ecosystem and fulfilling enviromental benignity when adopted. [ABSTRACT FROM AUTHOR]

The wild horse optimizer (WHO) is a novel metaheuristic algorithm, which has been successfully applied to solving continuous engineering problems. Considering the characteristics of the wild horse optimizer, a discrete version of the algorithm, named discrete wild horse optimizer (DWHO), is proposed to solve the capacitated vehicle routing problem (CVRP). By incorporating three local search strategies-swap operation, reverse operation, and insertion operation-along with the introduction of the largest-order-value (LOV) decoding technique, the precision and quality of the solutions have been enhanced. Experimental results conducted on 44 benchmark instances indicate that, in most test cases, the solving capability of discrete wild horse optimizer surpasses that of basic wild horse optimizer (BWHO), hybrid firefly algorithm, dynamic space reduction ant colony optimization (DSRACO), and discrete artificial ecosystem-based optimization (DAEO). The discrete wild horse optimizer provides a novel approach for solving the capacitated vehicle routing problem and also offers a new perspective for addressing other discrete problems. [ABSTRACT FROM AUTHOR]

The limited capabilities of current quantum hardware significantly constrain the scale of experimental demonstrations of most quantum algorithmic primitives. This makes it challenging to perform benchmarking of the current hardware using useful quantum algorithms, i.e., application-oriented benchmarking. In particular, the Harrow-Hassidim-Lloyd (HHL) algorithm is a critical quantum linear algebra primitive, but the majority of the components of HHL are far out of the reach of noisy intermediate-scale quantum devices, which has led to the proposal of hybrid classical-quantum variants. The goal of this work is to further bridge the gap between proposed near-term friendly implementations of HHL and the kinds of quantum circuits that can be executed on noisy hardware. Our proposal adds to the existing literature of hybrid quantum algorithms for linear algebra that are more compatible with the current scale of quantum devices. Specifically, we propose two modifications to the Hybrid HHL algorithm proposed by Lee et al., leading to our algorithm Hybrid HHL + + : (1) propose a novel algorithm for determining a scaling factor for the linear system matrix that maximizes the utility of the amount of ancillary qubits allocated to the phase estimation component of HHL, and (2) introduce a heuristic for compressing the HHL circuit. We demonstrate the efficacy of our work by running our modified Hybrid HHL on Quantinuum System Model H-series trapped-ion quantum computers to solve different problem instances of small-scale portfolio optimization problems, leading to the largest experimental demonstrations of HHL for an application to date. [ABSTRACT FROM AUTHOR]

The optical microscope algorithm (OMA) is a metaheuristic algorithm that draws inspiration from the magnifying functionality of optical microscopes. This study introduces an enhanced variant of OMA, termed PMSOMA, designed to mitigate the original version's limitations, notably its slow convergence rates and vulnerability to local optima. PMSOMA integrates a piecewise linear chaotic map to refine population initialization and augment diversity, alongside a sparse adaptive exploration mechanism to bolster search efficacy. The performance of PMSOMA was rigorously tested using a suite of 50 benchmark functions, the CEC2017 test suite, feature selection datasets, and three classical engineering challenges. The empirical findings confirm that PMSOMA surpasses both the original OMA and competing algorithms by delivering superior solutions, accelerating convergence, and demonstrating enhanced robustness in convergence. [ABSTRACT FROM AUTHOR]

Even though the capability of aircraft manufacturing has improved, human factors still play a pivotal role in flight accidents. For example, fatigue-related accidents are a common factor in human-led accidents. Hence, pilots' precise fatigue detections could help increase the flight safety of airplanes. The article suggests a model to recognize fatigue by implementing the convolutional neural network (CNN) by implementing flight trainees' face attributions. First, the flight trainees' face attributions are derived by a method called the land-air call process when the flight simulation is run. Then, sixty-eight points of face attributions are detected by employing the Dlib package. Fatigue attribution points were derived based on the face attribution points to construct a model called EMF to detect face fatigue. Finally, the proposed PSO-CNN algorithm is implemented to learn and train the dataset, and the network algorithm achieves a recognition ratio of 93.9% on the test set, which can efficiently pinpoint the flight trainees' fatigue level. Also, the reliability of the proposed algorithm is validated by comparing two machine learning models. [ABSTRACT FROM AUTHOR]

With the rapid advancement of drone technology and the growing applications in the field of drone engineering, the demand for precise and efficient path planning in complex and dynamic environments has become increasingly important. Traditional algorithms struggle with complex terrain, obstacles, and weather changes, often falling into local optima. This study introduces an Improved Crown Porcupine Optimizer (ICPO) for drone path planning, which enables drones to better avoid obstacles, optimize flight paths, and reduce energy consumption. Inspired by porcupines' defense mechanisms, a visuo-auditory synergy perspective is adopted, improving early convergence by balancing visual and auditory defenses. The study also employs a good point set population initialization strategy to enhance diversity and eliminates the traditional population reduction mechanism. To avoid local optima in later stages, a novel periodic retreat strategy inspired by porcupines' precise defenses is introduced for better position updates. Analysis on the IEEE CEC2022 test set shows that ICPO almost reaches the optimal value, demonstrating robustness and stability. In complex mountainous terrain, ICPO achieved optimal values of 778.1775 and 954.0118; in urban terrain, 366.2789 and 910.1682 and ranked first among the compared algorithms, proving its effectiveness and reliability in drone delivery path planning. Looking ahead, the ICPO will provide greater efficiency and safety for drone path planning in navigating complex environments. [ABSTRACT FROM AUTHOR]

Microgrids offer an optimistic solution for delivering electricity to remote regions and incorporating renewable energy into existing power systems. However, the energy balance between generation and consumption remains a significant challenge in microgrid setups. This research presents an adaptive energy management approach for grid-interactive microgrids. The DC microgrid is established by combining solar PV with a battery-supercapacitor (SC) hybrid energy storage system (HESS). The proposed approach integrates the frequency separation strategy with a rule-based algorithm to ensure optimal power sharing among sources while maintaining the safe operation of storage units. Specifically, the battery meets steady-state energy demands, the SC addresses transient power requirements, and the grid support is tailored to system needs. The method employs the dq reference frame technique to control the grid inverter (VSC). The key merits include efficient power allocation, fast regulation of the DC link voltage irrespective of load or generation variations, seamless transition between scenarios, and introduction of a straightforward battery state of charge (SOC)-based coefficient for allocating power between the battery and the grid while enhancing the power quality within the grid. Moreover, safety measures prevent the SC from overcharging, the battery from high current, overcharging, and deep discharging, potentially extending their lifespan. Validation and implementation of the method are conducted using MATLAB/Simulink. [ABSTRACT FROM AUTHOR]

In response to the issues of low merging success rates and poor safety in the on-ramp merging scenario within autonomous driving, we propose an on-ramp merging model for unmanned vehicles based on the Multi-Agent Proximal Policy Optimization (MAPPO) algorithm. Firstly, we introduce an Action-Mask (AM) to prevent the sampling of invalid actions during merging, thus enhancing safety by ensuring only valid actions are considered. Secondly, we incorporate noise advantage values to encourage unmanned vehicles to thoroughly explore the environment and avoid being trapped in local optimal solutions. Experimental results demonstrate that the AM-MAPPO algorithm model improves both safety and traffic efficiency. [ABSTRACT FROM AUTHOR]

Based on the polynomial theory, the error propagation characteristics of the widely used N-step discrete Fourier transform (N-DFT) phase-shift algorithm were analyzed via theoretical analysis, under the effect of Gamma distortion and phase detuning. The results showed that the N-DFT algorithm could not simultaneously suppress both types of error. A robust linear phase-shift (RLPS) algorithm was designed, the performance of the RLPS and 8-DFT algorithms in terms of spectral response, detuning robustness, and G S / N was briefly analysis by Manuel Servin method. The Simulation analysis and comparison of the results show that the RLPS algorithm could suppress both types of error simultaneously, which exhibited better stability and accuracy than N-DFT and exponential algorithms, particularly in gradient measurement stability, peak-to-valley (PV) and root-mean-square (RMS) error suppression. Moreover, a physical experiment apparatus was built to test unidirectionally inclined plane mirror and concave mirror using the RLPS, N-DFT, and exponential algorithms. The results showed that the RLPS algorithm could significantly improve the measurement stability and accuracy in the presence of detuning and without screen Gamma calibration. [ABSTRACT FROM AUTHOR]