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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是111-120 订阅

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

详细简洁

排序：

Big Temporally-Detailed Graph Data Analytics

Big Temporally-Detailed Graph Data Analytics

引用

作者： Gunturi, Venkata Maruti Viswanath University of Minnesota

学位级别：Ph.D.

Increasingly, temporally-detailed graphs are of a size, variety, and update rate that exceed the capability of current computing technologies. Such datasets can be called Big Temporally-Detailed Graph (Big-TDG) Data. Examples include temporally-detailed (TD) roadmaps which provide typical travel speeds experienced on every road segment for thousands of departure-times in a typical week. Likewise, we have temporally-detailed (TD) social networks which contain a temporal trace of social interactions among the individuals in the network over a time window. Big-TDG data has transformative potential. For instance, a 2011 McKinsey Global Institute report estimates that location-aware data could save consumers hundreds of billions of dollars annually by 2020 by helping vehicles avoid traffic congestion via next-generation routing services such as eco-routing. However, Big-TDG data presents big challenges for the current computer science state of the art. First, Big-TDG data violates the cost function decomposability assumption of current conceptual models for representing and querying temporally-detailed graphs. Second, the voluminous nature of Big-TDG data can violate the stationary ranking-of-candidate-solutions assumption of dynamic programming based techniques such Dijsktra’s shortest path algorithm. This thesis proposes novel approaches to address these challenges. To address the first challenge, this thesis proposes a novel conceptual model called, "Lagrangian Xgraphs," which models non-decomposability through a series of overlapping (in space and time) relations, each representing a single atomic unit which retains the required semantics. An initial study shows that Lagrangian Xgraphs are more convenient for representing diverse temporally-detailed graph datasets and comparing candidate travel itineraries. For the second challenge, this thesis proposes a novel divide-and-conquer technique called "critical-time-point (CTP) based approach," which efficiently divides t

关键词： Databases Graphs Optimization shortest path algorithm Spatial Network

来源：评论

学校读者我要写书评

暂无评论

Infrastructureless Inter-Vehicular Real-Time Route Guidance

Infrastructureless Inter-Vehicular Real-Time Route Guidance

引用

11th IEEE International Conference on Intelligent Transportation Systems (ITSC 2008)

作者： Hawas, Yaser E. Napenas, Marc Joseph B. UAE Univ Dept Civil & Environm Engn Coll Engn Al Ain 17555 U Arab Emirates UAE Univ RTTSRC Al Ain 17555 U Arab Emirates

ISBN: (纸本)9781424421114

This paper presents an inter-vehicular communication (IVC)-based algorithm for real-time route guidance in urban traffic networks. It is built on information sharing among some searcher vehicle and candidate vehicles traveling in the same direction, to the same destination and within a specific communication range. The paper discusses in details (he algorithmic procedure and conditions for information sharing. A microscopic simulation model is utilized to assess the effectiveness of the algorithm against another benchmark algorithm;namely, centralized shortest path algorithm. Comparisons of the two algorithms' average travel time, and overall network productivity are presented. The algorithms performances are captured for various scenarios reflecting network congestion levels, link speeds and link lengths.

关键词： Inter-vehicular communication real-time route guidance microscopic simulation shortest path algorithm network sizes network performance

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Data Communication Using Hybrid NoC for Low Latency and High Throughput on FPGA 1

引用

International Conference on Cognitive Informatics and Soft Computing (CISC)

作者： Amaresh, C. Jatti, Anand RV Coll Engn Bangalore Karnataka India

ISBN: (数字)9789811514517

ISBN: (纸本)9789811514517;9789811514500

The perception of the theory of communication network has led to enormous supplanting committed to simplex, duplex system in terms of various scales of interconnecting systems and switches. Each data interactive system needs to have a smart way for the design of efficient and tolerant system in terms of adaptability, versatility, execution, and effective data delivery. In this peculiarity, the system architects demand for a novel network on-chip router which is error free and minimized circuit path with greater packet delivery ratio, minimum delay, and better bandwidth utilization. In this paper, we propose the modeling of network architecture in consideration with 8 x 8 switch router which indulges the suitable algorithm for shortest path finder, i.e., minimum spanning tree, for efficient routing in run-time. We have demonstrated warmhole technique and virtual cut-through mechanisms for automatic correction with validating errors. So, we have selected verilog HDL for development under the environment of VIVADO Xilinx 2018-1 and demonstrated on Nexys DDR-4 Artix-7 Field Programmable Gate Array family bearing part number XCA7CGS100t comprised of 324 pins with the results it is noticed that better reliability and minimized latency of 36.5% with enhanced throughput reaching 40% than the existing router. The proposed design is acceptable in terms of better performance in terms of area, delay, and resource allocation.

关键词： Communication switch Error FPGA HDL NoC Router shortest path algorithm Topology Switching Power reduction schemes and encoder and decoder

来源：评论

学校读者我要写书评

暂无评论

Line Maze Robot Training Course for the Senior High School Students

Line Maze Robot Training Course for the Senior High School S...

引用

International Conference on Mechatronics and Control Engineering (ICMCE 2012)

作者： Lee, Chyi-Shyong Su, Juing-Huei Huang, Hsin-Hsiung Fu, Sin-Mao Lunghwa Univ Sci & Technol Dept Elect Engn Taoyuan Cty Taiwan

ISBN: (纸本)9783037855959

A line maze robot training course, which contains the hardware circuit implementation, firmware programming skills and the shortest path algorithm, is presented in this paper. The training course is used for vocation senior high school teachers and students. The major topic for students is to develop the proper firmware programming to achieve the better performance and students are encouraged to pass the small contest in the end of the workshop. The low-cost educational platform is easily by the economically disadvantaged students. Students, who join the workshop can learn the basic C language, the firmware programming skills for microcontrollers, the concept of the shortest path algorithm for line maze robot, just spend less $40 USD to buy the robots. The contributions of this training course are as follows: 1) studying the hardware implementation knowledge, 2) developing microcontroller-related firmware programming skills, 3) learning motion control skills of the line maze robot, and 4) learning line-maze solving algorithms. Few students, who join this training workshop and learn the related hardware, firmware and algorithm, can find the shortest path form source to target in the line map. The feedback of the most students shows that the training course gives them the motivation to actively learn the necessary practical skills to design the firmware programming to guide the line maze robot.

