Search

Context: Software product lines (SPLs) have reached a considerable level of adoption in the software industry. The most commonly used models for managing the variability of SPLs are feature models (FMs). The analysis of FMs is an error-prone, tedious task, and it is not feasible to accomplish this task manually with large-scale FMs. In recent years, much effort has been devoted to developing reasoning algorithms for FMs. Aim: To synthesize the evidence on the use of reasoning algorithms for feature modeling. Method: We conducted a systematic mapping study, including six research questions. This study included 66 papers published from 2010 to 2020. Results: We found that most algorithms were used in the domain stage (70%). The most commonly used technologies were transformations (18%). As for the origins of the proposals, they were mainly rooted in academia (76%). The FODA model continued to be the most frequently used representation for feature modeling (70%). A large majority of the papers presented some empirical validation process (90%). Conclusion: We were able to respond to the RQs. The FODA model is consolidated as a reference within SPLs to manage variability. Responses to RQ2 and RQ6 require further review. [ABSTRACT FROM AUTHOR]

Cellular structures consist of foams, honeycombs, and lattices. Lattices have many outstanding properties over foams and honeycombs, such as lightweight, high strength, absorbing energy, and reducing vibration, which has been extensively studied and concerned. Because of excellent properties, lattice structures have been widely used in aviation, bio-engineering, automation, and other industrial fields. In particular, the application of additive manufacturing (AM) technology used for fabricating lattice structures has pushed the development of designing lattice structures to a new stage and made a breakthrough progress. By searching a large number of research literature, the primary work of this paper reviews the lattice structures. First, based on the introductions about lattices of literature, the definition and classification of lattice structures are concluded. Lattice structures are divided into two general categories in this paper: uniform and non-uniform. Second, the performance and application of lattice structures are introduced in detail. In addition, the fabricating methods of lattice structures, i.e., traditional processing and additive manufacturing, are evaluated. Third, for uniform lattice structures, the main concern during design is to develop highly functional unit cells, which in this paper is summarized as three different methods, i.e., geometric unit cell based, mathematical algorithm generated, and topology optimization. Forth, non-uniform lattice structures are reviewed from two aspects of gradient and topology optimization. These methods include Voronoi-tessellation, size gradient method (SGM), size matching and scaling (SMS), and homogenization, optimization, and construction (HOC). Finally, the future development of lattice structures is prospected from different aspects. [ABSTRACT FROM AUTHOR]

To overcome the deficiencies in segmenting hot spots from thermal infrared images, such as difficulty extracting the edge features, low accuracy, and a high missed detection rate, an improved Mask R-CNN photovoltaic hot spot thermal image segmentation algorithm has been proposed in this paper. Firstly, the edge image features of hot spots were extracted based on residual neural networks. Secondly, by combining the feature pyramid structure, an edge-guided feature pyramid structure was designed, and the hot spot edge features were injected into a Mask R-CNN network. Thirdly, an infrared spatial attention module was introduced into the Mask R-CNN network when feature extraction and the infrared features of the detected hot spots were enhanced. Fourthly, the size ratio of the candidate frames was adjusted self-adaptively according to the structural characteristics of the aspect ratio of the hot spots. Finally, the validation experiments were conducted, and the results demonstrated that the hot spot contours of thermal infrared images were enhanced through the algorithm proposed in this paper, and the segmentation accuracy was significantly improved. [ABSTRACT FROM AUTHOR]

Featured Application: A self-configurable assembly workstation with integrated I4.0 technologies and controlled by smart algorithm provides an ergonomic workplace for each worker and prevents errors during assembly. Due to increasing competition in the global market and to meet the need for rapid changes in product variability, it is necessary to introduce self-configurable and smart solutions within the entire process chain, including manual assembly to ensure the more efficient and ergonomic performance of the manual assembly process. This paper presents a smart assembly system including newly developed smart manual assembly workstation controlled by a smart algorithm. The smart assembly workstation is self-configurable according to the anthropometry of the individual worker, the complexity of the assembly process, the product characteristics, and the product structure. The results obtained by a case study show that is possible to organize manual assembly process with rapid adaptation of the smart assembly system to new products and workers characteristics, to achieve ergonomic working conditions through Digital Human Modelling (DHM), to minimize assembly time, and to prevent error during the assembly process. The proposed system supports the manual assembly process redesign to ensure a better working environment and aims to have an important value for applying the smart algorithms to manual assembly workstations in human-centered manufacturing systems. [ABSTRACT FROM AUTHOR]

Topographic maps comprise a rich data source for the processing and analysis of geographic information. However, the management of paper topographic maps is still dominated by an inefficient manual method, and there is no counting equipment for topographic maps that is suitable for narrow map warehouse passages. The existing algorithms relating to paper counting require paper hardness and cannot directly obtain the internal information of topographic maps. To address the above problems, using a map inventory machine transformed from a paddle-type paper counting machine to perform a preliminary count and obtain the video data of the counting progress, an automatic counting algorithm for topographic maps for map management is proposed in this study. First, the periodic feature changes of all the targets and each individual target in the videos are analyzed. Second, a deformable parts model accelerated by fast feature pyramids and by reducing the region of interest is used for the object detection of mechanical wheels. The grayscale variance function is selected to quantify the quality change in the images. Finally, a fusion window counting model is constructed with the adaptive window and fixed window methods. The experimental results show that the average counting accuracy of the model is about 95%, which can verify the initial counting results of the machine and provide high-quality keyframes for the subsequent sheet designation recognition. [ABSTRACT FROM AUTHOR]

The purpose of the self-driving car is to minimize the number casualties of traffic accidents. One of the effects of traffic accidents is an improper speed of a car, especially at the road turn. If we can make the anticipation of the road turn, it is possible to avoid traffic accidents. This paper presents a cutting edge curve lane detection algorithm based on the Kalman filter for the self-driving car. It uses parabola equation and circle equation models inside the Kalman filter to estimate parameters of a using curve lane. The proposed algorithm was tested with a self-driving vehicle. Experiment results show that the curve lane detection algorithm has a high success rate. The paper also presents simulation results of the autonomous vehicle with the feature to control steering and speed using the results of the full curve lane detection algorithm. [ABSTRACT FROM AUTHOR]

Partial discharge (PD) is a primary factor leading to the deterioration of insulation in electrical equipment. However, it is hard for traditional methods to precisely extract PD signals in increasingly complex engineering environments. This paper proposes a new PD signal denoising method combining Aquila Optimizer–Variational Mode Decomposition (AO-VMD) and K-Singular Value Decomposition (K-SVD) algorithms. Firstly, the AO algorithm optimizes critical parameters of the VMD algorithm. For the PD signal overwhelmed by noise, the AO-VMD algorithm can decompose it and reconstruct it by using kurtosis. In this process, the majority of the noise is removed, and the characteristics of the original signal are shown. Subsequently, the K-SVD algorithm performs sparse decomposition on the signal after OA-VMD, constructs a learned dictionary, and captures the characteristics of the signal for continuous learning and updating. After the dictionary learning is completed, the best matching atoms from the dictionary are selected to precisely reconstruct the original noiseless signal. Finally, the proposed method is compared with three traditional algorithms, Adaptive Ensemble Empirical Mode Decomposition (AEEMD), SVD-VMD, and the Adaptive Wavelet Multilevel Soft Threshold algorithm, on the simulated signal and the actual engineering signal. The results both demonstrate that the algorithm proposed by this paper has superior noise reduction and signal extraction performance. [ABSTRACT FROM AUTHOR]

Evolutionary multi-objective clustering (EMOC) algorithms have gained popularity recently, as they can obtain a set of clustering solutions in a single run by optimizing multiple objectives. Particularly, in one type of EMOC algorithm, the number of clusters k is taken as one of the multiple objectives to obtain a set of clustering solutions with different k. However, the numbers of clusters k and other objectives are not always in conflict, so it is impossible to obtain the clustering solutions with all different k in a single run. Therefore, evolutionary multi-objective k-clustering (EMO-KC) has recently been proposed to ensure this conflict. However, EMO-KC could not obtain good clustering accuracy on high-dimensional datasets. Moreover, EMO-KC's validity is not ensured as one of its objectives (SSDexp, which is transformed from the sum of squared distances (SSD)) could not be effectively optimized and it could not avoid invalid solutions in its initialization. In this paper, an improved evolutionary multi-objective clustering algorithm based on autoencoder (AE-IEMOKC) is proposed to improve the accuracy and ensure the validity of EMO-KC. The proposed AE-IEMOKC is established by combining an autoencoder with an improved version of EMO-KC (IEMO-KC) for better accuracy, where IEMO-KC is improved based on EMO-KC by proposing a scaling factor to help effectively optimize the objective of SSDexp and introducing a valid initialization to avoid the invalid solutions. Experimental results on several datasets demonstrate the accuracy and validity of AE-IEMOKC. The results of this paper may provide some useful information for other EMOC algorithms to improve accuracy and convergence. [ABSTRACT FROM AUTHOR]

In order to analyze the relay action process from an imaging perspective and further investigate the bounce phenomenon of relay contacts during the contact process, this paper utilizes a high-speed shooting platform to capture images of relay action. In light of the situation where the stationary contact in the image is inclined and continuously changing, a rotation template matching algorithm based on adaptive weight is proposed. The algorithm identifies and obtains the inclination angle of the stationary contact, enabling the study of the relay contact bounce process. By extracting contact bounce distance data from the images, a bounce process curve is plotted. Combined with the analysis of the contact bounce process, the reasons for the bounce are explored. The results indicate that the proposed rotation template matching algorithm can accurately identify stationary contacts and their angles at different angles. By analyzing the contact status and bounce process of the relay contacts in conjunction with the relay structure, parameters such as the bounce time, bounce height, and time required to reach the maximum distance can be calculated. Additionally, the main reason for contact bounce in the relay studied in this paper is the limitation imposed on the continued movement of the stationary contact by the presence of the relay brackets when the kinetic energy of the contact is too high. This phenomenon occurs during the first vibration peak in the vibration process after the moving contact contacts the stationary contact. The research results provide a reference for further studying the relay contact bounce process, optimizing relay structure, and suppressing contact bounce. [ABSTRACT FROM AUTHOR]

As core algorithms of geographic computing, overlay analysis algorithms typically have computation-intensive and data-intensive characteristics. It is highly important to optimize overlay analysis algorithms by parallelizing the vector polygons after reasonable data division. To address the problem of unbalanced data partitioning in the task decomposition process for parallel polygon overlay analysis and calculation, this paper presents a data partitioning method based on shape complexity index optimization, which achieves data equalization among multicore parallel computing tasks. Taking the intersection operator and difference operator of the Vatti algorithm as examples, six polygon shape indexes are selected to construct the shape complexity model, and the vector data are divided in accordance with the calculated shape complexity results. Finally, multicore parallelism is achieved based on OpenMP. The experimental results show that when a data set with a large amount of data is used, the effect of the multicore parallel execution of the Vatti algorithm's intersection operator and difference operator based on shape complexity division is clearly improved. With 16 threads, compared with the serial algorithm, speedups of 29 times and 32 times can be obtained. Compared with the traditional multicore parallel algorithm based on polygon number division, the speed can be improved by 33% and 29%, and the load balancing index is reduced. For a data set with a small amount of data, the acceleration effect of this method is similar to that of traditional methods involving multicore parallelism. [ABSTRACT FROM AUTHOR]

The utilization of ultraviolet (UV) absorption spectroscopy for monitoring the concentration of specific decomposition gas components in gas-insulated switchgear (GIS) can provide a means to assess its insulation status. Nevertheless, UV optical modules currently deployed in the field are susceptible to external interferences like ambient noise and equipment vibrations. Real-time spectral data acquisition often suffers from significant noise contamination, directly impinging on subsequent feature extraction and detection accuracy. This paper presents an optimized singular value decomposition (SVD) noise reduction method for mitigating noisy spectral signals. First, each singular value within the noisy signal is transformed into a component signal. Next, the highest frequency value in the signal serves as an indicator to characterize the signal. Finally, the primary frequency values are arranged based on the decreasing singular values of the original noisy signal. The singular value corresponding to the first primary frequency value surpassing a preset threshold is selected as the effective order for denoising. Random noise with varying intensities was intentionally introduced to the UV spectral signal of sulfur dioxide (SO2), followed by noise reduction procedures. It is shown that the improved SVD noise reduction algorithm proposed in this paper enhances the signal-to-noise ratio (SNR) by 18.02% and 16.86%, and reduces the root-mean-square error (RMSE) by 15.13% and 14.92%, respectively, compared with the singular value difference spectrum (SVDS) denoising method and wavelet transform denoising method under the condition of low SNR. Furthermore, there exists a linear relationship between the concentration of SO2 samples and the eigenvalues of the UV spectra, demonstrating a higher linear goodness with a coefficient of 0.99735. The denoising method proposed in this paper does not require the manual setting of various types of parameters, and has a better ability to deal with the noise of UV spectral signals in engineering sites with complex environments. [ABSTRACT FROM AUTHOR]

Deep learning-based object detection methods address the problem of how to trade off the object detection accuracy and detection speed of the model. This paper proposes the PBA-YOLOv7 network algorithm, which is based on the YOLOv7 network, and first introduces the PConv, which lightens the ELAN module in the backbone network structure and reduces the number of parameters to improve the detection speed of the network and then designs and introduces the BiFusionNet network, which better aggregates the high-level semantic features and the low-level semantic features; and finally, on this basis, the coordinate attention mechanism is introduced to make the network focus on more critical features without increasing the model complexity. The coordinate attention mechanism is introduced to make the network focus more on important feature information and improve the feature expression ability of the network without increasing the model complexity. Experiments on the publicly available KITTI's dataset show that the PBA-YOLOv7 network model significantly improves both detection accuracy and detection speed compared to the original YOLOv7 model, with 4% and 7.8% improvement in mAP0.5 and mAP0.5:0.95, respectively, and six frames improvement in FPS. The improved algorithm in this paper weighs the model's detection accuracy and detection speed in the detection task. It performs well compared to other algorithms, such as YOLOv7 and YOLOv5l. [ABSTRACT FROM AUTHOR]

Street-view images can help us to better understand the city environment and its potential characteristics. With the development of computer vision and deep learning, the technology of semantic segmentation algorithms has become more mature. However, DeeplabV3+, which is commonly used in semantic segmentation, has shortcomings such as a large number of parameters, high requirements for computing resources, and easy loss of detailed information. Therefore, this paper proposes LM-DeeplabV3+, which aims to greatly reduce the parameters and computations of the model while ensuring segmentation accuracy. Firstly, the lightweight network MobileNetV2 is selected as the backbone network, and the ECA attention mechanism is introduced after MobileNetV2 extracts shallow features to improve the ability of feature representation; secondly, the ASPP module is improved, and on this basis, the EPSA attention mechanism is introduced to achieve cross-dimensional channel attention and important feature interaction; thirdly, a loss function named CL loss is designed to balance the training offset of multiple categories and better indicate the segmentation quality. This paper conducted experimental verification on the Cityspaces dataset, and the results showed that the mIoU reached 74.9%, which was an improvement of 3.56% compared to DeeplabV3+; and the mPA reached 83.01%, which was an improvement of 2.53% compared to DeeplabV3+. [ABSTRACT FROM AUTHOR]

Aiming at the characteristics of remote sensing images such as a complex background, a large number of small targets, and various target scales, this paper presents a remote sensing image target detection algorithm based on improved YOLOv8. First, in order to extract more information about small targets in images, we add an extra detection layer for small targets in the backbone network; second, we propose a C2f-E structure based on the Efficient Multi-Scale Attention Module (EMA) to enhance the network's ability to detect targets of different sizes; and lastly, Wise-IoU is used to replace the CIoU loss function in the original algorithm to improve the robustness of the model. Using our improved algorithm for the detection of multiple target categories in the DOTAv1.0 dataset, the mAP@0.5 value is 82.7%, which is 1.3% higher than that of the original YOLOv8 algorithm. It is proven that the algorithm proposed in this paper can effectively improve target detection accuracy in remote sensing images. [ABSTRACT FROM AUTHOR]

Existing algorithms for enhancing low-light images predominantly focus on the low-light region, which leads to over-enhancement of the glare region, and the high complexity of the algorithm makes it difficult to apply it to embedded devices. In this paper, a GS-AGC algorithm based on regional luminance perception is proposed. The indirect perception of the human eye's luminance vision was taken into account. All similar luminance pixels that satisfied the luminance region were extracted, and adaptive adjustment processing was performed for the different luminance regions of low-light images. The proposed method was evaluated experimentally on real images, and objective evidence was provided to show that its processing effect surpasses that of other comparable methods. Furthermore, the potential practical value of GS-AGC was highlighted through its effective application in road pedestrian detection and face detection. The algorithm in this paper not only effectively suppressed glare but also achieved the effect of overall image quality enhancement. It can be easily combined with the embedded hardware FPGA for acceleration to improve real-time image processing. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to address the extraction of entities and relationships from unstructured Chinese text, with a particular emphasis on the challenges of Named Entity Recognition (NER) and Relation Extraction (RE). This will be achieved by integrating external lexical information and utilizing the abundant semantic information available in Chinese. We utilize a pipeline model that is applied separately to NER and RE by introducing an innovative NER model that integrates Chinese pinyin, characters, and words to enhance recognition capabilities. Simultaneously, we incorporate information such as entity distance, sentence length, and part-of-speech to improve the performance of relation extraction. We also delve into the interactions among data, models, and inference algorithms to improve learning efficiency in addressing this challenge. In comparison to existing methods, our model has achieved significant results. [ABSTRACT FROM AUTHOR]

Intelligent gangue sorting with high precision is of vital importance for improving coal quality. To tackle the challenges associated with coal gangue target detection, including algorithm performance imbalance and hardware deployment difficulties, in this paper, an intelligent gangue separation system that adopts the elevated YOLO-v5 algorithm and dual-energy X-rays is proposed. Firstly, images of dual-energy X-ray transmission coal gangue mixture under the actual operation of a coal mine were collected, and datasets for training and validation were self-constructed. Then, in the YOLOv5 backbone network, the EfficientNetv2 was used to replace the original cross stage partial darknet (CSPDarknet) to achieve the lightweight of the backbone network; in the neck, a light path aggregation network (LPAN) was designed based on PAN, and a convolutional block attention module (CBAM) was integrated into the BottleneckCSP of the feature fusion block to raise the feature acquisition capability of the network and maximize the learning effect. Subsequently, to accelerate the rate of convergence, an efficient intersection over union (EIOU) was used instead of the complete intersection over union (CIOU) loss function. Finally, to address the problem of low resolution of small targets leading to missed detection, an L2 detection head was introduced to the head section to improve the multi-scale target detection performance of the algorithm. The experimental results indicate that in comparison with YOLOv5-S, the same version of the algorithm proposed in this paper increases by 19.2% and 32.4% on mAP @.5 and mAP @.5:.95, respectively. The number of parameters decline by 51.5%, and the calculation complexity declines by 14.7%. The algorithm suggested in this article offers new ideas for the design of identification algorithms for coal gangue sorting systems, which is expected to save energy and reduce consumption, reduce labor, improve efficiency, and be more friendly to the embedded platform. [ABSTRACT FROM AUTHOR]

The hyperspectral anomaly detection algorithm based on collaborative representation does not fully utilize the two-dimensional spatial features in hyperspectral images. It also has the problem that anomalous pixels will pollute the background dictionary and induce bad detection performance. Based on these, this paper proposes a hyperspectral anomaly detection algorithm based on multiple feature joint trilateral filtering and collaborative representation. The algorithm first introduces an improved trilateral filtering algorithm, which utilizes the spatial features of hyperspectral images. The preliminary positions of possible abnormal objects are determined. On this basis, abnormal removal and background filling are performed to obtain a purified background. Finally, the purified background and the original hyperspectral image are used for joint collaborative representation to complete the detection. Experimental results show that the detection accuracy of the algorithm proposed in this paper was efficiently improved by introducing multiple feature joint trilateral filtering, where multiple spatial spectrum features are utilized. [ABSTRACT FROM AUTHOR]

Multiple Sequence Alignment (MSA) plays a pivotal role in bioinformatics, facilitating various critical biological analyses, including the prediction of unknown protein structures and functions. While numerous methods are available for MSA, bioinspired algorithms stand out for their efficiency. Despite the growing research interest in addressing the MSA challenge, only a handful of comprehensive reviews have been undertaken in this domain. To bridge this gap, this study conducts a thorough analysis of bioinspired-based methods for MSA through a systematic literature review (SLR). By focusing on publications from 2010 to 2024, we aim to offer the most current insights into this field. Through rigorous eligibility criteria and quality standards, we identified 45 relevant papers for review. Our analysis predominantly concentrates on bioinspired-based techniques within the context of MSA. Notably, our findings highlight Genetic Algorithm and Memetic Optimization as the most commonly utilized algorithms for MSA. Furthermore, benchmark datasets such as BAliBASE and SABmark are frequently employed in evaluating MSA solutions. Structural-based methods emerge as the preferred approach for assessing MSA solutions, as revealed by our systematic literature review. Additionally, this study explores current trends, challenges, and unresolved issues in the realm of bioinspired algorithms for MSA, offering practitioners and researchers valuable insights and comprehensive understanding of the field. [ABSTRACT FROM AUTHOR]

With the continuous development of virtual reality, digital image applications, the required complex scene video proliferates. For this reason, portrait matting has become a popular topic. In this paper, a new matting algorithm with improved portrait details for images with complex backgrounds (MORLIPO) is proposed. This work combines the background restoration module (BRM) and the fine-grained matting module (FGMatting) to achieve high-detail matting for images with complex backgrounds. We recover the background by inputting a single image or video, which serves as a priori and aids in generating a more accurate alpha matte. The main framework uses the image matting model MODNet, the MobileNetV2 lightweight network, and the background restoration module, which can both preserve the background information of the current image and provide a more accurate prediction of the alpha matte of the current frame for the video image. It also provides the background prior of the previous frame to predict the alpha matte of the current frame more accurately. The fine-grained matting module is designed to extract fine-grained details of the foreground and retain the features, while combining with the semantic module to achieve more accurate matting. Our design allows training on a single NVIDIA 3090 GPU in an end-to-end manner and experiments on publicly available data sets. Experimental validation shows that our method performs well on both visual effects and objective evaluation metrics. [ABSTRACT FROM AUTHOR]

This paper shows the implementation of the Moth–Flame Optimization algorithm in a Cascade-H multilevel inverter with five and seven levels to determine the optimal switching sequence of the inverter's semiconductor devices. The algorithm was coded in Matlab software, and the obtained switching sequences were implemented in a Cascade-H multilevel inverter laboratory prototype, where the output voltage waveform was obtained using a digital oscilloscope. The experimental Total Harmonic Distortion was obtained using a power quality analyzer. The experimental results show the improvement of the Total Harmonic Distortion in the voltage output. These results were compared with other papers in the literature with different metaheuristic methods concerning the same modulation. These findings demonstrate the feasibility of employing the Moth–Flame Optimization Algorithm to significantly reduce the Total Harmonic Distortion, obtaining a lower value than most analyzed papers. [ABSTRACT FROM AUTHOR]

Due to the numerous objects with regular structures in indoor environments, identifying and modeling the regular objects in scenes aids indoor robots in sensing unknown environments. Typically, point cloud preprocessing can obtain highly complete object segmentation results in scenes which can be utilized as the objects for geometric analysis and modeling, thus ensuring modeling accuracy and speed. However, due to the lack of a complete object model, it is not possible to recognize and model segmented objects through matching methods. To achieve a greater understanding of scene point clouds, this paper proposes a direct geometric modeling algorithm based on segmentation results, which focuses on extracting regular geometries in the scene, rather than objects with geometric details or combinations of multiple primitives. This paper suggests using simpler geometric models to describe the corresponding point cloud data. By fully utilizing the surface structure information of segmented objects, the paper analyzes the types of faces and their relationships to classify regular geometric objects into two categories: planar and curved. Different types of geometric objects are fitted using random sampling consistency algorithms with type classification results as prior knowledge, and segmented results are modeled through a combination of size information associated with directed bounding boxes. For indoor scenes with occlusion and stacking, utilizing a higher-level semantic expression can effectively simplify the scene, complete scene abstraction and structural modeling, and aid indoor robots' understanding and further operation in unknown environments. [ABSTRACT FROM AUTHOR]

Rice pests and diseases have a significant impact on the quality and yield of rice, and even have a certain impact on and cause a loss in the national agricultural industry and economy. The timely and accurate detection of pests and diseases is the basic premise of formulating effective rice pest control and prevention programs. However, the complexity and diversity of pests and diseases and the high similarity between some pests and diseases make the detection and classification task of pests and diseases extremely difficult without detection tools. The existing target detection algorithms can barely complete the task of detecting pests and diseases, but the detection effect is not ideal. In the actual situation of rice disease and insect pest detection, the detection algorithm is required to have fast speed, high accuracy, and good performance for small target detection, and so this paper improved the popular yolov5 algorithm to achieve an ideal detection performance suitable for rice disease and insect pest detection. This paper briefly introduces the current status and influence of rice pests and diseases and several target detection algorithms based on deep learning. Based on the yolov5 algorithm, the RepVGG network structure is introduced, 3*3 convolution is combined with ReLU, a training time model with multi-branch topology is adopted, and the inference time is reduced through layer merging. To improve algorithm detection speed, the SK attention mechanism is introduced to improve the receptive field of the convolution kernel to obtain more information and improve accuracy. In addition, Adaptive NMS is replaced by Adaptive NMS, the dynamic suppression strategy is adopted, and scores for learning density are set, which greatly improves the problems of missing detection and the false detection of small targets. Finally, the improved algorithm model is combined with membrane calculation to further improve the accuracy and speed of the algorithm. According to the experimental results, the accuracy of the improved algorithm is increased by about 2.7 percentage points, and the mAP is increased by 4.3 percentage points, up to 94.4%. The speed is improved by about 2.8 percentage points, and indicators such as recall rate and AP are improved. [ABSTRACT FROM AUTHOR]

Infrared images have good anti-environmental interference ability and can capture hot target information well, but their pictures lack rich detailed texture information and poor contrast. Visible image has clear and detailed texture information, but their imaging process depends more on the environment, and the quality of the environment determines the quality of the visible image. This paper presents an infrared image and visual image fusion algorithm based on deep learning. Two identical feature extractors are used to extract the features of visible and infrared images of different scales, fuse these features through specific fusion methods, and restore the features of visible and infrared images to the pictures through the feature restorer to make up for the deficiencies in the various photos of infrared and visible images. This paper tests infrared visual images, multi-focus images, and other data sets. The traditional image fusion algorithm is compared several with the current advanced image fusion algorithm. The experimental results show that the image fusion method proposed in this paper can keep more feature information of the source image in the fused image, and achieve excellent results in some image evaluation indexes. [ABSTRACT FROM AUTHOR]

Chinese medical texts contain a large number of medically named entities. Automatic recognition of these medical entities from medical texts is the key to developing medical informatics. In the field of Chinese medical information extraction, annotated Chinese medical text data are very few. In the named entity recognition task, there is insufficient labeled data, which leads to low model recognition performance. Therefore, this paper proposes a Chinese medical entity recognition model based on multi-neural network fusion and the improved Tri-Training algorithm. The model performs semi-supervised learning by improving the Tri-Training algorithm. According to the characteristics of the medical entity recognition task and medical data, the method in this paper is improved in terms of the division of the initial sub-training set, the construction of the base classifier, and the integration of the learning voting method. In addition, this paper also proposes a multi-neural network fusion entity recognition model for base classifier construction. The model learns feature information jointly by combining Iterated Dilated Convolutional Neural Network (IDCNN) and BiLSTM. Through experimental verification, the model proposed in this paper outperforms other models and improves the performance of the Chinese medical entity recognition model by incorporating and improving the semi-supervised learning algorithm. [ABSTRACT FROM AUTHOR]

The target review has been proven to be able to predict the target user's rating of the target item. However, in practice, it is difficult to obtain the target review promptly. In addition, the target review and the rating may sometimes be inconsistent (such as preference reviews and low ratings). There is currently a lack of research on the above issues. Therefore, this paper proposed a Recommendation algorithm that Simulates the generation of target review semantics and fuses the ID Information (RSII). Specifically, based on the characteristics of the target review available during the model training, this paper designed a teacher module and a review semantics learning module. The teacher module learned the semantics of the target review and guided the review semantics learning model to learn these semantics. Then, this study used the fusion module to dynamically fuse the target review semantics and the ID information, enriching the representation of predictive features, thereby, alleviating the problem of inconsistency between the target review and the rating. Finally, the RSII model was extensively tested on three public datasets. The results showed that compared with seven of the latest and most advanced models, the RSII model improved the MSE metric by 8.81% and the MAE metric by 10.29%. [ABSTRACT FROM AUTHOR]

This document is a summary of a special issue of the journal Applied Sciences on real-time diagnosis algorithms in biomedical applications and decision support tools. The issue includes ten papers that showcase advances in data analysis techniques and their potential to improve doctors' daily tasks. Five papers focus on real-time diagnosis algorithms, covering topics such as ventricular fibrillation detection, bio-impedance spectrometry, epilepsy localization, physical activity recognition, and exhaled acetone detection. The other five papers explore decision support tools, including machine learning models for disease classification, optical breast contour detection, analysis of human body balance, handwriting analysis for neurodegenerative disease assessment, and automatic detection of brain markers using deep learning. The issue concludes that these research topics have a high social impact and contribute to improving human lives. [Extracted from the article]

Featured Application: The main purpose of this study is to present a strain profile demodulation method for a fiber Bragg grating (FBG) reflection spectrum based on the grey wolf optimizer (GWO) algorithm and a modified transfer-matrix method (TMM). A reconstructed non-uniform strain profile produced by the GWO algorithm was verified by experimental data obtained using the digital image correlation (DIC) method. The results showed that the target experimental strain profile was in good agreement with the reconstructed strain profile. A structural strain reconstruction based on the grey wolf optimizer (GWO) algorithm using fiber Bragg grating (FBG) sensors is described in this paper. The fiber strain data obtained by the GWO algorithm and a modified transfer-matrix method (TMM) are verified by experimental data obtained using the digital image correlation (DIC) method. In the GWO algorithm, the optimization goal is set as the minimum error between the target experimental deformation spectrum and a random simulation strain spectrum, and the strain reconstruction is obtained by means of continuous iterative optimization. The validity of this method is confirmed by experimental strain data obtained by DIC, and the verification results show that the method proposed in this paper can be used as an accurate and efficient method of strain reconstruction. [ABSTRACT FROM AUTHOR]

In this paper, the mobile robot position fusion algorithm is inaccurate. There is a delay, and the map-construction accuracy is not high; an improvement method is proposed. First, the Cartographer algorithm is optimized. Radius filtering is used for data processing after voxel filtering. In contrast, the idea of multi-sensor fusion is used to fuse the processed IMU data information. This improved method improves the efficiency of the algorithm and the accuracy of the positional pose fusion. We verify the effect of the algorithm applied to the environment map, respectively, in the experimental building promenade environment and the teaching building hall environment, and analyze and compare the effect of map construction before and after the improvement; the experiment proves that in the experimental building promenade environment, the absolute error of measuring and analyzing the obstacles reduces by 0.06 m, and the relative error decreases by 1.63%; in the teaching building hall environment, the absolute error of measuring and analyzing the longest side of the map decreases by 1.121 m and the relative error decreased by 5.52%. In addition, during the experimental operation, the CPU occupancy of the optimized algorithm is around 59.5%. In contrast, the CPU occupancy of the original algorithm is 67% on average, and sometimes it will soar to 75%. The experimental results prove that the algorithm in this paper significantly improves performance in all aspects when constructing real-time environment maps. [ABSTRACT FROM AUTHOR]

Mainstream deepfake detection algorithms generally fail to fully extract forgery traces and have low accuracy when detecting forged images with natural corruptions or human damage. On this basis, a new algorithm based on an adversarial dual-branch data augmentation framework and a modified attention mechanism is proposed in this paper to improve the robustness of detection models. First, this paper combines the traditional random sampling augmentation method with the adversarial sample idea to enhance and expand the forged images in data preprocessing. Then, we obtain training samples with diversity and hardness uniformity. Meanwhile, a new attention mechanism is modified and added to the ResNet50 model. The improved model serves as the backbone, effectively increasing the weight of forged traces in the multi-scale feature maps. The Jensen–Shannon divergence loss and cosine annealing algorithms are introduced into the training process to improve the model's accuracy and convergence speed. The proposed algorithm is validated on standard and corrupted datasets. The experiments show that the algorithm proposed in this paper significantly improves effectiveness and robustness, with accuracies of 4.16%, 7.37%, and 3.87% better than the baseline model on DeepFakes, FaceSwap, and FaceShifer, respectively. Most importantly, its detection performance on the corrupted datasets DeepFakes-C, FaceSwap-C, and FaceShifer-C is much higher than that of mainstream methods. [ABSTRACT FROM AUTHOR]

As a hot topic in the field of library and information, the research on topic recognition and trend prediction has been paid close attention by academic circles. This paper uses a systematic literature review, bibliometric analyses and classification methods. Through a systematic literature review, 96 studies about topic identification and evolution prediction models are selected from the CNKI database. By using VOSviewer to conduct bibliometric analyses, the key research content and themes are revealed. Through the classification method, EXCEL is used to summarize models and algorithms used in the literature comprehensively. It is found that topic identification models and algorithms can be divided into four categories: ① Topic model based on LDA and related derivative models. ② Machine learning and deep learning methods. ③ Methods based on reference relation. ④ Text mining methods. Trend prediction models and algorithms mainly cover two categories: ① deep learning or machine learning models and algorithms based on time sequence; ② link prediction algorithms based on complex network. At the same time, we have also summarized the common index system involved in each study and the way to evaluate the effectiveness of the method, thus this paper comprehensively reveals the application progress in academic circles of topic identification and prediction models and algorithms from the last 10 years and beyond, based on the CNKI database. The purpose is to determine the most popular models and algorithms applied in research, generalize the corresponding indicator systems and validation methods, and finally provide references for model choice or evaluation when identifying and predicting topics in the future. Thus, this paper can help us to understand the overall progress made in text analysis research, and provides a useful reference for selecting and applying the appropriate models, algorithms and indicators. [ABSTRACT FROM AUTHOR]

As an important part of the power system, it is necessary to ensure the safe and stable operation of transmission lines. Due to long-term exposure to the outdoors, the lines face many insecurity factors, and foreign object intrusion is one of them. Traditional foreign object (bird's nest, kite, balloon, trash bag) detection algorithms suffer from low efficiency, poor accuracy, and small coverage, etc. To address the above problems, this paper introduces the RCDAM-Net. In order to prevent feature loss or useful feature compression, the RevCol (Reversible Column Networks) is used as the backbone network to ensure that the total information remains unchanged during feature decoupling. DySnakeConv (Dynamic Snake Convolution) is adopted and embedded into the C2f structure, which is named C2D and integrates low-level features and high-level features. Compared to the original BottleNeck structure of C2f, the DySnakeConv enhances the feature extraction ability for elongated and weak targets. In addition, MPDIoU (Maximum Performance Diagonal Intersection over Union) is used to improve the regression performance of model bounding boxes, solving the problem of predicted bounding boxes having the same aspect ratio as true bounding boxes, but with different values. Further, we adopt Decoupled Head for detection and add additional auxiliary training heads to improve the detection accuracy of the model. The experimental results show that the model achieves mAP50, Precision, and Recall of 97.98%, 98.15%, and 95.16% on the transmission tower line foreign object dataset, which is better to existing multi-target detection algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a YOLO fire detection algorithm based on an attention-enhanced ghost mode, mixed convolutional pyramids, and flame-centre detection (AEGG-FD). Specifically, the enhanced ghost bottleneck is stacked to reduce redundant feature mapping operations in the process for achieving lightweight reconfiguration of the backbone, while attention is added to compensate for accuracy loss. Furthermore, a feature pyramid built using mixed convolution is introduced to accelerate network inference speed. Finally, the local information is extracted by the designed flame-centre detection (FD) module for furnishing auxiliary information in effective firefighting. Experimental results on both the benchmark fire dataset and the video dataset show that the AEGG-FD performs better than the classical YOLO-based models such as YOLOv5, YOLOv7 and YOLOv8. Specifically, both the mean accuracy (mAP0.5, reaching 84.7%) and the inferred speed (FPS) are improved by 6.5 and 8.4 respectively, and both the number of model parameters and model size are compressed to 72.4% and 44.6% those of YOLOv5, respectively. Therefore, AEGG-FD achieves an effective balance between model weight, detection speed, and accuracy in firefighting. [ABSTRACT FROM AUTHOR]

Calligraphy works have high artistic value, but there is the rampant problem of forgery. Indeed, the 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 to efficiently 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 trained network model is used to judge the calligraphy works' similarity; tested on authentic works, imitated works, and works from other calligraphers; and 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. [ABSTRACT FROM AUTHOR]

The modern urban transportation service network could be split into unrestricted and restricted networks depending on whether travelers face limitations in route selection. Along with the continuous expansion of the city, it is difficult for travelers to find a more reasonable travel solution when confronted with such a complex transportation service network, which combines both unrestricted and restricted networks, especially for the park-and-ride (P&R) travel mode. This paper addresses the issue of route analysis in modern urban transportation service systems to provide travelers with reasonable travel solutions based on multiple types of transportation services. An improved A* algorithm is proposed to address the optimal path analysis for restricted networks to provide reasonable travel solutions for public transportation trips. Furthermore, by establishing the topological relationship between restricted and unrestricted networks, this paper presented an improved A* algorithm based on hybrid networks that solves the optimal path analysis problem for P&R trips, bringing convenience to many urban travelers. [ABSTRACT FROM AUTHOR]

Autonomous urban driving navigation is still an open problem and has ample room for improvement in unknown complex environments. This paper proposes an end-to-end autonomous driving approach that combines Conditional Imitation Learning (CIL), Mask R-CNN with DDPG. In the first stage, data acquisition is first performed by using CARLA, a high-fidelity simulation software. Data collected by CARLA is used to train the Mask R-CNN network, which is used for object detection and segmentation. The segmented images are transformed into the backbone of CIL to perform supervised Imitation Learning (IL). DDPG means using Reinforcement Learning for further training in the second stage, which shares the learned weights from the pre-trained CIL model. The combination of the two methods is an innovative way of considering. The benefit is that it is possible to speed up training considerably and obtain super-high levels of performance beyond humans. We conduct experiments on the CARLA driving benchmark of urban driving. In the final experiments, our algorithm outperforms the original MP by 30%, CIL by 33%, and CIRL by 10% in the most difficult tasks, dynamic navigation tasks, and in new environments and new weather, demonstrating that the two-stage framework proposed in this paper shows remarkable generalization capability in unknown environments on navigation tasks. [ABSTRACT FROM AUTHOR]

The ratio at which the number of users is increasing in cloud computing, the same as the number of data destruction, has doubled. Various algorithms have been designed to secure cloud servers to prevent an attacker from attacking, but they cannot protect the data. With the help of cryptography, data are converted into a format that is difficult for an attacker to understand, and these data can be broadcasted in a reliable format. If the attacker obtains access to the cryptographic algorithm, then the attacker can easily decrypt the data, but if the data are encrypted with the help of the key, it is difficult for the attacker to decrypt the data without the key. When the data are encrypted with the same key at different times, there is a possibility to obtain the actual key with the help of the Kasiski test. Different researchers have encrypted the data with the help of the same key or have developed an algorithm by combining different algorithms, which is a problem. This paper developed an efficient algorithm that cannot be broken easily. Even if an attacker obtains access to the algorithm, the attacker cannot identify the keys derived from that text, and the key only works in the text from which it is generated, which is the novelty of this paper. Data are secured in two different layers. In Layer-1, the proposed algorithm implements plaintext and a static key to obtain the encrypted text and a Vigenère key. In Layer-2, the encrypted text and the Vigenère key are implemented on the Vigenère cipher algorithm to obtain the ciphertext. At the end of the paper, a comparison of different papers is made with the proposed paper, and a conclusion is made based on different techniques and results. [ABSTRACT FROM AUTHOR]

In view of the problems of long matching time and the high-dimension and high-matching rate errors of traditional scale-invariant feature transformation (SIFT) feature descriptors, this paper proposes an improved SIFT algorithm with an added stability factor for image feature matching. First of all, the stability factor was increased during construction of the scale space to eliminate matching points of unstable points, speed up image processing and reduce the dimension and the amount of calculation. Finally, the algorithm was experimentally verified and showed excellent results in experiments on two data sets. Compared to other algorithms, the results showed that the algorithm proposed in this paper improved SIFT algorithm efficiency, shortened image-processing time, and reduced algorithm error. [ABSTRACT FROM AUTHOR]

Path planning is an important aspect and component in the research of mobile-robot-related technologies. Many path planning algorithms are only applicable to static environments, while in practical tasks, the uncertainty in dynamic environments increases the difficulty of path planning and obstacle avoidance compared with static environments. To address this problem, this paper proposes an RRT*-FDWA algorithm. RRT* first generates a global optimal path, and then, when obstacles exist nearby, an FDWA algorithm fixes the local path in real time. Compared with other path planning algorithms, RRT*-FDWA can avoid local minima, rapidly perform path replanning, generate a smooth optimal route, and improve the robot's maneuvering amplitude. In this paper, the effectiveness of the algorithm is verified through experiments in dynamic environments. [ABSTRACT FROM AUTHOR]

Fatigued driving is one of the leading causes of traffic accidents, and detecting fatigued driving effectively is critical to improving driving safety. Given the variety and individual variability of the driving surroundings, the drivers' states of weariness, and the uncertainty of the key characteristic factors, in this paper, we propose a deep-learning-based study of the MAX-MIN driver fatigue detection algorithm. First, the ShuffleNet V2K16 neural network is used for driver face recognition, which eliminates the influence of poor environmental adaptability in fatigue detection; second, ShuffleNet V2K16 is combined with Dlib to obtain the coordinates of driver face feature points; and finally, the values of EAR and MAR are obtained by comparing the first 100 frames of images to EAR-MAX and MAR-MIN. Our proposed method achieves 98.8% precision, 90.2% recall, and 94.3% F-Score in the actual driving scenario application. [ABSTRACT FROM AUTHOR]

During routine bridge maintenance, edge detection allows the partial condition of the bridge to be viewed. However, many edge detection methods often have unsatisfactory performances when dealing with images with complex backgrounds. Moreover, the processing often involves the manual selection of thresholds, which can result in repeated testing and comparisons. To address these problems in this paper, the wavelet transform modulus maxima method is used to detect the target image, and then the threshold value of the image can be determined automatically according to the OTSU method to remove the pseudo-edges. Thus, the real image edges can be detected. The results show that the information entropy and SSIM of the detection results are the highest when compared with the commonly used Canny and Laplace algorithms, which means that the detection quality is optimal. To more fully illustrate the advantages of the algorithms, images with more complex backgrounds were detected and the processing results of the algorithms in this paper are still optimal. In addition, the automatic selection of thresholds saves the operator's effort and improves the detection efficiency. Thanks to the combined use of the above two methods, detection quality and efficiency are significantly improved, which has a good application in engineering practice. [ABSTRACT FROM AUTHOR]

In this paper, we propose a wildlife detection algorithm based on improved YOLOv5s by combining six real wildlife images of different sizes and forms as datasets. Firstly, we use the RepVGG model to simplify the network structure that integrates the ideas of VGG and ResNet. This RepVGG introduces a structural reparameterization approach to ensure model flexibility while reducing the computational effort. This not only enhances the ability of model feature extraction but also speeds up the model computation, further improving the model's real-time performance. Secondly, we use the sliding window method of the Swin Transformer module to divide the feature map to speed up the convergence of the model and improve the real-time performance of the model. Then, it introduces the C3TR module to segment the feature map, expand the perceptual field of the feature map, solve the problem of backpropagation gradient disappearance and gradient explosion, and enhance the feature extraction and feature fusion ability of the model. Finally, the model is improved by using SimOTA, a positive and negative sample matching strategy, by introducing the cost matrix to obtain the highest accuracy with the minimum cost. The experimental results show that the improved YOLOv5s algorithm proposed in this paper improves mAP by 3.2% and FPS by 11.9 compared with the original YOLOv5s algorithm. In addition, the detection accuracy and detection speed of the improved YOLOv5s model in this paper have obvious advantages in terms of the detection effects of other common target detection algorithms on the animal dataset in this paper, which proves that the improved effectiveness and superiority of the improved YOLOv5s target detection algorithm in animal target detection. [ABSTRACT FROM AUTHOR]

Featured Application: Convolutional neural networks can accurately identify the Inferior Alveolar Canal, rapidly generating precise 3D data. The datasets and source code used in this paper are publicly available, allowing the reproducibility of the experiments performed. Introduction: The need of accurate three-dimensional data of anatomical structures is increasing in the surgical field. The development of convolutional neural networks (CNNs) has been helping to fill this gap by trying to provide efficient tools to clinicians. Nonetheless, the lack of a fully accessible datasets and open-source algorithms is slowing the improvements in this field. In this paper, we focus on the fully automatic segmentation of the Inferior Alveolar Canal (IAC), which is of immense interest in the dental and maxillo-facial surgeries. Conventionally, only a bidimensional annotation of the IAC is used in common clinical practice. A reliable convolutional neural network (CNNs) might be timesaving in daily practice and improve the quality of assistance. Materials and methods: Cone Beam Computed Tomography (CBCT) volumes obtained from a single radiological center using the same machine were gathered and annotated. The course of the IAC was annotated on the CBCT volumes. A secondary dataset with sparse annotations and a primary dataset with both dense and sparse annotations were generated. Three separate experiments were conducted in order to evaluate the CNN. The IoU and Dice scores of every experiment were recorded as the primary endpoint, while the time needed to achieve the annotation was assessed as the secondary end-point. Results: A total of 347 CBCT volumes were collected, then divided into primary and secondary datasets. Among the three experiments, an IoU score of 0.64 and a Dice score of 0.79 were obtained thanks to the pre-training of the CNN on the secondary dataset and the creation of a novel deep label propagation model, followed by proper training on the primary dataset. To the best of our knowledge, these results are the best ever published in the segmentation of the IAC. The datasets is publicly available and algorithm is published as open-source software. On average, the CNN could produce a 3D annotation of the IAC in 6.33 s, compared to 87.3 s needed by the radiology technician to produce a bidimensional annotation. Conclusions: To resume, the following achievements have been reached. A new state of the art in terms of Dice score was achieved, overcoming the threshold commonly considered of 0.75 for the use in clinical practice. The CNN could fully automatically produce accurate three-dimensional segmentation of the IAC in a rapid setting, compared to the bidimensional annotations commonly used in the clinical practice and generated in a time-consuming manner. We introduced our innovative deep label propagation method to optimize the performance of the CNN in the segmentation of the IAC. For the first time in this field, the datasets and the source codes used were publicly released, granting reproducibility of the experiments and helping in the improvement of IAC segmentation. [ABSTRACT FROM AUTHOR]

Machine learning-based malware (malicious software) detection methods have a wide range of real-world applications. However, these types of approaches suffer from the fatal problem of "model aging", in which the validity of the model decreases rapidly as the malware continues to evolve and variants emerge continuously. The model aging problem is usually solved by model retraining, which relies on lots of labeled samples obtained at great expense. To address this challenge, this paper proposes a semi-supervised continuous learning malware detection model based on Transformer. Firstly, this model improves the lifelong semi-supervised mixture algorithm to dynamically adjust the weighted combination of new sample sequences and historical ones to solve the imbalance problem. Secondly, the Learning with Local and Global Consistency algorithm is used to iteratively compute similarity scores for the unlabeled samples in the mixed samples to obtain pseudo-labels. Lastly, the Multilayer Perceptron is applied for malware classification. To validate the effectiveness of the model, this paper conducts experiments on the CICMalDroid2020 dataset. The experimental results show that the proposed model performs better than existing deep learning detection models. The F1 score has an average improvement of 1.27% compared to other models when conducting binary classification. And, after inputting hybrid samples, including historical data and new data, four times, the F1 score is still 1.96% higher than other models. [ABSTRACT FROM AUTHOR]

Many security detectors do not have the ability to output individual luggage package images and are not compatible with deep learning algorithms. In this paper, a luggage package extraction of X-ray images based on the ES-MBD (Edge Sensitive Multi-channel Background Difference Algorithm) method is proposed, which is aiming at the problem that background difference binarization is insensitive to texture features and edge detection binarization is insensitive to smooth areas. In this method, X-ray luggage package images from complex original video images are used as a key target, the RGB three-channel background difference is calculated from the original X-ray image, the edge detection of the grayscale map is performed using the Sobel operator optimized by local gradient enhancement, and the morphological expansion process is performed on the combined results to obtain the complete wrapping target. The Suzuki algorithm is used to detect the outline of the binarized package image, match the package frame area and determine the key target. The ES-MBD method solves the problem of information loss in the traditional binarization method, and retains the information of insensitive regions while reducing noise. Through experimental comparison, the accuracy of ES-MBD binarization method reaches 97.3%, the recall rate reaches 96.5%, and ES-MBD method has obvious advantages in key target extraction of X-ray images. [ABSTRACT FROM AUTHOR]

This paper analyzes the typical technical problems arising from dumping and tamping collision interferences in the working faces of conventional mechanized solid backfilling mining (SBM). Additionally, the technical and consecutive characteristics of the solid intelligent backfilling (SIB) method, the execution device, and the corresponding process categories of the SIB process are analyzed. A design for an SIB process flow is presented. Critical algorithms, including automatic recognition and optimization planning based on the cost function and laying the algorithm foundation, are proposed to develop a backfilling process control system. A joint simulation test system is built on a MATLAB/Simulink simulation toolkit (MSST) to simulate and test the optimized algorithms. The results show that the optimized algorithm can realize the automatic optimization planning and automatic interference-recognition adjustment of the backfilling process under actual engineering conditions. In conclusion, this paper analyzes typical technical problems in the conventional backfilling process, designs the SIB process flow, and develops key algorithms to achieve the automatic control of the backfilling process. [ABSTRACT FROM AUTHOR]

Distributed time-varying formation technology for multi-agent systems is recently become a research hotspot in formation control field. However, the formation reconfiguration control technology for agents that randomly appeared to fail during maneuvers is rarely studied. In this paper, the topological relations between intelligence are designed by graph theory to simplify the cooperative interaction between multi-agent systems. Moreover, this paper constructs the time-varying configuration of the target formation based on the rigidity graph theory and leader–follower strategy. Drawing on the establishment of the expert experience database in a collaborative process, we innovatively propose the establishment of a graphic library to help the multi-agent system quickly form an affine transformation as soon as it is disabled. Secondly, the improved Hungarian algorithm is adopted to allocate the target point when the first failure occurs. This algorithm incorporates a gradient weighting factor from the auction algorithm to improve the speed of system reconfiguration with minimum path cost. On this basis, a distributed multi-agent control law based on consistency theory is established, and the system's stability can be guaranteed via Lyapunov functions. Finally, the simulation results demonstrate the feasibility and effectiveness of the proposed formation reconfiguration control algorithm in a collaborative environment. [ABSTRACT FROM AUTHOR]

Cloud computing is considered a key Internet technology. Cloud providers offer services through the Internet, such as infrastructure, platforms, and software. The scheduling process of cloud providers' tasks concerns allocating clients' tasks to providers' resources. Several mechanisms have been developed for task scheduling in cloud computing. Still, these mechanisms need to be optimized for execution time and makespan. This paper presents a new task-scheduling mechanism based on Discrete Prey–Predator to optimize the task-scheduling process in the cloud environment. The proposed Discrete Prey–Predator mechanism assigns each scheduling solution survival values. The proposed mechanism denotes the prey's maximum surviving value and the predator's minimum surviving value. The proposed Discrete Prey–Predator mechanism aims to minimize the execution time of tasks in cloud computing. This paper makes a significant contribution to the field of cloud task scheduling by introducing a new mechanism based on the Discrete Prey–Predator algorithm. The Discrete Prey–Predator mechanism presents distinct advantages, including optimized task execution, as the mechanism is purpose-built to optimize task execution times in cloud computing, improving overall system efficiency and resource utilization. Moreover, the proposed mechanism introduces a survival-value-based approach, as the mechanism introduces a unique approach for assigning survival values to scheduling solutions, differentiating between the prey's maximum surviving value and the predator's minimum surviving value. This improvement enhances decision-making precision in task allocation. To evaluate the proposed mechanism, simulations using the CloudSim simulator were conducted. The experiment phase considered different scenarios for testing the proposed mechanism in different states. The simulation results revealed that the proposed Discrete Prey–Predator mechanism has shorter execution times than the firefly algorithm. The average of the five execution times of the Discrete Prey–Predator mechanism was 270.97 s, while the average of the five execution times of the firefly algorithm was 315.10 s. [ABSTRACT FROM AUTHOR]

Featured Application: The aim is to distinguish maturity, reduce labor costs, and solve the occurrence of false or missed detections caused by strawberry leaf occlusion. In view of the time-consuming and laborious manual picking and sorting of strawberries, the direct impact of image recognition accuracy on automatic picking and the rapid development of deep learning(DL), a Faster Regions with Convolutional Neural Network features (R-CNN) strawberry recognition method that combines Mixup data augmentation, a ResNet(Residual Network)50 backbone feature extraction network and a Soft-NMS (Non-Maximum Suppression) algorithm, named the MRS Faster R-CNN, is proposed. In this paper, the transfer learning backbone feature extraction network VGG (Visual Geometry Group) 16 and ResNet50 are compared, and the superior ResNet50 is selected as the backbone network of MRS Faster R-CNN. The data augmentation method of Mixup image fusion is used to improve the learning and generalization ability of the model. The redundant bboxes (bounding boxes) are removed through Soft-NMS to obtain the best region proposal. The freezing phase is added to the training process, effectively reducing the occupation of video memory and shortening the training time. After experimental verification, the optimized model improved the AP (Average Precision) values of mature and immature strawberries by 0.26% and 5.34%, respectively, and the P(Precision) values by 0.81% and 6.34%, respectively, compared to the original model (R Faster R-CNN). Therefore, the MRS Faster R-CNN model proposed in this paper has great potential in the field of strawberry recognition and maturity classification and improves the recognition rate of small fruit and overlapping occluded fruit, thus providing an excellent solution for mechanized picking and sorting. [ABSTRACT FROM AUTHOR]

In complex two-dimensional monitoring environments, how to enhance network efficiency and network lifespan while utilizing limited energy resources, and ensuring that wireless sensor networks achieve the required partial coverage of the monitoring area, are the challenges of optimizing coverage in wireless sensor networks.With the premise of ensuring connectivity in the target network area, an enhanced multi-objective salp swarm algorithm based on non-dominated sorting (EMSSA) is proposed in this paper, by jointly optimizing network coverage, node utilization, and network energy balance objectives. Firstly, the logistic chaotic mapping is used to maintain the diversity of the initial salp swarm population. Secondly, to balance global and local search capabilities, a new dynamic convergence factor is introduced. Finally, to escape local optima more effectively, a follower updating strategy is implemented to reduce the blind following of followers while retaining superior individual information. The effectiveness of the strategy is validated through comparative experiments on ZDT and DTLZ test functions, and the proposed algorithm is applied to coverage optimization in WSNs in complex environments. The results demonstrate that the algorithm can adjust coverage thresholds according to different application requirements, providing various effective coverage optimization configurations. With the same preset requirements for partial coverage achieved, both network efficiency and lifespan have been significantly improved. [ABSTRACT FROM AUTHOR]