Search

The wrist is one of the most complex joints in our body, composed of eight bones. Therefore, measuring the angles of this intricate wrist movement can prove valuable in various fields such as sports analysis and rehabilitation. Textile stretch sensors can be easily produced by immersing an E-band in a SWCNT solution. The lightweight, cost-effective, and reproducible nature of textile stretch sensors makes them well suited for practical applications in clothing. In this paper, wrist angles were measured by attaching textile stretch sensors to an arm sleeve. Three sensors were utilized to measure all three axes of the wrist. Additionally, sensor precision was heightened through the utilization of the Multi-Layer Perceptron (MLP) technique, a subtype of deep learning. Rather than fixing the measurement values of each sensor to specific axes, we created an algorithm utilizing the coupling between sensors, allowing the measurement of wrist angles in three dimensions. Using this algorithm, the error angle of wrist angles measured with textile stretch sensors could be measured at less than 4.5°. This demonstrated higher accuracy compared to other soft sensors available for measuring wrist angles. [ABSTRACT FROM AUTHOR]

In order to solve the star identification problem in the lost space mode for scientific cameras with small fields of view and higher instruction magnitudes, this paper proposes a star identification algorithm based on a hybrid grid pattern. The application of a hybrid pattern generated by multi-calibration stars in the initial matching enables the position distribution features of neighboring stars around the main star to be more comprehensively described and avoids the interference of position noise and magnitude noise as much as possible. Moreover, calibration star filtering is adopted to eliminate incorrect candidates and pick the true matched navigation star from candidate stars in the initial match. Then, the reference star image is utilized to efficiently verify and determine the final identification results of the algorithm via the nearest principle. The performance of the proposed algorithm in simulation experiments shows that, when the position noise is 2 pixels, the identification rate of the algorithm is 96.43%, which is higher than that of the optimized grid algorithm by 2.21% and the grid algorithm by 4.05%; when the magnitude noise is 0.3 mag, the star identification rate of the algorithm is 96.45%, which is superior to the optimized grid algorithm by 2.03% and to the grid algorithm by 3.82%. In addition, in the actual star image test, star magnitude values of ≤12 mag can be successfully identified using the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an improved APF-GFARRT* (artificial potential field-guided fuzzy adaptive rapidly exploring random trees) algorithm based on APF (artificial potential field) guided sampling and fuzzy adaptive expansion is proposed to solve the problems of weak orientation and low search success rate when randomly expanding nodes using the RRT (rapidly exploring random trees) algorithm for disinfecting robots in the dense environment of disinfection operation. Considering the inherent randomness of tree growth in the RRT* algorithm, a combination of APF with RRT* is introduced to enhance the purposefulness of the sampling process. In addition, in the context of RRT* facing dense and restricted environments such as narrow passages, adaptive step-size adjustment is implemented using fuzzy control. It accelerates the algorithm's convergence and improves search efficiency in a specific area. The proposed algorithm is validated and analyzed in a specialized environment designed in MATLAB, and comparisons are made with existing path planning algorithms, including RRT, RRT*, and APF-RRT*. Experimental results show the excellent exploration speed of the improved algorithm, reducing the average initial path search time by about 46.52% compared to the other three algorithms. In addition, the improved algorithm exhibits faster convergence, significantly reducing the average iteration count and the average final path cost by about 10.01%. The algorithm's enhanced adaptability in unique environments is particularly noteworthy, increasing the chances of successfully finding paths and generating more rational and smoother paths than other algorithms. Experimental results validate the proposed algorithm as a practical and feasible solution for similar problems. [ABSTRACT FROM AUTHOR]

In substation lightning rod meter reading data taking, the classical object detection model is not suitable for deployment in substation monitoring hardware devices due to its large size, large number of parameters, and slow detection speed, while is difficult to balance detection accuracy and real-time requirements with the existing lightweight object detection model. To address this problem, this paper constructs a lightweight object detection algorithm, YOLOv5-Meter Reading Lighting (YOLOv5-MRL), based on the improved YOLOv5 model's speed while maintaining accuracy. Then, the YOLOv5s are pruned based on the convolutional kernel channel soft pruning algorithm, which greatly reduces the number of parameters in the YOLOv5-MRL model while maintaining a certain accuracy loss. Finally, in order to facilitate the dial reading, the dial external circle fitting method is proposed to calculate the dial reading using the circular angle algorithm. The experimental results on the self-built dataset show that the YOLOv5-MRL object detection model achieves a mean average precision of 96.9%, a detection speed of 5 ms/frame, and a model weight size of 5.5 MB, making it better than other advanced dial reading models. [ABSTRACT FROM AUTHOR]

The location-based smartphone service brings new development opportunities for seamless indoor/outdoor positioning. However, in complex scenarios such as cities, tunnels, overpasses, forests, etc., using only GNSS on smartphones cannot provide stable and reliable positioning results. Usually, additional sensors are needed to assist GNSS. This paper investigates the GNSS positioning algorithm assisted by pedestrian dead reckoning (PDR) in complex scenarios. First, we introduce a step detection algorithm based on the peak–valley of acceleration modulus, and the Weinberg model and the Mahony algorithm in PDR are used to estimate step length and heading. On this basis, we evaluated the performance of GNSS/PDR fusion positioning in an open scenario, a semiopen scenario, and a blocked scenario, respectively. Finally, we develop a GNSS/PDR real-time positioning software, called China University of Mining and Technology-POSitioning (CUMT-POS) version 1.0, on the Android 10 platform. By comparing GNSS solutions, PDR solutions, GNSS/PDR solutions, and real-time kinematic (RTK) solutions, we verify the potential auxiliary ability of PDR for GNSS positioning in complex environments, proving that multisource sensor fusion positioning significantly improves reliability and stability. Our research can help the realization of urban informatization and smart cities. [ABSTRACT FROM AUTHOR]

Researchers have explored various methods to fully exploit the all-weather characteristics of Synthetic aperture radar (SAR) images to achieve high-precision, real-time, computationally efficient, and easily deployable ship target detection models. These methods include Constant False Alarm Rate (CFAR) algorithms and deep learning approaches such as RCNN, YOLO, and SSD, among others. While these methods outperform traditional algorithms in SAR ship detection, challenges still exist in handling the arbitrary ship distributions and small target features in SAR remote sensing images. Existing models are complex, with a large number of parameters, hindering effective deployment. This paper introduces a YOLOv7 oriented bounding box SAR ship detection model (YOLOv7oSAR). The model employs a rotation box detection mechanism, uses the KLD loss function to enhance accuracy, and introduces a Bi-former attention mechanism to improve small target detection. By redesigning the network's width and depth and incorporating a lightweight P-ELAN structure, the model effectively reduces its size and computational requirements. The proposed model achieves high-precision detection results on the public RSDD dataset (94.8% offshore, 66.6% nearshore), and its generalization ability is validated on a custom dataset (94.2% overall detection accuracy). [ABSTRACT FROM AUTHOR]

