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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

LAN Network Optimization after a DDoS Attack Detected with Supervised Learning 2

LAN Network Optimization after a DDoS Attack Detected with S...

引用

IEEE 2nd International Conference on Computer Communication and Artificial Intelligence (CCAI)

作者： Vallejo-Huanga, Diego Vizcaino, Santiago Univ Politecn Salesiana IDEIAGEOCA Res Grp Quito Ecuador Univ Politecn Salesiana Dept Comp Sci Quito Ecuador

ISBN: (纸本)9781665496636

The Distributed Denial of Service (DDoS) attack is one of the most dangerous cyberattacks on the Internet, so can affect any server on any type of network, causing connectivity problems and even total loss of services. Machine learning can solve computational security problems and is frequently used to defend against cyber attacks. This article proposes the construction of a network topology where several DDoS attacks were applied, which will be detected by three Machine Learning classification algorithms. A dataset was generated from the collection of packets circulating in the network with samples of normal traffic and malicious packets, on which the experimental tests were carried out. In the classification task, the best performing supervised learning algorithm was Random Forest, with an accuracy of 100%. Finally, upon detecting a DDoS attack on the network, dijkstra's optimization algorithm is applied to find an alternative route to mitigate network oversaturation. Two scenarios were proposed, the first analyzes the optimal route in an attacked network and the second without attacks. The results show a reconfiguration in the network to avoid routes where DDoS attack detection was applied.

关键词： cybersecurity malicious traffic detection machine learning random forest support vector machine logistic regression dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Parking Guidance algorithm Based on Time-Optimal Dynamic Sorting for Underground Parking 26

A Parking Guidance Algorithm Based on Time-Optimal Dynamic S...

引用

26th International Conference on Geoinformatics (Geoinformatics)

作者： Yuan, Lingyun Huang, Runfei Han, Lijing Zhou, Manman Yunnan Normal Univ Sch Informat Sci & Technol Kunming Yunnan Peoples R China Guangzhou Lanqi Network Technol Co LTD Guangzhou Guangdong Peoples R China Yunnan Normal Univ Minist Educ Key Lab Educ Informat Nationalities Kunming Yunnan Peoples R China

ISBN: (纸本)9781538676196

In recent years, more and more large underground parking lots have been constructed. Under the influence of many factors like the poor lighting of parking lots, and the complex distribution of parking spaces, it is hard to park in the underground parking lots. Considering this fact, it is substantially important to choose for users an good parking space with the best comprehensive performance. Using the structure of underground garage as the modeling background, and based on the dijkstra algorithm, a parking space guidance algorithm based on time-optimal has been proposed in this paper. The simulation experiment results show that when using the proposed approach, the required time for the users to park is about half the time saved based on the shortest distance scheme. Moreover, this algorithm can also guarantee to provide the shortest path navigation for each user, which could reduce the issues of waiting for queuing and traffic congestion in parking lot to a large extent, and then improve the efficiency of the parking lot management and enhance user's experience.

关键词： Time-optimal path dynamic sorting parking guidance dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of shortest path routing algorithms in wide all-optical WDM networks

Performance Evaluation of shortest path routing algorithms i...

引用

International Conference on Multimedia Computing and Systems (ICMCS)

作者： Zyane, Abdellah Guennoun, Zouhair Taous, Omar Cadi Ayyad Univ Dept Comp Sci Natl Sch Appl Sci ENSAS Safi Morocco Mohammadia Sch Engn EMI LEC Elect & Commun Lab Rabat Morocco

ISBN: (纸本)9781479938247

This paper presents the effects of shortest path routing in wavelength-routed optical WDM networks;in particular we evaluated the effect of this routing scheme on the performance of wide all-optical WDM networks. Given a session request and a number of available wavelengths on each optical fiber, the routing and wavelength assignment (RWA) problem is to establish a lightpath (routing subproblem), i.e., to determine a path between two nodes, and also assign a wavelength along this path (wavelength assignment subproblem), so to maximize the number of satisfied requests for connections by taking into account some constraints. This study focuses on the routing subproblem in wavelength-routed all-optical WDM networks. We use dijkstra's shortest path algorithm, to determine the shortest paths in terms of the number of hops (we assume that the links have the same weight, uniform traffic) from the source to other nodes in the network. We evaluate, for the first time, the performance of this algorithm for optical routing and we study the impact on the load distribution over the wide all-optical WDM network links. We also implement a simulation interface to evaluate this algorithm in wide all-optical WDM networks (different optical networks topologies were used in the simulation). This paper describes the inadequacy of the use of standard dijkstra's shortest path routing, as it produces more unbalanced routes over the network links and unnecessary link overload.