关键词： Line maze robot motion control firmware programming shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of Electric Vessels Test Routes Using Image Processing and Optimization Techniques 9th

Design of Electric Vessels Test Routes Using Image Processin...

引用

9th Workshop on Engineering Applications (WEA)

作者： Uribe, Alejandro Calvache, Miguel Alvarez, Camilo Montoya, Alejandro Univ EAFIT Sch Appl Sci & Engn Carrera 49 N 7Sur 50 Medellin 05001 Antioquia Colombia

ISBN: (纸本)9783031206108;9783031206115

Vessels are one of the transportation modes with high contribution to global warming and air pollution since their operation depends mostly on the use of fossil fuels. Given a large number of navigable rivers and the need for rural transportation in small and intermediate cities in Latin America, these vehicles are widely used, thus the need to propose sustainable alternatives arises. The ENERGETICA 2030 program is developing an electric vessel for passenger transportation between the municipalities ofMagangue and Pinillos in Colombia;however, tests must be designed to replicate the operating conditions in a controlled environment. In this paper, we propose a method for route design based on image processing and optimization algorithms. Through the OpenStreetMap API, we extracted information from water bodies in images, then using the skeletonization method, we created graph structures and by means of the Dijkstra and Backtracking algorithms, the minimum distance feasible routes were selected. The Puerto Berrio (PB) - Puerto Nare (PN), Puerto Nare - Puerto Triunfo (PT) and Guatape dam routes were chosen for the case study. It was found that to represent the exact distance of the Magangue - Pinillos route, the tests must be performed at the Guatape dam. In case of giving priority to the similarity between segments, the PB - PN route must be selected. In future work we will consider obtaining real-time water level information and to strengthen the optimization algorithms to repeat nodes visited in the route evaluation.

关键词： Image processing Skeletonization shortest path algorithm Backtracking Water bodies

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimum Support Structure Generation for Additive Manufacturing using Unit Cell Structures and Support Removal Constraint 44

Optimum Support Structure Generation for Additive Manufactur...

引用

44th North American Manufacturing Research Conference (NAMRC)

作者： Vaidya, Rohan Anand, Sam Univ Cincinnati Ctr Global Design & Mfg Dept Mech & Mat Engn Cincinnati OH 45221 USA

Additive Manufacturing (AM) is the process in which a part is built using a layer by layer approach. Due to the inherent nature of the process, support structures are required to support overhanging features while building a part by AM. Support Structures increase the build time and cost of manufacturing and also have an adverse effect on the surface finish of the part. This paper presents a new approach for minimizing support structures using space filling cellular structures in conjunction with Dijkstra's shortest path algorithm to generate optimized support structures. Further, additional support accessibility constraints are applied to the support generation algorithm to ensure the ease of removal of the supports after manufacturing the part. The algorithm is validated by simulating the supports for two test parts while performing FEA analysis to test whether the generated structures are capable of supporting the weight of the part. A third test case is presented to verify the results of the algorithm using the support accessibility constraint.

