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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

275 篇 会议
156 篇 期刊文献
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

379 篇 工学
- 184 篇 计算机科学与技术...
- 120 篇 电气工程
- 79 篇 控制科学与工程
- 60 篇 信息与通信工程
- 32 篇 交通运输工程
- 26 篇 机械工程
- 25 篇 仪器科学与技术
- 25 篇 软件工程
- 18 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 土木工程
- 13 篇 石油与天然气工程
- 11 篇 电子科学与技术（可...
- 9 篇 航空宇航科学与技...
- 8 篇 动力工程及工程热...
- 7 篇 化学工程与技术
- 7 篇 生物医学工程（可授...
- 6 篇 水利工程
- 6 篇 地质资源与地质工...
- 6 篇 环境科学与工程（可...
71 篇 理学
- 23 篇 数学
- 15 篇 物理学
- 10 篇 化学
- 9 篇 地理学
- 8 篇 地球物理学
- 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

语言

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

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

共 437 条记录，以下是271-280 订阅

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

详细简洁

排序：

Distributed grid location estimation scheme based on Euclidean distance

Distributed grid location estimation scheme based on Euclide...

引用

3rd IEEE Conference on Industrial Electronics and Applications (ICIEA 2008)

作者： Zi-xi, Jia Cheng-dong, Wu Yun-zhou, Mang Wen-dong, Xiao Northeastern Univ Coll Informat Sci & Engn Shenyang Peoples R China Inst Infocomm Res Singapore Singapore

ISBN: (纸本)9781424417186

In the research of wireless sensor networks, current location estimation techniques can generally be divided into direct approach and inferred approach, but their algorithms are too complicated to be used in practice. On the basis of the grid-based location estimation scheme (GLS), this paper represents a based on Euclidean distance distributed grid location estimation scheme (EDGLS), which seeks to predict the location of sensor nodes with respect to rectangular grid positions within the network area by using the hop counts these nodes are away from a number of fixed, known markers, and can save a great deal of energy in the whole network. Through the simulation on MATLAB, the results show that the location of EDGLS is more accurate and robust than that of GLS.

关键词： wireless sensor network location Euclidean distance dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Proposal of OpenFlow Controller to Improve Transfer Rate in Mesh Network 31

A Proposal of OpenFlow Controller to Improve Transfer Rate i...

引用

31st International Conference on Information Networking (ICOIN)

作者： Koh, Seawon Kim, Junho Lee, Sungwon Kyung Hee Univ Dept Comp Sci & Engn Yongin South Korea

ISBN: (纸本)9781509051243

In these days, the Internet is growing and the amount of user to use network increases rapidly. The mesh(ad-hoc) network has studied for many areas where people can't use the Internet. Also, mesh(ad-hoc) network is used for special purposes, and it expands its domain recently. However, low transfer rate and small coverage are a critical issue in mesh(ad-hoc) network. In this paper, it suggests improving transfer rate using BATMAN, Open vSwitch, and dijkstra algorithm. This paper has three section. In the first section, it suggests network architecture for improving transfer rate. This structure consists of network, controller, and storage. In the second section, it explains the algorithm for finding the optimal path using modified dijkstra algorithm. Finally, it shows the testbed to realize this proposal. We describe some advantage of controlling traffic flow.

关键词： wireless mesh(ad-hoc) network BATMAN Open vSwitch Open Source dijkstra algorithm SDN SDN controller

来源：评论

学校读者我要写书评

暂无评论

A New Practical algorithm for the Shortest Path Problem

A New Practical Algorithm for the Shortest Path Problem

引用

7th World Congress on Intelligent Control and Automation

作者： Liu, Pan Kou, Miao Huai Ping, Yu Guo Liang, Yin Shanghai Univ Sch Comp Engineer & Sci Shanghai Peoples R China Nanchang Univ Informat Engn Sch Nanchang Jiangxi Peoples R China

ISBN: (纸本)9781424421138

A novel Creed-backtracking algorithm (***) for the shortest path problem is proposed in this paper. Beginning with triples storage structure to save the data of a weighted directed graph, this paper lays emphasis on a series of greedy strategies and the GBA implementation, there follows the realization of the GBA with Java. In the end, satisfied results are obtained when we applied the GBA to one of lite social development projects. Compared with the dijkstra algorithm, to solve the shortest path between any, two points in graph, the average time efficiency of the GBA is increased by 75%.

关键词： shortest path Greed-Backtracking algorithm dijkstra algorithm control strategy

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Clustering Optimization for Multi-Channel Cooperative Sensing in CRNs

Multi-Objective Clustering Optimization for Multi-Channel Co...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Celik, Abdulkadir Kamal, Ahmed E. Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781479935123

