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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

131 篇 会议
129 篇 期刊文献
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

237 篇 工学
- 146 篇 计算机科学与技术...
- 73 篇 电气工程
- 29 篇 控制科学与工程
- 28 篇 软件工程
- 18 篇 信息与通信工程
- 13 篇 机械工程
- 11 篇 土木工程
- 10 篇 石油与天然气工程
- 8 篇 仪器科学与技术
- 8 篇 电子科学与技术（可...
- 7 篇 交通运输工程
- 6 篇 材料科学与工程（可...
- 6 篇 动力工程及工程热...
- 5 篇 化学工程与技术
- 5 篇 生物工程
- 4 篇 光学工程
- 4 篇 水利工程
- 3 篇 力学（可授工学、理...
- 3 篇 环境科学与工程（可...
- 3 篇 生物医学工程（可授...
57 篇 理学
- 25 篇 数学
- 13 篇 生物学
- 11 篇 物理学
- 5 篇 统计学（可授理学、...
- 4 篇 化学
39 篇 管理学
- 38 篇 管理科学与工程(可...
7 篇 经济学
- 4 篇 应用经济学
- 3 篇 理论经济学
6 篇 农学
- 5 篇 作物学
5 篇 医学
1 篇 法学
1 篇 文学

主题

262 篇 parallel genetic...
23 篇 genetic algorith...
10 篇 multi-objective ...
8 篇 optimal power fl...
8 篇 optimization
8 篇 planning and con...
7 篇 island model
7 篇 system security
7 篇 genetic algorith...
6 篇 mpi
6 篇 simulated anneal...
5 篇 system loadabili...
5 篇 facts
5 篇 svc
5 篇 decomposed netwo...
5 篇 feature selectio...
5 篇 message passing ...
4 篇 parallel process...
4 篇 mapreduce
4 篇 global optimizat...

机构

4 篇 zhejiang univ co...
3 篇 shanghai jiao to...
3 篇 indian assoc cul...
3 篇 roma tre univ de...
3 篇 univ brest lab b...
2 篇 nanyang technol ...
2 篇 chulalongkorn un...
2 篇 biskra univ dept...
2 篇 renmin univ chin...
2 篇 department of el...
2 篇 indian inst tech...
2 篇 univ calcutta de...
2 篇 univ chile dept ...
2 篇 southeast univ s...
2 篇 univ greenwich o...
2 篇 univ ryukyus fac...
2 篇 city univ hong k...
2 篇 sichuan univ col...
2 篇 oum elbouaghi un...
2 篇 chinese acad sci...

作者

7 篇 srairi k.
7 篇 bouktir t.
4 篇 mahdad belkacem
4 篇 shi da
4 篇 demartino cristo...
3 篇 fukuyama y
3 篇 sharma rahul
3 篇 chang daofang
3 篇 he junliang
3 篇 kim heungseob
3 篇 nandy subhajit
3 篇 yan wei
3 篇 mahdad b.
3 篇 monakhov o. g.
3 篇 marano giuseppe ...
2 篇 kwong s
2 篇 rahman m
2 篇 jewajinda yutana
2 篇 ju gang
2 篇 wong ys

语言

242 篇 英文
15 篇 其他
5 篇 中文

检索条件"主题词=parallel genetic algorithm"

共 262 条记录，以下是221-230 订阅

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

详细简洁

排序：

parallel Many-Objective Search for Unit Tests 12

Parallel Many-Objective Search for Unit Tests

引用

12th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Bader, Verena Campos, Jose Fraser, Gordon Univ Passau Chair Software Engn 2 Passau Germany Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781728117362

Meta-heuristic search algorithms such as genetic algorithms have been applied successfully to generate unit tests, but typically take long to produce reasonable results, achieve sub-optimal code coverage, and have large variance due to their stochastic nature. parallel genetic algorithms have been shown to be an effective improvement over sequential algorithms in many domains, but have seen little exploration in the context of unit test generation to date. In this paper, we describe a parallelised version of the many-objective sorting algorithm (MOSA) for test generation. Through the use of island models, where individuals can migrate between independently evolving populations, this algorithm not only reduces the necessary search time, but produces overall better results. Experiments with an implementation of parallel MOSA on the EVOSUITE test generation tool using a large corpus of complex open source Java classes confirm that the parallelised MOSA algorithm achieves on average 84% code coverage, compared to 79% achieved by a standard sequential version.

关键词： unit test generation search-based test generation parallel genetic algorithm EvoSuite

来源：评论

学校读者我要写书评

暂无评论

Biclustering of Gene Expression Microarray data using Dynamic deme parallelized genetic algorithm (DdPGA)

Biclustering of Gene Expression Microarray data using Dynami...

引用

IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)

