Search

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

In response to the challenge of handling large-scale 3D point cloud data, downsampling is a common approach, yet it often leads to the problem of feature loss. We present a dynamic downsampling algorithm for 3D point cloud maps based on an improved voxel filtering approach. The algorithm consists of two modules, namely, dynamic downsampling and point cloud edge extraction. The former adapts voxel downsampling according to the features of the point cloud, while the latter preserves edge information within the 3D point cloud map. Comparative experiments with voxel downsampling, grid downsampling, clustering-based downsampling, random downsampling, uniform downsampling, and farthest-point downsampling were conducted. The proposed algorithm exhibited favorable downsampling simplification results, with a processing time of 0.01289 s and a simplification rate of 91.89%. Additionally, it demonstrated faster downsampling speed and showcased improved overall performance. This enhancement not only benefits productivity but also highlights the system's efficiency and effectiveness. [ABSTRACT FROM AUTHOR]

Water control of grain has always been a crucial link in storage and transportation. The resistance method is considered an effective technique for quickly detecting moisture in grains, making it particularly valuable in practical applications at drying processing sites. In this study, a machine learning method, combining the improved Sparrow Search Algorithm (SSA) and Support Vector Regression (SVR), was adopted for the characteristics of grain resistance. An efficient water content training model was constructed. After comparative validation against three other algorithms, it was found that this model demonstrates superior performance in terms of precision and stability. After a lot of training and taking the average, the correlation coefficient reached 0.987, the coefficient of determination was 0.992, the root mean square error was reduced to 0.64, and the Best accuracy was 0.584. Using the data obtained by the model, the resistance value of grain can be directly measured in the field, and the corresponding moisture value can be found, which can significantly improve the operation efficiency of the grain drying processing site, thereby reducing other interference factors in the detection of grain moisture. [ABSTRACT FROM AUTHOR]

High-voltage circuit breakers (HVCBs) handle the important tasks of controlling and safeguarding electricity networks. In the case of insufficient data samples, improving the accuracy of the traditional HVCB mechanical fault diagnosis method is difficult, so it poses challenges in meeting performance requirements for mechanical fault diagnosis. In this study, a HVCB fault diagnosis method is introduced. It utilizes a combination of grey wolf optimization (GWO) and multi-grained cascade forest (gcForest) algorithms to resolve these issues and improve the accuracy of HVCB mechanical fault diagnosis. To simplify the original vibration signal, the input feature quantity for the fault diagnosis method is obtained by calculating the energy entropy of the wavelet packet decomposition. The GWO algorithm is employed to optimize the parameters of the gcForest model, leading to identification of the optimum parameter configuration. Subsequently, the diagnostic effect in the case of a small sample size was analyzed through a VS1 vacuum circuit breaker example, and the accuracy reached 95.89%. In the case of unbalanced samples, further analysis and comparison with different methods confirm the feasibility and efficiency of the combination of GWO and gcForest algorithms. This study provides an effective solution for the diagnosis of mechanical faults in HVCBs. [ABSTRACT FROM AUTHOR]

When agents need to collaborate without previous coordination, the multi-agent cooperation problem transforms into an ad hoc teamwork (AHT) problem. Mainstream research on AHT is divided into type-based and type-free methods. The former depends on known teammate types to infer the current teammate type, while the latter does not require them at all. However, in many real-world applications, the complete absence and sufficient knowledge of known types are both impractical. Thus, this research focuses on the challenge of AHT with limited known types. To this end, this paper proposes a method called a Few typE-based Ad hoc Teamwork via meta-reinforcement learning (FEAT), which effectively adapts to teammates using a small set of known types within a single episode. FEAT enables agents to develop a highly adaptive policy through meta-reinforcement learning by employing limited priors about known types. It also utilizes this policy to generate a diverse type repository automatically. During the ad hoc cooperation, the agent can autonomously identify known teammate types followed by directly utilizing the pre-trained optimal cooperative policy or swiftly updating the meta policy to respond to teammates of unknown types. Comprehensive experiments in the pursuit domain validate the effectiveness of the algorithm and its components. [ABSTRACT FROM AUTHOR]

The quest for efficient and safe trajectory planning in robotic manipulation poses significant challenges, particularly in complex obstacle environments where the risk of encountering singularities and obstacles is high. Addressing this critical issue, our study presents a novel enhancement of the Fast Marching Tree (FMT) algorithm, ingeniously designed to navigate the complex terrain of Cartesian space with an unprecedented level of finesse. At the heart of our approach lies a sophisticated two-stage path point sampling strategy, ingeniously coupled with a singularity avoidance mechanism that leverages geometric perception to assess and mitigate the risk of encountering problematic configurations. This innovative method not only facilitates seamless obstacle navigation but also adeptly circumvents the perilous zones of singularity, ensuring a smooth and uninterrupted path for the robotic arm. To further refine the trajectory, we incorporate a quasi-uniform cubic B-spline curve, optimizing the path for both efficiency and smoothness. Our comprehensive simulation experiments underscore the superiority of our algorithm, showcasing its ability to consistently achieve shorter, more efficient paths while steadfastly avoiding obstacles and singularities. The practical applicability of our method is further corroborated through successful implementation in real-world robotic arm trajectory planning scenarios, highlighting its potential to revolutionize the field with its robustness and adaptability. [ABSTRACT FROM AUTHOR]