Due to the issues of remote sensing object detection algorithms based on deep learning, such as a high number of network parameters, large model size, and high computational requirements, it is challenging to deploy them on small mobile devices. This paper proposes an extremely lightweight remote sensing aircraft object detection network based on the improved YOLOv5n. This network combines Shufflenet v2 and YOLOv5n, significantly reducing the network size while ensuring high detection accuracy. It substitutes the original CIoU and convolution with EIoU and deformable convolution, optimizing for the small-scale characteristics of aircraft objects and further accelerating convergence and improving regression accuracy. Additionally, a coordinate attention (CA) mechanism is introduced at the end of the backbone to focus on orientation perception and positional information. We conducted a series of experiments, comparing our method with networks like GhostNet, PP-LCNet, MobileNetV3, and MobileNetV3s, and performed detailed ablation studies. The experimental results on the Mar20 public dataset indicate that, compared to the original YOLOv5n network, our lightweight network has only about one-fifth of its parameter count, with only a slight decrease of 2.7% in mAP@0.5. At the same time, compared with other lightweight networks of the same magnitude, our network achieves an effective balance between detection accuracy and resource consumption such as memory and computing power, providing a novel solution for the implementation and hardware deployment of lightweight remote sensing object detection networks. [ABSTRACT FROM AUTHOR]

Deep learning, which is a dominating technique in artificial intelligence, has completely changed image understanding over the past decade. As a consequence, the sea ice extraction (SIE) problem has reached a new era. We present a comprehensive review of four important aspects of SIE, including algorithms, datasets, applications and future trends. Our review focuses on research published from 2016 to the present, with a specific focus on deep-learning-based approaches in the last five years. We divided all related algorithms into three categories, including the conventional image classification approach, the machine learning-based approach and deep-learning-based methods. We reviewed the accessible ice datasets including SAR-based datasets, the optical-based datasets and others. The applications are presented in four aspects including climate research, navigation, geographic information systems (GIS) production and others. This paper also provides insightful observations and inspiring future research directions. [ABSTRACT FROM AUTHOR]

In this paper, we compare the performances of two Butcher-based block hybrid methods for the numerical integration of initial value problems. We compare the condition numbers of the linear system of equations arising from both methods and the absolute errors of the solution obtained. The results of the numerical experiments illustrate that the better conditioned method outperformed its less conditioned counterpart based on the absolute errors. In addition, after applying our method on some examples, it was discovered that the absolute errors in this work were better than those of a recent study in the literature. Hence, we recommend this method for the numerical solution of stiff and non-stiff initial value problems. [ABSTRACT FROM AUTHOR]

Recommender systems are widely used in e-commerce, movies, music, social media, and other fields because of their personalized recommendation functions. The recommendation algorithm is used to capture user preferences, item characteristics, and the items that users are interested in are recommended to users. Matrix factorization is widely used in collaborative filtering algorithms because of its simplicity and efficiency. However, the simple dot-product method cannot establish a nonlinear relationship between user latent features and item latent features or make full use of their personalized information. The model of a neural network combined with an attention mechanism can effectively establish a nonlinear relationship between the potential features of users and items and improve the recommendation accuracy of the model. However, it is difficult for the general attention mechanism algorithm to solve the problem of attention interaction when the number of features between the users and items is not the same. To solve the above problems, this paper proposes an attention interaction matrix factorization (AIMF) model. The AIMF model adopts a symmetric structure using MLP calculation. This structure can simultaneously extract the nonlinear features of user latent features and item latent features, thus reducing the computation time of the model. In addition, an improved attention algorithm named slide-attention is included in the model. The algorithm uses the sliding query method to obtain the user's attention to the latent features of the item and solves the interaction problem among different dimensions of the user, and the latent features of the item. [ABSTRACT FROM AUTHOR]

Due to its very desirable properties, Chebyshev polynomials are often used in the design of public key cryptographic systems. This paper discretizes the Chebyshev mapping, generalizes the properties of Chebyshev polynomials, and proposes an improved public key encryption algorithm based on Chebyshev chaotic mapping and RSA, i.e., C R P K C − K i . This algorithm introduces alternative multiplication coefficients K i , the selection of which is determined by the size of T r T d x m o d   N = T d T r x m o d   N , and the specific value selection rules are shared secrets among participants, overcoming the shortcomings of previous schemes. In the key generation and encryption/decryption stages, more complex intermediate processes are used to achieve higher algorithm complexity, making the algorithm more robust against ordinary attacks. The algorithm is also compared with other RSA-based algorithms to demonstrate its effectiveness in terms of performance and security. [ABSTRACT FROM AUTHOR]

The No Free Lunch Theorem tells us that no algorithm can beat other algorithms on all types of problems. The algorithm selection structure is proposed to select the most suitable algorithm from a set of algorithms for an unknown optimization problem. This paper introduces an innovative algorithm selection approach called the CNN-HT, which is a two-stage algorithm selection framework. In the first stage, a Convolutional Neural Network (CNN) is employed to classify problems. In the second stage, the Hypothesis Testing (HT) technique is used to suggest the best-performing algorithm based on the statistical analysis of the performance metric of algorithms that address various problem categories. The two-stage approach can adapt to different algorithm combinations without the need to retrain the entire model, and modifications can be made in the second stage only, which is an improvement of one-stage approaches. To provide a more general structure for the classification model, we adopt Exploratory Landscape Analysis (ELA) features of the problem as input and utilize feature selection techniques to reduce the redundant ones. In problem classification, the average accuracy of classifying problems using CNN is 96%, which demonstrates the advantages of CNN compared to Random Forest and Support Vector Machines. After feature selection, the accuracy increases to 98.8%, further improving the classification performance while reducing the computational cost. This demonstrates the effectiveness of the first stage of the CNN-HT method, which provides a basis for algorithm selection. In the experiments, CNN-HT shows the advantages of the second stage algorithm as well as good performance with better average rankings in different algorithm combinations compared to the individual algorithms and another algorithm combination approach. [ABSTRACT FROM AUTHOR]

