Decomposition algorithms for the tree edit distance problem

We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.     

无严格互补松驰条件的序列线性方程组新算法

该文通过构造特殊形式的有效集来逼近KKT点处的有效集，给出了一个任意初始点下的序列线性方程组新算法，并证明了该算法在没有严格互补松驰条件的情况下具有全局收敛性和一步超线性收敛性。      

基于软件无线电的突发模式8DPSK的全数字化实现

提出了一种软件无线电中频收发机的结构和突发模式 8DPSK解调的实现框架 ,在 8DPSK解调时采用了前向初始参数估计算法 ,并证实了该算法的可行性。     

多目标最优化的一种积分型实现算法

在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法．本文利用数论中的一致分布佳点集列，较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则．并经过有关函数数值计算表明该算法是有效的，可用来求解多目标最优化问题的有效解．     

用遗传算法拟合电力系统负荷短期预测的非线性模型

本文运用遗传算法，根据河北省１９８５—１９９０年春节期间每小时用电量的统计数字，建立了非线性回归模型（Ｇｏｍｐｅｒｔｄｚ），结果表明，遗传算法性能良好，可望成为电力系统各种非线性模型辨识的有效手段。     

多元整系数多项式因式分解的一种理论和算法

本文将ｔ（ｔ是大于２的整数）元整系数多项式看成为系数为ｔ－２元整系数多项式的二元多项式，建立了多元整系数多项式因式分解的一种新理论，进而得到了分解多元整系数多项式的一个有力的算法。     

具有两台专用机,两台通用机的Q4／／Cmax问题的近似算法

本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4／／Cmax问题，对这类特殊的排序问题，提出一种启发式算法，得到了最差情况下性能指标的严格的界．     

Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis

In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed.     

Finding nonnormal bent functions

The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace of dimension n/2 on which the function is constant. In this paper we give the first nonnormal bent function and even an example for a nonweakly normal bent function. These examples belong to a class of bent functions found in [J.F. Dillon, H. Dobbertin, New cyclic difference sets with Singer parameters, in: Finite Fields and Applications, to appear], namely the Kasami functions. We furthermore give a construction which extends these examples to higher dimensions. Additionally, we present a very efficient algorithm that was used to verify the nonnormality of these functions.     

m-aryn-cube网络的最优路由

基于可选邻接点的概念,在m-ary n-cube网络中提出一种新的最优寻径算法.这种算法始终在当前结点的可选邻接点中选取最空闲邻接点作为下一个信息传输点.该算法使得从源结点到达目的结点路由是最短路由也是最快速路由,而且在多项式时间内可以完成.