Search

At present, any industry that wanted to be considered a vanguard must be willing to improve itself, developing innovative techniques to generate a competitive advantage against its direct competitors. Hence, many methods are employed to optimize production processes, such as Lot Streaming, which consists of partitioning the productive lots into overlapping small batches to reduce the overall operating times known as Makespan, reducing the delivery time to the final customer. This work proposes carrying out a systematic review following the PRISMA methodology to the existing literature in indexed databases that demonstrates the application of Lot Streaming in the different production systems, giving the scientific community a strong consultation tool, useful to validate the different important elements in the definition of the Makespan reduction objectives and their applicability in the industry. Two hundred papers were identified on the subject of this study. After applying a group of eligibility criteria, 63 articles were analyzed, concluding that Lot Streaming can be applied in different types of industrial processes, always keeping the main objective of reducing Makespan, becoming an excellent improvement tool, thanks to the use of different optimization algorithms, attached to the reality of each industry. [ABSTRACT FROM AUTHOR]

As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the complexity of frequent subgraph mining and proposes a frequent subgraph mining (FSM) algorithm. This FSM algorithm is developed within a distributed graph iterative system, designed for the Big Cloud (BC) environment of the China Mobile Corp., and is based on the bulk synchronous parallel (BSP) model, named FSM-BC-BSP. Its aim is to address the challenge of mining frequent subgraphs within a single, large graph. This study advocates for the incorporation of a message sending and receiving mechanism to facilitate data sharing across various stages of the frequent subgraph mining algorithm. Additionally, it suggests employing a standard coded subgraph and sending it to the same node for global support calculation on the large graph. The adoption of the rightmost path expansion strategy in generating candidate subgraphs helps to mitigate the occurrence of redundant subgraphs. The use of standard coding ensures the unique identification of subgraphs, thus eliminating the need for isomorphism calculations. Support calculation is executed using the Minimum Image (MNI) measurement method, aligning with the downward closure attribute. The experimental results demonstrate the robust performance of the FSM-BC-BSP algorithm across diverse input datasets and parameter configurations. Notably, the algorithm exhibits exceptional efficacy, particularly in scenarios with low support requirements, showcasing its superior performance under such conditions. [ABSTRACT FROM AUTHOR]

The purpose of the paper is to propose a new implementation of the PID (proportional–integral–derivative) algorithm in digital hardware. The proposed structure is optimized for cost. It follows a serialized, rather than parallel, scheme. It uses only one arithmetic block, performing the multiply-and-add operation. The calculations are carried out in a sequentially cyclic manner. The proposed circuit operates on standard single-precision (32-bit) floating-point numbers. It implements an extended PID formula, containing a non-ideal derivative component, and weighting coefficients, which enable reducing the influence of setpoint changes in the proportional and derivative components. The circuit was implemented in a Cyclone V FPGA (Field-Programmable Gate Array) device from Intel, Santa Clara, CA, USA. The proper operation of the circuit was verified in a simulation. For the specific implementation, which is reported in the paper, the sampling period of 516 ns was obtained, which means that the proposed solution is comparable in terms of speed with other hardware implementations of the PID algorithm operating on single-precision floating-point numbers. However, the presented solution is much more efficient in terms of cost. It uses 1173 LUT (Look-up Table) blocks, 1026 registers, and 1 DSP (Digital Signal Processing) block, i.e., about 30% of logic resources required by comparable solutions. [ABSTRACT FROM AUTHOR]

In recent years, microservices, as an emerging technology in software development, have been favored by developers due to their lightweight and low-coupling features, and have been rapidly applied to the Internet of Things (IoT) and Internet of Vehicles (IoV), etc. Microservices deployed in each unit of the IoV use wireless links to transmit data, which exposes a larger attack surface, and it is precisely because of these features that the secure and efficient placement of microservices in the environment poses a serious challenge. Improving the security of all nodes in an IoV can significantly increase the service provider's operational costs and can create security resource redundancy issues. As the application of reinforcement learning matures, it is enabling faster convergence of algorithms by designing agents, and it performs well in large-scale data environments. Inspired by this, this paper firstly models the placement network and placement behavior abstractly and sets security constraints. The environment information is fully extracted, and an asynchronous reinforcement-learning-based algorithm is designed to improve the effect of microservice placement and reduce the security redundancy based on ensuring the security requirements of microservices. The experimental results show that the algorithm proposed in this paper has good results in terms of the fit of the security index with user requirements and request acceptance rate. [ABSTRACT FROM AUTHOR]

To ensure the long-term stable and uninterrupted service of satellite navigation systems, the robustness and reliability of time–frequency systems are crucial. Integrity monitoring is an effective method to enhance the robustness and reliability of time–frequency systems. Time–frequency signals are fundamental for integrity monitoring, with their time differences and frequency biases serving as essential indicators. These indicators are influenced by the inherent characteristics of the time–frequency signals, as well as the links and equipment they traverse. Meanwhile, existing research primarily focuses on only monitoring the integrity of the time–frequency signals' output by the atomic clock group, neglecting the integrity monitoring of the time–frequency signals generated and distributed by the time–frequency signal generation and distribution subsystem. This paper introduces a time–frequency signal integrity monitoring algorithm based on the temperature compensation frequency bias combination model. By analyzing the characteristics of time difference measurements, constructing the temperature compensation frequency bias combination model, and extracting and monitoring noise and frequency bias features from the time difference measurements, the algorithm achieves comprehensive time–frequency signal integrity monitoring. Experimental results demonstrate that the algorithm can effectively detect, identify, and alert users to time–frequency signal faults. Additionally, the model and the integrity monitoring parameters developed in this paper exhibit high adaptability, making them directly applicable to the integrity monitoring of time–frequency signals across various links. Compared with traditional monitoring algorithms, the algorithm proposed in this paper greatly improves the effectiveness, adaptability, and real-time performance of time–frequency signal integrity monitoring. [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]

With the advancement of network technology, multimedia videos have emerged as a crucial channel for individuals to access external information, owing to their realistic and intuitive effects. In the presence of high frame rate and high dynamic range videos, the coding efficiency of high-efficiency video coding (HEVC) falls short of meeting the storage and transmission demands of the video content. Therefore, versatile video coding (VVC) introduces a nested quadtree plus multi-type tree (QTMT) segmentation structure based on the HEVC standard, while also expanding the intra-prediction modes from 35 to 67. While the new technology introduced by VVC has enhanced compression performance, it concurrently introduces a higher level of computational complexity. To enhance coding efficiency and diminish computational complexity, this paper explores two key aspects: coding unit (CU) partition decision-making and intra-frame mode selection. Firstly, to address the flexible partitioning structure of QTMT, we propose a decision-tree-based series partitioning decision algorithm for partitioning decisions. Through concatenating the quadtree (QT) partition division decision with the multi-type tree (MT) division decision, a strategy is implemented to determine whether to skip the MT division decision based on texture characteristics. If the MT partition decision is used, four decision tree classifiers are used to judge different partition types. Secondly, for intra-frame mode selection, this paper proposes an ensemble-learning-based algorithm for mode prediction termination. Through the reordering of complete candidate modes and the assessment of prediction accuracy, the termination of redundant candidate modes is accomplished. Experimental results show that compared with the VVC test model (VTM), the algorithm proposed in this paper achieves an average time saving of 54.74%, while the BDBR only increases by 1.61%. [ABSTRACT FROM AUTHOR]

In this paper, a method based on an improved intelligent bat algorithm (IIBA) in cooperation with a voltage and current sensor was applied in maximum power point tracking (MPPT) for a photovoltaic module array (PVMA), where the power generation performance of a PVMA was enhanced. Due to the partial shading of the PVMA from climate changes or the surrounding environment, multiple peak values were generated on the power–voltage (P-V) curve, where the conventional MPPT technology could only track the local maximum power point (LMPP), hence the reduction in output power of PVMAs. Therefore, the IIBA-based MPPT was proposed in this paper to solve such issues and to ensure the capability of a PVMA in tracking the global maximum power point (GMPP) and utilization for enhancing the output power of a PVMA. Firstly, the Matlab/Simulink software was used to establish a boost converter model that simulated the actual 4-series–3-parallel PVMA under different shaded conditions, where the P-V curve with 1-peak, 2-peak, 3-peak and 4-peak values were generated. Subsequently, the tracking paces of the conventional bat algorithm (BA) were adjusted according to the gradient of the P-V curve for a PVMA. At the same time, 0.8 times the maximum power point (MPP) voltage Vmp under standard test conditions (STCs) for a PVMA was set as the initial tracking voltage. Lastly, the simulation results proved that under different environmental impacts, the proposed IIBA led to better performances in tracking both dynamic and steady responses. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is the underlying technology that has enabled connecting daily apparatus to the Internet and enjoying the facilities of smart services. IoT marketing is experiencing an impressive 16.7% growth rate and is a nearly USD 300.3 billion market. These eye-catching figures have made it an attractive playground for cybercriminals. IoT devices are built using resource-constrained architecture to offer compact sizes and competitive prices. As a result, integrating sophisticated cybersecurity features is beyond the scope of the computational capabilities of IoT. All of these have contributed to a surge in IoT intrusion. This paper presents an LSTM-based Intrusion Detection System (IDS) with a Dynamic Access Control (DAC) algorithm that not only detects but also defends against intrusion. This novel approach has achieved an impressive 97.16% validation accuracy. Unlike most of the IDSs, the model of the proposed IDS has been selected and optimized through mathematical analysis. Additionally, it boasts the ability to identify a wider range of threats (14 to be exact) compared to other IDS solutions, translating to enhanced security. Furthermore, it has been fine-tuned to strike a balance between accurately flagging threats and minimizing false alarms. Its impressive performance metrics (precision, recall, and F1 score all hovering around 97%) showcase the potential of this innovative IDS to elevate IoT security. The proposed IDS boasts an impressive detection rate, exceeding 98%. This high accuracy instills confidence in its reliability. Furthermore, its lightning-fast response time, averaging under 1.2 s, positions it among the fastest intrusion detection systems available. [ABSTRACT FROM AUTHOR]

The National Forestland "One Map" applies the boundaries and attributes of sub-elements to mountain plots by means of spatial data to achieve digital management of forest resources. The change detection and analysis of forest space and property is the key to determining the change characteristics, evolution trend and management effectiveness of forest land. The existing spatial overlay method, rasterization method, object matching method, etc., cannot meet the requirements of high efficiency and high precision at the same time. In this paper, we investigate a fast algorithm for the detection of changes in "One Map", taking Sichuan Province as an example. The key spatial characteristic extraction method is used to uniquely determine the sub-compartments. We construct an unbalanced quadtree based on the number of maximum leaf node elements (NLNE Quad-Tree) to narrow down the query range of the target sub-compartments and quickly locate the sub-compartments. Based on NLNE Quad-Tree, we establish a change detection model for "One Map" (NQT-FCDM). The results show that the spatial feature combination of barycentric coordinates and area can ensure the spatial uniqueness of 44.45 million sub-compartments in Sichuan Province with 1 m~0.000001 m precision. The NQT-FCDM constructed with 1000–6000 as the maximum number of leaf nodes has the best retrieval efficiency in the range of 100,000–500,000 sub-compartments. The NQT-FCDM shortens the time by about 75% compared with the traditional spatial union analysis method, shortens the time by about 50% compared with the normal quadtree and effectively solves the problem of generating a large amount of intermediate data in the spatial union analysis method. The NQT-FCDM proposed in this paper improves the efficiency of change detection in "One Map" and can be generalized to other industries applying geographic information systems to carry out change detection, providing a basis for the detection of changes in vector spatial data. [ABSTRACT FROM AUTHOR]

Recently, a signal sorting algorithm based on the congruence transform has been proposed, which is effective in dealing with the staggered Pulse Repetition Interval (PRI) signals. It can effectively sort the staggered PRI signals and obtain the sub-PRI sequence directly without sub-PRI ranking, and it is less affected by interfered pulses and pulse loss. Nevertheless, we find that the algorithm causes pseudo-peaks in the remainder histogram when sorting signals such as sliding PRI, sinusoidal PRI, etc. (collectively referred to as periodic PRI signal in this paper) and pseudo-peaks will cause errors in signal sorting. To solve the issue of pseudo-peaks when sorting periodic PRI signals, an improved sorting algorithm based on congruence transform is proposed. According to the analysis of the congruence characteristics of the periodic PRI signal, a novel method is proposed to identify pseudo-peaks based on the histogram peak amplitude and symmetric difference set. The signal sorting algorithm based on congruence transform is improved to achieve a good sorting effect on periodic PRI signals. Simulation experiments demonstrate that the novel algorithm can effectively sort periodic PRI signals and improve Precall, Pd, and Pf by 6.9%, 5.1%, and 3.2%, respectively, compared to the typical similar algorithms. [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]

Oncology has emerged as a crucial field of study in the domain of medicine. Computed tomography has gained widespread adoption as a radiological modality for the identification and characterisation of pathologies, particularly in oncology, enabling precise identification of affected organs and tissues. However, achieving accurate liver segmentation in computed tomography scans remains a challenge due to the presence of artefacts and the varying densities of soft tissues and adjacent organs. This paper compares artificial intelligence algorithms and traditional medical image processing techniques to assist radiologists in liver segmentation in computed tomography scans and evaluates their accuracy and efficiency. Despite notable progress in the field, the limited availability of public datasets remains a significant barrier to broad participation in research studies and replication of methodologies. Future directions should focus on increasing the accessibility of public datasets, establishing standardised evaluation metrics, and advancing the development of three-dimensional segmentation techniques. In addition, maintaining a collaborative relationship between technological advances and medical expertise is essential to ensure that these innovations not only achieve technical accuracy, but also remain aligned with clinical needs and realities. This synergy ensures their applicability and effectiveness in real-world healthcare environments. [ABSTRACT FROM AUTHOR]

Machine learning (ML) has become increasingly prevalent in various domains. However, ML algorithms sometimes give unfair outcomes and discrimination against certain groups. Thereby, bias occurs when our results produce a decision that is systematically incorrect. At various phases of the ML pipeline, such as data collection, pre-processing, model selection, and evaluation, these biases appear. Bias reduction methods for ML have been suggested using a variety of techniques. By changing the data or the model itself, adding more fairness constraints, or both, these methods try to lessen bias. The best technique relies on the particular context and application because each technique has advantages and disadvantages. Therefore, in this paper, we present a comprehensive survey of bias mitigation techniques in machine learning (ML) with a focus on in-depth exploration of methods, including adversarial training. We examine the diverse types of bias that can afflict ML systems, elucidate current research trends, and address future challenges. Our discussion encompasses a detailed analysis of pre-processing, in-processing, and post-processing methods, including their respective pros and cons. Moreover, we go beyond qualitative assessments by quantifying the strategies for bias reduction and providing empirical evidence and performance metrics. This paper serves as an invaluable resource for researchers, practitioners, and policymakers seeking to navigate the intricate landscape of bias in ML, offering both a profound understanding of the issue and actionable insights for responsible and effective bias mitigation. [ABSTRACT FROM AUTHOR]

In recent years, laser technology has made significant advancements, yet there are specific requirements for the energy concentration and uniformity of lasers in various fields, such as optical communication, laser processing, 3D printing, etc. Beam shaping technology enables the transformation of ordinary Gaussian-distributed laser beams into square or circular flat-top uniform beams. Currently, LCOS-based beam shaping algorithms do not adequately meet these requirements, and most of these algorithms do not simultaneously consider the impact of phase quantization and zero-padding, leading to a decrease in the practicality of phase holograms. To address these issues, this paper proposes a novel segmented beam shaping algorithm that combines iterative and simulated annealing approaches. This paper validated the reliability of the proposed algorithm through numerical simulations. Compared to other algorithms, the proposed algorithm can effectively reduce the root mean square error by an average of nearly 37% and decrease the uniformity error by almost 39% without a significant decrease in diffraction efficiency. [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]

Artificial intelligence (AI) algorithms are playing a crucial role in transforming healthcare by enhancing the quality, accessibility, and efficiency of medical care, research, and operations. These algorithms enable healthcare providers to offer more accurate diagnoses, predict outcomes, and customize treatments to individual patient needs. AI also improves operational efficiency by automating routine tasks and optimizing resource management. However, there are challenges to adopting AI in healthcare, such as data privacy concerns and potential biases in algorithms. Collaboration among stakeholders is necessary to ensure ethical use of AI and its positive impact on the field. AI also has applications in medical research, preventive medicine, and public health. It is important to recognize that AI should augment, not replace, the expertise and compassionate care provided by healthcare professionals. The ethical implications and societal impact of AI in healthcare must be carefully considered, guided by fairness, transparency, and accountability principles. Several research papers in this special issue explore the application of AI algorithms in various aspects of healthcare, such as gait analysis for Parkinson's disease diagnosis, human activity recognition, heart disease prediction, compliance assessment with clinical protocols, epidemic management, neurological complications identification, fall prevention, leukemia diagnosis, and genetic clinical pathways. These studies demonstrate the potential of AI in improving medical diagnostics, patient monitoring, and personalized care. [Extracted from the article]

In order to cope with the problems of energy shortage and environmental pollution, carbon emissions need to be reduced and so the structure of the power grid is constantly being optimized. Traditional centralized power networks are not as capable of controlling and distributing non-renewable energy as distributed power grids. Therefore, the optimal dispatch of microgrids faces increasing challenges. This paper proposes a multi-strategy fusion slime mould algorithm (MFSMA) to tackle the microgrid optimal dispatching problem. Traditional swarm intelligence algorithms suffer from slow convergence, low efficiency, and the risk of falling into local optima. The MFSMA employs reverse learning to enlarge the search space and avoid local optima to overcome these challenges. Furthermore, adaptive parameters ensure a thorough search during the algorithm iterations. The focus is on exploring the solution space in the early stages of the algorithm, while convergence is accelerated during the later stages to ensure efficiency and accuracy. The salp swarm algorithm's search mode is also incorporated to expedite convergence. MFSMA and other algorithms are compared on the benchmark functions, and the test showed that the effect of MFSMA is better. Simulation results demonstrate the superior performance of the MFSMA for function optimization, particularly in solving the 24 h microgrid optimal scheduling problem. This problem considers multiple energy sources such as wind turbines, photovoltaics, and energy storage. A microgrid model based on the MFSMA is established in this paper. Simulation of the proposed algorithm reveals its ability to enhance energy utilization efficiency, reduce total network costs, and minimize environmental pollution. The contributions of this paper are as follows: (1) A comprehensive microgrid dispatch model is proposed. (2) Environmental costs, operation and maintenance costs are taken into consideration. (3) Two modes of grid-tied operation and island operation are considered. (4) This paper uses a multi-strategy optimized slime mould algorithm to optimize scheduling, and the algorithm has excellent results. [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]

Underwater acoustic channels often have to face the interference of impulsive noise, which is usually modeled by α-stable distribution in simulation experiments. To solve the problem of underwater acoustic channel estimation under impulsive noise, this paper proposes a convex combination–variable-step-size least mean p-norm algorithm. The algorithm incorporates a convex combination into the variable-step-size least mean p-norm algorithm and uses the convex combination of different convergence domains provided by changing the parameters of the Gaussian function to further improve the effect after convergence. The simulation results of channel estimation show that the convex combination–variable-step-size least mean p-norm algorithm provides a more stable, robust, and universal solution than the variable-step-size least mean p-norm algorithm. [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]

Truck hoisting detection constitutes a key focus in port security, for which no optimal resolution has been identified. To address the issues of high costs, susceptibility to weather conditions, and low accuracy in conventional methods for truck hoisting detection, a non-intrusive detection approach is proposed in this paper. The proposed approach utilizes a mathematical model and an extreme gradient boosting (XGBoost) model. Electrical signals, including voltage and current, collected by Hall sensors are processed by the mathematical model, which augments their physical information. Subsequently, the dataset filtered by the mathematical model is used to train the XGBoost model, enabling the XGBoost model to effectively identify abnormal hoists. Improvements were observed in the performance of the XGBoost model as utilized in this paper. Finally, experiments were conducted at several stations. The overall false positive rate did not exceed 0.7% and no false negatives occurred in the experiments. The experimental results demonstrated the excellent performance of the proposed approach, which can reduce the costs and improve the accuracy of detection in container hoisting. [ABSTRACT FROM AUTHOR]

The zero-velocity update (ZUPT) algorithm is a pivotal advancement in pedestrian navigation accuracy, utilizing foot-mounted inertial sensors. Its key issue hinges on accurately identifying periods of zero-velocity during human movement. This paper introduces an innovative adaptive sliding window technique, leveraging the Fourier Transform to precisely isolate the pedestrian's gait frequency from spectral data. Building on this, the algorithm adaptively adjusts the zero-velocity detection threshold in accordance with the identified gait frequency. This adaptation significantly refines the accuracy in detecting zero-velocity intervals. Experimental evaluations reveal that this method outperforms traditional fixed-threshold approaches by enhancing precision and minimizing false positives. Experiments on single-step estimation show the adaptability of the algorithm to motion states such as slow, fast, and running. Additionally, the paper demonstrates pedestrian trajectory localization experiments under a variety of walking conditions. These tests confirm that the proposed method substantially improves the performance of the ZUPT algorithm, highlighting its potential for pedestrian navigation systems. [ABSTRACT FROM AUTHOR]

In order to solve the problem of the dynamic positioning control of large ships in rough sea and to meet the need for fixed-point operations, this paper proposes a dynamic positioning controller that can effectively achieve large ships' fixed-point control during Level 9 sea states (wind force Beaufort No. 10). To achieve a better control effect, a large ship's forward motion is decoupled to establish a mathematical model of the headwind stationary state. Meanwhile, the closed-loop gain shaping algorithm is combined with the exact feedback linearization algorithm to design the speed controller and the course-keeping controller. This effectively solves the problem of strong external interferences impacting the control system in rough seas and guarantees the comprehensive index of robustness performance. In this paper, three large ships—the "Mariner", "Taian kou", and "Galaxy"—are selected as the research objects for simulation research and the final fixing error is less than 10 m. It is proven that the method is safe, feasible, practical, and effective, and provides technical support for the design and development of intelligent marine equipment for use in rough seas. [ABSTRACT FROM AUTHOR]

This paper focuses on both voltage transients and short-duration RMS variations, and presents a unique and heterogeneous approach to their assessment by applying AI tools. The database consists of both real (obtained from Lithuanian PQ monitoring campaigns) and synthetic data (obtained from the simulation and literature review). Firstly, this paper investigates the fundamental grid component and its harmonics filtering with an IIR shelving filter. Secondly, in a key part, both SVM and KNN are used to classify PQ events by their primary cause in the voltage–duration plane as well as by the type of short circuit in the three-dimensional voltage space. Thirdly, since it seemed to be difficult to interpret the results in the three-dimensional space, the new method, based on Clarke transformation, is developed to convert it to two-dimensional space. The method shows an outstanding performance by avoiding the loss of important information. In addition, a geometric analysis of the fault voltage in both two-dimensional and three-dimensional spaces revealed certain geometric patterns that are undoubtedly important for PQ classification. Finally, based on the results of a PQ monitoring campaign in the Lithuanian distribution grid, this paper presents a unique discussion regarding PQ assessment gaps that need to be solved in anticipation of a great leap forward and refers them to PQ legislation. [ABSTRACT FROM AUTHOR]

Low-Level Virtual Machine (LLVM) compiler infrastructure is a useful tool for building just-in-time (JIT) compilers, besides its reliable front end represented by a clang compiler and its elaborated middle end containing different optimizations that improve the runtime performance. This paper specifically addresses the part of building a JIT compiler using an LLVM with the scope of obtaining the hardware architecture details of the underlying machine such as the number of cores and the number of logical cores per processing unit and providing them to the NUMA-BTLP static thread classification algorithm and to the NUMA-BTDM static thread mapping algorithm. Afterwards, the hardware-aware algorithms are run using the JIT compiler within an optimization pass. The JIT compiler in this paper is designed to run on a parallel C/C++ application (which creates threads using Pthreads), before the first time the application is executed on a machine. To achieve this, the JIT compiler takes the native code of the application, obtains the corresponding LLVM IR (Intermediate Representation) for the native code and executes the hardware-aware thread classification and the thread mapping algorithms on the IR. The NUMA-Balanced Task and Loop Parallelism (NUMA-BTLP) and NUMA-Balanced Thread and Data Mapping (NUMA-BTDM) are expected to optimize the energy consumption by up to 15% on the NUMA systems. [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]

Noncontact heart rate monitoring techniques based on millimeter-wave radar have advantages in unique medical scenarios. However, the accuracy of the existing noncontact heart rate estimation methods is still limited by interference, such as DC offsets, respiratory harmonics, and environmental noise. Additionally, these methods still require longer observation times. Most deep learning methods related to heart rate estimation still need to collect more heart rate marker data for training. To address the above problems, this paper introduces a radar signal-based heart rate estimation network named the "masked phase autoencoders with a vision transformer network" (MVN). This network is grounded on masked autoencoders (MAEs) for self-supervised pretraining and a vision transformer (ViT) for transfer learning. During the phase preprocessing stage, phase differencing and interpolation smoothing are performed on the input phase signal. In the self-supervised pretraining step, masked self-supervised training is performed on the phase signal using the MAE network. In the transfer learning stage, the encoder segment of the MAE network is integrated with the ViT network to enable transfer learning using labeled heart rate data. The innovative MVN offers a dual advantage—it not only reduces the cost associated with heart rate data acquisition but also adeptly addresses the issue of respiratory harmonic interference, which is an improvement over conventional signal processing methods. The experimental results show that the process in this paper improves the accuracy of heart rate estimation while reducing the requisite observation time. [ABSTRACT FROM AUTHOR]

Driverless technology refers to the technology that vehicles use to drive independently with the help of driverless system under the condition of unmanned intervention. The working environment of construction machinery is bad, and the working conditions are complex. The use of driverless technology can greatly reduce the risk of driver operation, reduce labor costs and improve economic benefits.Aiming at the problem of the GPS positioning signal in the working environment of construction machinery being weak and not able to achieve accurate positioning, this paper uses the fusion SLAM algorithm based on improved NDT to realize the real-time positioning of the whole vehicle through reconstruction of the scene. Considering that the motion characteristics of crawler construction machinery are different from those of ordinary passenger cars, this paper improves the existing pure pursuit algorithm. Simulations and real vehicle tests show that the algorithm combined with the fusion SLAM algorithm can realize the motion control of driverless crawler construction machinery well, complete the tracking of the set trajectory perfectly and have high robustness. Considering that there is no mature walking method of driverless crawler construction machinery for reference, the research of this paper will lay a foundation for the development of driverless crawler construction machinery. [ABSTRACT FROM AUTHOR]

This paper proposes a road crack detection algorithm based on an improved SparseInst network, called the SparseInst-CDSM algorithm, aimed at solving the problems of low recognition accuracy and poor real-time detection of existing algorithms. The algorithm introduces the CBAM module, DCNv2 convolution, SPM strip pooling module, MPM mixed pooling module, etc., effectively improving the integrity and accuracy of crack recognition. At the same time, the central axis skeleton of the crack is extracted using the central axis method, and the length and maximum width of the crack are calculated. In the experimental comparison under the self-built crack dataset, SparseInst-CDSM has an accuracy of 93.66%, a precision of 67.35%, a recall of 66.72%, and an IoU of 84.74%, all higher than mainstream segmentation models such as Mask-RCNN and SOLO that were compared, reflecting the superiority of the algorithm proposed in this paper. The comparison results of actual measurements show that the algorithm error is within 10%, indicating that it has high effectiveness and practicality. [ABSTRACT FROM AUTHOR]

In the model (m:n), to improve the autonomous collaborative interception capability for air vehicle, a new autonomous cross-collaborative interception algorithm based on GTSMC (Global Terminal Sliding Mode Control) and real-time virtual geometry is proposed in this paper. Firstly, the conception of an autonomous cross-collaboration is defined and the multi-air vehicle for the multi- object interception problem is formulated. Then, this paper presents the dynamic situation assessment function, which considers the real-time flight status and cooperative status of the air vehicle during the interception of the object. At the same time, this paper states the condition of whether the air vehicle is in a cooperative state and proves it. After completing the dynamic situation assessment, and considering the dynamic of the air vehicles, a new controller is designed by using GTSMC and the idea of backstepping method. Simultaneously, this paper gives a stability analysis of the closed-loop system by using Lyapunov theory. Finally, to demonstrate the effectiveness of the proposed algorithm, several simulation cases which consider different interception scenarios are given. The simulation results show that the new collaborative interception algorithm can provide better autonomous cross-collaborative interception capability and higher accuracy. [ABSTRACT FROM AUTHOR]

The deep model is widely used and has been demonstrated to have more hidden security risks. An adversarial attack can bypass the traditional means of defense. By modifying the input data, the attack on the deep model is realized, and it is imperceptible to humans. The existing adversarial example generation methods mainly attack the whole image. The optimization iterative direction is easy to predict, and the attack flexibility is low. For more complex scenarios, this paper proposes an edge-restricted adversarial example generation algorithm (Re-AEG) based on semantic segmentation. The algorithm can attack one or more specific objects in the image so that the detector cannot detect the objects. First, the algorithm automatically locates the attack objects according to the application requirements. Through the semantic segmentation algorithm, the attacked object is separated and the mask matrix for the object is generated. The algorithm proposed in this paper can attack the object in the region, converge quickly and successfully deceive the deep detection model. The algorithm only hides some sensitive objects in the image, rather than completely invalidating the detection model and causing reported errors, so it has higher concealment than the previous adversarial example generation algorithms. In this paper, a comparative experiment is carried out on ImageNet and coco2017 datasets, and the attack success rate is higher than 92%. [ABSTRACT FROM AUTHOR]

At present, PPF-based point cloud recognition algorithms can perform better matching than competitors and be verified in the case of severe occlusion and stacking. However, including certain superfluous feature point pairs in the global model description would significantly lower the algorithm's efficiency. As a result, this paper delves into the Point Pair Feature (PPF) algorithm and proposes a 6D pose estimation method based on Keypoint Pair Feature (K-PPF) voting. The K-PPF algorithm is based on the PPF algorithm and proposes an improved algorithm for the sampling point part. The sample points are retrieved using a combination of curvature-adaptive and grid ISS, and the angle-adaptive judgment is performed on the sampling points to extract the keypoints, therefore improving the point pair feature difference and matching accuracy. To verify the effectiveness of the method, we analyze the experimental results in scenes with different occlusion and complexity levels under the evaluation metrics of ADD-S, Recall, Precision, and Overlap rate. The results show that the algorithm in this paper reduces redundant point pairs and improves recognition efficiency and robustness compared with PPF. Compared with FPFH, CSHOT, SHOT and SI algorithms, this paper improves the recall rate by more than 12.5%. [ABSTRACT FROM AUTHOR]

There are six possible solutions for the surface normal vectors obtained from polarization information during 3D reconstruction. To resolve the ambiguity of surface normal vectors, scholars have introduced additional information, such as shading information. However, this makes the 3D reconstruction task too burdensome. Therefore, in order to make the 3D reconstruction more generally applicable, this paper proposes a complete framework to reconstruct the surface of an object using only polarized images. To solve the ambiguity problem of surface normal vectors, a jump-compensated U-shaped generative adversarial network (RU-Gan) based on jump compensation is designed for fusing six surface normal vectors. Among them, jump compensation is proposed in the encoder and decoder parts, and the content loss function is reconstructed, among other approaches. For the problem that the reflective region of the original image will cause the estimated normal vector to deviate from the true normal vector, a specular reflection model is proposed to optimize the dataset, thus reducing the reflective region. Experiments show that the estimated normal vector obtained in this paper improves the accuracy by about 20° compared with the previous conventional work, and improves the accuracy by about 1.5° compared with the recent neural network model, which means the neural network model proposed in this paper is more suitable for the normal vector estimation task. Furthermore, the object surface reconstruction framework proposed in this paper has the characteristics of simple implementation conditions and high accuracy of reconstructed texture. [ABSTRACT FROM AUTHOR]

Aiming at the problems of the difficult extraction of small target feature information, complex background, and variable target scale in unmanned aerial vehicle (UAV) aerial photography images. In this paper, an anchor-free target detection algorithm based on fully convolutional one-stage object detection (FCOS) for UAV aerial photography images is proposed. For the problem of complex backgrounds, the global context module is introduced in the ResNet50 network, which is combined with feature pyramid networks (FPN) as the backbone feature extraction network to enhance the feature representation of targets in complex backgrounds. To address the problem of the difficult detection of small targets, an adaptive feature balancing sub-network is designed to filter the invalid information generated at all levels of feature fusion, strengthen multi-layer features, and improve the recognition capability of the model for small targets. To address the problem of variable target scales, complete intersection over union (CIOU) Loss is used to optimize the regression loss and strengthen the model's ability to locate multi-scale targets. The algorithm of this paper is compared quantitatively and qualitatively on the VisDrone dataset. The experiments show that the proposed algorithm improves 4.96% on average precision (AP) compared with the baseline algorithm FCOS, and the detection speed is 35 frames per second (FPS), confirming that the algorithm has satisfactory detection performance, real-time inference speed, and has effectively improved the problem of missed detection and false detection of targets in UAV aerial images. [ABSTRACT FROM AUTHOR]

Polynomial multiplication is the most computationally expensive part of the lattice-based cryptography algorithm. However, the existing acceleration schemes have problems, such as low performance and high hardware resource overhead. Based on the polynomial multiplication of number theoretic transformation (NTT), this paper proposed a simple element of Montgomery module reduction with pipeline structure to realize fast module multiplication. In order to improve the throughput of the NTT module, the block storage technology is used in the NTT hardware module to enable the computing unit to read and write data alternately. Based on the NTT hardware module, a precalculated parameter storage and real-time calculation method suitable for the hardware architecture of this paper is also proposed. Finally, the hardware of polynomial multiplier based on NTT module is implemented, and its function simulation and performance evaluation are carried out. The results show that the proposed hardware accelerator can have excellent computing performance while using fewer hardware resources, thus meeting the requirements of lattice cipher algorithms in security chips. Compared with the existing studies, the computing performance of the polynomial multiplier designed in this paper is improved by approximately 1 to 3 times, and the slice resources and storage resources used are reduced by approximately 60% and 17%, respectively. [ABSTRACT FROM AUTHOR]

The performance of underwater target detection algorithms is affected by poor imaging quality in underwater environments. Due to the arithmetic power limitation of underwater devices, existing deep learning networks are unable to provide efficient detection processes with high detection accuracy. Lightweight CNN models have been actively applied for underwater environment detection, yet their lite feature fusion networks cannot provide effective fusion effects and reduce the detection accuracy. In this paper, a lightweight algorithm based on multi-scale feature fusion was proposed, with the model parameters greatly reduced, improving the target detection accuracy. The forward propagation memory overhead is reduced by using multi-scale shared convolutional kernels and pooling operations to co-construct the query matrix in the Tansformer encoding stage. Then, the feature fusion path is optimized in order to enhance the connection of multi-scale features. A multiscale feature adaptive fusion strategy is used to enhance the detection performance and reduce the dependence on the complex feature extraction network. The feature extraction network is also reparameterized to simplify the operation. Using the UPRC offshore dataset for validation, the study results have demonstrated that the statistical mAP metrics validate the detection accuracy. Compared with SSD, RetinaNet and YOLOv5-s improved by 13%, 8.6%, and 0.8%, while the number of parameters decreased by 76.09%, 89.74%, and 87.67%. In addition, compared with the YOLOv5-lite model algorithm with the same parameter volume, the mAP is improved by 3.8%, which verifies the accuracy and efficiency of the algorithm in this paper. [ABSTRACT FROM AUTHOR]

