Industrial control networks still face significant challenges in grayscale-based intrusion detection, including feature degradation, dispersed attention weights, and computational redundancy, particularly under dynamic attacks and large-scale traffic streams. To address these issues, this paper proposes the Dynamic Gradient-Regulated Attention Network (DyGRA-Edge), a framework tailored for resource-constrained industrial IoT edge environments. It integrates three key mechanisms: a Dynamic Gradient Controller (DGC) guided by Lyapunov stability to regulate feature evolution, anisotropic diffusion convolution (ADC) to enhance edge responses in low-contrast grayscale images, and sparse entropy attention (SEA) to minimize conditional entropy and suppress redundant features. Experiments conducted on two real-world industrial platforms—oil-gas gathering and catalytic reforming—demonstrate that DyGRA-Edge achieves detection accuracy above 98.5%, with a false positive rate of 2.1% and inference latency between 63–98 ms. Ablation studies confirm the complementary contributions of each module, while comparisons with lightweight models such as MobileViT and FastViT show that DyGRA-Edge provides superior robustness against noisy traffic and redundant features. Edge deployment validation further indicates that in a Raspberry Pi environment using the NSL-KDD dataset, DyGRA-Edge maintains an average CPU utilization of only 5.3%. These results highlight that DyGRA-Edge achieves a strong balance of accuracy, real-time performance, and resource efficiency, making it a high-precision and low-latency IDS solution for industrial edge environments.

Abstract The Intelligent Evaluation System for Calligraphy Characters (IESCC) is used for teaching calligraphy, and users can learn calligraphy through the modifications given by the system. Chinese character skeleton extraction is an important step in the intelligent evaluation algorithm of calligraphic characters. The skeletons of Chinese characters extracted by traditional refinement algorithms are prone to redundant branches and deformed skeletons, which can lead to skeleton extraction results that do not conform to the topology of the original character. In this study, the focus lies on hard‐pen regular script, and skeleton repair and extraction are performed for these characters. According to the writing characteristics of regular script, the redundant burs are removed and the deformation zone of the thinned skeleton is detected, and then the idea of first splitting is used, then restructuring, to propose a skeleton extraction algorithm based on stroke characterization and ambiguous zone detection for hard‐pen regular script, referred to as SCAD. First, a thinning algorithm is used to extract the skeleton of Chinese characters and remove redundant pixels. By analyzing the stroke characteristics of regular script, the burrs are classified and different conditions are set to detect and remove the burrs. Then the ambiguous zones are detected according to the different kinds of junction points. Then, curvature, stroke width and direction deviation are used to analyze the continuity of stroke segments, and the decision function is used to classify the stroke segments. Finally, the stroke segments with optimal pairings were compensated by interpolation according to the direction trend. This concludes the skeleton extraction. Skeleton extraction is performed on 1000 sample characters, and the SCAD algorithm can extract the skeleton of Chinese characters with an accuracy of up to 98.37%. It is proved that the SCAD method proposed here is a practical and effective method to extract the skeleton of hard‐pen regular script.

RNA 5-hydroxymethylcytosine (5hmC) is a kind of RNA modification, which is related to the life activities of many organisms. Studying its distribution is very important to reveal its biological function. Previously, high-throughput sequencing was used to identify 5hmC, but it is expensive and inefficient. Therefore, machine learning is used to identify 5hmC sites. Here, we design a model called R5hmCFDV, which is mainly divided into feature representation, feature fusion and classification. (i) Pseudo dinucleotide composition, dinucleotide binary profile and frequency, natural vector and physicochemical property are used to extract features from four aspects: nucleotide composition, coding, natural language and physical and chemical properties. (ii) To strengthen the relevance of features, we construct a novel feature fusion method. Firstly, the attention mechanism is employed to process four single features, stitch them together and feed them to the convolution layer. After that, the output data are processed by BiGRU and BiLSTM, respectively. Finally, the features of these two parts are fused by the multiply function. (iii) We design the deep voting algorithm for classification by imitating the soft voting mechanism in the Python package. The base classifiers contain deep neural network (DNN), convolutional neural network (CNN) and improved gated recurrent unit (GRU). And then using the principle of soft voting, the corresponding weights are assigned to the predicted probabilities of the three classifiers. The predicted probability values are multiplied by the corresponding weights and then summed to obtain the final prediction results. We use 10-fold cross-validation to evaluate the model, and the evaluation indicators are significantly improved. The prediction accuracy of the two datasets is as high as 95.41% and 93.50%, respectively. It demonstrates the stronger competitiveness and generalization performance of our model. In addition, all datasets and source codes can be found at https://github.com/HongyanShi026/R5hmCFDV.