Combined SINS/GPS navigation systems have been widely used. However, when the traditional combined SINS/GPS navigation system travels between tall buildings, in the shade of trees, or through tunnels, the GPS encounters frequent signal blocking, which leads to the interruption of GPS signals, and as a result, the combined SINS/GPS-based navigation method degenerates into a pure inertial guidance system, which will lead to the accumulation of navigation errors. In this paper, an adaptive Kalman filtering algorithm based on polynomial fitting and a Taylor expansion is proposed. Through the navigation information output from the inertial guidance system, the polynomial interpolation method is used to construct the velocity equation and position equation of the carrier, and then the Taylor expansion is used to construct the virtual measurement at the moment of the GPS signal interruption, which can make up for the impact of the lack of measurement information on the combined SINS/GPS navigation system when the GPS signal is interrupted. The results of computer simulation experiments and road measurement tests based on the loosely combined SINS/GPS navigation system show that when the carrier faces a GPS signal interruption situation, compared with a combined SINS/GPS navigation algorithm that does not take any rescue measures, our proposed combined SINS/GPS navigation algorithm possesses a higher accuracy in the attitude angle estimation, a higher accuracy in the velocity estimation, and a higher accuracy in the positional localization, and the system possesses higher stability. [ABSTRACT FROM AUTHOR]

The SAND algorithm is a family of lightweight AND-RX block ciphers released by DCC in 2022. Our research focuses on assessing the security of SAND with a quantum computation model. This paper presents the first quantum implementation of SAND (including two versions of SAND, SAND-64 and SAND-128). Considering the depth-times-width metric, the quantum circuit implementation of the SAND algorithm demonstrates a relatively lower consumption of quantum resources than that of the quantum implementations of existing lightweight algorithms. A generalized Grover-based brute-force attack framework was implemented and employed to perform attacks on two versions of the SAND algorithm. This framework utilized the g-database algorithm, which considered different plaintext–ciphertext pairs in a unified manner, reducing quantum resource consumption. Our findings indicate that the SAND-128 algorithm achieved the NIST security level I, while the SAND-64 algorithm fell short of meeting the requirements of security level I. [ABSTRACT FROM AUTHOR]

Malaria is one of the major global health threats. Microscopic examination has been designated as the "gold standard" for malaria detection by the World Health Organization. However, it heavily relies on the experience of doctors, resulting in long diagnosis time, low efficiency, and a high risk of missed or misdiagnosed cases. To alleviate the pressure on healthcare workers and achieve automated malaria detection, numerous target detection models have been applied to the blood smear examination for malaria cells. This paper introduces the multi-level attention split network (MAS-Net) that improves the overall detection performance by addressing the issues of information loss for small targets and mismatch between the detection receptive field and target size. Therefore, we propose the split contextual attention structure (SPCot), which fully utilizes contextual information and avoids excessive channel compression operations, reducing information loss and improving the overall detection performance of malaria cells. In the shallow detection layer, we introduce the multi-scale receptive field detection head (MRFH), which better matches targets of different scales and provides a better detection receptive field, thus enhancing the performance of malaria cell detection. On the NLM—Malaria Dataset provided by the National Institutes of Health, the improved model achieves an average accuracy of 75.9% in the public dataset of Plasmodium vivax (malaria)-infected human blood smear. Considering the practical application of the model, we introduce the Performance-aware Approximation of Global Channel Pruning (PAGCP) to compress the model size while sacrificing a small amount of accuracy. Compared to other state-of-the-art (SOTA) methods, the proposed MAS-Net achieves competitive results. [ABSTRACT FROM AUTHOR]

This paper presents a practical contamination detection system for camera lenses using image analysis with deep learning. The proposed system can detect contamination in camera digital images through contamination learning utilizing deep learning, and it aims to prevent performance degradation of intelligent vision systems due to lens contamination in cameras. This system is based on the object detection algorithm YOLO (v5n, v5s, v5m, v5l, and v5x), which is trained with 4000 images captured under different lighting and background conditions. The trained models showed that the average precision improves as the algorithm size increases, especially for YOLOv5x, which showed excellent efficiency in detecting droplet contamination within 23 ms. They also achieved an average precision (mAP@0.5) of 87.46%, recall (mAP@0.5:0.95) of 51.90%, precision of 90.28%, recall of 81.47%, and F1 score of 85.64%. As a proof of concept, we demonstrated the identification and removal of contamination on camera lenses by integrating a contamination detection system and a transparent heater-based cleaning system. The proposed system is anticipated to be applied to autonomous driving systems, public safety surveillance cameras, environmental monitoring drones, etc., to increase operational safety and reliability. [ABSTRACT FROM AUTHOR]

Community structure is a significant characteristic of complex networks, and community detection has valuable applications in network structure analysis. Non-negative matrix factorization (NMF) is a key set of algorithms used to solve the community detection issue. Nevertheless, the localization of feature vectors in the adjacency matrix, which represents the characteristics of complex network structures, frequently leads to the failure of NMF-based approaches when the data matrix has a low density. This paper presents a novel algorithm for detecting sparse network communities using non-negative matrix factorization (NMF). The algorithm utilizes local feature vectors to represent the original network topological features and learns regularization matrices. The resulting feature matrices effectively reveal the global structure of the data matrix, demonstrating enhanced feature expression capabilities. The regularized data matrix resolves the issue of localized feature vectors caused by sparsity or noise, in contrast to the adjacency matrix. The approach has superior accuracy in detecting community structures compared to standard NMF-based community detection algorithms, as evidenced by experimental findings on both simulated and real-world networks. [ABSTRACT FROM AUTHOR]

Fault detection and localization are vital for ensuring the stability of data center networks (DCNs). Specifically, adaptive fault diagnosis is deemed a fundamental technology in achieving the fault tolerance of systems. The highly scalable data center network (HSDC) is a promising structure of server-centric DCNs, as it exhibits the capacity for incremental scalability, coupled with the assurance of low cost and energy consumption, low diameter, and high bisection width. In this paper, we first determine that both the connectivity and diagnosability of the m-dimensional complete HSDC, denoted by H S D C m (m) , are m. Further, we propose an efficient adaptive fault diagnosis algorithm to diagnose an H S D C m (m) within three test rounds, and at most N + 4 m (m − 2) tests with m ≥ 3 (resp. at most nine tests with m = 2 ), where N = m · 2 m is the total number of nodes in H S D C m (m) . Our experimental outcomes demonstrate that this diagnosis scheme of HSDC can achieve complete diagnosis and significantly reduce the number of required tests. [ABSTRACT FROM AUTHOR]

Visual-inertial odometry (VIO) algorithms, fusing various features such as points and lines, are able to improve their performance in challenging scenes while the running time severely increases. In this paper, we propose a novel lightweight point–line visual–inertial odometry algorithm to solve this problem, called LRPL-VIO. Firstly, a fast line matching method is proposed based on the assumption that the photometric values of endpoints and midpoints are invariant between consecutive frames, which greatly reduces the time consumption of the front end. Then, an efficient filter-based state estimation framework is designed to finish information fusion (point, line, and inertial). Fresh measurements of line features with good tracking quality are selected for state estimation using a unique feature selection scheme, which improves the efficiency of the proposed algorithm. Finally, validation experiments are conducted on public datasets and in real-world tests to evaluate the performance of LRPL-VIO and the results show that we outperform other state-of-the-art algorithms especially in terms of speed and robustness. [ABSTRACT FROM AUTHOR]

