Search

With the rapid development of wireless communication technology, positioning technology, and modern smart devices, Internet of Vehicles (IoVs) smart vehicles have brought great convenience to human production and life. Meanwhile, privacy and security issues are becoming extremely serious, with serious consequences if sensitive data such as vehicle location and trip patterns are leaked. This paper focuses on the demands for vehicular network security, especially privacy protection and existing privacy-protection techniques, including common cryptography methods and cryptography-based advanced technologies. At the same time, this paper also analyzes the advantages and challenges of these technologies in protecting privacy and network security in the Internet of Vehicles, such as the challenges of computational resource requirements and security efficiency in the implementation process, as well as the complexity of realizing effective privacy protection in the interactions among different entities. Finally, this paper envisions the development of privacy-preserving application scenarios and the prospects for crypotography-based privacy-preserving technologies. [ABSTRACT FROM AUTHOR]

This paper presents a low-latency coordinate rotation digital computer (CORDIC) algorithm to accelerate the computation of arctangent functions, and it describes the corresponding iterative and pipelined architecture of this novel algorithm. As compared to the existing methods based on CORDIC, the proposed method can effectively reduce the number of iterations by dedicated pre-rotation and comparison processes. Moreover, the proposed CORDIC algorithm supports all vectors with arbitrary angles while maintaining convergence. By error analysis, the proposed algorithm can achieve the same accuracy as the conventional CORDIC algorithm during floating-point arctangent function computation and reduce the number of iterations by approximately 50%. This paper presents two new architectures—the iterative architecture, which can be more resource efficient, and the pipelined architecture, which can achieve a throughput rate of one datum per clock. Finally, the experimental comparison results indicate that the proposed method outperforms extant methods as it exhibits low latency, requires fewer resources to compute the arctangent function for floating-point inputs, and necessitates no digital signal processing (DSP) and memory for fixed-point inputs. [ABSTRACT FROM AUTHOR]

This paper focuses on converting complex 3D maps created by LiDAR and SLAM technology into simple 2D maps to make them easier to understand. While 3D maps provide a lot of useful details for robots and computer programs, they can be difficult to read for humans who are used to flat maps. We developed a new system to clean up these 3D maps and convert them into intuitive and accurate 2D maps. The system uses three steps designed to correct different kinds of errors found in 3D LiDAR scan data: clustering-based denoising, height-based denoising, and Statistical Outlier Removal. In particular, height-based denoising is the method we propose in this paper, an algorithm that leaves only indoor structures such as walls. The paper proposes an algorithm that considers the entire range of the point cloud, rather than just the points near the ceiling, as is the case with existing methods, to make denoising more effective. This makes the final 2D map easy to understand and useful for building planning or emergency preparedness. Our main goal is to map the interior of buildings faster and more effectively, creating 2D drawings that reflect accurate and current information. We want to make it easier to use LiDAR and SLAM data in our daily work and increase productivity. [ABSTRACT FROM AUTHOR]

The annotation of magnetic resonance imaging (MRI) images plays an important role in deep learning-based MRI segmentation tasks. Semi-automatic annotation algorithms are helpful for improving the efficiency and reducing the difficulty of MRI image annotation. However, the existing semi-automatic annotation algorithms based on deep learning have poor pre-annotation performance in the case of insufficient segmentation labels. In this paper, we propose a semi-automatic MRI annotation algorithm based on semi-weakly supervised learning. In order to achieve a better pre-annotation performance in the case of insufficient segmentation labels, semi-supervised and weakly supervised learning were introduced, and a semi-weakly supervised learning segmentation algorithm based on sparse labels was proposed. In addition, in order to improve the contribution rate of a single segmentation label to the performance of the pre-annotation model, an iterative annotation strategy based on active learning was designed. The experimental results on public MRI datasets show that the proposed algorithm achieved an equivalent pre-annotation performance when the number of segmentation labels was much less than that of the fully supervised learning algorithm, which proves the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper delves into the problem of direct position determination (DPD) for non-Gaussian sources. Existing DPD algorithms are hindered by their high computational complexity from exhaustive grid searches and a disregard for the received signal characteristics by multiple nested arrays (MNAs). To address these issues, the paper proposes a novel DPD algorithm for non-Gaussian sources with MNAs: the Discrete Fourier Transform (DFT) and Taylor compensation algorithm. Initially, the fourth-order cumulant matrix of the received signal is computed, and the vectorizing method is applied. Subsequently, a computationally efficient DPD cost function is proposed by leveraging a normalized DFT matrix to reduce complexity. Finally, first-order Taylor compensation is utilized to enhance the accuracy of the localization results. The superiority of the proposed algorithm is demonstrated through numerical simulation results. [ABSTRACT FROM AUTHOR]

In recent years, deep learning has found widespread application in SAR image object detection. However, when detecting multi-scale targets against complex backgrounds, these models often struggle to strike a balance between accuracy and speed. Furthermore, there is a continuous need to enhance the performance of current models. Hence, this paper proposes LRMSNet, a new multi-scale target detection model designed specifically for SAR images in complex backgrounds. Firstly, the paper introduces an attention module designed to enhance contextual information aggregation and capture global features, which is integrated into a backbone network with an expanded receptive field for improving SAR image feature extraction. Secondly, this paper develops an information aggregation module to effectively fuse different feature layers of the backbone network. Lastly, to better integrate feature information at various levels, this paper designs a multi-scale aggregation network. We validate the effectiveness of our method on three different SAR object detection datasets (MSAR-1.0, SSDD, and HRSID). Experimental results demonstrate that LRMSNet achieves outstanding performance with a mean average accuracy (mAP) of 95.2%, 98.9%, and 93.3% on the MSAR-1.0, SSDD, and HRSID datasets, respectively, with only 3.46 M parameters and 12.6 G floating-point operation cost (FLOPs). When compared with existing SAR object detection models on the MSAR-1.0 dataset, LRMSNet achieves state-of-the-art (SOTA) performance, showcasing its superiority in addressing SAR detection challenges in large-scale complex environments and across various object scales. [ABSTRACT FROM AUTHOR]

This paper proposes a core and spectrum allocation algorithm for elastic optical networks based on multi-core fibers. In this context, the fragmentation and crosstalk mitigation algorithm (FraCA) is proposed. FraCA implements mechanisms to reduce spectral fragmentation and inter-core crosstalk in the network, proving efficient when compared with six other algorithms reported in the literature. The numerical results show that when compared with the most competitive of the six algorithms, FraCA achieves a gain of request blocking probability of at least 16.87%, a gain of bandwidth blocking probability of at least 43.95%, and a mean increase in spectral utilization of at least 4.36%. [ABSTRACT FROM AUTHOR]

In order to effectively protect and verify the copyright information of multimedia digital works, this paper proposes a zero-watermarking algorithm based on carrier image feature point descriptors. The constructed feature matrix of this algorithm consists of two parts: the feature descriptor vector calculated from scale-invariant feature reconstruction transform (SIFRT) and the multi-radius local binary pattern (MrLBP) descriptor vector. The algorithm performs a standardization, feature decomposition, and redundancy reduction on the traditional keypoint descriptor matrix, combines it with the texture feature matrix, and achieves the dimensional matching of copyright information. The advantage of this algorithm lies in its non-modification of the original data. Compared to computing global features, the local features computed from a subset of key points reduce the amount of attack interference introduced during copyright verification, thereby reducing the number of erroneous pixel values that are introduced. The algorithm introduces a timestamp mechanism when uploading the generated zero-watermarking image to a third-party copyright center, preventing subsequent tampering. Experimental data analysis demonstrates that the algorithm exhibits good discriminability, security, and robustness. [ABSTRACT FROM AUTHOR]

Although deep neural networks have been successfully applied in many fields, research studies show that neural network models are easily disrupted by small malicious inputs, greatly reducing their performance. Such disruptions are known as adversarial attacks. To reduce the impact of adversarial attacks on models, researchers have proposed adversarial training methods. However, compared with standard training, adversarial training results in additional computational overhead and training time. To improve the training effect without significantly increasing the training time, an improved Fast-M adversarial training algorithm based on the fast adversarial training algorithm is proposed in this paper. Extensive comparative experiments are conducted with the MNIST, CIFAR10, and CIFAR100 datasets. The results show that the Fast-M algorithm achieves the same training effect as the commonly used projected gradient descent (PGD) adversarial training method, with a training time that is only one-third of that of PGD and a performance comparable to that of fast adversarial training, demonstrating the proposed algorithm's effectiveness. [ABSTRACT FROM AUTHOR]

A major area of application of multiobjective path problems and resolution algorithms is telecommunication network routing design, taking into account the extremely rapid technological and service evolutions. The need for explicit consideration of heterogeneous Quality of Service metrics makes it advantageous for the development of routing models where various technical–economic aspects, often conflicting, should be tackled. Our work is focused on multiobjective path problem formulations and resolution methods and their applications to routing methods. We review basic concepts and present main formulations of multiobjective path problems, considering different types of objective functions. We outline the different types of resolution methods for these problems, including a classification and overview of relevant algorithms concerning different types of problems. Afterwards, we outline background concepts on routing models and present an overview of selected papers considered as representative of different types of applications of multiobjective path problem formulations and algorithms. A broad characterization of major types of path problems relevant in this context is shown regarding the overview of contributions in different technological and architectural network environments. Finally, we outline research trends in this area, in relation to recent technological evolutions in communication networks. [ABSTRACT FROM AUTHOR]

To address the shortcomings of previous autonomous decision models, which often overlook the personalized features of users, this paper proposes a personalized decision control algorithm for autonomous vehicles based on RLHF (reinforcement learning from human feedback). The algorithm combines two reinforcement learning approaches, DDPG (Deep Deterministic Policy Gradient) and PPO (proximal policy optimization), and divides the control scheme into three phases including pre-training, human evaluation, and parameter optimization. During the pre-training phase, an agent is trained using the DDPG algorithm. In the human evaluation phase, different trajectories generated by the DDPG-trained agent are scored by individuals with different styles, and the respective reward models are trained based on the trajectories. In the parameter optimization phase, the network parameters are updated using the PPO algorithm and the reward values given by the reward model to achieve personalized autonomous vehicle control. To validate the control algorithm designed in this paper, a simulation scenario was built using CARLA_0.9.13 software. The results demonstrate that the proposed algorithm can provide personalized decision control solutions for different styles of people, satisfying human needs while ensuring safety. [ABSTRACT FROM AUTHOR]

The health assessment of airborne lithium batteries is crucial for flight testing, ensuring the safety and reliability of aircraft power systems. This paper proposes a support vector machine-based algorithm for the health assessment of airborne lithium batteries, featuring a dynamic correction mechanism for the risk loss penalty parameter. The proposed approach systematically adjusts risk loss penalty parameters based on sample misjudgment ratios and incorporates fault identification corrections to meet the safety requirements of the airborne operation. The experimental results demonstrate the stability and reliability of the proposed algorithm in hyperplane deviation suppression as well as significant improvements in fault sample recall rates. When compared with traditional SVM and other baseline methods such as Random Forest and SVR, our method significantly outperformed these algorithms in terms of accuracy, recall rate, and precision rate. This study provides an efficient and reliable method for the health assessment of airborne lithium batteries, with significant application value. [ABSTRACT FROM AUTHOR]

