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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

274 篇 会议
157 篇 期刊文献
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

379 篇 工学
- 183 篇 计算机科学与技术...
- 119 篇 电气工程
- 79 篇 控制科学与工程
- 59 篇 信息与通信工程
- 32 篇 交通运输工程
- 26 篇 机械工程
- 25 篇 仪器科学与技术
- 25 篇 软件工程
- 18 篇 材料科学与工程（可...
- 16 篇 测绘科学与技术
- 14 篇 土木工程
- 13 篇 石油与天然气工程
- 11 篇 电子科学与技术（可...
- 9 篇 航空宇航科学与技...
- 8 篇 动力工程及工程热...
- 7 篇 化学工程与技术
- 7 篇 环境科学与工程（可...
- 7 篇 生物医学工程（可授...
- 6 篇 水利工程
- 6 篇 地质资源与地质工...
72 篇 理学
- 23 篇 数学
- 15 篇 物理学
- 10 篇 化学
- 9 篇 地理学
- 9 篇 地球物理学
- 7 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 7 篇 工商管理
16 篇 医学
- 8 篇 临床医学
8 篇 经济学
- 8 篇 应用经济学
5 篇 法学
3 篇 农学
2 篇 教育学
2 篇 文学
1 篇 艺术学

主题

437 篇 dijkstra algorit...
38 篇 path planning
34 篇 shortest path
17 篇 graph theory
14 篇 optimization
12 篇 genetic algorith...
10 篇 optimal path
10 篇 shortest path pr...
8 篇 routing
8 篇 a* algorithm
8 篇 route optimizati...
8 篇 wireless sensor ...
5 篇 maklink graph
5 篇 wireless sensor ...
5 篇 navigation
5 篇 optimal path pla...
5 篇 dynamic programm...
5 篇 simulated anneal...
5 篇 ant colony algor...
5 篇 path optimizatio...

机构

4 篇 brno university ...
3 篇 fukuoka inst tec...
3 篇 fukuoka inst tec...
3 篇 univ elect sci &...
3 篇 southwest petr u...
3 篇 school of north ...
2 篇 rajarajeswari co...
2 篇 qatar univ dept ...
2 篇 henan institute ...
2 篇 shenyang institu...
2 篇 democritus univ ...
2 篇 northeastern uni...
2 篇 school of north ...
2 篇 univ elect sci &...
2 篇 wuhan univ techn...
2 篇 beijing univ pos...
2 篇 univ essex sch c...
2 篇 northwestern pol...
2 篇 univ sfax digita...
2 篇 north china elec...

作者

6 篇 uchida kazunori
3 篇 hou xiaorong
3 篇 barolli leonard
3 篇 luo min
2 篇 raj pethuru
2 篇 hakim hela
2 篇 guo shi-ze
2 篇 selvarani r.
2 篇 yunjuan liang
2 篇 ouarzazi jamal
2 篇 yang yang
2 篇 zhang hanyu
2 篇 boujemaa hatem
2 篇 zhang ruifang
2 篇 georgiadi irene
2 篇 dechuan kong
2 篇 ji tianyi
2 篇 luo yaozhi
2 篇 yoo mintaek
2 篇 touati farid

语言

412 篇 英文
14 篇 其他
10 篇 中文
1 篇 西班牙文

检索条件"主题词=Dijkstra algorithm"

共 437 条记录，以下是301-310 订阅

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

详细简洁

排序：

Network Model of the Shortest Path Selection in Transport 14

Network Model of the Shortest Path Selection in Transport

引用

14th Transport Systems Telematics Conference (TST)

作者： Dramski, Mariusz Maka, Marcin Uchacz, Waldemar Maritime Univ Szczecin PL-70500 Szczecin Poland

ISBN: (纸本)9783662453162

The network models are often used to solve transport problems. In this paper authors propose such application in the field of finding optimal path in transport. Furthermore, a comparison with other known methods is described. This paper touches only the theoretical aspect of transport problems, but the results can be successfully applied to real transport systems.

关键词： network model optimization shortest path restricted area dijkstra algorithm graph's theory

来源：评论

学校读者我要写书评

暂无评论

Use of Big Data Technology in Vehicular Ad-hoc Networks 3

Use of Big Data Technology in Vehicular Ad-hoc Networks

引用

3rd International Conference on Advances in Computing, Communications and Informatics (ICACCI)

作者： Bedi, Punam Jindal, Vinita Univ Delhi Dept Comp Sci Delhi 110007 India

ISBN: (纸本)9781479930807

Big Data technology is becoming ubiquitous and depicting key attention of researchers in almost all areas. VANET is a special form of MANET that uses vehicles as nodes in a network. By applying Big Data technologies to Vehicular Adhoc Network (VANET), one can gain useful insight from a huge amount of operational data, to improve traffic management processes such as planning, engineering and operations. VANETs access large data during the real time operations. In this paper we map VANET characteristics to Big Data attributes stated in literature. Further, we evaluate the performance of dijkstra algorithm used for routing in vehicular networks on Hadoop Map Reduce standalone distributed framework as well as on multi node cluster with 2, 3, 4 and 5 nodes respectively. The results obtained confirm that increasing the number of nodes in Hadoop framework, processing time for the algorithm is greatly reduced.

