多源单汇网络资源调度路径优化探讨

在考虑队列长度的前提下 ,论文在分析多源单汇资源传输问题的基础上 ,以两源单汇网络为例 ,在资源到达终点所需时间最短约束下 ,研究、计算了最短传输时间的上下界 ,并提出了相应的算法 .论文的研究内容为进一步研究多源多汇问题建立了基础 ,提供了思路 .     

Disjoint triangles and quadrilaterals in a graph

Let G be a simple graph of order n and s and k be two positive integers. Brandt et al. obtained the following result: If s?k, n?3s+4(k-s) and σ₂(G)?n+s, then G contains k disjoint cycles C₁,…,C_k satisfying |C_i|=3 for 1?i?s and |C_i|?4 for s<i?k. In the above result, the length of C_i is not specified for s<i?k. We get a result specifying the length of C_i for each s<i?k if n?3s+4(k-s)+3.     

Global X2A′ potential energy surface of Li2H and quantum dynamics of H + Li2 (X1Σg+) → Li + LiH (X1Σ+) reaction

A global potential energy surface (PES) for the electronic ground state of Li₂H system is constructed over a large configuration space. About 30 000 ab initio energy points have been calculated by MRCI‐F12 method with aug‐cc‐pVTZ basis set. The neural network method is applied to fit the PES and the root mean square error of the current PES is only 1.296 meV. The reaction dynamics of the title reaction has been carried out by employing time‐dependent wave packet approach with second order split operator on the new PES. The reaction probability, integral cross section and thermal rate constant are obtained from the dynamics calculation. In most of the collision energy regions, the integral cross sections are in well agreement with the results reported by Gao et al. The rate constant calculated from the new PES increases in the temperature range of present investigation.     

Spaces of idempotent measures of compact metric spaces

We investigate certain geometric properties of the spaces of idempotent measures. In particular, we prove that the space of idempotent measures on an infinite compact metric space is homeomorphic to the Hilbert cube.     

Finding dominators via disjoint set union

The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in many kinds of global code optimization) and that can be made self-certifying, so that the correctness of the computed dominators is very easy to verify.