Scanning ion conductance microscopy (SICM) enables the non-invasive three-dimensional imaging of live cells and other structures in physiological environments. However, when imaging complex samples, SICM faces challenges such as having a low temporal resolution during slow scanning and a reduced signal-to-noise ratio during fast scanning, making it difficult to simultaneously improve both temporal and spatial resolution. To address these issues, this paper proposes an algorithm for enhancing image resolution under high-speed scanning. Firstly, scanning images are preprocessed using a median filtering algorithm to remove the salt-and-pepper noise generated during high-speed scanning. Next, the Canny edge detection algorithm is employed to extract the edges of the image targets. To avoid blurring the edges, the new edge-directed interpolation (NEDI) algorithm is then used to fill the edges, while non-edge areas are filled using bilinear interpolation, thereby enhancing the image resolution. Finally, the peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) are used to analyze the imaging of articular chondrocytes. The results show that under a scanning speed of 480 nm/ms, the proposed algorithm improves the temporal resolution of imaging by 60% compared to traditional 2× resolution imaging, increases the peak signal-to-noise ratio of the scanning images by 7 dB, and achieves a structural similarity of 0.97. Therefore, the proposed algorithm effectively removes noise during high-speed scanning and improves the SICM scanning imaging resolution, thereby avoiding the reduction in temporal resolution when scanning larger resolution samples and effectively enhancing the performance of SICM scanning imaging. [ABSTRACT FROM AUTHOR]

In response to the intensification of urbanization, characterized by increasingly dense land use, the proliferation of high-rise residences has emerged as a predominant housing solution, particularly evident in developed cities like those in China. With a primary aim of enhancing the residential living environment within high-rise structures, this study advocates for a comprehensive whole life cycle perspective. By employing digital technology and conducting experiments centered on a representative case study, this paper focuses on optimizing the functional layout of public activity spaces within high-rise residential projects. Specifically, this article aims to address challenges such as the inadequate configuration and articulation of various public spaces, along with the underutilization of peripheral activity areas. Central to the optimization efforts is the utilization of the Kruskal algorithm, which enables the analysis of flow lines and functions, ultimately leading to the derivation of optimal solutions. Through a detailed analysis of our case study, this paper provides actionable insights into enhancing the feasibility and effectiveness of public spaces within high-rise residential projects. Recognizing the pivotal role of public space layout in shaping residents' living experiences, the importance of addressing this issue early in the design phase was emphasized. By integrating scientifically driven digital technology solutions, smart, inclusive, and convenient communities that cater to the diverse needs of their inhabitants are aspired to be created. [ABSTRACT FROM AUTHOR]

This paper proposes a new post-quantum signature scheme, Syrga2, based on hash functions. As known, existing post-quantum algorithms are classified based on their structures. The proposed Syrga2 scheme belongs to the class of multi-use signatures with state retention. A distinctive feature of state-retaining signatures is achieving a compromise between performance and signature size. This scheme enables the creation of a secure signature for r messages using a single pair of secret and public keys. The strength of signature algorithms based on hash functions depends on the properties of the hash function used in their structure. Additionally, for such algorithms, it is possible to specify the security level precisely. In the proposed scheme, the HBC-256 algorithm developed at the Institute of Information and Computational Technologies (IICT) is used as the hash function. The security of the HBC-256 algorithm has been thoroughly studied in other works by the authors. In contrast to the Syrga1 scheme presented in previous works by the authors, the Syrga2 scheme provides for the definition of different security levels determined by the parameter τ. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme's performance is evaluated for signature creation, signing, and message verification. [ABSTRACT FROM AUTHOR]

The algorithm proposed in this paper aims at solving the problem of star map matching in high-limiting-magnitude astronomical images, which is inspired by geometric voting star identification techniques. It is a two-step star map matching algorithm relying only on angular features, and adopts a reasonable matching strategy to overcome the problem of poor real-time performance of the geometric voting algorithm when the number of stars is large. The algorithm focuses on application scenarios where there are a large number of dense stars (limiting magnitude greater than 13, average number of stars per square degree greater than 185) in the image, which is different from the sparse star identification problem of the star tracker, which is more challenging for the robustness and real-time performance of the algorithm. The proposed algorithm can be adapted to application scenarios such as unreliable brightness information, centroid positioning error, visual axis pointing deviation, and a large number of false stars, with high accuracy, robustness, and good real-time performance. [ABSTRACT FROM AUTHOR]

Accurately extracting weak signals is extremely important for overall performance and application in optoelectronic imaging and optical communication systems. While weak signals are susceptible to noise, adaptive filtering is a commonly used noise removal method. Still, its convergence speed is slow, the steady-state error is large, and the anti-interference ability is weak. To solve the above problems, this paper proposes a new type of variable-step-length adaptive filtering algorithm (DSLMS) based on the minutiae function, which effectively reduces the noise component in error through its combination with the pair cancelation system, utilizing the low correlation property of the noise signal, to improve the anti-noise interference ability of the adaptive filter. Using FPGA and Matlab (2018b) for experimental verification, the results show that this algorithm shows significant advantages in noise suppression, accelerated algorithm convergence, and low steady-state error, and it has effectiveness and application potential for the optoelectronic detection of weak signal processing. [ABSTRACT FROM AUTHOR]

In view of the problems in planning and recommending tour routes, this paper constructs a feature text mining (FTM) method and spatial accessibility model (SAM) as the key factors for scenic spot recommendation (SSR) and tour route recommendation (TRR). The scenic spot clustering algorithm (SSCA) based on FTM was constructed by tourists' text evaluation data mining. Considering the spatial attributes of scenic spots, the scenic spot topology tree algorithm (SSTTA) based on dynamic buffer spatial accessibility (DBSA) was constructed. The optimal scenic spots were recommended based on interest matching and spatial accessibility optimization. As to the recommended scenic spots, this paper proposes an optimal tour route recommendation algorithm (TRRA) based on SSTTA, which aims to determine the optimal adjacent section path structure tree (ASPST) with the lowest cost under travel constraints and transportation modes. The experiment verifies that the proposed algorithm can recommend scenic spots that match tourists' interests and have optimal spatial accessibility, and the optimal tour routes with the lowest costs under certain travel constraints. Compared with the searched sub-optimal tour routes, the optimal tour route recommended by the proposed algorithm produces the lowest travel costs, and all the scenic spots in the tour route meet the tourists' interests. Compared with the commonly used BDMA and GDMA methods, the proposed algorithm can determine the optimal routes with lower travel costs. [ABSTRACT FROM AUTHOR]

