SWITRIM��������ƺ�ʹ�øſ�

研制出了用于计算氚投料量在FEB聚变堆各个子系统中的分布及其随时间变化的数值模拟程序包SWITRIM。通过近5年的使用，表明其运行良好、计算结果可靠。用SWITRIM数值模拟研究了聚变堆起动过程中的“氚坑深度和氚坑时间”新现象。简单介绍了SWITRIM程序包的组成和用户使用说明以及最新的运用等。     

Measurement of storage time, estimation of ion number and study of absorption line profile in a Paul trap

Europium (Eu⁺) ions were confined in a Paul trap and detected by non-destructive method. Storage time of Eu⁺ ions achieved in vacuum was improved by orders of magnitude employing buffer gas cooling. The experimentally detected signal was fitted to the ion response signal and the total number of ions trapped was estimated. It is found that the peak signal amplitude as well as the product of FWHM and the peak signal amplitude is proportional to the total number of trapped ions. The trapped ion secular frequency was swept at different rates and its effect on the absorption line profile was studied both experimentally and theoretically.     

Degradative chain transfer in vinyl acetate polymerizations using toluene as solvent

In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (C_trs) determined using the Mayo method is equal to 3.8 × 10^?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10^?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the M_n data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

增强型延迟反馈法控制低维混沌系统的解析研究

基于时间延迟反馈控制混沌系统的方法,提出一种增强型控制方案,并利用分析延迟系统产生Hopf分支条件的方法,给出这种方案控制低维连续自治混沌系统时,在达到控制目标的条件下,控制参数的一般解析关系.将这一方案和分析方法应用到两个混沌模型中,结果表明:采用修正的方案可以明显地改善控制混沌的效果和质量;解析分析的结果与实际数值计算的结果一致. 关键词： 延迟反馈 混沌控制 Hopf分支     

平面上随机级数的性质

研究了平面上系数{Xn,n≥0}为(?)-混合序列在满足,(q>1)等条件下的随机级数的增长性及值分布,得到了比较好的结果．     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.