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

9th International Conference on Intelligent Transport Systems Telecommunications

作者： Poolsawat, Anurak Ayutaya, Kannikar Siriwong Na Pattara-Atikom, Wasan NSTDA NECTEC Klongluang 12120 Pathumthani Thailand

ISBN: (纸本)9781424453467

Traffic information is undeniably essential to every one especially for commuters. With accurate and up to date traffic information, a better traveling plan can be made, which translates to reduction in time and energy consumption. Consequently, overall society and environment can benefit from traffic information. This paper presents a study of impact of intelligent traffic information system (ITIS) on congestion saving in Bangkok. We propose to utilize both static and dynamic traffic information in order to find the least congested route. The results revealed that up to 75% congestion saving can be achieved with ITIS.

关键词： Intelligent Transportation Systems shortest path algorithm impact analysis congestion level

来源：评论

学校读者我要写书评

暂无评论

Automatic Landmark Detection on Epicondyles of Distal Femur in X-Ray Images

引用

4th European Conference of the International Federation for Medical and Biological Engineering (ECIFMBE)

作者： Heidari, B. Khaksar, F. Madeh FitzPatrick, D. Univ Coll Dublin Sch Elect Elect & Mech Engn Dublin 2 Ireland Tehran Azad Univ Biomed Engn Fac Sci & Res Branch Tehran Iran

ISBN: (纸本)9783540892076

Orthopaedic condition such as degenerative arthritis (e.g., osteoarthritis) can deteriorate the osteoarticular systems, causing pain and affecting activities of daily living. Treatments such as Total Knee Arthroplasty (TKA) or Spinal Arthroplasty are commonly used to relieve the pain/disability and provide mobility. This requires an accurate definition of key anatomical landmarks both for surgical operation and implant design. Utilization of the X-ray images is essential for diagnostic purposes (e.g., to identify the extent of pathological conditions), and demand for their use is ever-increasing. Moreover, radiological images are used for shape extraction/bone geometry for orthopaedic application (such as implant design or surgical/non-surgical planning) [1,2,3]. However, visual inspection/manual extraction is a subjective task and error prone, and geometrical analysis (through shape extraction), in particular, is a time consuming process [4]. In this paper we present a method to find anatomical landmarks from X-ray images, using MATLAB software (The MathWorks Inc., Natick, MA, USA) [11]. Segmentation and shortest path algorithm together with implementation of proper constraints were employed to find medial and lateral edges of the femur, enabling automatically extract parameters such as the epicondylar width of the femur. Some of the constraints applied to the program include adjusting image intensity values [10] particularly on the medial side of the knee, and separating image in to two parts, due to differences in the intensity of the image caused by patella projection. Initially, twenty series of digital X-ray images of the distal femur were used as input data to extract their anatomical landmarks, providing a means to automatically measure morphometric dimensions in different populations (by exporting the detected edges in 2-D coordinate system). The results show that the developed algorithm can detect the landmark in a robust way. Further integration of the re

关键词： Landmark detection femur digital X-Ray radiograph edge detection shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the non-strict uncapacitated multiple allocation p-hub median problem based on tuba search

Research on the non-strict uncapacitated multiple allocation...

引用

21st Chinese Control and Decision Conference

作者： Bai Ming-guo Anhui Univ Technol Sch Management Maanshan 243002 Peoples R China

ISBN: (纸本)9781424427239

The problem of locating hub facilities arises in the design of transportation and telecommunications networks. In this paper we consider the non-strict uncapacitated multiple allocation p-hub median problem which belongs to a class of discrete location-allocation problems. A mixed integer linear programming model of the non-strict uncapacitated multiple allocation p-hub median problem is proposed and a new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the non-strict uncapacitated multiple allocation p-hub median problem. Our algorithm is benchmarked on a Chinese data. Computational results demonstrate that the algorithm can find the best solution of all the problems within 0.14 seconds, so the heuristic algorithm has strong ability and quick efficiency in finding Optimal Solutions.

关键词： Hub Non-hub shortest path algorithm Tabu search Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the non-strict uncapacitated multiple allocation p-hub median problem based on tuba search

Research on the non-strict uncapacitated multiple allocation...

引用

2009中国控制与决策会议

作者： BAI Ming-guo School of Management,Anhui University of Technology,Ma'anshan 243002,China

