E(p,q)与E_0(p,q)空间中解析函数的积分的代数性质

证明了E(p,q)和E0(p,q)中的函数的积分关于乘法构成一个代数     

全概率公式在解题中的应用

在古典概型中，全概率公式既是重点也是难点．要使学生对属于全概率公式求解的题目做出准确的判断，需要正确地进行分析．通过对典型题目的分析，总结出求解此类问题的方法和解题步骤，并给出了全概率公式的记忆方法．     

Involvement of working memory in mental multiplication in Chinese elementary students

The authors' aim was to examine the relation between two-digit mental multiplication and working memory. In Study 1, involving 30 fifth-grade students, we used digit span backward as an abbreviated measure of working memory. In Study 2, involving 41 fourth-grade students, working memory comprised measures of phonological loop, visuospatial sketchpad, and central executive (i.e., updating) based on A. Miyake et al. (2000 Miyake, A., Friedman, N. P., Emerson, M. J., Witzki, A. H., Howerter, A., &; Wager, T. D. (2000). The unity and diversity of executive functions and their contributions to complex “frontal lobe” tasks: A latent variable analysis. Cognitive Psychology, 41, 49–100.[Crossref], [PubMed], [Web of Science ®] , [Google Scholar]). In Study 1, working memory measured through the use of digit span backward explained unique variance in response time. In Study 2, participants' accuracy and response time were most susceptible to phonological loop influence. The findings support the argument that multiplication facts are stored in a verbal form and the retrieval of multiplication facts relies more on verbal modality. Unique features of Chinese mathematics instruction of mental multiplication were discussed. The findings suggested that the involvement of different subcomponents of working memory in mental arithmetic may be subject to instructional, contextual, and linguistic factors.     

人力资本投资主体多元化问题初探

尽管人力资本投资对经济增长和经济发展的作用已经为人们所熟知，但在广大发展中国家仍然存在人力资本投资主体单一、投资不足这一持久不能较好解决的问题。章以中国为例，从政府人力资本投资行为的经济学解释出发，分析政府的投资行为和实现人力资本投资社会化、多元化的原因及相关措施。     

三维非对易相空间中带电谐振子的能级

非对易空间效应是出现在弦的尺度下的一种物理效应.本文介绍了非对易相空间量子力学的代数关系和Moyal—W eyl乘法.在所考虑的相空间变量的对易关系中包含了坐标-坐标和动量-动量两个方面的非对易性,给出了非对易相空间中三维带电谐振子在空间电场中的能级.     

单环为除环的一个充分条件及交换单环的分类

运用环论中理想的性质,得到单环为除环的一个充分条件及其推论。同时运用群论中Lagrange定理的较弱逆命题,推出没有真子群的群必为素数阶有限群的结论;进一步综合所得结果,得到交换单环的一个分类。即交换单环要么是域要么是基数为素数的零乘环。     

关于n阶(n1,n2)型二重(r1,r2)-循环矩阵求逆及相乘的计算方法

循环矩阵的求逆及相乘的算法，无论在理论上还是在实际应用中都具有非常重要的意义．本文不从计算Jordan标准形式或特征值出发，而是利用矩阵乘法及逆矩阵的一些简单性质，给出了n阶(n1，n2)型二重(r1,r2)-循环矩阵求逆、两个n阶(n1，n2)型二重(r1，r2)-循环矩阵相乘的直接计算方法，推广了已有的结果,这些算法已编到C 源代码在服务器上通过，验证了这些算法是稳定的有效的,若用快速富里叶变换(FFT)计算，这些算法的时间复杂性均为O(n1n2log2n1n2)。     

大花蕙兰组培快繁技术的研究

以大花蕙兰的茎尖为外植体,探讨了不同培养基对原球茎增殖、分化和小苗诱导及壮苗生根的影响．结果表明：1)大花蕙兰组织培养的原球茎诱导和增殖都可以用培养基1／2MS BA1．0mg／L NAA0．5mg／L;2)适合大花蕙兰组织培养原球茎芽苗诱导的培养基配方为1／2MS BAl．5mg／L NAA0．5mg／L;3)适合大花蕙兰壮苗生根的培养基配方为1／2MS NAA0,1mg／L GAl．0mg／L的组合．     

High-performance hardware architecture of elliptic curve cryptography processor over GF(2163)

We propose a novel high-performance hardware architecture of processor for elliptic curve scalar multiplication based on the Lopez-Dahab algorithm over GF(2163) in polynomial basis representation. The processor can do all the operations using an efficient modular arithmetic logic unit, which includes an addition unit, a square and a carefully designed multiplication unit. In the proposed architecture, multiplication, addition, and square can be performed in parallel by the decomposition of computation. The point addition and point doubling iteration operations can be performed in six multiplications by optimization and solution of data dependency. The implementation results based on Xilinx Virtexll XC2V6000 FPGA show that the proposed design can do random elliptic curve scalar multiplication GF(2163) in 34.11 μs, occupying 2821 registers and 13 376 LUTs.     

基于GF（P）椭圆曲线加密的点乘实现方案

基于GF（p）上的椭圆曲线加密算法是公钥加密的一种。ECC算法中主要的运算是点乘运算,文章主要分析了点乘运算中使用的各种算法：NAF算法,坐标转换,Montgomery模乘。并在算法的基础上研究了倍点和．最加运算中的数据相关性,提出了一种采用四个算术单元的并行结构,实现了算法和体系结构的最佳组合方案。