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

Delivery of pedestrian real-time location and routing information to mobile architectural guide

AUTOMATION IN CONSTRUCTION 2010年第4期19卷 502-517页

作者： Saeed, Ghousia Brown, Andre Knight, Mike Winchester, Martin NWFP Univ Engn & Technol Dept Architecture Abbottabad Pakistan Univ Liverpool Sch Architecture Liverpool L69 7ZN Merseyside England

The research presented in this paper focuses on the use of different computing and wireless techniques and technological systems for real-time navigation support and location based information delivery for a pedestrian user interacting with city architectural information system on a digital handheld device while on the move. In this research case, the use of basic GPS receiver, dijkstra algorithm, Radio Frequency Identification (RFID)/Near Field Communication (NFC) systems and 2 Dimensional (2D) barcode technologies was examined and the potential for the use of WiFi and mobile cells is noted. This paper explores the virtue and shortcomings of each in order to determine the best possible integrated solution. The suggested integration will locate the pedestrian user in the virtual city representation on location, informs the user about buildings and other artefacts relating to the site where s/he is currently located and guide the user to a next point of interest efficiently. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Mobile architectural guide Location and routing awareness GPS 2D barcode NFC RFID dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph-Theoretical Identification of Dissociation Pathways on Free Energy Landscapes of Biomolecular Interaction

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 2010年第4期31卷 847-854页

作者： Wang, Ling Stumm, Boris Helms, Volkhard Univ Saarland Ctr Bioinformat D-6600 Saarbrucken Germany Univ Kaiserslautern Dept Comp Sci D-6750 Kaiserslautern Germany

Biomolecular association and dissociation reactions take place on complicated interaction free energy landscapes that are still very hard to characterize computationally. For large enough distances, though, it often suffices to consider the six relative translational and rotational degrees of freedom of the two particles treated as rigid bodies. Here, we computed the six-dimensional free energy surface of a dimer of water-soluble alpha-helices by scanning these six degrees of freedom in about one million grid points. In each point, the relative free energy difference was computed as the sum of the polar and nonpolar solvation free energies of the helix dimer and of the intermolecular coulombic interaction energy. The dijkstra graph algorithm was then applied to search for the lowest cost dissociation pathways based on a weighted, directed graph, where the vertices represent the grid points, the edges connect the grid points and their neighbors, and the weights are the reaction costs between adjacent pairs of grid points. As an example, the configuration of the bound state was chosen as the source node, and the eight corners of the translational cube were chosen as the destination nodes. With the strong electrostatic interaction of the two helices giving rise to a clearly funnel-shaped energy landscape, the eight lowest-energy cost pathways coming front different orientations converge into a well-defined pathway for association. We believe that the methodology presented here will prove useful for identifying low-energy association and dissociation pathways in future studies of complicated free energy landscapes for biomolecular interaction. (C) 2009 Wiley Periodicals, Inc. J Comput Chem 31: 847-854, 2010

关键词： dijkstra algorithm Poisson-Boltzmann equation helix dimer weighted graph association free energy

来源：评论

学校读者我要写书评

暂无评论

Optimal Path Planning with Obstacle Avoidance for Autonomous Surveying

Optimal Path Planning with Obstacle Avoidance for Autonomous...

引用

36th Annual Conference of the IEEE Industrial-Electronics-Society (IECON)/4th IEEE International Conference on E-Learning in Industrial Electronics/IES Industry Forum

作者： Hodo, David W. Bevly, David M. Hung, John Y. Millhouse, Scott Selfridge, Bob Auburn Univ Elect & Comp Engn Dept Auburn AL 36849 USA Auburn Univ Dept Engn Mech Auburn AL 36849 USA US Army Corps Engn Engn & Support Ctr Huntsville AL 35807 USA

ISBN: (纸本)9781424452262

