scholarly journals Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming

2021 ◽  
Author(s):  
Libin Hong ◽  
John R. Woodward ◽  
Ender Özcan ◽  
Fuchang Liu
Keyword(s):  
Evolutionary Programming ◽  
Search Space ◽  
Heuristic Approach ◽  
Adaptive Mutation ◽  
Mutation Operator ◽  
Adaptive Search ◽  
The Core ◽  
Mutation Operators ◽  
Improved Performance ◽  
Over Time

AbstractGenetic programming (GP) automatically designs programs. Evolutionary programming (EP) is a real-valued global optimisation method. EP uses a probability distribution as a mutation operator, such as Gaussian, Cauchy, or Lévy distribution. This study proposes a hyper-heuristic approach that employs GP to automatically design different mutation operators for EP. At each generation, the EP algorithm can adaptively explore the search space according to historical information. The experimental results demonstrate that the EP with adaptive mutation operators, designed by the proposed hyper-heuristics, exhibits improved performance over other EP versions (both manually and automatically designed). Many researchers in evolutionary computation advocate adaptive search operators (which do adapt over time) over non-adaptive operators (which do not alter over time). The core motive of this study is that we can automatically design adaptive mutation operators that outperform automatically designed non-adaptive mutation operators.

scholarly journals Mutation Strategy Based on Step Size and Survival Rate for Evolutionary Programming

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Libin Hong ◽  
Chenjian Liu ◽  
Jiadong Cui ◽  
Fuchang Liu
Keyword(s):  
Survival Rate ◽  
Novel Mutation ◽  
Single Point ◽  
Evolutionary Process ◽  
Evolutionary Programming ◽  
Adaptive Mutation ◽  
Single Point Mutation ◽  
Step Size ◽  
Mutation Operators ◽  
Mutation Strategy

Evolutionary programming (EP) uses a mutation as a unique operator. Gaussian, Cauchy, Lévy, and double exponential probability distributions and single-point mutation were nominated as mutation operators. Many mutation strategies have been proposed over the last two decades. The most recent EP variant was proposed using a step-size-based self-adaptive mutation operator. In SSEP, the mutation type with its parameters is selected based on the step size, which differs from generation to generation. Several principles for choosing proper parameters have been proposed; however, SSEP still has limitations and does not display outstanding performance on some benchmark functions. In this work, we proposed a novel mutation strategy based on both the “step size” and “survival rate” for EP (SSMSEP). SSMSEP-1 and SSMSEP-2 are two variants of SSMSEP, which use “survival rate” or “step size” separately. Our proposed method can select appropriate mutation operators and update parameters for mutation operators according to diverse landscapes during the evolutionary process. Compared with SSMSEP-1, SSMSEP-2, SSEP, and other EP variants, the SSMSEP demonstrates its robustness and stable performance on most benchmark functions tested.

scholarly journals An Elaborate Preprocessing Phase (p3) in Composition and Optimization of Business Process Models

Computation ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 16
Author(s):  
George Tsakalidis ◽  
Kostas Georgoulakos ◽  
Dimitris Paganias ◽  
Kostas Vergidis
Keyword(s):  
Computational Complexity ◽  
Business Process ◽  
Synthetic Data ◽  
Search Space ◽  
Positive Influence ◽  
Process Models ◽  
Library Size ◽  
Solution Generation ◽  
Improved Performance ◽  
Business Process Optimization

Business process optimization (BPO) has become an increasingly attractive subject in the wider area of business process intelligence and is considered as the problem of composing feasible business process designs with optimal attribute values, such as execution time and cost. Despite the fact that many approaches have produced promising results regarding the enhancement of attribute performance, little has been done to reduce the computational complexity due to the size of the problem. The proposed approach introduces an elaborate preprocessing phase as a component to an established optimization framework (bpoF) that applies evolutionary multi-objective optimization algorithms (EMOAs) to generate a series of diverse optimized business process designs based on specific process requirements. The preprocessing phase follows a systematic rule-based algorithmic procedure for reducing the library size of candidate tasks. The experimental results on synthetic data demonstrate a considerable reduction of the library size and a positive influence on the performance of EMOAs, which is expressed with the generation of an increasing number of nondominated solutions. An important feature of the proposed phase is that the preprocessing effects are explicitly measured before the EMOAs application; thus, the effects on the library reduction size are directly correlated with the improved performance of the EMOAs in terms of average time of execution and nondominated solution generation. The work presented in this paper intends to pave the way for addressing the abiding optimization challenges related to the computational complexity of the search space of the optimization problem by working on the problem specification at an earlier stage.

Equality and Equity in Chinese Higher Education in the Post-massification Era: An Analysis Based on Chinese Scholarly Literature

2021 ◽  
pp. 1-22
Author(s):  
Qiang Zha
Keyword(s):  
Higher Education ◽  
Literature Review ◽  
Bibliometric Analysis ◽  
Chinese Higher Education ◽  
Scholarly Literature ◽  
The Core ◽  
Research Questions ◽  
Changes Over Time ◽  
Core Issues ◽  
Over Time

Abstract This paper examines several research questions relating to equality and equity in Chinese higher education via an extended literature review, which in turn sheds light on evolving scholarly explorations into this theme. First, in the post-massification era, has the Chinese situation of equality and equity in higher education improved or deteriorated since the late 1990s? Second, what are the core issues with respect to equality and equity in Chinese higher education? Third, how have those core issues evolved or changed over time and what does the evolution indicate and entail? Methodologically, this paper uses a bibliometric analysis to detect the topical hotspots in scholarly literature and their changes over time. The study then investigates each of those topical terrains against their temporal contexts in order to gain insights into the core issues.