Precise and rapid detection of seatbelts is an essential research field for intelligent traffic management. In order to improve the detection precision of seatbelts and speed up algorithm inference velocity, a lightweight seatbelt detection algorithm is proposed. Firstly, by adding the G-ELAN module designed in this paper to the YOLOv7-tiny network, the optimization of construction and reduction of parameters are accomplished, and the ResNet is compressed with the channel pruning approach to decrease computational overheads. Then, the Mish activation function is utilized to replace the Leaky Relu in the neck to enhance the non-linear competence of the network. Finally, the triplet attention module is integrated into the model after pruning to make up for the underlying performance reduction caused by the previous stage and upgrade overall detection precision. The experimental results based on the self-built seatbelt dataset showed that, compared to the initial network, the Mean Average Precision (mAP) achieved by the proposed GM-YOLOv7 was improved by 3.8%, while the volume and the computation amount were lowered by 20% and 24.6%, respectively. Compared with YOLOv3, YOLOX, and YOLOv5, the mAP of GM-YOLOv7 increased by 22.4%, 4.6%, and 4.2%, respectively, and the number of computational operations decreased by 25%, 63%, and 38%, respectively. In addition, the accuracy of the improved RST-Net increased to 98.25%, while the parameter value was reduced by 48% compared to the basic model, effectively improving the detection performance and realizing a lightweight structure. [ABSTRACT FROM AUTHOR]

The detection of road damage is highly important for traffic safety and road maintenance. Conventional detection approaches frequently require significant time and expenditure, the accuracy of detection cannot be guaranteed, and they are prone to misdetection or omission problems. Therefore, this paper introduces an enhanced version of the You Only Look Once version 8 (YOLOv8) road damage detection algorithm called RDD-YOLO. First, the simple attention mechanism (SimAM) is integrated into the backbone, which successfully improves the model's focus on crucial details within the input image, enabling the model to capture features of road damage more accurately, thus enhancing the model's precision. Second, the neck structure is optimized by replacing traditional convolution modules with GhostConv. This reduces redundant information, lowers the number of parameters, and decreases computational complexity while maintaining the model's excellent performance in damage recognition. Last, the upsampling algorithm in the neck is improved by replacing the nearest interpolation with more accurate bilinear interpolation. This enhances the model's capacity to maintain visual details, providing clearer and more accurate outputs for road damage detection tasks. Experimental findings on the RDD2022 dataset show that the proposed RDD-YOLO model achieves an mAP50 and mAP50-95 of 62.5% and 36.4% on the validation set, respectively. Compared to baseline, this represents an improvement of 2.5% and 5.2%. The F1 score on the test set reaches 69.6%, a 2.8% improvement over the baseline. The proposed method can accurately locate and detect road damage, save labor and material resources, and offer guidance for the assessment and upkeep of road damage. [ABSTRACT FROM AUTHOR]

Crop digital twin is redefining traditional farming practices, offering unprecedented opportunities for real-time monitoring, predictive and simulation analysis, and optimization. This research embarks on an exploration of the synergy between precision agriculture, crop modeling, and regression algorithms to create a digital twin for farmers to augment the concentration and composition prediction-based crop nutrient recovery. This captures the holistic representation of crop characteristics, considering the intricate relationships between environmental factors, nutrient concentrations, and crop compositions. However, the complexity arising from diverse soil and environmental conditions makes nutrient content analysis expensive and time-consuming. This paper presents two approaches, namely, (i) single-nutrient concentration prediction and (ii) nutrient composition concentration prediction, which is the result of a predictive digital twin case study that employs six regression algorithms, namely, Elastic Net, Polynomial, Stepwise, Ridge, Lasso, and Linear Regression, to predict rice nutrient content efficiently, particularly considering the coexistence and composition of multiple nutrients. Our research findings highlight the superiority of the Polynomial Regression model in predicting nutrient content, with a specific focus on accurate nitrogen percentage prediction. This insight can be used for nutrient recovery intervention by knowing the precise amount of nutrient to be added into the crop medium. The adoption of the Polynomial Regression model offers a valuable tool for nutrient management practices in the crop digital twin, potentially resulting in higher-quality rice production and a reduced environmental impact. The proposed method can be replicable in other low-resourced crop digital twin system. [ABSTRACT FROM AUTHOR]

This paper proposes a dynamic phase comparison algorithm for planar direction finding on a high-speed moving satellite radio receiver, treating the moving antenna as equivalent to single-baseline array antennas. Based on a phase interferometer algorithm, this algorithm adjusts the baseline length according to the frequency measurement module and the satellite's high-speed motion to avoid phase ambiguity indirectly. By integrating the traditional amplitude comparison algorithm based on orthogonal dipole antennas, a dynamic fusion direction-finding method is proposed. Simulations demonstrate that this approach method not only covers a broader range of direction finding but also achieves higher accuracy, providing valuable insights for acquiring three-dimensional plasmagrams with space-borne plasma imagers. [ABSTRACT FROM AUTHOR]

