(1) I had 11 papers in Vietnamese.  Four papers in the journal of natural science of University of pedagogy, HCM city; and seven papers in national conferences. Here are some papers about my algorithm in Vietnamese.
[1] Hao T.V., Thong N.H. – “Giải thuật Tìm Kiếm Ngẫu Nhiên theo Xác Suất cho bài toán Tối Ưu Một Mục Tiêu”, Report of National workshop IX, “Some selective problems of Information technology and Communication”, Đà Lạt, Việt Nam, 2006.
[2] Hao T.V., Thong N.H. – “Giải một số bài toán Tối Ưu Đa Mục Tiêu sử dụng giải thuật Tìm Kiếm Ngẫu Nhiên theo Xác Suất”, Report of National workshop VIII, “Some selective problems of Information technology and Communication”,Hải Phòng, Việt Nam, 2005.
[3] Hao T.V., Thong N.H. – “Giải một số bài toán Tối Ưu Kỹ Thuật sử dụng giải thuật Tìm Kiếm Ngẫu Nhiên theo Xác Suất”, The Second National Symposium “Fundamental and Applied Information Technology Research”, FAIR’2005, Đại học Bách Khoa TP Hồ Chí Minh, Việt Nam, 2005.
[4] Hao T.V., Thong N.H. – “Giải một số bài toán Tối Ưu Kỹ Thuật sử dụng giải thuật Tìm Kiếm Ngẫu Nhiên theo Xác Suất”, Report of National workshop VII, “Some selective problems of Information technology and Communication”,Đà Nẵng, Việt Nam, 2004.
[5] Hao T.V., Thong N.H. – “Tối ưu số bằng giải thuật tìm kiếm ngẫu nhiên theo xác suất”, Report of National workshop VI, “Some selective problems of Information technology and Communication”,Thái Nguyên, Việt Nam, 2003.
[6] Hao T.V., Thong N.H. – “Tối ưu số bằng giải thuật tìm kiếm ngẫu nhiên theo xác suất”, Report  of National Mathematics Conference VI, Huế, Việt Nam, 2002. 

(2) 
Hao Tran Van		
        Address:	University of pedagogy
280, An Duong Vuong, 5 district, 
Ho Chi Minh city 
			e-mail: hao_tv2006@yahoo.com
Thong Nguyen Huu
        Address:	University of pedagogy
280, An Duong Vuong, 5 district, Ho Chi Minh city 
			e-mail: thong_nh2002@yahoo.com
(3) No.

(4) Abstract of the paper: This paper proposes a new numerical optimization technique, the Random Search via Probability Algorithm (RSPA), for single optimization problem. There are three problems: 1-To evaluate objective functions, the role of left digit is more important than the role of right digit of a decided variable, 2-The relation of decided variables in the formula of constrains and object function, 3-We can’t calculate exactly the number of iterance of a random algorithm. Based on these remarks, we calculate mutative changing probabilities of digits of decided variables for searching optimal solutions, we select k (1≤k≤n) variables to change the value of variables for every iterance, and we use unfixed number of iterance, which has capability to find an optimal solution first with necessary number of iterance. We tested this approach by implementing the Random Search via Probability Algorithm on some test single objective optimization problems, and we found results very stable.

(5)  the criteria werre satisfies: D, E, F, G.

(6)  This is a new approach for numerical optimzation problems. Referring to the eight criteria for establishing that an automatically created result is competitive with a human-produced result, the creation by the Random Search via Probability Algorithm (RSPA) for numerical optimization problems satisfies the following five of the eight criteria:
(E) The result is equal to or better than the most recent human-created solution to a long-standing problem for which there has been a succession of increasingly better human-created solutions.
(F) The result is equal to or better than a result that was considered an achievement in its field at the time it was first discovered.
(G) The result solves a problem of indisputable difficulty in its field. 

(7) No, this is the first time we announce the new version of our algorithm. 

(8) Any prize money, if any, is to be divided equally among the co-authors

(9) Our algorithm is a new invention. The results of four engineering design problems (Design of a Welded Beam, Design of a Pressure Vessel, Minimization of the Weight of a Tension/Compression String, Minimization of the Weight of a Speed Reducer) are equal to or better than than previous results that were found by genetic algorithm or other algorithms.