关键词： Additive Manufacturing Support Structures Optimization Unit cells shortest path algorithm Support Accessibility

来源：评论

学校读者我要写书评

暂无评论

Dealing with Loop-based Map by Line Maze Robot Training Kit

Dealing with Loop-based Map by Line Maze Robot Training Kit

引用

International Conference on Mechatronics and Control Engineering (ICMCE 2012)

作者： Huang, Hsin-Hsiung Su, Juing-Huei Lee, Chyi-Shyong Chang, Yi-Wei Syu, Jheng-Yan Lunghwa Univ Sci & Technol Dept Elect Engn Tao Yuan Taiwan

ISBN: (纸本)9783037855959

A line maze robot training kit, which is able to deal with the loop-based cyclic map, is presented to teach the topics of the hardware circuit, firmware programming for motion control and the algorithm for the cyclic paths detection. The training course is used for the senior high school students. The objectives of this work are to train the practical skills, including the concept of the hardware circuit, the motion control with the corresponding firmware programming and the algorithm for the loop-based map. Students, who attended the training course, can learn the basic programming language, the controlling concept for microcontrollers. Moreover, students learn the rules of the line maze contest, including setting for source and target of the map. How to determine the target position according to the optical sensors in front of the line maze robot and how to control the two DC motors are also illustrated. In the workshop, a Matlab simulator is used to train students how to design a feasible map and perform the algorithm to find the shortest path from the source to target. The feedback from most students is that the training kit makes them be interested in robot game and increases the motivation to actively learn the firmware and the shortest path algorithm.

关键词： shortest path algorithm the loop-based map line maze robot encoder circuit speed control

来源：评论

学校读者我要写书评

暂无评论

Node Constraint Routing algorithm based on Reinforcement Learning 13

Node Constraint Routing Algorithm based on Reinforcement Lea...

引用

13th IEEE International Conference on Signal Processing (ICSP)

作者： Dong, Weihang Zhang, Wei Yang, Wei UESTC Res Inst Elect Sci & Technol Chengdu Sichuan Peoples R China

ISBN: (纸本)9781509013456

Also named as the path-finding algorithm, the routing algorithm aims at finding a good way between the source point and destination point under some constraint conditions (the path "cost" is the lowest). Specifying part of necessary nodes by the algorithm, the node constraint routing algorithm finds the "good" path and must pass the necessary nodes without the loop;otherwise, the path is invalid. The node constraint shortest path problem is regarded one HP-Hard problem, and the current research generally adopts the violent algorithm or the screening function approach (screen out some paths passing the most of the currently necessary nodes);however, these methods have the loop or own much high time complexity or space complexity, which easily causes the intermittent interruption of the path loop or the network. For the end-to-end node constraint path-finding problem of the common directed network graph, this thesis designs one heuristic search algorithm based on the reinforcement learning the breadth-first traversal;the algorithm adopts thought of combining the breadth-first search and the greedy algorithm to expand the path, adopts the reinforcement learning to predict and screen the importance degree of the path as well and finally gets the path passing all the necessary nodes. The simulation experiments result demonstrates that the algorithm proposed by the thesis can be applicable to the network graph with the larger scale, has good performance in the path weight and the computing time and is regarded as one practically applicable algorithm.

关键词： node constraint routing algorithm reinforcement learning breadth first search shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Inter-building Routing Approach for Indoor Environment 17th

Inter-building Routing Approach for Indoor Environment

引用

17th International Conference on Computational Science and its Applications (ICCSA)

作者： Dionti, Tiara Annisa Adhinugraha, Kiki Maulana Alamri, Sultan Mofareh Telkom Univ Sch Comp Bandung Indonesia Saudi Elect Univ Coll Comp & Informat Dammam Saudi Arabia

ISBN: (纸本)9783319623924;9783319623917

Routing system has been implemented in the outdoor routing and the indoor routing. There are significant differences that make indoor routing is more complex than outdoor routing, which is the outdoor routing implements two dimensional spaces, while at the indoor routing allows the routing of the three dimensional spaces that represent multi-level building. This research concern about the prototype development of the inter-building routing system. The construction of this prototype needs to consider both outdoor and indoor routing. shortest path algorithms could be implemented after the construction of three dimensional spaces spatial data structure in order to inform the users about the shortest route between two points in indoor spaces.

关键词： Spatial Inter-building rout Three dimensional spaces Graph shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：