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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
154 篇 期刊文献
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

434 篇 dijkstra algorit...
38 篇 path planning
34 篇 shortest path
17 篇 graph theory
14 篇 optimization
12 篇 genetic algorith...
10 篇 optimal path
10 篇 shortest path pr...
9 篇 a* algorithm
8 篇 routing
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

语言

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

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

共 434 条记录，以下是41-50 订阅

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

详细简洁

排序：

Multihop Transmission Strategy Using dijkstra algorithm to Improve Energy Efficiency in WSNs 4th

Multihop Transmission Strategy Using Dijkstra Algorithm to I...

引用

4th International Symposium on Ubiquitous Networking (UNet)

作者： Abderrahim, Maha Hakim, Hela Boujemaa, Hatem Touati, Farid Carthage Univ COSIM LAB SUPCOM Tunis Tunisia Univ Sfax Digital Res Ctr Sfax Tunisia Qatar Univ Dept Elect Engn Doha Qatar

ISBN: (纸本)9783030028497;9783030028480

Thanks to the development in the wireless communication technologies and the microelectronics domain, Wireless Sensor Networks (WSNs) are more and more omnipresent. The most important challenge of WSN is how to extend its lifetime. For long distance communication, using one hop transmission causes the dissipation of a lot of energy. To avoid this dissipation, an energy-efficient multihop transmission strategy based on dijkstra algorithm is proposed in this paper. We consider a WSN organized into clusters, each cluster is composed of N sensor nodes classified as follows: source node, cluster head (CH) node as the destination, group of active nodes and group of sleeping nodes. The selection of CH node is based on the position of nodes within the cluster and their residual energy. Then, the CH groups the remaining nodes into active or sleeping nodes according to a reference distance. We suppose that the transmitting symbol is correctly received only if the Signal-to-Noise Ratio (SNR) at the receiver is above a threshold gamma(th). Our main objective is to define a new transmission technique minimizing the power consumption using multihop communication. The selected relays which cooperate to aid the source-destination communication are those offering the least transmit power while maintaining SNR equal to the threshold gamma(th). We use dijkstra algorithm to select the reliable relays. Simulations results demonstrate that the proposed transmission technique can reduce enormously the power consumption.

关键词： Wireless Sensor Network Multihop transmission dijkstra algorithm Energy saving

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Transmission Technique based on dijkstra algorithm for decreasing energy consumption in WSNs 19

Energy-Efficient Transmission Technique based on Dijkstra Al...

引用

19th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA)

作者： Abderrahim, Maha Hakim, Hela Boujemaa, Hatem Touati, Farid Univ Carthage Higher Sch Commun Tunis COSIM Lab Tunis Tunisia Univ Sfax Digital Res Ctr Sfax Tunisia Qatar Univ Dept Elect Engn Doha Qatar

ISBN: (纸本)9781728112923

In this paper, we propose an energy-efficient multihop transmission technique for Wireless Sensor Networks (WSN) based on dijkstra algorithm. We consider a WSN composed of N sensor nodes. Firstly, we group the sensor nodes into clusters according to their placement in the monitoring area, then we organize the nodes within each cluster by electing the appropriate node as cluster head and classifying the remaining nodes into active nodes and sleeping nodes. Then, we select the set of reliable relays which cooperate to forward data with the least transmit power. Our proposed relay selection algorithm is based on dijkstra algorithm. The main contribution of the paper is to define a new transmission strategy that improves the results of our previous work proposed in [?] by better minimizing power consumption. Therefore, the proposed transmission technique can improve significantly the reduction of power consumption compared to the previous transmission technique. Simulations results prove that the new transmission technique based on dijkstra algorithm increases the energy savings to prolong the network lifetime.

关键词： Wireless Sensor Network election CH dijkstra algorithm power consumption energy saving

来源：评论

学校读者我要写书评

暂无评论

An improved dijkstra algorithm in GIS application

An improved Dijkstra algorithm in GIS application

引用

World Automation Congress (WAC)

作者： Xie, Dexiang Zhu, Haibo Yan, Lin Yuan, Si Zhang, Junqiao China Three Gorges Univ Coll Comp & Informat Technol Yichang 443002 Peoples R China

ISBN: (纸本)9781467344975

Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.

关键词： Shortest-path dijkstra algorithm Heap Object-oriented

来源：评论

学校读者我要写书评

暂无评论

The Storage of Weighted Directed Graph in Relational Database and Implementation of dijkstra algorithm 1

引用

International Conference on Computer Science and Education (CSE 2011)

