一种有效的优化的多载波通信系统的功率分配算法

本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法，该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法，能够较快的收敛到最佳的功率点。同时，易于用硬件和软件实现。     

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

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

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

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

A new iterative order reduction (IOR) method for eigensolutions of large structures

Order reduction is a computationally efficient method to estimate some lowest eigenvalues and the corresponding eigenvectors of large structural systems by reducing the order of the original model to a smaller one. But its accuracy is limited to a small range of frequencies that depends on the selection of the retained degrees of freedom. This paper proposes a new iterative order reduction (IOR) technique to obtain accurately the eigensolutions of large structural systems. The technique retains all the inertia terms associated with the removed degrees of freedom. This hence leads to the reduced mass matrix being in an iterated form and the reduced stiffness matrix constant. From these mass and stiffness matrices, the eigensolutions of the reduced system can be obtained iteratively. On convergence the reduced system reproduces the eigensolutions of the original structure. A proof of the convergence property is also presented. Applications of the method to a practical GARTEUR structure as well as a plate have demonstrated that the proposed method is comparable to the commonly used Subspace Iteration method in terms of numerical accuracy. Moreover, it has been found that the proposed method is computationally more efficient than the Subspace Iteration method. Copyright © 2003 John Wiley & Sons, Ltd.     

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.