四阶整数辛群中扭元的共轭类

本文给出四阶整数辛群中扭元的全部共轭等价类.总共有55个不同的扭元等价类,它们的阶数分别是2, 3, 4, 5, 6, 8, 10, 12.没有其它阶的扭元.     

一种新的多重权值复杂网络模型的建立与同步控制

考虑复杂网络边上多个权值的情况,建立了一种新的具有多重权值的复杂网络模型.同时根据网络拆分的思想,将含有多重权值的复杂网络拆分为若干个单权值的子网络.根据Lyapunov稳定性理论,研究了多重权复杂网络的全局同步.通过Matlab数值仿真,验证了该结论的有效性.     

最大度为3或4的图的邻和可区别全染色

图 G 的一个正常[k]-全染色是一个映射：V∪E→｛1,2,…,k｝,使得 V∪E 中任意一对相邻或者相关联元素染不同颜色。用 f（v）表示点 v 及所有与其关联的边的颜色的加和,若对任意 uv∈E（G）,有 f（u）≠f（v）,则称该染色为图 G 的[k]-邻和可区别全染色。k 的最小值称作图 G 的邻和可区别全色数,记为 tndiΣ（G）。Pils＇niak 和Woz＇niak 提出猜想：对任意简单图 G,有 tndiΣ（G）≤Δ（G）＋3,其中Δ（G）为图 G 的最大度。图 G 的最大平均度,记为 mad（G）,是 G 的所有非空子图的平均度的最大值。运用组合零点定理和权转移方法,证明了若Δ（G）＝3且mad（G）＜125,或Δ（G）＝4且 mad（G）＜52,则 tndiΣ（G）≤Δ（G）＋2。     

部分和之和的弱不变原理

利用独立同分布随机变量序列部分和的最大值不等式和极限性质,得到了独立同分布随机变量序列部分和之和的弱不变原理,丰富了部分和之和的渐近性质。     

pyMolDyn: Identification,structure, and properties of cavities/vacancies in condensed matter and molecules

pyMolDyn is an interactive viewer of atomic systems defined in a unit cell and is particularly useful for crystalline and amorphous materials. It identifies and visualizes cavities (vacancies, voids) in simulation cells corresponding to all seven 3D Bravais lattices, makes no assumptions about cavity shapes, allows for atoms of different size, and locates the cavity centers (the centers of the largest spheres not including an atom center). We define three types of cavity and develop a method based on the split and merge algorithm to calculate all three. The visualization of the cavities uses the marching cubes algorithm. The program allows one to calculate and export pair distribution functions (between atoms and/or cavities), as well as bonding and dihedral angles, cavity volumes and surface areas, and measures of cavity shapes, including asphericity, acylindricity, and relative shape anisotropy. The open source Python program is based on GR framework and GR3 routines and can be used to generate high resolution graphics and videos. © 2016 Wiley Periodicals, Inc.     

大理岩动态拉伸强度及弹性模量的SHPB实验研究

提出了获取脆性材料动态拉伸强度及弹性模量的实验步骤及相关记录数据的分析方法。利用直径为100mm的分离式Hopkinson压杆径向冲击巴西圆盘和平台巴西圆盘试样,测试了大理岩在高应变率加载下的动态力学性能。应力波加载下动态劈裂拉伸圆盘在试样中心产生了约45/s的拉伸应变率。分析了实验的有效性并考虑了试样两个端面应力波波形差异的影响以提高实验结果的精度。结果表明准静态下的公式可适用于动态劈裂拉伸实验;大理岩的动态拉伸强度及弹性模量比静态时有明显的增加。     

La0.8Sr0.2Co1-xFexO3材料局域结构的研究

采用溶胶-凝胶法制备了La0.8Sr0.2Co1-xFexO3样品,并测量了各样品的X射线衍射谱（XRD）和X射线吸收精细结构（XAFS）谱。XRD分析研究发现Fe的掺杂引起了La0.8Sr0.2CoO3材料相分离;在前期对X射线吸收精细结构谱近边分析的基础上,进一步分析扩展边X射线吸收精细结构谱,表明在La0.8Sr...     

The nucleon wave function at the origin

We calculate the next-to-leading order perturbative corrections to the SVZ sum rules for the coupling fN$f_N$, the nucleon leading twist wave function at the origin. The results are compared to the established Ioffe sum rules and also to lattice QCD simulations.     

On Toughness and Hamiltonicity of 2K2‐Free Graphs

The toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A whose removal yields components. Determining toughness is an NP‐hard problem for general input graphs. The toughness conjecture of Chvátal, which states that there exists a constant t such that every graph on at least three vertices with toughness at least t is hamiltonian, is still open for general graphs. We extend some known toughness results for split graphs to the more general class of 2K₂‐free graphs, that is, graphs that do not contain two vertex‐disjoint edges as an induced subgraph. We prove that the problem of determining toughness is polynomially solvable and that Chvátal's toughness conjecture is true for 2K₂‐free graphs.