作者： Mishra, Shreya Vipsita, Swati IIIT Bhubaneswar Dept Comp Sc Engn Bhubaneswar 751003 Odisha India

ISBN: (纸本)9781467389884

Biclustering deals with creating a sub-matrix that shows a high similarity across both genes and conditions. Bi-clustering targets at identifying several biclusters that reveal potential local patterns from a microarray matrix. In this paper, initially sequential evolutionary algorithm (SEBI) is implemented and few drawbacks of the approach were identified. To overcome the drawbacks, parallel strategies such as condition based evolutionary biclustering (CBEB) and coarse grained parallel genetic algorithm (CgPGA) were implemented. To further improve the performance, a new parallel genetic algorithm using dynamic demes strategy is implemented. This method uses global parallelization (master-slave model) with coarse-grained GA with overlapping subpopulation model. The primary objective is to find biclusters with minimum overlapping, large row variance, low mean square residue (MSR) and covering almost every element of expression matrix, thus minimizing the overall fitness value. Sequential EA and condition based EA (CBEB) is implemented but it was observed that both took too much time to meet the stopping criteria. So, to improve the efficiency of the genetic algorithm (GA), parallel GA has been implemented with dynamic deme strategy to reduce the execution time of GA and find good quality biclusters. DdPGA yielded good quality biclusters and search space could be increased by implementing this strategy. This experiment was implemented on yeast Saccharamyces dataset.

关键词： Biclustering genetic algorithm parallel genetic algorithm Mean squared residue Volume Row variance

来源：评论

学校读者我要写书评

暂无评论

parallelized genetic Operations for SBST using Hadoop MapReduce Framework

Parallelized Genetic Operations for SBST using Hadoop MapRed...

引用

International Conference on Advanced Communication Control and Computing Technologies*

作者： Mayandi, Geethapriya Arumugam, Chamundeswari SSN Coll Engn Dept Comp Sci & Engn Software Engn Madras Tamil Nadu India SSN Coll Engn Dept Comp Sci & Engn Madras Tamil Nadu India

ISBN: (纸本)9781479939145

Search Based Software Testing (SBST) is one of the most explored fields in Software Testing. It suffers from the optimization problem to execute the Software Under Test (SUT). This problem is addressed mostly using genetic algorithm (GA) and it involves three operations namely selection, crossover and mutation to accomplish a global search to yield fitness solution to run the SUT successfully. In existing work, GA is combined with Hadoop MapReduce to give parallel genetic algorithm (PGA). Here, mapper function performs parallel fitness computation and reducer function performs the GA. This PGA generates test suite that makes the entire SUT to get executed. This paper makes an attempt to existing by parallelizing fitness calculation and GA operations to generate search test data for the SUT based on branch coverage criteria.

关键词： genetic algorithm parallel genetic algorithm Search Based Software Testing Test Data Software Under Test

来源：评论

学校读者我要写书评

暂无评论

User interest model-based image retrieval technique

User interest model-based image retrieval technique

引用

IEEE International Conference on Automation and Logistics

作者： Li, Jianhua Liu, Mingsheng Cheng, Yan Shijiazhuang Railway Inst Dept Comp & Informat Engn Shijiazhuang Hebei Peoples R China Handan Coll Handan Hebei Peoples R China Hebei Jiaotong Vocat & Tech Coll Dept Automot Engn Shijiazhuang Hebei Peoples R China

ISBN: (纸本)9781424415304

The Content-Based Image retrieval (CBIR) system establishes the feature space by comprehending the content of an image and executing retrieval by measuring the similarity of images. With the development of CBIR, however, there are two problems. One is that since different researchers use different feature spaces, or use the same feature space but different description, then the measure is different, it is difficult for retrieval to be universal, especially in WEB. Another is that currently CBIR tools designed for satisfying the needs of all users, special needs of individual user are not considered. Aimed at above problems, we establish the multi-feature spaces, by features of color layout descriptor and homogeneous texture descriptor, which considering both color and texture by human sense, and adjusting the weight of every feature space by applying PGA (parallel genetic algorithm) for matching the user interest. The result of experiment shows that the system is robust in general format by using MPEG-7, and can match the user profile as well.

关键词： Content-based Image retrieval user interest MPEG-7 parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Quantum Logic Synthesis of Boolean Reversible Logic Circuits Embedded in Ternary Quantum Space using Structural Restrictions

Evolutionary Quantum Logic Synthesis of Boolean Reversible L...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Lukac, Martin Perkowski, Marek Kameyama, Michitaka Tohoku Univ Dept Informat Sci Sendai Miyagi 980 Japan Portland State Univ Dept Elect Engn Portland OR USA

ISBN: (纸本)9781424481262

It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a parallel genetic algorithm that synthesizes Boolean reversible circuits realized with a variety of quantum gates on qudits with various radices. We describe the experiments that we conducted using GPU programming. Various approaches to fitness function formulation were applied to obtain various realizations of well known universal Boolean reversible quantum gates.

关键词： Boolean reversible logic circuits GPU programming computer graphic equipment coprocessors evolutionary quantum logic synthesis fitness function formulation logic circuits parallel genetic algorithm radices logic structural restrictions ternary quantum space universal quantum gates

来源：评论

学校读者我要写书评

暂无评论

Dynamic Strategy Based parallel GA Coordinated with FACTS devices to Enhance the Power System Security

Dynamic Strategy Based Parallel GA Coordinated with FACTS de...

引用

General Meeting of the IEEE-Power-and-Energy-Society

作者： Mahdad, B. Srairi, K. Bouktir, T. Univ Biskra Algeria Dept Elect Engn Biskra Algeria Oum Elbouaghi Univ Dept Elect Engn Oum El Bouaghi Algeria

ISBN: (纸本)9781424442409

Under critical situation the main preoccupation of expert engineers is to assure power system security and to deliver power to the consumer within the desired index power quality. The total generation cost taken as a secondary strategy. This paper presents an efficient decomposed GA to enhance the solution of the Optimal Power Flow (OPF) under severe loading conditions. At the decomposed stage the length of the original chromosome is reduced successively and adapted to the topology of the new partition. Two sub problems are proposed to coordinate the OPF problem under different loading conditions: the first sub problem related to the active power planning under different loading factor to minimize the total fuel cost, and the second sub problem is a reactive power planning to make fine corrections to the voltage deviation and reactive power violation using a specified number of shunt dynamic compensators named Static Var Compensators (SVC). To validate the robustness of the proposed approach, the algorithm proposed tested on IEEE 30-Bus under different loading conditions and compared with global optimization methods (GA, EGA, FGA, ACO) and with two robust simulation packages: PSAT and MATPOWER. The results show that the approach proposed can converge to the near solution and obtain a competitive solution at critical situation and with a reasonable time.

关键词： Dynamic control parallel genetic algorithm System loadability FACTS SVC Optimal power flow System security Planning and control

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Multi Agent-Based Approach to parallelizing genetic algorithm

引用

13th International-Computer-Society-of-Iran-Computer Conference

作者： Momeni, Mohsen Zamanifar, Kamran Univ Isfahan Dept Comp Engn Esfahan Iran

ISBN: (纸本)9783540899846

Multi agent systems have been widely used to parallelizing processes in network-based computation environments. parallelization of computational load could improve the performance of genetic algorithms and decrease their computational time. In this paper, a new distributed multi-agent system has been proposed for parallelizing genetic algorithin in usual networks. This dynamic approach could improve the performance of parallel genetic algorithm in a network-based context. We also provide a new migration policy for proposed architecture which leads us to attain a better performance for parallel genetic algorithm. Experimental results show the efficiency of proposed method comparing to previous studies.

关键词： Distributed Multi Agent System parallel genetic algorithm Mobility Evolutionary Computing Distributed System

来源：评论

学校读者我要写书评

暂无评论

Computation of Molecular Electronic Structure by genetic algorithm

