检索结果-南通市图书馆

维普期刊数据库

A shortest path algorithm for moving objects in spatial network databases

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2008年第7期18卷 893-899页

作者： Xiaolan Yin a,b,*, Zhiming Ding c, Jing Li a a Technology Center of Software Engineering, Institute of Software, Chinese Academy of Science, P.O. Box 8718, Beijing 100080, China b Graduate University, Chinese Academy of Sciences, Beijing 100049, China c Technology Center of Basic Software, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Technology Center of Software Engineering Institute of Software Chinese Academy of Science P.O. Box 8718 Beijing 100080 China Graduate University Chinese Academy of Sciences Beijing 100049 China Technology Center of Basic Software Institute of Software Chinese Academy of Sciences Beijing 100080 China

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels, gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2i), and traditional Dijkstra’s complexity is O((i + k)2).

关键词： Moving object Spatial network databases shortest path index shortest path

Dynamic shortest path Monitoring in Spatial Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2016年第4期31卷 637-648页

作者： Shuo Shang Lisi Chen Zhe-Wei Wei Dan-Huai Guo Ji-Rong Wen State Key Laboratory of Software Development Environment Beijing 100191 China Department of Computer Science China University of Petroleum Beijing 102249 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Beijing Key Laboratory of Big-Data Management and Analysis Methods Renmin University of China Beijing 100080 China Computer Network Information Center Chinese Academy of Sciences Beijing 100190 China

With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowa- days and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks （DSPM query）. When a traveler aims to a des- tination, his/her shortest path to the destination may change due to two reasons： 1） the travel costs of some edges have been updated and 2） the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons： 1） how to maintain and reuse the existing computation results to accelerate the following computations, and 2） how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data.

关键词： shortest path dynamic spatial network spatial database location-based service

Threshold-Based shortest path Query over Large Correlated Uncertain Graphs

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2015年第4期30卷 762-780页

作者：成雨蓉袁野陈雷王国仁 College of Information Science and Engineering Northeastern University Shenyang 110819 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China

With the popularity of uncertain data, queries over uncertain graphs have become a hot topic in the database community. As one of the important queries, the shortest path query over an uncertain graph has attracted much attention of researchers due to its wide applications. Although there are some e？cient solutions addressing this problem, all existing models ignore an important property existing in uncertain graphs： the correlation among the edges sharing the same vertex. In this paper, we apply Markov network to model the hidden correlation in uncertain graphs and compute the shortest path. Unfortunately, calculating the shortest path and corresponding probability over uncertain graphs modeled by Markov networks is a #P-hard problem. Thus, we propose a filtering-and-verification framework to accelerate the queries. In the filtering phase, we design a probabilistic shortest path index based on vertex cuts and blocks of a graph. We find a series of upper bounds and prune the vertices and edges whose upper bounds of the shortest path probability are lower than the threshold. By carefully picking up the blocks and vertex cuts, the index is optimized to have the maximum pruning capability, so that we can filter a large number of vertices which make no contribution to the final shortest path query results. In the verification phase, we develop an e？cient sampling algorithm to determine the final query answers. Finally, we verify the e？ciency and effectiveness of our solutions with extensive experiments.

关键词： shortest path correlated uncertain graph probabilistic shortest path index

A New Algorithm for Solving Multicriteria shortest path Problem

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 1999年第3期9卷 335-339页

作者： MA Liang\ \ WANG Long\|de College of Systems Science and Systems Engineering, University of Shanghai for Science and Technology, Shanghai 200093, P.R.China

In this paper a new algorithm for solving multicriteria shortest path problem is presented. The algorithm is based on the recently developed principles of ant optimization. Computational experiments are reported showi... 详细信息

关键词： multicriteria shortest path ant algorithm

维普期刊数据库

Finding Community Structure in Networks Using a shortest-path-Based k-Means Algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Mathematical Research with Applications 2013年第3期33卷 288-296页

作者： Jinglu GAO School of Mathematics Jilin University

We consider the problem of detecting the community structure in a complex network, groups of nodes with a higher-than-average density of edges connecting them. In this paper we use the simulated annealing strategy to maximize the modularity, which has been indicated as a robust benefit function, associating with a shortest-path-based k-means iterative procedure for network partition. The proposed algorithm can not only find the communities, but also identify the nodes which occupy central positions under the metric of the shortest path within the communities to which they belong. The optimal number of communities can be automatically determined without any prior knowledge about the network structure. The applications to both artificial and real-world networks demonstrate the effectiveness of our algorithm.

关键词： community structure modularity shortest path K-means simulated annealing.

The shortest path Analysis Based on Road Network

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Asian Agricultural Research 2017年第6期9卷 98-100页

作者： Chaozheng DU Resources and Environment Department Heze University

Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.

关键词： shortest path Dijkstra’s algorithm Road network model Network analysis

Analysis Based on the shortest path Method of Equipment Replacement 26th

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Analysis Based on the Shortest Path Method of Equipment Repl...

Research on the Best Method of shortest path to Solve Network Communication Problem

第26届中国控制与决策会议

作者： ZHAO Ping LI Laifeng Civil Engineering College Xi’an University of Architecture and Technology

ISBN: (纸本)9781479937097

Equipment is the foundation and precondition of the survival of the enterprises, the advanced level and the update problem of which directly affect the enterprise’s survival and development, which also are paid more and more attention. Based on network model, this paper studied the update problem of the construction equipment, through changing the equipment update problem to the shortest path problem of graph theory, so as to solve the selection problem of equipment renewal scheme and ensure total cost of equipment replacement is the minimum in the service life. Compared to the traditional method of equipment renewal, this method possesses more intuitive. Through a instance analysis of concrete mixer truck in a construction enterprise, the paper proved and solved the method mentioned above and reached the optimal solution.

关键词： shortest path Equipment Replacement Network Model the Optimal Solution

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Research on the Best Method of Shortest Path to Solve Networ...

A Heuristic Algorithm for shortest path with Multiple Constraints

作者： Wen-rong JIANG Tao-zi SI School of Computer and Information Shanghai Polytechnic University

As the basic theory of shortest path calculation, Dijkstra algorithm is widely used in various aspects, such as: transportation, construction of signal station, laying of high-speed rail. Based on graph theory, this paper studies Dijkstra algorithm to analyze network communication problems, introduces the principle of Dijkstra algorithm in detail, and makes a contribution to the research of shortest path.

关键词： Dijkstra algorithm shortest path Network communication Research Graph theory

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Heuristic Algorithm for Shortest Path with Multiple Constr...