Detecting small objects in images poses significant challenges due to their limited pixel representation and the difficulty in extracting sufficient features, often leading to missed or false detections. To address these challenges and enhance detection accuracy, this paper presents an improved small object detection algorithm, CRL-YOLOv5. The proposed approach integrates the CBAM attention mechanism into the C3 module of the backbone network, which enhances the localization accuracy of small objects. Additionally, the Receptive Field Block (RFB) module is introduced to expand the model's receptive field, thereby fully leveraging contextual information. Furthermore, the network architecture is restructured to include an additional detection layer specifically for small objects, allowing for deeper feature extraction from shallow layers. When tested on the VisDrone2019 small object dataset, CRL-YOLOv5 achieved an mAP50 of 39.2%, representing a 5.4% improvement over the original YOLOv5, effectively boosting the detection precision for small objects in images.

In aerospace, robotics, network engineering and mechanical engineering, there exist complex and urgent challenges that can be abstracted into mathematical optimization problems. Therefore, exploring solutions to these optimization problems is a crucial task. Metaheuristic algorithms have been applied across various fields.The Snake Optimization Algorithm (SO) is an innovative metaheuristic method recognized for its efficient solving capabilities.However, this algorithm encounters challenges such as diminished search efficiency in the later stages and a propensity to become ensnared in local optima. To mitigate these issues, this paper introduces an enhanced Snake Optimization Algorithm (ISO). ISO integrates the RIME Algorithm(RIME)and introduces two effective enhancement strategies to improve its capability to evade local optima.To assess the effectiveness of ISO,the population distribution state was first measured using three algorithms, including Star Discrepancy, and the exploration and exploitation performance was analyzed using the CEC2017 test functions. Subsequently, utilized 23 benchmark functions for testing.The evaluation outcomes indicate that ISO exhibits outstanding performance in terms of convergence velocity and robustness.Additionally, it was applied to engineering fields including UAV path planning,Robot path planning, Wireless sensor network node deployment and Pressure vessel design.In comparison to the SO algorithm, the ISO algorithm demonstrates superior stability, converges earlier, and improves its ability to solve for optimal .These findings highlight the significant potential of the ISO algorithm in diverse test functions and a wide range of interdisciplinary problems.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

(1) Background: In most cases, passive isolation control methods are commonly used for the seismic isolation design of bridge engineering. However, for passive seismic isolation devices, due to their non-adjustable performance parameters, it is challenging to achieve a good seismic isolation effect for structures under random and variable seismic loads in the wide frequency range of 0 Hz to 20 Hz; (2) Methods: the sensitivity of the design parameters of the seismic isolation bearing was analyzed using the optimization center gradient method, and an improved genetic algorithm was employed to quickly optimize and obtain the optimal design parameters; (3) Results: the effectiveness of the three-dimensional seismic isolation bearing was validated through experiments. (4) Conclusions: The multi-factor sensitivity analysis approach used in this study for designing novel isolation bearings is applicable not only to seismic design in bridges but also serves as a reference for parameter design in isolation bearings requiring medium to high precision in seismic performance.

Pedestrian multi-target tracking technology plays an important role in artificial intelligence, driverless, virtual reality and other fields. The pedestrian multi-target tracking algorithm DeepSORT based on detection is widely used in industry. It mainly tracks multiple pedestrian targets continuously and keeps their ID unchanged. In order to improve the applicability and tracking accuracy of DeepSORT algorithm, this paper improved the IOU distance measurement in the matching process. At the same time, ResNet50 is used as the feature extraction backbone network, and combined with FPN (Feature Pyramid Network), the appearance features of multi-layer pedestrians are fused to improve the tracking accuracy of DeepSORT algorithm. The proposed algorithm is verified on the public data set MOT-16 and it’s tracking accuracy is enhanced to 4.1%.

Wearing gloves while operating machinery in workshops is an essential precaution to prevent mechanical injuries and burns from high temperatures, among other potential hazards. Ensuring workers are properly equipped with gloves, which is a crucial measure in accident prevention. Glove images often occupy a minimal proportion of the frame and are easily obscured by cluttered backgrounds, especially with limited edge computing resources. Consequently, this study proposes a glove detection algorithm called YOLOv8-AFPN-M-C2f based on YOLOv8, offering swifter detection speeds, lower computational demands, and enhanced accuracy for workshop scenarios. This research innovates by substituting the head of YOLOv8 with the AFPN-M-C2f network, amplifying the pathways for feature vector propagation, and mitigating semantic discrepancies between non-adjacent feature layers. Additionally, the introduction of a superficial feature layer enriches surface feature information, augmenting the model's sensitivity to smaller objects. To assess the performance of the YOLOv8-AFPN-M-C2f model, we conducted multiple experiments using a factory glove detection dataset compiled for this study. The results indicate that the enhanced YOLOv8 model surpasses other network models. Compared to the baseline YOLOv8 model, the refined version shows a 2.6% increase in mAP@50%, a 90.1% rise in FPS, and a 13% reduction in the number of parameters. This research contributes an effective solution for the detection of glove adherence.

Data integrity and security are among the most essential things in this digital era performance. Digital certificates can be one solution to this problem. This research will develop the architecture of digital certificate verification and validation using blockchain. The blockchain concept for digital certificates uses three stages: requirements planning, workshop design, and implementation. Digital certificate files will be tested based on a scenario in which there could be any changes to those files, such as compressing files, changing data of files, inserting images in the file, and rotating files. This system architecture will detect any changes that could occur to the digital certificate file by using a digital signature, Keccak256 hash algorithm, and blockchain. This research shows that change detection accuracy for digital certificate files is 100%. However, there is a digital signature nature that could reduce the accuracy of change detection, and several solutions can be resolved. The average time to generate a signature using blockchain technology is 2.11 seconds, faster than 3.23 seconds when it does not use blockchain. The average time to validate a signature is 2.11 seconds without using blockchain, which is reduced to 0.22 seconds using blockchain technology. This research concludes that the architecture for digital certificate verification and validation using blockchain technology has successfully improved the security of digital certificates. Testing showed that even minor changes to a digital certificate could affect the signature, ensuring the certificate's integrity. For further research, evaluating the performance of various hash algorithms within the blockchain network is recommended.

The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.

Forest fires are one of the world's deadliest natural disasters. Early detection of forest fires can help minimize the damage to ecosystems and forest life. In this paper, we propose an improved fire detection method YOLOv5-IFFDM for YOLOv5. Firstly, the fire and smoke detection accuracy and the network perception accuracy of small targets are improved by adding attention mechanism in the backbone network. Secondly, the loss function is improved and the SoftPool pyramid pooling structure is used to improve the regression accuracy and detection effect of the model and the robustness of the model. In addition, random Mosaic augmentation technique is used to enhance the data to increase the generalization ability of the model, and re-clustering of flame and smoke detection a priori frames are used to improve the accuracy and speed. Finally, the parameters of the convolutional and normalization layers of the trained model are homogeneously merged to further reduce the model responsibility to improve the detection speed. Experimental results on homemade forest fire and smoke datasets show that this algorithm has high detection accuracy and fast detection speed, with average accuracy of fire up to 90.5% and smoke up to 84.3%, and detection speed up to 75 FPS (frames per second transmission), which can meet the requirements of real-time and efficient fire detection.

Aiming at the problems that the parameters of YOLOv5s model are too large and the computing resources of development board memory are limited, a new target detection method based on deep learning YOLOv5 algorithm model is proposed. First, the light-weight module Gz-ShffleNetv2 is used to construct cotton top bud feature extraction unit, which reduces the number of parameters and improves the running speed. It can be better applied in image classification, speed up detection and meet the requirements of mobile end of development board. Secondly, in order to solve the problem of decreasing detection accuracy caused by lightweight, BotNet and C3SE attention mechanism are added to focus on specific areas of cotton terminal bud. Combined with YYG loss function XIOU boundary frame regression loss, more feature information and rich feature MAP were obtained to further improve the accuracy of target detection. Through analysis of research and experimental results, the average accuracy map reached 91.3% under the Windos system NVIDIA Geforce RTX 2060 SUPER detection. While maintaining high precision identification, the number of parameters of YOLOv6 and YOLOv7-tiny network model is reduced by 83% and 53%, respectively, and the detection accuracy is increased by 1.2% and 7.7%, respectively. Compared with YOLOv5 reasoning image, the speed of image is increased by 0.035s, and the detection accuracy of MAP_0.5:0.95 is increased by 1%. At the same time, PyQt5 and YOLOv5 target detection algorithms are used to design a cotton top bud identification system, which makes cotton top bud detection more intuitive and convenient for subsequent hardware development and use.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

Aiming at the problem that dynamic targets in indoor environments lead to low accuracy and large errors in the localization and position estimation of visual SLAM systems and the inability to build maps containing semantic information, a semantic visual SLAM algorithm based on the semantic segmentation network DeepLabV3+ and LK optical flow is proposed based on ORB-SLAM2 system. First, the dynamic target feature points are detected and rejected based on the lightweight semantic segmentation network DeepLabV3+ and LK optical flow method. second, the static environment occluded by the dynamic target is repaired using the time-weighted multi-frame fusion background repair technique. Lastly, the filtered static feature points are used for feature matching and position calculation. Meanwhile, the semantic labeling information of static objects obtained based on the lightweight semantic segmentation network DeepLabV3+ is fused with the static environment information after background repair to generate dense point cloud maps containing semantic information, and the semantic dense point cloud maps are transformed into semantic octree maps using the octree spatial segmentation data structure. The localization accuracy of the visual SLAM system and the construction of the semantic maps are verified using the TUM RGB-D widely used dataset and real scene data, respectively. The experimental results show that the proposed semantic visual SLAM algorithm can effectively reduce the influence of dynamic targets on the system, has a higher localization accuracy, and compared with other advanced algorithms, such as DynaSLAM, has the highest performance in indoor dynamic environments while considering both localization accuracy and real-time performance. In addition, semantic maps can be constructed so that the robot can better understand and adapt to the indoor dynamic environment.

