具有较小秩的带号图的刻画

带号图是每条边带有符号（正或负）的简单图.探讨了带号图的秩,刻画了秩为2与3的带号图,以及秩为4的带号二部图.     

在二部无标度网上的两性疾病传播

利用易感-感染-易感(SIS)传播模型研究人类性接触网上的病毒传播.当仅仅考虑异性性接触时,该网络是一个二部的无标度网.对这个网络上的SIS传播模型,通过率方程的方法分析了男性感染率和女性感染率与传染阈值之间的关系,发现女性感染者与男性感染者之比由网络的拓扑和男女感染率之比所确定.这一结果表明性接触网的拓扑对性传染病传播的重要性.最后给出了支持理论结果的数值模拟. 关键词： 性传染病 两性性接触网 无标度网络 二部图     

Cycloparaphenylene (CPP) series are molecular models for graphene armchair edges: trends in their aromaticity and cyclic conjugation are evaluated

Cycloparaphenylene ([r]CPP) and cyclacene ([r]CA) series are models for short carbon nanotubes. It is shown that armchair edges in model cycloparaphenylenes possess greater aromaticity and cyclic conjugation than do zigzag edges in model cyclacenes. According to Aihara’s bond resonance energy (BRE) and Bosanac and Gutman energy effect (ef) measurements, cycloparaphenylenes are twice as aromatic as cyclacenes. The general solution of all eigenvalues of all members of the cycloparaphenylene series is given. The origin of the recurrence of some eigenvalues are determined.     

密度矩阵重正化群的异构并行优化

密度矩阵重正化群方法（DMRG）在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器（CPU）和图形处理器（GPU）的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到10⁴,使用的GPU显存小于12 GB.     

Propagation of optical vortex solitons due to the Gouy phase in strongly nonlocal nonlinear media

In this paper,we present a study on the propagation of the symmetrical optical vortices formed by two collinear Laguerre-Gauss solitons in strongly nonlocal nonlinear media.The optical vortices,which move along the beam axis as the light propagates,result in a rotation of the beam’s transverse profile.This physical reason of the rotation is the Gouy phase acquired by the component beams.     

The Creation of Spectral Gaps by Graph Decoration

We present a mechanism for the creation of gaps in the spectra of self-adjoint operators defined over a Hilbert space of functions on a graph, which is based on the process of graph decoration. The resulting Hamiltonians can be viewed as associated with discrete models exhibiting a repeated local structure and a certain bottleneck in the hopping amplitudes.