关键词： Big Data Hadoop Map Reduce VANETs dijkstra algorithm GSR Shortest Path Distributed computing

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Charging Station Matching Method for Electric Vehicles in Internet of Things

An Intelligent Charging Station Matching Method for Electric...

引用

International Conference on Mechatronics and Semiconductor Materials (ICMSCM 2013)

作者： Liu, Yuxi Zhao, Jiakui Ouyang, Hong Wang, Wenhong Wang, Shulong State Grid Elect Power Res Inst Beijing 100192 Peoples R China The Anhui Elect Power Corp Hefei 230061 Peoples R China

ISBN: (纸本)9783037859391

The internet of things(IoT) is considered as one of the most important supporting technologies for the smart grid, which is considered as one of the most important application areas of the IoT. In the electric IoT, with the development of electric vehicles (EVs), effectively modeling road network becomes more and more important. In this paper, a road network model which captures the real-life road conditions better than previous models is introduced. Moreover, an awaiting time in the queue is taken into consideration before EVs being charged. Compared with minimum distance standard, the proposed time minimum standard and dijkstra algorithm are adopted to track the path of the EVs. Finally, a velocity limitation of EV is considered in the simulations to embody the real-life road network.

关键词： Internet of Things Electric Vehicles (EVs) dijkstra algorithm Road Network

来源：评论

学校读者我要写书评

暂无评论

STUDY OF SHORTEST PATH algorithm DYNAMIC MODEL BASED ON HALF SPACE

STUDY OF SHORTEST PATH ALGORITHM DYNAMIC MODEL BASED ON HALF...

引用

International Conference on Information Science, Electronics and Electrical Engineering (ISEEE)

作者： Feng, Wu Ying, LiYue Xinyang Agr Coll Dept Comp Sci Xinyang City Henan Prov Peoples R China

ISBN: (纸本)9781479931972

In GIS field, the efficiency of shortest path search algorithm is widely existed and need to be resolved imminently. In this paper, author analyzes the optimization means based on dijkstra algorithm and brings forward his optimization schemes half space optimizing dijkstra's shortest path algortithm form two aspects optimization of data storge configuration and searching direction. Compared to the conventional method, this algorithm saves more than 1/3 ROM and doubles the operational efficiency.

关键词： shortest path half space dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

dijkstra's algorithm Applied to 3D Skeletonization of the Brain Vascular Tree: Evaluation and Application to Symbolic

Dijkstra's Algorithm Applied to 3D Skeletonization of the Br...

引用

32nd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBC 10)

作者： Verscheure, L. Peyrodie, L. Makni, N. Betrouni, N. Maouche, S. Vermandel, M. Loos CHRU Lille INSERM Res Unit U703 THAISInst Hippocrate 152 Rue Docteur Yersin F-59120 Yersin France Univ Lille 1 Lab Elect Engn & Image Proc LAGIS CNRS F-59650 Villeneuve Dascq France

ISBN: (纸本)9781424441242

This paper describes the methodology and the evaluation of a 3D skeletonization algorithm applied on brain vascular structure. This method is based on the application of the minimum cost-spanning tree using dijkstra's algorithm and seems well appropriate to tubular objects. We briefly describe the different steps, from the segmentation to the skeleton analysis. Besides, we propose an original evaluation scheme of the method based on digital phantom and clinical data. The final aim of this work is to provide a symbolic description framework applied to cerebro-vascular structures.

关键词： 3D skeletonization dijkstra algorithm biomedical MRI blood vessels brain brain vascular tree cerebrovascular structures digital phantom image segmentation image thinning medical image processing minimum cost spanning tree phantoms skeleton analysis trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

An Optimal algorithm for the flexible Maneuverability in Smart Sensor Networks (SSNs) 4

An Optimal Algorithm for the flexible Maneuverability in Sma...

引用

4th International Conference on Computer Communication and Informatics (ICCCI)

作者： Rajaraajeswari, S. Selvarani, R. Raj, Pethuru RajaRajeswari Coll Engn Dept Comp Applicat Bangalore Karnataka India IBM India IBM Global Cloud Ctr Excellence Bangalore 560045 Karnataka India

ISBN: (纸本)9781479923526

Sensors and actuators are being extensively used these days across industry verticals for a variety of reasons. With a number of delectable advancements in network topologies and communication technologies, novel types of sensors networks are being formed according to the business requirements. Smart sensors are capable of crafting ad hoc networks for accomplishing specified tasks. The direct fallout of these improvisations is the possibility and sustainability of smarter environments. For examples, nowadays there are a lot of happenings around the concepts of smarter homes, offices, cities, governments, healthcare etc. Smarter services are being realized with the help of smarter sensors and their networks. However one of the impending challenges is the network path optimization. There are several methods and mechanisms in place for optimizing network path identification. However, with the emergence of smarter environments, the current approaches need to improve significantly. In this paper, we have taken up the tried, tested and trusted dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and maneuverability in network path identification and optimization. This newly crafted algorithm goes a long way in conceptualizing and concretizing a variety of newer applications while ensuring the principal non-functional requirements such as energy efficiency, extensibility, etc.