Land cover segmentation, a fundamental task within the domain of remote sensing, boasts a broad spectrum of application potential. In this article, we focus on the land cover segmentation tasks and complete the following research work: Firstly, to address the issues of uneven distribution of foreground and background and significant differences in target scales in remote sensing images, we propose a decoder called MDCFD based on multi-dilation rate convolution fusion. The decoder utilizes dilated convolution to expand the receptive field, enhancing the model's ability to capture global features and thus improving the model's ability to distinguish between foreground and background. Meanwhile, we design a multi-dilation rate convolution fusion module (MDCFM), which fuses the outputs of different dilation rate convolution layers. Secondly, aiming at the problems of diverse scenes, significant differences between categories, and many background interferences in remote sensing images, we propose a hybrid attention module called LKSHAM based on large kernel convolution. This module combines spatial attention and channel attention mechanisms and combines the two attention modules in series. By introducing large kernel convolution, the model's ability to extract contextual information is improved. At the same time, we adopt a strategy of decomposing large kernel convolution into multiple depthwise convolutions to reduce computational complexity. The improved network models designed by this paper can achieve an improvement of over 1.1% in the mIoU metric on segmentation tasks on the Potsdam and Vaihingen datasets.

Traditional path planning algorithms have drawbacks in unmanned vehicle path planning, such as low efficiency, unsuitability for dynamic environments, and high computational complexity. To address these issues, this paper proposes a dynamic path planning method for unmanned vehicles that combines the A* algorithm with an improved Dynamic Window Approach (DWA). Firstly, a collision risk function is incorporated into the DWA algorithm to evaluate scores based on the braking distance corresponding to the current vehicle speed and the distance to obstacles, determining whether timely braking or obstacle avoidance is feasible. The earlier the braking or obstacle avoidance, the higher the score, thereby enhancing the evaluation algorithm of the DWA. Secondly, the key points extracted by the A* algorithm are used as temporary target points for the DWA algorithm, reducing the eight search directions to five. Finally, the key points of the A* algorithm’s path are set as the temporary end points for the DWA algorithm, integrating the two algorithms to plan a smoother curved path that can avoid unknown and dynamic obstacles. Simulation data demonstrates that compared to traditional artificial potential field methods, RRT, and Dijkstra’s algorithm, the new fusion algorithm reduces time by 11.71 seconds, a decrease of 6.9%, and shortens path length by 3.093 meters, a reduction of 4.16%, while increasing average linear velocity by 2.9%. The proposed algorithm ensures smoother paths while also making paths more rational and efficient

Image compression is a top priority today due to the need for faster encoding and decoding. To achieve this, the present study has proposed the use of Canonical Huffman Coding (CHC) as an entropy coder, which has a lower decoding time complexity than binary Huffman codes. For image compression, combining of the Discrete Wavelet Transform (DWT) and CHC with Principal Component Analysis (PCA) has been recommended. The lossy method has been introduced by using PCA, followed by DWT and CHC to enhance compression efficiency. By using DWT and CHC instead of PCA alone, the reconstructed image has been found to have a better peak signal-to-noise ratio (PSNR) value. This study has developed a hybrid compression model combining the advantages of DWT, CHC and PCA. With the increasing use of image data, better image compression techniques are necessary for efficient use of storage space. The proposed technique has achieved up to 60% compression while maintaining high visual quality. This method has also outperformed the currently available techniques in terms of both PSNR (in dB) and bit-per-pixel (bpp) scores. This approach has been tested on various color images, including Peppers 512×512 and Couple 256×256, showing improvement by 17 dB and 22 dB, respectively, while reducing bpp by 0.56 and 0.10, respectively. For grayscale images, i.e., Lena 512×512 and Boat 256×256, the proposed method has shown an improvement by 5 dB and 8 dB, respectively, with a decrease of 0.02 bpp in both cases.

In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

Underwater target detection is widely used in various applications such as underwater search and rescue, underwater environment monitoring, and Marine resources survey. However, the visibility of the underwater environment and the accuracy of target detection can be affected by complex underwater light changes and unpredictable background noise. To address these issues, we propose an improved underwater target detection algorithm based on YOLOv8n. Our algorithm focuses on three aspects. Firstly, we replace the original C2f module with Deformable Convnets v2 to enhance the adaptive ability of the target region in the convolution check feature map and extract the target region's features more accurately. Secondly, we introduce SimAm, a non-parametric attention mechanism, which can deduce and assign three-dimensional attention weights without adding network parameters. Lastly, we optimize the loss function by replacing the CIOU loss function with the Wise-IOU loss function. To conduct our experiments, we create our own dataset of underwater target detection for experimentation. Meanwhile, we also utilized the Pascal VOC dataset to evaluate our approach. The [email protected] and [email protected]:0.95 of the original YOLOv8n algorithm on the underwater target detection were 88.6% and 51.8%, respectively, and the improved algorithm [email protected] and [email protected]:0.95 can reach 91.8% and 55.9%. The original YOLOV8n algorithm was 62.2% and 45.9% [email protected] and [email protected]:0.95 on the Pascal VOC dataset, respectively. The improved YOLOV8n algorithm [email protected] and [email protected]:0.95 were 65.7% and 48.3%, respectively. The floating-point computation volume of the model is reduced by about 6%. The above experimental results prove the effectiveness of our method.

This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

Some traditional robots are based on offline programming reciprocal motion, and with the continuous upgrading of vision technology, more and more tasks are replaced by machine vision. For the current problem of insufficient accuracy of robot target localization based on binocular vision, and an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance For the current problem of insufficient accuracy of robot target localization based on binocular vision, an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance of multi Firstly, the RANSAC algorithm is improved based on the SURF algorithm; then the parallax gradient method is applied to iterate the matched point pairs several times to further optimize the data; then the 3D reconstruction is completed by the program technique; finally the obtained data is finally the obtained data is input into the robot arm and the camera internal and external parameters are obtained by the calibration method so that the robot can accurately locate and The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi- The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi-vision system.

The paper aims at presenting the results obtained in the development of a system allowing the detection and monitoring of forest fires and the continuous comparison of their intensity when several events occur simultaneously, as usually happens in the European Mediterranean countries during the summer season. The system, called SFIDE (Satellite FIre DEtection), exploits a geostationary satellite sensor (SEVIRI on board of MSG satellite series). The algorithm was developed several years ago in the framework of a project (SIGRI) funded by the Italian Space Agency (ASI). This algorithm has been completely reviewed in order to enhance its efficiency by reducing false alarms rate preserving a high sensitivity. Due to the very low spatial resolution of SEVIRI images (4x4 km² at Mediterranean latitude) the sensitivity of the algorithm should be very high to detect even small fires. The improvement of the algorithm has been obtained by: introducing the sun elevation angle in the computation of the preliminary thresholds to identify potential thermal anomalies (hot spots), introducing a contextual analysis in the detection of clouds and in the detection of night-time fires. The results of the algorithm have been validated in the Sardinia region by using ground true data provided by the regional Corpo Forestale e di Vigilanza Ambientale (CFVA). A significant reduction of the commission error (less than 10%) has been obtained with respect to the previous version of the algorithm and also with respect to fire-detection algorithms based on low earth orbit satellites.

The COVID-19 pandemic has emphasized the crucial role of ventilation systems in mitigating cross-infections, especially in infectious disease hospitals. This study introduces a dual-design operation ventilation system that can operate under two sets of ventilation conditions for normal and epidemic times. A challenge is optimizing duct diameters for required airflow while maintaining hydraulic balance. We design a genetic algorithm with adaptive penalty factor, the velocity constraint and the improved crossover and mutation probability. The improved genetic algorithm is suitable for ventilation system networks, which can find a better air duct diameters combination to improve the hydraulic balance rate, and reduce the usage of air valves, resulting in efficient hydraulic balancing commissioning. Compared with the traditional genetic algorithm, it has a faster search speed and a better global search ability, which is effective for the optimal design of ventilation system networks.

The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts on solving the ACD problem as well as its variants were also developed during the past decade. In this paper, an improved orthogonal lattice (OL) based algorithm, AIOL, is proposed to solve the general approximate common divisor (GACD) problem. The conditions for ensuring the feasibility of AIOL are also presented. Compared to the Ding-Tao’s OL algorithm, the well-know LLL reduction is used only once in AIOL, and when the error vector r is recovered in AIOL, the possible difference between the restored and the true value of p is given. The experimental comparisons towards the Ding-Tao’s algorithm and ours are also provided for validating our improvements.

The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robot, and has great significance for improving the efficiency and quality of tillage, fertilization, harvesting and other agricultural robot operations, as well as reducing the operation energy consumption. The traditional boustrophedon or heuristic search algorithm based CCPP methods, when coping with the field with irregular boundaries, obstacles and other complex environments, still face many problems and challenges, such as large repeated work areas, multiple turns or U-turns, low operation efficiency and prone to local optimum. In order to solve the above problems, an improved-genetic-algorithm-based CCPP method was proposed in this paper, which introduces the idea of chromosome pairs and multi-points mutation to improve its global optimization ability in complex environments, reduce the repeated work areas and the number of turns and U-turns, and thereby improve the operation efficiency. The simulation and experimental results on simple regular fields showed that the proposed improved genetic algorithm-based CCPP method achieved the comparable performance with the traditional boustrophedon-based CCPP method. However, on the complex irregular fields, although the proposed CCPP method increased the number of turns by 13.76%, the area of repeated operation and the number of U-turns were decreased by 38.54% and 35.00% respectively, and saves the battery voltage by 7.82% on average compared to the boustrophedon-based CCPP method. This proved that the proposed CCPP method has strong adaptive capacity to the environment, and has practical application value in improving the efficiency and quality of agricultural machinery operations, and reducing the energy consumption.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

This paper proposes a parameter coordination optimization design of Power System Stabilizer (PSS) based on an improved Quasi-Affine Transformation Evolutionary (QUATRE) algorithm to suppress low-frequency oscillation and improve the dynamic stability of power system. To begin, the Simulated Annealing (SA) algorithm randomly updates the globally optimal solution of each QUATRE iteration and matches the inferior solution with a certain probability to escape the local extreme point. This new algorithm is first applied to power system. Second, Since damping ratio is one of the criteria to measure the dynamic stability of power system, this paper sets the objective function according to the principle of maximization of damping coefficient of electromechanical mode, and uses SA-QUATRE to search a group of global optimal PSS parameter combinations to improve the stability margin of the system as much as possible. Finally, the method's rationality and validity were validated by applying it to the simulation examples of IEEE 4-machine 2-area system with different operation states. The comparison with the traditional optimization algorithm shows that the proposed method has more advantages for multi-machine PSS parameter coordination optimization, and can restrain the low-frequency oscillation of power system more effectively and enhance the system stability.

