A Moonment to Remember,as a brand event held by China Cultural Centers and China National Tourist Offices around the world to celebrate the Mid-Autumn Festival,has been organized for 8 successive years.
Background: Fractures of humeral shaft in adults are common injuries. Humeral shafts non-union either from late presentation after initial treatment by traditional bone setters or failed non-operative orthodox care is...Background: Fractures of humeral shaft in adults are common injuries. Humeral shafts non-union either from late presentation after initial treatment by traditional bone setters or failed non-operative orthodox care is a major problem in this part of the world. This non-union is a major treatment challenge with increased cost of care and morbidity in this part of the world. Humeral shaft non-union can be treated with locked intra-medullary nailing (LIMN) or dynamic compression plating (DCP). Study on comparison of these methods of fixation in this part of the world is scarce in literature search, hence the reason for this study. Objective: The objectives of this study are: (1) to compare early clinical outcome following fixation of humeral shaft fracture nonunion with DCP versus LIMN;(2) to compare the time of radiologic fracture union of DCP with LIMN;(3) to compare complications following fixation of humeral shaft fracture nonunion with DCP versus LIMN. Patients and Methods: This was a randomized control study done for 2 years in which fifty adult patients with humeral shaft non-union were recruited. The patients were grouped into 2 (P = DCP & N = LIMN). Forty five of the patients completed the follow up periods of the study and then analyzed. The P group had ORIF with DCP while the N group had ORIF with LIMN. Both groups had grafting with cancellous bones. Each patient was followed up for a period of 6 months at the time which radiographic union is expected. Any patient without clinical and/or radiographic evidence of union after six months of surgery was diagnosed as having recurrent non-union. The data generated was analyzed using SPSS Version 23. The results were presented in charts and tables. The paired t-test was used while considering p value Result: Forty five patients completed follow up. There was a male preponderance (4:1), right humerus predominated (3:2). Motor vehicular accidents were the commonest cause of the fractures (62%). Most non-union fractures occurred at the level of the middle 3<sup>rd</sup> of the humeral shaft (60%). Failed TBS treatment was the commonest indication for the osteosynthesis (71%). More patients had plating (53%) compared to 47% who had LIMN. Most patients (93.4%) had union between 3 to 6 months irrespective of fixation type with no significant statistical difference between the union rate of DCP and LIMN (p value 0.06) with similar functional outcome and complication rates irrespective of the type of fixation. Conclusion: This study showed that the success rates in term of fracture union, outcome functional grades and complication rates were not directly dependent on the types of the fixation: plating or locked intra-medullary nailing.展开更多
Let G be a 2 connected simple graph of order n ( n ≥5) and minimum degree δ . In this paper, we show that if for any two nonadjacent vertices u , v of G there holds | N(u)∪N(v)|≥n-δ , t...Let G be a 2 connected simple graph of order n ( n ≥5) and minimum degree δ . In this paper, we show that if for any two nonadjacent vertices u , v of G there holds | N(u)∪N(v)|≥n-δ , then G is {3,4} - vertex pancyclic unless G≌K n2,n2 .展开更多
Let G be a graph, the square graph G 2 of G is a graph satisfying V(G 2)=V(G) and E(G 2)=E(G)∪｛uv: dist G(u, v)=2｝ . In this paper, we use the technique of vertex insertion on l -connected ( l=k or k...Let G be a graph, the square graph G 2 of G is a graph satisfying V(G 2)=V(G) and E(G 2)=E(G)∪｛uv: dist G(u, v)=2｝ . In this paper, we use the technique of vertex insertion on l -connected ( l=k or k+1, k≥2 ) claw-free graphs to provide a unified proof for G to be Hamiltonian, 1 -Hamiltonian or Hamiltonian-connected. The sufficient conditions are expressed by the inequality concerning ∑ k i=0N(Y i) and n(Y) in G for each independent set Y=｛y 0, y 1, …, y k｝ of the square graph of G , where b ( 0<b<k+1 ) is an integer, Y i=｛y i, y i-1, …, y i-(b-1)｝Y for i∈｛0, 1, …, k｝ , where subscriptions of y j s will be taken modulo k+1 , and n(Y)=｛v∈ V(G): dist (v, Y)≤ 2｝ .展开更多
传统的图像聚类方法存在对初始数据敏感且计算复杂度高的问题,且图像全局特征难以有效地表达图像内容。针对这些问题,提出一种基于Union-Find的图像聚类方法。首先,该方法采用视觉词袋模型Bo VWM(Bag of Visual Words Model)来描述图像...传统的图像聚类方法存在对初始数据敏感且计算复杂度高的问题,且图像全局特征难以有效地表达图像内容。针对这些问题,提出一种基于Union-Find的图像聚类方法。首先,该方法采用视觉词袋模型Bo VWM(Bag of Visual Words Model)来描述图像内容并且利用投票方法来计算每对图像的相似度得分;然后,对于相似度得分大于给定阈值的图像对进行union和find两个操作并将相连的分量形成聚类结果。实验结果表明,该方法较之于传统方法能较好地改善图像聚类效果,且不需要初始聚类数目作为先验参数。展开更多
Let G be a graph, an independent set Y in G is called an essential independent set (or essential set for simplicity), if there is {y 1,y 2} Y such that dist (y 1,y 2)=2. In this paper, we wi...Let G be a graph, an independent set Y in G is called an essential independent set (or essential set for simplicity), if there is {y 1,y 2} Y such that dist (y 1,y 2)=2. In this paper, we will use the technique of the vertex insertion on l connected ( l=k or k+1,k≥2 ) claw free graphs to provide a unified proof for G to be hamiltonian or 1 hamiltonian, the sufficient conditions are expressed by the inequality concerning ∑ki=0N(Y i) and n(Y) for each essential set Y={y 0,y 1,...,y k} of G , where Y i={y i,y i-1 ,...,y i-(b-1) }Y for i∈{0,1,...,k} (the subscriptions of y j ’s will be taken modulo k+1 ), b ( 0【b【k+1 ) is an integer, and n(Y)={v∈V(G): dist (v,Y)≤2 }.展开更多
文摘A Moonment to Remember,as a brand event held by China Cultural Centers and China National Tourist Offices around the world to celebrate the Mid-Autumn Festival,has been organized for 8 successive years.
文摘Background: Fractures of humeral shaft in adults are common injuries. Humeral shafts non-union either from late presentation after initial treatment by traditional bone setters or failed non-operative orthodox care is a major problem in this part of the world. This non-union is a major treatment challenge with increased cost of care and morbidity in this part of the world. Humeral shaft non-union can be treated with locked intra-medullary nailing (LIMN) or dynamic compression plating (DCP). Study on comparison of these methods of fixation in this part of the world is scarce in literature search, hence the reason for this study. Objective: The objectives of this study are: (1) to compare early clinical outcome following fixation of humeral shaft fracture nonunion with DCP versus LIMN;(2) to compare the time of radiologic fracture union of DCP with LIMN;(3) to compare complications following fixation of humeral shaft fracture nonunion with DCP versus LIMN. Patients and Methods: This was a randomized control study done for 2 years in which fifty adult patients with humeral shaft non-union were recruited. The patients were grouped into 2 (P = DCP & N = LIMN). Forty five of the patients completed the follow up periods of the study and then analyzed. The P group had ORIF with DCP while the N group had ORIF with LIMN. Both groups had grafting with cancellous bones. Each patient was followed up for a period of 6 months at the time which radiographic union is expected. Any patient without clinical and/or radiographic evidence of union after six months of surgery was diagnosed as having recurrent non-union. The data generated was analyzed using SPSS Version 23. The results were presented in charts and tables. The paired t-test was used while considering p value Result: Forty five patients completed follow up. There was a male preponderance (4:1), right humerus predominated (3:2). Motor vehicular accidents were the commonest cause of the fractures (62%). Most non-union fractures occurred at the level of the middle 3<sup>rd</sup> of the humeral shaft (60%). Failed TBS treatment was the commonest indication for the osteosynthesis (71%). More patients had plating (53%) compared to 47% who had LIMN. Most patients (93.4%) had union between 3 to 6 months irrespective of fixation type with no significant statistical difference between the union rate of DCP and LIMN (p value 0.06) with similar functional outcome and complication rates irrespective of the type of fixation. Conclusion: This study showed that the success rates in term of fracture union, outcome functional grades and complication rates were not directly dependent on the types of the fixation: plating or locked intra-medullary nailing.
文摘Let G be a 2 connected simple graph of order n ( n ≥5) and minimum degree δ . In this paper, we show that if for any two nonadjacent vertices u , v of G there holds | N(u)∪N(v)|≥n-δ , then G is {3,4} - vertex pancyclic unless G≌K n2,n2 .
文摘Let G be a graph, the square graph G 2 of G is a graph satisfying V(G 2)=V(G) and E(G 2)=E(G)∪｛uv: dist G(u, v)=2｝ . In this paper, we use the technique of vertex insertion on l -connected ( l=k or k+1, k≥2 ) claw-free graphs to provide a unified proof for G to be Hamiltonian, 1 -Hamiltonian or Hamiltonian-connected. The sufficient conditions are expressed by the inequality concerning ∑ k i=0N(Y i) and n(Y) in G for each independent set Y=｛y 0, y 1, …, y k｝ of the square graph of G , where b ( 0<b<k+1 ) is an integer, Y i=｛y i, y i-1, …, y i-(b-1)｝Y for i∈｛0, 1, …, k｝ , where subscriptions of y j s will be taken modulo k+1 , and n(Y)=｛v∈ V(G): dist (v, Y)≤ 2｝ .
文摘传统的图像聚类方法存在对初始数据敏感且计算复杂度高的问题,且图像全局特征难以有效地表达图像内容。针对这些问题,提出一种基于Union-Find的图像聚类方法。首先,该方法采用视觉词袋模型Bo VWM(Bag of Visual Words Model)来描述图像内容并且利用投票方法来计算每对图像的相似度得分;然后,对于相似度得分大于给定阈值的图像对进行union和find两个操作并将相连的分量形成聚类结果。实验结果表明,该方法较之于传统方法能较好地改善图像聚类效果,且不需要初始聚类数目作为先验参数。
文摘Let G be a graph, an independent set Y in G is called an essential independent set (or essential set for simplicity), if there is {y 1,y 2} Y such that dist (y 1,y 2)=2. In this paper, we will use the technique of the vertex insertion on l connected ( l=k or k+1,k≥2 ) claw free graphs to provide a unified proof for G to be hamiltonian or 1 hamiltonian, the sufficient conditions are expressed by the inequality concerning ∑ki=0N(Y i) and n(Y) for each essential set Y={y 0,y 1,...,y k} of G , where Y i={y i,y i-1 ,...,y i-(b-1) }Y for i∈{0,1,...,k} (the subscriptions of y j ’s will be taken modulo k+1 ), b ( 0【b【k+1 ) is an integer, and n(Y)={v∈V(G): dist (v,Y)≤2 }.
