The Computable Dimension of I-Trees of Infinite Height

We study computable trees with distinguished initial subtree (briefly, I-trees). It is proved that all I-trees of infinite height are computably categorical, and moreover, they all have effectively infinite computable dimension.     

Identifying phylogenetic trees

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when identifies an X-tree, and the second describes when a compatible subset of is of maximum size.     

CO（ a）+ NO（X）传能体系中的新传能通道

在相对碰撞平动能为 0 .0 5eV的分子束实验条件下 ,研究了亚稳态CO(a) +NO(X)的E E传能通道 .通过测量和分析交碰区的传能发射光谱 ,在 780和 860nm处观测到了NO(b -a)跃迁Ogawa带的△v =+ 4和△v =+ 3序的发射光谱 .从而首次在实验上直接证实了传能过程中第四通道的存在 (CO (a) +NO(X)→CO (X) +NO(b) ) .这一通道的发现解释了前人测量到的在CO(a)与NO(X)碰撞传能过程中CO(a)的猝灭速率远大于NO(A ,B)生成速率的实验结果 ,并进一步证实了这一“经典”E E传能体系为电子交换机理的传能观点     

J/ψ Dissociation in QGP via Multi-gluon Absorption

We propose that the suppression of J/ψ production in relativistic heavy ion collisions may be explained by that J/ψ dissociates via absorbing multi-gluons in the environment of quark-gluon-plasma (QGP) where abundance of gluons is expected.     

最小费用k度限制树对策

本在Glover—Klingman算法及最小费用支撑树对策的基础上，讨论了最小费用k度限制树对策问题．利用威胁、旁支付理论制订了两种规则，并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解，从而证明了在这两种规则下其核心非空．     

Na离子和Cl离子引起He原子直接多重电离过程的研究

利用2～8 MeV的Naq+、Clq+(q=2,3,4,5)轰击氦原子,对碰撞的直接多重电离过程进行研究.实验采用反冲离子-散射离子飞行时间符合技术,通过反冲离子飞行时间谱区分不同价态反冲离子;利用静电偏转和位置灵敏探测技术区分不同电荷态散射离子;结合CAMAC-PC多参数获取系统得到一定价态散射离子所对应的反冲离子电荷态分布谱;经分析该谱得到直接多重电离截面与直接单电离截面之比R21.讨论了R21随入射离子速度和电荷态的变化关系.     

非对称核物质中同位旋对称势的动量和密度依赖性

在Brueckner-Hartree-Fock理论框架内, 研究了同位旋非对称核物质中质子和中子单粒子势的动量相关性及其随同位旋非对称度的变化, 在此基础上计算了同位旋对称势, 并讨论了三体核力的影响. 结果表明同位旋对称势对于同位旋非对称度的依赖性很弱, 但对于动量和密度均有较强的依赖性. 当密度固定时, 同位旋对称势随动量增加而减小. 尽管三体核力对于质子和中子单粒子势的动量相关性有较大影响, 但对同位旋对称势的影响很小. 还与目前重离子碰撞输运理论模型中所使用的各种参数化的唯象对称势进行了比较.     

Triple differential cross sections for ionization of hydrogen atoms by positrons in a Schwinger variational calculation

Schwinger variational principle has been used to calculate triple differential cross-sections for ionization of hydrogen atoms by positrons at intermediate and high energies for Ehrhardt type asymmetric geometry. The results agree in general with the calculations of Brauneret al [8] and with the second Born calculation.     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].     

STRONG LAW OF LARGE NUMBERS AND ASYMPTOTIC EQUIPARTITION PROPERTY FOR NONSYMMETRIC MARKOV CHAIN FIELDS ON CAYLEY TREES

Some strong laws of large numbers for the frequcncies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields(NSMC)on Cayley trees are studied.In the proof,a new technique for the study of strong liinit theorems of Markov chains is extended to the case of Markov chain fields.The asymptotic equiparti- tion properties with almost everywhere(a.e.)convergence for NSMC on Cayley trees are obtained.