查询词典 computing

The first International Alternative Workshop on Aggressive Computing and Security was held on October 23-25 in Laval, France.

第一个（国际研讨会攻击性替代计算和安全举行了10月23号至25号在拉瓦尔，法国。

Firstly, the connection matrices are strongly connected Boolean matrix, it is shown that the maximum length of limit cycles for FBAM is the period index of the product of the connection matrices. Thus, the maximum limit cycle is reachable. Secondly, two strongly connected components are connected by walks, it is proved that the maximum length of limit cycles for FBAM is the max. of the period index of the two strongly connected components if they are prime, otherwise, it is the least common multiple of the two period index. Finally, n strongly connected component are connected in succession, the method for computing the maximum length is described. By different patterns are presented to the networks, diminishing the number of the strongly connected components until only two components.

第一，连接权矩阵为强连通布尔矩阵，此时模糊双向联想记忆网络的最大极限环长度为连接权矩阵乘积的周期指数，从而极限环具有可达性；第二，两个强连通分支有路径连接，此时如果两个强连通分支的周期指数互素，那么网络的最大极限环长度为其最大者，否则，网络的最大极限环长度就等于二者的最小公倍数；第三，n个相邻强连通分支有路径连接，给出了计算最大极限环长度的方法，通过激发模式的变化，逐渐减少强连通分支的个数，直到只有两个分支。

For the sake of decrease of the computing time, modifying generalized moving least squares approximation is constructed under adding the residual of arbitrary high orders derivative only at the portion nodes.

为了降低计算工作量，构造了要求近似函数在全部节点处和任意阶导数在部分节点处误差的平方和最小的改进广义移动最小二乘近似。

For the sake of decrease the computing time, modifying generalized moving least squares approximation was constructed under adding the residual of high orders derivative only on the portion nodes.

为了降低计算工作量，本文构造了要求近似函数在全部节点处和任意阶导数在部分节点处误差的平方和最小的改进广义移动最小二乘近似。

And then, this paper presents an algorithm of computing the left inverse or right inverse for these special rectangle matrices. In thenormal algorithms for solving these problems, we need O(m2n) multiplications ordivisions. The algorithms in this paper only need O + O(n2) multiplications ordivisions. The paper is built as follows.

常规的计算m×n阶不相容线性方程组的极小范数最小二乘解的算法所需计算量为O(m~2n)，而本文根据特殊矩阵的特殊结构，通过两种不同的构造方式给出了两类不同的计算极小范数最小二乘解的快速算法，并给出了求特殊矩阵的左逆及右逆的快速算法，它们的计算量均为O+O(n~2)。

OpenGL takes into consideration the length of the normal vector when computing lighting.

OpenGL在计算光照的时候需要考虑归一化的法向量。

Firstly,to abtain the parameters of coupling system,such as the focal length and the position of the lens,computing the Gaussian lens formula,then establishing the rectangular coordinate system and constructing equation and tracing the marginal ray to compute the parameter of the radius of the image beam waist.

首先使用高斯光束的透镜变换公式计算透镜的焦距及放置位置等耦合系统的参数，然后建立直角坐标系并利用耦合系统的参数构建方程，对边缘光线追迹，计算出像方束腰半径值。

High Performance Computing Development and Testing The job scheduler, MPI library, Parallel File System and cluster system management

高性能计算中的作业调度，并行环境库，并行文件系统和集群管理系统的开发和测试工作

MCS51 of multi-byte fixed-point computing subroutine library, suitable for small systems for special applications, good results.

详细说明： MCS51的多字节定点运算子程序库，适合小系统特殊应用，效果不错。

The calculation result shows that the solution method has the character of high convergence precision and high stability, and the method is suit for computing big non-linear libration system model including discrete variable.

计算结果表明该方法具有较高的收敛精度、稳定性，并适合求解包含离散变量的大型非线性振动系统模型。

Hanna: That's over now, isn't it?

都结束了，对吗

You must be ill. You look so pale.

你一定是病了，你的脸色苍白。