束流位置监测系统的研制及其在国家同步辐射实验室二期工程中的应用

 介绍一种储存环束流位置监测系统的标定装置。这套标定装置是为NSRL二期工程储存环注入段真空盒改造而研制的。系统的标定精度达±0.01mm。该装置已用于新增注入段真空管的束流位置探测器的定标，获得了探头定标值，并根据其拟合和计算结果对注入段真空管进行了筛选，被选中的真空管已装入储存环注入段。     

Pythagoras’s oxen revisited

it is said that when Pythagoras discovered his famous theorem, in a right-angled triangle the squares of the smaller sides sum up to the square of the hypoteneuse, he sacrificed a hundred oxen to thank the gods.     

The dynamics of magnetic flows for energies above Mañé’s critical value

We show that, for energies above Mañé’s critical value, minimal magnetic geodesics are Riemannian (A, 0)-quasi-geodesics whereA→1 as the energy tends to infinity. As a consequence, on negatively curved manifolds, minimal magnetic geodesics lie in tubes around Riemannian geodesics.Finally, we investigate a natural metric introduced by Mañé via the so-called action potential. Although this magnetic metric does depend on the magnetic field, the associated magnetic length turns out to be just the Riemannian length.     

Self-dual codes over the Kleinian four group

We introduce self-dual codes over the Kleinian four group K=Z ₂×Z ₂ for a natural quadratic form on K ⁿ and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to length 8, neighbourhood graphs, extremal codes, shadows, generalized t-designs, lexicographic codes, the Hexacode and its odd and shorter cousin, automorphism groups, marked codes. Kleinian codes form a new and natural fourth step in a series of analogies between binary codes, lattices and vertex operator algebras. This analogy will be emphasized and explained in detail.     

Two Tree-Width-Like Graph Invariants

In this paper we introduce two tree-width-like graph invariants. The first graph invariant, which we denote by ⁼(G), is defined in terms of positive semi-definite matrices and is similar to the graph invariant (G), introduced by Colin de Verdière in [J. Comb. Theory, Ser. B., 74:121–146, 1998]. The second graph invariant, which we denote by (G), is defined in terms of a certain connected subgraph property and is similar to (G), introduced by van der Holst, Laurent, and Schrijver in [J. Comb. Theory, Ser. B., 65:291–304, 1995]. We give some theorems on the behaviour of these invariants under certain transformations. We show that ⁼(G)=(G) for any graph G with ⁼(G)4, and we give minimal forbidden minor characterizations for the graphs satisfying ⁼(G)k for k=1,2,3,4.This paper is extracted from two chapters of [7]. This work was done while the author was at the Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.     

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Denote by the class of all triangle-free graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical triangle-free graph is bipartite. Fix > 0 and let . If n/2 m (1 – ) t ₃, then almost all graphs in are not bipartite, whereas if m (1 + )t ₃, then almost all of them are bipartite. For m (1 + )t ₃, this allows us to determine asymptotically the number of graphs in . We also obtain corresponding results for C -free graphs, for any cycle C of fixed odd length. Forschergruppe Algorithmen, Struktur, Zufall supported by Deutsche Forschungsgemeinschaft grant FOR 413/1-1     

碱原子高里德堡态的极化率

本文使用一种具有解析解的原子唯象势模型,计算了碱原子Na,K,Rb,Cs里德堡(15≤n≤55)的标量和量极化率,计算结果与实验符合很好。还确定了极化率标度关系α=An^*7+Bn^*6中的系数A和B,由此关系外推所得结果也与实验很好地符合。 关键词：     

Polynomial Stability to Three-Dimensional Magnetoelastic Waves

In this work we show that the energy associated to the linear three-dimensional magneto-elastic system decays polynomially to zero as time goes to infinity, provided the initial data is smooth enough.     

推广x重新标度模型的重标度参数经验公式

给出了推广x重新标度模型的重标度参数经验公式,其中建立了重标度参数与原子核的平均结合能之间的联系,由该公式可以得出A≥12的所有核的重标度参数值,利用这些参数值可以计算有关核过程并做出预言.