Coronary heart disease is among the most prevalent and costly of all global health problems. Coronary artery bypass grafting (CABG) has been increasingly used since the 1960s. Coronary heart disease is a leading cause...Coronary heart disease is among the most prevalent and costly of all global health problems. Coronary artery bypass grafting (CABG) has been increasingly used since the 1960s. Coronary heart disease is a leading cause of death worldwide, including Sudan. Self-efficacy and functional capacity is a critical factor for quality of life in patients who has undergone CABG as well as for their caregivers from their families. Aim of the Study: To explore the effects of an educational program on self-efficacy and functional capacity of patients after CABG. 1) There will be no significant difference between the intervention group and control group concerning knowledge regarding Self-efficacy and functional capacity post CABG surgery. 2) The application of our educational program for the patients will enhance the patients with CABG surgery and improve knowledge about Self-efficacy and functional capacity post CABG surgery. 3) There are some socio demographic factors that affect the response to the educational program. Methods: This was a quasi-experimental, interventional and hospital-based study, including pre-test, a post-test and follow-up test, with a control group, conducted during the period from September 2014 to June 2019. Patients were recruited consecutively to the cases and control group using convenience sampling. The sample consisted of 76 patients;41 as cases and 35 as control group. The sample included those who had undergone CABG in Khartoum State. Relevant data were collected using a checklist to monitor the effect of a health education program on self-efficacy and functional capacity of the patients. Result: The results showed marked improvement in patients’ self-efficacy and functional capacity between pretest and posttest for the study group;p-value = (0.001) in the health status of cases in comparison to the control group. The indices were observed to be higher for patients who received a nursing educational program throughout the study period;p-value = (0.002).展开更多
The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is signifi...The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.展开更多
The motor relearning program can significantly improve various functional disturbance induced by ischemic cerebrovascular diseases. However, its mechanism of action remains poorly understood. In injured brain tissues,...The motor relearning program can significantly improve various functional disturbance induced by ischemic cerebrovascular diseases. However, its mechanism of action remains poorly understood. In injured brain tissues, glial fibrillary acidic protein and neurofilament protein changes can reflect the condition of injured neurons and astrocytes, while vascular endothelial growth factor and basic fibroblast growth factor changes can indicate angiogenesis. In the present study, we induced ischemic brain injury in the rhesus macaque by electrocoagulation of the M1 segment of the right middle cerebral artery. The motor relearning program was conducted for 60 days from the third day after model establishment. Immunohistochemistry and single-photon emission CT showed that the numbers of glial fibrillary acidic protein-, neurofilament protein-, vascular endothelial growth factor- and basic fibroblast growth factor-positive cells were significantly increased in the infarcted side compared with the contralateral hemisphere following the motor relearning program. Moreover, cerebral blood flow in the infarcted side was significantly improved. The clinical rating scale for stroke was used to assess neurological function changes in the rhesus macaque following the motor relearning program. Results showed that motor function was improved, and problems with consciousness, self-care ability and balance function were significantly ameliorated. These findings indicate that the motor relearning program significantly promoted neuronal regeneration, repair and angiogenesis in the surroundings of the infarcted hemisphere, and improve neurological function in the rhesus macaque following brain ischemia.展开更多
In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and...In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed.展开更多
New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebr...New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.展开更多
In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem....In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.展开更多
Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing,communication control, and management, in real applications naturally result in global optimiza...Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing,communication control, and management, in real applications naturally result in global optimization formulations in a form ofnonlinear global integer programming. This paper gives a modified filled function method to solve the nonlinear global integerprogramming problem. The properties of the proposed modified filled function are also discussed in this paper. The results ofpreliminary numerical experiments are also reported.展开更多
A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled functi...A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover, we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the pro- posed quasi-filled function algorithm.展开更多
An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstr...An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem variables and the local minimizers of the original constrained problem. Furthermore, under some assumptions, the relationship was also established between the global solutions of the augmented Lagrangian function on some compact subset of the space of problem variables and the global solutions of the constrained problem. Therefore, f^om the theoretical point of view, a solution of the inequality constrained problem and the corresponding values of the Lagrange multipliers can be found by the well-known method of multipliers which resort to the unconstrained minimization of the augmented Lagrangian function presented.展开更多
LP (Logic Programming) has been successfully applied to knowledge discovery in many fields. The execution of the LP is based on the evaluation of the first order predicate. Usually the information involved in the pred...LP (Logic Programming) has been successfully applied to knowledge discovery in many fields. The execution of the LP is based on the evaluation of the first order predicate. Usually the information involved in the predicates are local and homogenous, thus the evaluation process is relatively simple. However, the evaluation process become much more complicated when applied to KDD on the Internet where the information involved in the predicates maybe heterogeneous and distributed over many different sits. Therefor, we try to attack the problem in a multi agent system's framework so that the logic program can be written in a site independent style and deal easily with heterogeneous represented information.展开更多
In this paper, two duality results are established under generalized ρ-convexity conditions for a class of multiobjective fractional programmign involvign differentiable n-sten functions.
A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. Th...A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm.展开更多
We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear p...We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision. Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original problem.展开更多
A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under s...A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under second-order strict pseudoinvexity, second-order pseudoinvexity and second-order quasi-invexity assumptions on functionals, weak, strong, strict converse and converse duality theorems are established for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between the duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.展开更多
A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order in...A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.展开更多
This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties o...This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.展开更多
文摘Coronary heart disease is among the most prevalent and costly of all global health problems. Coronary artery bypass grafting (CABG) has been increasingly used since the 1960s. Coronary heart disease is a leading cause of death worldwide, including Sudan. Self-efficacy and functional capacity is a critical factor for quality of life in patients who has undergone CABG as well as for their caregivers from their families. Aim of the Study: To explore the effects of an educational program on self-efficacy and functional capacity of patients after CABG. 1) There will be no significant difference between the intervention group and control group concerning knowledge regarding Self-efficacy and functional capacity post CABG surgery. 2) The application of our educational program for the patients will enhance the patients with CABG surgery and improve knowledge about Self-efficacy and functional capacity post CABG surgery. 3) There are some socio demographic factors that affect the response to the educational program. Methods: This was a quasi-experimental, interventional and hospital-based study, including pre-test, a post-test and follow-up test, with a control group, conducted during the period from September 2014 to June 2019. Patients were recruited consecutively to the cases and control group using convenience sampling. The sample consisted of 76 patients;41 as cases and 35 as control group. The sample included those who had undergone CABG in Khartoum State. Relevant data were collected using a checklist to monitor the effect of a health education program on self-efficacy and functional capacity of the patients. Result: The results showed marked improvement in patients’ self-efficacy and functional capacity between pretest and posttest for the study group;p-value = (0.001) in the health status of cases in comparison to the control group. The indices were observed to be higher for patients who received a nursing educational program throughout the study period;p-value = (0.002).
基金supported by the National Science Foundation of China (70771080)Social Science Foundation of Ministry of Education (10YJC630233)
文摘The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.
基金supported by the Combined pecific Foundation of Department of Science and Technology of Yunnan Province and Kunming Medical University,No.2008CD037
文摘The motor relearning program can significantly improve various functional disturbance induced by ischemic cerebrovascular diseases. However, its mechanism of action remains poorly understood. In injured brain tissues, glial fibrillary acidic protein and neurofilament protein changes can reflect the condition of injured neurons and astrocytes, while vascular endothelial growth factor and basic fibroblast growth factor changes can indicate angiogenesis. In the present study, we induced ischemic brain injury in the rhesus macaque by electrocoagulation of the M1 segment of the right middle cerebral artery. The motor relearning program was conducted for 60 days from the third day after model establishment. Immunohistochemistry and single-photon emission CT showed that the numbers of glial fibrillary acidic protein-, neurofilament protein-, vascular endothelial growth factor- and basic fibroblast growth factor-positive cells were significantly increased in the infarcted side compared with the contralateral hemisphere following the motor relearning program. Moreover, cerebral blood flow in the infarcted side was significantly improved. The clinical rating scale for stroke was used to assess neurological function changes in the rhesus macaque following the motor relearning program. Results showed that motor function was improved, and problems with consciousness, self-care ability and balance function were significantly ameliorated. These findings indicate that the motor relearning program significantly promoted neuronal regeneration, repair and angiogenesis in the surroundings of the infarcted hemisphere, and improve neurological function in the rhesus macaque following brain ischemia.
文摘In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed.
基金Supported by the NSF of Shaanxi Provincial Educational Department(06JK152)
文摘New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.
文摘In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.
文摘Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing,communication control, and management, in real applications naturally result in global optimization formulations in a form ofnonlinear global integer programming. This paper gives a modified filled function method to solve the nonlinear global integerprogramming problem. The properties of the proposed modified filled function are also discussed in this paper. The results ofpreliminary numerical experiments are also reported.
基金Project (Nos. 10571137 and 10271073) supported by the NationalNatural Science Foundation of China
文摘A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover, we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the pro- posed quasi-filled function algorithm.
文摘An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem variables and the local minimizers of the original constrained problem. Furthermore, under some assumptions, the relationship was also established between the global solutions of the augmented Lagrangian function on some compact subset of the space of problem variables and the global solutions of the constrained problem. Therefore, f^om the theoretical point of view, a solution of the inequality constrained problem and the corresponding values of the Lagrange multipliers can be found by the well-known method of multipliers which resort to the unconstrained minimization of the augmented Lagrangian function presented.
文摘LP (Logic Programming) has been successfully applied to knowledge discovery in many fields. The execution of the LP is based on the evaluation of the first order predicate. Usually the information involved in the predicates are local and homogenous, thus the evaluation process is relatively simple. However, the evaluation process become much more complicated when applied to KDD on the Internet where the information involved in the predicates maybe heterogeneous and distributed over many different sits. Therefor, we try to attack the problem in a multi agent system's framework so that the logic program can be written in a site independent style and deal easily with heterogeneous represented information.
文摘In this paper, two duality results are established under generalized ρ-convexity conditions for a class of multiobjective fractional programmign involvign differentiable n-sten functions.
基金Project (No. 10271073) supported by the National Natural Science Foundation of China
文摘A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm.
文摘We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision. Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original problem.
文摘A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under second-order strict pseudoinvexity, second-order pseudoinvexity and second-order quasi-invexity assumptions on functionals, weak, strong, strict converse and converse duality theorems are established for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between the duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.
文摘A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.
文摘This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.
