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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

144 篇 会议
89 篇 期刊文献
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

205 篇 工学
- 113 篇 计算机科学与技术...
- 58 篇 电气工程
- 47 篇 控制科学与工程
- 29 篇 软件工程
- 24 篇 信息与通信工程
- 16 篇 机械工程
- 10 篇 电子科学与技术（可...
- 10 篇 交通运输工程
- 9 篇 仪器科学与技术
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 4 篇 力学（可授工学、理...
- 4 篇 材料科学与工程（可...
- 4 篇 动力工程及工程热...
- 4 篇 石油与天然气工程
- 3 篇 水利工程
- 3 篇 城乡规划学
- 2 篇 化学工程与技术
59 篇 管理学
- 58 篇 管理科学与工程(可...
- 4 篇 工商管理
29 篇 理学
- 18 篇 数学
- 4 篇 物理学
- 3 篇 生物学
- 3 篇 系统科学
- 2 篇 化学
6 篇 经济学
- 4 篇 理论经济学
- 4 篇 应用经济学
5 篇 医学
- 4 篇 临床医学
2 篇 法学
- 2 篇 政治学
- 2 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学

主题

235 篇 ant algorithm
25 篇 ant colony optim...
17 篇 optimization
12 篇 algorithms
12 篇 genetic algorith...
11 篇 ants
9 篇 routing
8 篇 clustering
8 篇 swarm intelligen...
7 篇 path planning
7 篇 administrative c...
7 篇 multicast routin...
7 篇 qos
6 篇 ant colony optim...
5 篇 particle swarm o...
5 篇 optimization alg...
4 篇 genetic algorith...
4 篇 transport
4 篇 pheromone
4 篇 planning

机构

2 篇 wuhan univ techn...
2 篇 city univ hong k...
2 篇 tianjin univ sch...
2 篇 department of el...
2 篇 brno university ...
2 篇 iran univ sci & ...
2 篇 natl sun yat sen...
2 篇 univ nebraska de...
2 篇 hebei university...
2 篇 iran univ sci & ...
1 篇 wenzhou univ ins...
1 篇 universitas meth...
1 篇 shandong normal ...
1 篇 warsaw univ tech...
1 篇 univ bremen dept...
1 篇 helwan univ dept...
1 篇 univ torbat heid...
1 篇 fraunhofer insti...
1 篇 avic radar and a...
1 篇 warsaw univ tech...

作者

4 篇 li layuan
3 篇 afshar m. h.
3 篇 izdebski mariusz
3 篇 gong bencan
2 篇 jun-hua gu
2 篇 klymash mykhailo
2 篇 kendall g
2 篇 yang yang
2 篇 sari riri fitri
2 篇 lorenz pascal
2 篇 anuntachai anunt...
2 篇 lebedev o. b.
2 篇 middendorf m
2 篇 dasgupta p
2 篇 alyguliev r. m.
2 篇 abouaissa abdelh...
2 篇 gu jun-hua
2 篇 chen chia-mei
2 篇 zhu qingbao
2 篇 simaremare harri...

语言

224 篇 英文
7 篇 其他
3 篇 中文

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

共 235 条记录，以下是91-100 订阅

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

详细简洁

排序：

Data Fusion for Wireless Sensor Networks Based on Hybrid ant Colony algorithm

Data Fusion for Wireless Sensor Networks Based on Hybrid Ant...

引用

作者： Lihong WANG Xue HAN Heihe University

A hybrid ant algorithm is proposed for wireless sensor networks data fusion, which to improve the efficiency of data integration and rextend the network lifetime. Not only the energy consumption is considered,but also the data transmission delay is considered. First, Making use of the advantages of ant algorithm in searching for the shortest path, the algorithm construct the shortest *** overcome the disadvantages of prematurity and slow the rate of convergence in ant algorithm, At the same time, a variable neighborhood search mutation operator is applied to optimize search *** iterrations number is achieved. Experiment results show that the algorithm which reduce energy consumption and network delay,is more stable and has better perfoming.

关键词： Wireless Sensor Network Data Fusion ant algorithm

来源：评论

学校读者我要写书评

暂无评论

A time synchronization scheme for sensor networks based on ant colony algorithm

A time synchronization scheme for sensor networks based on a...

引用

11th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2015)

作者： Nuo Wei Ming Lei Shu Ming Yang Chang Fang Chen Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781510821279

Time synchronization has received a great attention as its crucial parts in wireless sensor networks. To minimize the number of transmission packets and achieve energy efficiency, a time synchronization scheme based on ant colony algorithm (TSAC) is presented in this paper. By exploiting the principle of ant colony algorithm adjusting the pheromone dynamically and automatically, an optimum pair selection theme is designed to select the nodes synchronized by performing the pairwise synchronization, and all the other nodes could be synchronized by listening. The simulation results show that TSAC needs less message exchanges and provides more accuracy than other time synchronization algorithms.

关键词： ant Colony algorithm Time Synchronization Wireless Sensor Networks ant algorithm clock recovery Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Missile Trajectory Optimization Using a Modified ant Colony algorithm

