查询词典 graph coloring

A linear mapping between two Banach spaces and is continuous if and only if its graph is a closed subset of.

巴拿赫空间之间的线性映射是连续的，当且仅当这个映射的图像是闭集合。

If the graph is not closed, it is caused by close compensation value in software.

电机丢步造成。（6）字形不失真但不封口，是软件闭合补偿过小所致。

Outline information ; closed graph information ; processing of graphics

轮廓信息；封闭图形信息；图形处理

Some characterizations and properties of these correspondences and their closed graph are obtained,applications of subsets nets in lower semicontinuous correspondence are given.

1，得到了这些对应和它们的闭图的若干特征和性质，给出了子集网在下半连续对应中的应

A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices.

图中经过三个以上顶点且经过每个顶点仅一次的一条封闭路径。

Simulation results showed that the algorithm is available to search precisely and efficiently all of the minimum independent closed loops in a graph at high running speed with small memory space occupied.

实验表明，该算法可以准确高效地搜索出图中所有的最小独立闭合环，算法的运行速度快，占用的空间小，完全可以满足实时性和内存空间的需求。

This method firstly determines whether a closed loop exists in the graph, and utilizes DOF reduction analysis and disturbing method to identify if the closed-loop constraints can be broken from a certain edge.

该方法能够较好的简化CAD软件中用户添加的装配约束，避免了因闭环约束造成的求解复杂度增加的情况，同时可以更好的表达实际装配的过程。

This paper,representing the mathematical restrictions equation on modified gear in the form that is convenient to plot the curves,the electronic closed graph has been completed in VC++ which is an object-oriented visualization programming language.

该方法只需设计者按要求输入相关的设计参数，就能很快生成所需的封闭图，使齿轮变位的设计变得简单、快捷。

Bring forward new method based on clockwise trend to search next path of outline and method based on counter-clockwise tread to search next path of closed graph after analyzing existing algorithmic. New algorithmic improves on graphic generating efficiency and intelligence of system.

在分析已有算法的基础上，提出基于顺时针行走方向搜索外轮廓下一条路径和基于逆时针行走方向搜索封闭图形下一条路径的算法，改进了以往算法的不足，提高了图形的生成效率和系统的智能化程度。

TSP is brought forward and is transformed into shortest closed Hamilton loop of directed graph problem.Then three kind of algorithms of TSP is indroduced.

首先提出旅行商问题，并将其转化为最短有向图哈密尔顿回路问题，然后介绍了三种类型的求解TSP的算法。

For you say, My doctrine is pure, And I am clean in Your eyes.

11：4 你说，我的道理纯净，我在你眼前清洁。

The method takes make water sedimentary in patient of be in hospital of leucocyte grow in quantity 30, according to clean middle make water bacterioscopy result, distinguish the patient to affect group and blame infection group, pathology of puncture of farther travel kidney analyses blame infection form.

方法取尿沉渣中白细胞增多住院患者30例，根据清洁中段尿细菌检查结果，将患者区分为感染组和非感染组，非感染组进一步行肾穿刺病理分析。