Publish in OALib Journal
APC: Only $99
Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity k and girth g(G) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree δ(G) ≥ 6 and girth g(G) ≥ 6.
Long-term survival of 116 leukemia/MDS patients received allo-SCT conditioned by a regimen with ATG-F or without ATG-F was analysed, together with the impact of ATG-F on the long-term survival, GVHD and disease relapse. Seventy patients received an ATG-F containing conditioning regimen FBCA, and 46 patients received a non-ATG-F FBC regimen. The FBCA regimen was associated with a 5-year survival of 65.4% in the complete HLA-matched group and 39.3% in the HLA-mismatched group. The difference between the two groups was significant (P = 0.012). For the FBC conditioning regimen, the 5-year overall survival of HLA-matched patients and the HLA-mismatched patients was 34.2% and 24.2% respectively (P = 0.216). The incidence of cGVHD was 32.9% and 83.6% in the FBCA and FBC condition regimen group respectively. Only 2.9% of the cases showed extensive cGVHD in the FBCA group while it was 69.4% in the FBC group (P = 0.00). Multivariate analysis indicated that relapse was related to the disease status and HLA typing, but unrelated to the conditioning regimens whether or not ATG-F was used (HR 0.54, P = 0.109). We conclude that the addition of ATG-F to conditioning regimen favours the longterm survival of allo-SCT.
This paper considers a new canonical duality theory for solving mixed
integer quadratic programming problem. It shows that this well-known NP-hard
problem can be converted into concave maximization dual problems without duality
gap. And the dual problems can be solved, under certain conditions, by polynomial algorithms.