Missile Trajectory Optimization Using a Modified Ant Colony ...

引用

IEEE Aerospace Conference

作者： Zachary J. Kiyak Roy J. Hartfield Timothy W. Ledlow Department of Aerospace Engineering Auburn University

ISBN: (纸本)9781479916191

A modified ant colony optimization (ACO) algorithm is applied to a single-stage solid missile design problem involving six degrees of freeedom (6-DOF) flight trajectory modeling. A local search procedure is also integrated with the algorithm, adding a search intensification ability that compliments the ability of ACO to thoroughly explore a solution space. The goal of this work is to evaluate the effectiveness of the ant colony optimization scheme by comparing its solution output quality with those of other, well-known optimization methods. Performance is based on solution "fitness", or how closely each solution matches a specific set of performance objectives, as well as the number of calls to the objective function that are required in order to reach that solution. Additionally, an important performance criterion is to determine each algorithm's capabilities of finding, not only a single quality solution to a design problem, but also a diverse set of additional, near-optimal solutions. The results of this study demonstrate that the modified ACO algorithm is a viable candidate as a high-performance optimization method, while the added local search method may or may not be a worthwile addition for the attempted optimization problem.

关键词： ant algorithm ADMINISTRATIVE CONSENT ORDER trajectory optimization missile trajectories design problems Solutions PERFORMANCE OBJECTIVES optimization method Performance metrics Solution space Search methods ant colony optimization Solution

来源：评论

学校读者我要写书评

暂无评论

THE ant-BASED algorithm FOR THE DATA GATHERING ROUTING STRUCTURE IN SENSOR NETWORKS

THE ANT-BASED ALGORITHM FOR THE DATA GATHERING ROUTING STRUC...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： RU HUANG JIE ZHU XU-TAO YU Department of Electronic Engineering Shanghai Jiaotong University 200240 China College of Information Science and Engineering Southeast University Nanjing China

The paper presents a data gathering routing algorithm of sensor networks according to ant algorithm based on MOP,which is achieved via visibility made up of reliability factor and efficiency factor. The MOP jointly optimizes over the efficiency and reliability of the routing build. The efficiency factor reflects the utilization of network resource. The reliability factor endows the artificial ants with the ability to judge node energy status, and importance level which is related to Variable Weight (VW). The goal of the algorithm is to find the optimal routing structure which can balance the cost of energy and delay, and enhance the reliability of data gathering. Thus the robustness of sensor networks is improved.

关键词： ant algorithm MOP routing sensor networks

来源：评论

学校读者我要写书评

暂无评论

Fractal Image Compression by ant Colony algorithm

Fractal Image Compression by Ant Colony Algorithm

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Jinjiang Li Qingsong Xie Da Yuan Caiming Zhang School of Computer Science and Technology Shandong University Jinan 250061 School of Computer Sci School of Computer Science and Technology Shandong Institute of Economic & Techonlogy Yantai 2640 School of Computer Science and Technology Shandong University Jinan 250061

A fast fractal encoding algorithm based on ant colony algorithm is proposed to reduce coding time. The algorithm produces a completely identical fractal encoding to that of the conventional full search in reduced time. Using ant-based clustering algorithm and kernel method, we propose in this paper a kernel function clustering based on ant colony algorithm. It automatically realizes classification of the domain block. Our method eliminates much search on domain blocks but keep the same image quantity. The experimental results show that the algorithm can realize fractal image coding very well and also it has better PSNR, and it gets more compress ratio than traditional block-based partition.

关键词： Fractal Compression ant algorithm Kernel function clustering.

来源：评论

学校读者我要写书评

暂无评论

Array Synthesis with Diversity Pattern using an ant Colony algorithm

Array Synthesis with Diversity Pattern using an Ant Colony A...

引用

2011 IEEE International Symposium on antennas and Propagation(APSURSI 2011)

作者： Eva Rajo-Iglesias Oscar Quevedo-Teruel Dept. of Signal Theory and Communications University Carlos III of Madrid 28911 Leganes (Madrid) Spain Dept. of Theoretical Physics of Condensed Matter Universidad Autonoma de Madrid 28049 Madrid Spain

ISBN: (纸本)9781424495627;9781424495634

A classical problem as array synthesis has been already afforded from numerous points of view. We propose in this work to add a new parameter in the synthesis which is the possibility of using as array elements two types of antennas which have different radiation patterns. This fact provides a new degree of freedom in the synthesis of the array, although it keeps the same symplicity and total size as in classical arrays with only one type of antenna. To perform the synthesis we use an ant Colony Optimization algorithm as a first approximation, although other algorithms such as Genetic algorithm could be employed, or even a combination of different algorithms.

关键词： ant algorithm synthesis Degree of freedom antENNA Array Element arrays first approximation Radiation patterns Genetic algorithm (GA)

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization Problem of Routing about Parking Guidance Based on Improved ant Colony algorithm

Research on Optimization Problem of Routing about Parking Gu...

