Objective To explore the dynamic changes of the cellular immune function in severe infection after liver transplantation,and to guide the individualized immunology adjustment. Methods 378 cases of liver transplantatio...Objective To explore the dynamic changes of the cellular immune function in severe infection after liver transplantation,and to guide the individualized immunology adjustment. Methods 378 cases of liver transplantation were analyzed retrospectively. Seventy - four cases ( infection group) suffered serious infection,including 54 cases cured ( cure group) ,20 cases died (展开更多
In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function...In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient.展开更多
Based on KKT complementary condition in optimization theory, an unconstrained non-differential optimization model for support vector machine is proposed. An adjustable entropy function method is given to deal with the...Based on KKT complementary condition in optimization theory, an unconstrained non-differential optimization model for support vector machine is proposed. An adjustable entropy function method is given to deal with the proposed optimization problem and the Newton algorithm is used to figure out the optimal solution. The proposed method can find an optimal solution with a relatively small parameter p, which avoids the numerical overflow in the traditional entropy function methods. It is a new approach to solve support vector machine. The theoretical analysis and experimental results illustrate the feasibility and efficiency of the proposed algorithm.展开更多
To solve the inequality problem, an adjustable entropy method is proposed. An inequality problem can be transformed into a minimax problem which is nondifferentiable; then an adjustable entropy is used to smooth the m...To solve the inequality problem, an adjustable entropy method is proposed. An inequality problem can be transformed into a minimax problem which is nondifferentiable; then an adjustable entropy is used to smooth the minimax problem. The solution of inequalities can be approached by using a BFGS algorithm of the standard optimization method. Some properties of the new approximate function are presented and then the global convergence are given according to the algorithm. Two numerical examples illustrate that the proposed method is efficient and is superior to the former ones.展开更多
文摘Objective To explore the dynamic changes of the cellular immune function in severe infection after liver transplantation,and to guide the individualized immunology adjustment. Methods 378 cases of liver transplantation were analyzed retrospectively. Seventy - four cases ( infection group) suffered serious infection,including 54 cases cured ( cure group) ,20 cases died (
基金Supported by the National Natural Science Foundation of China(50 1 740 51 )
文摘In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient.
基金the National Natural Science Foundation of China (60574075)
文摘Based on KKT complementary condition in optimization theory, an unconstrained non-differential optimization model for support vector machine is proposed. An adjustable entropy function method is given to deal with the proposed optimization problem and the Newton algorithm is used to figure out the optimal solution. The proposed method can find an optimal solution with a relatively small parameter p, which avoids the numerical overflow in the traditional entropy function methods. It is a new approach to solve support vector machine. The theoretical analysis and experimental results illustrate the feasibility and efficiency of the proposed algorithm.
文摘To solve the inequality problem, an adjustable entropy method is proposed. An inequality problem can be transformed into a minimax problem which is nondifferentiable; then an adjustable entropy is used to smooth the minimax problem. The solution of inequalities can be approached by using a BFGS algorithm of the standard optimization method. Some properties of the new approximate function are presented and then the global convergence are given according to the algorithm. Two numerical examples illustrate that the proposed method is efficient and is superior to the former ones.