作者： Li, Yanchen Feng, Yuan Hong, Feng Bi, Ying Ocean Univ China Coll Info Sci & Tech Qingdao Peoples R China Hisense Trans Tech Ltd Qingdao Peoples R China QingDao Hismile Coll Coll Bus Adm Qingdao Peoples R China

ISBN: (数字)9783642224560

ISBN: (纸本)9783642224553

As an important data structure, map is widely used in modern enterprise management software. Route planning, decision support, finding the critical path, and other activities all need the algorithms in graph theory. And once the map becomes more complex. it has to be stored in database. While the traditional adjacency matrix and adjacency list stored in the database have their limitations. If still achieve the appropriate algorithm using a programming language, software and database will exchange large amounts of data when the software and database are not in the same computer. So this method will inevitably affect the efficiency of the algorithm, and this situation is extremely difficult to optimize. Based on the characteristics of relational database, our paper designs a storage model of a directed graph in relational database. Using the SQL language and set operations, we successfully achieve the dijkstra algorithm. In the process of dijkstra algorithm, we use the mechanism of UPDATE in SQL instead of the inner loop steps in dijkstra algorithm, thus the time cost by database operations is reduced greatly and the efficiency is raised.

关键词： Weighted directed graph Relational database dijkstra algorithm Sql

来源：评论

学校读者我要写书评

暂无评论

Tsunami Simulation Based on dijkstra algorithm 17

Tsunami Simulation Based on Dijkstra Algorithm

引用

International Conference on Network-Based Information Systems (NBiS)

作者： Uchida, Kazunori Nogami, Shinsuke Takematsu, Masafumi Honda, Junichi Fukuoka Inst Technol Dept Commun & Informat Engn Fukuoka 8110295 Japan Elect Nav Res Inst Tokyo Japan

ISBN: (纸本)9781479942244

This paper is concerned with the proposal of a numerical method to predict the movement of tsunami wavefront by use of dijkstra algorithm. Data for sea depth and land height are assigned to the nodes of rectangular meshes and the data values at the points except for these node points are approximated by linear interpolation. The velocity of tsunami wavefront at any point is calculated in terms of the corresponding sea depth and thus its time distance from one node to another can be computed by using the geographic data at the nodes. Since the movement of any waves is governed by the Fermat principle, the movement of tsunami wavefront can be estimated based on the dijkstra algorithm. Some numerical examples are shown to demonstrate the effectiveness of the proposed simulation method for the movement of tsunami wavefront in complicated sea and land areas like a ria coast.

关键词： Tsunami Wavefront Prediction Ria Coast dijkstra algorithm Fermat Principle

来源：评论

学校读者我要写书评

暂无评论

Experimental Analysis on Path Planning Strategy using dijkstra algorithm and Follow the Carrot Method for Indoor Mobile Robot Navigation 5

Experimental Analysis on Path Planning Strategy using Dijkst...

引用

5th International Conference on Informatics and Computational Sciences (ICICoS)

作者： Afrisal, Hadha Syakur, Abdul Riyadi, Munawar Agus Nugraha, Ghanis Kauchya Nanda, Aan Aria Setiawan, Iwan Univ Diponegoro PUI PT CBIOM3S Dept Elect Engn Semarang Indonesia Univ Diponegoro Fac Engn Dept Elect Engn Semarang Indonesia

ISBN: (纸本)9781665438070

This research paper presents experimental analysis of global-local path planning strategy using dijkstra algorithm and Follow the Carrot method implemented in differential drive mobile robot for indoor delivery mechanism. Experiment results show that dijkstra algorithm performed an accurate, precise, and high stability of path planning strategy in supporting our indoor robot navigation. Experimental analysis has been performed to measure maximum positioning error, maneuverability of mobile robot, and accuracy of path tracking algorithm. Our research findings show that the more complicated the map in between the initial position and final position, the measured error rate has increased linearly. With a medium level of mobile robot's speed, which is set to 0.12 m/s, the measured maximum positioning error during path tracking process is 7.5 cm and the average positioning error is 2.5 cm. In terms of maneuverability, our mobile robot has demonstrated capability of coping with a sharp U-turn and eventually can correct its relative position to the targeted path.

关键词： path planning mobile robot dijkstra algorithm Follow the Carrot healthcare assistive robot

来源：评论

学校读者我要写书评

暂无评论

Timebase Dynamic Weight for dijkstra algorithm Implementation in Route Planning Software

Timebase Dynamic Weight for Dijkstra Algorithm Implementatio...

引用

1st International Conference on Intelligent Green Building and Smart Grid (IGBSG)