In-situ production of PC components is the same process as in a factory, with the order of installing processed rebar, pouring concrete, curing, and storage. In-situ production not only reduces environmental impact by more than 14.58% compared to factory production, but also reduces costs by up to 39.4% compared to factory production when increasing the number of in-situ produced PC components. The stock yard area is more than 5 times larger than the production area, which accounts for a significantly higher proportion. Research on in-situ production of PC components is mainly focused on the production area. PC component yard layout planning for in-situ production can effectively reduce carbon dioxide emissions and improve construction efficiency. Therefore, the purpose of this study is to develop an environmental impact minimization model for in-situ production of PC components. As a result of applying the developed model, the improved dung beetle optimization algorithm optimization improved the adjacent correlation by 22.79% and reduced carbon dioxide emissions by 18.33% compared to the dung beetle optimization algorithm, which verifies its efficiency. The proposed environmental impact minimization model can support the construction, reconstruction, and functional upgrade of logistics centers, contributing to low carbon dioxide in the logistics industry.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

Stagnation at local optima represents a significant challenge in bio–inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca Predator Algorithm with Deep Q–Learning. Orca Predator Algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q–Learning is a reinforcement learning technique that combines Q–Learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique’s performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of Orca Predator Algorithm to identify promising regions nearby in the search space, complemented by the fine–tuning capabilities of Deep Q–Learning to navigate these areas precisely. The practical application of this approach is evaluated using the high–dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of Orca Predator Algorithm against its native version and a set of state–of–the–art algorithms.

In this study, we introduce and advanced multi-feature selection technique for bacterial classifi-cation employing the Salp Swarm Algorithm (SSA). We enhance SSA’s effectiveness by incorpo-rating the Opposition-Based Learning (OBL) strategy and the Local Search (LSA) algorithm. The proposed technique encompasses three key stages, streamlining the automated categorization of bacteria based on their distinctive features. The research adopts a multi-feature selection approach bolstered by an enhanced iteration of the Salp Swarm Algorithm (SSA). Enhancements include the utilization of Opposition-Based-Learning (OBL) to increase population diversity during search and Local Search Algorithms (LSA) to tackle local optimization challenges. The ISSA algorithm is designed to optimize the multi-feature selection by increasing the number of selected feature and improving classification accuracy. This study compares its performance with several other algo-rithms across ten distinct test datasets. The comparison results show that ISSA has better perfor-mance in terms of classification accuracy on 3 datasets consisting of 19 features, with a value reaching 73.75%. Additionally, ISSA excels in determining the optimal feature count and producing a better-fit value with a classification error rate of 0,249. Thus, the ISSA technique is expected to make a significant contribution to solving feature selection problems in bacterial analysis

Enhancing underwater images in epicontinental sea is a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity. Recently, different methods have relied on the underwater image formation model and deep learning techniques to restore the underwater image, but they tend to degrade underwater image, interference of background clutter and miss boundary details of blue regions. Improved image fusion and enhancement algorithm based on a priori dark channel is proposed in this paper. Image edge features sharpening and dark detail enhancement by homomorphism filtering in CIELab color space is realized. In RGB color space, the multi-scale retinal with color restoration (MSRCR) algorithm is used to improve color deviation and enhance color saturation, and the contrast-limited adaptive histogram equalization (CLAHE) algorithm is used to de fog and enhance image contrast. Finally, according to the dark channel images of the three processing results, the final enhanced image is obtained by linear fusion of multiple images and multiple channels. Experimental results demonstrate the effectiveness and practicality of the proposed method on various datasets.

Mental stress state recognition using electroencephalogram (EEG) signals for real-life applications needs a conventional wearable device. This requires an efficient number of EEG channels and an optimal feature set. The main objective of the study is to identify an optimal feature subset that can best discriminate mental stress states while enhancing the overall performance. Thus, multi-domain feature extraction methods were employed, namely, time domain, frequency domain, time-frequency domain, and network connectivity features, to form a large feature vector space. To avoid the computational complexity of high dimensional space, a hybrid feature selection (FS) method of minimum Redundancy Maximum Relevance with Particle Swarm Optimization and Support Vector Machine (mRMR-PSO-SVM) is proposed to remove noise, redundant, and irrelevant features and keep the optimal feature subset. The performance of the proposed method is evaluated and verified using four datasets, namely EDMSS, DEAP, SEED, and EDPMSC. To further consolidate, the effectiveness of the proposed method is compared with that of the state-of-the-art heuristic methods. The proposed model has significantly reduced the features vector space by an average of 70% in comparison to the state-of-the-art methods while significantly increasing overall detection performance.

Multidisciplinary Design Optimization (MDO) is the most active field in the design of current complex system engineering, which is possessed with such two difficulties as subsystem information exchange and analytical and computational complexity of systems. Therefore, an improved collaborative optimization algorithm based on ANN (artificial neural network) response surface was proposed dependent on the consistency constraint algorithm and concurrent subspace algorithm. As an optimization method with secondary structure, it satisfied only local constraints in discipline layer, but provided a coordinated mechanism for interdisciplinary conflict in system layer. Finally, it was applied in the multidisciplinary design optimization of autonomous underwater vehicle (AUV). As shown from the result, the MDO convergence stability and reliability of low resistance, low noise and high maneuvering performance of the AUV shape can be ensured by the improved collaborative optimization algorithm, thus verifying the effectiveness of the algorithm.

Railway transportation is one of the main modes of long-distance coal transportation, and it is inevitable to cause environmental pollution during the transportation process. In order to improve the environment along the railway and increase the utilization rate of coal resources, this paper proposes a detection algorithm for scattered coal solidification layer during transportation based on the YOLO v8 model, and designs an intelligent recognition model suitable for coal solidification layer detection devices by combining fluorescence detection methods. Through experimental analysis, the model meets the requirements of practical detection and plays a crucial role in environmental protection, with strong practical application value.

To address the large hysteresis and susceptibility to instability in high-speed deposition fusion moulding (FDM) 3D printing’s temperature control, this paper proposes an improved ant-lion optimization algorithm (OCALO) to optimize the PID parameters.The improvement aims to solve the problem that the traditional ant-lion optimization algorithm (ALO) reduces the population diversity and tends to fall into the local optimal solution when it is close to the global optimal solution.The generation of the initial solution is enhanced by the introduction of a new Tent-Logistic-Cotangent composite chaotic mapping. This integration into Elite Opposition-Based Learning aids in optimizing population diversity. Concurrently, the incorporation of cosine factors of a specified parameter into the elitist formula of the traditional ALO algorithm is aimed at reducing the tendency of ants to randomly gravitate towards ant-lions with lower fitness values. This adjustment helps in balancing the exploration-exploitation trade-off in the algorithmic process. Compared with two existing classical algorithms and three improved ALO algorithms, the algorithm improves the convergence speed, global search ability and the ability to jump out of the local optimal solution. The improved algorithm was combined with PID control to design an OCALO-PID temperature controller and simulated on a high-speed 3D printing temperature model identified by modelling. The results show that the method improves the transient and steady-state performance of reactor temperature control with good control accuracy and robustness. Finally, the proposed algorithm is applied to a physical experimental platform to verify the feasibility of the algorithm.

Calligraphy works have high artistic value, but there is a rampant problem of forgery. Indeed, authentication of traditional calligraphy heavily relies on calligraphers' subjective judgment. Therefore, spurred by the recent development of neural networks, this paper proposes a method for authenticating calligraphy works based on an improved EfficientNet network. Specifically, the developed method utilizes the character box algorithm and the centroid algorithm to extract individual calligraphy characters, which are then augmented and used as the training set for the model. The training process employs CBAM and Self-Attention modules to enhance the attention mechanism of the EfficientNet network. The model is tested on authentic works, imitated works, and works from other calligraphers and is compared with other networks. The experimental results demonstrate that the proposed method effectively achieves the authentication of calligraphy works, and the improved CBAM-EfficientNet network and SA-EfficientNet network achieve better authentication performance.

Non-destructive testing of metallic objects that may contain embedded defects of different sizes is an important application in many industrial branches for quality control. Most of these techniques allow defect detection and its approximate localization, but very few give enough information for its 3D reconstruction. Here we present a hybrid laser – transducer system that combines remote laser-generated ultrasound excitation and non-contact ultrasonic transducer detection. This fully non-contact method gives access to separating scan areas on different object’s faces and defect details from different angles/perspectives can be analysed. This hybrid system can analyse the whole object’s volume data and allow a 3D reconstruction image of the embedded defects. As a novelty for the signal processing improvement, we use a 2D apodization window filtering technique, applied along with the synthetic aperture focusing algorithm in order to remove the undesired effects of side lobes and wide-angle reflections of propagating ultrasound waves, thus, enhancing the resulting 3D image of the defect. We provide both qualitative and quantitative volumetric results with high accuracy and resolution compared with conventional techniques.

With the continuous breakthrough of natural language processing, the application of intelligent question answering technology in electric power system has attracted wide attention. However, at present, the traditional question answering system has poor performance and is difficult to be applied in engineering practice. This paper proposes an improved BERTserini algorithm for intelligent answering of electric power regulations based on a BERT model. The proposed algorithm is implemented in two stages. The first stage is the text segmentation stage, where a multi-document long text preprocessing technique is utilized that accommodates the rules and regulations text, and then Anserini is used to extract paragraphs with high relevance to the given question. The second stage is answer generation and source retrieval stage, where a two-step fine-tuning based on the Chinese BERT model is applied to generate precise answers based on given questions, while the information regarding documents, chapters, and page numbers of these answers are also output simultaneously. The algorithm proposed in this paper eliminates the necessity for manual organization of professional question-answer pairs, thereby effectively reducing the manual labor cost compared to traditional question answering systems. Additionally, this algorithm exhibits a higher degree of exact match rate and a faster response time for providing answers.