The problem of locating hub facilities arises in the design of transportation and telecommunications *** this paper we consider the non-strict uncapacitated multiple allocation p-hub median problem which belongs to a class of discrete location-allocation problems.A mixed integer linear programming model of the non-strict uncapacitated multiple allocation p-hub median problem is proposed and a new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the non-strict uncapacitated multiple allocation p-hub median *** algorithm is benchmarked on a Chinese *** results demonstrate that the algorithm can find the best solution of all the problems within 0.14 seconds,so the heuristic algorithm has strong ability and quick efficiency in finding Optimal Solutions.

关键词： Hub Non-hub shortest path algorithm Tabu search Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Crowd simulation for emergency response using BDI agents based on immersive virtual reality

引用

SIMULATION MODELLING PRACTICE AND THEORY 2008年第9期16卷 1415-1429页

作者： Shendarkar, Ameya Vasudevan, Karthik Lee, Seungho Son, Young-Jun Univ Arizona Tucson AZ 85721 USA

This paper presents a novel methodology involving a Virtual Reality (VR)-based Belief, Desire, and Intention (BDI) software agent to construct crowd simulation and demonstrates the use of the same for crowd evacuation management under terrorist bomb attacks in public areas. The proposed BDI agent framework allows modeling of human behavior with a high degree of fidelity. The realistic attributes that govern the BDI characteristics of the agent are reverse-engineered by conducting human-in-the-loop experiments in the VR-based Cave Automatic Virtual Environment (CAVE). To enhance generality and interoperability of the proposed crowd simulation modeling scheme, input data models have been developed to define environment attributes (e.g., maps, demographics, evacuation management parameters). The validity of the proposed data models are tested with two different evacuation scenarios. Finally, experiments are conducted to demonstrate the effect of various crowd evacuation management parameters on the key performance indicators in the evacuation scenario Such as crowd evacuation rate and densities. The results reveal that constructed simulation can be used as an effective emergency management tool. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Agent-based simulation CAVE shortest path algorithm Crowd simulation Emergency response management

来源：评论

学校读者我要写书评

暂无评论

Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2008年第4期19卷 219-230页

作者： Chung, Kuo-Liang Liao, Po-Hsuan Chang, Jia-Ming Natl Taiwan Univ Sci & Technol Dept Comp Sci & Informat Engn Taipei 10672 Taiwan

Given a closed curve with n points, based on the local integral square error and the curvature constraint criteria, this paper presents a novel two-pass O(Fn + mn(2))-time algorithm for solving the closed polygonal approximation problem where m(<< n) denotes the minimal number of covering feasible segments for one point and empirically the value of m is rather small, and F (<< n(2)) denotes the number of feasible approximate segments. Based on some real closed curves, experimental results demonstrate that under the same number of segments used, our proposed two-pass algorithm has better quality and execution-time performance when compared to the previous algorithm by Chung et al. Experimental results also demonstrate that under the same number of segments used, our proposed two-pass algorithm has better quality, but has some execution-time degradation when compared to the currently published algorithms by Wu and Sarfraz et al. (c) 2008 Elsevier Inc. All rights reserved.

关键词： algorithm closed curve closed polygonal approximation algorithm curvature local integral square error shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

An integrated multi-objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments

引用

JOURNAL OF ADVANCED TRANSPORTATION 2008年第4期42卷 493-519页

作者： Chiou, Yu-Chiun Lai, Yu-Hsuan Natl Chiao Tung Univ Inst Traff & Transportat Taipei Taiwan

This study proposes an integrated multi-objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments. The model consists of three sub-models: rescue shortest path model, post-disaster traffic assignment model, and traffic controlled arcs selection model to minimize four objectives: travel time of rescue path, total detour travel time, number of unconnected trips of non-victims, and number of police officers required. Since these sub-models are inter-related with each other, they are solved simultaneously. This study employs genetic algorithms incorporated with traffic assignment and K-shortest path methods to determine optimal rescue path and controlled arcs. To cope with uncertain information associated with the damaged network, fuzzy system reliability theory (weakest t-norm method) is used to measure the access reliability of rescue path. To investigate the validity and applicability of the proposed model, studies on an exemplified case and a field case of Chi-Chi earthquake in Taiwan are conducted. The performances of three rescue strategies: without traffic control, selective traffic control (i.e. the proposed model) and absolute traffic control are compared. The results show that the proposed model can maintain the efficiency of rescue activity with minimal impact to ordinary trips and number of police officers required.

