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.     

混沌实验数据处理及仿真

大学物理实验中混沌实验大多采用观察现象的方法进行,本实验采用蔡氏电路(Chua s circuit)产生混沌行为.在观察不同初始值条件下出现的倍周期分岔、阵发混沌、奇异吸引子等相图及现象的基础上,通过对采集数据进行处理,对负电阻伏安特性进行分段线性拟合,用功率频谱法、计算机仿真方法(龙格-库塔数值积分法)对混沌现象进行描绘,将实验数据与非线性方程组的数值解相结合,呈现出混沌现象的本质.     

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.     

Some degenerate and quasilinear parabolic systems not in divergence form

This paper deals with positive solutions of degenerate and quasilinear parabolic systems not in divergence form: u_t=u^p(Δu+av), v_t=v^q(Δv+bu), with null Dirichlet boundary conditions and positive initial conditions, where p, q, a and b are all positive constants. The local existence and uniqueness of classical solution are proved. Moreover, it will be proved that all solutions exist globally if and only if ab?λ₁², where λ₁ is the first eigenvalue of −Δ in Ω with homogeneous Dirichlet boundary condition.     

具连续时滞Liénard方程概周期解的存在唯一性

结合Liapunov泛函，研究了具连续时滞Lienard方程概周期解的存在唯一性和安全一致渐进稳定性。     

FJZ-250型高速分幅相机时间测量不确定度分析

FJZ-250型高速转镜分幅相机因转镜速度的不可重复性，光机结构的构造原理和控制系统各路高压触发时间的漂移，导致了时间测量的不确定度。为此，须对相机测量数据进行校正。阐述了校正方法、提供了逐幅校正位置误差的修正系数。若以预置转速对应的名义周期值去处理测量结果，则相机的时间测量合成小确定度将达1％，对名义周期值和名义幅间间隔时间值进行修正后，则可降至0.3％。     

WKB Wave Function of the General Time-Dependent Quadratic Hamiltonian System

We derived the WKB wave function for the general time-dependent quadratic Hamiltonian system using a unitary transformation method. We applied our research to sinusodially drived Caldirola–Kanai oscillator and confirmed that the time evolution of our approximated WKB wave function is similar to that of the exact one. This wave function can be used to analyze the interference between the probability amplitudes contributed by the area of overlap in phase space of quantum states.     

首次穿过边界概率及其在金融中的应用

本文把数学和管理科学有机结合,为数学应用提出问题,得出新结果,推广了J.Michel Harrison(1985)[1]第43页的命题27,并给出了在金融中的应用.     

Time Series Prediction Based on Chaotic Attractor

A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.     

Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.