Topological bulk-edge effects in quantum graph transport

We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim with two examples. In the first, the transport is possible at high energies in the bulk only being suppressed at the sample edges, while in the second one the situation is opposite, the transport is possible at the edge only.     

双图的一些脆弱性参数

一个图G的双图（double graphs）的定义为D[G]=G×T2,这里×表示图的直积,而死表示两个顶点的全图．本文研究了图的双图的一些脆弱性参数．     

HS 图及其编码

对苯系统图(HS 图)的三种编码(B 码、F 码和 P 码)进行了的研究。导出了各码之间的互推关系,并得出 B 码是 HS 图的两个必要条件。     

Cayley色图中的Hamilton路

Joseph B.Klerlein 在文[1]中证明了有限 Abell 群Γ具有极小生成元集△使Cayley 色图 D_△(T)为有向 Hamilton 图.本文证明了当Γ是 Abell 群时,连通的cayley 色图D_△(Γ)具有有向 Hamilton 路对任意的△成立,并举例说明一般的D_△(Γ)未必是 Hamilton 图.     

Reanalysis of the photoassociation spectrum of 133Cs2 （6P3/2） lg state

Reanalysis of the photoassociation spectrum of the weakly binding （6S1/2 ＋ 6P3/2） lg 133Cs2 levels, reported in the previous study [J. Mol. Spectro. 255 （2009） 106], is performed by using a Lu-Fano graph coupled to the improved LeRoy- Bernstein formula including two additional modified terms. A more accurate coefficient （c3） is obtained for the leading long-range potential （-c3/R3） of a diatomic molecule.     

一种结合几何相容性分析的谱匹配算法

为了可靠地实现点模式匹配,提出了一种基于谱图理论与几何相容性分析的点模式匹配算法。利用拉普拉斯矩阵的特征向量获得待匹配点集间谱匹配代价的表示;结合以邻近关系表示的几何相容性,定义了一种混合形式的匹配目标函数;给出了基于松弛迭代的求解算法。仿真数据和真实图像上的比较实验表明所给出的方法具有较好的精度与时间性能。     

基于特征投影图的小麦近红外光谱变量选择方法研究

为了简化模型,提高模型预测精度,利用特征投影图(LPG)进行变量选择。对原始光谱进行连续小波变换(CWT),利用主成分分析(PCA)得到LPG,假定LPG中共线性光谱变量对建模作用相同,选出少数特征光谱变量建立预测模型,所得模型预测均方根误差(RMSEP)为0.345 4,优于其他建模方法,研究结果表明,LPG变量选择可有效简化近红外光谱模型,提高模型预测精度。     

Improved frequency standard via weighted graph states

We study the spin squeezing property of weighted graph states,which can be used to improve sensitivity in interferometry.We study the time evolution of spin squeezing under local decoherence acting independently on each qubit.Based on the analysis,the spin squeezing of the weighted graph states is somehow robust in the presence of decoherence and the decoherence limit in the improvement of the interferometric sensitivity is still achievable.Furthermore,one can obtain the optimal improvement of sensitivity by tuning the weighted of each edges of the weighted graph state.     

几类凝聚图的轮廓

设Ｇ是个图，｜Ｖ（Ｇ）＝ｎ｜对Ｇ上的任一个标号ｆ：Ｖ（Ｇ）→｛１，…，ｎ｝记，且当ｊ≠ｉ时，Ｇ中有边以ｆ（－１）（ｊ）及ｆ（－１）（ｉ）为两端点｝）．称Ｐ（Ｇ）＝ｍｉｎ｛Ｐ（ｆ）：ｆ是Ｇ上的标号｝为图Ｇ的轮廓．对以Ｗ表示Ｇ中Ｗ的边界．本文证明：ｉ）若Ｇ是凝聚图，ｆ及ｆ是Ｇ上一对互逆标号，则Ｐ（Ｇ）＝Ｐ（ｆ）的充要条件是ｆ为凝聚标号，且此时若Ｇ，Ｈ均是凝聚图，则存在阶梯标号。使得路、回、完全留之间的下列乘积图也是凝聚图，且其轮廓为