基于JAVA建立树形结构的算法优化

树形结构在程序设计过程具有非常重要的作用,但树形结构的构建相对比较复杂。通过研究设计并实现一种从普通Java对象中建立树形结构的优化算法。     

SAR图像并行拼接方法研究与实现* 〖HT4K〗——基于改进完全二叉树模型

随着SAR成像技术的快速发展，SAR图像覆盖的地域范围与成像精度也在迅速增长，这对SAR图像拼接工作的实时性提出了挑战;文章对SAR图像序列特征进行深入分析，提出了采用基于分割的完全二叉树模型进行SAR图像的并行拼接，并使用MPI点对点通信方式对之进行了不同数量机群规模下的实现；对比实验证明，基于该方法的并行拼接工作比传统并行拼接方法在降低拼接时耗上更加有效，且并行拼接后的完整图像效果良好.     

VSAT系统改进冲突分解算法研究

文章提出一种新的改进隔离型随机N叉树形冲突分解算法,对VSAT随机接入多址接入系统中冲突分解进行了研究。给出了冲突信息分组分解所需平均时隙数和系统吞吐量的解析式,进一步给出了信息分组冲突分解的实验值。     

无向树图的k点连通最小扩充

解决了以最少边集扩充一个任意无向树图为k点连通图这一优化问题,提出了一个计算复杂度为D(|V|~4)的算法。为进一步研究可靠网络的计算机辅助设计打下基础。     

关于混合型多项式Hammerstein积分方程正解迭代求法

本文给出了混合型多项式Ｈａｍｍｅｒｓｔｅｉｎ积分方程正解的迭代求法，并将所得结果应用到二阶非线性常微分方程的边值问题     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

Oscillation theorems for differential equations with a nonlinear damping term

In this paper, we are concerned with a class of nonlinear second-order differential equations with a nonlinear damping term. Passage to more general class of equations allows us to remove a restrictive condition usually imposed on the nonlinearity, and, as a consequence, our results apply to wider classes of nonlinear differential equations. Two illustrative examples are considered.     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。