| 姓名: | 何斯迈 |
| 最后学位: | 博士 |
| 职称: | 教授 |
| 公共职务: | |
| 导师岗位: | 博导 |
| 办公室: | 402 |
| 电话: | 65901715 |
| Email: | [email protected] |
一、受教育经历(从大学本科开始,按时间倒排序)
2006/8-2009/7,香港中文大学,系统工程与工程管理学系,博士
1997/8-2001/6,美国布朗大学(Brown University), 数学系,硕士
1992/8-1997/7,中国科学技术大学,数学系,本科
二、研究工作经历(按时间倒排序)
2014/5 - 至今，上海财经大学，信息管理与工程学院，教授
2010/2 - 2014/5,香港城市大学,管理科学系,助理教授(Tenure-track)
2009/9 - 2010/1,香港中文大学,系统工程与工程管理学系,博士后研究员
2005/10 - 2006/7,香港中文大学,系统工程与工程管理学系,助理研究员
1.Probability bounds for polynomial functions in random variables
S He, B Jiang, Z Li, S Zhang
Mathematics of Operations Research 7 2014
2.Inhomogeneous polynomial optimization over a convex set: An approximation approach
S He, Z Li, S Zhang
Mathematics of Computation 2 2014
3.Moments tensors, Hilbert's identity, and k-wise uncorrelated random variables
B Jiang, S He, Z Li, S Zhang
Mathematics of Operations Research 2 2013
4.Technical note-preservation of supermodularity in parametric optimization problems with nonlattice structures
X Chen, P Hu, S He
Operations Research 61 (5), 1166-1173 2 2013
5.On a generalized Cournot oligopolistic competition game
S He, X Wang, S Zhang
Journal of Global Optimization 56 (4), 1335-1345 2013
6.Approximation algorithms for discrete polynomial optimization
S He, Z Li, S Zhang
Journal of the Operations Research Society of China 1 (1), 3-36 5 2013
7.Approximation methods for polynomial optimization: models, algorithms, and applications
Z Li, S He, S Zhang
Springer 13 2012
8.Polymatroid optimization, submodularity, and joint replenishment games
S He, J Zhang, S Zhang
Operations research 60 (1), 128-137 6 2012
9.Maximum block improvement and polynomial optimization
B Chen, S He, Z Li, S Zhang
SIAM Journal on Optimization 22 (1), 87-107 33 2012
10.Extensions of the Constraint Sets
Z Li, S He, S Zhang
Approximation Methods for Polynomial Optimization, 53-97 2012
11.Polynomial Optimization Over the Euclidean Ball
Z Li, S He, S Zhang
Approximation Methods for Polynomial Optimization, 23-51 2012
12.Geometric rounding: a dependent randomized rounding scheme
D Ge, S He, Y Ye, J Zhang
Journal of combinatorial optimization 22 (4), 699-725 2 2011
13.The cost of cache-oblivious searching
MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ...
Algorithmica 61 (2), 463-505 4 2011
14.When all risk-adjusted performance measures are the same: In praise of the Sharpe ratio
L Chen, S He, S Zhang
Quantitative Finance 11 (10), 1439-1447 10 2011
15.Tight bounds for some risk measures, with applications to robust portfolio selection
L Chen, S He, S Zhang
Operations Research 59 (4), 847-865 37 2011
16.A Note on Hilbert’s Identity
S He, B Jiang, Z Li, S Zhang
Technical Report SEEM2011-01, Department of Systems Engineering ... 1 2011
17.Preservation of supermodularity in two dimensional parametric optimization problems and its applications
X Chen, P Hu, S He
Working paper, University of Illinois at Urbana-Champaign. Urbana, IL 61801 5 2011
18.Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
S He, Z Li, S Zhang
Mathematical programming 125 (2), 353-383 48 2010
19.Bounding probability of small deviation: A fourth moment approach
S He, J Zhang, S Zhang
Mathematics of Operations Research 35 (1), 208-232 14 2010
20.General constrained polynomial optimization: an approximation approach
S He, Z Li, S Zhang 11 2009
21.Improved bounds on sorting by length-weighted reversals
MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan
Journal of Computer and System Sciences 74 (5), 744-774 9 2008
22.Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization
S He, ZQ Luo, J Nie, S Zhang
SIAM Journal on Optimization 19 (2), 503-523 50 2008
23.Geometric rounding: A dependent rounding scheme for allocation problems
D Ge, S He, Z Wang, Y Ye, S Zhang April 3 2008
24.Randomized portfolio selection with constraints
J Xie, S He, S Zhang
Pacific Journal of Optimization 4, 89-112 9 2008
25.Randomized Portfolio Selection, with Constraints
XIE Jiang, S HE, S ZHANG 2006
26.Adversarial contention resolution for simple channels
MA Bender, M Farach-Colton, S He, BC Kuszmaul, CE Leiserson
Proceedings of the seventeenth annual ACM symposium on Parallelism in ... 64 2005
27.Adversarial analyses of window backoff strategies
MA Bender, M Farach-Colton, S He, BC Kuszmaul, CE Leiserson
Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th ... 2004
28.Improved bounds on sorting with length-weighted reversals
MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete ... 29 2004
29.Sorting by length-weighted reversals: Dealing with signs and circularity
F Swidan, MA Bender, D Ge, S He, H Hu, RY Pinter
Combinatorial Pattern Matching, 32-46 17 2004
30.The cost of cache-oblivious searching
MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ...
Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE ... 37 2003
31.The Development of the Determination of Thiocyanate
SM He, XY Chen
JOURNAL-HEBEI NORMAL UNIVERSITY NATURAL SCIENCE EDITION 23, 388-392 1999
32.On the S-Lemma for Univariate Polynomials
S HE, MH WONG, S ZHANG
33.Numerical Algebra, Control and Optimization (NACO)
S He, M Li, S Zhang, ZQ Luo
34.The Cost of Cache-Oblivious Searching
S He, H Hu, J Iacono, A López-Ortiz
35.Improved Bounds on Sorting with Length-Weighted Reversals (Extended Abstract)
Michael A. Bender*† Dongdong Ge* Simai He* Haodong Hu* Ron Y. Pinter* Steven Skiena* Firas Swidan
MA Bender, D Ge, S He, H Hu
36.A Lower Bound on Sorting With Length-Weighted Reversals
EM Arkin, MA Bender, D Ge, S He, H Hu, JSB Mitchell, S Skiena
37.Bounding Probability of Small Deviation: A Fourth Moment Approach
Mathematics of Operations Research 2010 35: 208-232; doi: 10.1287/moor. 1090.0438
S He, J Zhang, S Zhang
1992/1,北京,第 7 届全国中学生数学冬令营,国家队选拔赛,第一名
1992/7,莫斯科,第 33 届国际数学奥林匹克竞赛,金牌
1994/7,中国科学院数学研究所,第八届全国大学生数学夏令营数学竞赛华晨奖,第三名
2014/10，中国运筹学会青年科技奖