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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

85 篇 会议
70 篇 期刊文献
5 篇 学位论文

馆藏范围

160 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

133 篇 工学
- 67 篇 计算机科学与技术...
- 48 篇 电气工程
- 25 篇 信息与通信工程
- 18 篇 控制科学与工程
- 16 篇 软件工程
- 15 篇 交通运输工程
- 13 篇 机械工程
- 9 篇 电子科学与技术（可...
- 6 篇 土木工程
- 5 篇 石油与天然气工程
- 4 篇 生物医学工程（可授...
- 3 篇 仪器科学与技术
- 2 篇 力学（可授工学、理...
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 2 篇 环境科学与工程（可...
- 2 篇 生物工程
- 1 篇 光学工程
29 篇 理学
- 10 篇 生物学
- 9 篇 数学
- 6 篇 物理学
- 2 篇 系统科学
- 1 篇 地理学
- 1 篇 地球物理学
21 篇 管理学
- 21 篇 管理科学与工程(可...
- 3 篇 工商管理
4 篇 经济学
- 3 篇 应用经济学
- 1 篇 理论经济学
4 篇 农学
4 篇 医学
- 4 篇 基础医学(可授医学...

主题

160 篇 shortest path al...
5 篇 reinforcement le...
5 篇 path planning
5 篇 graph theory
4 篇 routing
4 篇 dijkstra algorit...
4 篇 optimization
4 篇 protein-protein ...
3 篇 real-time route ...
3 篇 routing algorith...
3 篇 intelligent driv...
3 篇 network performa...
3 篇 computational mo...
3 篇 dijkstra's algor...
3 篇 gis
3 篇 line maze robot
3 篇 microscopic simu...
3 篇 network analysis
3 篇 greedy algorithm
2 篇 internet of thin...

机构

4 篇 shanghai maritim...
3 篇 shanghai univ sc...
2 篇 rice univ dept e...
2 篇 univ novi sad te...
2 篇 fujian univ tech...
2 篇 chalmers univers...
2 篇 univ waterloo de...
2 篇 lanzhou jiaotong...
2 篇 xiamen univ tech...
2 篇 nanjing univ aer...
2 篇 chinese acad sci...
1 篇 telkom univ sch ...
1 篇 department of el...
1 篇 schneider elect ...
1 篇 deakin univ sch ...
1 篇 univ sydney sch ...
1 篇 univ patras dept...
1 篇 imam abdulrahman...
1 篇 uae univ rttsrc ...
1 篇 beijing jiaotong...

作者

4 篇 chen lei
3 篇 huang tao
3 篇 su juing-huei
3 篇 cai yu-dong
3 篇 lee chyi-shyong
3 篇 huang hsin-hsiun...
3 篇 pan jeng-shyang
3 篇 hawas yaser e.
2 篇 sun yang
2 篇 cavallaro joseph...
2 篇 dobrilovic dalib...
2 篇 napenas marc jos...
2 篇 chang yi-wei
2 篇 zhou xuesong
2 篇 stojanov zeljko
2 篇 xu hua-rong
2 篇 zhang de-gan
2 篇 xu yinliang
2 篇 cui yu-ya
2 篇 zhang ting

语言

148 篇 英文
7 篇 其他
3 篇 中文
2 篇 荷兰文

检索条件"主题词=Shortest path algorithm"

共 160 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Analysis of the Optimization Railway Route from Romania to Poland in "One Belt and One Road"

Analysis of the Optimization Railway Route from Romania to P...

引用

International Conference on Logistics, Informatics and Service Sciences (LISS)

作者： Chen, Wen Lu, Xiaochun Beijing Jiaotong Univ Sch Econ & Management Beijing 100044 Peoples R China

ISBN: (纸本)9781509011025

This article is to study European railway transportation plan on the background of railway transportation in New Silk Road Economic Belt. It is focused on railway transport routes which have not been involved in New Silk Road Economic Belt, rather than the railway transportation routes that have been founded. Finally, we selected the railway transport route between Romania to Poland as research object. We are aimed to find out the optimal path of railway transportation from Romania to Poland.

关键词： One Belt and One Road Transshipping stations shortest path algorithm Crystal Ball

来源：评论

学校读者我要写书评

暂无评论

Energy-Optimal Driving Range Prediction for Electric Vehicles 28

Energy-Optimal Driving Range Prediction for Electric Vehicle...

引用

28th IEEE Intelligent Vehicles Symposium (IV)

作者： De Nunzio, Giovanni Thibault, Laurent IFP Energies Nouvelles Dept Control Signal & Syst Rueil Malmaison France

ISBN: (纸本)9781509048045

Range anxiety is one of the main obstacles to the wide diffusion of electric vehicles. Better understanding of the vehicle's energy consumption and driving range may help reduce electric vehicles drivers' stress. This work proposes a model-based predictive strategy to estimate the energy driving range of an electric vehicle. The estimation takes into account the specific vehicle parameters, as well as the topology of the road network in which the vehicle operates and the real-time traffic conditions. A macroscopic version of the energy consumption model of the electric vehicle is presented in order to use the aggregated real-time data available on typical maps web-services. The road network is modeled as a weighted directed graph adapted to the proposed energy consumption model. The energy driving range is finally obtained by means of an optimal path search algorithm suitable for online use. The driving range thus obtained offers improved precision and reliability as compared to the average-consumption-based and distance-based strategies.

关键词： Driving range energy consumption estimation electric vehicles adjoint graph 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

来源：评论

学校读者我要写书评

暂无评论

Optimizing alternative routes retrieval in an agent-based transportation management system

Optimizing alternative routes retrieval in an agent-based tr...

引用

3rd International Conference on Service Systems and Service Management

作者： Lazanas, Alexios Megalokonomos, George Univ Patras Ind Management & Informat Syst Lab Patras 26500 Greece Univ Patras Dept Mech & Aeronaut Operat Res Sect Patras 26500 Greece

ISBN: (纸本)1424404509

This paper reports on issues raised during the development of an intelligent web-based system for transportation services. Our approach exploits software agents technology to efficiently handle simple or modular transportation requests. The agents involved in the proposed system represent and act on behalf of two basic types of users involved in a transportation scenario, that is, for customers looking for the appropriate way to ship their products, and for transportation companies (carriers) that may - fully or partially - carry out such requests.. Particular attention is paid to the construction of modular transportation solutions, that is solutions that fragment the itinerary requested to a set of sub-routes that may involve different transportation means. The corresponding algorithm and tool developed for this process are comprehensively presented.

关键词： transportation management intelligent agents shortest path algorithm transportation services

来源：评论

学校读者我要写书评

暂无评论

Comparison of Two (Geometric) algorithms for Auto OMA 36th

Comparison of Two (Geometric) Algorithms for Auto OMA

引用

36th International Modal Analysis Conference and Exposition (IMAC) on Structural Dynamics

作者： Juul, Martin Olsen, Peter Balling, Ole Amador, Sandro Brincker, Rune Aarhus Univ Dept Engn Aarhus Denmark Tech Univ Denmark Dept Civil Engn Lyngby Denmark

ISBN: (纸本)9783319747002;9783319746999

In this paper we compare two geometric algorithms for automatic Operational Modal Analysis(OMA). The compared algorithms are the shortest path algorithm (SPA) that considers shortest paths in the set of poles and the Smallest Sphere algorithm (SSA) that operates on the set of identified poles to find the set of smallest spheres, containing physical poles. Both algorithm are based on sliding filter stability diagrams recently introduced by Olsen et al. We show how the two algorithms identify system parameters of a simulated system, and illustrate the difference between the identified parameters. The two algorithms are compared and illustrated on simulated data. Different choices of distance measures are discussed and evaluated. It is illustrated how a simple distance measure outperforms traditional distance measures from other Auto OMA algorithms. Traditional measures are unable to discriminate between modes and noise.

关键词： Automated operational modal analysis Distance measure shortest path algorithm Sliding filter stability Smallest sphere algorithm System identification

来源：评论

学校读者我要写书评

暂无评论

Fast Train: A Computationally Efficient Train Routing and Scheduling Engine for General Rail Networks 17

Fast Train: A Computationally Efficient Train Routing and Sc...

引用

IEEE 17th International Conference on Intelligent Transportation Systems (ITSC)

作者： Meng, Lingyun Zhou, Xuesong Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Arizona State Univ Sch Sustainable Engn & Built Environm Tempe AZ 85287 USA

ISBN: (纸本)9781479960781

A number of tactical and operational applications, such as train timetabling and dispatching, require sophisticated and computationally efficient software to optimize train schedules. An open-source train scheduling package, namely FastTrain has been designed and implemented to generate feasible schedules and optimality gap estimates for trains on a generic rail network with both single and double tracks. This paper describes its two major modelling components: (1) a network cumulative flow model to capture the complex safety rules of infrastructure resources, and (2) a Lagrangian relaxation solution framework which efficiently decomposes the original multi-trains complex model to a set of single train oriented subproblems. Two experimental cases based on the adapted datasets released by INFORMS RAS are conducted to demonstrate the effectiveness and efficiency of the developed algorithm under different network and data availability conditions.

关键词： Train Routing Train Scheduling Resource Constraints Lagrangian Relaxation shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on the Resultant Impedance Model and its Application for Hazardous Material Transportation

Study on the Resultant Impedance Model and its Application f...

引用

International Conference on Civil Engineering and Transportation (ICCET 2011)

作者： Ma, Changxi Chen, Zhizhong Lanzhou Jiaotong Univ Sch Traff & Transportat Lanzhou Peoples R China

ISBN: (纸本)9783037852446

The hazardous materials on highway are becoming a lot of mobile hazardous sources. If the accidents occur, they can produce great influences for people, property and environment. With the development of economic, the transport volume of hazardous material is considerably increasing, and the potential risk of hazardous material for environment and mankind is enlarging. How to select the best transportation route, insure transportation safety and reach destination rapidly is an important problem for decision department. Aim at transportation network of hazardous materials, this paper studied the resultant impedance of each road. Then this paper turned the hazardous material highway transportation route decision-making problem into a single objective shortest path problem and applies the improved cellular automata model to solve it. Finally, an example confirmed the feasibility of the decision-making method. The decision-making method of hazardous material can help the government supervision and management department choose the best route.

关键词： Hazardous material Transportation route Cellular automata shortest path algorithm Resultant impedance

来源：评论

学校读者我要写书评

暂无评论

A Security-Critical Task Management Method for Distributed Real-Time Systems 15th

A Security-Critical Task Management Method for Distributed R...

引用

15th International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Yu, Yang Dong, Qi Luo, Zhipeng Chen, Hao Deng, Jun Guan, Wei Acad Engn Phys Mianyang 621900 Peoples R China Univ Elect Sci & Technol China Sch Informat & Software Chengdu 611054 Peoples R China

ISBN: (纸本)9783319271613;9783319271606

Security has become an important constraint in distributed real-time task system. For this paper, we give a security-critical distributed real-time task management model, then present a scheme for security-critical task management in the distributed real-time system, finally we propose an algorithm to solve the management problem in the distributed real-time system. We propose a security-critical distributed real-time task management model, and formulate the security-critical distributed real-time system task management issue into a shortest path problem. We solve the shortest path problem by using the improved Dijkstra algorithm. In addition, we validate the efficiency of the algorithm by simulation experiments.

关键词： Security-critical Distributed real-time system Task management shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Assessment methods for the targeted reconfiguration in distribution networks

Assessment methods for the targeted reconfiguration in distr...

引用

PowerTech, 2015 IEEE Eindhoven

作者： Toure, S. Vanet, E. Caire, R. Besanger, Y. Univ Grenoble Alpes G2Elab F-38000 Grenoble France CNRS G2Elab F-38000 Grenoble France

ISBN: (纸本)9781479976959

In this paper, we propose methods for minimizing power losses through dynamic reconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfiguration cost have been developed. The first method is based on a shortest path algorithm, whereas the second one is based on mixed integer linear programming. The algorithms are tested on an IEEE network with and without distributed generation;the results are presented and compared for the two different methods.

关键词： Dynamic Distribution Reconfiguration Problem shortest path algorithm Mixed Integer Linear Problem Distributed Generation

来源：评论

学校读者我要写书评

暂无评论

Personalized Daily Travel Planning Based on Two-Stage Spatiotemporal Network 6

Personalized Daily Travel Planning Based on Two-Stage Spatio...

引用

IEEE 6th International Conference on Control Science and Systems Engineering (ICCSSE)

作者： Wang, Yiwen Ma, Jihui Beijing Jiaotong Univ Sch Traff & Transportat Beijing Peoples R China

ISBN: (纸本)9781728198460

Nowadays tourism transportation has become a hot topic of research, and the rapid development of Internet technology has overloaded information, which has made it impossible to provide services with different preferences for different users. Therefore, personalized tourism transportation has become the current mainstream trend. According to the different preferences of travelers for money and travel time, based on the analysis of mainstream tourism services, and combined with multi-source traffic data, this paper proposes a mathematical model for personalized travel planning. This paper proposes a two-stage spatiotemporal network solution algorithm. In the first stage, based on the set of travel attractions given by the traveler, the shortest path algorithm is used to plan an approximate optimal path that meets the traveler's preferences and to implement connection of multiple travel modes. The second stage is combined with the spatiotemporal network to achieve daily travel planning between multiple attractions. The two-stage spatiotemporal network algorithm is feasible for solving path planning problems, and can simplify route planning problems with time windows, which provides a useful reference for future personalized travel planning recommendations.

关键词： two-stage daily travel planning spatiotemporal network personalized travel shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共16页 << < 6 7 8 9 10 11 12 13 14 15 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：