量子算法的NMR实现方法

量子计算机是一种以量子耦合方式进行信息处理的装置[1 ] 。原则上 ,它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2 ] 。建造大型量子计算机的主要困难是噪音、去耦和制造工艺。一方面 ,虽然离子陷阱和光学腔实验方法大有希望 ,但这些方法都还没有成功实现过量子计算。另一方面 ,因为隔离于自然环境 ,核自旋可以成为很好的“量子比特” ,可能以非传统方式使用核磁共振 (NMR)技术实现量子计算。本文介绍一种用NMR方法实现量子计算的方法 ,该方法能够用比传统方法少的步骤解决一个纯数学问题。基于该方法的简单量子计算机使用比传统计算机使用更少的函数“调用”判断一未知函数的类别。     

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.     

解线性最小二乘问题的一个新并行算法

讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 )     

基因组重排问题的一个近似算法

分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题．基于断点图的概念，给出一个时间复杂性为O(max{b^(π)，nb(π)})，空间复杂性为0(n)的求其近似最优解的算法．其中n为基因组中基因个数，π=(π1,π2，…，πn)表示n个基因的一种排列，b(π)表示排列π中的断点数．数据实验的结果表明，该近似算法可以求得较好的结果．     

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

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

CONVERGENCE OF CASCADE ALGORITHMS AND SMOOTHNESS OF REFINABLE DISTRIBUTIONS

In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).     

A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature

We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables.     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

基于遗传算法的优化排样

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

基于DTW算法的语音识别系统实现

动态时间归整(DTW)算法的实现简单有效,在孤立词语音识别系统中得到了广泛的应用.介绍了将DTW算法移植到TMS320VC5402上实现孤立词语音识别的原理、系统硬件组成和软件设计.研究结果表明,系统能满足实时性能要求,识别效果良好.