处理机具有不同的开始加工时间的Q,ai｜pmtn｜Cmax排序问题

本文给出处理机具有不同的开始加工时间的Ｑ，ａｉ｜ｐｍｉｔｎ｜Ｃｍａｘ排序问题的一个最优算法，算法的复杂性为Ｏ（ｍ＾２ｎ＾２）。     

BSC（2^m,2^n）密码的递归表示与双对称性证明

在已有研究成果的基础上,进一步研究了双对称密码ＢＳＣ（２＾ｍ,２＾ｎ）算法设计,给出了ＢＳＣ（２＾ｍ,２＾ｎ）算法的递归表示,并严格证明了ＢＳＣ（２＾ｍ,２＾ｎ）密码是双对称的。     

抛物型方程初边值问题的弱形式Schwarz交替算法及L^2误差估计

考虑求解抛物型方程初边值问题的区域分裂算法，我们给出了时间变量离散的弱形式Ｓｃｈｗａｒｚ交替算法，并给出了算法的Ｌ＾２－模及Ｈ＾１－模误差估计。     

识别三种非环数据库模式的分布式算法

对α－，β－，Ｂ－这几种非环数据库模式，在分布式环境给出如何识别它们的算法ＤＢＦＰＲＵＮＥ。该算法最坏的消息复杂度是Ｏ（ｎ＾２＋ｍ），而最坏的时间复杂度是Ｏ（ｎ＾２），其中ｎ是网络中结点的个数，ｍ是网络上边的个数。     

基于序列转换的p型有限元后误差估计

提出了基于序列转换的ｐ型有限元后误差估计外推算法，当问题的解是光滑的时间，可采用ε算法对能量模进行估计，当问题的解是非光滑的时间和多项式外推算法，这种情况下，如果采用均匀或近似均匀网和ｈ＾２或外推，如奇附近采用强梯义网格，则ｈ＾３薄（ｈ６３，Ｈ＾６）外推更加适合，计算结果表明提方法有好的计算精度和较高的可靠性。     

引入二阶导数的梯度法

对最优化方法中的梯度算法进行了改进，当ｅ＾２ｆ／ｅｘ＾２≠０时，将二阶导数与梯度方向相结合，构造出一种新的下降方向ｄ＝「１＋δ／（ｅ＾２ｆ／ｅｘ＾２）」（ｅｆ／ｅｘ），其中δ＝１或－１，用新的下降方向设计了一种算法，使梯度法得到改进，新的算法比梯度法的收敛速度快，而且比牛顿法计算量小。     

求解货郎担问题的几何算法

提出了求解货郎担问题的一种几何算法，它的时间复性为：Ｏ（ｎ＾３／ｍ）次比较，Ｏ（ｎ＾２）次求距离运算与Ｏ（ｎ＾３／ｍ＾３）次加法运算，其中ｎ，ｍ分别为点集的点数和凸包顶点数。     

Vandermonde矩阵求逆的并行算法及其复杂度

分析Ｖａｎｄｅｒｍｏｎｄｅ矩阵的一种求逆递推式,利用卷积技术研究递推式求解的并行计算方法,给出了并行算法的实现方案,该算法的时间复杂度为Ｏ（ｌｏｇ２ｎ＾２）。     

最小T—2倍树的构造算法

本文提出了对任意一棵树的顶点赋权使满足一定约束条件的最小Ｔ－２倍树的定义，并给出了一个时间复杂度为Ｏ（ｎ＾２）的构造算法。     

计算加权Moore—Penrose逆AM^＋,N的一个改进的并 …

利用ＰＲＥＰＡＲＴＡＦＴ和ＳＡＲＷＡＴＥ Ｄ Ｖ＾〔６〕的一些结果,给出一个计算回权Ｍｏｏｒｅ－Ｐｅｎｒｏｓｅ逆ＡＮＭ＾＋的改进的并行算法,改善了文献〔８〕中提出的算法。在与ＰＲＥＰＡＲＴＡＦ Ｐ和ＳＡＲＷＡＴＥＤＶ文〔６〕中相同的假设下证明了改进的并行算法的时间复杂性和处理机台数分别为Ｔ＾－＝０（ｌｏｇｎ）＾２）,Ｐ＝ｍａｘ｛「ｍ／ｎ」＾２ｎ＾α／ｌｏｇｎ,２ｒ＾１／２ｎα／（ｌｏｇｒｌｏｇｎ）     

Fast cholesky factorization algorithm for s. p. d block-Toeplitz matrices

A fast Cholesky factorization algorithm based on the classical Schur algorithm for themp×mp symmetric positive definite (s. p. d) block-Toeplitz matrices is presented. The relation between the generator and the Schur complement of the matrices is explored. Besides, by applying the hyperbolic Householder transformations, we can reach an improved algorithm whose computational complexity is2p ²m³−4pm³+3/2m³+O(pm). Foundation item: Supported by the Natural Science Foundation of Hubei province Biography: ZHANG Li(1973-), Female, MS, Research interests is in numerical algebra.     

t-bit semiclassical quantum Fourier transform