The advancement of machine learning in industrial applications has necessitated the development of tailored solutions to address specific challenges, particularly in multi-class classification tasks. This study delves into the customization of loss functions within the eXtreme Gradient Boosting (XGBoost) algorithm, which is a critical step in enhancing the algorithm's performance for specific applications. Our research is motivated by the need for precision and efficiency in the industrial domain, where the implications of misclassification can be substantial. We focus on the drill-wear analysis of melamine-faced chipboard, a common material in furniture production, to demonstrate the impact of custom loss functions. The paper explores several variants of Weighted Softmax Loss Functions, including Edge Penalty and Adaptive Weighted Softmax Loss, to address the challenges of class imbalance and the heightened importance of accurately classifying edge classes. Our findings reveal that these custom loss functions significantly reduce critical errors in classification without compromising the overall accuracy of the model. This research not only contributes to the field of industrial machine learning by providing a nuanced approach to loss function customization but also underscores the importance of context-specific adaptations in machine learning algorithms. The results showcase the potential of tailored loss functions in balancing precision and efficiency, ensuring reliable and effective machine learning solutions in industrial settings. [ABSTRACT FROM AUTHOR]

The reliability and stability of differential protection in power transformers could be threatened by several types of inferences, including magnetizing inrush currents, current transformer saturation, and overexcitation from external faults. The robustness of deep learning applications employed for power system protection in recent years has offered solutions to deal with several disturbances. This paper presents a method for detecting internal faults in power transformers occurring simultaneously with inrush currents. It involves utilizing a data window (DW) and stacked denoising autoencoders. Unlike the conventional method, the proposed scheme requires no thresholds to discriminate internal faults and inrush currents. The performance of the algorithm was verified using fault data from a typical Korean 154 kV distribution substation. Inrush current variation and internal faults were simulated and generated in PSCAD/EMTDC, considering various parameters that affect an inrush current. The results indicate that the proposed scheme can detect the appearance of internal faults occurring simultaneously with an inrush current. Moreover, it shows promising results compared to the prevailing methods, ensuring the superiority of the proposed method. From sample N–3, the proposed DNN demonstrates accurate discrimination between internal faults and inrush currents, achieving accuracy, sensitivity, and precision values of 100%. [ABSTRACT FROM AUTHOR]

In this study, the inductor optimization design is performed by applying the Pareto optimization technique. As environmental problems emerge, the electric vehicle market is expanding, and accordingly, volume reduction and high efficiency of the onboard charger (OBC) are required. An OBC consists of a PFC stage and a DC/DC stage. The inductor is a major component in a converter and affects the volume and efficiency of the entire converter system. However, reducing the volume of the inductor leads to an increase in loss due to an increase in the change in flux density. Therefore, it is important to derive a suitable design for the target between the two parameters in the trade-off of loss and volume. This paper introduces the optimal design algorithm for boosting inductors of PFC converters in terms of volume and loss. Volume and loss are difficult to compare with each other, making it difficult to set weights. Therefore, Pareto optimization was applied which can be selected according to the needs and purposes of the decision-maker, without weighting as an optimization method. Through a series of procedures of applying Pareto optimization to the inductor design, several optimal inductor designs can be derived. At this time, the optimal designs become a set of designs in which the loss does not decrease without an increase in volume, or the volume does not decrease without an increase in loss. A designer can select a design with an appropriate volume and loss that meets the purpose of the design or preference. Therefore, through the proposed method, the inductor can be flexibly designed according to the target of the application. The proposed algorithm is applied to the interleaved totem-pole bridgeless boost PFC converter, to review its effectiveness. As a result, several inductor designs are derived in the search space, and various optimal designs are visualized through the Pareto Frontier. This facilitates comparative analysis of various inductor designs and helps designers select reasonable inductors. The validity was verified by selecting one of the obtained optimal inductor designs and driving the experiment with the resulting inductor. [ABSTRACT FROM AUTHOR]

Vector control of an induction machine (IM) is typically performed by using cascade control structures with conventional linear proportional–integral (PI) controllers, the inner loop being designed for current control and the outer loop for rotor flux and speed control. In this paper, starting with the dq model of the IM, advanced control algorithms are proposed for the two control loops of the cascade structure. For the current inner loop, after the decoupling of the two dq currents, predictive control algorithms are employed to independently control the currents, considering the constraints imposed by the electrical signal physics limitations. Since the outer loop has a nonlinear affine multivariable plant model, a homotopy-based variant of feedback linearization is used to obtain a nonsingular decoupling matrix of the feedback transformation even when the rotor flux is zero at the start-up of the motor. During the continuous variation in the homotopy parameter, the plant model is variable and, for this reason, model-free algorithms are used to control the flux and speed of the IM due to their capabilities to manage complex dynamics from data without requiring knowledge of the plant model. The performances of the proposed cascade control strategy with advanced algorithms in the two loops were tested by simulation and compared with those obtained with conventional PI controllers, resulting in better dynamic behavior for predictive and model-free control. [ABSTRACT FROM AUTHOR]

A novel compressive sensing (CS) synthetic-aperture radar (SAR) called AgileSAR has been proposed to increase swath width for sparse scenes while preserving azimuthal resolution. AgileSAR overcomes the limitation of the Nyquist sampling theorem so that it has a small amount of data and low system complexity. However, traditional CS optimization-based algorithms suffer from manual tuning and pre-definition of optimization parameters, and they generally involve high time and computational complexity for AgileSAR imaging. To address these issues, a pseudo- L 0 -norm fast iterative shrinkage algorithm network (pseudo- L 0 -norm FISTA-net) is proposed for AgileSAR imaging via the deep unfolding network in this paper. Firstly, a pseudo- L 0 -norm regularization model is built by taking an approximately fair penalization rule based on Bayesian estimation. Then, we unfold the operation process of FISTA into a data-driven deep network to solve the pseudo- L 0 -norm regularization model. The network's parameters are automatically learned, and the learned network significantly increases imaging speed, so that it can improve the accuracy and efficiency of AgileSAR imaging. In addition, the nonlinearly sparsifying transform can learn more target details than the traditional sparsifying transform. Finally, the simulated and data experiments demonstrate the superiority and efficiency of the pseudo- L 0 -norm FISTA-net for AgileSAR imaging. [ABSTRACT FROM AUTHOR]