MOTIVATION: 5-Methylcytosine (m5C) is a crucial post-transcriptional modification. With the development of technology, it is widely found in various RNAs. Numerous studies have indicated that m5C plays an essential role in various activities of organisms, such as tRNA recognition, stabilization of RNA structure, RNA metabolism and so on. Traditional identification is costly and time-consuming by wet biological experiments. Therefore, computational models are commonly used to identify the m5C sites. Due to the vast computing advantages of deep learning, it is feasible to construct the predictive model through deep learning algorithms. RESULTS: In this study, we construct a model to identify m5C based on a deep fusion approach with an improved residual network. First, sequence features are extracted from the RNA sequences using Kmer, K-tuple nucleotide frequency component (KNFC), Pseudo dinucleotide composition (PseDNC) and Physical and chemical property (PCP). Kmer and KNFC extract information from a statistical point of view. PseDNC and PCP extract information from the physicochemical properties of RNA sequences. Then, two parts of information are fused with new features using bidirectional long- and short-term memory and attention mechanisms, respectively. Immediately after, the fused features are fed into the improved residual network for classification. Finally, 10-fold cross-validation and independent set testing are used to verify the credibility of the model. The results show that the accuracy reaches 91.87%, 95.55%, 92.27% and 95.60% on the training sets and independent test sets of Arabidopsis thaliana and M.musculus, respectively. This is a considerable improvement compared to previous studies and demonstrates the robust performance of our model. AVAILABILITY AND IMPLEMENTATION: The data and code related to the study are available at https://github.com/alivelxj/m5c-DFRESG.

In this article, the concept and definitions of the Fractional Order Moment (FOM) and Fractional Order Cumulant (FOC) are proposed, which is based on the fractional derivative of the fractional order Moment-generating function and the fractional order Cumulant-generating function of stochastic processes. The moment and cumulant are defined on an expanded set from positive integer to the whole positive real. This development not only provides a new technology for signal processing, also complements the existing theory in the field. The properties of the FOC have been derived, and their uniformity and particularity with the High Order Cumulant are compared and commented. In addition, the transformation between the FOM and the FOC are derived and discussed in detail. As one of the applications of the new concept to the α and Gaussian processes, a new method of suppressing α and Gaussian noise is proposed. Furthermore, a FOC-based parameter estimation algorithm is developed for the non-minimum phase ARMA processes in α and/or Gaussian noise. Simulation examples are used to demonstrate the effectiveness of the proposed parameter estimation algorithm.

Summary Lung cancer has become one of the major diseases that seriously threaten human health. Early diagnosis of lung cancer is very important for the quality of lung cancer patients. Researching computer‐assisted systems for lung cancer recognition is one of the effective means to help physicians quickly diagnose lung cancer. Therefore, this paper studies the multimodal recognition algorithm for lung images. This algorithm uses CT images, PET images, and PET/CT images of lung tumors as the experimental objects and uses convolutional neural network to realize lung tumor recognition. Based on the recognition of lung tumors by convolutional neural networks, an integrated convolutional neural network was used to identify lung tumors to improve the recognition accuracy and reduce the training time. The experimental results show that the convolutional neural network can effectively identify the lung tumor images. The number of iterations and batch size in the training process will have an impact on the recognition of lung tumors. The integrated convolutional neural network designed is superior to single convolutional neural network in terms of recognition accuracy and time consumption.

A cluster system performance depends on load balancing. After analyzing the load balance algorithm, this paper presents a design of such a load balancing, algorithms using every working server to sends a corresponding ask signals to balancer based on DUD principle and the balancer assigning user requests according to ask queue which consists of these signals. Experimental results show that the algorithm obtains better load balancing than existing algorithm.