查询词典 interval graph

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作为传值进程的语义表示模型，并给出了相应的强互模拟算法。

Since all elements on the primary diagonal are 1' s and the dimensions are less than 2006, the graph with A 2006 as its adjacency matrix is the transitive closure of the graph represented by A .

由于主对角线上的元素都是1，而且矩阵的阶小于2006，所以为 A 2006邻接矩阵的图就是由 A 表示的图的传递闭包。

In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.

第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。

First, the distance matrix of public transportation line is introduced, then the directed relation graph is constructed. In the directed relation graph, we can give the optimal line by revised shortest path algorithms.

首先通过引入各条公交线路直达最短距离矩阵构造了公交网络直达关系图，在直达关系图上，利用修改了的最短路算法，即可求得最优换乘路线。

The studies on the developing of new media are very important to the increasing of the area density of HDD and to the implementation of hybrid recoding technology.

光磁混合记录方法，是一种可以突破超顺磁极限的限制，并进一步提高硬盘记录密度和读写速率的一种新型超高密度信息存储方式。

In io, mTOR inhibition promotes T cell anergy under conditions that would normally induce priming.

体内研究中，在正常可激发免疫反应的条件下，抑制mTOR可促使T细胞无能。