基于概念的教育资源元素材聚类方法研究

针对教育资源元素材种类多、独立性强等特点，研究了概念聚类方法解决领域知识的分类和归并问题，并实现了概念的动态聚类算法和归并算法，分析了该算法的效率和聚类准确性．     

椭圆曲线素阶群上的离散对数求解

该文对解椭圆曲线上离散对数的Pollard ρ算法和并行碰撞搜索算法分别建立了它 们的图论模型和分析了碰撞技巧,比较了两个算法,进而提出了设计迭代函数的准则并 给出一个改进的并行碰撞算法.     

Optimal broadcast domination in polynomial time

Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination powers. Broadcast domination assigns an integer power f(v)?0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v having f(v)?1. The optimal broadcast domination problem seeks to minimize the sum of the powers assigned to the vertices of the graph. Since the presentation of this problem its computational complexity has been open, and the general belief has been that it might be NP-hard. In this paper, we show that optimal broadcast domination is actually in P, and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non-standard approach.     

Relaxation time for a dimer covering with height representation

This paper considers the Monte Carlo dynamics of random dimer coverings of the square lattice, which can be mapped to a rough interface model. Two kinds of slow modes are identified, associated respectively with long-wavelength fluctuations of the interface height, and with slow drift (in time) of the system-wide mean height. Within a continuum theory, the longest relaxation time for either kind of mode scales as the system sizeN. For the real, discrete model, an exactlower bound ofO(N) is placed on the relaxation time, using variational eigenfunctions corresponding to the two kinds of continuum modes     

A vector Chebyshev algorithm

We consider polynomials orthogonal relative to a sequence of vectors and derive their recurrence relations within the framework of Clifford algebras. We state sufficient conditions for the existence of a system of such polynomials. The coefficients in the above relations may be computed using a cross-rule which is linked to a vector version of the quotient-difference algorithm, both of which are proved here using designants. An alternative route is to employ a vector variant of the Chebyshev algorithm. This algorithm is established and an implementation presented which does not require general Clifford elements. Finally, we comment on the connection with vector Padé approximants. This revised version was published online in June 2006 with corrections to the Cover Date.     

APPROXIMATION ALGORITHM FOR MAX-BISECTION PROBLEM WITH THE POSITIVE SEMIDEFINITE RELAXATION

Using outward rotations, we obtain an approximation algorithm for Max-Bisection problem, i.e., partitioning the vertices of an undirected graph into two blocks of equal cardinality so as to maximize the weights of crossing edges. In many interesting cases, the algorithm performs better than the algorithms of Ye and of Halperin and Zwick. The main tool used to obtain this result is semidefinite programming.     

AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX

In this paper, we first introduce a concept of companion vector, and study the Jordan canonical forms of quaternion matrices by using the methods of complex rep resentation and companion vector, not only give out a practical algorithm for Jordan canonical form J of a quaternion matrix A, but also provide a practical algorithm for corresponding nonsingular matrix P with P-1AP = J.     

离散点集上的向量有理插值算法与特征性质

1引言 给出R~2中离散点集     

基于L~1度量分析的图象分解与重构算法

Mallat‘s decompositon and reconstruction algorithms are very important in the the field of wavelet theory and its applications to signal processing.Wavelet Anal-ysis,which is based on L^2(R) space,can eliminate redundancy of signals with the help of orthogonality and characterize the processing precision with the meansquare error.In the recent years,it is understood that the mean square measuredoes not match human visual sensitivity well.From the point of view,R.DeVore studied L^1 measure instead.Similarly,considering the principles of image com-pression,Yang introduced and dealt with orthogonality in L^1 space based on thebest approximation theory,and consequently established the corresponding decom-position and reconstruction algorithms for signals.In this paper,error analyses for the algorithms above are taken and the selection of the best parameters in the algorithms are discussed in detail.Finally,the algorithms are compared with the classical Haar and Daubechies‘‘s orthogonal wavelets based on the singal-to-noiseratio data computed.     

空间有理参数多项式曲线的整数级绘制算法

讨论了空间有理曲线中心投影后导数上界的估计，基于曲线各阶差分的递推计算，给出了空间有理参数多项式曲线的快速绘制算法．算法只用到整数的加减法，效率高．