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

Q Value-Based Dynamic Programming with Boltzmann Distribution in Large Scale Road Network

SICE Journal of Control, Measurement, and System Integration 2011年第2期4卷 129-136页

作者： Shanqing Yu Yelei Xu Shingo Mabu Manoj Kanta Mainali Kaoru Shimada Kotaro Hirasawa Graduate School of Information Production and Systems Waseda University

In this paper, a global optimal traffic assignment strategy, i.e., Q value-based Dynamic Programming with Boltzmann Distribution is applied to the Kitakyushu City traffic system. The main idea of the proposed traffic assignment strategy is to calculate the expected traveling time for each origin-destination pair and the probability of selecting the next section, then to generate a considerable number of route candidates for the drivers based on the calculated probability. In the simulation, how to select the temperature parameter and the number of the route candidates is discussed in detail. The comparison between the proposed method and the shortest path algorithms indicates that the proposed method could reduce the risk of the traffic congestion occurrence and save the traveling cost effectively. In addition, the computation time is given to reveal the feasibility of the proposed method in large scale networks.

关键词： Q value-based dynamic programming Boltzmann distribution shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Route Computation Approach for Large Graphs

An Efficient Route Computation Approach for Large Graphs

引用

第三十届中国控制会议

作者： SONG Qing,WANG Xiaofan Department of Automation,Shanghai Jiao Tong University,and Key Laboratory of System Control and Information Processing,Ministry of Education of China,Shanghai 200240,P.R.China

The problem of efficient routing arises in several applications such as transportation problems and network *** increasing availability of large network data sets and the impact of networks on everyday life has set new standard to route computations,necessitating research for even faster and more accurate shortest path algorithms.A hierarchical graph model is developed based on an effective partition of graphs for decomposing the complex search problem.A new heuristic hierarchical routing algorithm is then proposed to significantly reduce the search space by pruning searches towards unpromising subgraph *** results on New York City road network demonstrate the performance of the algorithm.

关键词： shortest path algorithm Hierarchical Heuristics Large Graphs

来源：评论

学校读者我要写书评

暂无评论

An algorithm to Calculate shortest AS paths under No-Valley and Prefer-Customer Policies

An Algorithm to Calculate Shortest AS Paths under No-Valley ...

引用

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Wei Peng,Wenping Deng,Xiaofeng Hu,Jinshu Su School of Computer National University of Defense Technology Changsha,Hunan,410073,China

The no-valley and prefer-customer policies are two important routing policies to guarantee the safety and robustness of the inter-domain routing *** an AS(Autonomous System)topology,shortest path calculation in topology analysis must consider the two routing policies *** this paper,we propose a valley-free shortest path algorithm using the classic Dijkstra's algorithm *** algorithm nds shortest policy paths from other nodes to a speci ed destination in order to accomodate the routing *** real topology data sets from CAIDA,we compare the proposed algorithm with the Dijkstra's *** turns out that although the routing policies give rise to the complexity in calculating,the time complexity of the algorithm is approximate to that of the classic ***,we found that the differences of shortest path lengths with/without the policy constraints in the topology snapshots are decreasing with the evolution of the Internet.

关键词： inter-domain routing shortest path algorithm routing policy topology analysis

来源：评论

学校读者我要写书评

暂无评论

shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment

引用

EXPERT SYSTEMS WITH APPLICATIONS 2009年第8期36卷 11221-11232页

作者： Dong, Ming Wu, Chang Hou, Forest Shanghai Jiao Tong Univ Antai Coll Econ & Management Shanghai 200052 Peoples R China Intel Prod Shanghai Ltd Shanghai 200131 Peoples R China

This paper studies a new kind of dynamic multi-stage facility layout problem under dynamic business environment, in which new machines may be added into, or old machines may be removed from the plant. We define this problem first on the basis of unequal area machines and continual presentation of layouts. Compared with nodes and arcs of the flow chart, we convert this problem into a shortest path problem by studying its cost function and machine adding/removing heuristic rules, and the corresponding mathematical model for this problem is established. An auction algorithm is proposed here to solve the shortest path problem. Finally, a shortest path based simulated annealing algorithm is presented to solve the optimization problem. Parameters of the SP based SA algorithm are discussed to improve the performance of the algorithm. Some cases are used to verify the proposed algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Dynamic layout Adding/removing machines shortest path algorithm Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

A shortest path algorithm based on limited search heuristics

A shortest path algorithm based on limited search heuristics

引用

International Computer Science Symposium in Russia (CSR 2006)

作者： Lu, Feng Lai, Poh-Chin Chinese Acad Sci Inst Geog Sci & Nat Resources Res State Key Lab Resources & Environm Informat Syst Beijing 100101 Peoples R China Univ Hong Kong Dept Geog Hong Kong Hong Kong Peoples R China

ISBN: (纸本)3540341668

Dijkstra's algorithm is arguably the most popular computational solution to finding single source shortest paths. Increasing complexity of road networks, however, has posed serious performance challenge. While heuristic procedures based on geometric constructs of the networks would appear to improve performance, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited search heuristics guided by spatial arrangement of networks. The algorithm was tested for its efficiency and accuracy in finding one-to-one and one-to-all shortest paths among systematically sampled nodes on a selection of real-world networks of various complexity and connectivity. Our algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable.

关键词： shortest path algorithm road network heuristic

来源：评论

学校读者我要写书评

暂无评论

A New Method for Measuring the Semantic Similarity on Gene Ontology

A New Method for Measuring the Semantic Similarity on Gene O...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Shen, Ying Zhang, Shaohong Wong, Hau-San City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424483075

