Signal Processing Electrical

Zhenliang Zhang

Dept. of Electrical and Computer Engineering Phone: 970-***-****

Colorado State University E-mail: *********.*****@*********.***

Information

Fort Collins, CO 80523-1373 http://www.engr.colostate.edu/~zlzhang/

Distributed signal processing and social learning in complex network

Research

Stochastic optimization, combinatorial optimization

Interests

Quantum information theory and signal processing

Colorado State University (CSU), Fort Collins, Colorado USA

Education

Ph.D. Candidate, Electrical and Computer Engineering, Jan. 2010-Present

Advisors: Edwin K. P. Chong, Ali Pezeshki

Colorado State University, Fort Collins, Colorado USA

M.S., Physics, Sep. 2008-Dec. 2009

University of Science and Technology of China (USTC), Hefei, Anhui 230026 P. R. China

Special Class for Gifted Young

B.S., Physics, Sep. 2004-May. 2008

2012, Traveling Scholarship for North America Information Theory Summer School.

Honors and

Awards 2008, Excellent Undergraduate, USTC.

2004-2008, Scholarship for Comprehensive Excellence, USTC.

2004, Second Price of National Chemistry Olympiad, Anhui Province, China.

Colorado State University, Fort Collins, Colorado USA

Teaching

Experiences Sep. 2008-Dec. 2009, Physics for Scientists and Engineers (PH141) Teaching Assistant.

Duties include teaching recitation classes and lab., grading homework and exams.

Distributed detection/social learning: How fast can we learn from the actions of other agents?

Selected

Research Themes

Derived bounds on the rate at which agents in a hierarchical network can learn.

Studied the e ect of node an link failures on the rate.

Showed asymptotic learning in sequential hypothesis testing problem with non-ideal agents

and channels.

Stochastic/combinatorial optimization: How can we nd the globally optimal policy in a stochas-

tic process?

Applied dynamic programming method in sequential hypothesis testing problems.

Introduced the notion of string submodular function and derived the su cient conditions that

the greedy policy achieves a factor (1 e 1 ) of the globally optimal policy.

Languages: Mandarin, English

Languages and

Skills

Programming: MATLAB, C/C++, Python

Applications: Microsoft O ce, Latex, html/css (jemdoc)

1

Electrical Engineering : Random processes, signal processing, communication theory, informa-

Relevant Courses

and Background tion theory, detection theory, estimation and ltering theory.

(graduate level)

Mathematics : Real analysis and functional analysis, combinatorics, group theory and coding

theory, probability theory, graph theory.

Physics : Classical mechanics, electromagnetism, quantum mechanics, solid state physics.

Journal Articles 1. Z. Zhang, A. Pezeshki, W. Moran, S. D. Howard, and E. K. P. Chong, Error probability

bounds for balanced binary relay trees, IEEE Tran. on Inform. Theory, vol. 58, no. 6, pp.

3548 3563, Jun. 2012.

2. Z. Zhang, E. K. P. Chong, A. Pezeshki, W. Moran, and S. D. Howard,, Detection perfor-

mance of balanced binary relay trees with node and link failures, IEEE Tran. on Signal

Process., submitted.

3. Z. Zhang, E. K. P. Chong, A. Pezeshki, W. Moran, and S. D. Howard,, Rate of learning in

hierarchical social networks, IEEE Journal of Selected topics in Signal Process., submitted.

Technical Report 1. Z. Zhang, E. K. P. Chong, W. Moran, S. D. Howard, and A. Pezeshki, Information fusion and

control in hierarchical systems, nal Report submitted to AFOSR under Contract FA9550-

09-1-0518.

Conference 1. Z. Zhang, A. Pezeshki, W. Moran, S. D. Howard, and E. K. P. Chong, Performance analysis

Articles and of fusion trees, presented at the 1st Southwest Workshop on Theory and Applications of

Presentations Cyber-Physical Systems, Tucson, Arizona, March 10 11, 2011.

2. Z. Zhang, A. Pezeshki, W. Moran, S. D. Howard, and E. K. P. Chong, Error probability

bounds for balanced binary relay trees with crummy sensors, in Proc. of the 2011 Workshop

on Defense Applications of Signal Processing (DASP 11), The Hyatt Coolum Resort, Coolum,

Queensland, Australia, July 10 14, 2011 (Invited Paper).

3. Z. Zhang, A. Pezeshki, W. Moran, S. D. Howard, and E. K. P. Chong, Error probability

bounds for binary relay trees with unreliable communications, in Proc. of the Asilomar

Conference on Signals, Systems, and Computers, Asilomar Hotel and Conference Grounds,

Paci c Grove, California, November 6 9, 2011, pp. 1869 1873.

4. Z. Zhang, A. Pezeshki, W. Moran, S. D. Howard, and E. K. P. Chong, Error probability

bounds for balanced binary relay trees, in Proc. of the Joint 50th IEEE Conference on

Decision and Control and European Control Conference, Orlando, Florida, December 12 15,

2011, pp. 7876 7881.

5. Z. Zhang, E. K. P. Chong, and A. Pezeshki, Convergence rate of Bayesian learning in

social networks, presented at the Symposium on Network Science in Biological, Social, and

Geographic Systems, University of Wyoming, Laramie, Wyoming, April 21, 2012.

6. Z. Zhang, E. K. P. Chong, and A. Pezeshki, Rate of Bayesian learning in hierarchical

social networks, presented at the 2012 North American School of Information Theory, Cornell

University, Ithaca, NY, June 19 22, 2012.

7. Z. Zhang, E. K. P. Chong, and A. Pezeshki, Detection performance of M -ary relay trees

with non-binary message alphabets, in Proc. of Statistical Signal Process. Workshop, Ann

Arbor, MI, Aug. 58, 2012.

8. Z. Zhang, E. K. P. Chong, A. Pezeshki, W. Moran, and S. D. Howard, Rate of learning in

hierarchical social networks, in Proc. of the 50th Allerton Conference, to appear.

9. Z. Zhang, E. K. P. Chong, and A. Pezeshki, Submodularity and optimality of fusion rules

in balanced binary relay trees, in Proc. of 51th IEEE Conference on Decision and Control,

2012, to appear.

2

Contact this candidate