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

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

Asymptotically Isometric Copy of lβ (0 ＜β ＜ 1) in Spaces of Bounded Linear Operators

Assume X is a normed space, every x* ∈ S(X*) can reach its norm at some point in B(X), and Y is a β-normed space. If there is a quotient space of Y which is asymptotically isometric to lβ, then L(X, Y) contains an asymptotically isometric copy of lβ. Some sufficient conditions are given under which L(X, Y) fails to have the fixed point property for nonexpansive mappings on closed bounded β-convex subsets of L(X, Y).     

Isomorphisms of adjoint Chevalley groups over integral domains

It is shown that every automorphism of an adjoint Chevalley group over an integral domain containing the rational number field is uniquely expressible as the product of a ring automorphism, a graph automorphism and an inner automorphism while every isomorphism between simple adjoint Chevalley groups can be expressed uniquely as the product of a ring isomorphism, a graph isomorphism and an inner automorphism. The isomorphisms between the elementary subgroups are also found having analogous expressions.

     

The isometric extension problem in the unit spheres of l<Superscript>p</Superscript>(Г) (<Emphasis Type="Italic">p</Emphasis> >1) type spaces

In this paper, we first derive the representation theorem of onto isometric mappings in the unit spheres of l ^p (Г) (@#@(p >) 1,p ≠ 2 type spaces, and then we conclude that such mappings can be extended to the whole space as real linear isometries by using the previous result of the author.     

Complexity of some natural problems in automatic structures

We prove that the automatic isomorphism problem for automatic structures, the automatic automorphism problem for an automatic structure, and the automatic embedding problem for automatic structures are $ \overset{\lower0.5em\hbox{$ \overset{\lower0.5em\hbox{ Matematicheski $ \overset{\lower0.5em\hbox{$ \overset{\lower0.5em\hbox{ Zhurnal, Vol. 46, No. 1, pp. 71–78, January–February, 2005.     

Linear rank and corank preserving maps on (H) and an application to *-semigroup isomorphisms of operator ideals

We characterize linear rank-k nonincreasing, rank-k preserving, and corank-k preserving maps on B(H), the algebra of all bounded linear operators on the Hilbert space H. This unifies and extends finite-dimensional results and results on linear rank-1 non-increasing and rank-1 preserving maps in the infinite-dimensional case. We conclude with an application to *-semigroup isomorphisms of operator ideals.     

等距算子的延拓、逼近及相关问题

本文介绍了等距算子从单位球面、从区域及从保距离1等条件下的各种等距廷拓问题；并介绍了(线性与非线性算子)等距算子的弱扰动、强扰动及渐近等距算子等问题．文中从历史到现状，概括了重要的研究结果，并指出了一些尚未解决的遗留问题．     

N=2^t点DFT的快速卷积算法

从所周知,循环卷积和离散富里叶变换(DFT)可以互相计算,只要得到其中一个的快速算法就可导出另一个的快速算法。循环卷积目前已有乘法量为O(N)的最佳算法(特别是当N较小时),为此关键是如何将DFT转化为循环卷积,当DFT的长度N=p(p为素数),Rader利用有限域GF(p)的乘法群是循环群就成功地将p点DFT转化为Q(p)(F(p)为户的Euler函数)点循环卷积;当N=p~e时,由于商环Z/(p~e)存在F(p~c)阶元素,人们也成功地将p~c点DFT转化为P(p~(c-1))一系列循环卷积,即一个y(p~c)点循环卷积,二个P(p~(c-1))点     

带参数2n 阶非对称微分算子的一些线性同构定理

本文给出了一类带参数２ｎ阶非对称微分算子Ａ_λ的一些正则性定理，籍此可刻画一类飞行器在其运行过程中的双向平稳行为．     

Twisted Semigroup Crossed Products and Twisted Toeplitz Algebras of Ordered Groups

Let г^＋ be the positive cone of a totally ordered abelian group г, and σa cocycle in г. We study the twisted crossed products by actions of г＋ as endomorphisms of C^＊-algebras, and use this to generalize the theorem of Ji.