Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.In this paper,it is discussed how to solve the minimum feedback vertex s...Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.In this paper,it is discussed how to solve the minimum feedback vertex set problem and the minimum vertex feedback edge set problem efficiently by using dynamic programming on a tree-decomposition.展开更多
In this paper, we use the solutions of forward-backward stochastic differential equations to get the explicit form of the optimal control for linear quadratic stochastic optimal control problem and the open-loop Nash ...In this paper, we use the solutions of forward-backward stochastic differential equations to get the explicit form of the optimal control for linear quadratic stochastic optimal control problem and the open-loop Nash equilibrium point for nonzero sum differential games problem. We also discuss the solvability of the generalized Riccati equation system and give the linear feedback regulator for the optimal control problem using the solution of this kind of Riccati equation system.展开更多
Journal evaluation is a compliated engineering system, how to evaluate academic journals more scientifically in scientific methods have becomes a problem of great concerns. This paper presents attribute mathematical m...Journal evaluation is a compliated engineering system, how to evaluate academic journals more scientifically in scientific methods have becomes a problem of great concerns. This paper presents attribute mathematical model for comprehensive index system' quality evaluation for natural science academic journals, aiming to make comprehensive index system' quality evaluation for academic journals more objective and reasonable compared with other quantitative evaluation ways.展开更多
In this paper, we pose an algorithm to find a packing of two graphs Gl and G2, where G1 is composed of a tree with k edges and an independent set and G2 contains no cycles of length 4 and ｜E(G2)｜ <1/2nk. The pack...In this paper, we pose an algorithm to find a packing of two graphs Gl and G2, where G1 is composed of a tree with k edges and an independent set and G2 contains no cycles of length 4 and ｜E(G2)｜ <1/2nk. The packing problem is a restatement of the Erdos and Sos Conjecture with the complement of G contains no cycles of length 4.展开更多
基金Partially supported by the National Natural Science Foundation of China( 1 0 2 71 0 65
文摘Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.In this paper,it is discussed how to solve the minimum feedback vertex set problem and the minimum vertex feedback edge set problem efficiently by using dynamic programming on a tree-decomposition.
基金This work is supported by the National Natural Science Foundation (Grant No.10371067)the Youth Teacher Foundation of Fok Ying Tung Education Foundation, the Excellent Young Teachers Program and the Doctoral Program Foundation of MOE and Shandong Province, China.
文摘In this paper, we use the solutions of forward-backward stochastic differential equations to get the explicit form of the optimal control for linear quadratic stochastic optimal control problem and the open-loop Nash equilibrium point for nonzero sum differential games problem. We also discuss the solvability of the generalized Riccati equation system and give the linear feedback regulator for the optimal control problem using the solution of this kind of Riccati equation system.
文摘Journal evaluation is a compliated engineering system, how to evaluate academic journals more scientifically in scientific methods have becomes a problem of great concerns. This paper presents attribute mathematical model for comprehensive index system' quality evaluation for natural science academic journals, aiming to make comprehensive index system' quality evaluation for academic journals more objective and reasonable compared with other quantitative evaluation ways.
文摘In this paper, we pose an algorithm to find a packing of two graphs Gl and G2, where G1 is composed of a tree with k edges and an independent set and G2 contains no cycles of length 4 and ｜E(G2)｜ <1/2nk. The packing problem is a restatement of the Erdos and Sos Conjecture with the complement of G contains no cycles of length 4.
