Time filter

Source Type

Jian W.,Shandong University of Political Science and Law
Lecture Notes in Electrical Engineering | Year: 2012

The intrusion detection data is high dimensional, but the attack behavior happens frequently on a part of attribute features, there is no linear relation between the feature number and the performance of detection. If all the attributes are used for the intrusion detection, the accuracy rate of data clustering will be affected, the calculating amount for the training and detecting are large, so the detection speed is highly decreased. So the feature selection is introduced into the intrusion detection. On the basis of keeping the information integrity for the initial network data, it can help remove the redundant attribute, reduce the data dimension number, and then the detecting efficiency and detecting speed will be highly improved. Hence, it has become a focus of research. © 2012 Springer-Verlag London Limited. Source

Liu N.,Shandong University of Political Science and Law | Liu X.-Q.,Liaocheng University
Chinese Physics Letters | Year: 2012

Based on the binary Bell polynomials, the bilinear representation, bilinear Bäcklund transformation and the Lax pair for the dissipative (2+1)-dimensional Ablowitz-Kaup-Newell-Segur (AKNS) equation are obtained. Moreover, the infinite conservation laws are also derived. © 2012 Chinese Physical Society and IOP Publishing Ltd. Source

In this paper, the binary Bell polynomials are employed to find the bilinear form, bilinear Bäcklund transformation and Lax pair for the (3+1)-dimensional BKP equation. Based on Hirota’s bilinear form and three-wave method, multi-soliton solutions are presented. Furthermore, a new bilinear Bäcklund transformation is constructed via applying a gauge transformation to the Bäcklund transformation in bilinear form. © 2015 Springer Science+Business Media Dordrecht Source

Hu C.,Shandong University of Science and Technology | Liu P.,Shandong University of Political Science and Law
Journal of Computers | Year: 2012

In a searchable public-key encryption scheme with a designated tester (dPEKS), only the designated server can test which dPEKS ciphertext is related with a given trapdoor generated by a user with a keyword w by using the server's private key, but learn nothing else. In this paper, we study the keyword guessing attack of dPEKS and shows that two dPEKS schemes are insecure against this type of attack. Then an enhanced scheme is proposed and proved secure against chosen keyword attack and keyword guessing attack. To resolve the problem that dPEKS scheme does not allow the user to decrypt the encrypted keyword which limits its applicability, we give the definition of decryptable searchable public key encryption with a designated tester which enables keyword decryption from keyword ciphertext and get a concrete construction based on our dPEKS scheme. At last, we extend the dPEKS scheme to a bidirectional searchable proxy re-encryption with a designated tester scheme(RedPEKS). © 2012 ACADEMY PUBLISHER. Source

Ma B.,Shandong University of Political Science and Law
Proceedings of the International Conference on Uncertainty Reasoning and Knowledge Engineering, URKE 2011 | Year: 2011

In view of the safety and genuineness protection of the image while traveling over the internet, a novel digital watermarking scheme based on discrete wavelet transform (DWT) is proposed. The theory of digital watermark based on DWT for electronic seal is discussed. The digital watermark is scrambled with logistic chaotic sequences to improve the security of the system. Then the watermark signals are converted into a binary sequence embedded to the high (HL and HH) frequency band of the document in DWT domain. The algorithm of how to embed and extract the watermark is shown in the paper. Image quality is checked with a number of widely used parameters such as PSNR, Normalized correlation and JPEG compression. The experimental results demonstrate the efficiency of the proposed scheme, which is practicality perfect by means of good balance between transparency and robustness. © 2011 IEEE. Source

Discover hidden collaborations