Network security problems bring many imperceptible threats to the integrity of data and the reliability of device services,so proposing a network intrusion detection model with high reliability is of great research si...Network security problems bring many imperceptible threats to the integrity of data and the reliability of device services,so proposing a network intrusion detection model with high reliability is of great research significance for network security.Due to the strong generalization of invalid features during training process,it is more difficult for single autoencoder intrusion detection model to obtain effective results.A network intrusion detection model based on the Ensemble of Denoising Adversarial Autoencoder(EDAAE)was proposed,which had higher accuracy and reliability compared to the traditional anomaly detection model.Using the adversarial learning idea of Adversarial Autoencoder(AAE),the discriminator module was added to the original model,and the encoder part was used as the generator.The distribution of the hidden space of the data generated by the encoder matched with the distribution of the original data.The generalization of the model to the invalid features was also reduced to improve the detection accuracy.At the same time,the denoising autoencoder and integrated operation was introduced to prevent overfitting in the adversarial learning process.Experiments on the CICIDS2018 traffic dataset showed that the proposed intrusion detection model achieves an Accuracy of 95.23%,which out performs traditional self-encoders and other existing intrusion detection models methods in terms of overall performance.展开更多
Let P be an inner point of a convex N-gon ΓN ： A1A2… ANA1（N ≥ 3）, and let di,k denote the distance from the point Ai＋k to the line PAi（i = 1,2,…,N, Ai = Aj〈=〉 i ≡ j（modN））, which is called the k-Brocard...Let P be an inner point of a convex N-gon ΓN ： A1A2… ANA1（N ≥ 3）, and let di,k denote the distance from the point Ai＋k to the line PAi（i = 1,2,…,N, Ai = Aj〈=〉 i ≡ j（modN））, which is called the k-Brocard distance for P of ΓN. We have proved the following double-inequality： If P ∈ ΓN, k = N↑∩i=1∠Ai-kAiAi＋k（1 ≤ k 〈 N/2,i =1,2,…,N）, and r ≤ lnN-ln（N-1）/ln2＋2[lnN-ln（N-1）], then （1/N N↑∑↑i=1di^r, k）^1/r≤1/N coskπ/N N↑∑↑i=1｜AiAi＋k｜≤sin2kπ/2sinπ/N（1/N N↑∑↑i=1｜AiAi＋1｜^2.展开更多
文摘Network security problems bring many imperceptible threats to the integrity of data and the reliability of device services,so proposing a network intrusion detection model with high reliability is of great research significance for network security.Due to the strong generalization of invalid features during training process,it is more difficult for single autoencoder intrusion detection model to obtain effective results.A network intrusion detection model based on the Ensemble of Denoising Adversarial Autoencoder(EDAAE)was proposed,which had higher accuracy and reliability compared to the traditional anomaly detection model.Using the adversarial learning idea of Adversarial Autoencoder(AAE),the discriminator module was added to the original model,and the encoder part was used as the generator.The distribution of the hidden space of the data generated by the encoder matched with the distribution of the original data.The generalization of the model to the invalid features was also reduced to improve the detection accuracy.At the same time,the denoising autoencoder and integrated operation was introduced to prevent overfitting in the adversarial learning process.Experiments on the CICIDS2018 traffic dataset showed that the proposed intrusion detection model achieves an Accuracy of 95.23%,which out performs traditional self-encoders and other existing intrusion detection models methods in terms of overall performance.
文摘Let P be an inner point of a convex N-gon ΓN ： A1A2… ANA1（N ≥ 3）, and let di,k denote the distance from the point Ai＋k to the line PAi（i = 1,2,…,N, Ai = Aj〈=〉 i ≡ j（modN））, which is called the k-Brocard distance for P of ΓN. We have proved the following double-inequality： If P ∈ ΓN, k = N↑∩i=1∠Ai-kAiAi＋k（1 ≤ k 〈 N/2,i =1,2,…,N）, and r ≤ lnN-ln（N-1）/ln2＋2[lnN-ln（N-1）], then （1/N N↑∑↑i=1di^r, k）^1/r≤1/N coskπ/N N↑∑↑i=1｜AiAi＋k｜≤sin2kπ/2sinπ/N（1/N N↑∑↑i=1｜AiAi＋1｜^2.
