Photo Gallery


You are now here Home > Academics > Professors >

CS:Hui Gao

published: 2015-12-09 20:58:03       hits: 

name : Hui Gao Sex: male phone: 13550202554
email: office-address: Main Building B1-308, QingShui Campus
PH.D  Supervisor: Yes Master Supervisor Yes
major: Computer Science and Technology
research interst: Data Mining, Formal verification,  Image Processing and Analysis
Biography: Prof. Dr. Gao received his PhD degree in computing science from the University of Groningen (the Netherlands) in 2005. In 2006, he came back to China from the Netherlands and  joined data mining lab at the School of Computer Science and Engineering, UESTC. In 2012, he was promoted as professor.  He has published more than 20 papers and 2 books.
Education experience: Ph. D. Degree: Department of Computer Science,  University of Groningen (the Netherlands)
Research Topic: Design and verification of lock-free parallel algorithms
Date: April. 2005 (Feb. 2001 – April. 2005)
B.Sc. Degree: Department of Mathematics, Peking University
Date: July 1991 (Sep. 1987 – July 1991)
Selected Publications: [1] Chongjing SUN, Hui GAO, Junlin ZHOU,  Yan FU, and Li SHE. A new hybrid approach for privacy preserving distributed data mining,IEICE transaction on information and systems, 2014. 
[2] Hui Gao, Liming Pan, Zhihai Rong. An intermediate number of neighbors promotes the emergence of generous tit-for-tat players on homogeneous networks. Chaos, Solitons & Fractals, Volume 56, November 2013, Pages 154–159
[3] Chen D-B, Gao H, Lü L, Zhou T. Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering. PLoS ONE 8(10), 2013.
[4] Tang, L., Gao, H., Zhu, X., Wang, X., Zhou, M. and Jiang, R.: Construction of ‘small-intelligent’ focused mutagenesis libraries using well-designed combinatorial degenerate primers. BioTechniques 2012(52):149-158.
[5] Chen Duan-Bing (陈端兵) and Gao Hui (高辉): An Improved Adaptive model for Information Recommending and Spreading. Chinese Phys. Lett. 2012 (29) 048901.
[6] Hui Gao and Yan Fu: Mean residence time of Markov processes for particle transport in fludized bed reactors, Journal of Mathematical Chemistry, Vol. 49, No2, pp. 444-456, 2011
[7] M.H.F. Wilkinson, H. Gao, W.H. Hesselink, J.E. Jonker and A. Meijster. Concurrent computation of attribute filters on shared memory parallel machines. IEEE Trans. Pattern Anal. Mach. Intell. (2008) 30(10): 1800-1813.
[8] Gao, H., Groote, J.F., Hesselink, W.H.: Lock-free parallel and concurrent garbage collection by mark&sweep. Science of Computer Programming 64 (2007) 341-374.
[9] Gao, H., Hesselink, W.H.: A general lock-free algorithm using compare-and-swap. Information and Computation 205 (2007) 225-241.
[10] Gao H., Groote J.F., Hesselink W.H.: Lock-free parallel garbage collection. In Pan, Y.; Chen, D.; Guo, M.; Cao, J.; Dongarra, J. (Eds.) : Proceedings of Third International Symposium on Parallel and Distributed Processing and Applications (ISPA'05), Nanjing, China,  pp. 263-274, 2005.
[11] Gao, H., Groote, J.F., Hesselink, W.H.: Lock-free Dynamic Hash Tables with Open Addressing. Distributed Computing 17 (2005) 21-42.
[12] Gao, H. and Hesselink, W.H.: A formal reduction for lock-free parallel algorithms. Proceedings of the 16th Conference on Computer Aided Verification (CAV), Boston, July 2004. p. 44-57.

Books: Design and verification of lock-free parallel algorithms. University of Groningen Press, 2005. ISBN: 90-367-2230-6 (Book) 90-367-2231-4