Semantic similarity defined on Gene Ontology (GO) aims to provide the functional relationship between different biological processes, molecular functions, or cellular components. In this paper, a novel method, namely the shortest path (SP) algorithm, for measuring the semantic similarity on GO is proposed based on both the GO structure information and the term's property. The proposed algorithm searches for the shortest path that connects two terms and uses the sum of weights on the shortest path to compute the semantic similarity for GO terms. A method for evaluating the nonlinear correlation between two variables is also introduced for validation. Extensive experiments conducted on two public gene expression datasets demonstrate the overall superiority of SP method over the other state-of-the-art methods evaluated.

关键词： bioinformatics biological processes cellular biophysics cellular components gene ontology genetics molecular biophysics molecular functions ontologies (artificial intelligence) public gene expression datasets semantic similarity shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

MINIMUM FLOW VARIATION IN MAXIMUM FLOWS

引用

DISCRETE MATHEMATICS algorithmS AND APPLICATIONS 2010年第3期2卷 389-393页

作者： Masoumi, M. Mobasseri, A. M. Rezaei, A. R. Islamic Azad Univ Sci & Res Branch Dept Math Tehran Iran Shahid Beheshti Univ Dept Comp Sci GC Tehran Iran

Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost. Among the predominant issues in this field are problems that result when the flow is going through one arc to another arc in the same direction, such as the role of compressors in gas pipeline networks or the role of transformers in electricity wide networks. Hence, in order to minimize the cost of these elements in the network, we perform applications of line-digraphs in the form of an optimization algorithm. This paper proposes a new variant of the max flow-min cost problem. Our objective is to find the smoothest max flow over a given network.

关键词： Line digraph max flow-min cost problem shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Desktop-CAVE for First Person Shooter Games

Desktop-CAVE for First Person Shooter Games

引用

Brazilian Symposium on Games and Digital Entertainment

作者： Fernando Roman Anderson Maciel Luciana Nedel Instituto de Informatica (INF) Universidade Federal do Rio Grande do Sul (UFRGS)

ISBN: (纸本)9781612843919

Games are everywhere and, with the sharp improvement of graphics in the later years, a new challenge is to create better interfaces to amplify the sensorial experience of game players. In this context, the present work proposes a desktop based CAVE system using three video monitors with dynamic angles between them. Our hypothesis is that such a system provide an improvement in the players' peripheral vision for 3D first person shooter games. This would even benefit the player performance. In our implementation we used augmented reality and computer vision techniques to calibrate the monitors. Graphics libraries (ARToolkit e OpenGL) have been used to detect and calibrate monitors within the same 3D space and calculate the angles between them. The open source game AssaultCube has been modified to support three monitors and different camera angles. The game have shown to be entertaining and has been used as a use case for user tests. Tests have shown that the desktop CAVE system allows for performance improvement as the players make significatively less look- around movements with the mouse while keeping the average number of kills and deaths favorable in relation to a conventional one monitor setup.

关键词： Real-time Strategy Relief Mapping shortest path algorithm First Person Shooter

来源：评论

学校读者我要写书评

暂无评论

Comparative Assessment of Intervehicular Communication algorithms for Real-Time Traffic Route Guidance

引用

JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS 2009年第4期13卷 199-217页

作者： Hawas, Yaser E. Napenas, Marc Joseph B. Hamdouch, Younes UAE Univ Dept Civil & Environm Engn Al Ain U Arab Emirates UAE Univ RTTSRC Al Ain U Arab Emirates UAE Univ Coll Business & Econ Al Ain U Arab Emirates

This article presents two algorithms for intervehicular communication (IVC)-based route guidance in a traffic network. The first algorithm enables communication between a searcher vehicle and other vehicles traveling the network in the opposite direction of the searcher vehicle. The second algorithm enables sharing information among the searcher vehicle and other vehicles traveling in the same direction and within a specific communication range. The mathematical formulations of the two algorithms are presented. A microscopic simulation model is utilized to assess the effectiveness of these algorithms against the well-known shortest path algorithm. Travel time and network productivity are used as the measures of performance. The overall network performance is captured under various congestion levels and link speeds and lengths. Two distinct methods are used in assessment: free simulation runs to evaluate the network productivity under various communication schemes and forced simulation runs to estimate the network travel while fixing the network productivity under various communication schemes.

关键词： Intervehicular Communication Real-time Route Guidance algorithms Mathematical Formulations Microscopic Simulation shortest path algorithm Network Performance

来源：评论

学校读者我要写书评

暂无评论

Application of the fastest route algorithm in the interactive simulation of the effect of local ischemia on the ECG

引用

MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING 2009年第1期47卷 11-20页

作者： van Dam, Peter M. Oostendorp, Thom F. van Oosterom, Adriaan Medtron SQDM Res NL-6825 MJ Arnhem Netherlands Radboud Univ Nijmegen Med Ctr Dept Cognit Neurosci NL-6525 EZ Nijmegen Netherlands CHU Vaudois Dept Cardiol EPFL STI ITS LTS1 CH-1015 Lausanne Switzerland

A method is described to determine the effect on the ECG of a reduced propagation velocity within an ischemic zone. The method was designed to change the activation sequence throughout the ventricles interactively, i.e. with a response time in the order of a second. The timing of ventricular ischemic activation was computed by using the fastest route algorithm, based on locally reduced values of the propagation velocities derived from a standard, normal activation sequence. The effect of these local reductions of the velocities on the total activation sequence, as well as the changes in the electrocardiogram that these produce, are presented.

关键词： shortest path algorithm Isochrones of depolarization wave Ischemia Heart ECG ECGSIM

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：