Analysis of the Vertexes ΣQ([I])*QK* and ([1])'Q*Σ*QK* within Light-Cone QCD Sum Rules

We parameterize the vertexes ΣQ([1])*QK* and ([1])'QΣ*QK* with three tensor structures due to Lorentz invariance,and calculate the corresponding three coupling constants within light-cone QCD sum rules.We then obtain their numerical values taking into account all the uncertainties of the relevant parameters.

Automatic Extraction Method of 3D Feature Guidelines for Complex Cultural Relic Surfaces Based on Point Cloud

Cultural relics line graphic serves as a crucial form of traditional artifact information documentation,which is a simple and intuitive product with low cost of displaying compared with 3D models.Dimensionality reduction is undoubtedly necessary for line drawings.However,most existing methods for artifact drawing rely on the principles of orthographic projection that always cannot avoid angle occlusion and data overlapping while the surface of cultural relics is complex.Therefore,conformal mapping was introduced as a dimensionality reduction way to compensate for the limitation of orthographic projection.Based on the given criteria for assessing surface complexity,this paper proposed a three-dimensional feature guideline extraction method for complex cultural relic surfaces.A 2D and 3D combined factor that measured the importance of points on describing surface features,vertex weight,was designed.Then the selection threshold for feature guideline extraction was determined based on the differences between vertex weight and shape index distributions.The feasibility and stability were verified through experiments conducted on real cultural relic surface data.Results demonstrated the ability of the method to address the challenges associated with the automatic generation of line drawings for complex surfaces.The extraction method and the obtained results will be useful for line graphic drawing,displaying and propaganda of cultural relics.

BAR:a branch-alternation-resorting algorithm for locality exploration in graph processing

Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm.

Prevalence, Maternal and Perinatal Prognosis of Breech Delivery Compared to That of the Vertex in 242 Cases for 484 Controls at Ségou Hospital in Malti

