查询词典 shortest path problem

By the detail discussion onthe hardware of the smooth path control system of single-chip microcomputer developed and the system software including new type continuous smooth path software, the analyzing of international standard program languageISO andthe attempt to developmental application in the smooth path control systemand experiment have been done, the description of the smooth path of the non-circular curive such as ellipse, hyperbola, parabola and their realignment has been realized by the way directly to input their parameters. The correctnesson the priciple and the method of the continuous smooth path control and the forthright on programing method hayed been proved by the experiment, new way to realize higher accracy continuous smooth path control has been developed.

通过对所研制成功的单片微机平滑轨迹控制系统硬件和包括新型的连续平滑轨迹生成软件在内的系统软件的详细描述，进行了国际通用标准编程语言△ISO标准编码的分析和在平猾轨迹控制系统中扩展应用的尝试和实验，实现了椭圆、抛物线、双曲线等非圆曲线及其组合的直接参数输入的平滑轨迹轮廓描述，并通过实验证明了连续平滑轨迹控制原理及方法的正确性和程序编制的简捷性，为实现高精度连续平滑轨迹控制开辟了一条新的途径。

Based on the path-state query technology, the target path-state is prejudged if the target path state fulfills the switching condition before the path-switching is executed; thereby, the success rate of path-switching is improved and the possibility that the path-switching has the influence on the storage performance of the system is reduced.

通过本发明实施例，可以在真正执行倒换前，预先判断是否满足倒换条件，从而提高路径倒换成功率，并降低路径倒换对系统存储性能产生影响的可能性。

Considering the particularity of the road network and the demand of the shortest path algorithm for the road network information, a new method of representation and storage of the road network to enhance the real-timeness of the shortest path algorithm was proposed based on the basic idea of the dual graph representation to improve the forward star structure.

考虑实际道路网络的特殊性以及最短路径算法对路网信息的要求，运用对偶图法的基本思想对前向关联边结构进行了改进，提出了一种能够提高路径优化算法实时性的路网表达方法与数据存储结构，并用Dijkstra和A*最短路径算法进行了验证。

Secondly, geodesic Gaussian basis functions are defined on the graph. A shortest path obtained by a shortest path faster algorithm is used to approximate a geodesic distance.

其次，在图上定义测地高斯基函数，并用基于最短路径快速算法得到的最短路径来逼近测地线距离。

Open Shortest Path First is a routing protocol developed for Internet Protocol networks by the Interior Gateway Protocol working group of the Internet Engineering Task Force. The working group was formed in 1988 to design an IGP based on the Shortest Path First algorithm for use in the Internet.

最短路径优先是Internet 任务工程组的一个工作组为IP网络开发的一个内部网关路由选择协议，该工作小组成立于1988年并致力于为INTERNET应用设计一个基于最短路径优先算法的内部网关路由协议。

This article studies based on the shortest path city public transportation intelligence inquiry system, first aims at the city public transportation line network chart establishment mathematical model; Then research based on above mathematical model database creation method and corresponding algorithm design, with take Dijkstra algorithm as foundation, based on path shortest public transportation line inquiry algorithm, and through simple analog data confirmation algorithm validity; Finally brief introduction according to this thought design realization city public transportation intelligence inquiry system.

研究基于最短道路的城市公交智能查询系统，首先针对城市公交线路网络图建立数学模型；然后研究基于上述数学模型的数据库建立方法和相应的算法设计，和以Dijkstra算法为基础的、基于道路最短的公交线路查询算法，并通过简单模拟数据验证算法的有效性；最后简要介绍按此思想设计实现的城市公交智能查询系统。

The first is to choose any one of the impossible shortest path but it doesn't eliminate any of the impossible shortest path by passed top clusters to unpassed top cluster.The second is tha...

而Dijkstra原始算法仅在可能存在的多条最短路径中任选其中一条即可；2、Dijkstra算法的每一步骤，不仅要求路径最短，同时还要求经过的顶点最少，从而求出被原始算法忽略的所有可能存在的最短路径；结果最终可以求出带权图中一起始点到其余顶点的所有最段路径。

Consequently the NN adaptive unit is added into the control loop according to the NN on-line approximate property. Lastly the chapter combines the proposed shortest path-planning method and the adaptive tracking method in order to stabilize the NWMR about a posture through the shortest path. Many simulations are carried out on MATLAB and the simulation results are very feasible and reasonable. Chapter 5 proposes a new localization method for the WMR running on inclined planes based on fusion of clinometric and an odometric data by Kalman filter.

本文首先求得了在斜面上运行的NWMR动力学系统的状态方程；接着选择了适当形式的系统输出方程，采用非线性系统解耦方法对该系统实现了输入—输出线性化，并应用线性系统方法进行镇定；然后提出了基于人工神经网在线逼进NWMR动力学特性的自适应跟踪控制方法；最后将本文最短距离路径规划方法与跟踪控制方法相结合实现了NWMR系统状态镇定，并通过仿真实验证明了该方法的有效性。

B Mine the core of consortium based on the Six Degrees of Separation and describe Shortest Path based on LINk wEight algorithm SPLINE（Shortest Path based on LINk wEight）.

b 基于六度分割和最短路径社团核心成员挖掘，讨论了计算节点间的最短路径，根据六度分割定理的剪枝，基于SPLINE算法和中心度挖掘犯罪子团伙中的核心的技术。

This implies the existence of a polynomially bounded algorithm to find a shortest contractible cycle, a shortest separating cycle, and shortest cycle in an embedded graph in the projective plane and answers the open problems raised by Mohar and Thomassen in the case of projective plane embedded graph.

另一方面，通过定义嵌入图的几何对偶图及其相应的嵌入系统，得到几何对偶图中的可分离圈就对应于原图中的割；反之，若几何对偶图中的割在原图中对应于一个圈，那么该圈一定可分离。

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难，表现为纤维组织坚韧，游离肺动脉非常困难；徒手无法松解左、右纤维三角，肺动脉和主动脉根部的游离非常困难；心肌纤维坚硬、质脆，解剖时容易断离成碎块，无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。