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

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

来源：评论

学校读者我要写书评

暂无评论

An algorithm Based on Two-layer Graph Model for E-Commerce Recommendation

An Algorithm Based on Two-layer Graph Model for E-Commerce R...

引用

International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Pan, Li Xu, Xiaosha Tan, Zhimeng Peng, Xin Hunan Inst Sci & Technol Sch Informat & Commun Engn Yueyang 414006 Peoples R China

ISBN: (纸本)9781509059522

Recommender systems have been applied by E-commerce or other application sites to recommend their produces that customers might be interested in. This paper refines a bipartite graph to a two-layer graph model by adding the similarity information between consumers and products, the related metric is presented to measure the relationship among them, and the shortest path algorithm is introduced to obtain suitable recommendations.

关键词： Two-layer graph shortest path algorithm recommender system E-commerce

来源：评论

学校读者我要写书评

暂无评论

A model for projecting flight delays during irregular operation conditions

引用

JOURNAL OF AIR TRANSPORT MANAGEMENT 2004年第6期10卷 385-394页

作者： Abdelghany, KF Shah, SS Raina, S Abdelghany, AF So Methodist Univ Environm & Civil Engn Dept Dallas TX 75275 USA United Airlines Res & Dev Informat Serv Div Elk Groove IL 60007 USA

On-time performance of airlines schedule is key factor in maintaining current customer satisfaction and attracting new ones. This requires management of the different operation resources (crew/aircraft) to ensure their on-time readiness for each flight in the planned schedule. However, flight schedules are often subjected to irregularity. In particular, weather accounts for nearly 75% of system delays. Due to the tight connection among airlines resources, these delays could dramatically propagate over time and space unless the proper recovery actions are taken. This paper presents a model which projects flight delays and alerts for possible future breaks during irregular operation conditions. The results of applying the model at the operation control center of a major airlines company in the US are presented. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： airlines schedule shortest path algorithm irregular operations proactive recovery

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A satellite routing algorithm based on optimization of both delay and bandwidth

A satellite routing algorithm based on optimization of both ...

引用

7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM)

作者： Zhang, Deng-yin Liu, Sha Yin, Man-li Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Peoples R China

ISBN: (纸本)9781424462520

The merits of the routing algorithm will have a direct impact on the performance of a communication network. Traditional satellite routing algorithms are based on shortest path algorithm, the simply considering least delay, the least hop or the best link-bandwidth utilization. For the request of real-time in information network, a routing algorithm BDSR (bandwidth-delay satellite routing) comprehensively considering both delay and bandwidth between satellite-link is proposed in this paper. Moreover, we prove that the routing algorithm is an ideal one that is suitable for LEO satellite network on NS2 simulation platform.

关键词： Satellite Network Routing shortest path algorithm NS2 Simulation

来源：评论

学校读者我要写书评

暂无评论

New Method of the Best path Selection with Length Priority Based on Reinforcement Learning Strategy 28

New Method of the Best Path Selection with Length Priority B...

引用

28th International Conference on Computer Communications and Networks (ICCCN)

作者： Liu, Xiao-huan Zhang, De-gan Zhang, Ting Cui, Yu-ya Minist Educ Key Lab Comp Vision & Syst TJUT Tianjin Peoples R China Tianjin Univ Technol Sch Comp Sci & Engn Tianjin Peoples R China

ISBN: (纸本)9781728118567

This paper proposes and designs a new method of the best path selection algorithm with length priority to analyze and solve the optimal path planning problem of intelligent driving vehicles in practical applications. Through the understanding and learning of the reinforcement learning algorithm, we proposed a new method of the best path selection with length priority based on the prior knowledge applied reinforcement learning strategy, and improved the search direction setting of the shortest path in the program, simplified the process of shortest path search. This path optimization method can effectively help different types of intelligent driving vehicles to smoothly select the best path in the traffic network with limited height, width and weight, accident and traffic jam. Through simulation experiments and scene experiments, it is proved that the proposed algorithm has good stability, high efficiency and practicability.

关键词： Reinforcement Learning Intelligent Driving shortest path algorithm path Planning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Model of Optimal Maneuver used in Tactical Decision Support System 21

