An efficient hydrodynamic cellular automata for simulating fluids with large viscosities

A hydrodynamic cellular automata (HDCA) for simulating two-dimensional fluids with large viscosities is proposed. The model is characterized by a mean free path which is of the same size as in the FHP-II model, but with a viscosity more than 10 times larger. This new model should make simulations of flows at low Reynolds number more efficient.     

von-Neumann正则环与左SF-环

环R称为左SF-环,如果每个单左R-模是平坦的.众所周知,Von-Neumann正则环是SF-环,但SF-环是否是正则环至今仍是公开问题,本文主要研究左SF-环是正则环的条件,证明了:如果R是左SF-环且R的每个极大左(右)理想是广义弱理想,那么R是强正则环.并且推广了Rege[3]中的相应结果.     

加权Bergman空间上小Hankel算子的Schatten类

讨论了 C\+n 中有界对称域的加权Bergman空间上符号属于 L\+2\-a(Ω, dV\-λ) 的小Hankel算子, 利用符号 Φ 的某种积分变换,给出了小Hankel算子 h\-Φ 属于Schatten理想 S\-p 的特征.     

多目标最优化的一种积分型实现算法

在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法．本文利用数论中的一致分布佳点集列，较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则．并经过有关函数数值计算表明该算法是有效的，可用来求解多目标最优化问题的有效解．     

Artinian level modules and cancellable sequences

In order to use dualization to study Hilbert functions of artinian level algebras we extend the notion of level sequences and cancellable sequences, introduced by Geramita and Lorenzini, to include Hilbert functions of certain artinian modules. As in the case of algebras a level sequence is cancellable, but now by dualization its reverse is also cancellable which gives a new condition on level sequences. We also give a characterization of the cancellable sequences involving Macaulay representations.     

On tolerance lattices of algebras in congruence modular varieties

We prove that the tolerance lattice TolA of an algebra A from a congruence modular variety V is 0-1 modular and satisfies the general disjointness property. If V is congruence distributive, then the lattice Tol A is pseudocomplemented. If V admits a majority term, then Tol A is 0-modular. This revised version was published online in June 2006 with corrections to the Cover Date.     

高压下某些导电高分子色散关系的研究

利用晶格动力学方法,研究在高压下几种导电高分子具有不同晶格链时的色散关系及其曲线的变化.链间耦合作用的减弱使横波与纵波的ω差值相应增大,且在BZ边界处拉开一个间隙,这是维度作用的结果.     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing