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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

428 篇 期刊文献
207 篇 会议
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

587 篇 工学
- 296 篇 计算机科学与技术...
- 159 篇 电气工程
- 77 篇 控制科学与工程
- 45 篇 土木工程
- 45 篇 石油与天然气工程
- 44 篇 信息与通信工程
- 42 篇 机械工程
- 35 篇 软件工程
- 26 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 材料科学与工程（可...
- 18 篇 电子科学与技术（可...
- 16 篇 力学（可授工学、理...
- 16 篇 仪器科学与技术
- 16 篇 水利工程
- 13 篇 环境科学与工程（可...
- 12 篇 交通运输工程
- 7 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
102 篇 管理学
- 97 篇 管理科学与工程(可...
- 4 篇 工商管理
76 篇 理学
- 30 篇 数学
- 11 篇 物理学
- 9 篇 化学
- 9 篇 生物学
- 5 篇 系统科学
- 4 篇 地球物理学
10 篇 医学
- 6 篇 临床医学
5 篇 经济学
- 4 篇 应用经济学
3 篇 法学
3 篇 教育学
- 3 篇 教育学
3 篇 农学
1 篇 哲学
1 篇 艺术学

主题

638 篇 harmony search a...
75 篇 optimization
35 篇 genetic algorith...
22 篇 particle swarm o...
19 篇 multi-objective ...
15 篇 wireless sensor ...
13 篇 opposition-based...
13 篇 global optimizat...
12 篇 metaheuristics
10 篇 metaheuristic al...
9 篇 artificial bee c...
9 篇 evolutionary alg...
9 篇 wireless sensor ...
9 篇 meta-heuristics
8 篇 economic load di...
8 篇 differential evo...
8 篇 particle swarm o...
8 篇 metaheuristic
7 篇 structural optim...
7 篇 clustering

机构

9 篇 guangzhou univ s...
7 篇 physics departme...
7 篇 korea univ sch c...
6 篇 northeastern uni...
6 篇 rmit univ grad s...
6 篇 huazhong univ sc...
5 篇 northeastern uni...
5 篇 middle e tech un...
5 篇 istanbul univ de...
5 篇 rmit univ grad s...
5 篇 nanyang technol ...
5 篇 liaocheng univ c...
4 篇 shanghai univ sc...
4 篇 univ bahrain dep...
4 篇 anshan normal un...
4 篇 bohai univ coll ...
4 篇 comsats inst inf...
4 篇 al aqsa univ dep...
4 篇 shahid bahonar u...
4 篇 al balqa appl un...

作者

14 篇 gao liqun
13 篇 li steven
12 篇 ouyang haibin
11 篇 geem zong woo
11 篇 al-betar mohamme...
9 篇 fesanghary m.
8 篇 abu doush iyad
8 篇 awadallah mohamm...
7 篇 bekdas gebrail
7 篇 pan quan-ke
7 篇 kim joong hoon
7 篇 nigdeli sinan me...
6 篇 lin chun-cheng
6 篇 liqun gao
6 篇 khader ahamad ta...
6 篇 saka m. p.
6 篇 alia osama moh'd
6 篇 gao liang
5 篇 zou dexuan
5 篇 huang yin-fu

语言

589 篇 英文
41 篇 其他
5 篇 中文
1 篇 德文
1 篇 法文
1 篇 土耳其文

检索条件"主题词=Harmony Search algorithm"

共 638 条记录，以下是211-220 订阅

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

详细简洁

排序：

Optimization of EM railgun based on orthogonal design method and harmony search algorithm 17

Optimization of EM railgun based on orthogonal design method...

引用

17th IEEE International Symposium on Electromagnetic Launch Technology (EML)

作者： Yan, Yan Chao, Tao Ma, Ping Yang, Ming Hu, Yuwei Harbin Inst Technol Control & Simulat Ctr Harbin 150001 Peoples R China

ISBN: (纸本)9781479927333

The muzzle velocity is a key index to reflect the performance of electromagnetic(EM) railgun. In order to obtain an optimal solution of muzzle velocity accurately and quickly in numerical simulation, an approach of combining orthogonal design method(ODM) and harmony search(HS) algorithm is presented. There are up to 11 factors to be considered in affecting the muzzle velocity, including eight trigger delay times of pulsed power supply (PPS), the operating voltage of PPS, the length of rail and the mass of projectile. By ODM analysis, the best level combinations of these factors are selected and the significant degree of these factors is ordered. Therefore, the varying ranges of these factors are decided and a hierarchical factor optimization model is built. The optimization model is solved by HS algorithm with the penalty function method added to satisfy process constraints, such as the peak of current is bounded under 420KA. Finally, the proposed approach and the simple HS algorithm are compared. The results indicate that, by using the proposed approach, the average of original velocity is increased by 43.53%, and the average of best velocity at last, is increased by 1.34%

关键词： Optimization Electromagnetic Railgun Orthogonal Design harmony search algorithm Penalty Function

来源：评论

学校读者我要写书评

暂无评论

Solution of the Inverse Continuous Casting Problem with the Aid of Modified harmony search algorithm

Solution of the Inverse Continuous Casting Problem with the ...

引用

10th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Hetmaniok, Edyta Slota, Damian Zielonka, Adam Silesian Tech Univ Inst Math PL-44100 Gliwice Poland

ISBN: (纸本)9783642552243

In the paper a description of procedure for solving the inverse problem of continuous casting is given. The problem consists in reconstruction of the cooling conditions of solidified ingot and is based on minimization of the appropriate functional by using the modified harmony search algorithm - the algorithm of artificial intelligence inspired by process of composing the jazz music.

关键词： Artificial intelligence harmony search algorithm Inverse continuous casting problem

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Variation harmony search algorithm for the Team Orienteering Problem with Capacity Limitations 1

引用

13th International Conference on Learning and Intelligent Optimization (LION)

作者： Tsakirakis, Eleftherios Marinaki, Magdalene Marinakis, Yannis Tech Univ Crete Sch Prod Engn & Management Decis Support Syst Lab Univ Campus Khania 73100 Greece

ISBN: (数字)9783030386290

ISBN: (纸本)9783030386290;9783030386283

This paper addresses a new optimization method for a variant of the category of orienteering problems (OP), which is well-known as the capacitated team orienteering problem (CTOP). The main objective of CTOP focuses on the maximization of the total collected profit from a set of candidate nodes or customers by taking into account the limitations of vehicle capacity and time upper boundary of a constructed route. To solve CTOP, we present a new optimization algorithm called the Similarity Hybrid harmony search. This methodology includes an innovative "similarity process" technique, which takes advantage the most profitable nodes/customers during the algorithmic procedure aiming to extend the diversification in the solution area. The experimental tests were conducted in the most popular set of instances and the obtained results are compared with most competitive algorithms in the literature.

关键词： Capacitated Team Orienteering Problem harmony search algorithm Vehicle routing problems with profits

来源：评论

学校读者我要写书评

暂无评论

Improved harmony search algorithm for Global Optimization 30

Improved Harmony Search Algorithm for Global Optimization

引用

30th Chinese Control and Decision Conference (CCDC)

作者： Li, Guojun Wang, Hongyu Anshan Normal Univ Dept Phys Anshan 114005 Peoples R China

ISBN: (纸本)9781538612446

harmony search (HS) algorithm, applied in many fields, is a new population algorithm, which imitates magically the phenomenon of musical improvisation process. However, it has a potential shortage, which is easily trapped into local optima when searching for global optima. To solve this problem, a hybrid harmony search algorithm (HHS) is promoted, which is based on the conception of swarm intelligence HHS employed a local search method to replace the pitch adjusting operation, and designed an elitist preservation strategy to modify the selection operation. Expeliment results demonstrated that the proposed method performs much better than the HS and its improved algorithms (IHS, GHS and NGIIS).

关键词： harmony search algorithm swarm ntelligence local search elitist preservation

来源：评论

学校读者我要写书评

暂无评论

Probabilistic harmony search algorithm: Fitness Proportionate Selection Variants 1st

Probabilistic Harmony Search Algorithm: Fitness Proportionat...

引用

1st International Conference on Intelligent Systems and Applications

作者： Yadav, Ravi Vullamparthi, Sumanth Tapadia, Aashi Kulkarni, Anand J. Kale, Preeti Dr Vishwanath Karad MIT World Peace Univ Sch CET Pune Maharashtra India Dr Vishwanath Karad MIT World Peace Univ Inst Artificial Intelligence Pune Maharashtra India

ISBN: (纸本)9789811965814;9789811965807

harmony search algorithm is a meta-heuristic, nature-inspired optimization algorithm that tries to mimic real-life improvisations that musicians use to generate a harmony that is more pleasing to hear. This paper presents and compares three different types of harmony search algorithms. We start with the implementation of the original HSA. Further, two different modifications were made to the original HSA, the first one uses fitness proportionate selection of harmonies from the HM and is known as biased Roulette harmony search algorithm (BRHSA) and the second one builds on BRHSA by adding simple mathematics to further guide the algorithm toward the desired solution and is called guided biased Roulette harmony search algorithm (GBRHSA). These three variants of HSA were applied on four benchmark test functions on the same machine, and the results obtained after 30 runs were noted down for comparison. It was observed that the results given by the three variants had no specific trend in terms of best result or computational time and the performance of a particular variant was subject to parameters like the kind of function and its search domain. The results presented in this paper can be used as a foundation for the future works that will be done on this algorithm and can help derive an apt variant of HSA for solving a particular problem.

关键词： harmony search algorithm Fitness proportionate selection Biased Roulette wheel Guided biased Roulette wheel Benchmark test functions Comparison

来源：评论

学校读者我要写书评

暂无评论

A Novel Discrete harmony search algorithm for Scheduling Lot-streaming Flow Shops

A Novel Discrete Harmony Search Algorithm for Scheduling Lot...

引用

22nd Chinese Control and Decision Conference

作者： Pan, Quan-Ke Duan, Jun-hua Liang, J. J. Gao, Kaizhou Li, Junqing Liaocheng Univ Coll Comp Sci Liaocheng 252059 Peoples R China Zhengzhou Univ Sch Elect Engn Zhengzhou Peoples R China

ISBN: (纸本)9781424451821

This paper proposes a novel discrete harmony search (DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup times. Unlike the traditional harmony search (HS) algorithm, the proposed OHS algorithm utilizes job permutations to represent harmonies and applies a job-permutation-based improvisation to generate new harmonies. To enhance the algorithm's searching ability, an effective initialization scheme based on the NEH heuristic is developed to construct an initial harmony memory with certain quality and diversity, and an efficient local search algorithm based on the insert neighborhood structures is fused to stress the local exploitation. Extensive computational simulations and comparisons are provided, which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature.

关键词： Flow shop scheduling Lot-streaming harmony search algorithm Makespan

来源：评论

学校读者我要写书评

暂无评论

A novel harmony search algorithm embedded with metaheuristic Opposition Based Learning

A novel Harmony Search algorithm embedded with metaheuristic...

引用

2nd International Symposium on Intelligent Systems Technologies and Applications (ISTA)

作者： Sarkhel, Ritesh Chowdhury, Tithi Mitra Das, Mayuk Das, Nibaran Nasipuri, Mita Jadavpur Univ Dept Comp Sci & Engn Kolkata W Bengal India

Evolutionary algorithms (EA) are robust optimization approaches which have been successfully applied to a wide range of problems. However, these well-established metaheuristic strategies are computationally expensive because of their slow convergence rate. Opposition Based Learning (OBL) theory has managed to alleviate this problem to some extent. Through simultaneous consideration of estimates and counter estimates of a candidate solution within a definite search space, better approximation of the candidate solution can be achieved. Although it addresses the slow convergence rate to some extent, it is far from alleviating it completely. The present work proposes a novel approach towards improving the performance of OBL theory by allowing the exploration of a larger search space when computing the candidate solution. Instead of considering all the components of the candidate solution simultaneously, the proposed method considers each of component individually and attempts to find the best possible combination by using a metaheuristic technique. In the present work, this improved Opposition learning theory has been integrated with the classical HS algorithm, to accelerate its convergence rate. A comparative analysis of the proposed method against classical Opposition Based Learning has been performed on a comprehensive set of benchmark functions to prove its superior performance.

关键词： Evolutionary algorithms Opposition Based Learning harmony search algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal Path Planning in Environments with Static Obstacles by harmony search algorithm 5th

Optimal Path Planning in Environments with Static Obstacles ...

引用

5th International Conference on harmony search, Soft Computing and Applications (ICHSA)

作者： Tuba, Eva Strumberger, Ivana Bacanin, Nebojsa Tuba, Milan Singidunum Univ Danijelova 32 Belgrade 11000 Serbia

ISBN: (纸本)9783030319670;9783030319663

Path planning represents an important optimization problem that need to be solved in various applications. It is a hard optimization problem thus deterministic algorithms are not usable but it can be tackled by stochastic population based metaheuristics such as swarm intelligence algorithms. In this paper we adopted and adjusted harmony search algorithm for the path planning problem in environment with static obstacles and danger zones. Objective function includes path length and safety degree. The proposed method was tested on standard benchmark examples from literature. Simulation results show that our proposed model produces better and more consistent results in spite of its simplicity.

关键词： Path planning Optimization Swarm intelligence harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Seismic Reliability-Based Design of Water Distribution Networks Using Multi-objective harmony search algorithm 2nd

引用

2nd International Conference on harmony search algorithm (ICHSA)

作者： Yoo, Do Guen Jung, Donghwi Lee, Ho Min Choi, Young Hwan Kim, Joong Hoon Korea Univ Res Ctr Disaster Prevent Sci & Technol Seoul 136713 South Korea Korea Univ Sch Civil Environm & Architectural Engn Seoul 36713 South Korea

ISBN: (纸本)9783662479261;9783662479254

In the last four decades, many studies have been conducted for least-cost and maximum-reliability design of water supply systems. Most models employed multi-objective genetic algorithm (e.g., non-dominated sorting genetic algorithm-II, NSGA-II) in order to explore trade-off relationship between the two objectives. This study proposes a reliability-based design model that minimizes total cost and maximizes seismic reliability. Here, seismic reliability is defined as the ratio of available demand to required water demand under earthquakes. Multi-objective harmony search algorithm (MoHSA) is developed to efficiently search for the Pareto optimal solutions in the two objectives solution space and incorporated in the proposed reliability-based design model. The developed model is applied to a well-known benchmark network and the results are analyzed.

关键词： Optimal design Multi-objective harmony search algorithm Earthquake hazard

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Feature Selection Technique Based on harmony search algorithm for Improving the Text Clustering 7

Unsupervised Feature Selection Technique Based on Harmony Se...

引用

7th International Conference on Computer Science and Information Technology (CSIT)

作者： Abualigah, Laith Mohammad Khader, Ahamad Tajudin Al-Betar, Mohammed Azmi USM Sch Comp Sci George Town 11800 Malaysia Al Huson Univ Coll Dept Informat Technol Irbid Jordan

ISBN: (纸本)9781467389136

The increasing amount of text information on the Internet web pages affects the clustering analysis. The text clustering is a favorable analysis technique used for partitioning a massive amount of information into clusters. Hence, the major problem that affects the text clustering technique is the presence uninformative and sparse features in text documents. The feature selection (FS) is an important unsupervised technique used to eliminate uninformative features to encourage the text clustering technique. Recently, the meta-heuristic algorithms are successfully applied to solve several optimization problems. In this paper, we proposed the harmony search (HS) algorithm to solve the feature selection problem (FSHSTC). The proposed method is used to enhance the text clustering (TC) technique by obtaining a new subset of informative or useful features. Experiments were applied using four benchmark text datasets. The results show that the proposed FSHSTC is improved the performance of the k-mean clustering algorithm measured by F-measure and Accuracy.

关键词： Unsupervised Feature Selection harmony search algorithm K-mean Text Clustering Informative features Sparse features

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共64页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：