基于最大秩距离码的Niederreiter公钥密码体制的改进

为提高基于最大秩距离码的Niederreiter公钥密码体制的性能,对该体制进行了修改.利用双公钥及哈希函数来改进基于最大秩距离码的Niederreiter公钥密码体制,增加该体制的攻击复杂度;利用目前攻击Niederreiter公钥密码体制的方法对其进行安全性测试和分析,证明了该体制的安全性;对公开密钥的校验矩阵进行初等变换,从而减少体制的公开密钥量,提高了体制的纠错能力.     

大鼠睾丸支持细胞的分离培养及鉴定

通过简化、优化现有的SD大鼠睾丸支持细胞分离纯化方法,获得高纯度大量的支持细胞。选用15d的雄性SD大鼠,处死取出睾丸,采用0.25%胰蛋白酶消化的一步消化法分离支持细胞,置于35℃、5%CO2和100%湿度空气的CO2培养箱中进行培养。24h后用20mmol·L-1的Tris-HCl处理细胞,并用油红O、HE染色和Feulgen染色观察对培养的支持细胞进行鉴定。分离纯化的支持细胞纯度达到90%以上,纯化获得的细胞其形体结构与支持细胞一致。因此,一步消化法可以获得高纯度的支持细胞。     

Some Abstract Critical Point Theorems for Self-adjoint Operator Equations and Applications

By using the index theory for linear bounded self-adjoint operators in a Hilbert space related to a fixed self-adjoint operator A with compact resolvent,the authors discuss the existence and multiplicity of solutions for(nonlinear) operator equations,and give some applications to some boundary value problems of first order Hamiltonian systems and second order Hamiltonian systems.     

基于微流控技术的磁免疫荧光法在EB病毒检测中的应用

EB病毒(Epstein-Barr virus,EBV)的早期诊断能够降低患者发生重大疾病的风险.临床上常用的EBV抗体的检测方法存在耗时长、试剂消耗大和效率低等缺点.相比于传统的检测方法,微流控(microfluidics)技术具有高通量、试剂消耗少,污染少和自动化程度高等优点,磁免疫荧光技术具有检测效率高、信号强等...     

Minimal periodic solutions of first-order convex Hamiltonian systems with anisotropic growth

Based on the work of Clarke and Ekeland and using duality variational principle, we confirm the existence of minimal periodic solutions of some convex Hamiltonian systems with anisotropic growth.     

Error bounds of Lanczos approach for trust-region subproblem

Because of its vital role of the trust-region subproblem (TRS) in various applications, for example, in optimization and in ill-posed problems, there are several factorization-free algorithms for solving the large-scale sparse TRS. The truncated Lanczos approach proposed by N. I. M. Gould, S. Lucidi, M. Roma, and P. L. Toint [SIAM J. Optim., 1999, 9: 504–525] is a natural extension of the classical Lanczos method for the symmetric linear system and eigenvalue problem and, indeed follows the classical Rayleigh-Ritz procedure for eigenvalue computations. It consists of 1) projecting the original TRS to the Krylov subspaces to yield smaller size TRS’s and then 2) solving the resulted TRS’s to get the approximates of the original TRS. This paper presents a posterior error bounds for both the global optimal value and the optimal solution between the original TRS and their projected counterparts. Our error bounds mainly rely on the factors from the Lanczos process as well as the data of the original TRS and, could be helpful in designing certain stopping criteria for the truncated Lanczos approach.