Liu Gang ( Chinese 刘刚 ; January 30, 1961 ) is a Chinese scholar and political activist.
| Liu Gang | |
|---|---|
| Date of Birth | |
| Place of Birth | |
| A country | |
| Scientific field | physics computer science maths |
| Place of work | |
| Alma mater | |
| Site | |
Biography
Before the events of the events in Tiananmen Square, Liu studied theoretical physics (mechanics, aerodynamics, optics, materials science). He received a master's degree in physics from Peking University in 1984. He taught, also worked in companies and units of the Chinese Academy of Sciences .
In the early 1980s, he met Fan Lichzhi . Liu organized the Independent Student Union of Beijing and was one of the most prominent student leaders during the events in Tiananmen Square . Two weeks after that he was arrested. He was sentenced to 6 years in prison [1] .
After emigrating to the United States in 1996, he received a master's degree in computer science from Columbia University . Liu worked at Bell Labs ( New Jersey ).
Research
Liu with Ramakrishnan KG Ramakrishnan proposed the A * Prune routing algorithm, comparable in performance to the best routing algorithms for testing on random graphs [2] .
He has developed software and a new class of optical routers for optical telecommunications.
His new research, the T-Forward method, is a new solver for achieving the best results in a mathematical model and in a closed form solution for a convex nonlinear programming function (NLP). Linear programming is a special case of mathematical optimization. The T-forward method moves forward within the feasible region from the T-shaped path to the increasing direction of the objective function. [27] In theory, the T-Forward method is an improved version of linear programming, and it provides the most convenient and accurate way to solve linear programming problems in mathematical optimization theory. was proposed by Liu Gang in 2014. [3]
Links
- ↑ Human Rights Watch - Liu Gang - Tiananmen Square, 15 Years On
- ↑ CiteSeerX - A * Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints
- ↑ Liu Gang, T-Forward Method: A Closed-Form Solution and Polynomial Time Approach for Convex Nonlinear Programming (Li-Gang Method, Polynomial Time Approach for Convex Nonlinear Programming)