On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

光纤白光干涉仪等臂长技术研究

介绍了几种光纤干涉仪等臂长技术,比较了各自的优缺点和适用范围,对光纤干涉仪的平衡有较大的参考价值。     

用自适应脉冲微扰引导混沌系统到周期解

用自适应脉冲微扰方法控制的系统的某个系统变量作为驱动,设计了一种自适应控制器方法对两个或多个响应混沌系统进行脉冲微扰,引导这些系统从混沌运动到低周期运动,实现同时控制多个混沌系统到不同的周期态. 当选择相同的自适应控制器输入变量实施脉冲微扰时,还可控制两个或多个混沌系统达到不同的周期态同步. 通过对R?ssler混沌系统的仿真研究证实了方法的有效性. 关键词： 混沌控制 系统参量 自适应控制器 脉冲微扰 周期态同步     

Discretization of the solutions to Poisson’s equation

Sharp estimates (in the power scale) are obtained for the discretization error in the solutions to Poisson’s equation whose right-hand side belongs to a Korobov class. Compared to the well-known Korobov estimate, the order is almost doubled and has an ultimate value in the power scale.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

An admissible minimax estimator of a bounded scale-parameter in a subclass of the exponential family under scale-invariant squared-error loss

A subclass of the scale-parameter exponential family is considered and for the rth power of the scale parameter, which is lower bounded, an admissible minimax estimator under scale-invariant squared-error loss is presented. Also, an admissible minimax estimator of a lower-bounded parameter in the family of transformed chi-square distributions is given. These estimators are the pointwise limits of a sequence of Bayes estimators. Some examples are given.     

Changes in the kurtosis parameter of super-Gaussian beams passing through a spherically aberrated lens

Based on the Collins formula and irradiance moments definition, the propagation of the kurtosis parameter of super-Gaussian beams through a spherically aberrated lens is studied. Detailed numerical results are given. It is shown that, as compared with aberration-free super-Gaussian beams, the profile of spherically aberrated super-Gaussian beams can be leptokurtic, mesokurtic or platykurtic, depending on the aberration and propagation distance. The results for the spherically aberrated Gaussian beams can be dealt with as a special case treated in this paper. Finally, the advantage of our method is pointed out.     

Hydrophobicity-induced drying transition in alkanethiol self-assembled monolayer—water interface

During the course of our investigation of the electron transfer properties of some redox species through highly hydrophobic long chain alkanethiol molecules on gold in aqueous and non-aqueous solvents, we obtained some intriguing results such as unusually low interfacial capacitance, very high values of impedance and film resistance, all of which pointed to the possible existence of a nanometer size interfacial gap between the hydrophobic monolayer and aqueous electrolyte. We explain this phenomenon by a model for the alkanethiol monolayer—aqueous electrolyte interface, in which the extremely hydrophobic alkanethiol film repels water molecules adjacent to it and in the process creates a shield between the monolayer film and water. This effectively increases the overall thickness of the dielectric layer that is manifested as an abnormally low value of interfacial capacitance. This behaviour is very much akin to the ‘drying transition’ proposed by Lum, Chandler and Weeks in their theory of length scale dependent hydrophobicity. For small hydrophobic units consisting of apolar solutes, the water molecules can reorganize around them without sacrificing their hydrogen bonds. Since for an extended hydrophobic unit, the existence of hydrogen bonded water structure close to it is geometrically unfavourable, there is a net depletion of water molecules in the vicinity leading to the possible creation of a hydrophobic interfacial gap.     

Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.     

A quark model based on QCD scale anomaly

We consider a quark model based on QCD scale anomaly in which the quarks move in the field of an effective glueball field. Hadrons correspond to solitonic bags of higher energy density in a nonperturbative sea of condensed gluons. We calculate the static properties of nucleon in this model and find that the nucleon mass is far too large (2.4–4 GeV) and the proton charge radius (0.37–0.54 fm) is low. The proton gyromagnetic ratio and g_A/g_v are in reasonable agreement with the experimental numbers.