In this paper, stochastic multi-objective intelligent framework (MOIF) is performed for distribution network reconfiguration to minimize power losses, the number of voltage sags, the system's average RMS fluctuation, the average system interruption frequency (ASIFI), the momentary average interruption frequency (MAIFI), and the system average interruption frequency (SAIFI) considering the network uncertainty. The unscented transformation (UT) approach is applied to model the demand uncertainty due to simplicity to implement and no presumptions to simplify. A human-inspired intelligent method named improved mountaineering team-based optimization (IMTBO) is applied to determine the decision variables defined as the network's optimal configuration. The conventional MTBO is improved using a quasi-opposition-based learning strategy to overcome premature convergence and achieve the optimal solution. The simulation results showed that in single- and double-objective optimization, some objectives are weakened compared to their base value, while the results of the MOIF indicated a fair compromise between different objectives, and all objectives are improved. The results of MOIF based on the IMTBO cleared that the losses are reduced by 30.94%, the voltage sag numbers and average RMS fluctuation are reduced by 33.68% and 33.65%, and also ASIFI, MAIFI, and SAIFI are improved by 6.80%, 44.61%, and 0.73%, respectively. Also, the superior capability of the MOIF based on the IMTBO is proved compared to the conventional MTBO, particle swarm optimization, and artificial electric field algorithm. Moreover, the results of the stochastic MOIF based on the UT showed the power loss increased by 7.62%, voltage sag, and SARFI increased by 5.39% and 5.31%, and ASIFI, MAIFI, and SAIFI weakened by 2.28%, 6.61%, and 1.48%, respectively compared to the deterministic MOIF model.

This paper introduces new improvements to the modified version of the BIRECT (BI secting RECTangles) algorithm referred to as BIRECTv. We explore various approaches, by first including a grouping strategy for hyper-rectangles having almost the same sizes by categorizing them into different classes. Therefore constraining them not to exceed a certain pre-defined threshold (a small positive value to define the tolerance level). This approach allows for more efficient computation and can be particularly useful when dealing with a large number of hyper-rectangles with varying sizes. To avoid over-sampling, and preventing redundant or excessive sampling, at some shared vertices in descendant subregions, a particular vertex database is used to limit the number of samples taken within each subregion to two. The experimental investigation shows that these improvements have a positive impact on the performance of the BIRECTv(imp.) algorithm and the proposal is a promising global optimization algorithm compared to the original BIRECTv algorithm and its variants. Additionally, the BIRECTv(imp.) algorithm showed particular efficacy in solving high-dimensional problems.

Because of the rapid advancement in the use of photovoltaic (PV) energy systems, it has become critical to look for ways to improve the energy generated by them. The extracted power from the PV modules is proportional to the output voltage. The relationship between output power and array voltage has only one peak under uniform irradiance, whereas it has multiple peaks under partial shade circumstances (PSC). There is only one global peak (GP) and many local peaks (LPs), where the typical maximum power point trackers (MPPT) may become locked in one of the LPs, significantly reducing the PV system's generated power and efficiency. The metaheuristic optimization algorithms (MOAs) solved this problem, albeit at the expense of the convergence time, which is one of these algorithms' key shortcomings. Most MOAs attempt to lower the convergence time at the cost of the failure rate and the accuracy of the findings because these two factors are interdependent. To address these issues, this work introduces the dandelion optimization algorithm (DOA), a novel optimization algorithm. The DOA's convergence time and failure rate are compared to other modern MOAs in critical scenarios of partial shade PV systems to demonstrate the DOA's superiority. The results obtained from this study showed substantial performance improvement compared to other MOAs, where the convergence time is reduced to 0.4 s with zero failure rate compared to 0.9 s, 1.25 s, and 0.43 s for other MOAs under study. The optimal number of search agents in the swarm, optimal initialization of search agents, and optimal design of the dc-dc converter is introduced for optimal MPPT performance.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

An improved anti-noise morphology vision navigation algorithm is proposed for intelligent tractor tillage in a complex agricultural field environment. Firstly, the two key steps, Guided Filtering and improved anti-noise morphology navigation line extraction, were addressed in detail. Then the experiments were carried out in order to verify the effectiveness and advancement of the presented algorithm. Finally, the optimal template and its application condition were studied for improving the image processing speed. The comparison experiment results show that the YCbCr color space has minimum time consumption, 0.094 s, compared with HSV, HIS and 2R-G-B color spaces. The Guided Filtering method can enhance the new & old soil boundary effectively than any other methods such as Tarel, Multi-scale Retinex, Wavelet-based Retinex and Homomorphic Filtering, meanwhile, has the fastest processing speed of 0.113 s. The extracted soil boundary line of the improved anti-noise morphology algorithm has best precision and speed compared with other operators such as Sobel, Roberts, Prewitt and Log. After comparing different size of image template, the optimal template with the size of 140×260 pixels can meet high precision vision navigation while the course deviation angle is not more than 7.5°. The maximum tractor speed of the optimal template and global template are 51.41 km/h and 27.47 km/h respectively which can meet real-time vision navigation requirement of the smart tractor tillage operation in the field. The experimental vision navigation results demonstrated the feasibility of the autonomous vision navigation for tractor tillage operation in the field using the new & old soil boundary line extracted by the proposed improved anti-noise morphology algorithm which has broad application prospect.

Pulmonary Embolism (PE) is the obstruction of blood arteries in the lungs by a blood clot. The mortality risk for PE is approximately 30%. Detecting pulmonary embolism in the segmental arteries of the lung is more challenging than in the main arteries and is very prone to being missed. A computer-based approach was created in this work to automatically identify pulmonary embolism in the segmental arteries using computed tomography images. The system's infrastructure includes an enhanced Mask R-CNN deep neural network that has been trained with images containing PE. The network accurately identifies the location of the pulmonary embolism on the computed tomography picture and successfully extracts its borders. The investigation was conducted by generating a local dataset. The study's performance was evaluated using pulmonary embolisms identified manually by the expert radiologist. The sensitivity, specificity, accuracy, dice coefficient, and Jaccard index values for 2130 pictures were 96.4%, 93.5%, 96.1%, 0.96, and 0.90, respectively. The improved Mask R-CNN model has demonstrated superior performance when compared to the traditional Mask R-CNN and U-Net models. This high-performance technology is designed to identify pulmonary embolism and will aid professionals in assessing the size of the embolism.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

This paper presents a new algorithm to solve the optimal reconfiguration problem in distribution networks, using the algorithm called Improved Simulated Annealing combined with Hybrid Cooling (ISA-HC) and Selective Space Search, which leverages the capabilities of the Open Distribution System Simulator (OpenDSS) software and the selective space search concept to enhance performance and reduce the search space. The ISA-HC algorithm determines an adequate starting point for the temperature and initial solution according to the size of the system. For adequate cooling, a three-stage cooling approach was employed to achieve effective cooling, combining two methods widely used in the literature. Overall, the ISA-HC algorithm is a promising method for solving the optimal reconfiguration problem in distribution networks. The algorithm was tested on the systems of 5, 33, 69, and 94 buses and compared to other existing methods in the literature. The results show that the proposed method is more robust and efficient, providing better convergence and reliably achieving good-quality global solutions

An improved anti-noise morphology vision navigation algorithm is proposed for intelligent tractor tillage in a complex agricultural field environment. At first the two key steps, Guided Filtering and improved anti-noise morphology navigation line extraction were addressed in detail. Then the experiments were carried out in order to verify the effectiveness and advancement of the presented algorithm. Finally, the optimal template and it’s application condition were studied for improving the image processing speed. The comparison experiment results show that the YCbCr color space has minimum time consumption of 0.094 s in comparison with HSV, HIS and 2R-G-B color spaces. The Guided Filtering method can effectively distinguish the boundary between the new and old soil than other competing vanilla methods such as Tarel, Multi-scale Retinex, Wavelet-based Retinex and Homomorphic Filtering inspite of having the fastest processing speed of 0.113 s. The extracted soil boundary line of the improved anti-noise morphology algorithm has best precision and speed compared with other operators such as Sobel, Roberts, Prewitt and Log. After comparing different size of image template, the optimal template with the size of 140×260 pixels can meet high precision vision navigation while the course deviation angle is not more than 7.5°. The maximum tractor speed of the optimal template and global template are 51.41 km/h and 27.47 km/h respectively which can meet real-time vision navigation requirement of the smart tractor tillage operation in the field. The experimental vision navigation results demonstrated the feasibility of the autonomous vision navigation for tractor tillage operation in the field using the new and old soil boundary line extracted by the proposed improved anti-noise morphology algorithm which has broad application prospect.

A real-time monitoring system for the operational status of fishing vessels is an essential element for the modernization of the fishing industry. The operational status of fishing vessels can be identified by using onboard cameras to detect the deck crew and the use of fishing nets. Due to the typically limited processing capacity of shipboard equipment and the significant memory consumption of detection models, however, general target detection models are unable to perform real-time image detection to identify the operational status of fishing vessels. In this paper, we propose a lightweight real-time deck crew and the use of fishing nets detection method, YOLOv5s-SGC. It is based on the YOLOv5s model, which uses surveillance cameras to obtain video of fishing vessels operating at sea and enhances the dataset. YOLOv5s-SGC replaces YOLOv5s’s backbone and the ordinary convolutional blocks in the feature fusion network with ShufflNetV2 and Ghost module.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

Mulberry leaves, when infected by pathogens, can suffer significant yield loss or even death if early disease detection and timely spraying are not performed. To enhance the detection performance of mulberry leaf diseases in natural environments and to precisely locate early small lesions, we propose a high-precision, high-efficiency disease detection algorithm named YOLOv8-RFMD. Based on improvements to You Only Look Once version 8 (YOLOv8), we first proposed the Multi Dimension Feature Attention (MDFA) module, which integrates important features at the pixel-level, spatial and channel dimensions. Building on this, we designed the RFMD Module, which consists of the Conv-BatchNomalization-SiLU (CBS) module, Receptive-Field Coordinated Attention (RFCA) Conv, and MDFA, replacing the Bottleneck in the model’s Residual block. We then employed Adown down sampling structure to reduce the model size and computational complexity. Finally, to improve the detection precision of small lesion features, we replaced the complete intersection over union (CIOU) loss function with the Normalized Wasserstein Distance (NWD) loss function. Results show that the YOLOv8-RFMD model achieves an mAP50 of 94.3% and an mAP50:95 of 67.8% on experimental data, representing increases of 2.9% and 4.3% respectively compared to the original model. The model size is reduced by 0.53 MB to just 5.45 MB, and the number of floating-point operations is reduced by 0.3 G to only 7.8 G. The improved model meets the deployment requirements of mobile embedded devices and can provide a theoretical reference for the automated spraying operations of mulberry leaves.

