An efficient second‐order characteristic finite element method for non‐linear aerosol dynamic equations

In the paper we consider the non‐linear aerosol dynamic equation on time and particle size, which contains the advection process of condensation growth and the process of non‐linear coagulation. We develop an efficient second‐order characteristic finite element method for solving the problem. A high accurate characteristic method is proposed to treat the condensation advection while a second‐order extrapolation along the characteristics is proposed to approximate the non‐linear coagulation. The method has second‐order accuracy in time and the optimal‐order accuracy of finite element spaces in particle size, which improves the first‐order accuracy in time of the classical characteristic method. Numerical experiments show the efficient performance of our method for problems of log‐normal distribution aerosols in both the Euler coordinates and the logarithmic coordinates. Copyright © 2009 John Wiley & Sons, Ltd.     

Forecasting with unequally spaced data by a functional principal component approach

The Principal Component Regression model of multiple responses is extended to forccast a continuous-time stochastic process. Orthogonal projection on a subspace of trigonometric functions is applied in order to estimate the principal components using discrete-time observations from a sample of regular curves. The forecasts provided by this approach are compared with classical principal component regression on simulated data.     

一个求解单调线性互补问题的不可行内点算法

基于核函数设计一个求解单调线性互补问题的不可行内点算法,在算法的每一步迭代中,只需要求解线性方程组得到新的搜索方向. 然后,按照一定的线性搜索规则,选择合适的步长得到新的迭代点.数值实验结果显示该算法是有效的.     

590P 4Q直流调速器在带钢纵剪机组电气控制中的应用

简单介绍了带钢纵剪机组的用途及其工艺流程,描述了全数字式590P 4Q直流调速器直流系统功能,设计了590P 4Q直流调速器的供电系统和直流调速系统,利用PLC和590P 4Q调速器之间强大的通讯能力,实现了PLC和直流调速器的数字通讯,提高了纵剪机组的生产能力和效率,降低了生产成本。     

Gaussian process assisted coevolutionary estimation of distribution algorithm for computationally expensive problems

In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.     

双线性系统参数估计中的泰勒级数方法

本文给出了一种利用泰勒级数估计双线性系统参数的方法。通过将输入输出进行泰勒级数展开,把原微分方程模型转化成一个代数方程,进而利用最小二乘原理得到参数的估值。     

Slicing Software for Model Construction

Applying finite-state verification techniques (e.g., model checking) to software requires that program source code be translated to a finite-state transition system that safely models program behavior. Automatically checking such a transition system for a correctness property is typically very costly, thus it is necessary to reduce the size of the transition system as much as possible. In fact, it is often the case that much of a program's source code is irrelevant for verifying a given correctness property.In this paper, we apply program slicing techniques to remove automatically such irrelevant code and thus reduce the size of the corresponding transition system models. We give a simple extension of the classical slicing definition, and prove its safety with respect to model checking of linear temporal logic (LTL) formulae. We discuss how this slicing strategy fits into a general methodology for deriving effective software models using abstraction-based program specialization.     

一个新的线性规划预校正算法

提出了一种新的线性规划预校正算法,预步是取的Ｅｕｌｅｒ方向,算法复杂度为Ｏ（n~(1/2)Ｌ）