关键词： Chi-Chi earthquake disaster relief operations fuzzy access reliability genetic algorithms shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

NPASA : A NOBLE path SELECTION algorithm

NPASA : A NOBLE PATH SELECTION ALGORITHM

引用

International Symposium on Computer Science and Its Applications

作者： Newton, P. Calduwel Raj, E. George Dharma Prakash Arockiam, L. Prasath, R. Hari Kim, Tai-hoon Bishop Heber Coll Autonomous Dept Comp Sci & Applicat Tiruchirappalli 620017 Tamil Nadu India St Josephs Coll Autonomous Lecturer SG Comp Sci Tiruchirappalli 620002 Tamil Nadu India Hannam Univ Dept Multimedia Taejon South Korea

ISBN: (纸本)9780769534282

As the network is growing exponentially, challenges and issues also increases. They affect the performance of the network. Many factors contribute improve the performance of the network.. One such factor is finding the path quickly. In this paper, we ore,going to find a shortest bath faster compared to Dijkstra's shortest path algorithm. We have introduced new ideas in building end-to-end path. various Steps involved ill finding the shortest path ore: refined. The simulated algorithm shows better results than the existing algorithm. We are sure that, the outcome of this paper reduces computation overhead and processing overload.

关键词： Computation Processing overhead shortest path algorithm End-to-End path

来源：评论

学校读者我要写书评

暂无评论

Infrastructureless Inter-Vehicular Real-Time Route Guidance

Infrastructureless Inter-Vehicular Real-Time Route Guidance

引用

11th IEEE International Conference on Intelligent Transportation Systems (ITSC 2008)

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

ISBN: (纸本)9781424421114

This paper presents an inter-vehicular communication (IVC)-based algorithm for real-time route guidance in urban traffic networks. It is built on information sharing among some searcher vehicle and candidate vehicles traveling in the same direction, to the same destination and within a specific communication range. The paper discusses in details (he algorithmic procedure and conditions for information sharing. A microscopic simulation model is utilized to assess the effectiveness of the algorithm against another benchmark algorithm;namely, centralized shortest path algorithm. Comparisons of the two algorithms' average travel time, and overall network productivity are presented. The algorithms performances are captured for various scenarios reflecting network congestion levels, link speeds and link lengths.

关键词： Inter-vehicular communication real-time route guidance microscopic simulation shortest path algorithm network sizes network performance

来源：评论

学校读者我要写书评

暂无评论

Solving shortest paths efficiently on nearly acyclic directed graphs

引用

THEORETICAL COMPUTER SCIENCE 2007年第1-3期370卷 94-109页

作者： Saunders, Shane Takaoka, Tadao Univ Canterbury Dept Comp Sci & Software Engn Christchurch 1 New Zealand

shortest path problems can be solved very efficiently when a directed graph is nearly acyclic. Earlier results defined a graph decomposition, now called the 1-dominator set, which consists of a unique collection of acyclic structures with each single acyclic structure dominated by a single associated trigger vertex. In this framework, a specialised shortest path algorithm only spends delete-min operations on trigger vertices, thereby making the computation of shortest paths through non-trigger vertices easier. A previously presented algorithm computed the 1-dominator set in O (mn) worst-case time, which allowed it to be integrated as part of an O (mn + nr log r) time all-pairs algorithm. Here m and n respectively denote the number of edges and vertices in the graph, while r denotes the number of trigger vertices. A new algorithm presented in this paper computes the 1-dontinator set injust O (m) time. This can be integrated as part of the O (m + r log r) time spent solving single-source, improving on the value of r obtained by the earlier tree-decomposition single-source algorithm. In addition, a new bidirectional form of 1-dominator set is presented, which further improves the value of r by defining acyclic structures in both directions over edges in the graph. The bidirectional 1-dominator set can similarly be computed in O (m) time and included as part of the O (m + r log r) time spent computing single-source. This paper also presents a new all-pairs algorithm under the more general framework where r is defined as the size of any predetermined feedback vertex set of the graph, improving the previous all-pairs time complexity from O (mn + nr(2)) to O (mn + r(3)). (c) 2006 Elsevier B.V. All rights reserved.

关键词： shortest path algorithm nearly acyclic graph graph decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：