Phyllanthus emblica (P. emblica) has been described in many studies to have multiple therapeutic activities and is considered an important part of Ayurvedic and Unani medicinal systems. This study successfully synthesized P. emblica loaded polyvinylalcohol/gelatin based cryogels (PVA/Gel/P.emblica) to examine their potential in wound dressing applications. Swelling tests, Brunauer-Emmett-Teller (BET) and morphology analysis were conducted within the scope of characterization studies. In vitro cell culture studies were performed using HaCaT cells to illustrate the suitability of the synthesized cryogels as wound dressing material. The swelling tests and BET analysis results showed that swelling and surface area properties of cryogels increased with increasing P. emblica amounts. Morphological results displayed that the cryogels had a dense, interconnected pore morphology and a macroporous structure. 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide (MTT), trypan blue exclusion and live-dead assay results revealed that adding of P. emblica into cryogels led to enhanced cell proliferation, increased cell number, and improved cell viability. Based on the phase contrast microscope, scanning electron microscope (SEM), immunofluorescence and giemsa staining images, it was observed that P. emblica promoted cell attachment, proliferation and penetration. In conclusion, it has been shown that PVA/Gel/P.emblica cryogels are suitable for use as wound dressing materials and can be developed with further studies.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

This work presents a novel compact CMOS potentiostat designed circuit for electrochemical cell. The proposed topology functions as a circuit interface, controlling the polarization of voltage signals at the sensor electrodes and facilitating current measurement during the oxidation-reduction process of a analyzed solution. The potentiostat, designed for CMOS technology, comprises a two-stage amplifier, two current mirror blocks coupled to this amplifier, and a CMOS push-pull output stage. It employs the electrochemical method of cyclic voltammetry, operating within voltage range of ±0.8 V and scan rates of 10mV/s, 25mV/s, 100mV/s and 250 mV/s. The circuit is capable of reading currents ranging from 10 µA to 500 µA. Experimental results were obtained using a potassium ferrocyanide (K3(FeCN)6) redox solution with concentrations of 10, 15 and 20 mmol/L, and their corresponding voltammograms were evaluated. The experimental results from a discrete circuit demonstrate that the proposed potentiostat topology produces outcomes consistent with those of classical topologies presented in the literature and industrial equipment.

Mapping or quantitative inversion through remote sensing technology is an active way for mineral monitoring in large or uncultivated forest areas. Different spectral features of minerals, induced by ionic composition, can be identified which are related to mineral type or abundance. Based on the distinctive spectral absorption around 2.33µm induced by the carbonate ion, we use it as an analytic target to propose an improved continuum removal (ICR) algorithm to couple with normalized abundance to evaluate the relationship between continuum removal band depth (CRBD) and carbonate ion abundance. Through experimentally testing with synthetic and real image data, ICR with ratio abundance normalization can enhance the linear relation of CRBD and abundance. We find this technique performs best for abundance retrieval. The lowest root mean square error is 0.0400 for synthetic data and the mean relative error is as low as 6.80% for real image data. Compared with five other algorithms, coupling normalized carbonate mineral abundance with ICR can improve the quantitative retrieval accuracy of carbonate ion. By using a hyperspectral library, we also present a way to retrieve abundance without ground samples. These results make the quantitative inversion of mineral abundance more reasonable by distinct or enhanced features and provide great potential for use to extend mineral information extraction in the absence of sample data, even for surveys of the Moon and Mars for mineral quantitative analysis.

Abstract In order to solve the problem that it is difficult to obtain the accurate trigger signal moment when using the time difference of UAV flight acoustic signals collected by acoustic sensors arranged in advance to locate the position of UAVs when they cannot be tracked by radar and are difficult to be observed by the human eye, an acoustic source localisation method with improved empirical modal decomposition (REMD) under an adaptive frequency window is proposed. Firstly, the collected UAV flight signals are smoothed and filtered, then the robust empirical modal decomposition (REMD) is used for IMF modal decomposition and spectral analysis of the collected signals, and a panning frequency window with variable bandwidth is introduced for corresponding frequency locking and extracting the IMFs; the GWO optimisation is used and the sliding metrics are set to determine the position of the panning frequency window automatically; finally, the extracted Finally, the extracted IMF components are reconstructed according to the criterion, and the trigger signal moments in the reconstructed IMF components are resolved and recorded, and the algorithm is used to calculate the difference between the reception moments of different sensors; for the traditional sound source localisation algorithms with a small detection range, which are prone to fall into the no-solution or false-solution, i.e., unable to achieve the localisation, a weighted least-squares-based Chan-Taylor algorithm is proposed for the localisation computation, and a weighted least-squares algorithm is proposed for the localisation computation, through the Inputting the sensor delay parameter and solving the linear equation system to get the target position information; finally, this paper verifies the robustness and performance of the design method with simulated and actual signals. The results show that the maximum positioning error is no more than 5% in an area with a side length of 15m in the measurement area. With the improved accuracy of time delay estimation, the positioning simulation results meet the positioning requirements even though the positioning error is further expanded when the measurement area is further expanded.

Against the backdrop of the current carbon peaking and carbon neutrality policies, higher requirements have been put forward for the upgrading and construction of smart grids. Non-intrusive load monitoring (NILM) technology is a key technology for advanced measurement systems at the end of the power grid. It obtains detailed power information of the load, without the need for traditional hardware deployment. The key step to solve this problem is load decomposition and identification. This paper first utilized Long Short Term Memory-Denoising Autoencoder(LSTM-DAE) to decompose the mixed current signal on the household busbar and obtain the current signals of multiple independent loads that constituted the mixed current. Then, the obtained independent current signals were combined with voltage signals to generate multi-cycle colored Voltage-Current(VI) trajectories, which were color-coded according to the background. These colored VI trajectories with background colors formed a feature library. When the CNN network was used for load recognition, considering the influence of hyperparameters on recognition results, the BOA algorithm was used for optimization, and the optimized CNN network was employed for VI trajectory recognition. Finally, the proposed method was validated using the PLAID dataset. Experimental results showed that the proposed method exhibited better performance in load decomposition and identification.

Chip pad alignment inspection is of great importance in the industrial field. However, due to the fact that chip pads are usually small, problems such as misdetection and missed detection often occur. When applying deep learning methods for chip pad detection, it is necessary to ensure accurate detection of small target chips while meeting the requirements of lightweight detection models for industrial needs. To solve the above problems, this paper proposes a lightweight model based on improved YOLOv5s. Firstly, the feature extraction part is improved to increase the network's focus on the target. Secondly, the feature fusion layer is improved to double the resolution of the prediction head, and the context-aware network is designed to enhance the context-capture ability of key features of small targets. Finally, SIoU is adopted as the loss function to improve the speed and accuracy of the regression frame. The experimental results show that the improved YOLOv5s algorithm improves the detection accuracy by 2.3% and reduces the network parameters by 81.8% compared to the original algorithm. The improved algorithm is combined with image processing techniques to design correction methods for alignment anomalies and realize real-time alignment anomaly correction in industry.

The healthcare situation in Africa is characterized by limited resources and a high burden of disease, presenting significant challenges to the healthcare systems in the region. The integration of Artificial Intelligence (AI) technologies in African healthcare holds immense potential for addressing these challenges and improving health outcomes. This paper aims to provide a comprehensive understanding of the current healthcare landscape in Africa and the urgent need for AI-driven solutions.In addition to discussing the potential applications of AI in African healthcare, such as disease diagnosis, treatment planning, and medical imaging analysis, this manuscript seeks to shed light on the specific challenges hindering the implementation of AI in the region. By providing detailed examples and case studies, we aim to offer insights into the obstacles that need to be overcome and potential solutions that can be pursued.By leveraging AI technologies, Africa has the opportunity to revolutionize its health systems, bridging the gap in access to quality healthcare across the continent. The objective of this review article is to not only highlight the potential benefits that AI can bring to African healthcare but also to emphasize the urgent need for action and collaboration in implementing and scaling up AI innovations in the region. By doing so, African countries can pave the way for improved health outcomes and ensure that their populations receive the healthcare services they deserve.

Amorphous Indomethacin has enhanced bioavailability over its’ crystalline forms, yet amorphous forms can still possess a wide variety of structures. Here, Empirical Potential Structure Refinement (EPSR) has been used to provide accurate molecular models on the structure of five different amorphous Indomethacin samples, that are consistent with their high energy x-ray diffraction patterns. It is found that the majority of molecules in amorphous Indomethacin are non-bonded or bonded to one neighboring molecule via a single hydrogen bond, in contrast the doubly bonded dimers found in the crystalline state. The EPSR models further indicate a substantial variation in hydrogen bonding between different amorphous forms, leading to a diversity of chain structures not found in any known crystal structures. The majority of hydrogen bonds are associated with the carboxylic acid group, although a significant number of amide hydrogen bonding interactions are also found in the models. Evidence of some dipole-dipole interactions are also observed in the more structurally ordered models. The results are consistent a distribution of Z-isomer intra-molecular type conformations in the more disordered structures, that dis-tort when stronger inter-molecular hydrogen bonding occurs. The findings are supported by 1H and 2H NMR studies of the hydrogen bond dynamics in amorphous Indomethacin.

This paper presents a particular tunneling method or new Austrian tunneling method (NATM) which plays an important role in reducing the subsidence of the Earth surface and the damage to the structures in urban areas. It has a wide range of applications in shallow tunneling projects all over the world. In this study, numerical modeling of third-line Metro tunnel in Tehran is under discussion which is designed and stabilized by NATM. The foregoing tunnel is excavated manually with a one-meter advancing step. In this project, the constructors used a lattice girder and sprayed concrete with 31 cm thickness as the initial lining. A suitable numerical software for this modeling is Plaxis 3D tunnel, which allows performing high-resolution finite element modeling (FEM) of the studied object. The performance of this method is investigated and compared with other NATM methods. As a result of numerical modeling, we give a value of 30.01 mm earth subsidence in the most damaged area of the settlement, in comparing with that of earth surface monitoring, which confirmed it with a dramatically low difference. Moreover, this tunnel was drilled and excavated with various methods, among which the less settlement has obtained by the proposed method. The results are promising to continue the tunneling with this method to expand the subway line in the city.

