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

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

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

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

金属间化合物(Mg,Zn)_(12)Ce与(Mg,Zn)_(11)Ce的研究

对300℃时Mg-Zn-Ce系富镁侧化合物的成分特征、结构和相平衡关系进行了研究.结果表明,Mg-Zn-Ce富镁角存在一个Mg12Ce的二元置换固溶体(Mg,Zn)12Ce,还存在一个三元线性化合物(Mg,Zn)11Ce(τ相).(Mg,Zn)12Ce中Zn的范围为0~7.3%(原子分数),其晶体结构为体心四方晶格.三元线性化合物τ相含Zn为8.5%~43.5%(原子分数),其晶体结构为C底心正交晶格.(Mg,Zn)12Ce和τ相均与α(Mg)存在稳定的两相平衡,且在Mg-Zn-Ce系富镁角还存在三相平衡Mg+(Mg,Zn)12Ce+τ.     

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

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

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

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

Estimation of multivariate binary density using orthogonal functions

In this paper, the authors studied certain properties of the estimate of Liang and Krishnaiah (1985, J. Multivariate Anal. 16, 162–172) for multivariate binary density. An alternative shrinkage estimate is also obtained. The above results are generalized to general orthonormal systems.     

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Maximum Shannon Entropy, Minimum Fisher Information, and an Elementary Game

We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules.     

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.     

醇+N-甲基哌嗪二元体系的体积性质

采用振荡管式数字密度计分别测定甲醇、乙醇、正丙醇、异丙醇、丁正醇和异丁醇与N-甲基哌嗪组成的二元体系在298.15K下的密度，计算了超额摩尔体积、超额偏摩尔体积、表观摩尔体积、偏摩尔体积等体积性质，从分子相互作用角度讨论了这些二元体系的体积性质的变化规律，为N-甲基哌嗪的开发和研究提供基础数据和信息。