graph造句
181. This method uses intermediate nodes' location information to create undirected graph at destination node, and uses Breath-First Search (BFS) algorithm to find another disjoint path.
182. Several sieves are applied during the course of modeling of disassembly AND/OR graph, and the estimate of sieving rate is the precondition of reasonable sieving sequence.
183. In chemistry the sum of distances is one of most frequently-used concepts in constructing molecular model by theory of graph.
184. A number of basic figure cells are chose from the graphic warehouse through the use of menu technique and scrabble up a whole of the graph of the station signal.
185. The Tektronix TDS 784 D oscilloscope is a graph - displaying device – it draws a graph of an electrical signal.
186. This paper studies the maximum genus of a graph $G $ only in term of some embedding of $G $ in an orientable surface, not of its other invariants, and gives the maximum genus of this kind of graphs.
187. Such a graph is defined to be a contact network.
188. By adapting matrix calculation method for using MATLAB drawing graph technology, 2D and 3D function graphs could be drawn, which is widely applied for science research and engineering technology.
189. In this artical, a kind of method of composition is given by which, the big arboricity critical graph is constructed from a little one.
190. Definition of Low Density Parity Check Codes, its classification, graph representation, and a decoding algorithm based on the graph structure are described.
191. Using this method can be based on signal spectral analysis method of fault diagnosis into a planar graph recognition.
192. Synchronizing impulse is the key to synchronize sound playing with light displaying of graph plate.
193. Aim It is difficulty in judging the transmission by defection and graph. But it can become more easily through matrix of relation.
194. Isoperimetric algorithm does well in image segmentation, and it is a fast graph partitioning method.
195. It first introduces its architecture, knowledge representation model and reasoning schema, and then the concept of Rule Model Graph (RMG)and an algorithm for reasoning using RMG.
196. The graph plotter is an in common use equipment to output graph, and it can conserve pattern on plot paper which make by computer.
197. The point at which branching of the graph occurs is called a bifurcation point and corresponds to a critical value of the load.
198. Mechanism for scaling planar graphs is defined as the mechanism that can enlarge or shrink a planar graph by driving a revolute pair.
199. Underneath the graph, you will have your table of keywords where you can start to extract some more meaningful information.
200. The most striking feature of this graph is the lack of agreement.
201. Secondly, geodesic Gaussian basis functions are defined on the graph. A shortest path obtained by a shortest path faster algorithm is used to approximate a geodesic distance.
202. A configuration is reducible if no minimal 5 chromatic plane graph can contain it.
203. Now that the compact function connectivity matrix is built, it's time to build its graph.
204. A graph is regular if every vertex has the same degree.
205. The assertion is known as the closed graph theorem for Hilbert spaces.
206. The client that reads my schema must be able to understand that I am describing such a linked list structure and thus must accept all possible versions of the XML that de-serialize to the same graph.
207. A graph is bipartite if it does not contain an odd cycle.
208. Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
209. This paper formulates for solving the data clustering problem as a graph partition optimal problem, and proposes a parthenogenetic algorithm based on immune mechanism.
210. And the coefficients of eigen-polynomial expressions were closely related to the circular sets of a directional graph.
12345678