乘法

BUNTY: BUNTY : pls tell me how can i get a free rapidshare premium account pls giv me password or link or a premium account...

最小二乘法告诉我，我怎么才能免费rapidshare溢价帐最小二乘法giv我的密码或链接或溢价帐。。。

The types of solution activities of Chi-chi were different in three different types of problem's situation: equal groups, Cartesian product and multiplicative comparison.

乘法问题的类型会影响琦琦解题活动的类型，也就是说，琦琦会选用不同的解题活动类型，来分别解决等组型、直积型与比较型乘法问题。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

Furthermore, we define a convolution multiplication between characteristic functions of constructible subsets by using push-forward functor from the category of algebraic varieties over C to the category of spaces of constructible functions. We construct geometric model for "intrinsic symmetry" of the octahedral axiom in a triangulated category. Using it, we deduce the multiplication satisfies the Jacobi identity of Lie algebra and then realize infinite dimensional Lie algebras.

进一步，我们使用复代数簇范畴到可构函数空间范畴的pushforward函子，给出了可构集上特征函数的卷积乘法，并构造了三角范畴八面体公理的内蕴对称性的几何模型，最终证明了对于不可分解支撑有界可构集的特征函数，乘法满足李代数定义的Jacobi恒等式，从而给出了无限维李代数的实现。

Weak bialgebras and Hopf algebras are generalizations of ordinary bial-gebras and Hopf algebras in the following sense: the defining axioms are the same, but the multiplicativity of the counit and comultiplicativity of the unit, are replaced by weaker axioms.

中文摘要：弱双代数和弱Hopf代数是通常的双代数和Hopf代数的推广：定义的公理不变，但是余单位的乘法和单位的余乘法变得更弱一些了。本文主要将上环理论及其Galois理论运用于弱Hopf代数，得到弱Hopf代数的相应结果。

In the process of elliptic curve digital signature verification, the elliptic curve scalar multiplication and the elliptic point addition, which are under different coordinates, need to be calculated twice and once, respectively. With operands allocation, the two operations in the thesis are using the shared registers and arithmetic units as well as the same modular inverse process. No extra resource is needed for the introduction of point addition. Hence the resource utilization efficiency is optimized.

论文对这两种不同坐标系下的计算进行了寄存器和运算单元的统一调度，使它们的求逆运算共用同样的流程，减小了控制状态机的复杂度，并且在实现标量乘法的基础上，没有增加额外的运算单元或寄存器，点加运算的所有计算资源均和标量乘法公用，最大限度的提高了资源利用率。

The method this paper discussed was based following theoretic analysis: Square and multiplication of large integer are two basic operations in modular exponential m_ary algorithm. The main operations of m_ary algorithm of point multiplication in elliptic curve encryption were doublings and point addition. The steps of m_ary algorithm in point multiplication was similar to modular exponential.

其基于以下理论分析：模幂m_ary算法的基本运算为大数乘法，其中包括大数平方算法和一般大数乘法；椭圆曲线加密算法中点乘的m_ary算法步骤与模幂的m_ary算法相同，后者的基本运算为倍乘和加法。

The basic principle of least-squares method is to choose the model parameters minimizing model error sum of squares, thus the name "least squares method."

最小二乘法的基本原理是选择模型参数极小化模型误差平方和，因此而得名"最小二乘法"。

Based on a new modified Wallace multiplier structure, named bi-forked Wallace multiplier structure, this paper presents the design of a highly re-configurable Multiplier for VLIW multimedia-processor. We found a reusable design method to extend multiplier with full adder array. The Structure can enable 32/16/8 bit operands, and has been optimized for speed and area.

在VLIW多媒体芯片的设计过程中，针对传统乘法器与加法器的不足，提出了一种新的分叉华莱氏树结构的乘法器模型，采用可重用的模块化设计思想，通过重用一位全加器阵列对乘法器进行扩展，处理器可以在一个乘法器单元内部同时支持多个32/16/8位的乘法运算，同时使乘法单元的速度和面积均得以优化。

But because it don't consider geometric meaning that the over-determined equation set is represent for,the precision of point object measured is low.

针对空间点目标的三维重构，传统的方法是采用最小二乘法进行的，但是由于最小二乘法没有考虑所建立的超定方程组所代表的几何意义，所以计算出的点坐标精度不高。

Neither the killing of Mr Zarqawi nor any breakthrough on the political front will stop the insurgency and the fratricidal murders in their tracks.

在对危险的南部地区访问时，他斥责什叶派民兵领导人对中央集权的挑衅行为。

In fact,I've got him on the satellite mobile right now.

实际上 我们已接通卫星可视电话了