Cooperative spectrum sensing (CSS) has been extensively studied in the literature to mitigate the weakness of spectrum sensing against hostile propagation phenomenon. Especially for large networks, clustered CSS is preferred to alleviate the energy efficiency, delay and overhead problems. In this study, reporting and sensing channels are first modeled with the consideration of path loss and fading. Then, CSS is divided into three phases: 1) In sensing phase, optimal sensing time is obtained for each local user subject to local detection and false alarm probability thresholds, 2) In reporting phase, adopting dijkstra's algorithm, multi-hop paths with the maximum success rate and cluster head (CH) selection which gives the mimimum total error rate within each cluster is computed, and 3) In decision phase, collecting independent but unidentically distributed (i.u.d.) member decisions, the CH decides on channel occupancy based on an optimal voting rule for i.u.d. reports. Next, following the phases above, a multi-objective clustering optimization (MOCO) is formulated to select SUs into cluster seeking energy and throughput efficiency goals subject to global detection and false alarm probability constraints. Finally, the Non-dominated Sorting Genetic algorithm-II (NSGA-II) is employed to solve MOCO. Results based on our approach are presented and the merits of this approach are demonstrated.

关键词： cognitive radio cooperative communication genetic algorithms probability radio spectrum management CRN CSS dijkstra algorithm MOCO NSGA-II channel occupancy cluster head selection cluster seeking energy cooperative spectrum sensing decision phase false alarm probability thresholds local detection local user maximum success rate multichannel cooperative sensing multiobjective clustering optimization nondominated sorting genetic algorithm-II optimal sensing time optimal voting rule reporting phase sensing phase throughput efficiency Cascading style sheets Clustering algorithms Fading Sensors Signal to noise ratio Throughput Wireless communication

来源：评论

学校读者我要写书评

暂无评论

An intelligent optimisation algorithm for vehicle path planning based on underground parking systems

An intelligent optimisation algorithm for vehicle path plann...

引用

International Conference on Intelligent Design (ICID)

作者： Zhang, Jiajing Zhang, Shida Zhao, Xin Li, Quanhu Inner Mongolia Univ Sch Elect & Informat Engn Hohhot Peoples R China

ISBN: (纸本)9781665414814

With the increasing number of vehicles, many large shopping malls, office buildings, hotels, stations, etc., are paying more and more attention to the construction of underground parking lots. Parking areas are constantly being expanded, and large underground parking lots are emerging. However, traditional parking management systems are aging and no longer meet the needs of today's society, thus creating the problem of parking difficulties in large underground parking lots. In this paper, a model of a large underground parking lot is constructed using MAKLINK graph theory firstly, and then, a parking path planning algorithm based on dijkstra algorithm and Ant Colony algorithm is proposed. Finally, we set up in an experimental setting on MATLAB with multiple scenarios to verify the superiority of the proposed algorithm, which provides new ideas for parking in large underground parking lots.

关键词： Path planning MAKLINK dijkstra algorithm Ant Colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Minimum End-to-End Transmission Delay Based Routing algorithm for VANETs 9

Minimum End-to-End Transmission Delay Based Routing Algorith...

引用

9th International Conference on Advanced Infocomm Technology (ICAIT)

作者： Peng, Shangxin Chai, Rong Chen, Qianbin Qin, Yuanzheng Chongqing Inst Posts & Telecommun Key Lab Mobile Commun Technol Chongqing Peoples R China

ISBN: (纸本)9781538636282

Vehicular ad hoc networks (VANETs) are expected to offer both safety-related applications and user applications for vehicular users. In this paper, we consider a VANET scenario where one source vehicle (SV) tends to transmit real-time messages such as security related information to its destination vehicle (DV). We assume that the DV is out of the one hop range of the SV, and study the routing algorithm between the SV and DV. Stressing the importance of transmission delay, we formulate the end-to-end transmission delay between the SV and DV as the total transmission delay experienced at intermediate relay vehicles (RVs) along the transmission route, and design an optimization problem which minimizes the end-to-end transmission delay subject to routing selection constraints. To tackle the difficulties in evaluating the transmission performance of intermediate RVs, we apply stochastic network calculus theory. By modeling the stochastic arrival curve of the SV and the stochastic service curve of the RVs, the transmission delay at each intermediate RV can be examined. We then map the network scenario as a weighted graph and apply dijkstra algorithm to obtain the optimal route between the SV and DV. Numerical results demonstrate the effectiveness of the proposed algorithm.

关键词： transmission delay stochastic network calculus routing algorithm dijkstra algorithm VANET

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Optimization Method based on Dimensionality Reduction Mapping for Path Planning of a HALE UAV

A Multi-Objective Optimization Method based on Dimensionalit...

引用

Chinese Automation Congress (CAC)

作者： Wang, Lan Li, Yuankai Univ Elect Sci & Technol China Sch Aeronaut & Astronaut Chengdu Peoples R China

ISBN: (纸本)9781728140940

