Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

A Joint Integral Test for the Locations of Extrema for Brownian Motion

Let μ⁺(t) and μ⁻(t) be the locations of the maximum and minimum, respectively, of a standard Brownian motion in the interval [0,t]. We establish a joint integral test for the lower functions of μ⁺(t) and μ⁻(t), in the sense of Paul Lévy. In particular, it yields the law of the iterated logarithm for max(μ⁺(t),μ⁻(t)) as a straightforward consequence. Our result is in agreement with well-known theorems of Chung and Erdős [(1952) Trans. Amer. Math. Soc. 72, 179–186.], and Csáki, F?ldes and Révész [(1987) Prob. Theory Relat. Fields 76, 477–497].      

A detailed analysis of the photoemission spectra of basic thioaromatic monolayers on noble metal substrates

Analysis of photoemission spectra of complex thioaromatic self-assembled monolayers (SAMs) requires the knowledge and understanding of such spectra for the basic systems. Keeping this goal in mind, synchrotron-based high-resolution X-ray photoelectron spectroscopy was used to characterize SAMs formed from the simplest thioaromatic compounds, namely thiophenol, 1,1′-biphenyl-4-thiol and 1,1′;4′,1″-terphenyl-4-thiol on evaporated Au(1 1 1) and Ag(1 1 1) substrates. The acquired S 2p and C 1s spectra were analyzed in terms of fine structure and initial and final state effects in the photoemission process. The assignment of the individual spectral features was considered in detail. Conclusions on quality and chemical and structural homogeneity of the investigated SAMs were derived.     

条件愈苦,意志愈坚 --记王淦昌早年的科研活动

文章介绍了中国物理学家王淦昌早期的科研工作，特别是在抗日战争时期的科研成绩．王淦昌早期的科研贡献并不是在先进的实验仪器上，在条件优裕的实验室内完成的，而是在实验设备缺乏，科学文献不足等极端困难的环境中完成的．从王淦昌身上，可以看到那个时代中国优秀科学家脚踏实地、执志若金的奋斗精神．     

Hajek—Renyi不等式的推广及其应用

对Hajek-Renyi不等式进行了推广，利用推广的不等式给出了随机变量序列绝对平均意义下的强大数定律的一个条件．     

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of ²n−1 permutations that pairwise generate the symmetric group Sn. There is no set of ²n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of ²n−2 even permutations that pairwise generate the alternating group An. There is no set of ²n−2+1 permutations having this property.     

Lower bound for the convergence rate of nonstationary Jacobi-like iteration

Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A.     

Algorithmic and explicit determination of the Lovász number for certain circulant graphs

We consider the problem of computing the Lovász theta function for circulant graphs C_n,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3.     

基于SPA的双枝模糊决策分析

将集对理论(SPA)与双枝模糊决策理论相结合,用集对分析的方法研究进行双枝模糊决策的方法,分别对双枝模糊决策因素域和双枝模糊决策的上枝、下枝和双枝进行了集对分析,给出了用SPA进行双枝模糊决策的性质,同时讨论了双枝模糊决策的动态分析方法,以及双枝模糊决策度强弱态势预测的方法,从而为双枝模糊决策理论的研究提供了新的视角和方法,为双枝模糊决策的应用提供了更方便的工具和更强的理论支持。     

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.