Establishing a national comprehensive PNT (Positioning, Navigation, and Timing) system has become a consensus among major countries worldwide. As a crucial component in completing the entire PNT system, the 5G NR (new radio) time service signal plays a vital role. This paper proposes a 5G NR time service signal that uses a spread spectrum system, shares the 5G signal frequency band, but does not occupy the bandwidth of the 5G communication signal. This timing service signal has relatively low power, making it appear "submerged" within the power of the 5G communication signal. The spread spectrum code for this timing signal employs the chaotic orthogonal composite sequence proposed in this paper. Compared to traditional spread spectrum sequences, this sequence offers better security than m-sequences, improved autocorrelation than Walsh sequences, and an effective suppression of the short-period characteristics exhibited when the Skew Tent-Map chaotic sequence takes special values. This paper simulates the capture of the 5G NR time service signal in an environment with a signal-to-noise ratio of 10 dB using an FFT-based parallel code phase search algorithm, successfully capturing the 5G NR time service signal and verifying the feasibility of the proposed chaotic orthogonal composite sequence as a spread spectrum code. [ABSTRACT FROM AUTHOR]

The rapid development of wireless network technology has led to the coexistence of various heterogeneous wireless networks (HWNs). To ensure that users enjoy normal and diversified services, research on vertical switching technology has become an inevitable trend. However, most current vertical switching algorithms only consider static situations or single services, which are not suitable for power grid scenarios. This paper studies the vertical switching problem of wireless heterogeneous networks for unmanned aerial vehicles (UAVs) performing inspection tasks in power grid scenarios. In this model, a UAV for power grid inspection needs to plan its flight trajectory, avoid obstacles, and find the optimal trajectory to reach each inspection point. Throughout the UAV inspection process, we must ensure the quality of communication services for the UAV. The UAV dynamically selects different networks for access at different locations, presenting a dynamic network selection and vertical switching problem. This paper proposes a method that combines trajectory planning and network selection, which first utilizes the A-star algorithm to obtain suitable trajectories, and then evaluates and judges networks based on the Fuzzy Analytic Hierarchy Process (FAHP) to determine the most appropriate network. It is worth noting that this paper considers three service requirements and seven network attributes under three types of heterogeneous wireless networks. Numerical results show that this method can better meet the requirements of UAV inspection tasks and reduce the number of switches, thus addressing the issue of terminal vertical switches in power grid scenarios. [ABSTRACT FROM AUTHOR]

This paper proposes a fast satellite screening algorithm aimed at the problem of balancing between positioning accuracy and system computing efficiency in a multi-constellation system environment under the Global Navigation Satellite System (GNSS). The algorithm constructs an observation model based on a positioning error for the larger number of satellites under a multi-constellation. The space region is divided based on elevation and azimuth angles to implement the screening algorithm for the solution of the point to be determined. An analysis of the experimental data shows that the average GDOP value of this scheme is 1.835, and the position error of the point to be determined is controlled within 2.5 m when the cut-off altitude angle is 5° and the screening ratio is more than 70%. [ABSTRACT FROM AUTHOR]

This paper proposes a point-by-point weighted fusion algorithm based on an improved random sample consensus (RANSAC) and inverse distance weighting to address the issue of low-resolution point cloud data obtained from light detection and ranging (LiDAR) sensors and single technologies. By fusing low-resolution point clouds with higher-resolution point clouds at the data level, the algorithm generates high-resolution point clouds, achieving the super-resolution reconstruction of lidar point clouds. This method effectively reduces noise in the higher-resolution point clouds while preserving the structure of the low-resolution point clouds, ensuring that the semantic information of the generated high-resolution point clouds remains consistent with that of the low-resolution point clouds. Specifically, the algorithm constructs a K-d tree using the low-resolution point cloud to perform a nearest neighbor search, establishing the correspondence between the low-resolution and higher-resolution point clouds. Next, the improved RANSAC algorithm is employed for point cloud alignment, and inverse distance weighting is used for point-by-point weighted fusion, ultimately yielding the high-resolution point cloud. The experimental results demonstrate that the proposed point cloud super-resolution reconstruction method outperforms other methods across various metrics. Notably, it reduces the Chamfer Distance (CD) metric by 0.49 and 0.29 and improves the Precision metric by 7.75% and 4.47%, respectively, compared to two other methods. [ABSTRACT FROM AUTHOR]

Path planning and obstacle avoidance are fundamental problems in unmanned ground vehicle path planning. Aiming at the limitations of Deep Reinforcement Learning (DRL) algorithms in unmanned ground vehicle path planning, such as low sampling rate, insufficient exploration, and unstable training, this paper proposes an improved algorithm called Dual Priority Experience and Ornstein–Uhlenbeck Soft Actor-Critic (DPEOU-SAC) based on Ornstein–Uhlenbeck (OU noise) and double-factor prioritized sampling experience replay (DPE) with the introduction of expert experience, which is used to help the agent achieve faster and better path planning and obstacle avoidance. Firstly, OU noise enhances the agent's action selection quality through temporal correlation, thereby improving the agent's detection performance in complex unknown environments. Meanwhile, the experience replay is based on double-factor preferential sampling, which has better sample continuity and sample utilization. Then, the introduced expert experience can help the agent to find the optimal path with faster training speed and avoid falling into a local optimum, thus achieving stable training. Finally, the proposed DPEOU-SAC algorithm is tested against other deep reinforcement learning algorithms in four different simulation environments. The experimental results show that the convergence speed of DPEOU-SAC is 88.99% higher than the traditional SAC algorithm, and the shortest path length of DPEOU-SAC is 27.24, which is shorter than that of SAC. [ABSTRACT FROM AUTHOR]

