scalar valued function

scalar valued function的基本解释

-

纯量值函数

与scalar valued function相关的网络例句 [注：此内容来源于网络，仅供参考]

Firstly, some basic concepts about ECC are introduced;then the scalar multiplication under affine coordinate is discussed, we make a research and analysis of the side channel attack of scalar multiplication used in portable device, give out a new scalar multiplication algorithm which has the advantage of efficiency over other protected algorithm; and an improvement of the standard scalar multiplication algorithm proposed by IEEE1363 is made with the efficiency increasing by about 10%; at last, we deal with the using of complex multiplication in scalar multiplication algorithm, we generalize the methods and deduce a complete computing procedure, with proposing a new method which used several different fast endomorphism ,we give out an approach to boost the scalar multiplication with fast endomorphism.

本文首先介绍了椭圆曲线密码的有关基本概念；其次介绍了椭圆曲线上点的标量乘法在仿射坐标下的计算，对一般便携设备上的椭圆曲线点的标量乘法的边信道攻击做了研究与分析，给出了一种在效率上优于其它可抵抗边信道攻击的标量乘法的新算法，并对IEEE P1363 标准给出的标量乘法做了改进，使得标量乘法的运算效率提高了近10%；最后介绍了利用复乘计算标量乘法的方法，对已有的方法进行总结归纳，得出完整的计算过程，并针对两类超奇异椭圆曲线给出了一种利用多个可快速计算的复乘的标量乘法，得出一类普遍的结果，并给出了进一步用复乘加快标量乘法的思路。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

Because 3-valued logic has a truth more than 2-valued logic, the quantity of truth of function of 3-valued logic is more than it of 2-valued logic, and 3-valued logic has a more powerful ability to handle problems than 2-valued logic does.

由于三值逻辑比二值逻辑多一个真值，所以三值逻辑的真值函项的数量比二值逻辑的真值函项的数量大得多，所以三值逻辑才会比二值逻辑有更强的处理问题的能力。

与scalar valued function相关的网络解释 [注：此内容来源于网络，仅供参考]

scalar valued function：纯量值函数

scalar triple product 纯量三重积 | scalar valued function 纯量值函数 | scalar valued map 纯量值映射