查询词典 circle graph

At present three-dimensional ICE rebuilds the technology has been built, the classics bosom with the tradition is supersonic and enchanted graph and classics esophagus are supersonic and enchanted graph photograph is compared, ICE does not suffer the limitative; that resembles a window not to suffer gas to affect; patient not to need complete hemp, the unwell; that can reduce patient spile reduces tracheal room to operate personnel, reduce personnel radiate; to be based on this consequently, ICE application limits is expanding gradually.

目前三维ICE重建技术已经建立，和传统的经胸超声心动图和经食管超声心动图相比，ICE不受成像窗的限制；不受气体影响；患者不需要全麻，可以减少患者插管的不适；减少导管室操作人员，因而减少人员辐射；基于此，ICE应用范围正在逐渐扩大。

We consider the average density of cooperators in the stationary state for fixed interaction graph, while varying the upper learning graph.

通过固定底层的相互作用网络而改变顶层的策略学习网络，我们主要研究了稳态下合作者的平均密度。

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调度算法对分量进行存储优化。

L The tangent problem. Given a function y = f and a point P on the graph of f , this problem asks for the equation of the line that locally shares with the graph just the point P .

切线问题：给定一个函数f和函数图形y=f上的一点P，这个问题是要求一条和y=f"局部分享恰于点P"的直线的方程式。

By the theoretical analysis and computer simulation,several characteristics of radar signal have been discussed,such as ambiguity graph,distance resolution,velocity resolution and low probability of intercept performance.The simulations show that the hybrid signal has a "thumbtack" ambiguity graph and a better performance for the distance resolution and the velocity resolution.

通过理论分析和计算机仿真，给出信号的模糊图、距离分辨力、速度分辨力以及低截获概率(LPI，Low Probability of Intercept)特性分析，结果表明该信号波形具有近似"图钉"型的模糊图和良好的距离及速度分辨力。

I say, I am a client, the requirement that I buy your program to need you to help be offerred according to me is custom-built style, help next installation is debugged, pay cost to give you, if do not have sincerity, won't make the total money of money to graph king, pursue otherwise Wang Ye won't accept us trade, after graph king gets total money only, ability affirms we trade to begin formally.

我说，我是客户，我购买你的程序需要你帮忙按照我提供的要求定制风格，然后帮忙安装调试，付费给你们，假如没有诚意，不会把钱的全款都打给图王，否则图王也不会接受你我的交易，图王只有收到全款之后才能确认我们交易正式开始。

The main research works in this article are as follows:(1) Studying and analysising special algorithms (such as Genetic Algorithms, Neuual Networks and Simulated Annealing Algorithms) based on the proper K-vertex coloring, and applied to the strong vertex-distinguishing total coloring on complete graph on complete graph, then analysises a series of questions as well as the consequences after the application .

本文的主要研究工作如下：(1)分析了基于经典算法(遗传算法、神经网络、模拟退火算法)的正常K-点染色，并把它们应用到完全图的点可区别强全染色中，分析了应用之后出现的一系列问题以及造成的后果，结果表明这些算法是不适合应用在完全图的点可区别强全染色中的。

In 2004 Zhang Zhongfu presented the concept ofadjacent vertex distinguishing total coloring whose content is: Let G be a connectedsimple graph with order at least 2, k be a positive integer and f be a mappling fromV∪E to {1,2,...,k}. Let C={f}∪{f|uv∈E,v∈V}for all u∈V. If (1) for any uv, vw∈E,u≠w, we have f≠f;(2) for any uv∈E, we have f≠f, f≠f, f≠f,then f is called a k-proper total coloring of graph G.

第三章和第四章主要研究了两种联图的邻点可区别全染色，邻点可区别全染色的定义是张忠辅在2004年提出来的，其内容为：设G是阶至少为2的简单连通图，k是正整数，f是V∪E到{1，2，…，k}的映射，对任意u∈V，记C={f}∪{f|uv∈E，v∈V}。

In order to check bisimulation for value--passing processes with infinite data domain, the symbolic transition graph and the symbolic transition graph with assignment are introduced by Hennessy and Lin as semantic models of value-passing processes, and strong bisimulation algorithms based on such graphs are also proposed.

为刻画和验证无穷值域上的传值进程，Hennessy和Lin先后提出符号迁移图和带赋值符号迁移图作为传值进程的语义表示模型，并给出了相应的强互模拟算法。

In order to check bisimulation for value-passing processes with infinite data domain,the symbolic transition graph STG and the symbolic transition graph with assignment STGA are introduced by Hennessy and Lin as semantic models of value-passing processes,and strong bisimulation algorithms based on such graphs are also proposed.

为刻画和验证无穷值域上的传值进程， Hennessy和Lin先后提出符号迁移图STG和带赋值符号迁移图STGA作为传值进程的语义表示模型，并给出了相应的强互模拟算法。

There are different types of personal loans available.

有许多不同类型的个人贷款优惠。

The above mentioned teaching model of spiral rising can be used to avoid rigidness in teaching.

上述螺旋式上升的教学模式，可以避免教学形成模式後的僵化现象。