The review scrutinizes the currently performed research on the new methods for enhancing bituminous binder performance through radiation and radical grafting of polymer modifers of bitumen. It investigates innovative methods, including using waste polymers as modifiers, and applying radiation for polymer grafting, to overcome challenges like high costs, low aging resistance and storage stability issues, of which separation of phases polymer/bitumen is the most significant obstacle. These advanced modification techniques promise sustainability through the decrease of the carbon footprint of transportation systems by improving the properties and durability of binders. Additionally, the review discusses the parameters and mechanistic aspects from a scientific perspective, shedding light on the underlying processes that contribute to the improved performance of modified bituminous binders.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

Accurate and stable cost forecasting of substation projects is of great significance to ensure the economic construction and sustainable operation of power engineering projects. In this paper, a forecasting model based on the improved least squares support vector machine (ILSSVM) optimized by wolf pack algorithm(WPA) is proposed to improve the accuracy and stability of the cost forecasting of substation projects. Firstly, the optimal features are selected through the data inconsistency rate (DIR), which helps reduce redundant input vectors. Secondly, the wolf pack algorithm is used to optimize the parameters of the improved least square support vector machine. Lastly, the cost forecasting method of WPA-DIR-ILSSVM is established. In this paper, 88 substation projects in different regions from 2015 to 2017 are chosen to conduct the training tests to verify the validity of the model. The results indicate that the new hybrid WPA-DIR-ILSSVM model presents better accuracy, robustness and generality in cost forecasting of substation projects.

This paper aims to explore the potential application of Extreme Learning Machines (ELM) in stock price prediction and optimise the ELM model by combining the Crown Porcupine Optimisation Algorithm and the Adaptive Bandwidth Kernel Function Density Estimation Algorithm. Specifically, the model's root mean square error (RMSE) on the test set is 0.018, which shows its good prediction accuracy. Meanwhile, the correlation coefficient R reaches 0.968, proving the model's effectiveness in predicting stock prices. In addition, the coefficient of determination R² of the training set and test set are 0.987 and 0.954, respectively, which are not much different, indicating that the model has good generalisation ability and is not prone to overfitting. This is crucial for practical application, as it implies that the model fits the existing data well and makes accurate predictions for future data. In terms of other evaluation metrics such as Mean Absolute Error (MAE), Root Mean Square Error (RMSE) and Mean Absolute Percentage Error (MAPE), the performance is excellent in both the training and test sets. Together, these results indicate that after optimising the ELM by introducing the crown porcupine optimisation algorithm and the adaptive bandwidth kernel function density estimation algorithm, the model can effectively capture the changing stock price pattern, thus achieving efficient and accurate stock price prediction. In summary, this study not only demonstrates the great potential of ELM in stock price prediction but also highlights the importance of improving the model performance through advanced algorithm optimisation, which provides a new way of thinking and methodology for financial market analysis. This strongly supports investors' decision-making and lays the foundation for related research.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Mobile inspections conducted by intelligent tunnel robots are instrumental in broadening the inspection reach, economizing on inspection expenditures, and augmenting the operational efficiency of inspections. Despite differences from fixed surveillance, mobile-captured traffic videos have complex backgrounds and device conditions that interfere with accurate traffic event identification, warranting more research. This paper proposes an improved algorithm based on YOLOv9 and DeepSORT for intelligent event detection in edge computing mobile device using the intelligent tunnel robot. The enhancements comprise the integration of the Temporal Shift Module to boost temporal feature recognition and the establishment of logical rules for identifying diverse traffic incidents in mobile video imagery. Experimental results show that our fused algorithm achieves a 93.25% accuracy rate, an inprovement of 1.75% over the baseline. The algorithm is also applicable to inspection vehicles, drones, and autonomous vehicles, effectively enhancing the detection of traffic events and improving traffic safety.

Tunnel fires are generally detected using various sensors, including measuring temperature, CO concentration, and smoke concentration. To address the ambiguity and inconsistency in multi-sensor data, this paper proposes a tunnel fire detection method based on an improved Dempster-Shafer (DS) evidence theory for multi-sensor data fusion. To solve the problem of evidence conflict in DS theory, a two-level multi-sensor data fusion framework is adopted. The first level of fusion involves feature fusion of the same type of sensor data, removing ambiguous data to obtain characteristic data, and calculating the basic probability assignment (BPA) function through the feature interval. The second level fusion derives basic probability numbers from the BPA, calculates the degree of evidence conflict, normalizes to obtain the relative conflict degree, and optimizes the BPA using the trust coefficient. The classical DS evidence theory is then used to integrate and obtain the probability of tunnel fire occurrence. Different heat release rates, tunnel wind speeds, and fire locations are set, forming four fire scenarios. Sensor monitoring data under each simulation condition are extracted and fused using the improved DS evidence theory. The results show that the proposed improved DS evidence theory method detects the probability of fire occurrence in the four scenarios as 67.5%, 71.0%, 82.8%, and 83.5%, respectively, and identifies fire occurrence in approximately 2.4 seconds, an improvement of 64.7% to 70% over traditional methods. This demonstrates the feasibility and superiority of the proposed method, highlighting its significant importance in ensuring personnel safety.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

YOLOv8, as an efficient object detection method, can swiftly and precisely identify objects within images. However, traditional algorithms encounter difficulties when detecting small targets in remote sensing images, such as missing information, background noise, and interactions among multiple objects in complex scenes, which may affect performance. To tackle these challenges, we propose an enhanced algorithm optimized for detecting small objects in remote sensing images, named HP-YOLOv8. Firstly, we design the C2f-D-Mixer (C2f-DM) module as a replacement for the original C2f module. This module integrates both local and global information, significantly improving the ability to detect features of small objects. Secondly, we introduce a feature fusion technique based on attention mechanisms, named Bi-Level Routing Attention in Gated Feature Pyramid Network (BGFPN). This technique utilizes an efficient feature aggregation network and reparameterization technology to optimize information interaction between different scale feature maps, and through the Bi-level Routing Attention (BRA) mechanism, it effectively captures critical feature information of small target objects. Finally, we propose the Smooth Mean Perpendicular Distance Intersection over Union (SMPDIoU) loss function. The method comprehensively considers the shape and size of detection boxes, enhances the model's focus on the attributes of detection boxes and provides a more accurate bounding box regression loss calculation method. To demonstrate our approach's efficacy, we conduct comprehensive experiments across the RSOD, NWPU VHR-10, and VisDrone2019 datasets. The experimental results show that the HP-YOLOv8 achieves 95.11%, 93.05%, and 53.49% in the [email protected] metric, and 72.03%, 65.37%, and 38.91% in the more stringent [email protected]:0.95 metric, respectively.

The combination of encryption and digital watermarking technologies is a trend to achieve full lifecycle data protection. Recently, reversible data hiding in encrypted domain (RDHED) has greatly aroused the interests of many scholars. But the fixed order of first encryption and then watermarking makes this kind of algorithms unsuitable to many applications. Commutative encryption and watermarking (CEW) technology realizes the flexible combination of encryption and watermarking, and suits more applications. However, most existing CEW schemes for vector maps are not reversible and unsuitable to high precision maps. To solve this problem, here we propose a commutative encryption and reversible watermarking (CERW) algorithm for vector maps based on virtual coordinates which are uniformly distributed on the number axis. The CERW algorithm consists of virtual interval step based encryption scheme and coordinate difference based reversible watermarking scheme. In the encryption scheme, the map coordinates are moved randomly by multiples of virtual interval step defined as distance between two adjacent virtual coordinates. In the reversible watermarking scheme, difference expansion (DE) technique is used to embed the watermark bit into the coordinate difference computed based on the relative position of a map coordinate in a virtual interval. Since the relative position of a map coordinate in a virtual interval keeps unchanged during the coordinate scrambling encryption process, the watermarking operation and the encryption operation don’t interfere with each other and the commutativity between encryption and watermarking achieves. Results show that: proposed method has high security, high capacity and good invisibility. In addition, the algorithm is not only applicable to polyline and polygon vector data, but also can be applied to sparsely distributed point data which the traditional DE watermarking algorithm often fails to watermark.

The knowledge of the precise anatomy and dimensions of the pulp chamber in the different teeth allows the odontologist to perform correct diagnosis, as well as treatment planning and moni-toring. The clinical practice has introduced cone-beam computed tomography (CB-CT) as a method to evaluate the morphology and dimensions of the pulp chamber. Nevertheless, micro-computed tomography (micro-CT) is regarded as the gold standard in approaching those topics. Here we have designed an algorithm that takes as input DICOM images from in vivo CB-CT of permanent molars to determine the accuracy CB-CT for evaluation of pulp chamber volume. The values were compared with those from in vivo CB-CT (rough and expert manipulated) and ex vivo micro-CT. The relative errors obtained with the volume calculated by the algorithm vs. the volume measured by micro-CT do not exceed 5.7%; also, no significant differences were found between algorithm volumes vs. manipulated CB-CT volumes while all volumes were different from those obtained with automatic CB-CT software. These data demonstrate that volume algorithm CB-CT based may be a reliable technique for evaluation of the pulp chamber volume in permanent molars and can be useful in the diagnosis of pulp diseases, as well as in the planning and monitoring of their treatments.

Within environmental perception, automatic navigation and object detection, computer vision is a crucial and demanding field with many applications in modern industries, such as multi-target long-term visual tracking in automated production, defect detection, and driverless robotic vehicles with sensing ability. The performance of computer vision has greatly improved recently thanks to developments in deep learning algorithms and hardware computing capabilities, which has spawned the creation of a large number of related applications. This paper presents the results of a detailed review of over 50 papers published over the course of two decades (1999–2024), with a primary focus on the technical advancement of computer vision. To elucidate the foundational principles, an examination of typical visual algorithms based on traditional correlation filtering was initially conducted. Subsequently, a comprehensive overview of the most recent advancements in deep learning-based computer vision techniques was compiled. Furthermore, a comparative analysis between conventional and novel algorithms was undertaken to discuss the future trends and directions of computer vision. Lastly, the feasibility of employing visual SLAM (Simultaneous Localization and Mapping) algorithms in the context of autonomous vehicles with sensing capability was explored. Furthermore, we explored a thorough and efficient architecture for utilizing these techniques in autonomous robotic vehicles into unmanned green and low-carbon smart factories, underlining novel advances as well as potential prospects for future research.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