Because of the difficulty of building a high-dimensional quantum register,this paper presents an implementation of the high-dimensional quantum Fourier transform(QFT)based on a low-dimensional quantum register.First,we define the t-bit semi- classical quantum Fourier transform.In terms of probability amplitude,we prove that the transform can realize quantum Fourier transformation,illustrate that the requirement for the two-qubit gate reduces obviously,and further design a quantum circuit of the transform.Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm,we then redesign a circuit for Shor’s algorithm,whose required computation resource is approximately equal to that of Parker’s.The requirement for elementary quantum gates for Parker’s algorithm is 3 O (logN),and the quantum register for our circuit re- quires t-1 more dimensions than Parker’s.However,our circuit is t2 times as fast as Parker’s,where t is the width of the window.     

Remote sensing of algal blooms using a turbidity-free function for near-infrared and red signals

HARMFUL ALGAL BLOOM ACTS UPON IMPORTANT ENVIRON-MENTAL PROBLEMS IN COASTAL WATERS.A UNIFIED AND IM-PLEMENTING METHOD FOR SURVEY AND MONITORING ALGALBLOOMS HAS BEEN DEVELOPED SINCE LAST DECADE.HOWEVER THERE IS A DATA GAP OF ABOUT TENS YEARS IN THE PERIOD W…     

Remarks on the bounds for cryptanalysis of low private key RSA

Boneh and Durfee have developed a cryptanalytic algorithm on low private key RSA. The algorithm is based on lattice basis reduction and breaks RSA with private key d<N^0.292. Later on, an improved version by Blömer and May enhanced the efficiency, while reaching approximately this same upper bound. Unfortunately, in both the algorithms, there is a critical error in theoretical analysis, leading to the overestimated upper bound N^0.292. In this paper we present a more precise analytical model, with which the theoretical upper bound on d is modified to approximately d<N^0.277 for ordinary RSA systems with a 1024-bit public key (N,e).     

DNA modular subtraction algorithm based on linear self-assembly

This paper presents a DNA algorithm based on linear self-assembly which gives the result of the modular subtraction operation of two nonnegative integers. For two n-bit nonnegative integers A and B, the algorithm gives the result of A-B mod 2 ⁿ . An extended borrow tag which indicates the relation of the minuend and the subtrahend is included in the resulting strand so that the pre-classification based on A>B or B>A is not required before the experiment. From the resulting strand, we can draw the information of operation result, operands, borrow, and the tag of the relation between the minuend and the subtrahend. The algorithm takes advantage of the parallelism characteristic of DNA computing: while given two sets of operands (one the minuend set and the other subtrahend set), the modular subtraction operation of these two sets can be achieved by a parallel processing procedure. The feasibility of the algorithm is based on a known experiment. The algorithm is of spontaneous characteristic which prevents the scale of the experimental procedures from growing with the length of the operands. As for the length of the operands n, there are O(n) kinds of strands required in the experiment, and the biochemical experimental procedures can be accomplished in constant number of steps.     

最大团问题的竞争决策算法

分析了最大团问题的数学性质,根据推导出来的性质设计求解最大团问题的竞争决策算法,且算法的时间复杂度分析结果为O(n~3)。并用提出的算法求解最大团问题中的标准测试示例,测试结果表明,算法具有良好的求解效果。     

正定Hermite矩阵流形上代数Lyapunov方程的信息几何算法

对于正定Hermite矩阵流形上的代数Lyapunov方程 A H X + XA + P =0, 基于流形的黎曼几何结构, 作者以矩阵- A H X + XA 和 P 之间的测地距离为目标函数, 提出了代数Lyapunov方程数值解的信息几何算法. 最后,给出了正定Hermite矩阵流形上的代数Lyapunov方程的数值模拟结果.      

空间调制系统中一种低复杂度比特映射算法

空间调制(spatial modulation,SM)通过激活发射天线的索引在空间域中传输信息比特,将比特到符号映射技术引入到SM系统中,可以提高SM系统的性能.一般而言,在判决准确率一定的情况下,采用相邻SM符号汉明距离较小的映射方式将获得较优的系统性能.提出一种低复杂度的比特到符号映射算法,称为符号最近法(symbol nearest method,SNM).该算法从具有最小距离的符号对开始对SM符号进行排序,寻找下一个最近的SM符号,直到所有SM符号排序结束为止,将格雷编码的比特映射分配给排序后的SM符号.分析和仿真结果表明,SNM算法在发射端使用全信道状态信息(channel state information,CSI)时,其系统性能接近于SM和空间移位键控(space shift keying,SSK)误码率(bit error rate,BER)性能的下界,并且所提出的算法复杂度为O(K2),其复杂度也较低.     

A dynamic programming algorithm on Project-Gang investment decision-making

The investment decision-making of Project-Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision-making of Project-Gang is brought forward, and this algorithm can find out the best Scheme of distributing them resources to then Items in the time ofO(m ² n). Foundation item: Supported by the Programming of the National Ministry of Education (96JAQ630015) Biography: Xu Xu-song (1945-), female, Professor, research direction: complexity science & project management, complexity science & capital Market.     

Parametric selection and continual combination of building surface

A method to reparametrizeG ¹ retional curve to obtain aC ¹ curve is given. A practicalG ¹ continual connective between adjacent NURUS patches along common guadratic boundary curve is presented in this paper, and a specific algorithm for control points and weights of NURBS patches is discussed. Biography: Zhang Xu (1943-), male, Associate professor. Research direction computer aided architectual design (CAAD) and computer graphics(CG).