Time filter

Source Type

Yang X.,Wuhan University | Liu M.,Wuhan University | Cao M.,China Ship Development And Design Center | Zhao L.,Wuhan University | And 3 more authors.
Proceedings - International Computer Software and Applications Conference | Year: 2015

Coverage-based fault localization techniques leverage coverage information to identify the suspicious program entities for inspection. However, coincidental correctness (CC) widely occurs during software debugging, and brings negative impact to the effectiveness of CBFL techniques. In this paper, we propose a regression approach to identity CC execution with weighted clustering analysis. Based on the observation that program entities with different suspiciousness have different contributions to identify coincidental correctness, we make use of the suspiciousness calculated by CBFL techniques as the weight of each program entity and conduct weighted clustering to identify coincidental correctness regressively. To evaluate the effectiveness of our approach, we construct controlled experiments built on benchmark programs, and the experimental results show that our approach is able to improve the accuracy of the identification of coincidental correctness executions and further improve the effectiveness of CBFL techniques. © 2015 IEEE.

Li X.,Hubei University | Luo M.,Hubei University | Luo M.,Key Laboratory of Aerospace Information Security and Trust Computing
Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010 | Year: 2010

Clustering classifies data into homogeneous groups such that the objects in each group are similar and the objects between groups are not similar. Cluster algorithms can be available in many literatures. And among them, spectral clustering (SC) is one of the most popular and appealing clustering methods because of its generality, efficiency and its rich theoretical foundation. But SC algorithms need cluster number κ firstly and use the top κ eigenvectors of some affinity matrix as the relaxed version of the cluster result which may have no guarantee on the quality of the solution. In this paper, we explore an effective GA-based clustering algorithm for unknown κ with special genetic mechanism. The feature of our proposed method is that the κ can be determined as part of cluster process automatically and it can improve cluster result of SCs in term of accuracy. Experimental results illustrate the effectiveness of the proposed method. © 2010 IEEE.

Xiaohong L.,Wuhan University | Min L.,Wuhan University | Min L.,Key Laboratory of Aerospace Information Security and Trust Computing
2nd International Symposium on Information Science and Engineering, ISISE 2009 | Year: 2010

Clustering is an important, hard and active topic in data analysis and pattern recognition. K clustering is a branch of data clustering where the number of clusters is know in advance. Recently, spectral clustering (SC) becomes one of the most popular and appealing k clustering methods because of its generality, efficiency and its rich theoretical foundation. But the final results obtained from SCs depend on spectral relaxation which may have no guarantee on the quality of the solution. In order to overcome the SCs' shortcoming, we propose an effective GAKC algorithm by using a genetic algorithm to search for the optimal cluster result of SCs. The algorithm uses group number coding chromosome, a new uniform crossover operator and exponential mutation rate. To verify the effectiveness of GAKC, a comparison among the experimental results of the proposed GAKC, a classical GA-based method by Ujjwal Malulik and the SC methods by SM and NJW on a real-life data set is presented. The conclusion comes that the proposed algorithm can gain much more accurate clustering result. © 2009 IEEE.

Zhang W.,Wuhan University | Niu Y.,South-Central University for Nationalities | Xiong Y.,Wuhan University | Zhao M.,Wuhan University | And 3 more authors.
PLoS ONE | Year: 2012

Motivation: The conformational B-cell epitopes are the specific sites on the antigens that have immune functions. The identification of conformational B-cell epitopes is of great importance to immunologists for facilitating the design of peptide-based vaccines. As an attempt to narrow the search for experimental validation, various computational models have been developed for the epitope prediction by using antigen structures. However, the application of these models is undermined by the limited number of available antigen structures. In contrast to the most of available structure-based methods, we here attempt to accurately predict conformational B-cell epitopes from antigen sequences. Methods: In this paper, we explore various sequence-derived features, which have been observed to be associated with the location of epitopes or ever used in the similar tasks. These features are evaluated and ranked by their discriminative performance on the benchmark datasets. From the perspective of information science, the combination of various features can usually lead to better results than the individual features. In order to build the robust model, we adopt the ensemble learning approach to incorporate various features, and develop the ensemble model to predict conformational epitopes from antigen sequences. Results: Evaluated by the leave-one-out cross validation, the proposed method gives out the mean AUC scores of 0.687 and 0.651 on two datasets respectively compiled from the bound structures and unbound structures. When compared with publicly available servers by using the independent dataset, our method yields better or comparable performance. The results demonstrate the proposed method is useful for the sequence-based conformational epitope prediction. Availability: The web server and datasets are freely available at http://bcell.whu.edu.cn. © 2012 Zhang et al.

Wang J.,Hubei University | Wang J.,Key Laboratory of Aerospace Information Security and Trust Computing | Wang Y.,Hubei University | Hu H.,Delaware State University | And 3 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Software-Defined Networking (SDN), which offers programmers network-wide visibility and direct control over the underlying switches from a logically-centralized controller, not only has a huge impact on the development of current networks, but also provides a promising way for the future development of Internet. SDN, however, also brings forth many new security challenges. One of such critical challenges is how to build a robust firewall application for SDN. Due to the stateless of SDN firewall based on OpenFlow, the first standard for SDN, and the lack of audit and tracking mechanisms for SDN controllers, the existing firewall applications in SDN can be easily bypassed by rewriting the flow entries in switches. Aiming at this threat, we introduce a systematic solution for conflict detection and resolution in OpenFlow-based firewalls through checking flow space and firewall authorization space. Unlike FortNOX [1], our approach can check the conflicts between the firewall rules and flow policies based on the entire flow paths within an OpenFlow network. We also add intra-table dependency checking for flow tables and firewall rules. Finally, we discuss a proof-of-concept implementation of our approach, and our experimental results demonstrate our approach can effectively hinder the bypass threat in real OpenFlow networks. © Springer International Publishing Switzerland 2013.

