Geng Zhao

Geng Zhao

Auto-generated profile, based on publicly available information

Geng Zhao

Beijing Electronic Science and Technology Institute

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 April 2015 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
PZPing Zhen
Ping Zhen
GZGeng Zhao
Geng Zhao
LMLequan Min
Lequan Min
XJXin Jin
Xin Jin

1 July 2007
Verified
Conference Paper
Closed access
HZHongyan Zang
Hongyan Zang
LMLequan Min
Lequan Min
GZGeng Zhao
Geng Zhao
A constructive theorem of generalized synchronization (GS) for discrete-time chaos system (DTCS) is introduced. Based on the theorem, one can design a GS driven DTCS via a driving chaotic DTCS. As an application, a GS DTCS is constructed based on the Lorenz three-dimensional chaotic map and the Theorem. Using the DTCS designs a encryption scheme with "one-time pad" function. This scheme is able successfully to encrypt and decrypt original information without any loss. The scheme is sensitive to the perturbations of the parameters and initial conditions of the DTCS. Any perturbations which are larger than 10-15 will make corresponding decryptions become impossible. The key space of the scheme is as large as 10204. The analysis of the key space, sensitivity of key parameters show that this scheme has sound security. Numerical simulations show that our scheme is effective to be used in secure communication.

1 June 2006
Verified
Conference Paper
Closed access
JWJianxin Wang
Jianxin Wang
HWHongzhou Wang
Hongzhou Wang
GZGeng Zhao
Geng Zhao
The clustering approach forwarded by Klaus Julisch is considerably effectual in eliminating false positives and finding root causes among huge amount of security events. But the clustering problem was proved to be unfortunately an NP-hard one. In this paper, a GA-based algorithm is forwarded, which is much more effective than the original approximation algorithm by Julisch. The coding scheme and genetic operations including selection, crossover, and mutation are discussed in detail. To validate the quality of the newly-forwarded approach, a tree-version apriori is given, which is quite time-consuming but able to produce absolutely accurate solution used for comparison in a feasible period of time. The results show that the GA-based algorithm is valid and efficient and can find the optimal clusters that are very similar to the absolutely accurate ones

1 July 2007
Verified
Conference Paper
Closed access
JWJianxin Wang
Jianxin Wang
GZGeng Zhao
Geng Zhao
YXYunqing Xia
Yunqing Xia
Due to its excellent performance, Apriori is frequently adopted to discover frequent itemsets, from which strong association rules can be easily generated, from among massive amounts of transactional or relational data. In this paper, Apriori is reconsidered with a more abstract perspective of data space, and a more general form of the algorithm is proposed. As is shown in this paper, the newly proposed form of the algorithm can be effectively applied to more situations in which its primitive form does not work. The more general form of Apriori is successfully applied to the problem of clustering security events organized in a hierarchical manner, which illustrates its usefulness.