可变抽样区间的非参数控制图

最近几年一些学者研究了可变抽样区间的质量控制图。Amin等提出了可变抽样区间(VSI)的非参数控制图———符号 (Sign)统计量图〔1〕。本文在此基础上研究位置VSI符号控制图的制定方法 ,并设计离散VSI符号控制图。符号控制图的优点是对非正态总体亦可应用 ,并且不需要过程方差的信息。本文将所设计的VSI符号控制图同固定抽样区间 (FSI)的常规图作比较 ,并举实例说明符号控制图的应用     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。     

Field Theory Methods in Classical Dynamics

A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

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.     

基于FPGA并行处理的实时图像相关速度计

研究制作了一种采用高速线阵CCD的实时相关速度计,其测量数据的输出速率可达每秒一万次。针对以往光学相关测速方法的问题进行了讨论,探讨了适合FPGA并行处理的算法,制作了高速线阵CCD摄像机及其处理装置。通过实验验证了系统的可行性和可实现性。     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.     

Quantization of Underdamped, Critically Damped, and Overdamped Electric Circuits with a Power Source

We have investigated the quantum mechanical effect of the underdamped, critically damped, and overdamped electric circuits with a power source. The charge of the underdamped circuit oscillates while those of the critically damped and overdamped ones don't. The wave function of the system of overdamped circuit represented parabolic cylinder function while underdamped circuit was represented by well-known Hermite polynomial. The eigenvalues of underdamped circuit is discrete while those of the critically damped and overdamped ones are given as continuously.     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

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.