In order to perform surveying with an autonomous vehicle, a path must often be designed for geometrically complex boundaries, while also accounting for mapped obstacles. In this paper, several algorithms that solve different aspects of the problem are presented. Together, the algorithms generate a path with the following characteristics: (a) it completely covers a field given its respective corner points, (b) considers the desired initial orientation of the vehicle, (c) provides methods for known obstacles to be avoided by defining areas that are not to be mapped, and (d) can cover a composition of multiple, disjoint fields. The algorithm represents an integration of several theoretical concepts, including: Dubins's paths for basic planning, modified visibility graphs to define feasible paths around obstacles, dijkstra's algorithm to search for the shortest path, and ...

关键词： dijkstra algorithm Dubin path autonomous surveying autonomous vehicle collision avoidance corner point disjoint field mapped obstacle mobile robots modified visibility graph obstacle avoidance optimal path planning path planning vehicles

来源：评论

学校读者我要写书评

暂无评论

Distributed dijkstra sparse placement routing algorithm for translucent optical networks

引用

PHOTONIC NETWORK COMMUNICATIONS 2009年第1期18卷 55-64页

作者： Tintor, Vladica Radunovic, Jovan Univ Belgrade Dept Opt Commun Fac Elect Engn Belgrade 11000 Serbia

In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks. In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network. In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage of the network capacity resources. We apply a distributed dijkstra routing algorithm which dynamically changes weights of links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in the network with electronic regenerations in order to have the same performance as in an opaque network.

关键词： Translucent optical networks Routing assignment dijkstra algorithm Wavelength division multiplex Sparse regeneration problem

来源：评论

学校读者我要写书评

暂无评论

Fitting with Interpolation to Resolve the Construction of Roads in Mountains

Fitting with Interpolation to Resolve the Construction of Ro...

引用

International Conference on Information Computing and Applications

作者： Wang, Jinran Yue, Xiaoyun Guo, Yajun Yang, Xiaojing Guo, Yacai Hebei Normal Univ Sci & Technol Inst Math & Informat Technol Qinhuangdao 066004 Hebei Province Peoples R China

ISBN: (纸本)9783642163357

The interpolation fitting is an important method in the numerical analysis, and it has applied in the practical life widely. As for the questions proposed in the mathematics model, to resolve the construction of roads in the mountains with the least cost, this paper used local optimization theory, under the specific circumstances of the mountain set up control points, made the topographic map method into the network, established new network of roads, bridges tunnels and gave different weights, By minimizing the cost instead using the shortest path problem in fitting with interpolation and solved problem using dijkstra algorithm, finally reached the optimal route and the minimum cost.

关键词： Shortest path interpolation fitting least cost dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and Realization of Route Control System in Railway System Based on Simulation

Design and Realization of Route Control System in Railway Sy...

引用

International Conference on Logistics Systems and Intelligent Management

作者： Cui Jian-Jiang Shi Da-Yu Wang Li-Hui Chen Da-Li Liu Feng Northeastern Univ Inst Artificial Intelligence & Robot Shenyang 110004 Peoples R China Baosteel Transport Dept Shanghai 201900 Peoples R China

ISBN: (纸本)9781424473281

The simulation research for the route control system in an industrial railway system is presented in this paper. The method of schedule indications analysis with integration of locomotive-position-task is proposed. In this method, the proper schedule instructions received are divided into three layers, which solve the problem of incomplete analysis for schedule indications effectively. An improved dijkstra algorithm is applied, which improves the efficiency of route search remarkably. Finally, the simulation platform of the route control system in a railway system is researched and developed. The system has a good stability, in which average opening time of routes is less than 100ms, which lays the foundation for building the real route control system.

关键词： Route Control Schedule Indications Analysis Path Planning dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal path finding algorithms based on SLSD road network model

引用

Journal of Southeast University(English Edition) 2010年第4期26卷 558-562页

作者：张小国王庆龚福祥东南大学仪器科学与工程学院南京210096

A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is *** the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network ***,a road node is abstracted as the linkage of two ordered single-directional *** model can describe turn restrictions,circular roads,and other real scenarios usually described using a *** a computing framework for optimal path finding（OPF）is *** is proved that classical dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD ***,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.

关键词： optimal path finding road network model conceptual model digital map vehicle navigation system A algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Autonomous indoor wayfinding for individuals with cognitive impairments

引用

JOURNAL OF NEUROENGINEERING AND REHABILITATION 2010年第1期7卷 45-45页

