Explicit memory schemes for evolutionary algorithms in dynamic environments

Copyright @ 2007 Springer-VerlagProblem optimization in dynamic environments has atrracted a growing interest from the evolutionary computation community in reccent years due to its importance in real world optimization problems. Several approaches have been developed to enhance the performance of evolutionary algorithms for dynamic optimization problems, of which the memory scheme is a major one. This chapter investigates the application of explicit memory schemes for evolutionary algorithms in dynamic environments. Two kinds of explicit memory schemes: direct memory and associative memory, are studied within two classes of evolutionary algorithms: genetic algorithms and univariate marginal distribution algorithms for dynamic optimization problems. Based on a series of systematically constructed dynamic test environments, experiments are carried out to investigate these explicit memory schemes and the performance of direct and associative memory schemes are campared and analysed. The experimental results show the efficiency of the memory schemes for evolutionary algorithms in dynamic environments, especially when the environment changes cyclically. The experimental results also indicate that the effect of the memory schemes depends not only on the dynamic problems and dynamic environments but also on the evolutionary algorithm used

Gestational age at delivery and special educational need: retrospective cohort study of 407,503 schoolchildren

<STRONG>Background</STRONG> Previous studies have demonstrated an association between preterm delivery and increased risk of special educational need (SEN). The aim of our study was to examine the risk of SEN across the full range of gestation. <STRONG>Methods and Findings</STRONG> We conducted a population-based, retrospective study by linking school census data on the 407,503 eligible school-aged children resident in 19 Scottish Local Authority areas (total population 3.8 million) to their routine birth data. SEN was recorded in 17,784 (4.9%) children; 1,565 (8.4%) of those born preterm and 16,219 (4.7%) of those born at term. The risk of SEN increased across the whole range of gestation from 40 to 24 wk: 37–39 wk adjusted odds ratio (OR) 1.16, 95% confidence interval (CI) 1.12–1.20; 33–36 wk adjusted OR 1.53, 95% CI 1.43–1.63; 28–32 wk adjusted OR 2.66, 95% CI 2.38–2.97; 24–27 wk adjusted OR 6.92, 95% CI 5.58–8.58. There was no interaction between elective versus spontaneous delivery. Overall, gestation at delivery accounted for 10% of the adjusted population attributable fraction of SEN. Because of their high frequency, early term deliveries (37–39 wk) accounted for 5.5% of cases of SEN compared with preterm deliveries (<37 wk), which accounted for only 3.6% of cases. <STRONG>Conclusions</STRONG> Gestation at delivery had a strong, dose-dependent relationship with SEN that was apparent across the whole range of gestation. Because early term delivery is more common than preterm delivery, the former accounts for a higher percentage of SEN cases. Our findings have important implications for clinical practice in relation to the timing of elective delivery

Top Partner Discovery in the T→tZT\to tZ channel at the LHC

In this paper we study the discovery potential of the LHC run II for heavy vector-like top quarks in the decay channel to a top and a $Z$ boson. Despite the usually smaller branching ratio compared to charged-current decays, this channel is rather clean and allows for a complete mass reconstruction of the heavy top. The latter is achieved in the leptonic decay channel of the $Z$ boson and in the fully hadronic top channel using boosted jet and jet substructure techniques. To be as model-independent as possible, a simplified model approach with only two free parameters has been applied. The results are presented in terms of parameter space regions for $3\sigma$ evidence or $5\sigma$ discovery for such new states in that channel.Comment: 24 pages, 8 figures, version 2 updated to JHEP 01 (2015) 08

Hardy's inequality for functions vanishing on a part of the boundary

We develop a geometric framework for Hardy's inequality on a bounded domain when the functions do vanish only on a closed portion of the boundary.Comment: 26 pages, 2 figures, includes several improvements in Sections 6-8 allowing to relax the assumptions in the main results. Final version published at http://link.springer.com/article/10.1007%2Fs11118-015-9463-

A particle swarm optimization based memetic algorithm for dynamic optimization problems

Copyright @ Springer Science + Business Media B.V. 2010.Recently, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are dynamic. This paper investigates a particle swarm optimization (PSO) based memetic algorithm that hybridizes PSO with a local search technique for dynamic optimization problems. Within the framework of the proposed algorithm, a local version of PSO with a ring-shape topology structure is used as the global search operator and a fuzzy cognition local search method is proposed as the local search technique. In addition, a self-organized random immigrants scheme is extended into our proposed algorithm in order to further enhance its exploration capacity for new peaks in the search space. Experimental study over the moving peaks benchmark problem shows that the proposed PSO-based memetic algorithm is robust and adaptable in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant No. 70431003 and Grant No. 70671020, the National Innovation Research Community Science Foundation of China under Grant No. 60521003, the National Support Plan of China under Grant No. 2006BAH02A09 and the Ministry of Education, science, and Technology in Korea through the Second-Phase of Brain Korea 21 Project in 2009, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and the Hong Kong Polytechnic University Research Grants under Grant G-YH60

Study of the B^0 Semileptonic Decay Spectrum at the Upsilon(4S) Resonance

We have made a first measurement of the lepton momentum spectrum in a sample of events enriched in neutral B's through a partial reconstruction of B0 --> D*- l+ nu. This spectrum, measured with 2.38 fb**-1 of data collected at the Upsilon(4S) resonance by the CLEO II detector, is compared directly to the inclusive lepton spectrum from all Upsilon(4S) events in the same data set. These two spectra are consistent with having the same shape above 1.5 GeV/c. From the two spectra and two other CLEO measurements, we obtain the B0 and B+ semileptonic branching fractions, b0 and b+, their ratio, and the production ratio f+-/f00 of B+ and B0 pairs at the Upsilon(4S). We report b+/b0=0.950 (+0.117-0.080) +- 0.091, b0 = (10.78 +- 0.60 +- 0.69)%, and b+ = (10.25 +- 0.57 +- 0.65)%. b+/b0 is equivalent to the ratio of charged to neutral B lifetimes, tau+/tau0.Comment: 14 page, postscript file also available at http://w4.lns.cornell.edu/public/CLN

Small Polarons in Transition Metal Oxides

The formation of polarons is a pervasive phenomenon in transition metal oxide compounds, with a strong impact on the physical properties and functionalities of the hosting materials. In its original formulation the polaron problem considers a single charge carrier in a polar crystal interacting with its surrounding lattice. Depending on the spatial extension of the polaron quasiparticle, originating from the coupling between the excess charge and the phonon field, one speaks of small or large polarons. This chapter discusses the modeling of small polarons in real materials, with a particular focus on the archetypal polaron material TiO2. After an introductory part, surveying the fundamental theoretical and experimental aspects of the physics of polarons, the chapter examines how to model small polarons using first principles schemes in order to predict, understand and interpret a variety of polaron properties in bulk phases and surfaces. Following the spirit of this handbook, different types of computational procedures and prescriptions are presented with specific instructions on the setup required to model polaron effects.Comment: 36 pages, 12 figure

H-Dihyperon in Quark Cluster Model

The H dihyperon (DH) is studied in the framework of the SU(3) chiral quark model. It is shown that except the $\sigma$ chiral field, the overall effect of the other SU(3) chiral fields is destructive in forming a stable DH. The resultant mass of DH in a three coupled channel calculation is ranged from 2225 $MeV$ to 2234 $MeV$.Comment: 9 pages, emte

Antimony-doped graphene nanoplatelets

Heteroatom doping into the graphitic frameworks have been intensively studied for the development of metal-free electrocatalysts. However, the choice of heteroatoms is limited to non-metallic elements and heteroatom-doped graphitic materials do not satisfy commercial demands in terms of cost and stability. Here we realize doping semimetal antimony (Sb) at the edges of graphene nanoplatelets (GnPs) via a simple mechanochemical reaction between pristine graphite and solid Sb. The covalent bonding of the metalloid Sb with the graphitic carbon is visualized using atomic-resolution transmission electron microscopy. The Sb-doped GnPs display zero loss of electrocatalytic activity for oxygen reduction reaction even after 100,000 cycles. Density functional theory calculations indicate that the multiple oxidation states (Sb3+ and Sb5+) of Sb are responsible for the unusual electrochemical stability. Sb-doped GnPs may provide new insights and practical methods for designing stable carbon-based electrocatalystsclose0

A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems

Copyright @ Springer-Verlag 2008Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, two diversity maintaining methods, called adaptive dual mapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant Nos. 70431003 and 70671020, the National Innovation Research Community Science Foundation of China under Grant No. 60521003, and the National Support Plan of China under Grant No. 2006BAH02A09 and the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01