图模式挖掘中的子图同构算法

图模式挖掘问题在Web挖掘、生物信息学、社会关系等众多领域有广泛的应用,它涉及到子图的搜索以及子图的同构问题.这两个问题都具有相当高的计算复杂度,现有的子图同构问题大多采用最小编码算法,但对无标签图特别是对无标签无向图,该算法效率较底,从而子图的同构成为图模式挖掘问题的一个瓶颈.针对无标签图,以代数理论为基础,分别利用度序列和特征值构造了两种子图同构算法,用于对有向图和无向图的同构判别.最后对2个真实生物网络进行了仿真实验,结果表明,算法的效率优于现有算法.     

基于格半群的有限状态自动机的同态

本文研究了格值有限状态自动机(LFSA)的同态和强同态及其性质.利用强同态概念,在格值有限状态自动机的状态集上建立了一种等价关系,得到了格值有限状态自动机的商自动机,证明了商自动机与强同态像自动机同构.     

Classification of extensions of torus algebra II

We use extension theory and algebraic methods to give a complete characterization of extensions of torus algebra by stable Cuntz algebras,and prove certain classification theorems of these extension algebras.     

Isomorphism of extensions of C(T~2)

In this paper we give a certain classification theorem of extensions of the torus algebra up to isomorphism and also show that the K 0 -group K 0 (E) and the semigroup V (E) are two complete invariants of such extension algebras.     

纳米晶粒取向连生与枝蔓晶的形成

本文研究了在水热条件下ZnO、BaTiO3、La2/3TiO3和Fe2O3纳米晶粒的取向连生和枝蔓晶的形成.用负离子配位多面体生长基元理论模型讨论了纳米晶粒的取向连生和晶粒相连的枝蔓晶,其枝蔓晶的形成与通常枝蔓晶的形成机理是一致的,都是沿着晶体中负离子配位多面体相互联结的稳定方向,为晶体生长速率最快方向,其分布的对称性与晶体结构的对称性是对应一致的.     

D[X2m]的下界估计与X2m矩阵的快速构造

本文利用有向图理论研究了Xn矩阵的特性，给出了X2m矩阵类的快速构造方法，证明了拉丁方矩阵D[X2m]数目的下界估计是：2m(2m)! ∑^mi=2[(2m)!]^2/П^ij=1Kj!П^rj=1bj!。     

A note on 3‐factorizations of K10*

In this note, we enumerate all nonisomorphic 3‐factorizations of K₁₀. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 379–383, 2001     

套代数模上的线性保秩映射

主要讨论作用在复Hilbert空间弱闭 AlgN-模上的线性保秩映射，并给出在各种情况下保秩一性线性映射的刻画．作为应用，最后讨论了弱闭 AlgN-模上的模同构，并得出这样的同构是平凡的．     

Tree-edges deletion problems with bounded diameter obstruction sets

We study the following problem: given a tree G and a finite set of trees H, find a subset O of the edges of G such that G-O does not contain a subtree isomorphic to a tree from H, and O has minimum cardinality. We give sharp boundaries on the tractability of this problem: the problem is polynomial when all the trees in H have diameter at most 5, while it is NP-hard when all the trees in H have diameter at most 6. We also show that the problem is polynomial when every tree in H has at most one vertex with degree more than 2, while it is NP-hard when the trees in H can have two such vertices.The polynomial-time algorithms use a variation of a known technique for solving graph problems. While the standard technique is based on defining an equivalence relation on graphs, we define a quasiorder. This new variation might be useful for giving more efficient algorithm for other graph problems.     

Rolling of a non-homogeneous ball over a sphere without slipping and twisting

Consider the problem of rolling a dynamically asymmetric balanced ball (the Chaplygin ball) over a sphere. Suppose that the contact point has zero velocity and the projection of the angular velocity to the normal vector of the sphere equals zero. This model of rolling differs from the classical one. It can be realized, in some approximation, if the ball is rubber coated and the sphere is absolutely rough. Recently, J. Koiller and K. Ehlers pointed out the measure and the Hamiltonian structure for this problem. Using this structure we construct an isomorphism between this problem and the problem of the motion of a point on a sphere in some potential field. The integrable cases are found.