1) minimum passenger transfer
最小换乘
1.
This paper builds an improved public traffic query system model based on the principle of minimum passenger transfer.
建立一个基于最小换乘原则的改进型公交查询系统模型。
2) reformative minimal quadratic algorithm
改进的最小换乘算法
1.
Through analyzing the existing shortest path algorithm in transic network and the 2007 national undergraduate mathematical modeling subject B and based on graphic theory, set theory , matrix theory and search arithmetic,optimal path model, traffic-time model, traffic-expenses model, a reformative minimal quadratic algorithm is proposed.
求解公交最优线路是进行公共交通系统规则的一项关键技术,通过对现有算法的分析,结合2007年全国大学生数学建模竞赛B题,利用图论、集合论、矩阵知识和迭代搜索法思想,建立了换乘次数不超过n的任意两站点间最佳路线模型、出行时间模型和出行费用模型,提出了改进的最小换乘算法,通过对题目中给定的6对起始点求出的最佳路线对新算法的有效性进行了验证。
3) least square Helmert coordinate conversion
最小二乘Helmert坐标转换
4) least transfers
最少换乘
1.
The theory of the optimum query of public transportation based on the least transfers is put forward,and the algorithm to realize it is designed.
提出了基于最少换乘的公交最优路径理论,在此基础上设计了公交最少换乘的算法。
5) least transfer
最少换乘
1.
T matrix and Q matrix are introduced to discuss the path-planning problem and the least transfer algorithm is obtained.
首先引入直达矩阵 (T矩阵 )和最小换乘矩阵 (Q矩阵 ) ,讨论公交网络节点间换乘问题 ,得出最少换乘算法 。
2.
In relation to best path in travel route, the author advances a new algorithm which has been implemented on computer and will solve least transfer in travel route.
对旅游路线中最佳路径的问题 ,提出一种新的算法 ,可解决旅游路线中的最少换乘问题 ,并已成功地在计算机上实现 。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条