Some theorems in asymptotic analysis

Basing ourselves on the analysis of magnitude of order, we strictly prove fundamental lemmas for asymptotic integral, including the cases of infinite region. Then a general formula for asymptotic expansion of integrals is given. Finally, we derive a sufficient condition for an ordinary differential equation to possess a solution of the Frobenius series type at finite irregular singularities or branching points.

一类Koblitz椭圆曲线的快速点乘

考虑一类特征3的Koblitz椭圆曲线的快速点乘算法.在这类曲线上适合建立低带宽的、可证明安全的密码体制.结果显示,利用这类曲线的复乘性质,使用模约减和Frobenius展开技巧,这类曲线上存在一种不带预计算的快速点乘算法,其运算速度是通常的重复加倍-点加算法的6倍.该算法的快速优化原理与有限域算术优化和椭圆曲线点的坐标表示的选取无关.

Robust Tensor Analysis With L1-Norm

Tensor analysis plays an important role in modern image and vision computing problems. Most of the existing tensor analysis approaches are based on the Frobenius norm, which makes them sensitive to outliers. In this paper, we propose L1-norm-based tensor analysis (TPCA-L1), which is robust to outliers. Experimental results upon face and other datasets demonstrate the advantages of the proposed approach.