基于微流控技术的磁免疫荧光法在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.     

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.     

ZnO nanopowders and their excellent solar light/UV photocatalytic activity on degradation of dye in wastewater

Low-cost and scalable preparation,high photocatalytic activity,and convenient recycle of Zn O nanopowders(NPs)would determine their practical application in purifying wastewater.In this contribution,ZnO NPs were scalably synthesized via the simple reaction of Zn powder with H_2O vapor in autoclave.The structural,morphological and optical properties of the samples were systematically characterized by X-ray diffraction,scanning electron microscopy,Fourier transform infrared spectra,transmission electron microscopy,Micro-Raman,photoluminescence,and ultraviolet-visible spectroscopy.The as-prepared Zn O NPs are composed of nanoparticles with 100–150 nm in diameter,and have a small Brunauer-Emmett-Teller surface area of 6.85 m~2/g.The formation of Zn O nanoparticles is relative to the peeling of H_2 release.Furthermore,the product has big strain-stress leading to the red-shift in the band gap of product,and shows a strong green emission centered at 515 nm revealing enough atomic defects in Zn O NPs.As a comparison with P25,the obtained dust gray Zn O NPs have a strong absorbance in the region of 200–700 nm,suggesting the wide wave-band utilization in sunlight.Based on the traits above,the Zn O NPs show excellent photocatalytic activity on the degradation of rhodamine B(Rh-B)under solar light irradiation,close to that under UV irradiation.Importantly,the Zn O NPs could be well recycled in water due to the quick sedimentation in themselves in solution.The low-cost and scalable preparation,high photocatalytic activity,and convenient recycle of Zn O NPs endow themselves with promising application in purifying wastewater.     

Global convergence of a robust filter SQP algorithm

We present a robust filter SQP algorithm for solving constrained optimization problems. This algorithm is based on the modified quadratic programming proposed by Burke to avoid the infeasibility of the quadratic programming subproblem at each iteration. Compared with other filter SQP algorithms, our algorithm does not require any restoration phase procedure which may spend a large amount of computation. The main advantage of our algorithm is that it is globally convergent without requiring strong constraint qualifications, such as Mangasarian–Fromovitz constraint qualification (MFCQ) and the constant rank constraint qualification (CRCQ). Furthermore, the feasible limit points of the sequence generated by our algorithm are proven to be the KKT points if some weaker conditions are satisfied. Numerical results are also presented to show the efficiency of the algorithm.     

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

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