...the ears of vertebrates.

The spleen of certain vertebrate animals, such as cows or pigs.

脾脏某些脊椎动物的脾脏, 如牛或猪的.

In vertebrate animals, neurons are the core components of the brain, spinal cord and peripheral nerves.

在脊椎动物中, 神经元细胞是大脑 、 脊髓和末稍神经的核心组成成分.

A novel attribute reduction algorithm of rough set based on the vertebrate immune mechanism is proposed.

基于生物免疫原理,提出了一种新型粗糙集属性约简算法.

It is also a major component of vertebrate bones and teeth.

这也是脊椎动物,骨头和牙齿主要的组成部分.

The origin of vertebrates and their ancestry are problems still obscured by too few facts.

脊椎动物的起源和它们的始祖问题,由于事实太少仍然不很清楚.

The fish is the oldest vertebrates in the planet.

鱼类是地球上最为古老的脊椎动物.

Vertices are read from the vertex data stream and are sequentially processed by the shader function.

从顶点数据流中读出顶点后,就由着色器函数来对其进行处理.

The second pair of triangles uses vertex indices 1,2 and 5, and then 2,5 and 6.

第二对三角形的顶点索引设置为1,2,5和2,5, 6.

A digital diopter measuring instrument is described for lens spherical vertex power and cylindrical axis measurement.

本文论述了一种采用旋转编码器与莫尔条纹测长相结合进行眼镜片的顶点屈光度.

All the vertex streams for a given primitive are associated with one stream bank.

所有的顶点流某一相关的原始流的银行之一.

The procedural programming model used by vertex shaders is very scalable.

就程序上的规划模型而言,顶点着色是绝对可升级的.

An application programmer must supply a tangent, binormal, and normal at each vertex.

程序员必须提供每个顶点的切线 、 副法线和法线.

Also note that ( View x Projection ) matrix is per scene, not per vertex.

请注意矩阵是个别场景, 不一个顶点.

Can I use a custom vertex shader if my hardware does not support it?

如果我硬件不支持VS, 我能使用VS 吗 ?

The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.

得到了花图的邻点可区别全色数.

The algebraic sum of the through variables associated with the edges to any vertex is zero.

关联于任一顶点的各边所附带的流通变量的代数和为零.

Step 2. Delete the single vertex at the top and bottom ends of the cylinder.

第2步. 在圆柱体顶部和底部两端删除单个顶点.

Vertex scan line number is the core concept of this algorithm.

顶点扫描线号是该算法中的核心概念.

A leading vertex is the first vertex in a sequence of three vertices.

引导顶点就是顶点序列中三个顶点的第一个.

If an appropriate vertex isn't found , the graph must have a cycle.

如果没有这样的顶点, 则图必然存在环.