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.     

利用有效液滴模型对超重元素α衰变半衰期的研究

利用有效液滴模型计算了偶偶超重核的α衰变半衰期,计算过程中采用了保持碎片体积守恒的不对称形状描述以及有效惯性系数计算Gamow势垒穿透因子.首先在质子数Z为88—98的区域检验了有效液滴模型,发现计算结果与实验符合得比较好.随后将此模型推广到Z≥100的情况,虽然只用了两个模型参数,计算结果与实验数据符合,说明有效液滴模型是计算偶偶超重核素α衰变半衰期的一个成功模型.     

On the solution of Maxwell's equations in polygonal domains

This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H² when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H², and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

尘埃粒子的时空结构及其性质

讨论了尘埃粒子解的时空结构及其性质，导出了尘埃粒子的内空间的离散结构.证明了尘埃粒子内部的物质球是一个无坐标的平直球，因而具有最小的体积和整体的关联性.导出了在尘埃粒子的内外时空中的径向测地线并说明其连续性.阐述了由这个解所揭示的物质、引力与时空之间的内在联系. 关键词： 尘埃粒子 离散时空 测地线     

具有消息恢复的数字签名方案的一个注记

对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数.     

森林发展系统的一个非线性半离散模型

本文建立了森林发展系统的一类非线性林龄面积结构的半离散模型 ,并讨论了半离散系统解的存在唯一性 ,给出了线性半离散系统稳定的一些充分条件     

A boundary element method for the calculation of noise barrier insertion loss in the presence of atmospheric turbulence

Atmospheric turbulence is an important factor that limits the amount of attenuation a barrier can provide in the outdoor environment. It is therefore important to develop a reliable method to predict its effect on barrier performance. The boundary element method (BEM) has been shown to be a very effective technique for predicting barrier insertion loss in the absence of turbulence. This paper develops a simple and efficient modification of the BEM formulation to predict the insertion loss of a barrier in the presence of atmospheric turbulence. The modification is based on two alternative methods: (1) random realisations of log-amplitude and phase fluctuations of boundary sources and (2) de-correlation of source coherence using the mutual coherence function (MCF). An investigation into the behaviours of these two methods is carried out and simplified forms of the methods developed. Some systematic differences between the predictions from the methods are found. When incorporated into the BEM formulation, the method of random realisations and the method of MCF de-correlation provide predictions that agree well with predictions by the parabolic equation method and by the scattering cross-section method on a variety of thin barrier configurations.     

On two theorems for flat,affine group schemes over a discrete valuation ring

We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation ring, in a slightly more general context.     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.