Spatiotemporally mapping winter wheat is imperative for informing and shaping global food security policies. Traditional mapping methods heavily rely on sufficient and reliable samples obtained through labor-intensive fieldwork and manual sample collection. However, these methods are time-consuming, costly, and lack timely and continuous data collection. To address these challenges and fully leverage remote sensing big data and cloud computing platforms like Google Earth Engine (GEE), this paper developed an algorithm for Auto-Generating Winter Wheat Samples for mapping (AGWWS). The AGWWS utilizes historical samples to determine the optimal migration threshold by measuring Spectral Angle Distance (SAD), Euclidean Distance (ED), and Near-Infrared band Difference Index (NIRDI). This facilitates the auto-generation of winter wheat sample sets for the years 2000, 2005, 2010, 2015, and 2021. Approximately two-thirds of the samples were allocated for training, with the remaining one-third used for validating the mapping method, employing the One-Class Support Vector Machine (OCSVM). The Huang–Huai–Hai (HHH) Plain, a major winter wheat production region, was selected to perform the algorithm and subsequent analysis on. Different combinations of the hyper-parameters, gamma and nu, of the OCSVM based on the Gaussian Radial Basis Function Kernel were tested for each year. Following correlation analysis between the winter wheat area derived from the generated maps and the national statistical dataset at the city level, the map with the highest corresponding R2 was chosen as the AGWWS map for each year (0.77, 0.77, 0.80, 0.86, and 0.87 for 2000, 2005, 2010, 2015, and 2021, respectively). The AGWWS maps ultimately achieved an average Overall Accuracy of 81.65%. The study then explores the Non-Grain Production of Winter Wheat (NGPOWW) by analyzing winter wheat change maps from 2000–2005, 2005–2010, 2005–2010, and 2015–2021 in the HHH Plain. Despite an overall increase in the total planted area of winter wheat, the NGPOWW phenomena has led to concerning winter wheat planting marginalization. Compensatory winter wheat areas are notably situated in mountainous and suburban cultivated lands with low qualities. Consequently, despite the apparent expansion in planted areas, winter wheat production is anticipated to be adversely affected. The findings highlight the necessity for improved cultivated land protection policies monitoring the land quality of the compensation and setting strict quota limits on occupations. [ABSTRACT FROM AUTHOR]

In this paper, we present an innovative inertial navigation system (INS)/celestial navigation system (CNS)/scene-matching navigation (SMN) adaptive integrated navigation algorithm designed to achieve prolonged and highly precise navigation in sea areas. The algorithm establishes the structure of the INS/CNS/SMN integrated navigation system. To ensure the availability of CNS in the Nanhai Sea (South China Sea) area, a cloud and fog model is meticulously constructed. Three distinct types of sea area landmarks are defined, and an automated classification model for sea area landmarks, employing support vector machines (SVM), is developed. Corresponding matching methods and strategies for these landmarks are also delineated. Concurrently, the observable probability of each landmark is computed to generate a probability cloud, representing the usability of sea area landmarks. The proposed INS/CNS/SMN adaptive integrated navigation algorithm is simulated and validated across varied altitudes and trajectories in the sea area. The results show that CNS and SMN can dynamically assist INS in achieving prolonged and highly precise navigation. [ABSTRACT FROM AUTHOR]

In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions. Firstly, we show that the problem is NP-hard. Then, we show that directed co-graphs are fully characterized by eight forbidden structures, each having, at most, six edges. Based on the symmetry properties and several refined observations, we develop a branching algorithm with a running time of O (2.733 k) , which is significantly more efficient compared to the brute-force algorithm, which has a running time of O (6 k) . [ABSTRACT FROM AUTHOR]

There are a lot of multi-objective optimization problems (MOPs) in the real world, and many multi-objective evolutionary algorithms (MOEAs) have been presented to solve MOPs. However, obtaining non-dominated solutions that trade off convergence and diversity remains a major challenge for a MOEA. To solve this problem, this paper designs an efficient multi-objective sine cosine algorithm based on a competitive mechanism (CMOSCA). In the CMOSCA, the ranking relies on non-dominated sorting, and the crowding distance rank is utilized to choose the outstanding agents, which are employed to guide the evolution of the SCA. Furthermore, a competitive mechanism stemming from the shift-based density estimation approach is adopted to devise a new position updating operator for creating offspring agents. In each competition, two agents are randomly selected from the outstanding agents, and the winner of the competition is integrated into the position update scheme of the SCA. The performance of our proposed CMOSCA was first verified on three benchmark suites (i.e., DTLZ, WFG, and ZDT) with diversity characteristics and compared with several MOEAs. The experimental results indicated that the CMOSCA can obtain a Pareto-optimal front with better convergence and diversity. Finally, the CMOSCA was applied to deal with several engineering design problems taken from the literature, and the statistical results demonstrated that the CMOSCA is an efficient and effective approach for engineering design problems. [ABSTRACT FROM AUTHOR]

Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although metaheuristics have successfully been used for more than 20 years, performing rapid and high-quality parameter control is still a main concern. For instance, deciding the proper population size yielding a good balance between quality of results and computing time is constantly a hard task, even more so in the presence of an unexplored optimization problem. In this paper, we propose a self-adaptive strategy based on the on-line population balance, which aims for improvements in the performance and search process on population-based algorithms. The design behind the proposed approach relies on three different components. Firstly, an optimization-based component which defines all metaheuristic tasks related to carry out the resolution of the optimization problems. Secondly, a learning-based component focused on transforming dynamic data into knowledge in order to influence the search in the solution space. Thirdly, a probabilistic-based selector component is designed to dynamically adjust the population. We illustrate an extensive experimental process on large instance sets from three well-known discrete optimization problems: Manufacturing Cell Design Problem, Set covering Problem, and Multidimensional Knapsack Problem. The proposed approach is able to compete against classic, autonomous, as well as IRace-tuned metaheuristics, yielding interesting results and potential future work regarding dynamically adjusting the number of solutions interacting on different times within the search process. [ABSTRACT FROM AUTHOR]

In order to realize the unsupervised segmentation of subtle defect images on the surface of small magnetic rings and improve the segmentation accuracy and computational efficiency, here, an adaptive threshold segmentation method is proposed based on the improved multi-scale and multi-directional 2D-Gabor filter bank. Firstly, the improved multi-scale and multi-directional 2D-Gabor filter bank was used to filter and reduce the noise on the defect image, suppress the noise pollution inside the target area and the background area, and enhance the difference between the magnetic ring defect and the background. Secondly, this study analyzed the grayscale statistical characteristics of the processed image; the segmentation threshold was constructed according to the gray statistical law of the image; and the adaptive segmentation of subtle defect images on the surface of small magnetic rings was realized. Finally, a classifier based on a BP neural network is designed to classify the scar images and crack images determined by different threshold segmentation methods. The classification accuracies of the iterative method, the OTSU method, the maximum entropy method, and the adaptive threshold segmentation method are, respectively, 85%, 87.5%, 95%, and 97.5%. The adaptive threshold segmentation method proposed in this paper has the highest classification accuracy. Through verification and comparison, the proposed algorithm can segment defects quickly and accurately and suppress noise interference effectively. It is better than other traditional image threshold segmentation methods, validated by both segmentation accuracy and computational efficiency. At the same time, the real-time performance of our algorithm was performed on the advanced SEED-DVS8168 platform. [ABSTRACT FROM AUTHOR]

