With the advent of the era of Internet of Everything, the amount of data generated by edge devices in the distribution network has increased rapidly, bringing higher data transmission bandwidth requirements. At the same time, new applications have placed higher demands on the real-time nature of data processing, and traditional computing models have been unable to cope effectively.This paper proposes distributed power distribution fault detection based on edge computing, which can realize timely sensing and real-time response to distribution network faults, speed up distribution fault processing speed, shorten power outage time, improve power supply reliability and user satisfaction.Secondly, the basic principle of wavelet transform application in signal singularity detection is introduced, and a power signal fault signal analysis method based on wavelet transform is proposed. It not only makes full use of the advantages of wavelet transform in fault signal analysis, but also overcomes the shortcomings of traditional Fourier transform method, and verifies it through examples.Finally, based on the critical requirements of edge computing, such as agile connection, business real-time, data optimization, application intelligence, security and privacy protection, an evaluation system based on edge computing CROSS index fault detection model is proposed.

Network intrusion detection has the problems of large amounts of data, numerous attributes, and different levels of importance for each attribute in detection. However, in random forests, the detection results have large deviations due to the random selection of attributes. Therefore, aiming at the current problems, considering increasing the probability of essential features being selected, a network intrusion detection model based on three-way selected random forest (IDTSRF) is proposed, which integrates three decision branches and random forest. Firstly, according to the characteristics of attributes, it is proposed to evaluate the importance of attributes by combining decision boundary entropy, and using three decision rules to divide attributes; secondly, to keep the randomness of attributes, three attribute random selection rules based on attribute randomness are established, and a certain number of attributes are randomly selected from three candidate fields according to conditions; finally, the training sample set is formed by using autonomous sampling method to select samples and combining three randomly selected attribute sets randomly, and multiple decision trees are trained to form a random forest. The experimental results show that the model has high precision and recall.

In recent years, deep learning models have been more and more widely used in various fields and have become a research hotspot for various tasks in artificial intelligence, but there are significant limitations in non-convex optimization problems. As a model training strategy for non-convex optimization, curriculum learning advocates that models learn in the order of easier to more difficult data, mimicking the basic idea of gradual human learning as they learn curriculum. This strategy has been widely used in the fields of computer vision, natural language processing, and reinforcement learning; it can effectively solve the non-convex optimization problem and improve the generalization ability and convergence speed of models. This paper first introduces the application of curriculum learning at three major levels: data, task, and model, and summarizes the evaluators designed using curriculum learning methods in various domains, including difficulty evaluators, training schedulers, and loss evaluators, which correspond to the three stages of difficulty evaluation, training schedule, and loss evaluation in the application of curriculum learning to model training. We also discuss how to choose an appropriate evaluation system and the differences between terms used in different types of research. Finally, we summarize five methods similar to curriculum learning in the field of machine learning and provide a summary and outlook of the curriculum learning evaluation system.

Aiming at the problems of the dynamic increase in data in real life and that the naive Bayes (NB) classifier only accepts or rejects the sample processing results, resulting in a high error rate when dealing with uncertain data, this paper combines three-way decision and incremental learning, and a new three-way incremental naive Bayes classifier (3WD-INB) is proposed. First, the NB classifier is established, and the distribution fitting is carried out according to the minimum residual sum of squares (RSS) for continuous data, so that 3WD-INB can process both discrete data and continuous data, then carry out an incremental learning operation, select the samples with higher data quality according to the confidence of the samples in the incremental training set for incremental learning, solve the problem of data dynamics and filter the poor samples. Then we construct the 3WD-INB classifier and determine the classification rules of the positive, negative and boundary domains of the 3WD-INB classifier, so that the three-way classification of samples can be realized and better decisions can be made when dealing with uncertain data. Finally, five discrete data and five continuous data are selected for comparative experimental analysis with traditional classification methods. The results show that 3WD-INB has high accuracy and recall rate on different types of datasets, and the classification performance is also relatively stable.

Traditional image steganography techniques complete the steganography process by embedding secret information into cover images, but steganalysis tools can easily detect detectable pixel changes that lead to the leakage of confidential information. The use of a generative adversarial network (GAN) makes it possible to embed information using a combination of information and noise in generating images to achieve steganography. However, this approach is usually accompanied by issues such as poor image quality and low steganography capacity. To address these challenges, we propose a steganography model based on a novel information-driven generative adversarial network (IDGAN), which fuses a GAN, attention mechanisms, and image interpolation techniques. We introduced an attention mechanism on top of the original GAN model to improve image accuracy. In the generation model, we replaced some transposed convolution operations with image interpolation for better quality of dense images. In contrast to traditional steganographic methods, the IDGAN generates images containing confidential information without using cover images and utilizes GANs for information embedding, thus having better anti-detection capability. Moreover, the IDGAN uses an attention mechanism to improve the image details and clarity and optimizes the steganography effect through an image interpolation algorithm. Experimental results demonstrate that the IDGAN achieves an accuracy of 99.4%, 95.4%, 93.2%, and 100% on the MNIST, Intel Image Classification, Flowers, and Face datasets, respectively, with an embedding rate of 0.17 bpp. The model effectively protects confidential information while maintaining high image quality.

In recent years, some research results have been achieved in the field of image steganalysis. However, there are still problems of difficulty in extracting steganographic features from images with low embedding rates and unsatisfactory detection performance of steganalysis. In this paper, we propose an image steganalysis method based on the attention mechanism and transfer learning. The method constructs a network model based on a convolutional neural network, including a preprocessing layer, a transposed convolutional layer, an ordinary convolutional layer, and a fully connected layer. We introduce the efficient channel attention module after the ordinary convolutional layer to focus on the steganographic region of the image, capture the local cross-channel interaction information, realize the adaptive adjustment of feature weights, and enhance the ability to extract steganographic features. Meanwhile, we apply the transfer learning method to use the training model parameters of high embedding rate images as the initialization parameters of the training model of the low embedding rate to achieve feature migration and further improve the steganalysis performance of the low embedding rate. The experimental results show that compared to the typical Xu-Net and Yedroudj-Net models, the detection accuracy of the proposed method is improved by 16.36% to 30.66% and by 35.59 to 37.83% for the embedding rates of 0.05 bpp, 0.1 bpp, and 0.2 bpp, respectively. Compared to the state-of-the-art Shen-Net model with low embedding rates, the detection accuracy is improved by 3.43% to 6.41%. This demonstrates the higher detection performance of the proposed method for steganalysis of low embedding rate images.