检索结果-内蒙古大学图书馆

International Conference on Advanced Materials and Computer Science

作者： Zhang Qiu-yu Jiang Wen-tao Bao Guang-bin Lanzhou Univ Technol Sch Comp & Commun Lanzhou 730050 Gansu Peoples R China

ISBN: (纸本)9783037850978

For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon, in the consideration of trust relationship circumstances this paper presents an alliance certification scheme based on the lattice combining dijkstra path search algorithm between the domains. Theoretical analysis shows that dual-traction certification mechanism greatly increases system security, also avoids the single point collapse. According to calculating the path weight by dijkstra algorithm to find the shortest path in the weighted graph, the scheme can improve the certification efficiency.

关键词： cross-domain certification lattice binary tree certification path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fast Path Planning algorithm for Route Guidance System

A Fast Path Planning Algorithm for Route Guidance System

引用

IEEE International Conference on Systems, Man and Cybernetics (SMC)

作者： Selamat, Ali Zolfpour-Arokhlo, Mortaza Hashim, Siti Zaiton Selamat, Md Hafiz Univ Teknol Malaysia Fac Comp Sci & Informat Syst Utm Skudai 81310 Johor Malaysia

ISBN: (纸本)9781457706530

Path planning is applied in a variety of ways, including transportation, telecommunications, etc. Path planning to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the motoring time and to ensure and efficient use of available road resources is the main challenge in route guidance system. In this paper we propose a fast path algorithm for finding the best shortest paths in the road network. This is poised to minimize costs between the origin and destination nodes. The proposed algorithm was compared with the dijkstra algorithm in order to find the best and shortest paths using a sample of Tehran city road network. Three cases were tested through simulation using the proposed algorithm. The results show that the efficiency of proposed algorithm and could reduce the cost of vehicle routing on the path planning problems.

关键词： Route guidance system (RGS) path planning shortest path problem (SPP) dijkstra algorithm urban road network (URN)

来源：评论

学校读者我要写书评

暂无评论

A General MIMO Detection Scheme and Its Performance-Complexity Tradeoff

A General MIMO Detection Scheme and Its Performance-Complexi...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Chang, Ronald Y. Chung, Wei-Ho Acad Sinica Res Ctr Informat Technol Innovat Taipei Taiwan

ISBN: (纸本)9781424492688

A unified tree-search detection scheme based on dijkstra's algorithm is developed for MIMO systems. The proposed framework generalizes the original dijkstra's algorithm by allowing the memory usage, detection complexity, and sorting dynamic associated with the algorithm to be customized. By tuning different parameters, desired performance-complexity tradeoffs are attained and a fixed-complexity version can be produced to facilitate hardware implementation. Simulation results demonstrate that the proposed algorithm shows abilities to achieve highly favorable performance-complexity tradeoffs.

关键词： algorithm design and analysis Complexity theory dijkstra algorithm Heuristic algorithms MIMO MIMO communication MIMO systems Measurement Signal processing algorithms Sorting detection complexity general MIMO detection scheme memory usage performance-complexity tradeoff signal detection sorting dynamic tree searching unified tree-search detection

来源：评论

学校读者我要写书评

暂无评论

Bidirectional dijkstra algorithm for best-routing of Urban traffic network

Bidirectional dijkstra algorithm for best-routing of Urban t...

引用

15th International Conference on Geoinformatics

作者： Chen, Luyao Zhou, Ji Li, Jing Chen, Yunhao Beijing Normal Univ Coll Resources Sci Beijing 100875 Peoples R China Beijing Normal Univ Key Lab Environm Change & Nat Disaster Beijing 100875 Peoples R China

ISBN: (纸本)9780819469144

Best-routing is one of the effective ways to solve the problem of traffic jam in a technical way. Based on the classic dijkstra algorithm, the bidirectional search algorithm is adopted to improve algorithmic efficiency in this paper. And section resistance is also adopted in best-routing model in order to indicate not only the condition of road itself, but also the information like traffic flow, which can make the road information more general and efficient. And cross linked list is adopted to reflect topological information of road net, which ensures the weight keep minimum. The feasibility and efficiency are verified by a study case of local area in Beijing.

关键词： dijkstra algorithm bidirectional search algorithm best-routing section resistance

来源：评论

学校读者我要写书评

暂无评论

The Optimization of GIS Shortest Path Inquires Based on dijkstra

The Optimization of GIS Shortest Path Inquires Based on Dijk...

引用

2011 International Conference on Management Science and Intelligent Control(ICMSIC 2011)

作者： Cai Yi South China University of Technology SCUT Guangzhou China Zhu Juan South China University of Technology SCUT Guangzhou China

path-finding is one of the key application problems in Geographical information *** problem can be attributed to essentially the shortest path algorithm of network *** paper proposes an improved model based on dijkstra *** method covers the shortage of extremely low efficiency of dijkstra algorithm when processing mass data of the nodes and ***,according to the characteristics of geographical information system on the search optimization,this algorithm model greatly improves the searching success rate and *** testing in a real city road network example,it proved that by given origin and destination,the method in this paper can rapidly,effectively,accurately find the route,highlighted render it and display.

关键词： component Geographical information systems dijkstra algorithm The shortest path Layered acceleration

来源：评论

学校读者我要写书评

暂无评论

Research on the new route choice method of main optical cables based on dijkstra algorithm - A case study of Guanyun County

Research on the new route choice method of main optical cabl...

引用

15th International Conference on Geoinformatics

作者： Zhang, Mei Gu, Xiaoyun Chen, Zhenjie Li, Xue Su, Mo Nanjing Univ Dept Geog Informat Sci Nanjing 210093 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Sch Light & Elect Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9780819469144

Up until now, the optical cable network has covered many cities of China. However, there are still so many middle or small sized cities which are not connected to the grid backbone optical cable network of the country. It is urgent to connect these middle or small sized cities into the backbone optical cable network of the country as soon as possible. However, up until now, little work has been done to find a better way for route choice of main optical cables, including those based on GIS methods. This paper proposes a new method for route choice of main optical cables, i.e., the method for route choice of main optical cables based on dijkstra algorithm. In this paper, a model for route choice of main optical cables is built, the influencing factors are chosen and quantified according to the specific situation of Guanyun County, and the route of the main optical cables of Guanyun is chosen and drawn on the map. The result shows that the method proposed by this paper has more potentials than the traditional method used in Guanyun County.

关键词： route choice main optical cables dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A GPS Navigation System Based on the Internet of Things Platform

A GPS Navigation System Based on the Internet of Things Plat...

引用

2011 IEEE 2nd International Conference on Software Engineering and Service Science(ICSESS 2011)

作者： Hong Zhan School of electronic engineering Beijing University of Posts and Telecommunications Beijing, China Zhigang Wen,Yuxin Wu,Junwei Zou and Shan Li School of electronic engineering Beijing University of Posts and Telecommunications Beijing, China

With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account the real-time traffic information. Meanwhile, with the development of the computer technology, communication technology and geographical information technology, intelligent navigation brings more benefits to people. It can save the trave time and reduce energy consumption. On the other hand, using intelligent navigation, people can avoid roadblock, traffic jams, traffic accidents etc. Intelligent navigation can provide a safer and more reassuring environment. Combining with the Internet of Things, this paper proposes an improved routing algorithm for dynamic traffic navigation based on the Internet of Things platform. GPS will download the real- time traffic information by accessing the built Internet of Things platform, calculate the optimal path precisely, and then provide real-time and more intelligent navigation service for people.

关键词： Internet of Things dijkstra algorithm Optimal Path GPS Navigation System

来源：评论

学校读者我要写书评

暂无评论

Route Choice Options Based on Lattice Alliance Certification in Wireless Networks

Route Choice Options Based on Lattice Alliance Certification...

引用

2011 International Conference on Advanced Materials and Computer Science(ICAMCS 2011)

作者： ZHANG Qiu-yu JIANG Wen-tao BAO Guang-bin School of computer and communication Lanzhou University of Technology

For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon,in the consideration of trust relationship circumstances this paper presents an alliance certification scheme based on the lattice combining dijkstra path search algorithm between the domainsTheoretical analysis shows that dual-traction certification mechanism greatly increases system security,also avoids the single point collapseAccording to calculating the path weight by dijkstra algorithm to find the shortest path in the weighted graph,the scheme can improve the certification efficiency

关键词： cross-domain certification lattice binary tree certification path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A GPS Navigation System Based on the Internet of Things Platform

A GPS Navigation System Based on the Internet of Things Plat...

引用

2011 2nd IEEE International Conference on Software Engineering and Service Science(2011年第二届 IEEE 软件工程与服务科学国际会议 ICSESS 2011)

作者： Hong Zhan Zhigang Wen Yuxin Wu Junwei Zou Shan Li School of electronic engineering Beijing University of Posts and Telecommunications Beijing China

With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account the real-time traffic information. Meanwhile, with the development of the computer technology, communication technology and geographical information technology, intelligent navigation brings more benefits to people. It can save the travel time and reduce energy consumption. On the other hand, using intelligent navigation, people can avoid roadblock, traffic jams, traffic accidents etc. Intelligent navigation can provide a safer and more reassuring environment. Combining with the Internet of Things, this paper proposes an improved routing algorithm for dynamic traffic navigation based on the Internet of Things platform. GPS will download the realtime traffic information by accessing the built Internet of Things platform, calculate the optimal path precisely, and then provide real-time and more intelligent navigation service for people.

关键词： Internet of Things dijkstra algorithm Optimal Path GPS Navigation System

来源：评论

学校读者我要写书评

暂无评论

Research on the Optimization and Simulation of the Shortest Path Based on algorithm of dijkstra

引用

Journal of Measurement Science and Instrumentation 2010年第S1期1卷 199-201,37页

作者： Chuan-xiang REN,Xin-gang HAO,Ying-rui WANG, Guang-hui PAN (College of Information and Electrical Engineering,Shandong University of Science and Technology,Qingdao 266510,China) College of Information and Electrical Engineering Shandong University of Science and Technology

dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved dijkstra algorithm is *** apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

关键词： route optimization dijkstra algorithm fast sorting algorithm adjacency list and circular linked list

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：