adjacent [ə'dʒeisənt]

adjacent的基本解释

adj.

邻近的, 毗连的, 接近的

• The two families live on adjacent streets.
• 这两家住在两条相邻的街上。

adjacent的同义词

adj. near · neighboring · next to · adjoining

与adjacent相关的网络例句 [注：此内容来源于网络，仅供参考]

According to the space distance between the metro structure and adjacent buildings, the degree of surface settlement and tilt of adjacent buildings caused by the construction of metro tunnel excavation, we divide the degree of adjacent buildings affected by a single metro tunnel construction into four adjacent grades, that is very nearby, quite adjacent, adjacent and nonadjacent, and give the criteria for the classification and the calculation method of the settlement and tilt of building close to metro.

依据地铁结构与邻近建筑物间的空间距离、地铁隧道暗挖施工引起地表沉降和邻近建筑物倾斜的程度，将受单个地铁隧道施工影响的邻近建筑物的邻近程度划分为很邻近、邻近、较邻近和不邻近4个邻近等级，并给出划分标准以及邻近地铁建筑物沉降及倾斜的计算方法。

Multiple trials is the basic concept of many parallel simulated annealing. It is to perform multiple trials at the same time to search acceptable solutions. The division simulated annealing with no communication and The clustering simulated annealing are two common types of parallel simulated annealing methods. The division simulated annealing with no communication makes each processor generate its own adjacent solution from its own current solution and compute the acceptance probability for a adjacent solution. Each of the processors searches solutions without communicating each other. Clustering simulated annealing makes each processor generate its own adjacent solution from a common current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should be used to replace current solution according to a pre-specified rule.

许多平行模拟退火法之理论依据为多向试验，利用同一时间探索更多方向的试验来拓展搜寻的广度或深度，不进行沟通的分工模拟退火法(the division simulated annealing with no communication)以及丛集模拟退火法(the clustering simulated annealing)皆为平行化的模拟退火法，前者定义为各个处理器针对各自的起始解进行搜寻，产生各自的搜寻序列，在搜寻过程中处理器不进行任何沟通，各处理器仅针对自身之目前解进行搜寻；而后者定义为让所有处理器针对同一目前解进行运算搜寻各自的可能解，并各自决定其产出解之接受机率，最后根据事先决定之规则进行沟通比较，挑选其中一个可接受解取代目前解。

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

与adjacent相关的网络解释 [注：此内容来源于网络，仅供参考]

Adjacent：相邻

图中可以只有点,而没有边;而有边必有点若节点vi, vj 之间有一条边 eij,则称 vi, vj 是 eij 的端点(end vertex),而 eij 是节点 vi, vj 的关联边(incident edge)同一条边的两个端点称为相邻(adjacent)节点,具有共同端点的边称为相邻边一条边的两个端点相同,

Adjacent：相邻的

保证一般都会以书面并以契约形式订立,称为Deed二元组称为图(graph).为结点(node)或顶点(vertex)集.为中结点之间的边的集合.点对称为边(edge)或称弧(arc),其中,称是相邻的(adjacent),称u,v与边相关

Adjacent：毗邻的

注意,紧靠的(abutting)物业永远是毗邻的,而毗邻的(adjacent)物业可能不一定紧靠着. ...

Adjacent：接

与快速交换缓存机制不同,FIB中无出接口以及相应的2层封装信息. 为此,CEF维护了一张邻接表,其中,任何无法通过单条2层连接进行联系的节点都被称为邻接(adjacent)节点. 邻接关系建立在2层之上,并被链接到FIB中的条目,

Adjacent：abbr. adj; 邻近的