Computation of Molecular Electronic Structure by Genetic Alg...

引用

2nd International Conference on Neural Network and genetic algorithms in Materials Science and Engineering

作者： Sharma, Rahul Saha, Rajendra Nandy, Subhajit Bhattacharyya, Shankar Prasad Chaudhury, Pinaki Indian Assoc Cultivat Sci Dept Phys Chem Kolkata 700032 India Univ Calcutta Dept Chem Kolkata India

Several strategies based on genetic algorithms have been explored to locate the ground state energy and structure of atoms and molecules. A variational recipe in a finite basis has been invoked in one of the strategies leading to a matrix eigenvalue problem that has been solved by GA with simultaneous optimization of the basis. In the second approach, the molecular electronic Schrodinger equation has been solved by genetic algorithm by directly optimizing the electronic probability amplitude distribution in space. In the third approach, the single-particle density matrix in atomic orbital basis has been treated as the basic unknown quantity. The search for the optimal ground state density has been simplified by a unitary transformation on the trial density which has been optimized by GA.

关键词： Basis optimization Born-Oppenheimer method Constrained variation Density matrix Density-GA method Direct density method Electronic structure calculation genetic algorithm Nonlinear optimization Optimization parallel genetic algorithm Polythiophene oligomers Rayleigh Quotient minimization Soft computing Su-Schrieffer-Heeger Hamiltonian

来源：评论

学校读者我要写书评

暂无评论

BFD-NN: Best Fit Decreasing-Neural Network for Online Energy-Aware Virtual Machine Allocation Problems 16

BFD-NN: Best Fit Decreasing-Neural Network for Online Energy...

引用

7th Symposium on Information and Communication Technology (SoICT)

作者： Thanh Nguyen-Duc Nguyen Quang-Hung Nam Thoai HCMC Univ Technol VNU HCM Fac Comp Sci & Engn Ho Chi Minh City Vietnam

ISBN: (纸本)9781450348157

High performance computing (HPC) clouds consume a lot of energy (kWh);therefore reducing energy consumption is a high priority for any cloud provider. This paper studies the applications of vector bin packing heuristic and Neural Network (NN) to allocate virtual machines (VMs) onto physical machines (PMs) that minimizes total energy consumption of the physical machines. In our scenario, a list of virtual machines from request queue needs to assign to system for every interval time (T) and minimize total energy consumption. We proposed Best Fit Decreasing Neural Network (BFD-NN), which contains an evaluation function (f) that finds the most efficient physical machine for each VM from requests in system. We also proposed a process to optimize weight of coefficients in f for every request which users submit to the system based on information of users' requests in the past by using parallel genetic algorithm (PGA) and Neural Network. Our method is a new approach because it not only uses knowledge from requests of users but also considers time dimension of virtual machines. Two job parallel workload models in parallel Workloads Archive are used to evaluate our approach. The simulation results illustrate that BFD-NN could reduce up to 15% total energy consumption compared with state-of-the-art heuristics (such as Best Fit and First Fit Decreasing) in online allocation virtual machines.

关键词： Cloud Computing Resource Management Energy efficiency Virtual Machine Allocation Vector Bin Packing Neural Network Application parallel genetic algorithm BFD-NN

来源：评论

学校读者我要写书评

暂无评论

Characterizing large text corpora using a maximum variation sampling genetic algorithm 06

Characterizing large text corpora using a maximum variation ...

引用

8th Annual genetic and Evolutionary Computation Conference

作者： Patton, Robert M. Potok, Thomas E. Oak Ridge Natl Lab POB 2008MS 6085 Oak Ridge TN 37831 USA

ISBN: (纸本)9781595931863

There exists an enormous amount of information available via the Internet. Much of this data is in the form of text-based documents. These documents cover a variety of topics that are vitally important to the scientific, business, and defense/security communities. Currently, there are a many techniques for processing and analyzing such data. However, the ability to quickly characterize a large set of documents still proves challenging. Previous work has successfully demonstrated the use of a genetic algorithm for providing a representative subset for text documents via adaptive sampling. In this work, we further expand and explore this approach on much larger data sets using a parallel genetic algorithm (GA) with adaptive parameter control. Experimental results are presented and discussed.

关键词： text analysis parallel genetic algorithm intelligent agents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：