对－氯苯乙烯和丙烯酸甲酯梯度共聚物的微观结构表征

对由原子转移自由基聚合(ATRP)方法得到的具有“活性”聚合特征的对－氯苯乙烯(S)和丙烯酸甲酯(M)梯度共聚物结构进行了表征．通过¹H、¹³C 核磁共振(NMR)方法和对羰基¹³C峰峰面积的拟合积分研究了该共聚物的单体以及以M为中心的三元组序列结构的组成含量随转化率的变化．研究结果表明：共聚物链中S和M单体含量随着转化率的增加分别表现出减小和增大的变化趋势;三元组序列结构的含量变化中,SMS和MMM分别呈现出单调下降和上升的变化,而MM/MMS则随着转化率的增加达到一个最大值,然后呈现下降趋势．本文还尝试运用了以M为中心的五元组序列结构对羰基¹³C峰峰面积进行更精确的拟合积分,其拟合峰面积的计算结果显示了与上述三元组序列结果相同的变化规律．     

两个渐近非扩张映射公共不动点的迭代程序

在一致凸Banach空间中,研究了迭代序列逼近收敛于两个渐近非扩张映射的公共不动点。所得结果推广了已有的一些结果。     

On the Common Substring Alignment Problem

The Common Substring Alignment Problem is defined as follows: Given a set of one or more strings S₁, S₂ … S_c and a target string T, Y is a common substring of all strings S_i, that is, S_i = B_iYF_i. The goal is to compute the similarity of all strings S_i with T, without computing the part of Y again and again. Using the classical dynamic programming tables, each appearance of Y in a source string would require the computation of all the values in a dynamic programming table of size O(nℓ) where ℓ is the size of Y. Here we describe an algorithm which is composed of an encoding stage and an alignment stage. During the first stage, a data structure is constructed which encodes the comparison of Y with T. Then, during the alignment stage, for each comparison of a source S_i with T, the pre-compiled data structure is used to speed up the part of Y. We show how to reduce the O(nℓ) alignment work, for each appearance of the common substring Y in a source string, to O(n)-at the cost of O(nℓ) encoding work, which is executed only once.     

Galois环上本原序列压缩映射的单性

设Ω是 Ｇａｌｏｉｓ环 ＧＲ（２~ｄ,ｒ）的 Ｔｅｉｃｈｍｕｌｌｅｒ代表集,则 ＧＲ（２~ｄ,ｒ）上每条序列ａ有唯一的权位分解,　其中ａ-ｉ是Ω上序列,同时也可自然视为有限域Ｆ-（２~ｒ）,上序列．设ｆ（ｘ）是环 ＧＲ（２~ｄ,ｒ）上强本原多项式,Ｇ（ｆ（ｘ））表示 ＧＲ（２~ｄ,ｒ）上以ｆ（ｘ）为特征多项式的序列的全体,是Ｆ-（２~ｒ）上一类ｄ－１元多项式, 　本文证明了压缩映射是单射,即对 ａ＝ ｂ当且仅当对所有 ａ,ｂ ∈ Ｇ（ｆ（ｘ））．     

三值序列的特征检测及其产生

本文重新定义了三值序列的表述及其规范,根据三值序列特征检测及其产生电路含有模3乘2运算,本文提出了具有Q,2Q双轨输出的三值D型触发器,以简化相关电路的逻辑结构并减少延迟,本文还讨论了三值线性模和特征序列及相应的电路设计。     

Musielak-Orlicz序列空间的单调点

得到Ｍｕｓｉｅｌａｋ Ｏｒｌｉｃｚ序列空间中上（下）单调点和上（下）局部一致单调点的充分必要条件．     

混沌遗传算法

利用混沌序列来构造遗传算子,使不同代之间从短期看似随机的,而从长期看则存在着一种“精致”地内在关系,由此获得了一系列基于混沌序列的遗传算法,这些算法对克服标准遗传算法中的一些不足是有利的,更重要是将混沌引入遗传算法的新思路。     

1‐Rotational Steiner triple systems over arbitrary groups

Phelps and Rosa introduced the concept of 1‐rotational Steiner triple system, that is an STS(ν) admitting an automorphism consisting of a fixed point and a single cycle of length ν ? 1 [Discrete Math. 33 ( 12 ), 57–66]. They proved that such an STS(ν) exists if and only if ν ≡ 3 or 9 (mod 24). Here, we speak of a 1‐rotational STS(ν) in a more general sense. An STS(ν) is 1‐rotational over a group G when it admits G as an automorphism group, fixing one point and acting regularly on the other points. Thus the STS(ν)'s by Phelps and Rosa are 1‐rotational over the cyclic group. We denote by ??_1r, ??_1r, ??_1r, ??_1r, the spectrum of values of ν for which there exists a 1‐rotational STS(ν) over an abelian, a cyclic, a dicyclic, and an arbitrary group, respectively. In this paper, we determine ??_1r and find partial answers about ??_1r and ??_1r. The smallest 1‐rotational STSs have orders 9, 19, 25 and are unique up to isomorphism. In particular, the only 1‐rotational STS(25) is over SL₂(3), the special linear group of dimension 2 over Z₃. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 215–226, 2001     

Some results for asymptotically pseudo-contractive mappings and asymptotically nonexpansive mappings

Some convergence theorems of modified Ishikawa and Mann iterative sequences with errors for asymptotically pseudo-contractive and asymptotically nonexpansive mappings in Banach space are obtained. The results presented in this paper improve and extend the corresponding results in Goebel and Kirk (1972), Kirk (1965), Liu (1996), Schu (1991) and Chang et al. (to appear).

     

关于零和子列个数的一个猜想

本文证明了下述结论: 设p>10000为一素数且合于p≡3(mod 4),取S=((?)2,3)为Z_p上p项序列,则不存在 Z_p上 p 项序列 T,使得f_p(S)=f_p(T)且T的非零项最多有两项互异,其中,f_p(S)表示S的零和子列的个数,这一结论否定了一个有关零和问题的猜想,