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

Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments

SOFT COMPUTING 2011年第2期15卷 311-326页

作者： Peng, Xingguang Gao, Xiaoguang Yang, Shengxiang Northwestern Polytech Univ Sch Elect & Informat Xian 710129 Shaanxi Peoples R China Univ Leicester Dept Comp Sci Leicester LE1 7RH Leics England

In estimation of distribution algorithms (EDAs), the joint probability distribution of high-performance solutions is presented by a probability model. This means that the priority search areas of the solution space are characterized by the probability model. From this point of view, an environment identification-based memory management scheme (EI-MMS) is proposed to adapt binary-coded EDAs to solve dynamic optimization problems (DOPs). Within this scheme, the probability models that characterize the search space of the changing environment are stored and retrieved to adapt EDAs according to environmental changes. A diversity loss correction scheme and a boundary correction scheme are combined to counteract the diversity loss during the static evolutionary process of each environment. Experimental results show the validity of the EI-MMS and indicate that the EI-MMS can be applied to any binary-coded EDAs. In comparison with three state-of-the-art algorithms, the univariate marginal distribution algorithm (UMDA) using the EI-MMS performs better when solving three decomposable DOPs. In order to understand the EI-MMS more deeply, the sensitivity analysis of parameters is also carried out in this paper.

关键词： Estimation of distribution algorithm Dynamic optimization problem Environment identification memory scheme Diversity compensation

来源：评论

学校读者我要写书评

暂无评论

Genetic Algorithms With Immigrants and memory schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS 2010年第1期40卷 52-63页

作者： Yang, Shengxiang Cheng, Hui Wang, Fang Univ Leicester Dept Comp Sci Leicester LE1 7RH Leics England British Telecommun Innovate Ctr Informat & Secur Syst Res Ipswich IP5 3RE Suffolk England

In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e. g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e. g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.

关键词： Dynamic optimization problem (DOP) dynamic shortest path routing problem (DSPRP) genetic algorithm (GA) immigrants scheme memory scheme mobile ad hoc network (MANET)

来源：评论

学校读者我要写书评

暂无评论

A bi-population based scheme for an explicit exploration/exploitation trade-off in dynamic environments

引用

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE 2017年第3期29卷 453-479页

作者： Ben-Romdhane, Hajer Krichen, Saoussen Alba, Enrique Univ Tunis LARODEC Lab ISG Tunis Le Bardo Tunisia Univ Malaga Blvd Louis Pasteur S-N Malaga Spain Tech Univ Ostrava Ostrava Czech Republic

Optimisation in changing environments is a challenging research topic since many real-world problems are inherently dynamic. Inspired by the natural evolution process, evolutionary algorithms (EAs) are among the most successful and promising approaches that have addressed dynamic optimisation problems. However, managing the exploration/exploitation trade-off in EAs is still a prevalent issue, and this is due to the difficulties associated with the control and measurement of such a behaviour. The proposal of this paper is to achieve a balance between exploration and exploitation in an explicit manner. The idea is to use two equally sized populations: the first one performs exploration while the second one is responsible for exploitation. These tasks are alternated from one generation to the next one in a regular pattern, so as to obtain a balanced search engine. Besides, we reinforce the ability of our algorithm to quickly adapt after cnhanges by means of a memory of past solutions. Such a combination aims to restrain the premature convergence, to broaden the search area, and to speed up the optimisation. We show through computational experiments, and based on a series of dynamic problems and many performance measures, that our approach improves the performance of EAs and outperforms competing algorithms.

关键词： Dynamic optimisation problems exploration-exploitation tradeoff evolutionary algorithms multi-population scheme memory scheme

来源：评论

学校读者我要写书评

暂无评论

memory-based immigrants for genetic algorithms in dynamic environments 05

Memory-based immigrants for genetic algorithms in dynamic en...

引用

Genetic and Evolutionary Computation Conference

作者： Yang, Shengxiang Univ Leicester Dept Comp Sci Leicester LE1 7RH Leics England

ISBN: (纸本)1595930108

Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent years. This trend reflects the fact that many real world problems are actually dynamic, which poses serious challenge to traditional genetic algorithms. Several approaches have been developed into genetic algorithms for dynamic optimization problems. Among these approches, random immigrants and memory schemes have shown to be beneficial in many dynamic problems. This paper proposes a hybrid memory and random immigrants scheme for genetic algorithms in dynamic environments. In the hybrid scheme, the best solution in memory is retrieved and acts as the base to create random immigrants to. replace the worst individuals in the population. In this way, not only can diversity be maintained but it is done more efficiently to adapt the genetic algorithm to the changing environment. The experimental results based on a series of systematically constructed dynamic problems show that the proposed memory-based immigrants scheme efficiently improves the performance of genetic algorithms in dynamic environments.

