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

分析了第三代短波自动链路建立系统的工作特性及技术特点，并对系统仿真实现的原则及一些细节问题进行了较深入的探讨，同时对仿真实现中涉及的链路质量分析（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.     

FW调剖技术及应用

应用FW调剖技术有针对性地对 119口非钻停井区注水井采取了 4种精细调剖方案 ,对比了化学浅调剖应用前后注水井层间矛盾的缓解 ,纵向上吸水剖面的改善 ,注水量和吸水指数的变化及渗流能力的变化。结果表明 ,注水井化学浅调剖后 ,井区的连通油井明显受效 ,获得较高的增油量 ,水驱的开发效果得到改善。化学浅调剖可以有效地封堵高渗透层 ,扩大低渗透层注入水的波及体积 ,减缓注水井层间矛盾 ,实现了对注水井吸水剖面的有效调整 ,这对深化注水结构调整、挖掘各类油层潜力、提高储量动用程度有显著的效果。     

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

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

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

计算机远程控制系统的设计与实现

介绍了一个计算机远程控制系统的设计与实现，该系统采用客户机／服务器模式，实现远程屏幕的实时传输，采用LZW压缩算法对图像进行压缩传输，在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标，键盘的模拟方式对计算机进行实时控制。     

Note on ‘Construction of Double Sampling s‐Control Charts for Agile Manufacturing’

He and Grigoryan (Quality and Reliability Engineering International 2002; 18 :343–355) formulated the design of a double‐sampling (DS) s control chart as an optimization problem and solved it with a genetic algorithm. They concluded that the DS s control charts can be a more economically preferable alternative in detecting small shifts than traditional s control charts. We explain that, since they only considered the average sample size when the process is in control, their conclusion is questionable. Copyright © 2006 John Wiley & Sons, Ltd.     

A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization

It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.

In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively.     

Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm

The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm.     

基于遗传算法的优化排样

介绍了遗传算法以及二维不规则图形的计算机优化排样，研究了二维不规则图形排样中如何建立遗传算法的目标函数，如何实现交叉、变异运算等优化过程，找到了运用遗传算法实现二维不规则图形优化排样的方法。通过计算机编制了运用遗传算法进行二维不规则图形优化排样的运算程序，并对部分样形进行了优化排样，结果比较满意。