Study of the design of CSNS MEBT

The design of CSNS MEBT has two objectives: (1) to match the beam both in the transversal direction and the longitudinal direction from RFQ into DTL; (2) to further chop the beam into the required time structure asked by RCS. It is very difficult and critical to control well the emittance growth and in the meantime to match and chop the beam. Firstly, the optical design is done and optimized, and the multi-particle simulations show that the maximum emittance growth is successfully controlled within 14%. Secondly, based on the different beam envelopes obtained by TRACE-3D and PARMELA, the least deflecting angle of the chopper is determined by TRACE-3D. At last, the field of steering magnet is determined through simulations.     

Study of the design of CSNS MEBT

The design of CSNS MEBT has two objectives：（1） to match the beam both in the transversal direction and the longitudinal direction from RFQ into DTL;（2） to further chop the beam into the required time structure asked by RCS. It is very diffcult and critical to control well the emittance growth and in the meantime to match and chop the beam. Firstly,the optical design is done and optimized,and the multi-particle simulations show that the maximum emittance growth is successfully controlled within 14%. Secondly,based on the different beam envelopes obtained by TRACE-3D and PARMELA,the least deflecting angle of the chopper is determined by TRACE-3D. At last,the field of steering magnet is determined through simulations.     

Forcing faces in plane bipartite graphs

Let Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graph G∈Ω is said to be a forcing face of G if the subgraph of G obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing hexagons in hexagonal systems, MATCH Commun. Math. Comput. Chem. 56 (3) (2006) 649-668]. We prove that any connected plane bipartite graph with a forcing face is elementary. We also show that for any integers n and k with n?4 and n?k?0, there exists a plane elementary bipartite graph such that exactly k of the n finite faces of G are forcing. We then give a shorter proof for a recent result that a connected cubic plane bipartite graph G has at least two disjoint M-resonant faces for any perfect matching M of G, which is a main theorem in the paper [S. Bau, M.A. Henning, Matching transformation graphs of cubic bipartite plane graphs, Discrete Math. 262 (2003) 27-36]. As a corollary, any connected cubic plane bipartite graph has no forcing faces. Using the tool of Z-transformation graphs developed by Zhang et al. [Z-transformation graphs of perfect matchings of hexagonal systems, Discrete Math. 72 (1988) 405-415; Plane elementary bipartite graphs, Discrete Appl. Math. 105 (2000) 291-311], we characterize the plane elementary bipartite graphs whose finite faces are all forcing. We also obtain a necessary and sufficient condition for a finite face in a plane elementary bipartite graph to be forcing, which enables us to investigate the relationship between the existence of a forcing edge and the existence of a forcing face in a plane elementary bipartite graph, and find out that the former implies the latter but not vice versa. Moreover, we characterize the plane bipartite graphs that can be turned to have all finite faces forcing by subdivisions.     

Graphic sequences with a realization containing a complete multipartite subgraph

A nonincreasing sequence of nonnegative integers π=(d₁,d₂,…,d_n) is graphic if there is a (simple) graph G of order n having degree sequence π. In this case, G is said to realizeπ. For a given graph H, a graphic sequence π is potentiallyH-graphic if there is some realization of π containing H as a (weak) subgraph. Let σ(π) denote the sum of the terms of π. For a graph H and n∈Z⁺, σ(H,n) is defined as the smallest even integer m so that every n-term graphic sequence π with σ(π)≥m is potentially H-graphic. Let denote the complete t partite graph such that each partite set has exactly s vertices. We show that and obtain the exact value of σ(K_j+K_s,s,n) for n sufficiently large. Consequently, we obtain the exact value of for n sufficiently large.     

束团压缩用踢波器的模型腔

 为了提高中子产额,法兰克福强中子源采用Mobley型束团压缩器来增强打靶时质子流的密度,其入口处由射频踢波器实现微脉冲的偏转,踢波器由一对电偏转板和串联电感线圈组成谐振腔体。考虑到高频下寄生电容效应、导体腔壁对线圈电感的影响以及涡流效应对线圈交流电阻的影响,对一台模型腔的射频特性进行了理论预测。对腔体内电磁场分布进行了数值模拟,并利用电容微扰法进行了冷模测量。针对谐振频率、品质因数和并联分路阻抗等参数,分析比较了理论计算、数值模拟及冷模测量的结果,总结得出射频踢波器的有效设计方法。     

等离子体金属表面氮化中放电温度对氮原子态粒子的影响

采用快电子和重粒子(N₂⁺,N⁺,N_f)混合的Monte Carlo模型,研究了氮直流辉光放电等离子体金属表面氮化过程中.e-N_2s及N₂⁺-N_2s两种碰撞离解过程产生的原子态粒子(N⁺,N)的产生率和氮化粒子(N⁺,N_f)轰击靶表面的能量、粒子数密度及入射角分布随气体温度的变化规律.结果表明,使阴极靶处活性粒子(N⁺,N_f)的能量高且粒子数密度大,存在一个最佳放电温度;粒子(N⁺,N)的产生率及在靶表面的密度数都随着放电气体温度的升高而减少;有大量中性快原子N_f在工件表面小角入射,且粒子(N⁺,N_f)角分布受温度的影响很小.     

DC conductivity studies in K3Na(SeO4)2 single crystals

DC electrical conductivity studies were carried out along the three crystallographic axes for Tripotassium sodium diselenate (K₃Na(SeO₄)₂ or KNSe). Earlier studies of phase transition in this crystal show successive phase transitions at 334 K, 346 K, 730 K, and 758 K. In this paper we report the dc electrical conductivity measurements in the temperature region 303 K – 430 K along a, b and c – axes. An anomaly in conductivity was obtained around 341 K and another one around 333 K. These can be attributed as due to phase transitions in this crystal. A strong anomaly also has been observed along the c‐axis and comparatively week one along a and b axes around 395 K for the first time. This can be due to newly observed phase transition in the crystal. DSC taken for the sample also shows endothermic peak supporting the occurrence of newly observed phase transition. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)