This study presents a swarm-control algorithm to overcome the limitations inherent to single-object systems. The leader–follower swarm-control method was selected for its ease of mathematical interpretation and theoretical potential for the unlimited expansion of followers. However, a known drawback of this method is the risk of swarm collapse when the leader breaks down. To address this, a fault-coping algorithm was developed and supplemented to the leader–follower swarm-control method, which enabled the detection and responsive handling of failures, thereby ensuring mission continuity. Comprehensive data, including voltage, current, thruster speed, position, and heading angle were acquired and analyzed using sensors on unmanned surface vehicles (USVs) to monitor potential failures. In the case of a failure, such as thruster malfunction, the nearest USV seamlessly takes charge of the mission under the guidance of the fault-coping algorithm. The leader–follower swarm-control and fault-coping algorithms were successfully validated through actual sea area tests, which confirmed their operational efficacy. This study affirms the well-formed nature of the USV swarm formation and demonstrates the effectiveness of the fault-coping algorithm in ensuring normal mission performance under the virtual failure scenarios applied to the leader USV. [ABSTRACT FROM AUTHOR]

Featured Application: Estimation of the error model parameters of a wavelet transform algorithm's input quantities, which are required to calculate uncertainty of its output values. This paper presents an error model of a measurement chain containing a link that executes a discrete wavelet transform algorithm, which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both the deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose. [ABSTRACT FROM AUTHOR]

The penalty-based boundary cross-aggregation (PBI) method is a common decomposition method of the MOEA/D algorithm, but the strategy of using a fixed penalty parameter in the boundary cross-aggregation function affects the convergence of the populations to a certain extent and is not conducive to the maintenance of the diversity of boundary solutions. To address the above problems, this paper proposes a penalty boundary crossing strategy (DPA) for MOEA/D to adaptively adjust the penalty parameter. The strategy adjusts the penalty parameter values according to the state of uniform distribution of solutions around the weight vectors in the current iteration period, thus helping the optimization process to balance convergence and diversity. In the experimental part, we tested the MOEA/D-DPA algorithm with several MOEA/D improved algorithms on the classical test set. The results show that the MOEA/D with the DPA has better performance than the MOEA/D with the other decomposition strategies. [ABSTRACT FROM AUTHOR]

Dynamic Link Prediction (DLP) addresses the prediction of future links in evolving networks. However, accurately portraying the performance of DLP algorithms poses challenges that might impede progress in the field. Importantly, common evaluation pipelines usually calculate ranking or binary classification metrics, where the scores of observed interactions (positives) are compared with those of randomly generated ones (negatives). However, a single metric is not sufficient to fully capture the differences between DLP algorithms, and is prone to overly optimistic performance evaluation. Instead, an in-depth evaluation should reflect performance variations across different nodes, edges, and time segments. In this work, we contribute tools to perform such a comprehensive evaluation. (1) We propose Birth–Death diagrams, a simple but powerful visualization technique that illustrates the effect of time-based train–test splitting on the difficulty of DLP on a given dataset. (2) We describe an exhaustive taxonomy of negative sampling methods that can be used at evaluation time. (3) We carry out an empirical study of the effect of the different negative sampling strategies. Our comparison between heuristics and state-of-the-art memory-based methods on various real-world datasets confirms a strong effect of using different negative sampling strategies on the test area under the curve (AUC). Moreover, we conduct a visual exploration of the prediction, with additional insights on which different types of errors are prominent over time. [ABSTRACT FROM AUTHOR]

Compared with electromagnetic compatibility (EMC) testing in anechoic rooms, open-area EMC testing takes advantage of in situ and engine running status measurement but suffers from non-negligible external electromagnetic interference. This paper proposes a novel environmental interference suppression method (named the EMC environmental interference suppression algorithm ( E 2 I S A )) that separates signals from backgrounds via image segmentation and recognizes the near–far site signal via a group of time-varying features based on the difference in the near-site EM radiative characteristic. We find that the proposed E 2 I S A method, which combines the deep learning segmentation network with the classical recognition methods, is able to suppress environmental interference signals accurately. The experiment results show that the accuracy of E 2 I S A reaches up to 95% in the face of VHF (Very High Frequency) EMC testing tasks. [ABSTRACT FROM AUTHOR]

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

In applications where large-order filters are needed, the computational load of adaptive filtering algorithms can become prohibitively expensive. In this paper, a comprehensive analysis of a selective partial-update least mean squares, named SPU-LMS-M-min, is developed. By employing the partial-update strategy for a non-normalized adaptive scheme, the designer can choose an appropriate number of update blocks considering a trade-off between convergence rate and computational complexity, which can result in a more than 40% reduction in the number of multiplications in some configurations compared to the traditional LMS algorithm. Based on the principle of minimum distortion, a selection criterion is proposed that is based on the input signal's blocks with the lowest energy, whereas typical Selective Partial Update (SPU) algorithms use a selection criterion based on blocks with highest energy. Stochastic models are developed for the mean weights and mean and mean squared behaviour of the proposed algorithm, which are further extended to accommodate scenarios involving time-varying dynamics and suboptimal filter lengths. Simulation results show that the theoretical predictions are in good agreement with the experimental outcomes. Furthermore, it is demonstrated that the proposed selection criterion can be easily extended to active noise cancellation algorithms as well as algorithms utilizing variable filter length. This allows for the reduction of computational costs for these algorithms without compromising their asymptotic performance. [ABSTRACT FROM AUTHOR]