Infill drilling is one of the most effective methods to improve the performance of poly-mer flooding. The difficulties related to infill drilling are determining the optimal numbers and placements of infill wells. In this study, an improved archimedes optimization algorithm with Halton sequence (HS-AOA) was proposed to overcome the aforementioned difficulties. First, to optimize the infill well placement for polymer flooding, an objective function that considered the economic influence of infill drilling was developed. Then, the novel optimization algorithm (HS-AOA) for infill well placement was developed by combining the AOA with the Halton se-quence. The codes were developed in MATLAB and connected to a commercial reservoir simula-tor CMG STARS to carry out the infill well placement optimization. Finally, the HS-AOA was compared to the basic AOA to confirm its reliability and then used to optimize the infill well placements for polymer flooding in a typical offshore oil reservoir. The results showed that the introduction of the Halton sequence into AOA effectively increased the diversity of the initial ob-jects in the AOA and avoided the HS-AOA trapping into the local optimal solutions. The HS–AOA outperformed the AOA. It was an effective approach to optimize the infill well placement for polymer flooding processes. In addition, infill drilling could effectively and economically im-prove the polymer flooding performance in offshore oil reservoirs. The NPV of the polymer flooding case with infill wells determined by HS-AOA reached 3.5 × 108 $, which was an increase of 7% over that of the polymer flooding case. This study presents an effective method for opti-mizing infill well placement for polymer flooding processes. It also can serve as a valuable refer-ence for other optimization problems in the petroleum industry, such as joint optimization of well control and placement.

The extensive use of carrier-aided smoothing code (CSC) filter has led to reduce the noise level of raw code measurements in GNSS positioning and navigation applications. However, the existing CSC technique is sensitive to the changes of the integer ambiguity and then the smoothing proce-dure needs to be restarted in the presence of cycle-slips. As the Doppler shift is instantaneous ob-servation and immune to cycle-slips, Doppler-aided smoothing code (DSC) algorithm would be more promising in challenged environment. Based on the Hatch-filter, an optimal DSC approach is proposed with the principle of minimum variance. Meanwhile, to inhibit the effect of integral cumulative error of Doppler, a balance factor is adopted to adjust the contributions of raw code and DSC. The noise level of code observable is not only affected by thermal noise, but also limited by systematic bias. Satellite code bias (SCB) has been identified in the raw code observable on each frequency for each BDS-2 satellite. By minimizing the sum of absolute value of residuals, polyno-mial segment fitting algorithm as a function of elevation-angles is applied to establish the SCB cor-rection model based on epoch-differenced Multipath (MP) deviations. Finally, numerical experi-ments demonstrate the validity and efficiency of the refined DSC filter with SCB corrections on each available frequency for BDS-2 un-GEO satellites.

As the fast growth of information technology (IT), the safety of image transmission and the storing of images are increasingly concerned. Traditional image encryption algorithms have certain limitations in transmission and security, so there is an urgent need for a secure and reliable image encryption algorithm. A universal compression sensing (CS) image encryption (IE) algorithm based on DNA-triploid mutation (DTM) is presented in this paper. Firstly, by using CS algorithm an image is compressed while obtaining a range of chaotic sequences by iteration of chaotic map. Then DNA sequences are generated by encoding the image, and based on the DTM, new mutant DNA sequences are generated according to specific rules. Next, the chaotic sequences are operated at the DNA level to do confusion and diffusion operations on the image to ensure the security of the data. At last, DNA decoding is carried out to obtain the compressed-encrypted image. Both simulation experiments and performance tests fully show that a high level of security and reliability of the proposed algorithm in protecting image privacy is achieved.

In recent years, the AHRS has become an important research area. In order to improve the orientation measurement accuracy of AHRS, this paper first expounds the algorithm principle of the AHRS. Then, aiming at the problem of poor stability of the traditional gradient descent method under high dynamics or large magnetic field interference, a gain-scheduled anti-interference AHRS orientation algorithm is designed. By using the switching architecture designed with this algorithm for gain scheduling, it can ensure stable performance while being subjected to apparent acceleration and ferromagnetic interference. Finally, experimental verification is conducted, and the experimental results show that: in the presence of interference, the roll angle error is 0.0350°, the pitch angle error is 0.0277°, and the yaw angle error is 0.9611°, thereby verifying the strong anti-interference performance of the gain-scheduled AHRS orientation algorithm proposed in this paper.

Tsallis entropy has been widely used in image thresholding because of its non-extensive properties. The non-extensive parameter q contained in this entropy plays an important role in various adaptive algorithms and has been successfully applied in bi-level image thresholding. In this paper, the relationships between parameter q and pixels’ long-range correlations have been further studied within multi-threshold image segmentation. It is found that the pixels’ correlations are remarkable and stable for images generated by a known physical principle, such as infrared images and medical CT images. And the corresponding non-extensive parameter q can be evaluated by using self-adaptive Tsallis entropy algorithm. The results of this algorithm are compared with those of Shannon entropy algorithm and the original Tsallis entropy algorithm, in terms of quantitative image quality evaluation metrics PSNR (Peak Signal-to-Noise Ratio) and SSIM (Structural Similarity). Furthermore, we observed that for image series with the same background, the q values determined by the adaptive algorithm are consistently kept in a narrow range. Therefore, similar or identical scenes during imaging would produce similar strength of long-range correlations, which provides potential applications for unsupervised image processing.

The paper presents an error model of a measurement chain containing link performing discrete wavelet transform algorithm which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

Laser-targeted weeding methods further enhance the sustainable development of green agriculture, with one key technology being the improvement of weed localization accuracy. Here, we propose an improved YOLOv8 instance segmentation based on bidirectional feature fusion and deformable convolution (BFFDC-YOLOv8-seg) to address the challenges of insufficient weed localization accuracy in complex environments with resource-limited laser weeding devices. Initially, by training on extensive datasets of plant images, the most appropriate model scale and training weights are determined, facilitating the development of a lightweight network. Subsequently, the introduction of the Bidirectional Feature Pyramid Network (BiFPN) during feature fusion effectively prevents the omission of weeds. Lastly, the use of Dynamic Snake Convolution (DSConv) to replace some convolutional kernels enhances flexibility, benefiting the segmentation of weeds with elongated stems and irregular edges. Experimental results indicate that the BFFDC-YOLOv8-seg model achieves a 4.9% increase in precision, an 8.1% increase in recall rate, and a 2.8% increase in mAP50 value to 98.8% on a vegetable weed dataset compared to the original model. It also shows improved mAP50 over other typical segmentation models such as Mask R-CNN, YOLOv5-seg, and YOLOv7-seg by 10.8%, 13.4%, and 1.8%, respectively. Furthermore, the model achieves a detection speed of 24.8 FPS on the Jetson Orin nano standalone device, with a model size of 6.8MB that balances between size and accuracy. The model meets the requirements for real-time precise weed segmentation, suitable for complex vegetable field environments and resource-limited laser weeding devices.

This research introduces a pioneering solution to the challenges posed by gastrointestinal tract (GI) cancer in radiation therapy, focusing on the imperative task of precise organ segmentation for minimizing radiation-induced damage. GI imaging has historically used manual demarcation, which is laborious and uncomfortable for patients. We address this by introducing the ResECA-U-Net deep learning model, a novel combination of the UNet and ResNet34 architectures. Furthermore, we further augment its functionality by incorporating the Efficient Channel Attention (ECA-Net) methodology. By utilizing data from the UW-Madison Carbone Cancer Centre, we carefully investigate several image processing techniques designed to capture critical local characteristics. With its foundation in computer vision concepts, the ResECA-U-Net model is excellent at extracting fine details from GI images. Sophisticated metrics such as intersection over union (IoU) and the dice coefficient are used to evaluate performance. Our study's outcomes demonstrate the effectiveness of the suggested method, yielding an impressive 96.27% Dice coefficient and 91.48% IoU. These results highlight the significant contribution that our strategy has made to the advancement of cancer therapy. Beyond its scientific merits, this work has the potential to significantly enhance cancer patients' quality of life and provide better long-term outcomes. Our work is a significant step towards automating and optimizing the segmentation process, which can potentially change how GI cancer is treated completely.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

Underwater visual detection technology plays a pivotal role in fields such as marine exploration. With the increasing demand for underwater monitoring, the quest for efficient and reliable methods for underwater target recognition has become particularly significant. To address this requirement, this study developed an innovative underwater object detection architecture based on YOLOv8, named YOLOv8-MU, aimed at significantly enhancing detection accuracy.By integrating the LarK module proposed in UniRepLKNet to optimize the backbone network, YOLOv8-MU aims to achieve a larger receptive field without increasing the model’s depth. Further, this research introduces C2fSTR, an innovative method that combines Swin Transformer with the C2f module. Additionally, we have incorporated the SPPFCSPC_EMA module, which combines Cross-Stage Partial Fast Spatial Pyramid Pooling (SPPFCSPC) with attention mechanisms, significantly improving the detection accuracy and robustness of various biological targets. Moreover, by introducing a fusion block based on DAMO-YOLO into the neck of the model, we further enhanced the model’s capability in multi-scale feature extraction. Finally, the adoption of the MPDIoU loss function, designed around vertex distance, effectively tackles the challenges of localization accuracy and boundary clarity in underwater organism detection. Experimental results on the URPC2019 dataset demonstrate that the YOLOv8-MU model achieved an [email protected] of 78.4%, marking improvements of 5.6%, 1.1%, and 4.0% over YOLOv5s, YOLOv7, and YOLOv8n respectively, indicating the leading performance (SOTA) of this method. On the other hand, further evaluation on the URPC2020 dataset confirmed the generalization capability of the YOLOv8-MU architecture, with its [email protected] reaching 80.4%, surpassing various models including YOLOv5x and YOLOv8n, showcasing the wide applicability of our proposed improved model architecture.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

