20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.     

电信运营市场上过度进入的供给分析

本文在分析光纤主干网和本地接入服务市场上电信运营商的供给行为的基础上,首先证明了拥有主干网的运营商愿意租出自己的部分光纤,接着分析证明了上述两市场上使投资更倾向于过度的乘数效应,并进一步证明网络外部性使乘数效应更加明显.旨在对我国电信运营市场发展给出一些参考意见.     

腔靶等离子体辐射温度空间分布测量

本文描述了用膜吸收法测量激光等离子体辐射温度空间分布的原理和方法给出了柱形缝靶轴向辐射温度随空间位置变化的特征,对测量结果进行了分析讨论。     

超软X射线流气式正比计数管

介绍了一种用于测量183～933eV超软X射线的圆柱形、侧窗式、流气式正比计数管,工作气体是0.11MPa的P-10气体或氦气-丙烷混合气体。计数管内径为φ25mm,直径为φ0.3mm的入射窗是由厚度80～90μgcm~2聚乙烯甲醛制成的。该计数管的特点:(1)薄窗,对软X射线透过率高。(2)流气式,工作寿命长。(3)能量分辨率好。(4)计数率高(1×10~(14)个/s)。(5)可测能区宽(0.183～10keV)。(6)可以方便更换窗膜材料、厚度及窗口直径。近几年来该计数管已经为高强度低能X光源提供较好监测。     

带延迟约束单机排序的改进算法

给出了带延迟排序的一个改进启发式算法,从而解决了Wikum等提出的一个问题。并且此算法可以最优求解单位加工时间的问题,进一步对另一个问题,此算法亦被证明好于Wikum等原来的算法。