Cloud computing and the increasing popularity of 5G have greatly increased the application of images on Internet of Things (IoT) devices. The storage of images on an untrusted cloud has high security and privacy risks. Several lightweight cryptosystems have been proposed in the literature as appropriate for resource-constrained IoT devices. These existing lightweight cryptosystems are, however, not only at the risk of compromising the integrity and security of the data but also, due to the use of substitution boxes (S-boxes), require more memory space for their implementation. In this paper, a secure lightweight cryptography algorithm, that eliminates the use of an S-box, has been proposed. An algorithm termed Enc, that accepts a block of size n divides the block into L n R bits of equal length and outputs the encrypted block as follows: E = L ⨂ R ⨁ R , where ⨂ and ⨁ are exclusive-or and concatenation operators, respectively, was created. A hash result, h a s R = S H A 256 P ⨁ K , was obtained, where SHA256, P, and K are the Secure Hash Algorithm (SHA−256), the encryption key, and plain image, respectively. A seed, S, generated from e n c h a s h = E n c h a s h e n c , K , where hashenc is the first n bits of hasR, was used to generate a random image, Rim. An intermediate image, i n t i m a g e = R i m ⨂ P , and cipher image, C = E n c i n t i m a g e , K , were obtained. The proposed scheme was evaluated for encryption quality, decryption quality, system sensitivity, and statistical analyses using various security metrics. The results of the evaluation showed that the proposed scheme has excellent encryption and decryption qualities that are very sensitive to changes in both key and plain images, and resistance to various statistical attacks alongside other security attacks. Based on the result of the security evaluation of the proposed cryptosystem termed Hash XOR Permutation (HXP), the study concluded that the security of the cryptography algorithm can still be maintained without the use of a substitution box. [ABSTRACT FROM AUTHOR]

The introduction of 5G technologies has enabled the possibility of designing and building several new classes of networked information systems that were previously impossible to implement due to limitations on data throughput or the reliability of transmission channels. Among them, one of the most interesting and successful examples with a highly positive impact in terms of the quality of urban environments and societal and economical welfare is a system of semi-autonomous connected vehicles, where IoT devices, data centers, and fleets of smart vehicles equipped with communication and computational resources are combined into a heterogeneous and distributed infrastructure, unifying hardware, networks, and software. In order to efficiently provide various services (e.g., patrolling, pickup and delivery, monitoring), these systems typically rely on collecting and broadcasting large amounts of data (e.g., sensor data, GPS traces, or maps), which need to be properly collected and processed in a timely manner. As is well documented in the literature, one of the most effective ways to achieve this purpose, especially in a real-time context, is to adopt a graph model of the data (e.g., to model communication networks, roads, or interactions between vehicles) and to employ suitable graph algorithms to solve properly defined computational problems of interest (e.g., shortest paths or distributed consensus). While research in this context has been extensive from a theoretical perspective, works that have focused on the implementation, deployment, and evaluation of the practical performance of graph algorithms for real-world systems of autonomous vehicles have been much rarer. In this paper, we present a study of this kind. Specifically, we first describe the main features of a real-world information system employing semi-autonomous connected vehicles that is currently being tested in the city of L'Aquila (Italy). Then, we present an overview of the computational challenges arising in the considered application domain and provide a systematic survey of known algorithmic results for one of the most relevant classes of computational problems that have to be addressed in said domain, namely, pickup and delivery problems. Finally, we discuss implementation issues, adopted software tools, and the deployment and testing phases concerning one of the algorithmic components of the mentioned real-world system dedicated to handling a specific problem of the above class, namely, the pickup and delivery multi-vehicle problem with time windows. [ABSTRACT FROM AUTHOR]

Survival analysis is widely used in fields such as medical research and reliability engineering to analyze data where not all subjects experience the event of interest by the end of the study. It requires dedicated methods capable of handling censored cases. This paper extends the collection of techniques applicable to censored data by introducing a novel algorithm for interpretable recommendations based on a set of survival action rules. Each action rule contains recommendations for changing the values of attributes describing examples. As a result of applying the action rules, an example is moved from a group characterized by a survival curve to another group with a significantly different survival rate. In practice, an example can be covered by several induced rules. To decide which attribute values should be changed, we propose a recommendation algorithm that analyzes all actions suggested by the rules covering the example. The efficiency of the algorithm has been evaluated on several benchmark datasets. We also present a qualitative analysis of the generated recommendations through a case study. The results indicate that the proposed method produces high-quality recommendations and leads to a significant change in the estimated survival time. [ABSTRACT FROM AUTHOR]

