Computer Science Engineering

Hieu Dinh

Department of Computer Science&Engineering Phone: 860-***-**** or 860-***-****

University of Connecticut Fax: 860-***-****

*** **** *** ****, abqfah@r.postjobfree.com

Storrs, CT 06269-2155 http://www.engr.uconn.edu/~htd06001/

Education

Ph.D. in Computer Science In Progress

University of Connecticut Storrs, CT

GPA: 3.971/4.0

M.S. in Computer Science May 2008

University of Connecticut Storrs, CT

GPA: 4.043/4.0

B.S. in Computer Science June 2005

Vietnam National University, Hanoi Hanoi, Vietnam

High honor, ranked 1st of 120 students.

Industrial Experience

PhD Intern May 2011 - August 2011

HP (Hewlett-Packard) - Vertica Distributed Analytic Database Billerica, MA

Working on SDK framework supporting User De ne Functions for Vertica Distributed Analytic

Database.

Designing and writing speci cations and Coding in C++ and Java for SDK framework.

Software Engineer August 2005 - May 2006

Hitachi Software Engineering Co.,Ltd. Hitachisoft Hanoi, Vietnam

Fixed bugs and tested security software HIBUN in hundred thousand lines of C/C++ and C#

code.

Research Experience

Research Assistant Spring 2009-present

University of Connecticut, Dept. of Computer Science & Engineering Storrs, CT

Designed, analyzed and implemented combinatorial algorithms for problems in Bioinformatic.

Designed the most memory-e cient data structure for the overlap graph used in DNA sequence as-

sembly. The data structure is used in the DNA sequence assembler at website http://dnaassembler.

com.

Designed the fastest algorithm PMS5 for the planted motif search problem. The algorithm is used

at website http://motifsearch.com.

Solved a 7-year open question: the Border Length Minimization Problem in grid graphs is N P -

hard.

Research Assistant Fall 2006-Fall 2008

University of Connecticut, Dept. of Computer Science & Engineering Storrs, CT

Designed, analyzed and implemented algorithms for problems in Computer Networks.

Proved the Tree-based Broadcast Algorithm works optimally in grid and torus graphs.

1

Designed a broadcast algorithm to improve the broadcast time in high dimensional torus graphs.

Applied Linear Programming and Semi-de nite Programming for the Channel Assignment Prob-

lem in Wireless Network.

Undergraduate Thesis on Information Extraction Spring 2005

Vietnam National University Hanoi Hanoi, Vietnam

Analyzed two probability models applied in Information Extraction, including Maximum Entropy

Markov Model (MEMM) and Hidden Markov Model (HMM), specifying limitations of each model,

especially in applying for text in Vietnamese.

Proposed a hybrid model by combining HMM and MEMM and showed, theoretically and experi-

mentally, that the hybrid model is better than both existing models.

Publications

Hieu Dinh, Sanguthevar Rajasekaran and Jaime Davila. qPMS7: A Fast Algorithm for Finding

(l,d)-Motifs in DNA and Protein Sequences. In PLOS One Journal, July 2012.

Hieu Dinh, Sanguthevar Rajasekaran and Vamsi Kundeti. PMS5: an e cient exact algorithm

for the (l,d)-motif nding problem. In BMC Bioinformatics Journal, October 2011.

Hieu Dinh and Sanguthevar Rajasekaran. A memory-e cient data structure representing exact-

match overlap graphs with application for next generation DNA assembly. In Bioinformatics Jour-

nal, June 2011.

Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng and Krishna R. Pattipati. Fault Localization Us-

ing Passive End-to-End Measurement and Sequential Testing for Wireless Sensor Networks Bing

Wang. In IEEE Transactions Journal on Mobile Computing.

Sanguthevar Rajasekaran and Hieu Dinh. A Speedup Technique for (l,d)-Motif Finding Algo-

rithms. In BMC Research Notes.

Xian Chen, Hieu Dinh, and Bing Wang. Cascading Failure in Smart Grid - Bene ts of Dis-

tributed Generation. In Proceedings of 1st IEEE International Conference on Smart Grid Com-

munications, Gaithersburg, MD, October 2010.

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh, Matthew Vaughn and Vishal Thapar.

E cient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs. In

BMC Bioinformatics Journal.

Vamsi Kundeti, Sanguthevar Rajasekaran, and Hieu Dinh. On the Border Length Minimization

Problem (BLMP) on a Square Array. In ACM-BCB 2010 (The 1st International Conference On

Bioinformatics and Computational Biology).

Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Kim, and Bing Wang. Data Collection

with Multiple Sinks in Wireless Sensor Networks. In WASA 2009 (International Conference on

Wireless Algorithms, Systems and Applications), Boston, USA, August, 2009.

Hieu Dinh, Yoo-Ah Kim, Seungjoon Lee, Min-ho Shin and Bing Wang. SDP-based Approach

for Channel Assignment in Wireless Networks. In DIAL M-POMC (Workshop on Foundation of

Mobile Computing), Portland, USA, August, 2007.

Hieu Dinh, Hang Boi Vu, and Tu Cam Nguyen. Hybrid HMM-MEMM Models for Informa-

tion Extraction. In The 6th Vietnam National Conference on Information Technology, DaNang,

Vietnam, August 2004.

2

Technical Skills

Programming languages: C/C++, C#, Java, PHP, Perl, Javascript.

Databases: Microsoft SQL Server, MySQL, Oracle.

Operating Systems: Windows, Linux/Unix.

Tools: Matlab, R Statistical Environment, Network Simulator (NS2).

Honors and Awards

Advanced Graduate Student Fellowship, 2012, School of Engineering, University of Connecticut,

in recognition of outstanding academic achievement and potential for future professional accom-

plishments in Engineering .

Summer Fellowship for Advanced Graduate Students, 2011, Department of Computer Science and

Engineering, University of Connecticut.

Information Technology Scholarship for outstanding students, awarded by the Vietnam Ministry

of Telecommunication and Motorola Corporation, 2005.

Annual Merit-based Scholarship, awarded by Vietnam National University Hanoi, 2002-2004.

Second Prize in Nationwide Mathematics Contest held by the Vietnamese Journal of Youth and

Mathematics, 1999.

Second Prize in Vietnamese Nationwide Mathematics Competition, 1998.

3

Contact this candidate