The high-altitude long-endurance (HALE) unmanned aerial vehicles (UAV) have long flight distance and wide range of path coverage, mainly used to perform reconnaissance and strike missions. The distances of such UAVs need to be considered in calculation of the deviation caused by the curvature of the Earth. To avoid negative effects of the distances to path planning, in this paper, we proposed a path planning method based on dimensionality reduction mapping. First, we use Gauss positive projection to project the route data and the threat information from the geodetic coordinates to the Gauss plane coordinates to perform dimensionality reduction mapping. Then, we use multi-objective optimization dijkstra algorithm to obtain the optimal path with minimum total cost. Finally, Gauss inverse projection is applied to restore the optimal path at the geodetic coordinate system, providing the navigation information for HALE UAV. The simulation results have demonstrated that the method is suitable for calculating a path with large latitude and longitude range, and can be effectively used for path planning of a HALE UAV.

关键词： dimensionality reduction mapping Gauss projection dijkstra algorithm path planning UAV

来源：评论

学校读者我要写书评

暂无评论

Locomotion by Shortest Path and Obstacles Avoidance 2

Locomotion by Shortest Path and Obstacles Avoidance

引用

2nd IEEE-Pune-Section Annual International Conference (IEEE PuneCon)

作者： Patwardhan, Milind Kulkarni, Kimaya Mahajan, Apoorva Zambre, Yash Killedar, Shreya Vishwakarma Inst Technol E&TC Dept Pune Maharashtra India

ISBN: (纸本)9781728119243

This paper aims to deliver movement of the robot by finding and traversing the shortest path in the static present grid, using source and destination positions entered by the user. The robot currently requires a grid since it traverses space using line-tracing. Further addition to the functioning - the robot avoids static obstacles which might be present in its path towards destination. A microcontroller (AtMega2560) was used as an interface between the hardware and our software program. The robot used was Firebird V. For line-tracing, infrared LEDs (transmitters) and photodiodes (receivers) present on the robot were used. The popular dijkstra's algorithm had been incorporated in our shortest-path follower code. The language used for programming is AVR.

关键词： Microcontroller dijkstra algorithm Line tracing Source Destination grid

来源：评论

学校读者我要写书评

暂无评论

Detection and Dissipation of Road Traffic Congestion Using Vehicular Communication

Detection and Dissipation of Road Traffic Congestion Using V...

引用

Mediterranean Microwave Symposium

作者： Lakas, Abderrahmane Cheqfah, Moumena UAE Univ Coll Informat Technol Al Ain U Arab Emirates

ISBN: (纸本)9781424446643

Thanks to the advances in wireless technologies, mobile vehicular networks are likely to become the most relevant form of mobile ad hoc networks (MANET). Vehicular communication which facilitates the exchange of information between vehicles is the prerequisite not only for extending the access to Internet while on the road, but also to cater for special applications such as of road traffic and travel management. However despite the increasing studies on vehicular routing protocols, the support to applications other than the access the internet remains limited. In this paper we propose a novel vehicular communication system for road congestion detection and dissipation by disseminating and exploiting road information. The system is an integrated solution for sharing congestion information using a simple geocast protocol and a Dynamic dijkstra algorithm for planning and computing least congested travel itineraries. In this paper, through simulation results, we show that the proposed solution not only allows vehicles to detect road congestion ahead of time, but also contributes to reducing it by allowing vehicles to avoid congestion points.

关键词： VANET Vehicular communication Geocast Protocol Road Congestion dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Route Planning for Automatic Indoor Driving of Smart Cars 7

Route Planning for Automatic Indoor Driving of Smart Cars

引用

IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)

作者： Roy, Sandip Zhang, Zhiyang Tongji Univ Sch Software Engn Shanghai Peoples R China

ISBN: (纸本)9781728167855

While various types of traffic navigation maps play an important role in our life, the complex layout of large number of buildings in the city makes it difficult for people to find destinations and walking routes indoors. Since GPS does not work very accurately inside the buildings, for indoor navigation problem we still have to depend on the traditional front desk human resource consultation. In recent years, the rapid development of artificial intelligence technology has made it possible for smart car navigation instead of the manual consultation. Not only that, smart cars can even handle short-distance goods transportation. Combining indoor positioning technology with different video signals or any other non-GPS satellite positioning technology for directing the smart car to the designated position is a hot research direction these days. In this paper, we mainly study the realization and application of a smart car in the indoor automated driving system. Our proposed smart car, built using the Raspberry Pi 3, uses a series of famous path planning algorithms such as dijkstra's algorithm, Best priority search and A*(A star) algorithm to plan the driving path of the car's automatic driving. Finally, the real-time obstacle avoidance function is also realized by using ultrasonic ranging, infrared ranging and pan-tilt camera. Several experiments were conducted to compare the efficiency of using different path finding algorithms and the results of using infrared ranging and ultrasonic ranging during obstacle avoidance.

关键词： raspberry Pi smart car ultrasonic ranging polar map A* algorithm dijkstra algorithm best priority search indoor route planning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：