This article provides a general overview of the communication protocols used in the IEC61850 standard for the automation of electrical substations. Specifically, it examines the GOOSE and R-GOOSE protocols, which are used for exchanging various types of information. The article then presents real cases of cyber attacks on the industrial sector, highlighting the importance of addressing cybersecurity in the IEC61850 standard. The text presents security drawbacks of the communication protocols mentioned earlier and briefly explains two algorithms defined in the IEC61850 standard to address them. However, the authors suggest that having only a couple of algorithms may not be sufficient to ensure digital security in substations. This article presents a study on the cryptographic algorithms ChaCha20 and Poly1305. The purpose of the study is to experimentally verify their adaptation to the strict time requirements that GOOSE must meet for their operation. These algorithms can operate independently or in combination, creating an Authenticated Encryption with Associated Data (AEAD) algorithm. Both algorithms were thoroughly reviewed and tested using GOOSE and R-GOOSE frames generated by the S-GoSV software. The computational time required was also observed. The frames were analysed using the Wireshark software. It was concluded that the algorithms are suitable for the communication requirements of electrical substations and can be used as an alternative to the cryptographic algorithms proposed under the IEC61850 standard. [ABSTRACT FROM AUTHOR]

When the adaptive filter length is increased, the calculation complexity increases rapidly because the relationship between the calculation and the adaptive filter length N contains a power function with no secondary path identification algorithm. Under the basic premise of unreduced noise reduction, herein, a simplified frequency-domain feedback active noise control algorithm is proposed. To reduce the computation complexity, the total delay is adopted as the estimated secondary path; the filtered reference signal is produced in the frequency domain by using multiplication to replace convolution calculation in the time domain and then updating the adaptive filter coefficients in the frequency domain. Therefore, the computational complexity has a logarithmic function with the increased adaptive filter length in the proposed algorithm. If the adaptive filter length is 512, the existing WSMANC algorithm's calculation is 271,360 real number multiplications, while that of the proposed algorithm is only 38,912 real number multiplications. To verify the proposed algorithm's stability, convergence speed, and noise reduction, the single-frequency noise, narrowband white noise, and narrowband pink noise, respectively, are used as the primary noise types in the simulations. The results show that (1) the proposed SFDFBANC algorithm can obtain similar noise reduction performance to existing algorithm, (2) the convergence rate is faster than existing algorithm, and (3) if the adaptive filter length is more than 64, the proposed algorithm exhibits a lower computational complexity. [ABSTRACT FROM AUTHOR]

In recent years, the emergence of large-scale language models, such as ChatGPT, has presented significant challenges to research on knowledge graphs and knowledge-based reasoning. As a result, the direction of research on knowledge reasoning has shifted. Two critical issues in knowledge reasoning research are the algorithm of the model itself and the selection of paths. Most studies utilize LSTM as the path encoder and memory module. However, when processing long sequence data, LSTM models may encounter the problem of long-term dependencies, where memory units of the model may decay gradually with an increase in time steps, leading to forgetting earlier input information. This can result in a decline in the performance of the LSTM model in long sequence data. Additionally, as the data volume and network depth increase, there is a risk of gradient disappearance. This study improved and optimized the LSTM model to effectively address the problems of gradient explosion and gradient disappearance. An attention layer was employed to alleviate the issue of long-term dependencies, and ConvR embedding was used to guide path selection and action pruning in the reinforcement learning inference model. The overall model achieved excellent reasoning results. [ABSTRACT FROM AUTHOR]

In this paper, an improved cubature Kalman filtering (CKF) is proposed using the Sigmoid function to address the problems of positioning accuracy degradation and large deviations in ultra-wideband (UWB) indoor positioning in non-line-of-sight environments. The improved CKF is based on the squared range difference (SRD) model of the time difference of arrival (TDOA) algorithm. The inaccurate impact of model estimation under non-Gaussian noise is reduced by updating the measurement noise matrix in real time. The covariance matrix is estimated using singular value decomposition (SVD) to solve the problem of degraded state estimation performance. The filtering effect of the improved CKF algorithm is evaluated by referring to the checkpoints in the dynamic trajectory. The experimental results show that the proposed algorithm effectively mitigates the impact of UWB ranging outliers in the occluded experimental environment, which makes the dynamic positioning trajectory smoother, better fitted, and more stable. The algorithm improves the positioning accuracy by up to 39.29% compared with the SRD model used alone. [ABSTRACT FROM AUTHOR]

In the epoch characterized by the anticipation of autonomous vehicles, the quality of the embedded system software, its reliability, safety, and security is significant. The testing of embedded software is an increasingly significant element of the development process. The application of artificial intelligence (AI) algorithms in the process of testing embedded software in vehicles constitutes a significant area of both research and practical consideration, arising from the escalating complexity of these systems. This paper presents the preliminary development of the AVESYS framework which facilitates the application of open-source artificial intelligence algorithms in the embedded system testing process. The aim of this work is to evaluate its effectiveness in identifying anomalies in the test environment that could potentially affect testing results. The raw data from the test environment, mainly communication signals and readings from temperature, as well as current and voltage sensors are pre-processed and used to train machine learning models. A verification study is carried out, proving the high practical potential of the application of AI algorithms in embedded software testing. [ABSTRACT FROM AUTHOR]

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