Model of Optimal Maneuver used in Tactical Decision Support ...

引用

21st International Conference on Methods and Models in Automation and Robotics (MMAR)

作者： Stodola, Petr Nohel, Jan Mazal, Jan Univ Def Dept Tact Brno Czech Republic 53rd Reconnaissance & Elect Warface Regiment Opava Czech Republic

ISBN: (纸本)9781509018666

This paper deals with the model of optimal maneuver of units and its implementation in the Tactical Decision Support System (TDSS). The model is designed to be used for planning the optimal movement of units (soldiers, vehicles, unmanned robots) on the battlefield. The paper is separated into three main parts. Firstly, the model of maneuver is discussed;it is divided into five independent layers: topographic layer, elevation data layer, weather layer, hostile units layer, and friendly units layer. Impact of each layer on the model is then analyzed. Secondly, experiments used for verification of the model are presented. Finally, the implementation of the model in the TDSS is shown. TDSS is used to support commanders in their decision-making processes.

关键词： model optimal maneuver decision support system decision-making process shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

HAS: Hierarchical A-Star algorithm for big map navigation in special areas

HAS: Hierarchical A-Star algorithm for big map navigation in...

引用

5th International Conference on Digital Home (ICDH)

作者： Wang, Haifeng Zhou, Jiawei Zheng, Guifeng Liang, Yun Sun Yat Sen Univ Sch Software Guangzhou 510006 Guangdong Peoples R China South China Agr Univ Coll Informat Guangzhou 510642 Guangdong Peoples R China

ISBN: (纸本)9781479942848

The problem of path-finding has to be solved in transportation, city planning, commercial computer games, navigation and many other fields. How to find the shortest path is the key point of this problem. For computer games and many other fields, since the maps are usually not very big, traditional algorithms such as Dijkstra algorithm and AStar algorithm work well. But if we want to find the shortest path of two points in a big city or even a country, the memory and CPU resources are limited and these algorithms may result in bad performance. To solve the problem of navigation in big maps, this paper introduces and analyzes the use of Hierarchical A-Star algorithm which adds the hierarchical mechanism into traditional A-Star algorithm and save the resources of CPU and memory. For a big map such as the map of a country, to find the shortest path of two points, we successively divide the map of the country into maps of states, cities, towns, and blocks. Then we implement A Star algorithm for each layer and recursively find the shortest path of these two points.

关键词： map navigation shortest path algorithm A-Star

来源：评论

学校读者我要写书评

暂无评论

Optimal Distribution Network Planning for Massive Distributed Resources Accommodation

Optimal Distribution Network Planning for Massive Distribute...

引用

58th IEEE/IAS Industrial and Commercial Power Systems Technical Conference Asia (IEEE I and CPS Asia)

作者： Liu, Guowei Wang, Xiaowen Zhao, Yuming Tang, Wenjun Xu, Yinliang Shen, Xinwei Tsinghua Univ China Southern Power Grid Shenzhen Power Supply Co Tsinghua Shenzhen Int Grad Sch Shenzhen Peoples R China Tsinghua Univ Tsinghua Berkeley Shenzhen Inst TBSI Shenzhen Peoples R China China Southern Power Grid Shenzhen Power Supply Co Shenzhen Peoples R China Tsinghua Univ Tsinghua Shenzhen Int Grad Sch Shenzhen Peoples R China

ISBN: (数字)9781665450669

ISBN: (纸本)9781665450669

With the development of power technology, the penetration rate of different distributed resources in the distribution network continues to increase. In order to effectively reduce the impact of the high uncertainty of these distributed resources, distribution network managers need a faster and more efficient optimization method to plan the distribution network. Therefore, a new distributed algorithm-based Distribution Network Planning (DNP) method is proposed in this study. In the proposed planning method, two main parts of investment cost are comprehensively considered, construction cost and operation cost, an optimization model for distribution network planning is established and solved by the distributed Bias Min-consensus algorithm, which greatly improves the solution speed of the algorithm. Besides, k-means method is adopted to extract the set of uncertain scenarios. To evaluate the efficiency of the proposed method, a 24-node test system was used.

关键词： Distributed algorithm shortest path algorithm distribution network expansion planning computation efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：