The rapid development of the logistics industry poses significant challenges to the sorting work within this sector. The fast and precise identification of moving express parcels holds immense significance for the performance of logistics sorting systems. This paper proposes a motion express parcel positioning algorithm that combines traditional vision and AI-based vision. In the traditional vision aspect, we employ a brightness-based traditional visual parcel detection algorithm. In the AI vision aspect, we introduce a Convolutional Block Attention Module (CBAM) and Focal-EIoU to enhance YOLOv5, improving the model's recall rate and robustness. Additionally, we adopt an Optimal Transport Assignment (OTA) label assignment strategy to provide a training dataset based on global optimality for the model training phase. Our experimental results demonstrate that our modified AI model surpasses traditional algorithms in both parcel recognition accuracy and inference speed. The combined approach of traditional vision and AI vision in the motion express parcel positioning algorithm proves applicable for practical logistics sorting systems. [ABSTRACT FROM AUTHOR]

In the realm of sensorless control for a permanent magnet synchronous motor (PMSM), the flux observer algorithm is widely recognized. However, the estimation accuracy of rotor position is adversely impacted by the interference from DC bias and high-order harmonics. To address these issues, an advanced flux observation method, second-order generalized integrator flux observer extend (SOGIFO-X), is introduced in this paper. The study begins with a theoretical analysis to establish the relationship between flux observation error and rotor position error. The SOGIFO-X method, developed in this study, is compared with traditional methods such as the Low Pass Filter (LPF) and second-order generalized integrator flux observer (SOGIFO), employing mathematical rigor and Bode plot analysis. The emphasis is on the methodology and the general performance improvements SOGIFO-X offers over conventional methods. Simulations and experiments were conducted to assess the impact of SOGIFO-X on the steady-state and dynamic performances of sensorless control. Findings indicate that SOGIFO-X demonstrates significant enhancements in terms of reducing the reduced flux observation error, contributing to the advancement of position estimation accuracy and sensorless motor control technology. [ABSTRACT FROM AUTHOR]

Indoor localization of a mobile target represents a prominent application within wireless sensor network (WSN), showcasing significant values and scientific interest. Interference, obstacles, and energy consumption are critical challenges for indoor applications and battery replacements. A proposed tracking system deals with several factors such as latency, energy consumption, and accuracy presenting an innovative solution for the mobile localization application. In this paper, a novel algorithm introduces a self-localization algorithm for mobile targets using the wake-up media access control (MAC) protocol. The developed tracking application is based on the trilateration technique with received signal strength indication (RSSI) measurements. Simulations are implemented in the objective modular network testbed in C++ (OMNeT++) discrete event simulator using the C++ programming language, and the RSSI values introduced are based on real indoor measurements. In addition, a determination approach for finding the optimal parameters of RSSI is assigned to implement for the simulation parameters. Simulation results show a significant reduction in power consumption and exceptional accuracy, with an average error of 1.91 m in 90% of cases. This method allows the optimization of overall energy consumption, which consumes only 2.69% during the localization of 100 different positions. [ABSTRACT FROM AUTHOR]

Localization of wireless transmitters is traditionally done using Radio Frequency (RF) sensors that measure the propagation delays between the transmitter and a set of anchor receivers. One of the major challenges of wireless localization systems is the need for anchor nodes to be time-synchronized to achieve accurate localization of a target node. Using a reference transmitter is an efficient way to synchronize the anchor nodes Over-The-Air (OTA), but such algorithms require multiple periodic messages to achieve tight synchronization. In this paper, we propose a new synchronization method that only requires a single message from a reference transmitter. The main idea is to use the Carrier Frequency Offset (CFO) from the reference node, alongside the Time of Arrival (ToA) of the reference node messages, to achieve tight synchronization. The ToA allows the anchor nodes to compensate for their absolute time offset, and the CFO allows the anchor nodes to compensate for their local oscillator drift. Additionally, using the CFO of the messages sent by the reference nodes and the target nodes also allow us to estimate the speed of the targets. The error of the proposed algorithm is derived analytically and is validated through controlled laboratory experiments. Finally, the algorithm is validated by realistic outdoor vehicular measurements with a software-defined radio testbed. [ABSTRACT FROM AUTHOR]

Ship fire may result in significant damage to its structure and large economic loss. Hence, the prompt identification of fires is essential in order to provide prompt reactions and effective mitigation strategies. However, conventional detection systems exhibit limited efficacy and accuracy in detecting targets, which has been mostly attributed to limitations imposed by distance constraints and the motion of ships. Although the development of deep learning algorithms provides a potential solution, the computational complexity of ship fire detection algorithm pose significant challenges. To solve this, this paper proposes a lightweight ship fire detection algorithm based on YOLOv8n. Initially, a dataset, including more than 4000 unduplicated images and their labels, is established before training. In order to ensure the performance of algorithms, both fire inside ship rooms and also fire on board are considered. Then after tests, YOLOv8n is selected as the model with the best performance and fastest speed from among several advanced object detection algorithms. GhostnetV2-C2F is then inserted in the backbone of the algorithm for long-range attention with inexpensive operation. In addition, spatial and channel reconstruction convolution (SCConv) is used to reduce redundant features with significantly lower complexity and computational costs for real-time ship fire detection. For the neck part, omni-dimensional dynamic convolution is used for the multi-dimensional attention mechanism, which also lowers the parameters. After these improvements, a lighter and more accurate YOLOv8n algorithm, called Ship-Fire Net, was proposed. The proposed method exceeds 0.93, both in precision and recall for fire and smoke detection in ships. In addition, the mAP@0.5 reaches about 0.9. Despite the improvement in accuracy, Ship-Fire Net also has fewer parameters and lower FLOPs compared to the original, which accelerates its detection speed. The FPS of Ship-Fire Net also reaches 286, which is helpful for real-time ship fire monitoring. [ABSTRACT FROM AUTHOR]

In this paper, a fractional-order control method based on the twin-delayed deep deterministic policy gradient (TD3) algorithm in reinforcement learning is proposed. A fractional-order disturbance observer is designed to estimate the disturbances, and the radial basis function network is selected to approximate system uncertainties in the system. Then, a fractional-order sliding-mode controller is constructed to control the system, and the parameters of the controller are tuned using the TD3 algorithm, which can optimize the control effect. The results show that the fractional-order control method based on the TD3 algorithm can not only improve the closed-loop system performance under different operating conditions but also enhance the signal tracking capability. [ABSTRACT FROM AUTHOR]