In the realm of personalized federated learning, some current methods substitute shared parameters with shared samples created by Generative Adversarial Networks (GANs). This enables each client to independently design the architecture of their neural network model. However, this approach still fails to overcome the restriction of enforcing uniform labels on client models that partake in training. To tackle this problem, we suggest the Federated Pseudo-Sample Clustering Algorithm (LPFL-GD). This method allows clients to train cooperatively under personalized labeling conditions. The approach uses the local model as a discriminator and forms a GAN network with the generator to produce a sample set. This set is then uploaded to the central server. The uploaded shared samples are clustered and divided into several clusters by introducing the DBSCAN algorithm on the central server. When filtering client samples, we obtain the labels of shared samples from each client in a cluster and correct the label of the entire cluster. We then merge the corrected samples with the local dataset to extend it. Our approach improves model performance, even when different clients label the same type of data differently. Compared with their performance before participating in federated learning, our approach can improve client model accuracy by up to 13.4%. We replicated other methods in the same environment and found that the local model accuracy of those methods not only improved very little but even decreased by up to 34.5%. [ABSTRACT FROM AUTHOR]

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

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

Ultra-low-frequency oscillation (ULFO) is a new problem of frequency stability in asynchronous network back-end power networks. The negative damping provided by hydropower units is the direct cause of ultra-low-frequency oscillation, and DC modulation is an effective means of suppressing system frequency oscillation. Based on the transient energy function and the limitation of DC modulation, this paper analyzes the conditions of suppressing system oscillation by DC modulation from the perspective of energy. The weight of unit energy participation is defined, and the calculation formula of transient oscillation energy in a certain oscillation mode is derived. DC modulation sensitivity is then used to create a DC modulation sequence table based on the Prony identification approach. Ultimately, the DC involved in the modulation is identified using the DC modulation sequence table and the transient oscillation energy, and the Deep Deterministic Policy Gradient (DDPG) algorithm is used to optimize the chosen DC modulation parameters. [ABSTRACT FROM AUTHOR]

Insects are good examples of ground locomotion because they can adapt their gait pattern to propel them in any direction, over uneven terrain, in a stable manner. Nevertheless, replicating such locomotion skills to a legged robot is not a straightforward task. Different approaches have been proposed to synthesize the gait patterns for these robots; each approach exhibits different restrictions, advantages, and priorities. For the purpose of this document, we have classified gait pattern generators for multi-legged robots into three categories: precomputed, heuristic, and bio-inspired approaches. Precomputed approaches rely on a set of precalculated motion patterns obtained from geometric and/or kinematic models that are performed repeatedly whenever necessary and that cannot be modified on-the-fly to adapt to the terrain changes. On the other hand, heuristic and bio-inspired approaches offer on-line adaptability, but parameter-tuning and heading control can be difficult. In this document, we present the K3P algorithm, a real-time kinematic gait pattern generator conceived to command a legged robot. In contrast to other approaches, K3P enables the robot to adapt its gait to follow an arbitrary trajectory, at an arbitrary speed, over uneven terrain. No precomputed motions for the legs are required; instead, K3P modifies the motion of all mechanical joints to propel the body of the robot in the desired direction, maintaining a tripod stability at all times. In this paper, all the specific details of the aforementioned algorithm are presented, as well as different simulation results that validate its characteristics. [ABSTRACT FROM AUTHOR]

With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time. [ABSTRACT FROM AUTHOR]

Optical 3D detection technology has a wide range of applications in industrial detection, agricultural production, and so on. Its advantages are non-contact, efficiency, and high precision. However, the specular reflection problem affects model coverage and measurement accuracy. An optimization algorithm for calculating the number and pose of sensors has been proposed to address this issue. First, the specular reflection problem is viewed as a multi-sensor position search problem. Then, an optimization algorithm is used to find the optimal number and bit positions of sensors to avoid specular reflection. The experiment shows that the optimization results of this algorithm can cover the area to be measured with the least number of sensor combinations while avoiding the influence of specular reflection. [ABSTRACT FROM AUTHOR]

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks greatly disrupts the security and availability of applications, and due to the widespread use of third-party libraries, its impact may be amplified through the software supply chain. The existing work in the field is dedicated to abstract loop or iterative patterns and fuzzing the entire application to discover algorithm complexity vulnerabilities, but they still face efficiency and effectiveness issues. Our research focuses on: (1) proposing a representation and extraction method for code features related to algorithmic complexity vulnerabilities, helping analysts quickly understand program logic; (2) providing a new ACV detecting model, focusing on the spatial complexity anomalies caused by deep recursion structures, and proposing a new filtering method; and (3) aiming at the difficulty of efficiently generating complex-data-type-related payloads using existing symbol execution techniques, a call-chain-guided payload construction method is proposed. We tested third-party components in the open-source Java Maven Repository, identified many unexposed vulnerabilities, and eight of them received Common Vulnerabilities and Exposures (CVE) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance. [ABSTRACT FROM AUTHOR]

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

