Hilbert algebras as implicative partial semilattices

The infimum of elements a and b of a Hilbert algebra are said to be the compatible meet of a and b, if the elements a and b are compatible in a certain strict sense. The subject of the paper will be Hilbert algebras equipped with the compatible meet operation, which normally is partial. A partial lower semilattice is shown to be a reduct of such an expanded Hilbert algebra i ?both algebras have the same ?lters.An expanded Hilbert algebra is actually an implicative partial semilattice (i.e., a relative subalgebra of an implicative semilattice),and conversely.The implication in an implicative partial semilattice is characterised in terms of ?lters of the underlying partial semilattice.     

耦合发电机系统的自适应控制与同步

讨论了耦合发电机系统的自适应控制和参数未知时的自适应同步问题.设计了自适应控制器，将耦合发电机系统的混沌轨道镇定到平衡点，并使得两个参数未知的耦合发电机系统达到了混沌同步.数值模拟验证了所设计的控制器的有效性. 关键词： 耦合发电机系统 自适应控制 平衡点 同步     

卡尔曼滤波紫外光度法同时测定酱油、食醋中的山梨酸和苯甲酸

在酸性条件下，采用乙酸乙酯萃取、Na2HPO4溶液反萃取分离酱汪、食醋中的山梨酸、苯甲酸，卡尔曼滤波法计算结果，并与比值导数波谱法进行比较。结果表明，卡尔曼滤波法较地数波谱法有较高准确度和精密度，并能监测干扰物质存在与否。用于实际样品分析有更高的可靠性。     

基于像素特征的路面裂缝图像自适应滤噪

分析了破损路面图像的像素点区域特征，针对不同区域提出加权邻域滤波和自适加权中值滤波算法。其权值是通过对图像中区域特征的推理得到的，所以算法中能根据图像的区域特征自适应的进行滤波。试验表明，本算法能够有效滤除噪声，并具有很好的细节保护能力。     

Least‐squares finite element method on adaptive grid for PDEs with shocks

We apply the least‐squares finite element method with adaptive grid to nonlinear time‐dependent PDEs with shocks. The least‐squares finite element method is also used in applying the deformation method to generate the adaptive moving grids. The effectiveness of this method is demonstrated by solving a Burgers' equation with shocks. Computational results on uniform grids and adaptive grids are compared for the purpose of evaluation. The results show that the adaptive grids can capture the shock more sharply with significantly less computational time. For moving shock, the adaptive grid moves correctly with the shock. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

一种非刚性医学图像点匹配方法

提出了一种非刚性点匹配的算法并把其运用于医学图像配准．该算法采用信号滤波的方法来获得点集间的匹配信息，并运用松弛标记法将各点邻域关系对模糊的匹配信息进行迭代获得明确的匹配关系．在此基础上，利用高斯径向基函数来描述点模式间的弹性形变，在基本的迭代框架下实现问题的求解．实验结果显示在形变程度为5％、出格点比率50％和噪声标准差为5％的情况下该算法的匹配误差能控制在0．13以下，表明了该算法的鲁棒性和有效性，较好地解决了医学非刚性形变的点匹配问题．     

一种新型频域均衡器在水声通信中的应用

在传统频域均衡器的基础上,结合多载波频移键控调制方式的频谱结构,利用接收信号和参考信号的相关性及均衡器的滤波系数,提出了一种兼具均衡与解调功能的新型频域均衡器结构.该均衡器简单、有效地克服了水声信道中多径传播产生的码间干扰和频率选择性衰落等问题,简化了水声通信系统接收机的复杂度. 新型频域均衡器的解调原理以非相关解调算法为基础,但由于利用了均衡器的计算结果,其差错性能优于传统的非相关解调算法,计算机仿真试验表明,改进后的方法使差错性能提高了2 dB;实际水声通信实验表明,该均衡器能够有效地提高水声通信系统的可靠性,具有很好的应用前景.     

ISAT方法在射流火焰PDF计算中的应用

描述了一种应用于湍流反应流场中，用以减少化学反应计算时间的有效方法——当地自适应建表方法，并对之做了改进，使其可以适用于变时间步长环境下的计算流场．应用此方法计算甲烷／空气湍流射流扩散火焰问题，结果显示同直接数值积分方法比较，当地自适应建表方法可以在保证满足计算精度要求的条件下有效的减少化学反应计算时间．     

Equality and inequality constrained optimization algorithms with convergent stepsizes

In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker.