Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS
|
|
- Ferdinand Greene
- 5 years ago
- Views:
Transcription
1 Key Engineering Materials Online: ISSN: , Vols , pp doi: / Trans Tech Publications, Switzerland Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS Li Rui Shenzhen Institute of Information Technology, Shenzhen , China Keywords: WebGIS; restricted direction strategy; shortest path; binary heap; Dijkstra algorithm Abstract. Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained. Introduction With the popularization of Internet, Web Geography Information System (WebGIS) is being widely applied day by day due to its powerful function. As one of the most main functions of WebGIS, network analysis plays an important role on such aspects as traffic & transportation, program on urban pipeline network and management on land resource. The most basic issue in network analysis is the Shortest Path. As the basis for selecting the optimum in many fields, the Shortest Path has an important status in traffic network analysis system. The research of it has important theoretical value and application value. At present, there are many researches involving in the algorithms of searching the Shortest Path based on WebGIS. Among these researches, the Dijkstra s algorithm is one of the algorithms that are most suitable for searching the Shortest Path between two nodes in topological network. On the basis of the algorithm thought, people deduced several dozens of different optimized algorithms. The algorithms with excellent effect include DKA (the Dijkstra s algorithm implemented with approximate buckets), TQQ (graph growth with two queues), DKD (the Dijkstra s algorithm implemented with double buckets) [1-3], etc. The optimized algorithm on the Shortest Path raised in the paper is a hotspot of research at present, network feature is restricted by restricted direction search strategy. This algorithm lays emphasis on increasing time efficiency mostly. On the basis of the adjacency list storage structure, restricted direction strategy and binary heap technology are applied to optimize Dijkstra algorithm, in addition, the optimized algorithm is simulated by test, the two indices including memory and speed all attain satisfactory effects. Optimized path of Dijkstra algorithm Optimizing storage structure by applying adjacency list. For the data in road network, if the shortest path needs to be calculated, these data must be first abstracted into some data structure as per the relation between node and side, this is called establishing the topological relation of network in GIS. Because the network topology relation is generally abstracted into graph in the field of mathematics and computer, its basis is the storage representation of graph. The comparison of several storage ways on the merits and demerits are shown in Table 1 [4]. All rights reserved. No part of contents of this paper may be reproduced or transmitted in any form or by any means without the written permission of Trans Tech Publications, (ID: , Pennsylvania State University, University Park, USA-06/03/16,07:41:17)
2 558 Advanced Design and Manufacture II Name matrix list Orthogonal list multilist Table 1 Comparison of several storage ways Realization method Merits Demerits Easily judging the relation Two-dimens Occupying large between both, easily ional array space finding vertex degree Saving space, easily Uneasily judging Linked list attaining the out-degree of the relation vertex between two points Linked list Small required space, With complex easily finding the in & out structure degree of vertex Linked list Saving space, easily With complex judging the relation structure between two points Time complexity O(n 2 + m n) or (m+n) or O( m+n) or O( m+n) According to the comparison on the above several storage structures, the algorithm applies the storage structure of adjacency list. By applying the structure, space may be saved, the out-degree of vertex may be attained, in addition, much time used for structural processing may be saved. Optimizing search scope by applying restricted direction strategy. According to Dijkstra algorithm and the characters of the road network itself, on the basis of analyzing the merits and localization of the Shortest Path algorithm in Refs. [5], [6] and [7], this paper uses restricted direction search algorithm. The core thought of the algorithm: Under the condition that the researched network may be approximately regarded as a plane network, taking the sum of the shortest path between the temporarily marked node and the source point plus the straight line distance between the temporarily marked node and the target node as one attribute value of the temporarily marked node, and this attribute value will be taken as the basis for selecting permanently marked node from the set of temporarily marked nodes, i.e. the method for selecting the temporary node with the smallest attribute value as the permanently marked node. As shown in Fig.1, R 1 and R n are temporary nodes, S 1, S n, C 1 and C n are respectively the straight line distances from the corresponding temporary nodes to source point and terminus, the linking line between R 1 and R n is D. Judgment principle of the original Dijkstra algorithm: if S 1 >S n, R n will be taken as the permanent marking node, subsequently, R n is taken as the source point for the next round of search; inversely, R 1 will be taken as the permanent marking node, and then R 1 is taken as the source point for the next round of search. Judgment method of Dijkstra search algorithm with restricted direction: if S 1 +C 1 >S n +C n, R n will be taken as the permanent marking node; if S 1 +C 1 <S n +C n, R 1 will be taken as the permanent marking node. Fig.1 The Dijkstra algorithm of restricted direction optimized strategy By comparison, it may be seen that the search scope in Dijkstra search algorithm with restricted direction is smaller than that in the original Dijkstra algorithm, because the search process of the original Dijkstra algorithm is similar to a series of concentric circles with source point as circle center; the Dijkstra search process with restricted direction is similar to a series of concentric circle
3 Key Engineering Materials Vols with source and terminus as focus. According to the principle of algorithm with restricted direction, its search process apparently tends to the terminus. Therefore, the efficiency of algorithm has been apparently increased. Optimizing priority queue by applying binary heap technology. It may be seen from the above algorithm that the core step in the process of realizing Dijkstra algorithm with restricted direction is to select a temporary node with the smallest attribute value. This is a process of cyclic comparison. In order to solve the problem, the most effective method is to conduct stack sequencing for temporary marking nodes, take the shortest path of node as the keyword of stack sequencing, so to constitute priority queue with incremental side weighted value, thus the point that meets requirements may be attained in each cycle, the performing efficiency of algorithm may be greatly increased. In this paper, binary heap technology is applied for the realization of priority queue. The method includes the following four operations:1sift(h):adjusting orderless sequence h into binary heap. 2Insert(x,h): inserting the element x into the stack h. 3Min(h): taking the element with the smallest keyword from stack, calling Sift(h) and adjusting it as a binary heap. 4Decrease(h,x,value): replacing the value of element x in the stack with smaller value. Realization of optimized algorithm According to the above thought, the realization of optimizing Dijkstra algorithm is shown as follows: Supposed that the starting point is S, the terminus is E and the binary heap is OPEN, all nodes are divided into three kinds of states, i.e. unmarked node(on), temporary node(fn) and marked node(in). Each node has several symbols: D(J), D 1 (J), D 2 (J), P(J), in which, D(J) is an approximate estimate of the optimum path P from S to E and via node J; D 1 (J) is the shortest path from S to J; D 2 (J) is an enlightenment function, i.e. the straight line distance from J to E; P(J) is the tending pointer of J, it points to the previous point of J in the shortest path from S to J. The concrete calculation step of the algorithm for finding the optimum path from S to E is shown as follows: STEP1: Initializing. The starting point S is set as follows: 1 D(S)=0, D 1 (S)=0, D 2 (S)=d se, P(S) is hollow; 2 Marking the starting point S, taking K=S, as IN state; 3 The initial binary heap OPEN is hollow. 4 All other nodes are set to ON. STEP2: Judging the states of all adjacent nodes J of K. If the state of J is ON, then D 1 (J)=D 1 (K)+d kj, D(J)=D 1 (J)+D 2 (J), P(J)=K. Marking the state of node J as FN, performing operation Insert(J,OPEN), where d kj is the straight line linking the distance from K to J; if the state of J is FN and D 1 (J)>D 1 (K)+d kj, D 1 (J)=D 1 (K)+d kj, then D(J)=D 1 (J)+D 2 (J), decrease(open,j,d 1 (K)+d kj ). For the tending pointer of node J, P(J)=K. STEP3: Selecting the next point. Taking node I with the smallest D(J) value in the stack, I =Min (OPEN), the point I is selected as one point in the shortest path and set to IN state. STEP4: If I=E, then shifting to STEP5, traversing the pointer P from E, until the starting point S, then the shortest path may be attained; or else, taking K=I, shirting to STEP2 for continuing. STEP5: End of algorithm. Test simulation analysis and result Test simulation. Recurring to the traffic road network among the main cities in Guangdong, this algorithm and the traditional Dijkstra algorithm were simulated. Different road data were put in the
4 560 Advanced Design and Manufacture II same computer to simulate and find the distance between the same starting point and terminus for many times. Table 2 shows the contrast between the operation time of two algorithm. Table 2 Running result of two algorithms Road mark Quantity of Quantity of arc Present Dijkstra(S) nodes sections algorithm(s) SMALRODE MIDRODE LONRODE Test conclusion. It may be seen from the data in Table 2 that two algorithms have similar operation time and the efficiency difference is not apparent when the quantity of nodes in the network is little. However, with the increase of quantity of nodes in the network, in theory, Dijkstra algorithm will traverse all nodes in the network, therefore, the efficiency will decrease quickly, while for the algorithm raised in the paper, due to the addition of restricted direction strategy and the optimized information of binary heap technology, the search direction will extend toward target node. In the road network figure with a lot of nodes, the quantity of search nodes may be reduced and the efficiency of search may be increased. Conclusions The algorithm on the optimization of the shortest path discussed in this paper has such merits as little memory occupation of storage structure, simple realization of algorithm and large speed, it may be effectively applied for searching the shortest path of road network structure which approximates to a plane network, it is a breakthrough in the application of the algorithm on the shortest path in WebGIS field. Of course, the realization on the function of searching the shortest path in GIS still needs further optimization according to the concrete features of different application fields. On the basis of unifying time complexity, the operational efficiency of algorithm shall be increased as far as possible, so to attain the search function module with the best comprehensive performance, satisfy the performance of system at maximum degree. This will have important actual sense. References [1] Chen Hong-ying, Yang Yi-min and Mao Ge-fei: Computer Engineering and Application Vol. 3 (2005),p [2] Zhan F B: Journal of Geographic Information and Decision Analysis Vol. 1 (1997), p [3] Yan Wei-min, Wu Wei-min: Data Structure(Tsinghua University Press, Beijing 2001). [4] Si Lian-fa, Wang Wen-jing: Bulletin of Surveying and Mapping Vol. 8 (2005), p [5] Li Cong-xin, Meng Xiang-gang and Zhang Ying: Journal of Shaanxi Institute of Technology Vol. 2 (2005), p [6] Zhu Jing: Computer and Modernization Vol. 9 (2005), p [7] Hu Shu-wei, Zhang Xiu-ru and Zhao Yang: Computer Technology and Development Vol. 16 (2006), p
5 Advanced Design and Manufacture II / Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS /
Application of GIS best path algorithm in Harbin Roads. Sui Min, *Wang Wei-fang
Application of GIS best path algorithm in Harbin Roads Sui Min, *Wang Wei-fang College of Forestry, Northeast Forestry University, Harbin, Heilongjiang 150040, China *Corresponding author. E-mail: weifangwang@126.com
More informationThe Analysis and Research of IPTV Set-top Box System. Fangyan Bai 1, Qi Sun 2
Applied Mechanics and Materials Online: 2012-12-13 ISSN: 1662-7482, Vols. 256-259, pp 2898-2901 doi:10.4028/www.scientific.net/amm.256-259.2898 2013 Trans Tech Publications, Switzerland The Analysis and
More informationThe Analysis of the Loss Rate of Information Packet of Double Queue Single Server in Bi-directional Cable TV Network
Applied Mechanics and Materials Submitted: 2014-06-18 ISSN: 1662-7482, Vol. 665, pp 674-678 Accepted: 2014-07-31 doi:10.4028/www.scientific.net/amm.665.674 Online: 2014-10-01 2014 Trans Tech Publications,
More informationResearch on Full-text Retrieval based on Lucene in Enterprise Content Management System Lixin Xu 1, a, XiaoLin Fu 2, b, Chunhua Zhang 1, c
Applied Mechanics and Materials Submitted: 2014-07-18 ISSN: 1662-7482, Vols. 644-650, pp 1950-1953 Accepted: 2014-07-21 doi:10.4028/www.scientific.net/amm.644-650.1950 Online: 2014-09-22 2014 Trans Tech
More informationDesign and Implementation of unified Identity Authentication System Based on LDAP in Digital Campus
Advanced Materials Research Online: 2014-04-09 ISSN: 1662-8985, Vols. 912-914, pp 1213-1217 doi:10.4028/www.scientific.net/amr.912-914.1213 2014 Trans Tech Publications, Switzerland Design and Implementation
More informationBijou Detouring - A Dynamic Node Level Routing Algorithm
Bijou Detouring - A Dynamic Node Level Routing Algorithm G.Reshma K.Swarupa Rani D.Leela Dharani D.Anusha Abstract This paper holds a candle light on the Dijkstra algorithm and Distance Vector routing
More informationStorage Model of Graph Based on Variable Collection
Advanced Materials Research Online: 2013-09-04 ISSN: 1662-8985, Vols. 765-767, pp 1456-1460 doi:10.4028/www.scientific.net/amr.765-767.1456 2013 Trans Tech Publications, Switzerland Storage Model of Graph
More informationThe RTP Encapsulation based on Frame Type Method for AVS Video
Applied Mechanics and Materials Online: 2012-12-27 ISSN: 1662-7482, Vols. 263-266, pp 1803-1808 doi:10.4028/www.scientific.net/amm.263-266.1803 2013 Trans Tech Publications, Switzerland The RTP Encapsulation
More informationSerial Communication Based on LabVIEW for the Development of an ECG Monitor
Advanced Materials Research Online: 2013-08-16 ISSN: 1662-8985, Vols. 734-737, pp 3003-3006 doi:10.4028/www.scientific.net/amr.734-737.3003 2013 Trans Tech Publications, Switzerland Serial Communication
More informationKeywords: truck frame, parametric modeling, cross-section.
Key Engineering Materials Online: 2011-01-20 ISSN: 1662-9795, Vols. 460-461, pp 534-539 doi:10.4028/www.scientific.net/kem.460-461.534 2011 Trans Tech Publications, Switzerland A Research and Application
More informationThe Design of Distributed File System Based on HDFS Yannan Wang 1, a, Shudong Zhang 2, b, Hui Liu 3, c
Applied Mechanics and Materials Online: 2013-09-27 ISSN: 1662-7482, Vols. 423-426, pp 2733-2736 doi:10.4028/www.scientific.net/amm.423-426.2733 2013 Trans Tech Publications, Switzerland The Design of Distributed
More informationResearch on Design and Application of Computer Database Quality Evaluation Model
Research on Design and Application of Computer Database Quality Evaluation Model Abstract Hong Li, Hui Ge Shihezi Radio and TV University, Shihezi 832000, China Computer data quality evaluation is the
More informationResearch Of Data Model In Engineering Flight Simulation Platform Based On Meta-Data Liu Jinxin 1,a, Xu Hong 1,b, Shen Weiqun 2,c
Applied Mechanics and Materials Online: 2013-06-13 ISSN: 1662-7482, Vols. 325-326, pp 1750-1753 doi:10.4028/www.scientific.net/amm.325-326.1750 2013 Trans Tech Publications, Switzerland Research Of Data
More informationAccuracy of Matching between Probe-Vehicle and GIS Map
Proceedings of the 8th International Symposium on Spatial Accuracy Assessment in Natural Resources and Environmental Sciences Shanghai, P. R. China, June 25-27, 2008, pp. 59-64 Accuracy of Matching between
More informationResearch on the Application of Digital Images Based on the Computer Graphics. Jing Li 1, Bin Hu 2
Applied Mechanics and Materials Online: 2014-05-23 ISSN: 1662-7482, Vols. 556-562, pp 4998-5002 doi:10.4028/www.scientific.net/amm.556-562.4998 2014 Trans Tech Publications, Switzerland Research on the
More informationConstruction of the Library Management System Based on Data Warehouse and OLAP Maoli Xu 1, a, Xiuying Li 2,b
Applied Mechanics and Materials Online: 2013-08-30 ISSN: 1662-7482, Vols. 380-384, pp 4796-4799 doi:10.4028/www.scientific.net/amm.380-384.4796 2013 Trans Tech Publications, Switzerland Construction of
More informationFACET SHIFT ALGORITHM BASED ON MINIMAL DISTANCE IN SIMPLIFICATION OF BUILDINGS WITH PARALLEL STRUCTURE
FACET SHIFT ALGORITHM BASED ON MINIMAL DISTANCE IN SIMPLIFICATION OF BUILDINGS WITH PARALLEL STRUCTURE GE Lei, WU Fang, QIAN Haizhong, ZHAI Renjian Institute of Surveying and Mapping Information Engineering
More informationAlgorithm Analysis Graph algorithm. Chung-Ang University, Jaesung Lee
Algorithm Analysis Graph algorithm Chung-Ang University, Jaesung Lee Basic definitions Graph = (, ) where is a set of vertices and is a set of edges Directed graph = where consists of ordered pairs
More informationApplication of Three-dimensional Visualization Technology in Real Estate Management Jian Cui 1,a, Jiju Ma 2,b, Dongling Ma 1, c and Nana Yang 3,d
Applied Mechanics and Materials Online: 2014-07-04 ISSN: 1662-7482, Vols. 580-583, pp 2765-2768 doi:10.4028/www.scientific.net/amm.580-583.2765 2014 Trans Tech Publications, Switzerland Application of
More informationSolving the Shortest Path Problem in Vehicle Navigation System by Ant Colony Algorithm
Proceedings of the 7th WSEAS Int. Conf. on Signal Processing, Computational Geometry & Artificial Vision, Athens, Greece, August 24-26, 2007 88 Solving the Shortest Path Problem in Vehicle Navigation System
More informationDevelopment of a Rapid Design System for Aerial Work Truck Subframe with UG Secondary Development Framework
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 2961 2965 Advanced in Control Engineering and Information Science Development of a Rapid Design System for Aerial Work Truck Subframe
More informationA Compatible Public Service Platform for Multi-Electronic Certification Authority
Applied Mechanics and Materials Submitted: 2014-04-26 ISSN: 1662-7482, Vol. 610, pp 579-583 Accepted: 2014-05-26 doi:10.4028/www.scientific.net/amm.610.579 Online: 2014-08-11 2014 Trans Tech Publications,
More informationResearch of 3D parametric design system of worm drive based on Pro/E. Hongbin Niu a, Xiaohua Li b
Advanced Materials Research Online: 2013-06-27 ISSN: 1662-8985, Vols. 712-715, pp 1107-1110 doi:10.4028/www.scientific.net/amr.712-715.1107 2013 Trans Tech Publications, Switzerland Research of 3D parametric
More informationStudy on 3D Geological Model of Highway Tunnels Modeling Method
Journal of Geographic Information System, 2010, 2, 6-10 doi:10.4236/jgis.2010.21002 Published Online January 2010 (http://www.scirp.org/journal/jgis) Study on 3D Geological Model of Highway Tunnels Modeling
More information3 The standard grid. N ode(0.0001,0.0004) Longitude
International Conference on Information Science and Computer Applications (ISCA 2013 Research on Map Matching Algorithm Based on Nine-rectangle Grid Li Cai1,a, Bingyu Zhu2,b 1 2 School of Software, Yunnan
More informationShortest Paths. CSE 373 Data Structures Lecture 21
Shortest Paths CSE 7 Data Structures Lecture Readings and References Reading Section 9., Section 0.. Some slides based on: CSE 6 by S. Wolfman, 000 //0 Shortest Paths - Lecture Path A path is a list of
More informationSimulation Technology of Light Effect Based on Catia and Workbench Software HongXia Hu
Applied Mechanics and Materials Online: 2014-03-24 ISSN: 1662-7482, Vols. 543-547, pp 3218-3221 doi:10.4028/www.scientific.net/amm.543-547.3218 2014 Trans Tech Publications, Switzerland Simulation Technology
More informationImprovement of SURF Feature Image Registration Algorithm Based on Cluster Analysis
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Improvement of SURF Feature Image Registration Algorithm Based on Cluster Analysis 1 Xulin LONG, 1,* Qiang CHEN, 2 Xiaoya
More informationConstructing an University Scientific Research Management Information System of NET Platform Jianhua Xie 1, a, Jian-hua Xiao 2, b
Applied Mechanics and Materials Online: 2013-12-04 ISSN: 1662-7482, Vol. 441, pp 984-988 doi:10.4028/www.scientific.net/amm.441.984 2014 Trans Tech Publications, Switzerland Constructing an University
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Research on motion tracking and detection of computer vision ABSTRACT KEYWORDS
[Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 21 BioTechnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(21), 2014 [12918-12922] Research on motion tracking and detection of computer
More informationResearch Institute of Uranium Geology,Beijing , China a
Advanced Materials Research Online: 2014-06-25 ISSN: 1662-8985, Vols. 971-973, pp 1607-1610 doi:10.4028/www.scientific.net/amr.971-973.1607 2014 Trans Tech Publications, Switzerland Discussion on Development
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 7. Binary heap, binomial heap, and Fibonacci heap Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 108 Outline
More informationStudy on One Map Organizational Model for Land Resources Data Used in Supervision and Service
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 105-109 105 Open Access Study on One Map Organizational Model for Land Resources Data Used in Supervision
More informationThe Design of Electronic Color Screen Based on Proteus Visual Designer Ting-Yu HOU 1,a, Hao LIU 2,b,*
2016 Joint International Conference on Service Science, Management and Engineering (SSME 2016) and International Conference on Information Science and Technology (IST 2016) ISBN: 978-1-60595-379-3 The
More information, ,China. Keywords: CAN BUS,Environmental Factors,Data Collection,Roll Call.
Advanced Materials Research Online: 2013-09-04 ISS: 1662-8985, Vols. 765-767, pp 1693-1696 doi:10.4028/www.scientific.net/amr.765-767.1693 2013 Trans Tech Publications, Switzerland The design of artificial
More informationA Path Planning Method for Substation Laser Inspection Robot Based on Improved Ant Colony Algorithm
2nd International Conference on Computer Engineering, Information Science & Application Techlogy (ICCIA 2017) A Path Planning Method for Substation Laser Inspection Robot Based on Improved Ant Colony Algorithm
More informationThe principle of a fulltext searching instrument and its application research Wen Ju Gao 1, a, Yue Ou Ren 2, b and Qiu Yan Li 3,c
International Conference on Education, Management, Commerce and Society (EMCS 2015) The principle of a fulltext searching instrument and its application research Wen Ju Gao 1, a, Yue Ou Ren 2, b and Qiu
More informationAn Investigation of Dijkstra and Floyd Algorithms in National City Traffic Advisory Procedures
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IJCSMC, Vol. 3, Issue.
More informationImproved DDA Algorithm and FPGA Implementation Yi-Xuan WANG a, Quan-Gang WEN b, He YIN c, Zhi-Gang HAO, Xin-Zheng DONG
2016 International Conference on Mechanics Design, Manufacturing and Automation (MDM 2016) ISBN: 978-1-60595-354-0 Improved DDA Algorithm and FPGA Implementation Yi-Xuan WANG a, Quan-Gang WEN b, He YIN
More informationApplication Research of Wavelet Fusion Algorithm in Electrical Capacitance Tomography
, pp.37-41 http://dx.doi.org/10.14257/astl.2013.31.09 Application Research of Wavelet Fusion Algorithm in Electrical Capacitance Tomography Lanying Li 1, Yun Zhang 1, 1 School of Computer Science and Technology
More informationRadar Data Processing Software System Design Based on COM Technology Zhongzhi Li
Key Engineering Materials Online: 2011-04-19 ISSN: 1662-9795, Vols. 474-476, pp 2296-2301 doi:10.4028/www.scientific.net/kem.474-476.2296 2011 Trans Tech Publications, Switzerland Radar Data Processing
More informationA method of three-dimensional subdivision of arbitrary polyhedron by. using pyramids
5th International Conference on Measurement, Instrumentation and Automation (ICMIA 2016) A method of three-dimensional subdivision of arbitrary polyhedron by using pyramids LIU Ji-bo1,a*, Wang Zhi-hong1,b,
More informationRoad Network Traffic Congestion Evaluation Simulation Model based on Complex Network Chao Luo
6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer (MMEBC 26) Road Network Traffic Congestion Evaluation Simulation Model based on Complex Network Chao Luo Department
More informationResearch Article. Three-dimensional modeling of simulation scene in campus navigation system
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2013, 5(12):103-107 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Three-dimensional modeling of simulation scene
More informationAn Extended Shortest Path Problem with Switch Cost Between Arcs
An Extended Shortest Path Problem with Switch Cost Between Arcs Xiaolong Ma, Jie Zhou Abstract Computing the shortest path in a graph is an important problem and it is very useful in various applications.
More informationThree Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures
Journal of Geographic Information and Decision Analysis, vol.1, no.1, pp. 70-82, 1997 Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures F. Benjamin Zhan Department
More informationDesign and Implementation of LED Display Screen Controller based on STM32 and FPGA Chi Zhang 1,a, Xiaoguang Wu 1,b and Chengjun Zhang 1,c
Applied Mechanics and Materials Online: 2012-12-27 ISSN: 1662-7482, Vols. 268-270, pp 1578-1582 doi:10.4028/www.scientific.net/amm.268-270.1578 2013 Trans Tech Publications, Switzerland Design and Implementation
More informationA SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS INTRODUCTION
A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS Kyoungjin Park Alper Yilmaz Photogrammetric and Computer Vision Lab Ohio State University park.764@osu.edu yilmaz.15@osu.edu ABSTRACT Depending
More informationResearch on Power Quality Monitoring and Analyzing System Based on Embedded Technology
2010 China International Conference on Electricity Distribution 1 Research on Power Quality Monitoring and Analyzing System Based on Embedded Technology Zhang Hong-tao, Ye Ying, An Qing China Zhoukou Power
More informationThe Research of Collision Detection Algorithm Based on Separating axis Theorem
The Research of Collision Detection lgorithm Based on Separating axis Theorem bstract Cheng Liang a, Xiaojian Liu School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China a
More informationModel the P2P Attack in Computer Networks
International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2015) Model the P2P Attack in Computer Networks Wei Wang * Science and Technology on Communication Information
More informationCS711008Z Algorithm Design and Analysis
CS700Z Algorithm Design and Analysis Lecture 7 Binary heap, binomial heap, and Fibonacci heap Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / Outline Introduction
More informationApproximation Method to Route Generation in Public Transportation Network
dr Jolanta Koszelew Katedra Informatyki Teoretycznej Wydział Informatyki Politechnika Białostocka Approximation Method to Route Generation in Public Transportation Network Abstract This paper presents
More informationTHE ADJACENT VEHICLES QUERY ALGORITHM OF MICROSCOPIC TRAFFIC SIMULATION
Association for Information Systems AIS Electronic Library (AISeL) PACIS 2014 Proceedings Pacific Asia Conference on Information Systems (PACIS) 2014 THE ADJACENT VEHICLES QUERY ALGORITHM OF MICROSCOPIC
More informationThe Application of Floyd Algorithm for Returning Path Algorithm with
The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load Jian Feng Luo 1,a, Yu Qiang Chen 1 1 Department of Computer Engineering, Dongguan Polytechnic,
More informationA New Evaluation Method of Node Importance in Directed Weighted Complex Networks
Journal of Systems Science and Information Aug., 2017, Vol. 5, No. 4, pp. 367 375 DOI: 10.21078/JSSI-2017-367-09 A New Evaluation Method of Node Importance in Directed Weighted Complex Networks Yu WANG
More informationA Heuristic Bidirectional Hierarchical Path Planning Algorithm Based on Hierarchical Partitioning
Send Orders for Reprints to reprints@benthamscience.ae 306 The Open Cybernetics & Systemics Journal, 2015, 9, 306-312 Open Access A Heuristic Bidirectional Hierarchical Path Planning Algorithm Based on
More informationAlgorithm Design (8) Graph Algorithms 1/2
Graph Algorithm Design (8) Graph Algorithms / Graph:, : A finite set of vertices (or nodes) : A finite set of edges (or arcs or branches) each of which connect two vertices Takashi Chikayama School of
More informationPBW 654 Applied Statistics - I Urban Operations Research. Unit 3. Network Modelling
PBW 54 Applied Statistics - I Urban Operations Research Unit 3 Network Modelling Background So far, we treated urban space as a continuum, where an entity could travel from any point to any other point
More informationA Test Sequence Generation Method Based on Dependencies and Slices Jin-peng MO *, Jun-yi LI and Jian-wen HUANG
2017 2nd International Conference on Advances in Management Engineering and Information Technology (AMEIT 2017) ISBN: 978-1-60595-457-8 A Test Sequence Generation Method Based on Dependencies and Slices
More informationShape Optimization Design of Gravity Buttress of Arch Dam Based on Asynchronous Particle Swarm Optimization Method. Lei Xu
Applied Mechanics and Materials Submitted: 2014-08-26 ISSN: 1662-7482, Vol. 662, pp 160-163 Accepted: 2014-08-31 doi:10.4028/www.scientific.net/amm.662.160 Online: 2014-10-01 2014 Trans Tech Publications,
More informationMath/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009.
Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009. Describing Graphs (8.2) A graph is a mathematical way of describing
More informationDesign and Implementation of CNC Operator Panel Control Functions Based on CPLD. Huaqun Zhan, Bin Xu
Advanced Materials Research Online: 2013-07-31 ISSN: 1662-8985, Vol. 722, pp 428-432 doi:10.4028/www.scientific.net/amr.722.428 2013 Trans Tech Publications, Switzerland Design and Implementation of CNC
More informationThree dimensional highway real-time visual system design and application
Key Engineering Materials Online: 2011-02-21 ISSN: 1662-9795, Vols. 467-469, pp 63-68 doi:10.4028/www.scientific.net/kem.467-469.63 2011 Trans Tech Publications, Switzerland Three dimensional highway real-time
More informationAN WIRELESS COLLECTION AND MONITORING SYSTEM DESIGN BASED ON ARDUINO. Lu Shaokun 1,e*
Advanced Materials Research Online: 2014-06-25 ISSN: 1662-8985, Vols. 971-973, pp 1076-1080 doi:10.4028/www.scientific.net/amr.971-973.1076 2014 Trans Tech Publications, Switzerland AN WIRELESS COLLECTION
More informationStudy on the Quantitative Vulnerability Model of Information System based on Mathematical Modeling Techniques. Yunzhi Li
Applied Mechanics and Materials Submitted: 2014-08-05 ISSN: 1662-7482, Vols. 651-653, pp 1953-1957 Accepted: 2014-08-06 doi:10.4028/www.scientific.net/amm.651-653.1953 Online: 2014-09-30 2014 Trans Tech
More informationThe Design of CAN Bus Communication System Based on MCP2515 and S3C2440 Jinmei Liu, Junhong Wang, Donghui Sun
Advanced Materials Research Online: 2014-05-21 ISSN: 1662-8985, Vol. 933, pp 516-520 doi:10.4028/www.scientific.net/amr.933.516 2014 Trans Tech Publications, Switzerland The Design of CAN Bus Communication
More informationResearch on the Wood Cell Contour Extraction Method Based on Image Texture and Gray-scale Information.
, pp. 65-74 http://dx.doi.org/0.457/ijsip.04.7.6.06 esearch on the Wood Cell Contour Extraction Method Based on Image Texture and Gray-scale Information Zhao Lei, Wang Jianhua and Li Xiaofeng 3 Heilongjiang
More informationDeadlock Avoidance Based on Graph Theory
, pp.353-362 http://dx.doi.org/10.14257/ijunesst.2016.9.2.34 Deadlock Avoidance Based on Graph Theory Biyuan Yao, Jianhua Yin * and Wei Wu College of Information Science and Technology, Hainan University
More informationSTUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY
STUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY ИЗСЛЕДВАНЕ НА РАЗВИТИЕТО НА СТРУКТУРАТА НА МЕТРОМРЕЖАТА НА СОФИЙСКИЯ МЕТОПОЛИТЕН Assoc. Prof. PhD Stoilova S., MSc. eng. Stoev V.,
More informationA New Quick Algorithm for Finding the Minimal Spanning Tree
A New Quick Algorithm for Finding the Minimal Spanning Tree Mai Mismar Al-Quds Open University, Nablus-Palestine ABSTRACT In this paper, I propose a new Algorithm for finding the minimal spanning tree
More informationRealization of Automatic Keystone Correction for Smart mini Projector Projection Screen
Applied Mechanics and Materials Online: 2014-02-06 ISSN: 1662-7482, Vols. 519-520, pp 504-509 doi:10.4028/www.scientific.net/amm.519-520.504 2014 Trans Tech Publications, Switzerland Realization of Automatic
More informationDesign of Liquid Level Control System Based on Simulink and PLC
2017 3rd International Symposium on Mechatronics and Industrial Informatics (ISMII 2017) ISBN: 978-1-60595-501-8 Design of Liquid Level Control System Based on Simulink and PLC Xiuwei FU 1,a, Ying QI 2,b
More informationStudy on Gear Chamfering Method based on Vision Measurement
International Conference on Informatization in Education, Management and Business (IEMB 2015) Study on Gear Chamfering Method based on Vision Measurement Jun Sun College of Civil Engineering and Architecture,
More informationDynamic Balance Design of the Rotating Arc Sensor Based on PSO Algorithm
016 International Conference on Advanced Manufacture Technology and Industrial Application (AMTIA 016) ISBN: 978-1-60595-387-8 Dynamic Balance Design of the Rotating Arc Sensor Based on PSO Algorithm Ji-zhong
More informationAUTOMATIC DIVISION OF CENSUS DISTRICT BASED ON CONSTRAINT DELAUNAY TRIANGULATION
CO-041 AUTOMATIC DIVISION OF CENSUS DISTRICT BASED ON CONSTRAINT DELAUNAY TRIANGULATION LIU D., MA W., CHENG J. Chinese Academy of surveying and Mapping, BEIJING, CHINA ABSTRACT Division of census district
More informationComparison of Dijkstra's Algorithm with other proposed algorithms
International Academic Institute for Science and Technology International Academic Journal of Science and Engineering Vol. 3, No. 7, 2016, pp. 53-66. ISSN 2454-390X International Academic Journal of Science
More informationDesign and Implementation of Archives Query System Based on B/S Structure Lianfeng Zhao
Applied Mechanics and Materials Online: 2012-12-13 ISSN: 1662-7482, Vols. 241-244, pp 3098-3102 doi:10.4028/www.scientific.net/amm.241-244.3098 2013 Trans Tech Publications, Switzerland Design and Implementation
More informationOpen Access Research on the Prediction Model of Material Cost Based on Data Mining
Send Orders for Reprints to reprints@benthamscience.ae 1062 The Open Mechanical Engineering Journal, 2015, 9, 1062-1066 Open Access Research on the Prediction Model of Material Cost Based on Data Mining
More informationAn Adaptive Histogram Equalization Algorithm on the Image Gray Level Mapping *
Available online at www.sciencedirect.com Physics Procedia 25 (2012 ) 601 608 2012 International Conference on Solid State Devices and Materials Science An Adaptive Histogram Equalization Algorithm on
More informationHalf-edge Collapse Simplification Algorithm Based on Angle Feature
International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2015) Half-edge Collapse Simplification Algorithm Based on Angle Feature 1,2 JunFeng Li, 2 YongBo Chen, 3
More informationDepartment of Civil and Environmental Engineering, University of California, Irivne, CA Corresponding author
An Urban Intersection Model Based on Multi-commodity Kinematic Wave Theories LIANG CHEN WEN-LONG JIN JIANMING HU, YI ZHANG Department of Automation University of Science and Technology of China Hefei,
More informationDescription of The Algorithm
Description of The Algorithm Dijkstra s algorithm works by solving the sub-problem k, which computes the shortest path from the source to vertices among the k closest vertices to the source. For the dijkstra
More informationA Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem
A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem Quoc Phan Tan Abstract Minimum Routing Cost Spanning Tree (MRCT) is one of spanning tree optimization problems having several applications
More informationMST & Shortest Path -Prim s -Djikstra s
MST & Shortest Path -Prim s -Djikstra s PRIM s - Minimum Spanning Tree - A spanning tree of a graph is a tree that has all the vertices of the graph connected by some edges. - A graph can have one or more
More informationReliable Mobile IP Multicast Based on Hierarchical Local Registration
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Reliable Mobile IP Multicast Based on Hierarchical Local Registration Huanming ZHANG, * Quanlong GUAN, Zi Zhao ZHU, Weiqi
More informationCustomizing dynamic libraries of Qt based on the embedded Linux Li Yang 1,a, Wang Yunliang 2,b
Applied Mechanics and Materials Submitted: 2014-11-12 ISSN: 1662-7482, Vol. 740, pp 782-785 Accepted: 2014-12-02 doi:10.4028/www.scientific.net/amm.740.782 Online: 2015-03-09 2015 Trans Tech Publications,
More informationThe Application of Programmable Controller to Chip Design. Shihong Lan 1, Jian Zhang 2
Applied Mechanics and Materials Online: 2013-01-11 ISSN: 1662-7482, Vol. 273, pp 722-725 doi:10.4028/www.scientific.net/amm.273.722 2013 Trans Tech Publications, Switzerland The Application of Programmable
More informationM. Yamuna* et al. International Journal of Pharmacy & Technology
ISSN: 0975766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com AMULANCE SERVICE USING MODIFIED DIJKSTRA S ALGORITHM Chhandak agchi, Khushbu Chopra, M. Yamuna* VIT University,
More informationA Training Simulator for PD Detection Personnel
Journal of Power and Energy Engineering, 2014, 2, 573-578 Published Online April 2014 in SciRes. http://www.scirp.org/journal/jpee http://dx.doi.org/10.4236/jpee.2014.24077 A Training Simulator for PD
More informationSensor Modeling Realization Based on Fruit Fly Optimization Algorithm
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com Sensor Modeling Realization Based on Fruit Fly Optimization Algorithm Zhongju CHEN College of Computer Science, Yangtze University, 434023,
More informationKeywords: Vehicle, Accident, Reconstruction, Deformation, Finite element method
Key Engineering Materials Online: 2004-10-15 ISSN: 1662-9795, Vols. 274-276, pp 1017-1022 doi:10.4028/www.scientific.net/kem.274-276.1017 2004 Trans Tech Publications, Switzerland Virtual Reconstruction
More informationResearch on Improvement of Structure Optimization of Cross-type BOM and Related Traversal Algorithm
, pp.9-56 http://dx.doi.org/10.1257/ijhit.201.7.3.07 Research on Improvement of Structure Optimization of Cross-type BOM and Related Traversal Algorithm XiuLin Sui 1, Yan Teng, XinLing Zhao and YongQiu
More informationDRA AUDIO CODING STANDARD
Applied Mechanics and Materials Online: 2013-06-27 ISSN: 1662-7482, Vol. 330, pp 981-984 doi:10.4028/www.scientific.net/amm.330.981 2013 Trans Tech Publications, Switzerland DRA AUDIO CODING STANDARD Wenhua
More informationThe Internet of Things for Petroleum Transportation
2017 2nd International Conference on Applied Mechanics and Mechatronics Engineering (AMME 2017) ISBN: 978-1-60595-521-6 The Internet of Things for Petroleum Transportation Hui-ran WANG 1 and Rui-fang MA
More informationPath Planning with Motion Optimization for Car Body-In-White Industrial Robot Applications
Advanced Materials Research Online: 2012-12-13 ISSN: 1662-8985, Vols. 605-607, pp 1595-1599 doi:10.4028/www.scientific.net/amr.605-607.1595 2013 Trans Tech Publications, Switzerland Path Planning with
More informationMulti-Source Spatial Data Distribution Model and System Implementation
Communications and Network, 2013, 5, 93-98 http://dx.doi.org/10.4236/cn.2013.51009 Published Online February 2013 (http://www.scirp.org/journal/cn) Multi-Source Spatial Data Distribution Model and System
More informationApplied Mechanics and Materials Vol
Applied Mechanics and Materials Online: 2014-02-27 ISSN: 1662-7482, Vol. 532, pp 280-284 doi:10.4028/www.scientific.net/amm.532.280 2014 Trans Tech Publications, Switzerland A Practical Real-time Motion
More informationCSC2100-Data Structures
CSC2100-Data Structures Final Remarks Department of Computer Science and Engineering The Chinese University of Hong Kong, Shatin, New Territories Interesting Topics More Graph Algorithms Finding cycles,
More informationMarine fuel boiler system design platform. Hou Ying-ying
Advanced Materials Research Submitted: 2014-05-11 ISSN: 1662-8985, Vols. 986-987, pp 1218-1221 Accepted: 2014-05-19 doi:10.4028/www.scientific.net/amr.986-987.1218 Online: 2014-07-18 2014 Trans Tech Publications,
More information