作者： Chang, Yao-Jen Peng, Shu-Ming Wang, Tsen-Yung Chen, Shu-Fang Chen, Yan-Ru Chen, Hung-Chi Chung Yuan Christian Univ Dept Elect Engn Jhongli Taiwan Taipei Municipal Jen Ai Hosp Ctr Occupat Therapy Taipei Taiwan

Background: A challenge to individuals with cognitive impairments in wayfinding is how to remain oriented, recall routines, and travel in unfamiliar areas in a way relying on limited cognitive capacity. While people without disabilities often use maps or written directions as navigation tools or for remaining oriented, this cognitively-impaired population is very sensitive to issues of abstraction (e.g. icons on maps or signage) and presents the designer with a challenge to tailor navigation information specific to each user and context. Methods: This paper describes an approach to providing distributed cognition support of travel guidance for persons with cognitive disabilities. A solution is proposed based on passive near-field RFID tags and scanning PDAs. A prototype is built and tested in field experiments with real subjects. The unique strength of the system is the ability to provide unique-to-the-user prompts that are triggered by context. The key to the approach is to spread the context awareness across the system, with the context being flagged by the RFID tags and the appropriate response being evoked by displaying the appropriate path guidance images indexed by the intersection of specific end-user and context ID embedded in RFID tags. Results: We found that passive RFIDs generally served as good context for triggering navigation prompts, although individual differences in effectiveness varied. The results of controlled experiments provided more evidence with regard to applicabilities of the proposed autonomous indoor wayfinding method. Conclusions: Our findings suggest that the ability to adapt indoor wayfinding devices for appropriate timing of directions and standing orientation will be particularly important.

关键词： Decision Point Cognitive Disability dijkstra algorithm Indoor Navigation Alternate Treatment Design

来源：评论

学校读者我要写书评

暂无评论

Shortest Path algorithm within Dynamic Restricted Searching Area in City Emergency Rescue

Shortest Path Algorithm within Dynamic Restricted Searching ...

引用

2010 IEEE International Conference on Emergency Management and Management Sciences(ICEMMS)

作者： Fanliang Bu,Hui Fang Department of Engineering of Security &Protection System Chinese People’s Public Security University Beijing,China

When city emergencies happen,one of the most important tasks of emergency rescue is to find the shortest path to the emergency in shortest time,scientific and rational path plays an important role in improving rescue *** to the needs of city emergency rescue and basing on the analysis of the classical algorithm for solving the shortest path problem (dijkstra algorithm),this article discusses an improved algorithm within dynamic restricted searching area which dynamically changes the direction of the search and restricts the searching *** new method reduces time and space complexity and improves the efficiency of the *** the end of the article,it improves the practicality and reliability of this improved algorithm by simulation.

关键词： emergency rescue dijkstra algorithm dynamic searching

来源：评论

学校读者我要写书评

暂无评论

IMPROVED TRUST PATH SEARCHING IN MOBILE SOCIAL NETWORKS

IMPROVED TRUST PATH SEARCHING IN MOBILE SOCIAL NETWORKS

引用

2010 3rd IEEE International Conference on Broadband Network & Multimedia Technology(2010年第三届IEEE宽带网络与多媒体国际会议 IC-BNMT 2010)

作者： Qian Wang Wendong Wang Yidong Cui Nan Du Hao Wang State Key Laboratory of Network and Switching Technology Beijing University of Posts and Telecommunications Beijing China

People are considered as important resources nowadays. When we are caught in some problem, how to find a direct or indirect friend, who is professional in the specific field, to help us is the key point. The popularity of social network provides a great platform for the solution of the problem through computer automation. dijkstra is a classical algorithm for searching the shortest path between two nodes. However, the time complexity is enormous, especially when the network is complex like social networks. A novel algorithm is proposed in the paper for improving the situation. The weight used in the novel algorithm is decided by three-dimensional factors while the dijkstra algorithm only involves the one for edges in a graph. And we validate that comparing to dijkstra it is more efficient in both theory and experiment.

关键词： improved trust path search dijkstra algorithm integrated weight mobile social networks (MSN)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：