作者： Rosyidi, Lukman Pradityo, Hening Pram Gunawan, Dedi Sari, Riri Fitri Univ Indonesia Dept Elect Engn Depok Indonesia

ISBN: (纸本)9781467361217

This paper reviews dijkstra algorithm implementation in finding the shortest path for route planning. The regular shortest path algorithms do not consider the timebase dynamic traffic condition of road network, i.e the hourly changing of traffic density. Timebase dynamic weight for dijkstra algorithm compute the most efficient time and minimum fuel consumption based on the real condition of the traffic profiles of the road network. The traffic profiles describe the time needed to pass the road based on time which also differs for workdays and weekend. Simulation shows the implementation of Timebase Dynamic Weight for dijkstra algorithm can give better cost efficiency compared with the common Shortest Distance calculation and Traffic Avoidance calculation.

关键词： route planning shortest path timebase base dynamic traffic dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved Graph-based Depth-First algorithm and dijkstra algorithm program of police patrol

An improved Graph-based Depth-First algorithm and Dijkstra a...

引用

International Conference on Materials Science and Information Technology (MSIT 2011)

作者： Tie, Chunhua Shen, Yanchun Beijing Informat Sci & Technol Univ Coll Comp Beijing Peoples R China

ISBN: (纸本)9783037853191

The urban road network is abstracted as a directed graph in this paper, according to the theory of graph theory. It uses depth-first traversal algorithm of graph, and combining with dijkstra shortest path algorithm, futhermore ,these two algorithms are improved, so that, the model of this regional division are built which on city roads for patrol's police Alarm practical speed and distance as the verification conditions, we propose an efficient program for the city police patrol.

关键词： Graph Depth-First algorithm dijkstra algorithm Pratrol

来源：评论

学校读者我要写书评

暂无评论

Application of dijkstra algorithm in Path Planning for Geomagnetic Navigation 11

Application of Dijkstra Algorithm in Path Planning for Geoma...

引用

IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM)

作者： Liu, Qingya Xu, Hanchen Wang, Lihui Chen, Jin Li, Yaoming Xu, Lizhang Southeast Univ Sch Instrument Sci & Engn Nanjing Peoples R China Nanjing Inst Technol Sch Elect Power Engn Nanjing Peoples R China Jiangsu Univ Key Lab Modern Agr Equipment & Technol Zhenjiang Jiangsu Peoples R China

ISBN: (纸本)9781728119465

Path planning is one of the key technologies to realize the hidden navigation of underwater vehicles during long-haul. Path planning efficiency and accuracy are at the core of submarine track planning. Combining the navigation task with the geomagnetic map adaptability, the optimal path between the starting point and the target point is searched in the target space. The underwater geomagnetic navigation path planning model is established, and the principle and implementation method of dijkstra algorithm are analyzed. An underwater geomagnetic navigation path planning model is established, and the dijkstra algorithm is used for underwater geomagnetic navigation path planning. Combining different local windows in the adaptation area, the path planning calculation time and track cost are optimized. The simulation analyzes the influence of different local windows on the path planning in the adaptation area. The experiment results demonstrate that the dijkstra algorithm can effectively find the optimal path that satisfies the constraints.

关键词： path planning dijkstra algorithm adaptation area geomagnetic navigation

来源：评论

学校读者我要写书评

暂无评论

Application of improved dijkstra algorithm in intelligent ship path planning 33

Application of improved Dijkstra algorithm in intelligent sh...

引用

33rd Chinese Control and Decision Conference (CCDC)

作者： Zhu, Zhenyu Li, Lianbo Wu, Wenhao Jiao, Yang Dalian Maritime Univ Nav Coll Dalian 116026 Peoples R China

ISBN: (纸本)9781665440899

In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field, the topic of unmanned ship has become more and more popular in recent years, and the ability of collision avoidance path planning of unmanned ship is one of its key technologies, which is an important embodiment of its intelligence. In this paper, aiming at solving the path planning problem of unmanned ship in known environment map, using mathematical modeling software simulation, some algorithm fields of unmanned ship path planning are reproduced, and the running results of related algorithms are compared. dijkstra algorithm belongs to the single source shortest path algorithm. The original dijkstra classical algorithm is used to realize the path planning. The experimental results show that there are many unnecessary inflection points after using the dijkstra algorithm. The pheromone idea of ant colony algorithm is added to the classic dijkstra algorithm criterion. The experimental results show that the optimized algorithm can greatly reduce the redundant points in the process of path planning and reduce the moving cost of unmanned ship routing.

关键词： Unmanned ship Path planning obstacle avoidance Pheromone concentration dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：