Chunye Gong

Dr. Chunye Gong


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 September 2010
Verified
Conference Paper
Closed access
CGChunye Gong
Chunye Gong
JLJie Liu
Jie Liu
QZQiang Zhang
Qiang Zhang
HCHaitao Chen
Haitao Chen
ZGZhenghu Gong
Zhenghu Gong
Cloud computing emerges as one of the hottest topic in field of information technology. Cloud computing is based on several other computing research areas such as HPC, virtualization, utility computing and grid computing. In order to make clear the essential of cloud computing, we propose the characteristics of this area which make cloud computing being cloud computing and distinguish it from other research areas. The cloud computing has its own conceptional, technical, economic and user experience characteristics. The service oriented, loose coupling, strong fault tolerant, business model and ease use are main characteristics of cloud computing. Clear insights into cloud computing will help the development and adoption of this evolving technology both for academe and industry.

12 September 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
LSLifu Song
Lifu Song
FGFeng Geng
Feng Geng
ZGZi-Yi Gong
Zi-Yi Gong
XCXin Chen
Xin Chen
JTJijun Tang
Jijun Tang
YYYing-Jin Yuan
Ying-Jin Yuan
DNA data storage is a rapidly developing technology with great potential due to its high density, long-term durability, and low maintenance cost. The major technical challenges include various errors, such as strand breaks, rearrangements, and indels that frequently arise during DNA synthesis, amplification, sequencing, and preservation. In this study, a de novo strand assembly algorithm (DBGPS) is developed using de Bruijn graph and greedy path search to meet these challenges. DBGPS shows substantial advantages in handling DNA breaks, rearrangements, and indels. The robustness of DBGPS is demonstrated by accelerated aging, multiple independent data retrievals, deep error-prone PCR, and large-scale simulations. Remarkably, 6.8 MB of data is accurately recovered from a severely corrupted sample that has been treated at 70 °C for 70 days. With DBGPS, we are able to achieve a logical density of 1.30 bits/cycle and a physical density of 295 PB/g.

24 February 2014 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
CGChunye Gong
Chunye Gong
WBWeimin Bao
Weimin Bao
GTGuojian Tang
Guojian Tang
BYBo Yang
Bo Yang
JLJie Liu
Jie Liu

1 July 2011 in Journal of Computational Physics
Verified
Journal Article
Closed access
CGChunye Gong
Chunye Gong
JLJie Liu
Jie Liu
LCLihua Chi
Lihua Chi
HHHaowei Huang
Haowei Huang
JFJingyue Fang
Jingyue Fang
ZGZhenghu Gong
Zhenghu Gong

26 June 2013 in Fractional Calculus and Applied Analysis
Verified
Journal Article
Closed access
PDF file
CGChunye Gong
Chunye Gong
WBWeimin Bao
Weimin Bao
GTGuojian Tang
Guojian Tang

26 March 2015 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
CGChunye Gong
Chunye Gong
WBWeimin Bao
Weimin Bao
GTGuojian Tang
Guojian Tang
YJYuewen Jiang
Yuewen Jiang
JLJie Liu
Jie Liu
We present a survey of fractional differential equations and in particular of the computational cost for their numerical solutions from the view of computer science. The computational complexities of time fractional, space fractional, and space-time fractional equations areO(N2M),O(NM2), andO(NM(M+N)) compared withO(MN) for the classical partial differential equations with finite difference methods, whereM,Nare the number of space grid points and time steps. The potential solutions for this challenge include, but are not limited to, parallel computing, memory access optimization (fractional precomputing operator), short memory principle, fast Fourier transform (FFT) based solutions, alternating direction implicit method, multigrid method, and preconditioner technology. The relationships of these solutions for both space fractional derivative and time fractional derivative are discussed. The authors pointed out that the technologies of parallel computing should be regarded as a basic method to overcome this challenge, and some attention should be paid to the fractional killer applications, high performance iteration methods, high order schemes, and Monte Carlo methods. Since the computation of fractional equations with high dimension and variable order is even heavier, the researchers from the area of mathematics and computer science have opportunity to invent cornerstones in the area of fractional calculus.