Assistant Management

Yuan Zhong

Operations Research Center O ce phone: 617-***-****

Massachusetts Institute of Technology Mobile phone: 617-***-****

Information

** ************* ******, ***-*** E-mail: ********@***.***

Cambridge, MA 02139 Web: www.mit.edu/~zhyu4118

Applied probability, analysis of complex stochastic networks,

Research

with applications to large-scale information and service systems.

Interests

Massachusetts Institute of Technology, Cambridge, MA

Education

Sloan School of Management Operations Research Center

Ph.D in Operations Research September 2008 present

Cumulative GPA: 5.0/5.0

Expected graduation date: June 2012

Advisors: Devavrat Shah and John N. Tsitsiklis

Coursework: queueing theory, machine learning, network science, inventory management,

revenue management, healthcare delivery systems, several optimization courses

California Institute of Technology, Pasadena, CA

Division of Physics, Mathematics and Astronomy

M.A in Mathematics June 2008

Cumulative GPA: 4.2/4.0

University of Cambridge, Cambridge, United Kingdom

School of the Physical Sciences

B.A in Mathematics with First Class Honors June 2006

D. Shah, N. Walton, and Y. Zhong, Optimal queue-size scaling in switched networks, submitted to

Journal

the Annals of Applied Probability.

Publications

D. Shah, J. N. Tsitsiklis, and Y. Zhong, Qualitative properties of -fair policies in bandwidth-sharing

networks, submitted to the Annals of Applied Probability.

D. Shah, J. N. Tsitsiklis, and Y. Zhong, Optimal scaling of average queue sizes in an input-queued

switch: an open problem, Queueing Systems, Vol. 68, no. 3-4, pp. 375-384, 2011.

D. Shah, N. Walton, and Y. Zhong, Optimal queue-size scaling in switched networks, accepted to

Conference

appear in Proceedings of the ACM Sigmetrics 2012, London, United Kingdom, June 2012.

Publications

D. Shah, J. N. Tsitsiklis, and Y. Zhong, Qualitative properties of -weighted scheduling policies,

Proceedings of the ACM Sigmetrics 2010, New York, NY, June 2010.

D. Shah, N. Walton, and Y. Zhong, Optimal queue-size scaling in stochastic processing networks,

Working

in preparation.

Papers

D. Shah, J. N. Tsitsiklis, and Y. Zhong, A note on queue-size scaling for input-queued switches, in

preparation.

D. Shah, J. N. Tsitsiklis, and Y. Zhong, On the existence of heavy-tra c limit points for -weighted

policies, in preparation.

Massachusetts Institute of Technology

Teaching

Experience Teaching Assistant 2008 present

15.066 System Optimization and Analysis for Manufacturing (Global Operations MBA)

15.085 Fundamentals of Probability (Ph.D)

California Institute of Technology

Teaching Assistant 2006 2008

Ma1 Calculus of One and Several Variables and Linear Algebra (Undergraduate)

Ma112 Statistics (Undergraduate)

Oracle Corporation, Burlington, MA

Professional

Experience Intern Scientist June 2010 August 2010

Analyzed large-scale networked data of retail transactions to design ranking schemes according to

various composite criteria of interests to a retail business.

Qualitative properties of -weighted scheduling policies

Conferences

and Talks ACM Sigmetrics Conference, New York, NY, USA, June 2010

LIDS Student Conference, Cambridge, MA, USA, January 2010

Qualitative properties of -fair policies in bandwidth-sharing networks

LIDS Student Conference, Cambridge, MA, USA, January 2011

Applied Probability Society Conference, Stockholm, Sweden, July 2011

Cambridge Commonwealth Trust, 2003 2006

Honors and

Awards Singapore Mathematics Olympiad Gold Medal (1st place), July 2001

Singapore Ministry of Education Scholarship, 1999 2002

Student member of INFORMS and Applied Probability Society

Professional

Activities Reviewer for Queueing Systems

Available upon request.

References

Contact this candidate