Object detection is one of the core technologies for autonomous driving. Current road object detection mainly relies on visible light, which is prone to missed detections and false alarms in rainy, night-time, and foggy scenes. Multispectral object detection based on the fusion of RGB and infrared images can effectively address the challenges of complex and changing road scenes, improving the detection performance of current algorithms in complex scenarios. However, previous multispectral detection algorithms suffer from issues such as poor fusion of dual-mode information, poor detection performance for multi-scale objects, and inadequate utilization of semantic information. To address these challenges and enhance the detection performance in complex road scenes, this paper proposes a novel multispectral object detection algorithm called MRD-YOLO. In MRD-YOLO, we utilize interaction-based feature extraction to effectively fuse information and introduce the BIC-Fusion module with attention guidance to fuse different modal information. We also incorporate the SAConv module to improve the model's detection performance for multi-scale objects and utilize the AIFI structure to enhance the utilization of semantic information. Finally, we conduct experiments on two major public datasets, FLIR_Aligned and M3FD. The experimental results demonstrate that compared to other algorithms, the proposed algorithm achieves superior detection performance in complex road scenes. [ABSTRACT FROM AUTHOR]

In response to the numerous challenges faced by traditional human pose recognition methods in practical applications, such as dense targets, severe edge occlusion, limited application scenarios, complex backgrounds, and poor recognition accuracy when targets are occluded, this paper proposes a YOLO-Pose algorithm for human pose estimation. The specific improvements are divided into four parts. Firstly, in the Backbone section of the YOLO-Pose model, lightweight GhostNet modules are introduced to reduce the model's parameter count and computational requirements, making it suitable for deployment on unmanned aerial vehicles (UAVs). Secondly, the ACmix attention mechanism is integrated into the Neck section to improve detection speed during object judgment and localization. Furthermore, in the Head section, key points are optimized using coordinate attention mechanisms, significantly enhancing key point localization accuracy. Lastly, the paper improves the loss function and confidence function to enhance the model's robustness. Experimental results demonstrate that the improved model achieves a 95.58% improvement in mAP50 and a 69.54% improvement in mAP50-95 compared to the original model, with a reduction of 14.6 M parameters. The model achieves a detection speed of 19.9 ms per image, optimized by 30% and 39.5% compared to the original model. Comparisons with other algorithms such as Faster R-CNN, SSD, YOLOv4, and YOLOv7 demonstrate varying degrees of performance improvement. [ABSTRACT FROM AUTHOR]

With the advancement of remote sensing technology, the demand for the accurate monitoring and tracking of various targets utilizing unmanned aerial vehicles (UAVs) is increasing. However, challenges such as object deformation, motion blur, and object occlusion during the tracking process could significantly affect tracking performance and ultimately lead to tracking drift. To address this issue, this paper introduces a high-precision target-tracking method with anomaly tracking status detection and recovery. An adaptive feature fusion strategy is proposed to improve the adaptability of the traditional sum of template and pixel-wise learners (Staple) algorithm to changes in target appearance and environmental conditions. Additionally, the Moth Flame Optimization (MFO) algorithm, known for its strong global search capability, is introduced as a re-detection algorithm in case of tracking failure. Furthermore, a trajectory-guided Gaussian initialization technique and an iteration speed update strategy are proposed based on sexual pheromone density to enhance the tracking performance of the introduced re-detection algorithm. Comparative experiments conducted on UAV123 and UAVDT datasets demonstrate the excellent stability and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To solve the high error phenomenon of microelectromechanical systems (MEMS) due to their poor signal-to-noise ratio, this paper proposes an online compensation algorithm wavelet threshold back-propagation neural network (WT-BPNN), based on a neural network and designed to effectively suppress the random error of MEMS arrays. The algorithm denoises MEMS and compensates for the error using a back propagation neural network (BPNN). To verify the feasibility of the proposed algorithm, we deployed it in a ZYNQ-based MEMS array hardware. The experimental results showed that the zero-bias instability, angular random wander, and angular velocity random wander of the gyroscope were improved by about 12 dB, 10 dB, and 7 dB, respectively, compared with the original device in static scenarios, and the dispersion of the output data was reduced by about 8 dB in various dynamic environments, which effectively verified the robustness and feasibility of the algorithm. [ABSTRACT FROM AUTHOR]

In decentralized systems, the quest for heightened security and integrity within blockchain networks becomes an issue. This survey investigates anomaly detection techniques in blockchain ecosystems through the lens of unsupervised learning, delving into the intricacies and going through the complex tapestry of abnormal behaviors by examining avant-garde algorithms to discern deviations from normal patterns. By seamlessly blending technological acumen with a discerning gaze, this survey offers a perspective on the symbiotic relationship between unsupervised learning and anomaly detection by reviewing this problem with a categorization of algorithms that are applied to a variety of problems in this field. We propose that the use of unsupervised algorithms in blockchain anomaly detection should be viewed not only as an implementation procedure but also as an integration procedure, where the merits of these algorithms can effectively be combined in ways determined by the problem at hand. In that sense, the main contribution of this paper is a thorough study of the interplay between various unsupervised learning algorithms and how this can be used in facing malicious activities and behaviors within public and private blockchain networks. The result is the definition of three categories, the characteristics of which are recognized in terms of the way the respective integration takes place. When implementing unsupervised learning, the structure of the data plays a pivotal role. Therefore, this paper also provides an in-depth presentation of the data structures commonly used in unsupervised learning-based blockchain anomaly detection. The above analysis is encircled by a presentation of the typical anomalies that have occurred so far along with a description of the general machine learning frameworks developed to deal with them. Finally, the paper spotlights challenges and directions that can serve as a comprehensive compendium for future research efforts. [ABSTRACT FROM AUTHOR]

This paper addresses the following problem: given m potential observations to determine n parameters, m > n , what is the best choice of n observations. The problem can be formulated as finding the n × n submatrix of the complete m × n observation matrix that has maximum determinant. An algorithm by Gu and Eisenstat for a determining a strongly rank-revealing QR factorisation of a matrix can be adapted to address this latter formulation. The algorithm starts with an initial selection of n rows of the observation matrix and then performs a sequence of row interchanges, with the determinant of the current submatrix strictly increasing at each step until no further improvement can be made. The algorithm implements rank-one updating strategies, which leads to a compact and efficient algorithm. The algorithm does not necessarily determine the global optimum but provides a practical approach to designing an effective measurement strategy. In this paper, we describe how the Gu–Eisenstat algorithm can be adapted to address the problem of optimal experimental design and used with the QR algorithm with column pivoting to provide effective designs. We also describe implementations of sequential algorithms to add further measurements that optimise the information gain at each step. We illustrate performance on several metrology examples. [ABSTRACT FROM AUTHOR]

List intersection plays a pivotal role in various domains such as search engines, database systems, and social networks. Efficient indexes and query strategies can significantly enhance the efficiency of list intersection. Existing inverted index-based algorithms fail to utilize the length information of documents and require excessive list intersections, resulting in lower efficiency. To address this issue, in this paper, we propose the LDRpV (Length-based Document Reordering plus Verification) algorithm. LDRpV filters out documents that are unlikely to satisfy the intersection results by reordering documents based on their length, thereby reducing the number of candidates. Additionally, to minimize the number of list intersection operations, an intersection and verification strategy is designed, where only the first m lists are intersected, and the resulting candidate set is directly verified. This approach effectively improves the efficiency of list intersection. Experimental results on four real datasets demonstrate that LDRpV can achieve a maximum efficiency improvement of 46.69% compared to the most competitive counterparts. [ABSTRACT FROM AUTHOR]

To address the reactive power optimization control problem in offshore wind farms (OWFs), this paper proposes an adaptive reactive power optimization control strategy based on an improved Particle Swarm Optimization (PSO) algorithm. Firstly, an OWF multi-objective optimization control model is established, with the total sum of voltage deviations at wind turbine (WT) terminals, active power network losses, and reactive power margin of WTs as comprehensive optimization objectives. Innovatively, adaptive weighting coefficients are introduced for the three sub-objectives, enabling the weights of each optimization objective to be adaptively adjusted based on real-time operating conditions, thus enhancing the adaptability of the reactive power optimization model to changes in operating conditions. Secondly, a Uniform Adaptive Particle Swarm Optimization (UAPSO) algorithm is proposed. On one hand, the algorithm initializes the particle swarm using a uniform initialization method; on the other hand, it improves the particle velocity update formula, allowing the inertia coefficient to adaptively adjust based on the number of iterations and the fitness ranking of particles. Simulation results demonstrate the following: (1) Under various operating conditions, the proposed adaptive multi-objective reactive power optimization strategy can ensure the stability of node voltages in offshore wind farms, reduce active power losses, and simultaneously improve reactive power margins. (2) Compared with the traditional PSO algorithm, UAPSO exhibits an approximately 10% improvement in solution speed and enhanced solution accuracy. [ABSTRACT FROM AUTHOR]

For future large-scale CubeSat applications in orbit, the deployer must accommodate a greater number of CubeSats and facilitate cluster releases. This paper introduces an improved A* algorithm tailored for CubeSat in-orbit transfer path planning. Unlike the traditional A* algorithm, this enhanced version incorporates a path coordination strategy to manage congestion caused by the simultaneous transfer of many CubeSats, ensuring they reach their designated release positions smoothly and thus significantly boosting the efficiency of CubeSat transfers. Additionally, the algorithm develops a cost model for attitude disturbances on the electromagnetic conveying platform and crafts an improved cost function. It strategically balances the reduction in attitude disturbances caused by CubeSat transfers with the efficiency of these transfers. The primary goal is to minimize platform disturbances while optimizing the number of steps CubeSats need to reach their intended positions. The effectiveness of this algorithm is demonstrated through detailed case studies, which confirm that during the CubeSat transfer process, the platform's attitude remains stable, and the transfer efficiency is well-managed, achieving efficient path planning for the in-orbit transfer of numerous CubeSats. [ABSTRACT FROM AUTHOR]

This paper presents an improved swarming algorithm that enhances low-illumination images. The algorithm combines a hybrid Harris Eagle algorithm with double gamma (IHHO-BIGA) and incomplete beta (IHHO-NBeta) functions. This paper integrates the concept of symmetry into the improvement steps of the image adaptive enhancement algorithm. The enhanced algorithm integrates chaotic mapping for population initialization, a nonlinear formula for prey energy calculation, spiral motion from the black widow algorithm for global search enhancement, a nonlinear inertia weight factor inspired by particle swarm optimization, and a modified Levy flight strategy to prevent premature convergence to local optima. This paper compares the algorithm's performance with other swarm intelligence algorithms using commonly used test functions. The algorithm's performance is compared against several emerging swarm intelligence algorithms using commonly used test functions, with results demonstrating its superior performance. The improved Harris Eagle algorithm is then applied for image adaptive enhancement, and its effectiveness is evaluated on five low-illumination images from the LOL dataset. The proposed method is compared to three common image enhancement techniques and the IHHO-BIGA and IHHO-NBeta methods. The experimental results reveal that the proposed approach achieves optimal visual perception and enhanced image evaluation metrics, outperforming the existing techniques. Notably, the standard deviation data of the first image show that the IHHO-NBeta method enhances the image by 8.26%, 120.91%, 126.85%, and 164.02% compared with IHHO-BIGA, the single-scale Retinex enhancement method, the homomorphic filtering method, and the limited contrast adaptive histogram equalization method, respectively. The processing time of the improved method is also better than the previous heuristic algorithm. [ABSTRACT FROM AUTHOR]

Underwater acoustic (UWA) channel prediction technology, as an important topic in UWA communication, has played an important role in UWA adaptive communication network and underwater target perception. Although many significant advancements have been achieved in underwater acoustic channel prediction over the years, a comprehensive summary and introduction is still lacking. As the first comprehensive overview of UWA channel prediction, this paper introduces past works and algorithm implementation methods of channel prediction from the perspective of linear, kernel-based, and deep learning approaches. Importantly, based on available at-sea experiment datasets, this paper compares the performance of current primary UWA channel prediction algorithms under a unified system framework, providing researchers with a comprehensive and objective understanding of UWA channel prediction. Finally, it discusses the directions and challenges for future research. The survey finds that linear prediction algorithms are the most widely applied, and deep learning, as the most advanced type of algorithm, has moved this field into a new stage. The experimental results show that the linear algorithms have the lowest computational complexity, and when the training samples are sufficient, deep learning algorithms have the best prediction performance. [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]

Battery voltage is a pivotal parameter for evaluating battery health and safety. The precise prediction of battery voltage and the implementation of anomaly detection are imperative for ensuring the secure and dependable operation of battery systems. Nevertheless, during the actual operation of electric vehicles, battery performance is subject to the influence of the vehicle's operational state and battery characteristic parameters, introducing challenges to safety alerts. In order to address these challenges and achieve precise battery voltage prediction, this paper comprehensively considers the battery characteristics and driving behavior of electric vehicles in both charging and operational states. Mathematical processing, including averaging and variance calculation, is applied to the battery characteristic parameter data and driving behavior data. By integrating historical voltage data and employing a modified gradient boosting decision tree algorithm (GBDT), a fast and accurate online voltage prediction method is proposed. Hyperparameter optimization is employed to minimize prediction voltage errors. The accuracy and timeliness of the predictions are validated through a comprehensive evaluation and comparison of the forecasted voltages. To diagnose anomalies in battery voltage, the paper proposes a fault diagnosis method that combines the Isolation Forest and Boxplot techniques. Finally, utilizing authentic electric vehicle data for validation, the research underscores the capability of the proposed method to achieve accurate voltage predictions six minutes in advance and provide effective fault diagnosis. This investigation carries substantial practical implications for fortifying battery management and optimizing the performance of electric vehicles. [ABSTRACT FROM AUTHOR]

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

In this paper, we propose a Grid-based Non-uniform Probability Density Sampling Probabilistic Roadmap algorithm (GN-PRM) in response to the challenges of difficult sampling in narrow passages and low-probability map generation in traditional Probabilistic Roadmap algorithms (PRM). The improved algorithm incorporates grid-based processing for map segmentation, employing non-uniform probability density sampling based on the different attributes of each block to enhance sampling probability in narrow passages. Additionally, considering the computational cost and frequent ineffective searches in traditional PRM algorithms during pathfinding, this paper optimizes the time required for query route planning by altering connection strategies to improve the algorithm's runtime. Finally, the simulation results indicate that, with a reduction of over 50% in undirected line segments and a reduction of over 85% in runtime, the GN-PRM algorithm achieves a 100% success rate in complex planning scenarios with a sampling point value of K = 500. In comparison, the traditional PRM algorithm has a success rate of no more than 10%, with a sampling point value of K = 500. [ABSTRACT FROM AUTHOR]

Sleep monitoring has become a prevalent area of research where body position and physiological data, such as heart rate and respiratory rate, are monitored. Numerous critical health problems are associated with poor sleep, such as pressure sore development, sleep disorders, and low sleep quality, which can lead to an increased risk of falls, cardiovascular diseases, and obesity. Current monitoring systems can be costly, laborious, and taxing on hospital resources. This paper reviews the most recent solutions for contactless textile technology in the form of bed sheets or mats to monitor body positions, vital signs, and sleep, both commercially and in the literature. This paper is organized into four categories: body position and movement monitoring, physiological monitoring, sleep monitoring, and commercial products. A detailed performance evaluation was carried out, considering the detection accuracy as well as the sensor types and algorithms used. The areas that need further research and the challenges for each category are discussed in detail. [ABSTRACT FROM AUTHOR]

Link prediction is a crucial area of study within complex networks research. Mapping nodes to low-dimensional vectors through network embeddings is a vital technique for link prediction. Most of the existing methods employ "node–edge"-structured networks to model the data and learn node embeddings. In this paper, we initially introduce the Clique structure to enhance the existing model and investigate the impact of introducing two Clique structures (LECON: Learning Embedding based on Clique Of the Network) and nine motifs (LEMON: Learning Embedding based on Motif Of the Network), respectively, on experimental performance. Subsequently, we introduce a hypergraph to model the network and reconfigure the network by mapping hypermotifs to two structures: open hypermotif and closed hypermotif, respectively. Then, we introduce hypermotifs as supernodes to capture the structural similarity between nodes in the network (HMRLH: HyperMotif Representation Learning on Hypergraph). After that, taking into account the connectivity and structural similarity of the involved nodes, we propose the Depth and Breadth Motif Random Walk method to acquire node sequences. We then apply this method to the LEMON (LEMON-DB: LEMON-Depth and Breadth Motif Random Walk) and HMRLH (HMRLH-DB: HMRLH-Depth and Breadth Motif Random Walk) algorithms. The experimental results on four different datasets indicate that, compared with the LEMON method, the LECON method improves experimental performance while reducing time complexity. The HMRLH method, utilizing hypernetwork modeling, proves more effective in extracting node features. The LEMON-DB and HMRLH-DB methods, incorporating new random walk approaches, outperform the original methods in the field of link prediction. Compared with state-of-the-art baselines, the proposed approach in this paper effectively enhances link prediction accuracy, demonstrating a certain level of superiority. [ABSTRACT FROM AUTHOR]