关键词： All-Optical Networks Shortest path Performance Evaluation Optical routing dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Distributed Self-Reconfiguration Planning algorithm for Modular Satellites 41

A Distributed Self-Reconfiguration Planning Algorithm for Mo...

引用

第41届中国控制会议

作者： Xiaoman Tian Bing Xiao School of Automation Northwestern Polytechnical University

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

As a new form of space operation,modular satellites system is usually composed of multiple modules with uniform docking interfaces that can be transformed into different configurations by themselves to achieve on-orbit variable *** reconfiguration path planning problem is finding what sequence of actions are required for a configuration to transform into *** this paper,we present a novel self-reconfiguration planning algorithm based on the graph theory to support multi-module motion simultaneously for modular *** method gains homogeneous and reconstruction parts by comparing the initial configuration with goal configuration *** is not only can reduce the number of participating in reconstruction modules but also improve the efficiency of *** the reconfiguration actions can be executed using dijkstra algorithm so that each module can efficiently finish its reconfiguration task which results in a global reconfiguration for the *** The priority motion function to solve local conflict between ***,reconfiguration examples are provided and results verify the feasibility and superiority of the proposed algorithm.

关键词： Modular satellites Self-reconfiguration planning Graph theory Multiple modules dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Propagation models and physical layer quality criteria influence on Ad hoc networks routing

Propagation models and physical layer quality criteria influ...

引用

7th International Conference on Intelligent Transport Systems Telecommunications

作者： Delahaye, Ruddy Poussard, Anne-Marie Pousset, Yannis Vauzelle, Rodolphe Univ Poitiers SIC Bat SP2MITeleport 2Bd Marie & Pierre CurieBP 3 F-86962 Futuroscope France

ISBN: (纸本)9781424411771

Modelling of the physical layer is an important factor in ad hoc wireless networks simulation. Thus, the aim of this study is to investigate a realistic physical layer simulator. More precisely, this last one is able to quantify each radio link by various physical layer criteria, thanks to a propagation model, and after compute the optimal route between a source and a destination by using the dijkstra algorithm.

关键词： ad hoc networks realistic physical layer propagation model quality criteria optimal route dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the Optimization of Freight Transport Route under the Condition of High-speed Railway 6

Research on the Optimization of Freight Transport Route unde...

引用

6th International Conference on Electromechanical Control Technology and Transportation (ICECTT)

作者： Wang, Jiaqi Zhao, Yu Beijing Jiaotong Univ Sch Traff & Transportat Beijing Peoples R China

ISBN: (数字)9781510650398

ISBN: (纸本)9781510650398;9781510650381

With the rapid development of China's high-speed railway, the development of high-speed railway freight for specific goods has become a future development trend. Under the premise of operating freight high-speed EMU trains, this paper considers freight high-speed EMUs into the multimodal transport system to seek a transportation plan that minimizes total transportation cost under a certain time constraint. This paper builds a model based on the theory of multimodal transport, uses dijkstra algorithm and K shortest path algorithm to design the algorithm, and finally verifies the model and algorithm with an example. The results show that the model and algorithm are feasible and can provide references for practical problems.

关键词： High-speed rail freight Multimodal transport Route optimization dijkstra algorithm K shortest route algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fast Path Planning algorithm for Route Guidance System

A Fast Path Planning Algorithm for Route Guidance System

引用

IEEE International Conference on Systems, Man and Cybernetics (SMC)

作者： Selamat, Ali Zolfpour-Arokhlo, Mortaza Hashim, Siti Zaiton Selamat, Md Hafiz Univ Teknol Malaysia Fac Comp Sci & Informat Syst Utm Skudai 81310 Johor Malaysia

ISBN: (纸本)9781457706530