关键词： dijkstra algorithm Wireless Sensor Network Smart and Smarter Buildings Cloud

来源：评论

学校读者我要写书评

暂无评论

Identification of Multiple Paths in Smarter Buildings Networks

Identification of Multiple Paths in Smarter Buildings Networ...

引用

World Congress on Computing and Communication Technologies (WCCCT)

作者： Rajaraajeswari, S. Selvarani, R. Raj, Pethuru RajaRajeswari Coll Engn Dept Comp Applicat Bangalore Karnataka India IBM Global Cloud Ctr Excellence Bangalore 560045 Karnataka India

ISBN: (纸本)9781479928767

There are software solutions for automating most of the processes and functionalities associated with the automation and management of a variety of our living environments such as homes, buildings, apartments, offices, manufacturing plants, hospitals, etc. Smarter services, systems and networks collectively play a very compelling role in visualizing and establishing next-generation personal as well as professional environments. However there are several notable challenges in implementing smarter networks which aid in crafting people-centric and adaptive applications and services. One among them is the network path optimization requirement. There are several methods and mechanisms in place for optimizing network path identification. The current approaches need to improve to suit for smarter buildings networks to live up to their expectations. In this paper, we have taken up the popular and proven dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and controllability in network path identification and optimization.

关键词： dijkstra algorithm Wireless Sensor Network Smart and Smarter Buildings Cloud Computing Smartphones

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Path-finding by Possibilities Search 7

A New Approach to Path-finding by Possibilities Search

引用

Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)

作者： Benoit, Vallade Nakashima, Tomoharu Osaka Prefecture Univ Dept Comp Sci & Intelligent Syst Osaka Japan

ISBN: (纸本)9781479959556

This paper presents a new approach to the pathfinding in video games. Path-finding algorithms, are used to find a path between two positions of a map. The standard way consists to search for a specific path. However it appears that in actual games, where the allowed computation time becomes smaller and the game-plays and maps are more complex, it should not be the best way to proceed. Therefore, this new approach to the pathfinding considers the global possibilities of movement instead of searching for a specific path. This paper describes the concept of possibility and details the procedure used to search them. The appreciable experiments results prove the validity and efficiency of this approach.

关键词： Path-finding algorithm dijkstra algorithm A star algorithm Monte Carlo Tree Search algorithm notion of possibility video games map simplification

来源：评论

学校读者我要写书评

暂无评论

On an Efficient and Effective Intelligent Transportation System (ITS) Using Field and Simulation Data

On an Efficient and Effective Intelligent Transportation Sys...

引用

Conference on Multisensor, Multisource Information Fusion - Architectures, algorithms, and Applications

作者： Ekedebe, Nnanna Chen, Zhijiang Xu, Guobin Lu, Chao Yu, Wei Towson Univ Dept Comp & Informat Sci Towson MD 21252 USA

ISBN: (纸本)9781628410587

Intelligent transportation system (ITS) applications are expected to provide a more efficient, effective, reliable, and safe driving experience, which can minimize road traffic congestion resulting in a better traffic flow management. To efficiently manage traffic flows, in this paper, we compare the effectiveness of two well-known vehicle routing algorithms: the dijkstra's shortest path algorithm and the A* (Astar) algorithm in terms of the total travel time and the travel distance. To this end, we built a generic ITS test-bed and created several real-world driving scenarios using field and simulation data to evaluate the performance of these two routing algorithms. The dataset used in our simulation is six weeks traffic volume data from 08/01/2012 to 09/27/2012 in the Maryland (MD)/Washington DC and Virginia (VA) area. Our simulation data shows that an increase in network size results in scalability problems as the efficiency and effectiveness of these algorithms diminishes in larger road networks with greater traffic volume densities, flow rates, and congested conditions. In addition, the imprecision of the road network increases as the network size and the traffic volume density increases. Our study shows that the ability of these vehicular routing algorithms to adaptively route traffic depends on the size and type of road networks, and the current roadway conditions.

关键词： Intelligent transportation system vehicular ad hoc networks vehicle-to-vehicle, and vehicle-to-infrastructure communications astar algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

The UAV dynamic path planning algorithm research based on Voronoi diagram

The UAV dynamic path planning algorithm research based on Vo...

引用

26th Chinese Control and Decision Conference (CCDC)

作者： Chen, Xia Chen, Xiangmin Shen Yang Aerosp Univ Shenyang 110136 Peoples R China

ISBN: (纸本)9781479937066

According to the flight path planning problem in dynamic environment, this paper gives a method of analysis. First, the radar threat field based on Voronoi diagram is created, and the track performance indicators established based on radar threat cost and fuel cost. Then the dijkstra algorithm was improved, and the algorithm is used for path planning in dynamic environment.. Finally, the simulation experiment is made, the result of simulation shows that the improved algorithm can achieve real-time tracking of moving targets, so the effectiveness of the algorithm is be verified.

关键词： UAV Voronoi diagram dijkstra algorithm Moving target Dynamic path planning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：