查询词典 fast

This paper NCP1207 (switching power supply chips PWM control)+ S3F9454 (charger chip integrated management control of) the principle of the Ni-cd, Ni-MH battery charger for the working principle of the system design and analysis, intelligent fast Ni-cd, Ni-MH battery charger of the design process, and in the mature Ni-cd, Ni-MH battery charger on the basis succeeded in achieving effective in preventing Ni-cd, Ni-MH battery charge in the case of fast The charge-off phenomenon.

本文结合NCP1207(开关电源PWM控制芯片)+ S3F9454(充电器集成控制管理芯片)的原理对Ni-cd、Ni-MH电池充电器的工作原理进行了系统的开发设计及分析，实现快速智能Ni-cd、Ni-MH电池充电器的设计过程，并在成熟Ni-cd、Ni-MH电池充电器基础上，成功地实现了有效地防止Ni-cd、Ni-MH电池在快充情况下的过充现象。

Fast food in America may be cheep, but it is not cheep in China .3.That have better not eat much fast food,becausefast food is not good for health.

筷子和中国的饮食文化有很大的联系，许多外国人认为筷子是中国饮食文化的一种特色。

The 3G network of Verizon also really very fast, compare with the G1 on the side, g1 is chelonian fast ~~~ interface exceeds big, be clear at a glance of App detailed list.?

Verizon 的 3G 网络也确实很快，和旁边的 G1 一比， G1 是龟速~~~界面超大， app 清单一目了然。？

Last night 19 when make, the reporter logins ceaselessly " mountain fastness spring is late " official website, discover a net fast like chelonian fast, click video address, the webpage shows however cannot join.

昨晚19时许，记者不断登录"山寨春晚"官方网站，发现网速如龟速，点击视频地址，网页却显示无法连接。

This cartography car passes through 360 degrees of cinematograph and roof thunder to shoot sensor, get viatic information can fast and businesslikely, include driveway number, fast be restricted and other data, tele Atlas but thereby obtains place to want information with updating a map regularly.

该制图车透过360度摄影机以及车顶雷射传感器，能迅速而有效率地获取路线的信息，包括车道数目、速限以及其它资料，Tele Atlas可藉此获得所需信息以按期更新地图。

A fast algorithm for calculating the inverse and Moore-Penrose inverse of the permutation factor circulant matrix is presented. Then, a fast algorithm for the product of the permutation factor circulant matrix is given. Finally, The least-square solutions of inverse problems and the optimal approximation problems for the permutation factor circulant matrix are discussed.

首先给出了一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法，然后给出了计算两n阶置换因子循环矩阵之乘积阵的一种快速算法，最后给出了其反问题的最小二乘解的存在性定理及它的一般表示，并证明了逼近矩阵的存在唯一性且给出它的具体表达式。

When scaled factor circulant matrices are nonsingular, we can find the single solution of the scaled factor circulant matrix equation; When scaled factor circulant matrices are singular, we can find the special as well as the general solution of the scaled factor circulant matrix equation; There is only an error of approximation when the fast algorithm is implemented on computers, and only the elements in the first row of the scaled factor circulant matrix and the constants in the diagonal matrix are needed by the fast algorithm.

当鳞状因子循环矩阵非奇异时，该快速算法求出线性方程组的唯一解；当鳞状因子循环矩阵奇异时，该快速算法求出线性方程组的特解与通解。该快速算法仅用到鳞状因子循环矩阵的第一行元素及对角矩阵中的对角上的常数进行计算。在计算机上实现时只有舍入误差。

In Chapter three, by constructing a special partitioned matrix and studying the fast triangular factorization of its inverse matrix, we respectively give fast algorithms for the minimal norm least squares solutions of linear equations which coefficient matrices are n×m Toeplitz type matrices and Vandermonde-Loewner type matrices with full column rank.

第三章通过构造特殊分块矩阵并研究其逆矩阵的快速三角分解，分别给出了求以秩为m的n×m阶Toeplitz型矩阵和Vandermonde-Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法，并通过算例将新算法与已有的法方程组的方法和正交化方法作了比较。

Fast algorithm of minimal norm least square solution for Cauchy linear system;2. For the m×n Cauchy-type matrix with full column rank,the fast algorithm of the minimal norm least square solution to the linear system Cx=b was obtained by construction of a special block matrix and study of the triangular decomposition.

对于秩为n的m×n阶Cauchy型矩阵C，通过构造特殊分块矩阵并研究其三角分解，进而得到了线性方程组C x=b的极小范数最小二乘解的快速算法，所需运算量为O+O(n2)，而通常构造法方程组的方法所需运算量为O(m n2)+O(n3)，用正交化法虽然避免了构造法方程组，但所需的运算量更大些。

Utilizing the complex multiplication property of the curves and using a modulo reduction and Frobenius expansion technique, Bring forward that there is a fast point multiplication method without precomputation on the curves, which is 6 times fast than the ordinary repeated-double-add method.

针对一类特征3的Koblitz椭圆曲线的点乘算法，利用这类曲线的复乘性质，使用模约减和Frobenius展开技巧，提出一种不带预计算的快速点乘算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。