实时共行多媒体编辑系统的一致性问题

讨论实时多媒体编辑系统中的一致性问题，特别是企望保持（intention-Preserving）一致性问题．给出了相应的变换规则和实现算法，并与undo／do／redo方案相结合给出了一个完整的解．     

一类非线性差分方程的持久性与全局吸引性

本文研究了差分方程ｘ（ｎ＋１）＝ｘｐｎｆ（ｘｎ，ｘ（ｎ－ｋ１），…，ｘ（ｎ－ｋｒ））的持久性与全局吸引性，解决了文［３］提出的两个研究课题，所得结果包含了文［３］的相应结果．     

带有P0函数的非线性互补问题的一个新的非内点连续算法

研究带有P₀函数的非线性互补问题. 基于一个新的光滑函数, 把问题近似成参数化的光滑方程组, 并且给出一个新的非内点连续算法. 所给算法在每步迭代只需要求解一个线性方程组和执行一次Armijo类型的线搜索. 在不需要严格互补条件的情况下, 证明了算法是全局收敛和超线性收敛的. 并且, 在一个较弱的条件下该算法具有局部二阶收敛性. 数值实验证实了算法的可行性和有效性.     

CONSTRUCTING POINTED WEAK HOPF ALGEBRAS BY ORE-EXTENSION

The main work of this article is to give a nontrivial method to construct pointed semilattice graded weak Hopf algebra At =n i =0Aαi tfrom a Clifford monoid S = [Y; Gα, φα,β ]by Ore-extensions, and to obtain a co-Frobenius semilattice graded weak Hopf algebra H(S, n, c, χ, a, b) through factoring At by a semilattice graded weak Hopf ideal.     

Static Theory for Planar Ferromagnets and Antiferromagnets

Here we generalize the “BBH”-asymptotic analysis to a simplified mathematical model for the planar ferromagnets and antiferromagnets. To develop such a static theory is a necessary step for a rigorous mathematical justification of dynamical laws for the magnetic vortices formally derived in [1] and [2]. Received March 15, 2001, Accepted May 16, 2001     

中医方药量化研究中“相对药量”的数学模型体系

建立中医方药量华研究的"相对药量"概念模型体系;方法:运用微分方程理论;提出五种情况下,中药常用量范围内相对药量概念的数学模型,分别为直线模型、指数函数模型、对数函数模型、二次函数模型(开口向上和向下两种),并说明该模型体系的和理性与适应性;结论:相对药量概念核心体系的建立,增加了中医方药"相对药量"可比性的全面性,这对进一步研究单位药乃至方剂中各药在性、味、归经等方面的影响程度及其规律性,将起到至关重要的作用.     

关于线性算子的概率范数与算子空间

由于满足(PN-5)条件的PN空间(E,F)就是MangerPN空间(E,F,min),因此,肖建中等给出的关于PN空间上线性算子概率范数的结果有较大的局限性.本文中,在较一般的MengerPN空间上研究有关线性算子的概率范数和算子空间的问题,改进和推广了肖建中等的结果.     

从Bα到Qk的复合算子

用K—Carleson测度刻画了B^α（B0^α）到QK的复合算子的有界性，以及B^α到QK,0的复合算子的有界性和紧性．     

TWO-SCALE FINITE ELEMENT DISCRETIZATIONS FOR PARTIAL DIFFERENTIAL EQUATIONS

Some two-scale finite element discretizations are introduced for a class of linear partialdifferential equations. Both boundary value and eigenvalue problems are studied. Basedon the two-scale error resolution techniques, several two-scale finite element algorithmsare proposed and analyzed. It is shown that this type of two-scale algorithms not onlysignificantly reduces the number of degrees of freedom but also produces very accurateapproximations.     

Periodicities in Cluster Algebras and Cluster Automorphism Groups

We study the relations between two groups related to cluster automorphism groups which are defined by Assem,Schiffler and Shamchenko.We establish the relation-ships among (strict) direct cluster automorphism groups and those groups consisting of periodicities of labeled seeds and exchange matrices,respectively,in the language of short exact sequences.As an application,we characterize automorphism-finite cluster algebras in the cases of bipartite seeds or finite mutation type.Finally,we study the relation between the group Aut(A) for a cluster algebra A and the group AutMn(S) for a mutation group Mn and a labeled mutation class S,and we give a negative answer via counter-examples to King and Pressland's problem.