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.     

A dynamical test of phase transition order: New things in old places or old wine in new bottles

We first discuss nonlinear aspects of phase transition theory applied to a particular liquid crystal phase transition. A simple derivation is given to show how two coupled Goldstone modes (one appearing as gauge fluctuations of the ordered phase) can force a phase transition, against all expectations, to take place discontinuously (theory of Halperin, Lubensky, and Ma)-but the discontinuity may be immeasurably small. Then, we describe a new dynamical test of phase transition order, developed by Cladiset al., that turns out to be more sensitive than x-ray diffraction and adiabatic calorimetry. Quantitative data found by this new method are in excellent agreement with the measurements of adiabatic calorimetry and x-ray diffraction as well as expectations implicit in the predictions of HLM.This is the text of an after-banquet talk given at the CNLS Workshop on the Dynamics of Concentrated Systems.     

An applied cell mapping method for optimal control problems

From the application point of view, a series of modifications are proposed for the cell mapping method discussed in Ref. 1 for the optimal control analysis of dynamical systems. The cell order around the target set is rearranged. A set of common discriminate principles is used for the selection of the optimal one among competing control strategies of the same cost. Inequality constraints of the system are taken into account. The number of elements in the set of allowable time intervals is not prescribed, but left open. These modifications seem to make the cell mapping method more efficient for analyzing feedback systems and for obtaining their global optimal control information. The algorithms presented in this paper could broaden the application of the cell mapping approach of Ref. 1 to a wider class of engineering problems.     

运用量子约束动力学对具有耗散的量子位的追踪控制

在有限温度环境内，量子约束动力学及其追踪控制可使退相干系统的相干性稳定一段时间.约束方程产生的控制场能够按量子比特的动力学状态进行控制(量子动力学轨道的反馈控制)；依靠量子比特的这种反馈效应，可使量子位稳定在设定的时间内.同时，在量子位的稳定方面，温度扮演一种消极的角色. 关键词： 量子约束动力学 耗散量子位的控制 追踪控制 量子比特的反馈效应     

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

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

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002     

基因芯片荧光图象采集与分析

描述了基因芯片荧光图象的光学共聚焦成象,大范围高速扫描与控制,数据采集的原理和方法.并讨论了基因芯片荧光图象的分析算法,即模板定位与阈值分割相结合的半自动算法,并将其计算结果与完全采用人工分割算法的结果进行了比较.     

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.