When performing classification tasks on high-dimensional data, traditional machine learning algorithms often fail to filter out valid information in the features adequately, leading to low levels of classification accuracy. Therefore, this paper explores the high-dimensional data from both the data feature dimension and the model ensemble dimension. We propose a high-dimensional ensemble learning classification algorithm focusing on feature space reconstruction and classifier ensemble, called the HDELC algorithm. First, the algorithm considers feature space reconstruction and then generates a feature space reconstruction matrix. It effectively achieves feature selection and reconstruction for high-dimensional data. An optimal feature space is generated for the subsequent ensemble of the classifier, which enhances the representativeness of the feature space. Second, we recursively determine the number of classifiers and the number of feature subspaces in the ensemble model. Different classifiers in the ensemble system are assigned mutually exclusive non-intersecting feature subspaces for model training. The experimental results show that the HDELC algorithm has advantages compared with most high-dimensional datasets due to its more efficient feature space ensemble capability and relatively reliable ensemble operation performance. The HDELC algorithm makes it possible to solve the classification problem for high-dimensional data effectively and has vital research and application value. [ABSTRACT FROM AUTHOR]

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

With the strengthening of worldwide counter-terrorism initiatives, it is increasingly important to detect contrabands such as controlled knives and flammable materials hidden in clothes and bags. Terahertz (THz) imaging technology is widely used in the field of contraband detection due to its advantages of high imaging speed and strong penetration. However, the terahertz images are of poor qualities and lack texture details. Traditional target detection methods suffer from low detection speeds, misdetection, and omission of contraband. This work pre-processes the original dataset using a variety of image processing methods and validates the effect of these methods on the detection results of YOLOv7. Meanwhile, the lightweight and multi-object detection YOLOv7 (LWMD-YOLOv7) algorithm is proposed. Firstly, to meet the demand of real-time for multi-target detection, we propose the space-to-depth mobile (SPD_Mobile) network as the lightweight feature extraction network. Secondly, the selective attention module large selective kernel (LSK) network is integrated into the output of the multi-scale feature map of the LWMD-YOLOv7 network, which enhances the effect of feature fusion and strengthens the network's attention to salient features. Finally, Distance Intersection over Union (DIOU) is used as the loss function to accelerate the convergence of the model and to have a better localisation effect for small targets. The experimental results show that the YOLOv7 algorithm achieves the best detection results on the terahertz image dataset after the non-local mean filtering process. The LWMD-YOLOv7 algorithm achieves a detection accuracy P of 98.5%, a recall R of 97.5%, and a detection speed of 112.4 FPS, which is 26.9 FPS higher than that of the YOLOv7 base network. The LWMD-YOLOv7 achieves a better balance between detection accuracy and detection speed. It provides a technological reference for the automated detection of contraband in terahertz images. [ABSTRACT FROM AUTHOR]

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

The issue of Electrical Impedance Tomography (EIT) is a well-known inverse problem that presents challenging characteristics. In order to address the difficulties associated with ill-conditioned inverses, regularization methods are typically employed. One commonly used approach is total variation (TV) regularization, which has shown effectiveness in EIT. In order to meet the requirements of real-time tracking, it is essential to acquire fast and reliable algorithms for image reconstruction. Therefore, we present a modified second-order generalized regularization algorithm that enables more-accurate reconstruction of organ boundaries and internal structures, to reduce EIT artifacts, and to overcome the inability of the conventional Tikhonov regularization method in solving the step effect of the medium boundary. The proposed algorithm uses the improved alternating direction method of multipliers (ADMM) to tackle this optimization issue and adopts the second-order generalized total variation (SOGTV) function with strong boundary-preserving features as the regularization generalization function. The experiments are based on simulation data and the physical model of the circular water tank that we developed. The results showed that SOGTV regularization can improve image realism compared with some classic regularization. [ABSTRACT FROM AUTHOR]

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

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

The controlled source audio-frequency magnetotelluric method (CSAMT) stands out for its economic efficiency and widespread application in geophysical monitoring. However, the separate inversion of time-lapse monitoring data encounters challenges in comparing and identifying abnormal changes due to variations in data fitting. Furthermore, the utilization of a method akin to Cagniard apparent resistivity for inversion necessitates the simultaneous observation of at least two components of the electromagnetic field, making it unsuitable for extensive three-dimensional observations. This paper proposes a 3D time-lapse electric field inversion algorithm for CSAMT, addressing the complexities in geophysical monitoring. The algorithm introduces two regularization factors and defines an objective function with both temporal and spatial constraints. Synthetic testing reveals the stability of the 3D time-lapse electric field inversion algorithm, demonstrating its effectiveness in delineating underground variations. This solution resolves the challenges posed by the independent inversion of time-lapse monitoring data. [ABSTRACT FROM AUTHOR]

Accurately classifying degraded images is a challenging task that relies on domain expertise to devise effective image processing techniques for various levels of degradation. Genetic Programming (GP) has been proven to be an excellent approach for solving image classification tasks. However, the program structures designed in current GP-based methods are not effective in classifying images with quality degradation. During the iterative process of GP algorithms, the high similarity between individuals often results in convergence to local optima, hindering the discovery of the best solutions. Moreover, the varied degrees of image quality degradation often lead to overfitting in the solutions derived by GP. Therefore, this research introduces an innovative program structure, distinct from the traditional program structure, which automates the creation of new features by transmitting information learned across multiple nodes, thus improving GP individual ability in constructing discriminative features. An accompanying evolution strategy addresses high similarity among GP individuals by retaining promising ones, thereby refining the algorithm's development of more effective GP solutions. To counter the potential overfitting issue of the best GP individual, a multi-generational individual ensemble strategy is proposed, focusing on constructing an ensemble GP individual with an enhanced generalization capability. The new method evaluates performance in original, blurry, low contrast, noisy, and occlusion scenarios for six different types of datasets. It compares with a multitude of effective methods. The results show that the new method achieves better classification performance on degraded images compared with the comparative methods. [ABSTRACT FROM AUTHOR]

Satellite networks show the development trend in global coverage, flexible access, and reliable transmission. They are the key to building a wide coverage, massive connection, three-dimensional, all-round, all-weather, space-, air- and ground-integrated information network. Due to its high frequency and large bandwidth, the laser inter-satellite link (ISL) is easily interfered with by sunlight. When sun outage occurs, the laser inter-satellite link will be interrupted for a long time. Most of the existing satellite link failure-routing algorithms are distributed and have poor load balancing capabilities. The centralized algorithm calculates paths independently for different services, and the effect is not ideal. In this paper, a local pre-rerouting algorithm (LPRA) is proposed. The center node collects the link information from the limited area before sun outage and the service information in the link that is about to be interrupted, and reroutes these services before sun outage occurs. After the occurrence of sun outage, services that originally needed to go through the failed link are forwarded according to the path calculated in advance, thereby avoiding link congestion and reducing the packet loss rate. Simulation results show that the proposed algorithm performs better than existing algorithms in terms of packet loss ratio, total delay and load balancing capabilities. [ABSTRACT FROM AUTHOR]

Given a set of data objects, the fuzzy c-means (FCM) partitional clustering algorithm is favored due to easy implementation, rapid response, and feasible optimization. However, FCM fails to reflect either the importance degree of the individual data objects or that of the clusters. Numerous variants of FCM have been proposed to address these issues. However, most of them cannot effectively apply the available information on data objects or clusters. In this paper, a double-constraint fuzzy clustering algorithm is proposed to reflect the importance degrees of both individual data objects and clusters. By incorporating double constraints into each data object and cluster, the objective function of FCM is reformulated and its realization equation is mathematically conducted. Consequently, the clustering accuracy of FCM is improved by applying the available information on both data objects and clusters. Especially, the proposed algorithm effectively addresses the limitations inherent in the existing variants of FCM. The experimental results validate the effectiveness, implementation, and robustness of the new fuzzy clustering algorithm. [ABSTRACT FROM AUTHOR]

Object detection in unmanned aerial vehicle (UAV) images has become a popular research topic in recent years. However, UAV images are captured from high altitudes with a large proportion of small objects and dense object regions, posing a significant challenge to small object detection. To solve this issue, we propose an efficient YOLOv7-UAV algorithm in which a low-level prediction head (P2) is added to detect small objects from the shallow feature map, and a deep-level prediction head (P5) is removed to reduce the effect of excessive down-sampling. Furthermore, we modify the bidirectional feature pyramid network (BiFPN) structure with a weighted cross-level connection to enhance the fusion effectiveness of multi-scale feature maps in UAV images. To mitigate the mismatch between the prediction box and ground-truth box, the SCYLLA-IoU (SIoU) function is employed in the regression loss to accelerate the training convergence process. Moreover, the proposed YOLOv7-UAV algorithm has been quantified and compiled in the Vitis-AI development environment and validated in terms of power consumption and hardware resources on the FPGA platform. The experiments show that the resource consumption of YOLOv7-UAV is reduced by 28%, the mAP is improved by 3.9% compared to YOLOv7, and the FPGA implementation improves the energy efficiency by 12 times compared to the GPU. [ABSTRACT FROM AUTHOR]

Today, the IoT has become a vital part of our lives because it has entered into the precise details of human life, like smart homes, healthcare, eldercare, vehicles, augmented reality, and industrial robotics. Cloud computing and fog computing give us services to process IoT tasks, and we are seeing a growth in the number of IoT devices every day. This massive increase needs huge amounts of resources to process it, and these vast resources need a lot of power to work because the fog and cloud are based on the term pay-per-use. We make to improve the performance and cost (PC) algorithm to give priority to the high-profit cost and to reduce energy consumption and Makespan; in this paper, we propose the performance and cost–gray wolf optimization (PC-GWO) algorithm, which is the combination of the PCA and GWO algorithms. The results of the trial reveal that the PC-GWO algorithm reduces the average overall energy usage by 12.17%, 11.57%, and 7.19%, and reduces the Makespan by 16.72%, 16.38%, and 14.107%, with the best average resource utilization enhanced by 13.2%, 12.05%, and 10.9% compared with the gray wolf optimization (GWO) algorithm, performance and cost algorithm (PCA), and Particle Swarm Optimization (PSO) algorithm. [ABSTRACT FROM AUTHOR]

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

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