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     

A Lower Bound for the Differences of Powers of Linear Operators

Let T be a bounded linear operator in a Banach space, with σ（T）={1}. In 1983, Esterle-Berkani＇ s conjecture was proposed for the decay of differences （I - T） T^n as follows： Eitheror lim inf （n→∞（n＋1）｜｜（I-T）T^n｜｜≥1/e or T = I. We prove this claim and discuss some of its consequences.     

Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

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分支     

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.     

Controlling global stochasticity of Hamiltonian systems by nonlinear perturbation

A method of controlling global stochasticity in Hamiltonian systems by applying nonlinear perturbation is proposed. With the well-known standard map we demonstrate that this control method can convert global stochasticity into regular motion in a wide chaotic region for arbitrary initial condition, in which the control signal remains very weak after a few kicks. The system in which chaos has been controlled approximates to the original Hamiltonian system, and this approach appears robust against small external noise. The mechanism underlying this high control efficiency is intuitively explained. Received 15 January 2002 Published online 6 June 2002     

Codes with a Certain Weight-preserving Transitive Group of Automorphisms

We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C. Michael Giudici - The author holds an Australian Postdoctoral Fellowship.