这个向量的所有分量就是这些偏导。
它只简单地打印argv向量的内容。
向量的类型取决于所提升的值的类型。
这是平面法向量,和沿直线向量的点积。
It's the dot product between the normal vector of a plane and the vector along the line.
故我们是把位置向量,分解为简单向量的和。
So, we want to decompose the position vector into a sum of simpler vectors.
为了求出高度,需要知道这向量的垂直分量是多少。
And to find the height of this thing, I need to know what actually the normal component of this vector is.
我们还学过加速度,也就是速度向量的导数。
And, we've also learned about acceleration, which is the derivative of velocity.
使用MPI进行并行编程来实现矩阵与向量的乘法。
Parallel programming using MPI to multiply a matrix by a vector.
为了找到带法向量的面元,我就取这两个的叉积。
To find the surface element together with a normal vector, I would just take the cross-product between these guys.
举例来说,spu_insert不会修改向量的内容。
For instance, spu_insert does not modify the contents of the vector.
看到了吧,系数变为0了,当直线垂直于法向量的时候。
So, see, this coefficient becomes zero exactly when the line is perpendicular to the normal vector.
这个值可以为负,从而在Face对象的法向量的反方向上挤压。
This value can be negative to extrude in the direction opposite the Face object's normal vector.
我们要做的是,沿着曲线的每一点上,取向量场和法向量的点积。
What we will do is just, at every point along the curve, the dot product between the vector field and the normal vector.
这门课我们首先学习的概念是向量,以及怎样做向量的内积。
So, the first things that we learned about in this class were vectors, and how to do dot-product of vectors.
结合基于LLR的ngram生成算法并行处理文本文档到向量的转换
Parallel text document to vector conversion using LLR based ngram generation
然而,问题是向量处理会假设每条指令都可以适用于向量的所有元素。
However, the problem is that vector processing assumes that each and every instruction will be applied to all elements of the vector.
矩阵迭代法是求矩阵的第一阶特征值与特征向量的一种数值方法。
Matrix iteration method can be employed to figure out the first eigenvalue and eigenvector of a matrix.
函数matrix 、array和dim是用于设置向量的维的简单函数。
The functions matrix , array , and dim are simply convenience functions for setting the dimensions of a vector.
本文中的代码实际上是非向量的(即标量)代码,这意味着一次只处理一个值。
The code in this article is actually non-vector (also known as scalar) code, meaning that it only works with one value at a time.
它们是同一个向量,通常我们都选原点作为向量的起点,但是我们不一定要这么做。
It's the same vector So, a lot of vectors we'll draw starting at the origin but we don't have to.
但我认为这还是一个很有意思的例子,解释为什么我们要掌握向量的方法去分析运动。
But, still I think it's a very interesting example of why you might want to use vector methods to analyze motions.
然而,并非所有指令都可以支持所有的向量类型——这取决于汇编语言指令处理向量的能力。
However, not all vector types are supported by all instructions — it is based on the availability of assembly language instructions to handle it.
这是约定的得到单位法向量的方法,这种做法使得,当沿着曲线行进时,法向量始终指向右手方向。
That is our convention to get a unit normal vector that points to the right of the curve as we move along the curve.
也就是说,如果朝该方向运动,函数值变动得最剧烈,那么相应的斜率就是梯度向量的模长。
OK, so if I go in that direction, which gives me the fastest increase, then the corresponding slope will be the length of the gradient.
所以今天我们的新定义,就是梯度向量,目的就是更好的理解这一定义,这个向量的含义是什么?
OK, so the new definition for today is the definition of the gradient vector. And, our goal will be to understand a bit better what does this vector mean?
在Lucene 2.3中对拥有存储字段和Term向量的文档进行了大量的优化,以节省大索引合并的时间。
In Lucene 2.3 there are substantial optimizations for Documents that use stored fields and term vectors, to save merging of these very large index files.
可以通过扩展测试工具支持更复杂的检查—例如,判断两个列表的内容是否相同,或者某一条件对于向量的所有元素是否都是有效的。
You can augment the test tools to support more complicated checks-say, to determine whether the contents of two lists are the same or whether a certain condition is valid on all elements of a vector.
向量处理器系统的性能很高,在20世纪80年代到90年代早期一度在HPC体系架构中占有统治地位,但是最近几年以来,集群变得更加流行了。
Vector processor systems deliver high performance and were the dominant HPC architecture in the 1980s and early 1990s, but clusters have become far more popular in recent years.
向量处理器系统的性能很高,在20世纪80年代到90年代早期一度在HPC体系架构中占有统治地位,但是最近几年以来,集群变得更加流行了。
Vector processor systems deliver high performance and were the dominant HPC architecture in the 1980s and early 1990s, but clusters have become far more popular in recent years.
应用推荐