Path planning is applied in a variety of ways, including transportation, telecommunications, etc. Path planning to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the motoring time and to ensure and efficient use of available road resources is the main challenge in route guidance system. In this paper we propose a fast path algorithm for finding the best shortest paths in the road network. This is poised to minimize costs between the origin and destination nodes. The proposed algorithm was compared with the dijkstra algorithm in order to find the best and shortest paths using a sample of Tehran city road network. Three cases were tested through simulation using the proposed algorithm. The results show that the efficiency of proposed algorithm and could reduce the cost of vehicle routing on the path planning problems.

关键词： Route guidance system (RGS) path planning shortest path problem (SPP) dijkstra algorithm urban road network (URN)

来源：评论

学校读者我要写书评

暂无评论

A Routing Computation Strategy Based on Improved Clustering algorithm

A Routing Computation Strategy Based on Improved Clustering ...

引用

2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Zhao Jian-peng Guo Shi-ze Zheng Kang-feng Hu Yi-xun Dai Fang-fang Beijing Univ Posts & Telecommun Informat Secur Ctr Beijing 100876 Peoples R China Northern Elect Instrument Inst Beijing 100191 Peoples R China

ISBN: (纸本)9780769549354

A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and dijkstra (CAKD) in topology partitioning. The routing information of each node can be computed during the clustering process, and CAKD reduces the time cost in routing computation and the storage in storing routing information. Experiments showed that, compared with using dijkstra to cluster, CAKD cost less time. Meanwhile, compared with the strategy of global shortest path, the routing computation strategy based on improved clustering algorithm costs less storage in storing routing information.

关键词： routing computation strategy K-means algorithm dijkstra algorithm topology partitioning

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Fingerprint Data Retrieval Based C-Means Clustering Model 11

Large-Scale Fingerprint Data Retrieval Based C-Means Cluster...

引用

11th International Conference on Information Technology - IoT and Smart City (ITIoTSC)

作者： Wang, Decai Zhang, Weibing Chang, Xia Gao, Yuelin Key Lab Intelligent Informat & Big Data Proc Ning Yinchuan 750021 Ningxia Peoples R China North Minzu Univ Sch Math & Informat Sci Yinchuan 750021 Ningxia Peoples R China

ISBN: (纸本)9798350328356;9798350328349

In the field of biometric identification, fingerprints, as one of the most unique and persistent biometric features, are widely used for identification. With the popularity of fingerprint recognition in society, how to quickly retrieval fingerprints is a challenging task in large-scale databases. In order to ensure the accuracy of fingerprints retrieval, we propose a new retrieval model based on minutia *** introduce fuzzy C-means clustering algorithm and dijkstra *** C-means clustering is used to extract the detail point features in the fingerprint,dijkstra algorithm to solve the shortest path of the minutia *** number of features and the shortest path distance are compared to determine whether the fingerprints are the same. In this way,our method can achieve fast *** addition, we conducted extensive experiments on a large-scale datasets and tested the correctness of the experiments by different filtering levels to demonstrate the superiority of our method for fingerprint retrieval.

关键词： Fingerprint Retrieval fuzzy C-means clustering dijkstra algorithm Fingerprints minutia

来源：评论

学校读者我要写书评

暂无评论

PMA Partition Method of Water Distribution Network Combined with Gragh Theory 18th

PMA Partition Method of Water Distribution Network Combined ...

引用

18th International Conference on Water Distribution System Analysis (WDSA)

作者： Gao, Jinliang Yao, Fang Xu, Yongpeng Sun, Guosheng Zheng, Chengzhi Qi, Shihua Cui, Fuyi Harbin Inst Technol Harbin 150090 Heilongjiang Peoples R China Guangdong Holding Ltd Shenzhen 518021 Guangdong Peoples R China

A method are proposed combining PMA partition and graph theory with four parts. Using adaptive Affinity Propagation (AP) clustering algorithm with consideration of economic benefit to preliminarily partition water distribution network(WDN) and reasonably determine the partition number. Calculate the shortest path between the clustering centre and water source by dijkstra algorithm and determine water supply inlet of each region. Establish topology discrete optimization model to determine partition boundary, then applying simulated annealing algorithm to solve the model. Vertically and horizontally combining the partitioned areas to ensure the safety of water supply. This method has been applied to the WDN of Y city to control the pressure for the areas with a certain results. (C) 2016 The Authors. Published by Elsevier Ltd.

关键词： Water distribution network leakage control PMA partition graph theory AP clustering algorithm dijkstra algorithm simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：