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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

436 篇 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

语言

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

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

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

A solution to best itinerary problem based on strategy set under dijkstra algorithm

A solution to best itinerary problem based on strategy set u...

引用

2nd International Conference on Measurement, Instrumentation and Automation (ICMIA 2013)

作者： Nanchu, Guo Suzhou Vocat Univ Suzhou 215104 Peoples R China

ISBN: (纸本)9783037857502

The "best" itinerary problem has been a heat topic for several decades. Among those sophisticated methods used for choosing paths, dijkstra algorithm is a simple but powerful method. However, dijkstra algorithm is restricted because of 3 reasons. Firstly, the weight of each path must be a constant value. Secondly, the algorithm only represents the "best" path, disregards the second and third "best" paths. Thirdly, the weights only represent a single variable, which cannot be used to represent two different variables simultaneously. In this paper, we use a Filtering algorithm based on Lagrange relaxation method and ordinal selection to overcome these weaknesses. In our OLR dijkstra algorithm, strategy set of choosing paths shows a strong stability and reliability facing different probabilities situations. Only 13.2% diversity degree was found when path efficiency varied from 100% to 11.1%. Smallest time complexity of the OLR dijkstra algorithm is 2 times than normal Dijsktra, which is (2 log(N) * E).

关键词： itinerary problem strategy dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Discrete Ray Tracing Method Based on dijkstra algorithm for 3D Propagation Environments 29

A Discrete Ray Tracing Method Based on Dijkstra Algorithm fo...

引用

IEEE 29th International Conference on Advanced Information Networking and Applications Workshops WAINA 2015

作者： Uchida, Kazunori Fukuoka Inst Technol Dept Commun & Informat Engn Fukuoka 8110295 Japan

ISBN: (纸本)9781479917754

In this paper is proposed a discrete ray tracing method by using dijkstra algorithm (DA) for electromagnetic field computation in complicated 3D propagation environments such as urban areas and random rough surfaces. The geometry of the problem is constructed by introducing several rectangular obstacles existing in 3D free space. The computational space including obstacle regions is divided into regularly arrayed rectangular solids with nodal points corresponding to their apexes. The connectivity between two nodes, necessary for the DA, is allowed only for the 26 proximate nodes. The apexes of adjacent 8 rectangular solids and the link cost of the connected two nodes are given by the traveling time of optical ray. Thus, the conventional DA provides the total cost matrix and proximity matrix from which the shortest paths from a source node to other nodes can be obtained. Some modifications are made for the original results based on the conventional DA, thus the costs among source, apex and wedge can be replaced by the costs of straight rays among them. The proximity matrix is modified and all rays can be expressed in terms of straight lines between source and wedge (or apex), wedge (or apex) and wedge (or apex). The computed rays are modified to discriminate the shadow and illuminated boundaries correctly. The numerical examples are shown in 2D and 3D ways to demonstrate the effectiveness of the proposed method.

关键词： dijkstra algorithm Ray Tracing Discrete Ray Tracing Method Diffraction Propagation

来源：评论

学校读者我要写书评

暂无评论

Research on the new route choice method of main optical cables based on dijkstra algorithm - A case study of Guanyun County

Research on the new route choice method of main optical cabl...

引用

15th International Conference on Geoinformatics

作者： Zhang, Mei Gu, Xiaoyun Chen, Zhenjie Li, Xue Su, Mo Nanjing Univ Dept Geog Informat Sci Nanjing 210093 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Sch Light & Elect Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9780819469144

Up until now, the optical cable network has covered many cities of China. However, there are still so many middle or small sized cities which are not connected to the grid backbone optical cable network of the country. It is urgent to connect these middle or small sized cities into the backbone optical cable network of the country as soon as possible. However, up until now, little work has been done to find a better way for route choice of main optical cables, including those based on GIS methods. This paper proposes a new method for route choice of main optical cables, i.e., the method for route choice of main optical cables based on dijkstra algorithm. In this paper, a model for route choice of main optical cables is built, the influencing factors are chosen and quantified according to the specific situation of Guanyun County, and the route of the main optical cables of Guanyun is chosen and drawn on the map. The result shows that the method proposed by this paper has more potentials than the traditional method used in Guanyun County.

关键词： route choice main optical cables dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comparative Study Of Various Approaches Of dijkstra algorithm

Comparative Study Of Various Approaches Of Dijkstra Algorith...

引用

International Conference on Computing, Communication, and Intelligent Systems (ICCCIS)

作者： Verma, Divyam Messon, Devansh Rastogi, Mayank Singh, Amit Univ Petr & Energy Studies Sch Comp Sci Dept Informat Dehra Dun Uttarakhand India

ISBN: (纸本)9781728185293

dijkstra algorithm is not improved in terms of space and time-complexity, the algorithm is muddled to apply in network analysis for enormous test cases. To handle this huge time complexity, advanced structures are applied to enhance dijkstra algorithm. The use of a keen and numerical procedure speeds up the enhanced dijkstra by multiple times. In this paper four approaches using advanced data structures like linked list, Fibonacci heap, binary heap and bi-directional dijkstra are applied and their performance is also analyzed and compared on two classes of graphs, dense and sparse graphs.

关键词： dijkstra algorithm graphs binary heap Fibonacci heap Linked List

来源：评论

学校读者我要写书评

暂无评论

Improved dijkstra algorithm based on a new storage method

Improved Dijkstra algorithm based on a new storage method

引用

International Conference on Neural Networks, Information and Communication Engineering

作者： Wang, Junjie Liu, Yingqiao Tang, Bo Jin, Xiaoling Xiao, Yang Guilin Univ Elect Technol Coll Math & Comp Sci Guilin Peoples R China

ISBN: (数字)9781510647381

ISBN: (纸本)9781510647381;9781510647374

Shortest path algorithm is the basis of many optimization problems such as resource allocation and optimal path planning It is very meaningful to study the shortest path algorithm, because it can reflect the efficiency. We propose an improved dijkstra algorithm based on a new storage method, which improves the shortcomings of the dijkstra algorithm to a certain extent by constructing the map of the forward star by the chain The experimental results show that our improved algorithm is more effective than the classical algorithm. We provide an effective method for the analysis and application of actual large graph theory problems.

关键词： dijkstra algorithm storage structure shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：