云计算在RSA密码体制分析中的应用

RSA是著名的公钥密码体制之一,其安全性是基于大整数因子分解困难性假设的,求解RSA问题的最直接方法是分解RSA的模数.由于云计算的大规模分布式计算能力,一些使用分布式计算模型MapReduce的大整数分解手段已经实现,针对大整数因子分解的问题,提出了给定范围内搜索因子的新方法,并对相应的实验数据和结果进行了分析.结果表明,在云中的分布式计算的运行时间远小于单台机器.     

Jordan李超代数的一些性质

代数A称为不可分解的,如果A不能分解成理想的直和.证明了满足C(L_o)=C(L)={0}的Jordan李超代数L一些重要性质.     

基于动态模态分解的长江口海表温度时空分布特征重构研究

河口近海海域的海表温度分布特征对于深入理解海洋热力、动力过程及海气相互作用等自然过程及综合效应具有重要意义。卫星数据重构是精确获取动态大面积海表温度数据的重要手段,采用非线性系统的动态模态分解（dynamic mode decomposition,DMD）数据分析方法,利用2003年1月至2016年7月的MODIS\SST数据,经剔除异常数据、填补空白数据后,重构了2016年8月至2019年12月长江口海洋表面温度数据,并评估了重构效果。研究结果表明,在时序数据充足的情况下,DMD算法能很好地解决动态系统的采样问题。DMD结合正交三角（orthogonal right triangular,QR）分解算法能有效重构长江口的海表温度数据,平均均方根误差（root mean square error,RMSE）为0.007 6。进一步分析发现,无论是DMD算法还是DMD结合QR分解算法,还原结果精度都较高。     

H一射影循环Kaehler流形

本文研究H一射影循环Kaehler流形的性质，导出了该流形曲率张量的代数结构，从而深化了这类流形的已有结果。     

ON SOLVABLE COMPLETE LIE SUPERALGEBRAS

The authors discuss the properties of solvable complete Lie superalgebra, proving that solvable Lie superalgebras of maximal rank are complete.     

缆机起重作业驾驶员的操作行为可靠性研究

缆机是大坝浇筑过程中的主要运输设备之一,缆机驾驶员操作水平直接关系缆机起重作业安全.为有效提高缆机起重作业驾驶员操作行为可靠性,预防起重作业安全事故,针对缆机起重作业周期性多维运动的特点,分解驾驶员操作流程;剖析操作行为失误,建立驾驶员行为模式;从时间角度量化操作流程,计算缆机驾驶员操作行为响应失误概率;构建操作行为可靠性分析模型,定量表达操作行为可靠性,分析人因失误对缆机起重作业安全事故的影响.结果表明,吊具与吊罐对接、混凝土卸料等作业过程的缆机驾驶员操作行为可靠性低,需加强安全培训,严格考核制度,从根本上提高缆机驾驶员操作行为的可靠性,以期提升缆机生产效率,实现预防安全事故的目标.     

马尔可夫过程穿越次数估计

本文研究了马尔可夫过程穿越次数估计.应用马尔可夫过程向前向后鞅分解方法,得到了穿越次数估计以及Meyer-Zheng拓朴的紧性判别准则,推广了Lyons-Zheng的结果.     

Finiteness of polyhedral decompositions of cusped hyperbolic manifolds obtained by the Epstein-Penner's method

Epstein and Penner give a canonical method of decomposing a cusped hyperbolic manifold into ideal polyhedra. The decomposition depends on arbitrarily specified weights for the cusps. From the construction, it is rather obvious that there appear at most a finite number of decompositions if the given weights are slightly changed. However, since the space of weights is not compact, it is not clear whether the total number of such decompositions is finite. In this paper we prove that the number of polyhedral decompositions of a cusped hyperbolic manifold obtained by the Epstein-Penner's method is finite.

     

Generalized Polar Decompositions on Lie Groups with Involutive Automorphisms

The polar decomposition, a well-known algorithm for decomposing real matrices as the product of a positive semidefinite matrix and an orthogonal matrix, is intimately related to involutive automorphisms of Lie groups and the subspace decomposition they induce. Such generalized polar decompositions, depending on the choice of the involutive automorphism σ , always exist near the identity although frequently they can be extended to larger portions of the underlying group. In this paper, first of all we provide an alternative proof to the local existence and uniqueness result of the generalized polar decomposition. What is new in our approach is that we derive differential equations obeyed by the two factors and solve them analytically, thereby providing explicit Lie-algebra recurrence relations for the coefficients of the series expansion. Second, we discuss additional properties of the two factors. In particular, when σ is a Cartan involution, we prove that the subgroup factor obeys similar optimality properties to the orthogonal polar factor in the classical matrix setting both locally and globally, under suitable assumptions on the Lie group G . September 12, 2000. Final version received: April 16, 2001.     

New perturbation bounds for the subunitary polar factors

In this article, we present some new perturbation bounds for the (subunitary) unitary polar factors of the (generalized) polar decompositions. Two numerical examples are given to show the rationality and superiority of our results, respectively. In terms of the one-to-one correspondence between the weighted case and the non-weighted case, all these bounds can be applied to the weighted polar decomposition.