scholarly journals What is special about L3 processing?

2013 ◽  
Vol 18 (2) ◽  
pp. 130-144 ◽  
Author(s):  
KEES DE BOT ◽  
CAROL JAENSCH
Keyword(s):  
Second Language ◽  
Language Processing ◽  
Language Use ◽  
Fundamental Question ◽  
Third Language ◽  
The Core ◽  
Dynamic Perspective ◽  
Core Issue ◽  
The Brain ◽  
Over Time

While research on third language (L3) and multilingualism has recently shown remarkable growth, the fundamental question of what makes trilingualism special compared to bilingualism, and indeed monolingualism, continues to be evaded. In this contribution we consider whether there is such a thing as a true monolingual, and if there is a difference between dialects, styles, registers and languages. While linguistic and psycholinguistic studies suggest differences in the processing of a third, compared to the first or second language, neurolinguistic research has shown that generally the same areas of the brain are activated during language use in proficient multilinguals. It is concluded that while from traditional linguistic and psycholinguistic perspectives there are grounds to differentiate monolingual, bilingual and multilingual processing, a more dynamic perspective on language processing in which development over time is the core issue, leads to a questioning of the notion of languages as separate entities in the brain.

Parameters or cues?

2004 ◽  
Vol 7 (1) ◽  
pp. 35-36 ◽  
Author(s):  
BRIAN MACWHINNEY
Keyword(s):  
Second Language ◽  
Second Language Acquisition ◽  
Language Acquisition ◽  
Hebbian Learning ◽  
Universal Grammar ◽  
Back Propagation ◽  
Parameter Setting ◽  
Functional Categories ◽  
The Core ◽  
Over Time

Truscott and Sharwood Smith (henceforth T&SS) attempt to show how second language acquisition can occur without any learning. In their APT model, change depends only on the tuning of innate principles through the normal course of processing of L2. There are some features of their model that I find attractive. Specifically, their acceptance of the concepts of competition and activation strength brings them in line with standard processing accounts like the Competition Model (Bates and MacWhinney, 1982; MacWhinney, 1987, in press). At the same time, their reliance on parameters as the core constructs guiding learning leaves this model squarely within the framework of Chomsky's theory of Principles and Parameters (P&P). As such, it stipulates that the specific functional categories of Universal Grammar serve as the fundamental guide to both first and second language acquisition. Like other accounts in the P&P framework, this model attempts to view second language acquisition as involving no real learning beyond the deductive process of parameter-setting based on the detection of certain triggers. The specific innovation of the APT model is that changes in activation strength during processing function as the trigger to the setting of parameters. Unlike other P&P models, APT does not set parameters in an absolute fashion, allowing their activation weight to change by the processing of new input over time. The use of the concept of activation in APT is far more restricted than its use in connectionist models that allow for Hebbian learning, self-organizing features maps, or back-propagation.

scholarly journals APPROACHES TO ADAPTIVE STOCHASTIC SEARCH BASED ON THE NONEXTENSIVE q-DISTRIBUTION

2006 ◽  
Vol 16 (07) ◽  
pp. 2081-2091 ◽  
Author(s):  
GEORGE D. MAGOULAS ◽  
ARISTOKLIS ANASTASIADIS
Keyword(s):  
Search Space ◽  
Stochastic Search ◽  
Diffusion Method ◽  
Benchmark Problems ◽  
Adaptive Search ◽  
Particle Swarm Optimizer ◽  
Network Training ◽  
Nonextensive Entropy ◽  
Potential Benefits ◽  
Entropic Index

This paper explores the use of the nonextensive q-distribution in the context of adaptive stochastic searching. The proposed approach consists of generating the "probability" of moving from one point of the search space to another through a probability distribution characterized by the q entropic index of the nonextensive entropy. The potential benefits of this technique are investigated by incorporating it in two different adaptive search algorithmic models to create new modifications of the diffusion method and the particle swarm optimizer. The performance of the modified search algorithms is evaluated in a number of nonlinear optimization and neural network training benchmark problems.

A window detection technique with adjustable threshold for transmitted reference receivers

2013 ◽  
Vol 3 (1) ◽  
Author(s):  
Apratim Roy ◽  
A. Rashid
Keyword(s):  
Input Data ◽  
Cmos Technology ◽  
Ultra Wideband ◽  
Power Requirement ◽  
The Core ◽  
Transmitted Reference ◽  
Detection Circuit ◽  
Detection Window ◽  
Improved Performance ◽  
Decision Circuit

AbstractThis paper presents a threshold decision circuit with an adjustable detection window designed in a 90-nm IBM CMOS technology. Together with an RF mixer, the decision Section realizes the circuit implementation of the back-end of a transmitted reference ultra wideband receiver, which is yet to be reported in literature. The proposed circuit is built on a differential amplifier core and avoids the use of integrator and sampling blocks, which reduces the device burden necessary for the architecture. Moreover, the detection window threshold of the design can be regulated by three independent factors defined by the circuit elements. The circuit is tested at an input data rate of 0.1∼2.0 Gbps and the core decision section consumes 9.14 mW from a 1.2-V bias supply (with a maximum capacity/Pdc ratio of 218.8 GHz/W). When compared against other reported decision blocks, the proposed detection circuit shows improved performance in terms of capacity and power requirement.

Sign in / Sign up

Export Citation Format

Share Document