The rate of false positives which caused by the variability of environment and user behavior limits the applications of intrusion detecting system in real world. Intrusion detection is an important technique in the defense-in-depth network security framework and a hot topic in computer security in recent years. To solve the intrusion detection question, we introduce the self-organizing map and artificial immunisation algorithm into intrusion detection. In this paper, we give an method of rule extraction based on self-organizing map and artificial immunisation algorithm and used in intrusion detection. After illustrating our model with a representative dataset and applying it to the real-world datasets MIT lpr system calls. The experimental result shown that We propose an idea of learning different representations for system call arguments. Results indicate that this information can be effectively used for detecting more attacks with reasonable space and time overhead. So our experiment is feasible and effective that using in intrusion detection.

This paper presents the implementation of CETPayment system which is an online payment system against CET (College English test). Hierarchical design is used to increase the flexibility of the system development. Althrough the workload of system design and implementation increased significantly, it can respond to rapidly changing business needs. Because of the use of hierarchical design, the system can be modified and adjusted quickly when it faced two major adjustments in the business logic. LINQ to SQL is used to make the system development process more automatic and effective, and avoid SQL injection attacks. A third-party payment company is chosen to process the payment requests of the candidates. A synchronous Reconciliation strategy is used to solve the problem of "single out". CET-CETPayment system can effectively reduce the work pressure of exam organization and management.

A robust trust model based on group for P2P environments-RobustGroup is put forward, which measures trust values based on the group relationship between requesting peers and serving peers. Trust’s aging time and peers’ similarity are introduced with weights for direct trust and indirect trust being dynamically adjusted in trust calculation against critical issues affecting trust evaluation such as false feedback, incentive and penalty, Whitewashing behavior, dynamic trust. Simultaneously service control policies are implemented on the basis of groups, and peers’ initial trust is determined by behavior in “silent time”. The simulation shows that the proposed model has advantages in successful requests and system overhead over the existing P2P trust models.