引用

IEEE International Conference on Civil Aviation Safety and Information Technology (ICCASIT)

作者： Juan Li Zi Li Tao Sun Meijuan Jia Haitao Yu Computer Science and Information Technology Daqing Normal University College Daqing China Guilin University of Technology Institute for Tourism Studies Guilin China

ISBN: (纸本)9781728125992

According to the layout characteristics of parking in the parking lot, the problem of converting the path choice of parking is raised to seek the optimal path and generate the optimal parking guiding line. This paper proposed the concept of node busy factor, and a mathematical model of the optimal path with constraints. The state transition rules of basic ant colony algorithm is improved as well as updating rules of pheromone. After that, the taboo strategy is introduced for further optimization. At last, the experimental results and Matlab simulation verify the effectiveness of the algorithm.

关键词： ant-colony algorithm Path optimization Taboo strategy Parking guidance Parking ant algorithm optimal path Network routing State Change

来源：评论

学校读者我要写书评

暂无评论

Multicast Routing Based on ant-algorithm with Delay and Delay Variation Constraints

Multicast Routing Based on Ant-Algorithm with Delay and Dela...

引用

Electronic Communication Systems--The 2000 IEEE Asia-Pacific Conference on Circuits and Systems

作者： Guoying Lu Zemin Liu Beijing University of Posts and Telecommunications

ISBN: (纸本)0780362535

In this paper,based on ant algorithm,we propose a distributed multicast routing scheme with delay-bounded and delay variation constraints in real-time *** paper first describes ant algorithm model and gives ant network model,then presents an approach using ant algorithm to optimize the multicast routes with delay and delay-variation *** great amount of simulation has been done to show efficiency of the algorithm,and the simulation results show that the proposed approach can find the best optimal multicast routes which satisfy the above constraints.

关键词： Delay constrained multicast communication ant algorithm multicast routing

来源：评论

学校读者我要写书评

暂无评论

The improved ant colony algorithm test sequence optimization based on the RBC Test Platform

The improved ant colony algorithm test sequence optimization...

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Naiwen Hu Wei Zheng Nat. Eng. Res. Center of Rail Transp. Oper. & Control Syst. Beijing Jiaotong Univ. Beijing China

ISBN: (纸本)9781479960798

With the rapid development of China train control system (CTCS-3), stability and safety of the CTCS-3 have become the focus of the train industry. According to the CTCS-3 functional requirement specification issued by the Ministry of Railways, this paper implements the following three aspects: Firstly, some representative functional scenarios of Radio Block Centre (RBC) are selected to build the models by Colored Petri Net (CPN) and to generate the RBC test cases of XML format. Secondly, the sequence sets of test cases may be optimized based on the improved ant colony algorithm and ideological maze. What is the optimization idea is that not only can be the shortest pathes found but also the redundant phenomenon of test sequence generation can be reduced according to the natural law of ants foraging. Finally, the RBC test platform may automatically generate test cases and test sequences for the simulation. The result shows that the proposed method can achieve optimization of test sequences successfully and reduce the test time greatly.

关键词： Petri nets XML control engineering computing optimisation railway safety railways stability CPN CTCS-3 China train control system RBC test platform XML format ants foraging colored Petri net improved ant colony algorithm test sequence optimization optimization idea radio block centre railway ministry safety test sequence generation train industry Control systems Educational institutions Optimization Rail transportation Redundancy Roads Safety XML format Railway safety control engineering computing Rail transportation test sequence safety Petri nets Ministry of Railways Educational institutions railways extensible markup language control systems ant algorithm redundancy Consumer safety

来源：评论

学校读者我要写书评

暂无评论

Preventive Maintenance scheduling of FMS Equipment Based on Improved ant Colony algorithm

Preventive Maintenance scheduling of FMS Equipment Based on ...

引用

2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management(2011 IEEE 第十八届工业工程与工程管理国际会议 IEEM2011)

作者： Hong-quan Xue Sheng-min Wei Lin Yang School of Mechanical Engineering Northwestern Polytechnical University Xi’an 710072 China School School of Mechanical Engineering Northwestern Polytechnical University Xi’an 710072 China Xi’an Technological University Xi’an 710032 China

ISBN: (纸本)9781612844466

The importance of preventive maintenance scheduling has been gradually recognized by decision makers as it includes the necessary tasks to avoid flexible manufacturing system (FMS) unavailability. The PM scheduling of FMS machines is NP-hard problem. ACOA is an efficient method to solve NP-hard problem. This paper put forward an improved algorithm based on multiple ant colonies to solve the PM scheduling plan of FMS machines. Experimental results of a preventive maintenance scheduling of FMS equipment indicate the effectiveness of the adaptive strategies and the efficiency of the multiple ant colonies algorithm.

关键词： Preventive Maintenance flexible manufacturing system mass customization multiple ant colonies algorithm MAINTENANCE PLANS Flexible manufacturing systems ant algorithm preventive maintenance Nondeterministic polynomial-time hard decision makers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：