查询词典 shortest path

The service provider performs the following steps: receiving a request from a customer to establish communication with another customer; confirming the identity of each customer; transmitting to each customer executable code enabling encrypted communication therewith; obtaining from each customer information regarding the customer's computing environment; preparing a set of applications for use by each customer, in accordance with the customer information and the customer's request; transmitting the set of applications as executable code to each customer; establishing a communication path to each customer; and specifying the communication path to the customers, thereby permitting the customers to communicate over the path using those applications.

服务提供商执行以下步骤：接收从一个客户发出的与另一个客户建立通信的请求；确认各个客户的身份；向各个客户发送能实现加密通信的可执行代码；从各个客户处获得关于客户计算环境的信息；按照客户信息和客户请求，准备一组应用程序供各客户使用；把这组应用程序作为可执行代码发送给各客户；建立与各客户的通信通道；向客户说明通信通道，从而允许客户使用那些应用程序在该通道上进行通信。

It can implement different path construction and deviation correction of the mole through applying a steering torque to the mole to change its working configuration and the orientation of the steering head slant face and make the mole advance according to the predetermined path. In this paper, Fussy Control is selected as the method of controlling the construction path of the mole and a set of detailed control strategy is established.

此外，针对气动冲击式轨迹可控穿孔机的施工特点，还专门设计了微型化和抗冲击的定位测量系统，以实现在施工过程中对穿孔机的监测，其测得的穿孔机实际运行轨迹用于和设计轨迹进行比较，作为对穿孔机施工轨迹进行控制的依据；以及由控向机构和挠性杆组成的控向系统，其作用是通过施加控向扭矩于穿孔机来改变穿孔机的工作模式及导向穿孔头斜面的朝向，从而实现不同性质轨迹施工和偏离修正，保证穿孔机尽可能按照设计轨迹进行施工。

The results of computations demonstrate that the path relinking algorithm can obtain better solutions than the standard genetic algorithm, the standard Tabu search procedure and the general path relinking algorithm, and prove that the solution update method of the reference set with diversification detection is very important to path relinking. Moreover, the decentralization mutation strategy can enhance the capacity of searching a better solution.

计算实例表明，该路径重连算法比标准遗传算法、标准Tabu搜索算法以及普通路径重连算法能够获得更好的解，证明了多样性检测对参考解集更新的关键作用以及分散性解变异策略在提高解的质量上的能力。

Three intersection functions,such as adjacent node set,node-arc angle set and connected node set,were presented,and based on the shortest path method proposed by Dijkstra,a road guide sign model was built by using the intersection functions.

结合路网的拓扑结构，定义了用于确定指路标志的状态函数集，给出了3个描述路网拓扑特征的交叉口函数：邻近结点集、结点-弧段夹角集和连通结点集，基于Dijkstra最短路径的思想，运用交叉口函数建立了城镇指路标志的标识模型：以待标识城镇为中心，在城镇的影响区域内，通过向外搜索交叉口邻近结点集来确定指路标志的设置，并使每个结点上标识的路径都是最优的。

For the question of material transportation in emergency situation ,the paper gives an arithmetic operators,which changes the interval number order into real number order,and gives the arithmetic of interval number shortest path.

针对紧急状态下物资调配时间为区间数问题，在经典的Dijkstra算法基础上，通过定义一个算子，把区间数序关系转换成实数序关系，对区间数进行排序，给出了区间数的最短路算法。

In the paper, it is studied about the shortest path search in real-life situation in autonomous vehicle navigation system.

在自主车辆导航系统中如何实现符合现实状况的大范围的最短路径查询，是本文的研究问题。

Firstly, a spherical mesh with regular subdivision connectivity is constructed to partition the spherical domain into some small regions. Then the region, which contains the query point p, is found according to the position of p and selected as the search area for locating p. During the point location, the barycentric coordinates are used to extract local heuristic information about the location of p so as to find the shortest path from the start triangle to the target one containing p.

通过构造规则子分网格将原始球面网格区域划分成若干具有子分层次关系的查询小块；在进行查询前，根据查询点p的位置找到它所在的小块作为搜索区域，从而极大地缩小了查询范围；在查询过程中，根据重心坐标所包含的启发信息，选择一条从初始搜索三角形到目标三角形的最短查询路径。

This is an example that use the shortest arithmetic to implement the schoolyard cicerone map,it can find the best path!

一个用最短距离法来实现的校园导游算法，可以找出最合适的路经来！

The shortest path between two truths in the real domain passes through the complex domain.

（在实数域中，连接两个真理的最短的路径是通过复数域。

DMCA constructed a MCDS for Ad hoc networks based on a maximal independent set. In DMCA, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

DMCA基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。