In this paper, we propose a secure image encryption method using compressive sensing (CS) and a two-dimensional linear canonical transform (2D LCT). First, the SHA256 of the source image is used to generate encryption security keys. As a result, the suggested technique is able to resist selected plaintext attacks and is highly sensitive to plain images. CS simultaneously encrypts and compresses a plain image. Using a starting value correlated with the sum of the image pixels, the Mersenne Twister (MT) is used to control a measurement matrix in compressive sensing. Then, the scrambled image is permuted by Lorenz's hyper-chaotic systems and encoded by chaotic and random phase masks in the 2D LCT domain. In this case, chaotic systems increase the output complexity, and the independent parameters of the 2D LCT expand the key space of the suggested technique. Ultimately, diffusion based on addition and modulus operations yields a cipher-text image. Simulations showed that this cryptosystem was able to withstand common attacks and had adequate cryptographic features. [ABSTRACT FROM AUTHOR]

To solve the shortcomings of the Otsu image segmentation algorithm based on traditional Moth–Flame Optimization (MFO), such as its poor segmentation accuracy, slow convergence, and tendency to fall into local optimum, this paper proposes fractional order moth–flame optimization with the Otsu image segmentation algorithm. Utilizing the advantages of memorability and heritability in fractional order differentiation, the position updating of moths is controlled by fractional order. Using the adaptive fractional order, the positions of moths are used to adjust the fractional order adaptively to improve the convergence speed. Combining the improved MFO algorithm with the two-dimensional Otsu algorithm, the optimization objective function is achieved by using its dispersion matrix. The experimental results indicate that, compared with traditional MFO, the convergence rate of the proposed algorithm is improved by about 74.62%. Furthermore, it has better segmentation accuracy and a higher fitness value than traditional MFO. [ABSTRACT FROM AUTHOR]

In this paper, a discrete-time fractional flocking control algorithm of multi-agent systems is put forward to address the slow convergence issue of multi-agent systems. Firstly, by introducing Grünwald-Letnikov (G-L) fractional derivatives, the algorithm allows agents to utilize historical information when updating their states. Secondly, based on the Lyapunov stability theory, the convergence of the algorithm is proven. Finally, simulations are conducted to verify the effectiveness of the proposed algorithm. Comparisons are made between the proposed algorithm and other methods. The results show that the proposed algorithm can effectively improve the convergence speed of multi-agent systems. [ABSTRACT FROM AUTHOR]

This paper introduces a new fast image encryption scheme based on a chaotic system and cyclic shift in the integer wavelet domain. In order to increase the effectiveness and security of encryption, we propose a new diffusion scheme by using bidirectional diffusion and cyclic shift and apply it to our encryption scheme. First, a two-level integer wavelet transform is used to split the plaintext picture into four low-frequency components. Second, we use random sequences generated by Chen's hyper-chaotic system to scramble four low-frequency components. The initial value is determined by Secure Hash Algorithm 256-bit (SHA256) and user-defined parameters, which increases the plaintext sensitivity. Then, the new diffusion scheme is applied to the matrix containing most of the information and matrices are transformed by a one-level inverse integer wavelet. Finally, to create the ciphertext image, the diffused matrices are subjected to the one-level inverse integer wavelet transform. In the simulation part, we examine the suggested algorithm's encryption impact. The findings demonstrate that the suggested technique has a sufficient key space and can successfully fend off common attacks. [ABSTRACT FROM AUTHOR]

This paper introduces a fault location technique for multi-section combined transmission lines, utilizing unsynchronized fault record data. The approach determines the intersection points of the voltage magnitudes computed using the fault current and voltage records of each terminal and the constant line parameters of each section. Finally, the real fault location is identified based on the calculated inverse angle of equivalent impedance. To evaluate the performance of the proposed algorithm, a three-section combined transmission line is constructed using the PSCAD/EMTDC software version 5.0.0, and various fault scenarios are simulated and tested employing the proposed algorithm. The results indicate that the proposed algorithm is applicable to various types of faults in a multi-section combined transmission line; the estimations are accurate. [ABSTRACT FROM AUTHOR]

A trend in the development of spaceborne Synthetic Aperture Radar (SAR) technology is the shift from a single-satellite repeated observation mode to a multi-satellite collaborative observation mode. However, current multi-satellite collaborative geolocation algorithms face challenges, such as geometric model mismatch and poor baseline estimation accuracy, arising from highly dynamic changes among multi-satellites. This paper introduces a high-precision and efficient geolocation algorithm for a spaceborne bistatic interferometric SAR (BiInSAR) system based on an improved range–Doppler (IRD) model. The proposed algorithm encompasses three key contributions. Firstly, a comprehensive description of the spatial baseline geometric model unique to the bistatic configuration is provided, with a specific focus on deriving the perpendicular baseline expression. Secondly, IRD geolocation functions are established to meet the specific requirements of the bistatic configuration. Then, a novel BiInSAR geolocation algorithm based on the IRD's functions is proposed, which can significantly improve the target geolocation accuracy by modifying the range–Doppler equation to suit the bistatic configuration. Meanwhile, a low-coupling parallel calculation method is proposed, which can improve the calculation speed by two to three times. Finally, the accuracy and efficiency of the algorithm are demonstrated using experimental data acquired by the TH-2 satellite, which is China's first spaceborne BiInSAR system. The experimental results prove that the IRD algorithm exhibits geolocation accuracy with an average error of less than 1 m and a standard deviation of less than 2.5 m while maintaining computational efficiency at a calculation speed of 1,429,678 pixels per second. [ABSTRACT FROM AUTHOR]

The application of intelligent mobile robots in agriculture has emerged as a new research frontier, with the integration of autonomous navigation technology and intelligent agricultural robots being the key to the widespread adoption of smart agricultural machinery. This paper investigates comprehensive coverage path planning for tracked lawnmowers within orchard environments and addresses challenges related to task allocation and battery life. Firstly, in this study, the motion model of the tracked lawnmower was initially simplified based on assumptions about the orchard environment. Force analyses were conducted on each of its motion mechanisms. For the known orchard environment, a grid-based mapping technique was employed to model the orchard environment. Then, in order to improve the algorithm speed and reduce the number of turns during the lawnmower's traversal, the A* search algorithm was enhanced by combining the method of robot cluster traversal in the orchard environment. Finally, the improved method was simulated and verified in the MATLAB platform to investigate the influence of the number of lawnmower clusters on the path planning in the connected and non-connected orchards. Furthermore, two sets of on-site field trials were meticulously designed to validate the reliability, practicality, and efficacy of the simulation experiments. [ABSTRACT FROM AUTHOR]

