互穿网络聚合物的自由体积特性

测量了不同组分比的聚氨酯/丙烯酸酯类树脂(PU/VERH)的化学计量和化学不计量同时互穿网络聚合物SINs(Simultaneous interpenetrating polymer networks)的正电子湮没寿命参数．研究结果表明两种SINs随组分变化存在相转变过程;而且化学计量PU/VERH SIN两组分间存在的较强化学键作用减小SINs平均自由体积孔洞尺寸,分子链段堆砌紧密,分子链段间相互作用增强．从而增强了互穿效果、极大地改善了SINs两组分之间的相溶性,从微观上改善了互穿网络聚合物的力学性能,为分子水平设计新型材料提供了实验依据．     

带多重选择的最短路问题:复杂性和算法

本文提出了带出重选择的是短路问题,建立了该问题的数学模型,利用背包问题的一个变形问题－带限制选择的背包问题,证明了该问题是ＮＰ－Ｃ的,最后利用动态规则给出了一个伪多项式算法,其时间复杂性Ｏ（Ｃｈｍｎ）,其中ｈ是最大的选择重数。     

几族3-优图

一个图 G中含有的三个结点的导出连通子图的个数 S3( G)在网络可靠性中起着重要作用 .在同点数同边数图类中具有最大 S3( G)的图称为 3-优图 ,它所代表的网络是点故障概率接近 1时的最可靠网络 .本文在已有的结果上进一步证明补图为 a K3∪ b K2 ∪ K1和 a K3-x的图分别是各自图类中唯一的 3-优图 ;补图为 a K3∪ ( b-1 ) K2 ∪ 2 K1和 ( a-1 ) K3∪ b K2 ∪ P3的图是该图类中仅有的两个 3-优图 .     

锌空电池气体扩散电极浸液量对放电性能的影响

锌空电池气体扩散电极在存放和放电过程中,电解液会在毛细力的作用下不断浸入电极。电解液在气体扩散电极中的浸入量与分布情况决定了气体扩散电极中的化学反应活化区,从而影响放电性能。通过实验测量了气体扩散电极开始浸液的4天内浸液量与放电性能的关系,并借助拓扑网络数值模拟电解液浸入多孔介质的过程帮助理解该实验现象。结果表明,随着放电过程的进行,浸液量和分布情况不断变化;气体扩散电极放电性能变化主要分为3个阶段:浸液饱和度为39.4%时放电性能最佳;浸液开始2~24小时进行迅速,浸液饱和度达到81%,放电性能小幅下降;24小时之后浸液增速大幅减缓,放电功率随浸液量增加大幅下降。     

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O（√N） steps for data compression

Vector quantization (VQ) is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take $O(N)$ steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes $O(\sqrt N )$ steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.     

Protocol for multi-party superdense coding by using multi-atom in cavity QED

We present a protocol for multi-party superdense coding by using multi-atom in cavity quantum electrodynamics (QED). It is shown that, with a highly detuned cavity mode and a strong driving field, the protocol is insensitive to both cavity decay and thermal field. It is even certain to identify GHZ states via detecting the atomic states. Therefore we can realize the quantum dense coding in a simple way in the multiparty system.     

The classification and analysis of dynamic networks

In this paper we, firstly, classify the complex networks in which the nodes are of the lifetime distribution. Secondly, in order to study complex networks in terms of queuing system and homogeneous Markov chain, we establish the relation between the complex networks and queuing system, providing a new way of studying complex networks. Thirdly, we prove that there exist stationary degree distributions of M--G--P network, and obtain the analytic expression of the distribution by means of Markov chain theory. We also obtain the average path length and clustering coefficient of the network. The results show that M--G--P network is not only scale-free but also of a small-world feature in proper conditions.     

Quasispecies distribution of Eigen model

We have studied sharp peak landscapes of the Eigen model from a new perspective about how the quasispecies are distributed in the sequence space. To analyse the distribution more carefully, we bring in two tools. One tool is the variance of Hamming distance of the sequences at a given generation. It not only offers us a different avenue for accurately locating the error threshold and illustrates how the configuration of the distribution varies with copying fidelity $q$ in the sequence space, but also divides the copying fidelity into three distinct regimes. The other tool is the similarity network of a certain Hamming distance $d_{0}$, by which we can gain a visual and in-depth result about how the sequences are distributed. We find that there are several local similarity optima around the centre (global similarity optimum) in the distribution of the sequences reproduced near the threshold. Furthermore, it is interesting that the distribution of clustering coefficient $C(k)$ follows lognormal distribution and the curve of clustering coefficient $C$ of the network versus $d_{0}$ appears to be linear near the threshold.     

基于Elman网络的近红外光谱技术多组分定量分析研究

研究了Elman神经网络(反馈神经网络,Recurrent Network)在近红外光谱定量分析中的应用。以饲料样品为实验材料,采用Elman网络建立了饲料中苯丙氨酸(Phe)、赖氨酸(Lys)、酪氨酸(Tyr)和胱氨酸(Cys)四种氨基酸含量的近红外光谱定量分析模型。用偏最小二乘法(partial least squares ,PLS)将原始数据压缩为主成分,取前3个主成分的12个吸收峰值输入Elman网络,网络中间层神经元个数为47。Elman网络模型对样品4个氨基酸含量的预测决定系数(r2)分别为0.960,0.981,0.979,0.952。表明所建Elman网络预测模型通过近红外光谱能够较准确预测饲料中苯丙氨酸、赖氨酸、酪氨酸和胱氨酸四种氨基酸的含量,为通过近红外光谱技术进行多组分定量分析提供了新思路。     

抢占型优先服务机制下多类排队网络的扩散逼近

证明一个满负荷交通极限定理以证实在抢占型优先服务机制下多类排队网络的扩散逼近,进而为该系统提供有效的随机动力学模型．所研究的排队网络典型地出现在现代通讯系统中高速集成服务分组数据网络,其中包含分组数据包的若干交通类型,每个类型涉及若干工作处理类（步骤）,并且属于同一交通类型的工作在可能接受服务的每一个网站被赋予相同的优先权等级,更进一步地,在整个网络中,属于不同交通类型的分组数据包之间无交互路由．