激光除锈过程的实时监测技术研究

对激光除锈过程中的实时监测技术进行了实验研究,结果表明:除锈过程中产生的声波强度会随着表面清洁度的变化而发生明显的变化,声波信号包含了除锈过程中的大量信息,可作为激光除锈实时监测的基本信号.     

On Discrete Zariski-Dense Subgroups of Algebraic Groups

We investigate under which conditions an algebraic group G defined over a locally compact field k admitr a subgroup Γ? G(k) which is dense in the Zariski topology, but discerte in the topology induced by the locally compact topology on k. For non—solvable groups we provide a complete answer.     

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.     

Ant colony optimization: Introduction and recent trends

Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research.     

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     

Modeling of radiative heat transfer in an axisymmetric cylindrical enclosure with participating medium

Radiative heat transfer in an axisymmetric enclosure with absorbing, emitting, and scattering medium is studied here by using the different methods such as MDOM, FVM, and MFVM with emphasis on the treatment of angular derivative term, which appears in curvilinear coordinates due to angular redistribution. After final discretization equation for MFVM is introduced by using the step scheme and directional weights, the present approach is validated by applying it to three different benchmarking problems with absorbing, emitting, and scattering medium. All of the results presented here support its accuracy as well as moderate efficiency. Finally, the present approaches are applied to a truncated cone-shaped enclosure as a body-fitted geometry case.     

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