The advancement of information technology has led to the widespread application of remote measurement systems, where information in the form of images or videos, serving as measurement results, is transmitted over networks. However, this transmission is highly susceptible to attacks, tampering, and disputes, posing significant risks to the trustworthy transmission of measurement results from instruments and devices. In recent years, many encryption algorithms proposed for images have focused on encrypting the entire image, resulting in resource waste. Additionally, most encryption algorithms are designed only for single-object-type images. Addressing these issues, this paper proposes a multi-object region encryption algorithm based on an adaptive mechanism. Firstly, an adaptive mechanism is employed to determine the strategy for adjusting the sampling rate of encryption objects, achieved through an encryption resource allocation algorithm. Secondly, an improved polygon segmentation algorithm is utilized to separate single-object regions from multi-object images, dynamically adjusting the sequence of encryption objects based on the adaptive mechanism. Finally, encryption is achieved using a chaos fusion XOR encryption algorithm. Experimental validation using instrument images demonstrates that the proposed algorithm offers high efficiency and security advantages compared to other mainstream image encryption algorithms. [ABSTRACT FROM AUTHOR]

It is difficult to visually detect internal defects in a large transformer with a metal closure. For convenient internal inspection, a micro-robot was adopted, and an inspection method based on an image-enhancement algorithm and an improved deep-learning network was proposed in this paper. Considering the dim environment inside the transformer and the problems of irregular imaging distance and fluctuating supplementary light conditions during image acquisition with the internal-inspection robot, an improved MSRCR algorithm for image enhancement was proposed. It could analyze the local contrast of the image and enhance the details on multiple scales. At the same time, a white-balance algorithm was introduced to enhance the contrast and brightness and solve the problems of overexposure and color distortion. To improve the target recognition performance of complex carbon-trace defects, the SimAM mechanism was incorporated into the Backbone network of the YOLOv8 model to enhance the extraction of carbon-trace features. Meanwhile, the DyHead dynamic detection Head framework was constructed at the output of the YOLOv8 model to improve the perception of local carbon traces with different sizes. To improve the defect target recognition speed of the transformer-inspection robot, a pruning operation was carried out on the YOLOv8 model to remove redundant parameters, realize model lightness, and improve detection efficiency. To verify the effectiveness of the improved algorithm, the detection model was trained and validated with the carbon-trace dataset. The results showed that the MSH-YOLOv8 algorithm achieved an accuracy of 91.80%, which was 3.4 percentage points higher compared to the original YOLOv8 algorithm, and had a significant advantage over other mainstream target-detection algorithms. Meanwhile, the FPS of the proposed algorithm was up to 99.2, indicating that the model computation and model complexity were successfully reduced, which meets the requirements for engineering applications of the transformer internal-inspection robot. [ABSTRACT FROM AUTHOR]

The traditional detection methods of steel surface defects have some problems, such as a lack of feature extraction ability, sluggish detection speed, and subpar detection performance. In this paper, a YOLOv8-based DDI-YOLO model is suggested for effective steel surface defect detection. First, on the Backbone network, the extended residual module (DWR) is fused with the C2f module to obtain C2f_DWR, and the two-step approach is used to carry out the effective extraction of multiscale contextual information, and then fusing feature maps formed from the multiscale receptive fields to enhance the capacity for feature extraction. Also based on the above, an extended heavy parameter module (DRB) is added to the structure of C2f_DWR to make up for the lack of C2f's ability to capture small-scale pattern defects between training to enhance the training fluency of the model. Finally, the Inner-IoU loss function is employed to enhance the regression accuracy and training speed of the model. The experimental results show that the detection of DDI-YOLO on the NEU-DET dataset improves the mAP by 2.4%, the accuracy by 3.3%, and the FPS by 59 frames/s compared with the original YOLOv8n.Therefore, this paper's proposed model has a superior mAP, accuracy, and FPS in identifying surface defects in steel. [ABSTRACT FROM AUTHOR]

Efficient and stable control and task assignment optimization in electronic commerce logistics and warehousing systems involving multiple robots executing multiple tasks is highly challenging. Hence, this paper proposes a Swiss round selection algorithm for multi-robot task allocation to address the challenges mentioned. Firstly, based on the shipping process of electronic commerce logistics and warehousing systems, the tasks are divided into packaging and sorting stages, and a grid model for the electronic commerce warehousing system is established. Secondly, by increasing the probabilities of crossover and mutation in the population and adopting a full crossover and full mutation approach, the search scope of the population is expanded. Then, a Swiss round selection mechanism with burst probability is proposed, which ensures the smooth inheritance of high-quality individuals while improving the diversity of the population. Finally, 12 comparative experiments are designed with different numbers of robots and tasks. The experimental results demonstrate that the Swiss round selection algorithm outperforms the genetic algorithm in terms of maximum task completion time and convergence time to reach the optimal value. Thus, the effectiveness of the Swiss round selection algorithm in solving the multi-robot task allocation problem is verified. [ABSTRACT FROM AUTHOR]

In everyday life, 5G-based localization technology is commonly used, but non-line-of-sight (NLOS) environments can block the propagation of the localization signal, thus preventing localization. In order to solve this problem, this paper proposes a reconfigurable intelligent surface non-line-of-sight time difference of arrival (TDOA) localization (RNTL) algorithm. Firstly, a model of a reflective-surface-based intelligent localization (RBP) system is constructed, which utilizes multiple RISs deployed in the air to reflect signals. Secondly, in order to reduce the localization error, this paper establishes the optimization problem of minimizing the distance between each estimated coordinate and the actual coordinate and solves it via the piecewise linear chaotic map–gray wolf optimization algorithm (PWLCM-GWO). Finally, the simulation results show that the RNTL algorithm significantly outperforms the traditional gray wolf optimization and particle swarm optimization algorithms in different signal-to-noise ratios, and the localization errors are reduced by 46% and 53.5%, respectively. [ABSTRACT FROM AUTHOR]