查询词典 graph method

Tympanum of acoustical immittance examination presses tympanic plan: 5Ear is " B " model graph, 1 ear is " C " model tympanic graph. 1 · entire case all is in 2 treatment method the lens inside bazoo of road of caliber of the classics below spile of canal of tone of general anesthesia classics uses electric planing machine to cut below monitoring system implement resection of form of travel gland shape.

声导抗检查鼓室压鼓室图：5耳为"B"型图，1耳为"C"型鼓室图。1·2治疗方法全部病例均在全身麻醉经口气管插管下经口径路鼻内镜监视系统下使用电动刨削器行腺样体切除术。

Detail are introduced as following: transfering the LS equation to difference equation, setting the initial conditions for different shape explosive at different initiation way (point, line, plane, divergent or convergent); the dealing method of different edge conditions; how to draw the curve graph in two dimensional space or surface graph in three dimensional space with the calculated data.

本文提出了在三维直角坐标系中爆轰波传播LS方程离散化方法，建立了相应的差分方程，研究了对不同形状炸药在多种起爆形式（点、线、面、散心、聚心）下初值条件的设定，以及各种边界条件的处理方法。

With this method, the reliability to direct the constraint graph is increased, the computation complexity is reduced, and the cyclic constraint graph can be solved expediently.

应用此方法，可提高约束图有向化的可靠性、降低计算复杂度，且能方便地求解带有循环约束的约束图。

The theory and algorithm of 3D graph display and reconstruction is studied, including the synchronous contour matching algorithm, MC method, projection-based method, Delaunay triangulation, shortest diagonal method and maximum volume method. And the method of extraction of the color edge of 3D color data is proposed.

分别以同步轮廓线前进法、MC法、基于投影法、Delaunay三角法、最短对角线法、最大体积法研究三维图形显示、重建的理论和算法，提出三维彩色数据颜色边界提取方法。

In order to develop a new method for creating such an object normal form, the meaning of a vertex of the directed graph is extended, such that it is not only a simple vertex, but also a directed graph.

为了研究新的对象范式生成方法，对有向图顶点的含义进行了扩充，使其不仅可以是一个简单的顶点，还可以是一个有向图。

This paper introduces basic concepts, representation methods and practiCal applications of computer internal division graph and external divistion graph, and presents a linear mapping method of representing internal divisio.

计算机内插图形和外插图形是计算机图形学中由图形生成图形的两种基本方法，用该方法可以生成许多有趣的图形、图案，在计算机动画模拟图案设计中有着广泛的应用。

This paper briefly introduces the graph theory, expounds the inter na l relations between the graph theory and the technical dimension chain , and desc ribes the method of resolving technical dimension chain by using graph theory th rough actual examples.

简要地介绍了图论理论，阐述了图论与工艺尺寸链的内在联系，并通过示例具体介绍了应用图论求解工艺尺寸链的方法。

In this paper a hierarchical optimized memory method, which combines the SAS scheduling sequence with Non-SAS scheduling sequence, is proposed to solve the optimized memory problem. In the method, data dense sub graph and strongly connected sub graph are defined for data dense structures and loops, and by the principle of consuming tokens first, a Non-SAS heuristic algorithm is designed for optimized memory of these sub graphs.

文中提出了将SAS和Non-SAS类型调度算法相结合的层次化的存储优化方法，定义了数据密集分量和强连通分量来描述环和数据密集处理结构，并依据数据优先消耗原则设计了启发式的Non-SAS调度算法对分量进行存储优化。

By analyzing the current method for adjusting capacity graph , this paper puts forward the optimized method for adjusting the capacity graph of the plate tower.

通过对目前板式塔设计过程中负荷性能图调整方法的分析，提出板式塔负荷性能图调整的优化方法和优化过程。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务，乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐，因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。