multiplications
英 [ˌmʌltɪplɪˈkeɪʃənz]
美 [ˌmʌltəpləˈkeɪʃənz]
n. 乘; 相乘; 增加
multiplication的复数
双语例句
- This multiplier has two working modes, normal mode and SIMD mode which support 16-bit multiplication or two 8-bit multiplications respectively.
该乘法器有两种工作模式，普通模式和SIMD模式，可以支持16位整数乘法或2个8位乘法。 - By proceeding from the general, form of the product of two linear polynomials, this paper presents some skills in seeking 7 multiplications on diagrams for the problem of the product of two 2 × 2 matrices.
本文从两个线性多项式乘积的一般形式出发，讨论用7次乘法求两个2×2矩阵乘积问题，给出了一套在图形上寻找7次乘法的技巧。 - The ANALYSATOR HANNOVER evaluates statistically probability density distributions PDD and class frequency distributions CFD of different stochastic variables and calculates from the instantaneous values of welding voltage u and welding current I, the True Electrical Power Input as the linear mean value of all multiplications UI.
汉诺威分析仪采用统计学的概率密度分布PDD和频段分布（CFD）方法对不同的随机变量进行评定，通过对瞬间焊接电流（I）与电弧电压（U）乘积的计算而获得真实电能功率。 - You are to write a program to perform such multiplications and save the world.
你来设计一个程序执行该乘积运算，以拯救世界。 - As compared with the FPT algorithm for 2-D cyclic convolutions, the amount of multiplications of the algorithm introduced here decreases by one order of magnitude, and also it relieves the strict restriction of word length about cyclic convolution scale in FNT algorithm of 2-D cyclic convolutions.
与二维循环卷积的FPT算法相比，乘法量减少了一个数量级，同时实际取消了FNT算法中卷积规模所受到的字长的限制。 - The paper discussed the algorithm for computing Scalar Multiplications on none-supersingular elliptic curves defined over GF ( 2~ m).
标量乘法的快速运算是椭圆曲线密码学中研究的一个焦点。 - Meanwhile, it is proved that the multiplications on the homotopy classes defined by CoH-arrow group and H-arrow group are the same and commutative.
同时证明了若CoH-arrow同伦类有分别由CoH-arrow群乘法与H-arrow群乘法给出的两个群乘法，则这两个乘法相同且是可交换的。 - This paper discusses the software implementation of the elliptic curve digital signature algorithm ( ECDSA) over GF ( 2m), and gives a new way to compute point multiplications based Fixed-Point which improve the speed of digital signature generation and signature checking.
本文讨论了椭圆曲线数字签名算法（ECD-SA）在GF（2~m）域上的软件实现，提出了一种基于固定基的核心点乘运算的快速算法，提高了数字签名和签名验证的速度。 - A symmetric generator polynomial was applied, and the number of Galois-field ( GF) multiplications was reduced in the encoder.
在编码器中，采用系数对称的生成多项式，减少了迦罗华域（GF）乘法器的个数。 - Compared with the existing schemes without suffering from key escrow, ours achieves higher efficiency since the signing algorithm needs only one scalar multiplication in the additive group while the reverse operation requires only three scalar multiplications. 4.
与已有的无密钥托管的签名方案相比，我们的方案实施效率高：签名算法只需要1个加法群上的标量乘运算，而验证算法仅需3个标量乘运算。