Zhao L.,Wuhan University | Zhao L.,Key Laboratory of Aerospace Information Security and Trust Computing | Wang R.,Wuhan University | Wang R.,Key Laboratory of Aerospace Information Security and Trust Computing | And 3 more authors.
Proceedings - International Computer Software and Applications Conference | Year: 2015

Exploits diagnosis requires great manual effort and desires to be automated as much as possible. In this paper, we investigate how the syntactic format of program inputs, as well as reverse engineering of data structures, could be used to identify overwritten data structures, and propose a binary-level exploit diagnosis approach, deExploit, that is generic to attack types and effective in identifying key attack steps. In details, we design to use a fine-grained dynamic tainting technique to model how the exploit is dynamically processed during program execution, dynamically reverse corresponding data structures of program input and then identify overwritten data structures by detecting the deviation between dynamic processing of exploit and that of benign input. We implement deExploit and perform it to diagnose multiple exploits in the wild. The results show that deExploit works well to diagnose memory corruption exploits. © 2015 IEEE.

Zheng P.,Hubei University | Zheng P.,Key Laboratory of Aerospace Information Security and Trust Computing | Wang W.,Anyang Institute of Technology | Wang J.,Key Laboratory of Aerospace Information Security and Trust Computing
Proceedings - 2011 International Symposium on Intelligence Information Processing and Trusted Computing, IPTC 2011 | Year: 2011

Digital watermarking is an efficient method to protect multimedia documents. Robust watermarks, which survive to any change or alteration of the protected documents, are typically used for copyright protection. Fragile watermarks, which are vulnerable to a little alteration, are typically used for content authentication. In the paper, we propose a hybrid watermarking method joining a robust and a fragile watermark, and thus combining copyright protection and content authentication. As a result this approach is at the same time resistant against tampering and copy attacks. Our contribution is setting up the relationship between fragile watermark and robust watermark. We make use of DCT coefficients to embed watermark information. The experimental results show that the proposed method can resist tampering and copy attacks at the same time. © 2011 IEEE.

Yu R.,Key Laboratory of Aerospace Information Security and Trust Computing | Du G.,Key Laboratory of Aerospace Information Security and Trust Computing | Yuan J.,Wuhan University | Li P.,Wuhan University
ICSESS 2012 - Proceedings of 2012 IEEE 3rd International Conference on Software Engineering and Service Science | Year: 2012

Session Initiation Protocol is widely used for establishing VoIP calls in wireless packet networks. According to shortages of SIP and relevant security mechanisms, a secure identity-based mechanism was proposed in this paper. The scheme realizes point-to-point mutual authentication by employing identity-based signature, and achieves end-to-end identity authentication and key agreement between cross-domain user agents by message integrity checking and Diffle-Hellman mechanism. Compared to a trans-domain mechanism for SIP communication, our method has the advantage of more lightweight computation. © 2012 IEEE.

Zhao L.,Key Laboratory of Aerospace Information Security and Trust Computing | Zhao L.,Wuhan University | Zhao L.,Nanjing University | Zhang Z.,CAS Institute of Software | And 3 more authors.
International Journal of Software Engineering and Knowledge Engineering | Year: 2013

Coverage-based fault localization (CBFL) techniques contrast the execution spectra of a program entity to assess the extent of how much a program entity is being related to faults. However, different test cases may result in similar executions, which further make the execution spectra of program entities be indistinguishable among similar executions. As a consequence, most of the current CBFL techniques are impacted by the noise of indistinguishable spectra. To alleviate the impact of execution similarity and improve the effectiveness of CBFL techniques, we propose a general fault localization framework. This framework is general to current execution spectra based CBFL techniques, which could synthesize a fault localization technique based on a given base technique. To synthesize the new technique, we use the concept of coverage vector to model execution spectra and capture the execution similarity, then reduce the impact of execution similarity by counting distinct coverage vectors, and finally assess the suspiciousness of basic blocks being related to faults with the spectra of distinct coverage vectors. We adopt four representative fault localization techniques as base techniques, use seven Siemens programs and three median-sized real-life UNIX utility programs as subject programs, to conduct an experimental study on the effectiveness of our framework. The empirical evaluation shows that our framework can effectively alleviate the impact of execution similarity and generate more effective fault localization techniques based on existing ones. © 2013 World Scientific Publishing Company.

Li X.,Wuhan University | Li X.,Key Laboratory of Aerospace Information Security and Trust Computing | Huang J.,Wuhan University
CAR 2010 - 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics | Year: 2010

Generalized tree is a more practical tree. A good layout of a generalized tree is accordingly of very high application value. With the definitions of a node's WPL (weighted path length) and the left or right contour in a generalized tree, an improved generalized tree layout algorithm is proposed. The algorithm has both the time and space complexities of O(n) and improves the Bloesch's algorithm which has both the complexities of O(h• n). ©2010 IEEE.

Loading Key Laboratory of Aerospace Information Security and Trust Computing collaborators
Loading Key Laboratory of Aerospace Information Security and Trust Computing collaborators