关键词： algorithms experimentation performance genetic algorithms dynamic optimization problems memory scheme random immigrants scheme

来源：评论

学校读者我要写书评

暂无评论

Ultrahigh and persistent optical depths of alkali vapours for quantum memories in hollow-core photonic crystal fibers

Ultrahigh and persistent optical depths of alkali vapours fo...

引用

Conference on Lasers and Electro-Optics (CLEO)

作者： Kaczmarek, Krzysztof T. Saunders, Dylan J. Feizpour, Amir Ledingham, Patrick M. Brecht, Benjamin Poem, Eilon Walmsley, Ian A. Nunn, Joshua Univ Oxford Clarendon Lab Parks Rd Oxford OX1 3PU England

We show the highest (>10(5)) and longest-lived (>3 hours) optical depths of alkali vapours in hollow-core photonic crystal fibres, which we will use to implement a novel noiseless broadband quantum memory scheme... 详细信息

ISBN: (纸本)9781943580118

关键词： memory scheme temporal multiplexing alkali vapours

来源：评论

学校读者我要写书评

暂无评论

PSYCHOLOGICAL PROCESSES BEHIND THE COMPREHENSION OF A POETIC TEXT

引用

INSTRUCTIONAL SCIENCE 1980年第1期9卷 43-66页

作者： SHIMRON, J Mount Carmel University of Haifa Haifa Israel

In addition to the psychological operations which are typical of the reading processes of most regular texts, such as recall of memory schemes, developing hypotheses and tests of relevance, I suggest that in the reading of poetic texts there would be at least two additional kinds of processes; namely the process by which the reader discovers analogies, and compares them, and the process of drawing conclusions from this comparison. The predisposition of a poetry reader is characterized by (a) the tendency to process a maximum of information from memory schemes that are evoked during reading; and (b) the reader's readiness to process information expressed similarly to metaphors. That is, to process pieces of information whose meanings would not be considered consistent if taken literally.

关键词： Process Information Psychological Process Reading Process memory scheme Regular Text

来源：评论

学校读者我要写书评

暂无评论

Tangramrine: A Novel Graphical Recognition and Cued-recall based Password System

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2015年第8期9卷 15-22页

作者： Altamirano, Steven Zanelli, Jesus Gutierrez Cardenas, Juan M. Bringas, Daniela Univ San Ignacio Loyola Fac Informat Syst Lima Peru Univ Pacifico Fac Engn Lima Peru

Graphical passwords are an authentication user model that consists of the recall of pictures or graphics signs to gain access to a system. They have been proved to be a secure and reliable alternative to textual passwords;by giving a more robust schema against brute force and shoulder-surfing attacks. In this research paper we present an alternative to a graphical password based on a modification of the Tangram game. We believe our proposal accomplishes the features of being an easy recognition-based system password giving the user enough security against common threats such as brute force attacks by dictionary means or OCR types, as well as shoulder-surfing attacks.

关键词： Graphical Password Authentication Usability Security memory scheme

来源：评论

学校读者我要写书评

暂无评论

On the Effect of Environment-Triggered Population Diversity Compensation Methods for memory Enhanced UMDA

On the Effect of Environment-Triggered Population Diversity ...

引用

第三十届中国控制会议

作者： PENG Xingguang~1,XU Demin~(1,2),ZHANG Fubin~(1,2) 1.School of Marine Engineering,Northwestern Polytechnical University,Xi'an 710072,P.R.China 2.National Key Laboratory for Underwater Information Processing and Control,Xi'an 710072,P.R.China

This paper focuses on the effect of population diversity to environment identification-based memory scheme (EI-MMS) which heuristically compensates population diversity through the storage and retrieving process of historic *** introduced several diversity compensation measures and combined them with EI-MMS based univariate marginal distribution algorithm(UMDA) from two ***,a basic diversity compensation measure was used to fight against the inherent diversity loss of ***,two environment-triggered compensation measures were added in the sense of dynamic *** on the experimental results on three dynamic test problems,the dynamics of population diversity of the corresponding EI-MMS based UMDAs were analyzed and several conclusions about how does the population diversity affect the performance of the algorithm in dynamic environments were drawn.

关键词： Dynamic Optimization Problem Estimation Of Distribution Algorithm memory scheme Population Diversity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：