Three-dimensional models, reconstructed from real-life objects, are extensively used in virtual and mixed reality technologies. In this paper we propose an approach to 3D model reconstruction via inverse procedural modeling and describe two variants of this approach. The first option is to fit a set of input parameters using a genetic algorithm. The second option allows us to significantly improve precision by using gradients within the memetic algorithm, differentiable rendering, and differentiable procedural generators. We demonstrate the results of our work on different models, including trees, which are complex objects that most existing methods cannot reconstruct. In our work, we see two main contributions. First, we propose a method to join differentiable rendering and inverse procedural modeling. This gives us the ability to reconstruct 3D models more accurately than existing approaches when few input images are available, even for a single image. Second, we combine both differentiable and non-differentiable procedural generators into a single framework that allows us to apply inverse procedural modeling to fairly complex generators. We show that both variants of our approach can be useful: the differentiable one is more precise but puts limitations on the procedural generator, while the one based on genetic algorithms can be used with any existing generator. The proposed approach uses information about the symmetry and structure of the object to achieve high-quality reconstruction from a single image. [ABSTRACT FROM AUTHOR]

In this paper, we first develop an active set identification technique, and then we suggest a modified nonmonotone line search rule, in which a new parameter formula is introduced to control the degree of the nonmonotonicity of line search. By using the modified line search and the active set identification technique, we propose a global convergent method to solve the NMF based on the alternating nonnegative least squares framework. In addition, the larger step size technique is exploited to accelerate convergence. Finally, a large number of numerical experiments are carried out on synthetic and image datasets, and the results show that our presented method is effective in calculating speed and solution quality. [ABSTRACT FROM AUTHOR]

Cardiovascular diseases, prevalent as leading health concerns, demand early diagnosis for effective risk prevention. Despite numerous diagnostic models, challenges persist in network configuration and performance degradation, impacting model accuracy. In response, this paper introduces the Optimally Configured and Improved Long Short-Term Memory (OCI-LSTM) model as a robust solution. Leveraging the Salp Swarm Algorithm, irrelevant features are systematically eliminated, and the Genetic Algorithm is employed to optimize the LSTM's network configuration. Validation metrics, including the accuracy, sensitivity, specificity, and F1 score, affirm the model's efficacy. Comparative analysis with a Deep Neural Network and Deep Belief Network establishes the OCI-LSTM's superiority, showcasing a notable accuracy increase of 97.11%. These advancements position the OCI-LSTM as a promising model for accurate and efficient early diagnosis of cardiovascular diseases. Future research could explore real-world implementation and further refinement for seamless integration into clinical practice. [ABSTRACT FROM AUTHOR]

The two-dimensional sample entropy marks a significant advance in evaluating the regularity and predictability of images in the information domain. Unlike the direct computation of sample entropy, which incurs a time complexity of O (N 2) for the series with N length, the Monte Carlo-based algorithm for computing one-dimensional sample entropy (MCSampEn) markedly reduces computational costs by minimizing the dependence on N. This paper extends MCSampEn to two dimensions, referred to as MCSampEn2D. This new approach substantially accelerates the estimation of two-dimensional sample entropy, outperforming the direct method by more than a thousand fold. Despite these advancements, MCSampEn2D encounters challenges with significant errors and slow convergence rates. To counter these issues, we have incorporated an upper confidence bound (UCB) strategy in MCSampEn2D. This strategy involves assigning varied upper confidence bounds in each Monte Carlo experiment iteration to enhance the algorithm's speed and accuracy. Our evaluation of this enhanced approach, dubbed UCBMCSampEn2D, involved the use of medical and natural image data sets. The experiments demonstrate that UCBMCSampEn2D achieves a 40 % reduction in computational time compared to MCSampEn2D. Furthermore, the errors with UCBMCSampEn2D are only 30 % of those observed in MCSampEn2D, highlighting its improved accuracy and efficiency. [ABSTRACT FROM AUTHOR]

This paper introduces the first completely unsupervised methodology for non-intrusive load monitoring that does not rely on any additional data, making it suitable for real-life applications. The methodology includes an algorithm to efficiently decompose the aggregated energy load from households in events and algorithms based on expert knowledge to assign each of these events to four types of appliances: fridge, dishwasher, microwave, and washer/dryer. The methodology was developed to work with smart meters that have a granularity of 1 min and was evaluated using the Reference Energy Disaggregation Dataset. The results show that the algorithm can disaggregate the refrigerator with high accuracy and the usefulness of the proposed methodology to extract relevant features from other appliances, such as the power use and duration from the heating cycles of a dishwasher. [ABSTRACT FROM AUTHOR]

To address the drawbacks of the slow convergence speed and lack of individual information exchange in the cuckoo search (CS) algorithm, this study proposes an improved cuckoo search algorithm based on a sharing mechanism (ICSABOSM). The enhanced algorithm reinforces information sharing among individuals through the utilization of a sharing mechanism. Additionally, new search strategies are introduced in both the global and local searches of the CS. The results from numerical experiments on four standard test functions indicate that the improved algorithm outperforms the original CS in terms of search capability and performance. Building upon the improved algorithm, this paper introduces a numerical solution approach for differential equations involving the coupling of function approximation and intelligent algorithms. By constructing an approximate function using Fourier series to satisfy the conditions of the given differential equation and boundary conditions with minimal error, the proposed method minimizes errors while satisfying the differential equation and boundary conditions. The problem of solving the differential equation is then transformed into an optimization problem with the coefficients of the approximate function as variables. Furthermore, the improved cuckoo search algorithm is employed to solve this optimization problem. The specific steps of applying the improved algorithm to solve differential equations are illustrated through examples. The research outcomes broaden the application scope of the cuckoo optimization algorithm and provide a new perspective for solving differential equations. [ABSTRACT FROM AUTHOR]

The phenomenon of missing data can be seen everywhere in reality. Most typical attribute reduction models are only suitable for complete systems. But for incomplete systems, we cannot obtain the effective reduction rules. Even if there are a few reduction approaches, the classification accuracy of their reduction sets still needs to be improved. In order to overcome these shortcomings, this paper first defines the similarities of intra-cluster objects and inter-cluster objects based on the tolerance principle and the mechanism of knowledge granularity. Secondly, attributes are selected on the principle that the similarity of inter-cluster objects is small and the similarity of intra-cluster objects is large, and then the knowledge granularity attribute model is proposed under the background of clustering; then, the IKAR algorithm program is designed. Finally, a series of comparative experiments about reduction size, running time, and classification accuracy are conducted with twelve UCI datasets to evaluate the performance of IKAR algorithms; then, the stability of the Friedman test and Bonferroni–Dunn tests are conducted. The experimental results indicate that the proposed algorithms are efficient and feasible. [ABSTRACT FROM AUTHOR]