The emerging wireless energy transfer technology enables sensor nodes to maintain perpetual operation. However, maximizing the network performance while preserving short charging delay is a great challenge. In this work, a Wireless Mobile Charger (WMC) and a Directional Charger (DC) are deployed to transmit wireless energy to the sensor node to improve the network's throughput. To the best of our knowledge, this is the first work to optimize the data sensing rate and charging delay by joint scheduling of MC and DC. We prove we can transmit maximum energy to each sensor node to obtain our optimization objective. In our proposed work, a DC selects a total horizon of equipped with DCs, which selects the horizon of each specific area with based on its antenna orientation. DC's orientation is scheduled for each time slot. Furthermore, multiple MCs are used to transmit energy for sensor nodes which cannot be covered by DCs. We divided the Rechargeable Wireless Sensor Network into several zones via the Voronoi diagram. We deployed a static DC and one MC charging location in each zone to provide wireless charging service jointly. We obtain the optimal charging location of MCs in each zone by solving Mix Integral Programming for energy transmission. The optimization objective of our proposed research is to sense maximum data from each sensor node with the help of maximum energy. The lifetime of each sensor network can increase, and the end delay can be maximized with joint energy transmission. Extensive simulation results demonstrate that our RWSNs are designed significantly to improve network lifetime over the baseline method.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

Low-cost particle sensors are now used worldwide to monitor outdoor air quality. However, they have only been in wide use for a few years. Are they reliable? Does their performance deteriorate over time? Are the algorithms for calculating PM2.5 provided by the Plantower company for PurpleAir monitors accurate? We investigate these questions using continuous measurements of four monitors (8 sensors) under normal conditions inside and outside a home for 1.5-3 years. A recently-developed algorithm (called ALT-CF3) is compared to the two existing Plantower algorithms. The Plantower CF1 algorithm was shown to lose 25-50% of all indoor data due to the questionable practice of assigning zero to all concentrations below a threshold. None of these data were lost using the ALT-CF3 algorithm. About 92% of all data showed precision better than 20% using the ALT-CF3 algorithm, but only about 45-75% of data achieved that level using the Plantower CF1 algorithm. The limits of detection (LODs) using the ALT-CF3 algorithm were mostly under 1 ug/m3, compared to about 3-10 ug/m3 using the Plantower CF1 algorithm. The percent of observations exceeding the LOD was 53-92% for the ALT-CF3 algorithm, but only 16-44% for the Plantower CF1 algorithm. For indoor air in homes, the Plantower algorithms are inappropriate.

The challenging terrain and deep ravines characteristic of mountainous regions often result in slower path planning and suboptimal flight paths for Unmanned Aerial Vehicles (UAVs) when traditional meta-heuristic optimization algorithms are employed. This study investigates the application of an Improved Enhanced Snake Optimizer (IESO) for three-dimensional path planning in a simulated rugged mountainous terrain. The initialization process in the enhanced snake optimizer is refined by integrating the Chebyshev chaotic map. Additionally, a non-monotonic factor is introduced to modulate the "temperature," and a boundary condition is incorporated into the dynamic opposition learning mechanism. These modifications collectively reduce the likelihood of population convergence to local optima during optimization. The feasibility of IESO is validated through time complexity and global convergence analyses. Comparative simulation experiments benchmarked IESO against five state-of-the-art optimization algorithms across test functions and path-planning simulated scenarios. The experimental results indicate that the enhanced algorithm achieves superior optimization precision, faster convergence speeds, and improved quality in the planned trajectories by 30%.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

In response to the burgeoning global demand for premium agricultural products, particularly within the competitive nut market, this paper introduces an innovative methodology aimed at enhancing the grading process for almonds and their shells. Leveraging state-of-the-art Deep Convolutional Neural Networks (CNNs), specifically the AlmondNet-20 architecture, our study achieves exceptional accuracy exceeding 99%, facilitated by the utilization of a 20-layer CNN model. To bolster robustness in differentiating between almonds and shells, data augmentation techniques are employed, ensuring the reliability and accuracy of our classification system. Our model, meticulously trained over 1000 epochs, demonstrates remarkable performance, boasting an accuracy rate of 99% alongside a minimal loss function of 0.0567. Rigorous evaluation through test datasets further validates the efficacy of our approach, revealing impeccable precision, recall, and F1-score metrics for almond detection. Beyond its technical prowess, this advanced classification system offers tangible benefits to both industry experts and non-specialists alike, ensuring globally reliable almond classification. The application of deep learning algorithms, as showcased in our study, not only enhances grading accuracy but also presents opportunities for product patents, thereby contributing to the economic value of our nation. Through the adoption of cutting-edge technologies such as the AlmondNet-20 model, we pave the way for future advancements in agricultural product classification, ultimately enriching global trade and economic prosperity.

Insulated Gate Bipolar Transistor (IGBT) may convey high current and sustain high breakdown voltages; it may provide high power control. In a sense, how IGBT demonstrates the capability of power control was not specifically described, and the equivalent bipolar junction transistors (BJT) activated by an applied bias to the insulated gate is intriguing. As seen in Figure 1, IGBT shows an equivalent circuit structure containing two types of BJT, (NPN-type Bipolar transistor and PNP-type Bipolar transistor), which can be modeled as diode-associated transistor. Apparently, as a bias applies to the controlling gate, the channel beneath the gate oxide gets strongly inversed and turns out to be conductive just like what happens on metal-oxide-silicon field effect transistor (MOSFET), which provides necessary igniting currents to both BJTs and thus causes high current gain flowing through them-selves from the bottom. A proposed and renewed formula provides addressing the above scenario and successfully fitting the measured data that forms the characteristic curves. Some parameters in the proposed formula, which includes size and mobility associated constant, threshold voltage, and Early-Voltage-related lambda for MOSFET, explain and explore the underlying physics. IGBT thus enjoy high input impedance and high current gain due to MOSFET (Insulated Gate) and BJT, respectively. This formula combines both merits of MOSFET and BJT in order to fit the measured data. Indeed, the formula intimately fits IGBT electrical characteristic curves, and thus may be qualified and served as a model. The new model is then advisable for designing power integrated circuit to exactly achieve power saving, power control, and power efficiency.

The state of charge estimation is an important part of the battery management system, the estimation accuracy of which seriously affects the working performance of the lithium ion battery pack. The unscented Kalman filter algorithm has been developed and applied to the iterative calculation process. When it is used to estimate the SOC value, there is a rounding error in the numerical calculation. When the sigma point is sampled in the next round, an imaginary number appears, resulting in the estimation failure. In order to improve the estimation accuracy, an improved adaptive square root - unscented Kalman filter method is introduced which combines the QR decomposition in the calculation process. Meanwhile, an adaptive noise covariance matching method is implied. Experiments show that the proposed method can guarantee the semi-positive and numerical stability of the state covariance, and the estimation accuracy can reach the third-order precision. The error remains about 1.60% under the condition of drastic voltage and current changes. The conclusion of this experiment can provide a theoretical basis of the state of charge estimation in the battery management of the lithium ion battery pack.

Counter-current spontaneous imbibition of water is a critical oil-recovery mechanism. In the laboratory, the Amott test is a widely used technique to assess efficacy of brine imbibition into oil-saturated core plugs. The classic Amott-cell methodology was designed to estimate ultimate oil recovery, but not the recovery dynamics that provides essential information about the imbibition mechanisms. Retention of oil droplets at the external core surface and delayed onset of oil production are the two key artifacts of the classic Amott experiment. This retention, referred to here as the ``external-surface oil holdup effect'', often results in stepwise recovery curves that obscure true dynamics of spontaneous imbibition. To address these holdup drawbacks of the classic Amott method, we modified the Amott cell and experimental procedure. For the first time, using water-wet Indiana limestone cores saturated with brine and mineral oil, we showed that our improvements of the Amott method enabled accurate and reproducible measurements of oil-recovery dynamics. We used the Generalized Extreme Value (GEV) statistics to describe oil-production histories from water-wet heterogeneous limestone cores with finite initial water saturations, for the first time. We demonstrated that our four-parameter GEV model accurately described the recovery dynamics, and that optimal GEV parameter values systematically reflected the key characteristics of the oil-rock system, such as oil viscosity and rock permeability. These findings gave us a more fundamental understanding of spontaneous, counter-current imbibition mechanisms and insights into what constitutes a predictive model of counter-current water imbibition into oil-saturated rocks with finite initial water saturation.

Starting from the fact that one of the global control strategies of the Permanent Magnet Synchronous Motor (PMSM), namely the Direct Torque Control (DTC) type control strategy, is characterised by the fact that the inner flux and torque control loop usually uses hysteresis ON-OFF type controllers and the oscillations introduced by them have to be cancelled out by the outer speed loop controller (which is usually a PI speed controller and whose performance is good around the global operating points and for relatively small variations of the external parameters and disturbances caused in particular by the load torque variation), while retaining the advantages of the DTC strategy, this paper presents the improvement of the performance of the PMSM sensorless control system using Proportional Integrator (PI), PI Equilibrium Optimizer Algorithm (EOA), Fractional Order (FO) PI, Tilt Integral Derivative (TID) and FO Lead-Lag for constant flux, and Sliding Mode Control (SMC) and FOSMC for variable flux. The performance indicators of the control system are the usual ones: response time, settling time, overshoot, steady-state error and speed ripple, plus another one given by the fractal dimension (FD) of the PMSM rotor speed signal, and the hypothesis that the FD of the controlled signal is higher when the control system provides better performance is verified. The paper also presents the basic equations of the PMSM, based on which the synthesis of integer and fractional controllers, the synthesis of an observer for estimating the PMSM rotor speed, electromagnetic torque and stator flux are presented. The comparison of the performance of the proposed control systems and the demonstration of the parametric robustness are performed by numerical simulations in Matlab/Simulink using Simscape Electrical and Fractional Order Modelling and Control (FOMCON). Real-time control based on an embedded system using a TMS320F28379D controller demonstrates the good performance of the PMSM sensorless control system based on the DTC strategy in a complete hardware-in-the-loop (HIL) implementation.