Due to the complicated and changing circumstances of the sea environment, path planning technology is essential for unmanned surface vehicles (USVs) to fulfill search tasks. In most cases, the location of the underwater target is unknown, so it is necessary to completely cover the search area. In this paper, the global static path is planned using a parallel line scan search. When encountering unknown obstacles, the improved Bug algorithm is used for local dynamic path planning according to the sensor detection information. This paper first sets up the safe expansion area to ensure the safety of the USV during the obstacle avoidance process and optimizes the movement direction considering the operation and behavior characteristics of the USV. To meet the requirement of USV steering, the Bezier curve is used to smooth the path points, which greatly improves the smoothness of the path. In this paper, the multi-mode switching strategy of the Bug algorithm based on obstacle boundary width obtained by the sensor is proposed, which ensures no area omissions and meets the requirement of search area coverage during the process of bypassing obstacles. The simulation results show that the improved Bug algorithm can maintain a safe distance along the obstacle boundary to bypass the obstacle. Moreover, the improved Bug algorithm effectively improves the path oscillation phenomenon of traditional Bug and shortens the path length and operating time. Finally, through the global search path planning simulation and comparison experiments, the effectiveness of the proposed method is verified. [ABSTRACT FROM AUTHOR]

With the increasingly maturing technology of unmanned surface vehicles (USVs), their applications are becoming more and more widespread. In order to meet operational requirements in complex scenarios, the real-time interaction and linkage of a large amount of information is required between USVs, between USVs and mother ships, and between USVs and shore-based monitoring systems. Visual images are the main perceptual information gathered from USVs, and their efficient transmission and recognition directly affect the real-time performance of information exchange. However, poor maritime communication signals, strong channel interference, and low bandwidth pose great challenges to efficient image transmission. Traditional image transmission methods have difficulty meeting the real-time and image quality requirements of visual image transmissions from USVs. Therefore, this paper proposes an efficient method for visual image transmission from USVs based on semantic communication. A self-encoder network for semantic encoding which compresses the image into low-dimensional latent semantics through the encoding end, thereby preserving semantic information while greatly reducing the amount of data transmitted, is designed. On the other hand, a generative adversarial network is designed for semantic decoding. The decoding end decodes and reconstructs high-quality images from the semantic information transmitted through the channel, thereby improving the efficiency of image transmission. The experimental results show that the performance of the algorithm is significantly superior to traditional image transmission methods, achieving the best image quality while transmitting the minimum amount of data. Compared with the typical BPG algorithm, when the compression ratio of the proposed algorithm is 51.6% of that of the BPG algorithm, the PSNR and SSIM values are 7.6% and 5.7% higher than the BPG algorithm, respectively. And the average total time of the proposed algorithm is only 59.4% of that of the BPG algorithm. [ABSTRACT FROM AUTHOR]

Tunnel cracks are the main factors that cause damage and collapse of tunnel structures. How to detect tunnel cracks efficiently and avoid safety accidents caused by tunnel cracks effectively is a research hotspot at present. In order to meet the need for efficient detection of tunnel cracks, the tunnel crack detection method based on improved Retinex and deep learning is proposed in this paper. The tunnel crack images collected by optical imaging equipment are used to improve the contrast information of tunnel crack images using the image enhancement algorithm, and this image enhancement algorithm has the function of multi-scale Retinex decomposition with improved central filtering. An improved VGG19 network model is constructed to achieve efficient segmentation of tunnel crack images through deep learning methods and then form the segmented binary image. The Zhang–Suen fast parallel-thinning method is used to obtain the skeleton map of the single-layer pixel, and the length and width information of the tunnel cracks are obtained. The feasibility and effectiveness of the proposed method are verified by experiments. Compared with other methods in the literature, the maximum deviation in the length of the tunnel crack is about 5 mm, and the maximum deviation in the width of the tunnel crack is about 0.8 mm. The experimental results show that the proposed method has a shorter detection time and higher detection accuracy. The research results of this paper can provide a strong basis for the health evaluation of tunnels. [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]

Path-planning research has been the key to mobile-robot-navigation technology. However, traditional path-planning algorithms have some shortcomings. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constrained A* algorithm with the Dynamic Window Approach (DWA) algorithm. The kinematical constrained A* algorithm can plan the global path, and then the DWA algorithm can plan the local path under the global path's guidance. Firstly, combined with robot kinematics, we improve the node-expansion method and heuristic-function model of the A* algorithm, which improves the search efficiency, reduces the number of path bends and lowers the computational cost so that the path generated by the A* algorithm better meets the needs of robot motion. Secondly, we optimize the trajectory-evaluation function of the DWA algorithm so that the local paths planned by the DWA algorithm are smoother and more coherent, which is easier for robot-motion execution. Finally, we extract the key nodes from the global path planned by the A* algorithm to guide the DWA algorithm for local path planning and dynamic-obstacle avoidance and to make the local path closer to the global path. Through simulation and practical experiments, the effectiveness of the fusion algorithm proposed in this paper is verified. [ABSTRACT FROM AUTHOR]

