Interpolating Quintic Polynomial with C~1 Continuity

A method constructinq C~1 Piecewise quintic polynomial over a triangular grid to interpo-late function values and partial derivatives at vertices is presented in this paper.The set of precise poly-nomials of this method is discussed.     

基于局部多项式逼近的变参数梯度估计算法

本文分析了梯度辨识算法跟踪时变系统的缺点，提出了一种新的基于局部多项式逼近的变参数梯度估计算法。本算法具有良好跟踪性能特别适用于时变系统跟踪且其对噪声的敏感程度与一般梯度估计方法相当。仿真结果验证了其良好性能。     

集群计算机上基于BSP模型的并行算法及其程序设计

文章分析了BSP模型和集群计算机的特点，给出了在集群计算机根据BSP模型设计并行算法及其软件的原则，举例说明了利用BSP模型代价公式定性分析并行算法性能的方法，并利用实验结果验证了得出的结论。结果表明模型的成功地抽象出了集群计算中影响算法性能的诸种因素，并通过代价公式反映出来，利用代价公式可以基本准确地估计并行算法代价，这对集群计算机上的并行算法及其软件及设计和优化具有重要的指导意义。     

第三代短波自动链路建立系统特性分析及仿真实现

分析了第三代短波自动链路建立系统的工作特性及技术特点，并对系统仿真实现的原则及一些细节问题进行了较深入的探讨，同时对仿真实现中涉及的链路质量分析（LQA）算法进行了研究。     

An EM‐based adaptive multiple target tracking filter

Tracking targets of interest is one of the major research areas in radar surveillance systems. We formulate the problem as incomplete data estimation and apply EM to the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The advantage is that the measurement‐update deals with multiple measurements in parallel and the parameter‐update estimates the system parameters on the fly. Experiments tracking separate targets in parallel show that tracking maintenance ratio of the proposed system is better than that of NNF and RMS position error is smaller than that of PDAF. Also, the system parameters are correctly obtained even from incorrect initial values. Copyright © 2001 John Wiley & Sons, Ltd.     

EVOLUTIONARY ALGORITHMS WITH PREFERENCE FOR MANUFACTURING CELLS FORMATION

Due to the combinatorial nature of cell formation problem and the characteristics of multi-objective and multi-constrain, a novel method of evolutionary algorithm with preference is proposed. The analytic hierarchy process （AHP） is adopted to determine scientifically the weights of the sub-objective functions. The satisfaction of constraints is considered as a new objective, the ratio of the population which doesn＇t satisfy all constraints is assigned as the weight of new objective. In addition, the self-adaptation of weights is applied in order to converge more easily towards the feasible domain. Therefore, both features multi-criteria and constrains are dealt with simultaneously. Finally, an example is selected from the literature to evaluate the performance of the proposed approach. The results validate the effectiveness of the proposed method in designing the manufacturing cells.     

基于双因子认证技术的网络身份识别

本文提出了一种基于动态双因子认证技术的网络身份识别方法,用户每次登录的口令是利用系统时间和用户ID通过MD5加密算法计算得到,其通过MD5加密后生成的登录口令是随机的,这将进一步提高开放网络环境下身份识别的可靠性和安全性。同时,本文还提出网络身份识别技术可以应用到各类网站的服务器上,用来完成对用户身份的识别,以提高网络系统的安全性。     

基于MFQ的补丁优先算法的研究与实现

目前采用的视频流调度算法，没有充分利用补丁流满足服务率高而占用系统资源少的优势，系统效率较低．为了提高效率，提出了一种基于MFQ的补丁优先算法，并给出了该算法的系统流程。通过对实验结果的比较，该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性．     

软件无线电中采样率转换技术的实现及在3G中的应用

目前移动通信标准繁多,且新旧体制混杂,很难做到统一.为了实现互连互通,目前比较可行的方法是采用软件无线电.采样率转换技术是实现互连互通的关键.文中针对第三代移动通信系统(3G)中不同通信体制的带宽、速率要求,根据分级变换的思想,对3G中的CDMA2000和TDSCDMA的采样率转换方案进行了设计,并对3G中的5种制式的采样率转换方案进行了分析比较.实验表明,这一方案可以在采样率变换的高效网络结构基础上进一步降低滤波运算量和存储量.     

Wavefront reduction using graphs,neural networks and genetic algorithm

This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd.