Isolating block and existence of connecting orbits

Using the notion of an isolating block, some existence criteria of trajectories connecting two critical pints of planar dynaniiral systems are given. Project supported by the National Natural Science Foundation of China.     

A linear program for the two-hub location problem

This paper considers the discrete two-hub location problem. We need to choose two hubs from a set of nodes. The remaining nodes are to be connected to one of the two hubs which act as switching points for internodal flows. A configuration which minimizes the total flow cost needs to be found. We show that the problem can be solved in polynomial time when the hub locations are fixed. Since there are at most ways to choose the hub locations, the two-hub location problem can be solved in polynomial time. We transform the quadratic 0–1 integer program of the single allocation problem in the fixed two-hub system into a linear program and show that all extreme points of the polytope defined by the LP are integral. Also, the problem can be transformed into a minimum cut problem which can be solved efficiently by any polynomial time algorithm.     

On the cut‐off phenomenon for the transitivity of randomly generated subgroups

Consider K ≥ 2 independent copies of the random walk on the symmetric group S_N starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $nin mathbb{N}$, let G_n be the subgroup of S_N generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of G_n and for the transitivity of G_n, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of G_n appears at time of order $N^{1+frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

Sequent calculi for propositional star-free likelihood logic

We consider classical, multisuccedent intuitionistic, and intuitionistic sequent calculi for propositional likelihood logic. We prove the admissibility of structural rules and cut rule, invertibility of rules, correctness of the calculi, and completeness of the classical calculus with respect to given semantics.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 3–21, January–March, 2005.     

A branch and cut algorithm for hub location problems with single assignment

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.Acknowledgement The research of the first author was partially supported by the Banque Nationale de Belgique. The research of the second author was supported by France Telecom R&D under contract no. 99 1B 774. Their support is gratefully acknowledged.     

Sparse graph certificates for mixed connectivity

We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k.     

三角柱直眼掏槽爆破参数研究

通过对三角柱直眼掏槽爆破进行试验研究 ,认为爆破槽腔的形成过程可分成两个阶段 ,即岩石破坏阶段和破碎岩石抛出阶段 ;进而 ,依照岩石压缩破坏与剪切破坏的力学准则 ,导出三角柱直眼掏槽炮眼间距与装药系数的计算式 ;根据计算结果 ,在井下巷道工程实际应用中进行对比 ,证实了它的可靠性。     

Conjugate and cut loci of a two-sphere of revolution with application to optimal control

The objective of this article is to present a sharp result to determine when the cut locus for a class of metrics on a two-sphere of revolution is reduced to a single branch. This work is motivated by optimal control problems in space and quantum dynamics and gives global optimal results in orbital transfer and for Lindblad equations in quantum control.     

Cut elimination for S4n and K4n with the central agent axiom

We analyze the multimodal logic S4 _n with the central agent axiom. We present a Hilbert-type calculus, then derive a Gentzen-type calculus with cut, and prove a cut-elimination theorem. The work shows that it is possible to construct a cut-free Gentzen-type calculus for this logic. Moreover, it also provides analogous results for the multimodal logic K4 _n with the central agent axiom.     

(λ,μ)-模糊子环和理想的进一步讨论

在(λ,μ)-模糊子群的基础上,进一步刻画了(λ,μ)-模糊子环和理想.详细讨论了(λ,μ)-模糊子环和理想的性质,以及它们与截集的关系,给出了相应结论.