1.ADAC Vertex SPECT (24 persons) and Infinia VC Hawkeye SPECT/CT(6 patients) with double large-field-of-view gamma cameras and equipped with two low energy high resolution collimators was used.
多数患者(24例)使用ADAC Vertex型可变角双探头SPECT仪,少数病人(6例)应用Infinia VC Hawkeye可变角双探头SPECT/CT仪。
2.Most part of this algorithm was implemented in vertex shader and pixel shader of Graphics Process Unit (GPU) by using Microsoft Direct3D and HLSL (High-Level Shader Language).
算法实现时,使用Microsoft Direct3D 9.0 SDK作为3D开发库,并用HLSL(High-Level Shader Language)将大部分绘制算法在图形处理单元(GPU)的顶点着色器(vertex shader)和片段着色器(fragment shader)上实现。
3.If some linear programming problem has optimum solution, then there must at least exist such a edge among ali edges passing through some known vertex of feasible region that the objective function value of the other vertex is more optimic than the one of the known vertex, otherwise, the known vertex is the optimum solution of the linear programming problem.
如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱——它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。
4.This paper studies the relationship between the Betti deficiency and the vertex-induced subgraph of vertex partition of graphs, and obtains an expression on the upper bounds on the mtalmum genus of a graph in terms of the vertex-induced subgraphs for vertex partition. Therefore some now results on the maximum genus of graphs are given.
本文研究了图的Betti亏数与图的顶点划分的导出子图之间的关系，得到了图的最大亏格上界由其顶点划分的导出子图所表达的关系式，由此给出了图的最大亏格的一些新结果．
5.If G is not maximal restricted edge connected, then G has a (k- 1)-factor with components isomorphic to the same vertex transitive graph of order between k and 2k-3. This observation strenghen to some extent the corresponding result obtained by Watkins, which said that fc-regular vertex transitive graph G has a factor with components isomorphic to a vertex transitive graphs if G is not k connected.
如果G不是极大限制性边连通的,那么G含有一个(k-1)-因子,它的所有分支都同构于同一个阶价于k和2k-3之间的点可迁图. 此结果在某种程度上加强了Watkins的相应命题:如果k正则点可迁图G不是k连通的,那么G有一个因子,它的每一个分支都同构于同一个点可迁图.
6.Software vertex processing provides a guaranteed set of vertex processing capabilities, including an unbounded number of lights and full support for programmable vertex shaders.
软件顶点处理提供可保证的顶点处理能力集，包括无限制的光源数量和对可编程的顶点着色器的完全支持。
7.Let G(V,E) be a graph,for a positive integer k,a maping satisfies with: (1)If and e1,e2 is adjacent or incident,then (2) For u,v,wV(G),uw,E(G),uv E(G),have then f is called a k-vertex strong total coloring of G and vertex strong total coloring of Gin called the vertex strong tota1 chromatic number of G.
对图G及正整数k，映射f：满足：（1）任意e1，e3，如果e1，e2是相邻或相关联的，则有；
8.In this article, we give out that the homomorphism between vertex algebras can uniquely induce the homomorphism between local vertex Lie algebras which are constructed from the vertex algebra.
摘要进一步讨论局部顶点李代数同态与顶点代数同态之间的关系。受到文[5]中定理6.5的启发，证明了顶点代数之间的同态可惟一地诱导出由它们构造所得的局部顶点李代数之间的同态。
9.A dominating set D of a graph G is defined as a subset of vertices in G such that each vertex not in D is adjacent to at least one vertex of D.
图的控制集定义为图中的一个点的集合，使得图中其它任何一个点与该点集中的某个点邻接。
10.With DirectX 8, different vertex components can come from different sources; for example, one vertex buffer could hold positions and normals, while a second held color values and texture coordinates.
举个例子，一个顶点缓存可能保存位置和法向而另一个保存颜色和纹理坐标。