Maritime Autonomous Surface Ships (MASS) are becoming of interest to the maritime sector and are also on the agenda of the International Maritime Organization (IMO). With the boom in global maritime traffic, the number of ships is increasing rapidly. The use of intelligent technology to achieve autonomous collision avoidance is a hot issue widely discussed in the industry. In the endeavor to solve this problem, multi-ship coordinated collision avoidance has become a crucial challenge. This paper proposes a multi-ship autonomous collision avoidance decision-making algorithm by a data-driven method and adopts the Multi-agent Deep Reinforcement Learning (MADRL) framework for its design. Firstly, the overall framework of this paper and its components follow the principle of "reality as primary and simulation as supplementary", so a real data-driven AIS (Automatic Identification System) dominates the model construction. Secondly, the agent's observation state is determined by quantifying the hazardous area. Then, based on a full understanding of the International Regulations for Preventing Collisions at Sea (COLREGs) and the preliminary data collection, this paper combines the statistical results of the real water traffic data to guide and design the algorithm framework and selects the representative influencing factors to be designed in the collision avoidance decision-making algorithm's reward function. Next, we train the algorithmic model using both real data and simulation data. Meanwhile, Prioritized Experience Replay (PER) is adopted to accelerate the model's learning efficiency. Finally, 40 encounter scenarios are designed and extended to verify the algorithm performance based on the idea of the Imazu problem. The experimental results show that this algorithm can efficiently make a ship collision avoidance decision in compliance with COLREGs. Multi-agent learning through shared network policies can ensure that the agents pass beyond the safe distance in unknown environments. We can apply the trained model to the system with different numbers of agents to provide a reference for the research of autonomous collision avoidance in ships. [ABSTRACT FROM AUTHOR]

This Special Issue contains four papers focused on hyperspectral data analysis. The authors use multivariate data analysis to establish a quantitative relationship between the obtained spectral information of the kidney and its reference TWC values. The present Special Issue covers a range of algorithms and techniques for hyperspectral data analysis. [Extracted from the article]

The purpose of image dehazing is to remove the interference from weather factors in degraded images and enhance the clarity and color saturation of images to maximize the restoration of useful features. Single image dehazing is one of the most important tasks in the field of image restoration. In recent years, due to the progress of deep learning, single image dehazing has made great progress. With the success of Transformer in advanced computer vision tasks, some research studies also began to apply Transformer to image dehazing tasks and obtained surprising results. However, both the deconvolution-neural-network-based dehazing algorithm and Transformer based dehazing algorithm magnify their advantages and disadvantages separately. Therefore, this paper proposes a novel Transformer–Convolution fusion dehazing network (TCFDN), which uses Transformer's global modeling ability and convolutional neural network's local modeling ability to improve the dehazing ability. In the Transformer–Convolution fusion dehazing network, the classic self-encoder structure is used. This paper proposes a Transformer–Convolution hybrid layer, which uses an adaptive fusion strategy to make full use of the Swin-Transformer and convolutional neural network to extract and reconstruct image features. On the basis of previous research, this layer further improves the ability of the network to remove haze. A series of contrast experiments and ablation experiments not only proved that the Transformer–Convolution fusion dehazing network proposed in this paper exceeded the more advanced dehazing algorithm, but also provided solid and powerful evidence for the basic theory on which it depends. [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]

In the traditional text detection process, the text area of the small receptive field in the video image is easily ignored, the features that can be extracted are few, and the calculation is large. These problems are not conducive to the recognition of text information. In this paper, a lightweight network structure on the basis of the EAST algorithm, the Convolution Block Attention Module (CBAM), is proposed. It is suitable for the spatial and channel hybrid attention module of text feature extraction of the natural scene video images. The improved structure proposed in this paper can obtain deep network features of text and reduce the computation of text feature extraction. Additionally, a hybrid feature pyramid + BLSTM network is designed to improve the attention to the small acceptance domain text regions and the text sequence features of the region. The test results on the ICDAR2015 demonstrate that the improved construction can effectively boost the attention of small acceptance domain text regions and improve the sequence feature detection accuracy of small acceptance domain of long text regions without significantly increasing computation. At the same time, the proposed network constructions are superior to the traditional EAST algorithm and other improved algorithms in accuracy rate P, recall rate R, and F-value. [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]

Lithium-ion batteries are widely used in power grids as a common form of energy storage in power stations. The state of charge (SOC) and state of health (SOH) reflect the capacity and lifetime variation in the Li-ion batteries, and they are important state parameters of Li-ion batteries. Therefore, the establishment of accurate SOC and SOH prediction models is an essential prerequisite for the correct assessment of the status of lithium batteries, the improvement of the operational accuracy of energy-storage stations, and the development of maintenance plans for energy-storage stations. This paper first analyzes the correlation between SOC and SOH, and then proposes a joint SOC and SOH prediction model using the particle swarm optimization (PSO) algorithm to optimize the extreme gradient boosting algorithm (XGBoost), which takes into account the dynamic correlation between SOC and SOH dynamics, thus enabling more accurate SOC and SOH prediction. Finally, the prediction model is validated using the Oxford battery aging dataset. The correlation between SOC and SOH is verified by comparing the joint prediction results with the SOC individual prediction results. Then, the prediction results of the PSO-XGBoost model, the traditional XGBoost model, and the long short-term memory neural network are compared to verify the effectiveness and accuracy of the PSO-XGBoost model. [ABSTRACT FROM AUTHOR]

With high real-time performance and a good filtering effect, the wavelet transform-based real-time filter is more commonly used in the fusion magnet power supply. Considering the signal characteristics of the fusion magnet power supply, the sliding time window method is widely used to satisfy the requirements of filtering efficiency. In this paper, an updated half-edge extension method is proposed to improve the boundary effect of sliding window data. Moreover, the hardware-based wavelet loopback structure is proposed to avoid the double computation of long sliding window data, thereby improving real-time performance and satisfying the demands of fusion magnet power supply filtering. The proposed half-edge extension method and the wavelet loopback structure are implemented by designed FPGA and experimented on the Experimental and Advanced Superconducting Tokamak (EAST) fusion magnet power supply system to verify the filtering efficiency. According to the experiment's results, the proposed half-edge extension method has a better filtering effect, and the proposed wavelet loopback structure decreases the time by 67.4%, which can satisfy the requirements of the power supply system. [ABSTRACT FROM AUTHOR]