上加法

素环与半素环上加法映射和微商的研究

The Research into Additive Mappings and Derivations in Prime and Semiprime Rings

利用有限域上的加法、乘法和模加、模乘的混合组合加密数据。

In this scheme , data are encrypted by the combination of addition / multiplication in the finite field and module addition / multiplication .

在并行加法中，一个数字位因在该数位上做加法而产生的进位，该进位并被送至下一个高位数位。

In parallel addition , a carry which is produced in one digit place as a result of addition for that digit place and which is propagated to the next high-order digit place .

它们基本上就像加法机或康普托计算机那样组合在一起注，第一个转盘每转一圈，中间的转盘就旋转一格，中间的转盘每转一圈，最里面的转盘就旋转一格。

They were geared essentially like any kind of adding machine or comptometer , so that the middle rotor would move on one step when the first had made a complete revolution , and the innermost move a step when the middle one had made a complete turn .

本文在任意群的全体映射集合上定义了加法及乘法运算，证明了它恰好能做成一个Near环，讨论了有单位元的Near环与映射的Near环之间的关系。

In this paper , we define addition and multiplication in the set of mapping for arbitrary group , prove it s a Near - ring , and discuss the relation of a Near - ring with identity and mapping Near - ring .

一类幂等元集闭包是Clifford半群的逆半群上的同余加法含零半环的分配格的结构和同余

CONGRUENCES ON INVERSE SEMIGROUP THE CLOSURE OF WHOSE SET OF IDEMPOTENTS IS A CLIFFORD SEMIGROUP The Structures and Congruences of a Distributive Lattice of Semirings with Additional Zero Elements

在不采用流水线技术的条件下，实现CDF（9,7）提升小波变换的关键路径延时可以减少到1个乘法运算的延时加上4个加法运算的延时。

The critical path delay special for CDF ( 9,7 ) DWT could be reduced to 1 multiplication operation delay plus 4 addition operations delay without adopting pipeline technique .

首先，我们对传统CIT的方法学基本主张与操作模式，做一简要说明。你谅必在商店里见过现金收入记录机，它基本上只能做加法运算。

First of all , we will roughly describe methodological concept and operation mode for the traditional CIT , and brief illustrate above . In shops you will have seen cash registers which basically can only add .

你谅必在商店里见过现金收入记录机，它基本上只能做加法运算。收到现金股利时所作的分录是：借记现金，贷记股利收入。

In shops you will have seen cash registers which basically can only add . The entry to record receipt of a cash dividend consists of a debit to cash and a credit to Dividend Revenue .

固定窗口算法利用大整数的2进制表示和适量的预计算，减少椭圆曲线上点的加法运算，从而加快椭圆曲线上点的数乘的运算速度。

A fixed window algorithm , which uses 2 representation for large integer and acceptable computations , can greatly reduce the number of points addition , so the efficiency of the scalar multiplication in elliptic curves can be improved .

本文利用椭圆曲线上射影平面的概念，将椭圆曲线上加法转换成射影平面上的加法，从而避免了求逆运算。

In this paper , with the definition of projective plane on elliptic curve , the addition on elliptic curve is transformed to the addition on projective plane . So the inverse in addition algorithm of elliptic curve can be avoided .