Introduction: Breech birth has always been a subject of great interest because of its risks of perinatal morbidity and mortality. Aim: The aim of our study was to compare the maternal and perinatal prognosis of breech delivery with that of vertex delivery. Patients and Method: This was a retrospective case-control analytical study carried out in the obstetrics and gynaecology department of Ségou hospital over a 2-year period from 1 January 2020 to 31 December 2021, involving 242 breech deliveries compared with 484 top deliveries with a live single foetus without foetal malformation of gestational age ≥ 35 SA. The statistical tests used were: chi² (p Results: The frequency of breech delivery was 3.3%, with a predominance of caesarean section for breech presentation (64.88%) compared with 32.85% for vertex (P: 0.00;CI: (0.191 - 0.367). The perinatal prognosis of fetuses with breech presentations was marked by a higher rate of neonatal asphyxia (Apgar score Conclusion: Breech birth is relatively rare in our department. It carries a higher risk of maternal morbidity and neonatal morbidity than breech delivery. However, the vital prognosis for the mother was identical in both groups.

Vertex治疗齿状突骨折伴寰枢椎脱位的早期并发症分析

[目的]分析Vertex治疗齿状突骨折伴寰枢椎脱位的早期并发症发生的原因和预防措施。[方法]对18例齿状突骨折伴寰枢椎脱位中的5例6项术中和术后早期发生的椎动脉损伤、失语、失明、大出血、置钉错误等并发症的原因进行分析,避免并发症的发生。[结果]所有发生的早期并发症都得到相应治疗,未遗留后遗症。[结论]Vertex治疗齿状突骨折伴寰枢椎脱位的早期并发症均可以预防,一旦发生及时治疗效果满意。

高效的非结构动网格变形方法——点球弹簧修匀法

Ball-vertex方法虽然能够避免动网格变形过程中产生非法单元,但计算效率偏低,为此提出一种动网格方法——点球弹簧修匀法.该方法从基本的Laplacian网格修匀法思想出发,基于点球弹簧模型构造内部节点闭包子弹簧系统,采用LDLT分解法逐次遍历求解这些子弹簧系统、逐步修匀内部网格,进而实现动网格的变形,其适用于二维?三维动网格问题以及混合动网格问题.算例结果表明,文中方法有较强的网格变形能力,并显著提高了网格变形效率,适合求解大变形的、较大规模动网格问题.

Vertex内固定系统治疗寰枢椎不稳:临床效果与植入物特征的关系

文章探讨了Vertex内固定系统植入治疗寰枢椎不稳定的临床效果与植入物材料学性能的相关性。选择2004-01/2006-01泸州医学院附属医院收治的寰枢椎脱位与不稳26例患者,采用美国美敦力·枢法模·丹历公司生产的Vertex颈椎后路钉棒内固定系统进行手术。对26例寰枢椎脱位患者采用Vertex内固定及寰枢椎融合术,摄动力位X射线片及CT检查寰枢椎稳定程度,记录每一例患者的术中并发症,术后功能恢复及融合情况。结果:①22例患者术后3个月X射线片显示寰枢融合成功,3例患者术后6个月X射线片显示寰枢融合成功,1例患者1年后植骨吸收再手术植骨,在术后3个月融合成功。②无脊髓损伤加重等并发症,术前JOA17分法评定脊髓功能3～17分,平均6.8分,术后为5～17分,平均14.8分,改善率83%。③26例患者颈部伸屈运动正常,旋转功能均有部分丢失,18例患者旋转达120°,6例患者旋转达100°,1例患者旋转达60°。Vertex内固定系统是颈椎后路钉棒内固定系统,因其具有万向螺钉和随意塑行的棒相连接,做到了固定可靠,节段长短随意和钉棒连接方便的临床应用优点。Vertex内固定系统治疗寰枢椎脱位术后效果亦比较理想。

^(99)Tc^m-MDP骨显像诊断骨肉瘤肺转移一例

患者女，35岁，2001年因“左侧肩胛骨骨肉瘤”行左侧肩胛骨骨肉瘤切除术。2006年8月起无明显诱因出现鼻塞、咳嗽、咳痰，痰中带血，伴盗汗。外院胸部CT示左上肺转移，故于9月拟“左肩胛骨骨肉瘤伴肺转移”收治于本院。体格检查示左上肺呼吸音低，语音震颤减弱。注射99^Tc^m-MDP 1110 Mq后3h行全身骨显像（仪器为美国ADAC Vertex V60 SPECT，采集前后位、后前位），

8例后路椎弓根钉棒系统固定植骨融合术治疗难复性寰枢椎脱位的围术期护理

目的:总结后路椎弓根钉棒系统固定植骨融合术的围术期护理经验。方法:回顾性分析8例寰枢椎脱位患者经后路椎弓根钉棒系统固定植骨融合术的临床护理措施。结果:所有病例术后无严重并发症发生,脊髓功能均得到不同程度的改善。结论:良好的围术期护理,术后严密观察病情,及时预防并发症,做好功能锻炼指导与健康教育是保证手术成功的重要环节。

An Algorithm for Partitioning Polygons into Convex Parts

An algorithm for partitioning arbitrary simple polygons into a number of convex parts was presented. The concave vertices were determined first, and then they were moved by using the method connecting the concave vertices with the vertices of falling into its region B,so that the primary polygon could be partitioned into two subpolygons. Finally, this method was applied recursively to the subpolygons until all the concave vertices were removed. This algorithm partitions the polygon into O(l) convex parts, its time complexity is max(O(n),O(l 2)) multiplications, where n is the number of vertices of the polygon and l is the number of the concave vertices.

导航下后路Vertex椎弓根螺钉在Hangman骨折治疗中的应用

目的探讨导航引导下Vertex椎弓根螺钉在Hangman骨折治疗中的应用。方法分析15例Hangman骨折患者,术中采用后路Vertex椎弓根螺钉进行固定、复位,植骨融合,并结合三维重建导航技术的使用。观察术中有无出现椎动脉或脊髓神经损伤等并发症,术后复查X线片了解骨折脱位的复位情况,随访观察内固定有无松动、神经功能恢复及植骨融合情况,综合评定该手术的可行性及疗效。结果 15例骨折脱位复位理想,随访5～24个月,内固定均未见松动,除1例植入异体松质骨粒术后14月未能达到骨性融合外,其他病例均达到植骨融合,颈2/3节段获得稳定,4例合并有颈髓损伤的患者术后得到恢复。结论 3D导航下Vertex椎弓根螺钉固定既可避免在置入椎弓根钉时损伤椎动脉及脊髓神经的风险,也可以为骨折脱位提供稳定的三柱固定,是治疗Hangman骨折理想的方法。

Vertex 60 SPECT双探头性能对比

Vertex60SPECT ,其双探头比单探头设备效率提高1倍。在应用中应特别重视双探头性能是否匹配 ,否则其图像反而不及单探头设备。用ADAC公司自带软件 ,对Vertex60SPECT仪的双探头进行性能测试和对比 ,结果各项指标均达到要求 。

基于点球弹簧修匀法的混合网格变形并行算法

针对二维/三维混合网格,提出基于点球弹簧修匀法的并行网格变形算法。按特定模板将混合网格中的非三角形/四面体单元分解成三角形/四面体单元。针对每个内部节点及其相邻节点建立相应的子弹簧系统,并通过增加Ball-Vertex弹簧避免弹簧系统的塌陷问题。由于点球弹簧法在计算中逐点对网格内部节点进行计算,在计算过程中具有良好的弱耦合性质,因此有利于算法并行化。在并行化时仅需对网格进行虚拟分区操作,不必进行复杂的几何分区操作,同时避免了混合网格不同单元之间的兼容性问题。该方法适用于具有复杂外形的大规模混合网格的变形问题,能够显著提高网格变形的效率,同时具有良好的适应性。

New Vertex-Degree Condition for Pancyclic Graphs

Let G be a 2 connected graph with n vertices. In this paper, we prove that if there exist two vertices of any there independent vertices in G such that the sum of whose degree is at least n , then G is pancyclic, or G is K n/2,n/2 , or G is K n/2,n/2 -e , or G is a cycle of length 5.

Gauge dependence of chiral condensate and fermion mass by an unquenched model

Based on three-dimensional quantum electrodynamics theory,a set of truncated Dyson-Schwinger（D-S） equations are solved to study photon and fermion propagators with the effect of vacuum polarization.Numerical studies show that condensation and the value of fermion mass depends heavily on how the D-S equations are truncated.By solving a set of coupled D-S equations,it is also found that the fermion propagator shows a clear dependence on the order parameter.The truncated D-S equations under unquenched approximation are used to study the mass-function and chiral condensation of the fermions.The results under the unquenched approximation are clearly different from the ones under quenched approximation.With the increase in the order parameter,the fermion condensation in the unquenched approximation decreases when 0≤ξ5,while it increases when ξ5.However,nothing like this is observed in the quenched approximation,which indicates that there may be flaws in the quenched approximations.

Neighbourhood Unions and Vertex pancyclicity *

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 .

Hamiltonicity,neighborhood union and square graphs of claw-free graphs

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｝ .

Neighborhood Union of Essential Sets and Hamiltonicity of Claw-Free Graphs

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 }.

Structural Characterization and Toxicity Prediction of Some Organic Compounds

A new molecular structural characterization（MSC）method called molecular vertexes correlative index（MVCI）was constructed in this paper.The index was used to describe the structures of 45 compounds and a quantitative structure-activity relationship（QSAR）model of toxicity（–lgEC50）was obtained through multiple linear regression（MLR）and stepwise multiple regression（SMR）.The correlation coefficient（R）of the model was 0.912,and the standard deviation（SD）of the model was 0.525.The estimation stability and prediction ability of the model were strictly analyzed by both internal and external validations.The Leave-One-Out（LOO）Cross-Validation（CV）correlation coefficient（RCV）was 0.816 and the standard deviation（SDCV）was 0.739,respectively.For the external validation,the correlation coefficient（Rtest）was 0.905 and the standard deviation（SDtest）was 0.520,respectively.The results showed that the index was superior in molecular structural representation.The stability and predictability of the model were good.