Kinetic features of ethylene polymerization over supported catalysts [2,6‐bis(imino)pyridyl iron dichloride/magnesium dichloride] with AlR3 as an activator

The effects of polymerization temperature, polymerization time, ethylene and hydrogen concentration, and effect of comonomers (hexene‐1, propylene) on the activity of supported catalyst of composition LFeCl₂/MgCl₂‐Al(i‐Bu)₃ (L = 2,6‐bis[1‐(2,6‐dimethylphenylimino)ethyl] pyridyl) and polymer characteristics (molecular weight (MW), molecular‐weight distribution (MWD), molecular structure) have been studied. Effective activation energy of ethylene polymerization over LFeCl₂/MgCl₂‐Al(i‐Bu)₃ has a value typical of supported Ziegler–Natta catalysts (11.9 kcal/mol). The polymerization reaction is of the first order with respect to monomer at the ethylene concentration >0.2 mol/L. Addition of small amounts of hydrogen (9–17%) significantly increases the activity; however, further increase in hydrogen concentration decreases the activity. The IRS and DSC analysis of PE indicates that catalyst LFeCl₂/MgCl₂‐Al(i‐Bu)₃ has a very low copolymerizing ability toward propylene and hexene‐1. MW and MWD of PE produced over these catalysts depend on the polymerization time, ethylene and hexene‐1 concentration. The activation effect of hydrogen and other kinetic features of ethylene polymerization over supported catalysts based on the Fe (II) complexes are discussed. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 5057–5066, 2007     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

AFM, SEM and GIXRD studies of thin films of red polycarbazolyldiacetylenes

In this paper we report the results of a morphological and structural investigation on film properties of a soluble polydiacetylene, the poly[1,6-bis(3,6-dihexadecyl-N-carbazolyl)-2,4-hexadiyne] (polyDCHD-HS). The red films of this polymer, prepared by standard spin-coating techniques, revealed absence of linear dichroism and birefringence in contrast with the ordered mesophases detected by powder X-ray studies. In order to interpret the optical behavior of this polymer, we performed AFM and SEM studies of polyDCHD-HS films spun on hydrophylic and hydrophobic glass substrates. We found the presence of surfaces organized in rod-like particles, more regularly oriented on the hydrophylic substrate. GIXRD studies, carried out on films sufficiently thick to allow the observation of the diffraction pattern, reveled the presence of a lamellar structure with a spacing of 3.22 nm. The low intensity of the diffraction peaks and the isotropic linear optical properties of the films show that the lamellar mesophases are not extended over large areas. These findings were compared with the data obtained from AFM and SEM studies on films of two other polydiacetylenes, the poly[1-(3,6-dihexadexyl-N-carbazolyl)-6-(N-carbazolyl)-2,4-hexadyine] (polya-DCHD) and the poly[1,6-bis(3,6-dipalmitoyl-N-carbazolyl)-2,4-hexadyine] (polyDPCHD), spun on hydrophylic glass substrate. The results confirmed the presence of nodular morphologies which seem to be a general characteristic of this class of materials. The particles organization appears instead related to the chemical nature of the substituents on the carbazolyl rings.     

Anisotropic elastodynamics in a half space: An analytic method for polynomial data

An initial boundary value problem for the dynamic system of anisotropic elasticity in a half space is studied in the paper. A novel method of finding an exact solution of this problem for a special polynomial form of initial data and inhomogeneous term of the system is described. On the base of this method the simulation of elastic waves in different homogeneous anisotropic half spaces is implemented.     

Differentiators and the geometry of polynomials

In 1959, Davis introduced the concept of a differentiator of an operator on a finite-dimensional Hilbert space. We prove that every such operator possesses a differentiator. We also use the theory of differentiators to solve several problems in the geometry of polynomials. For instance, we answer in the affirmative a twenty year old unsolved conjecture of Schoenberg, a related conjecture of Katsoprinakis and a fifty year old unsolved conjecture of De Bruijn and Springer.     

两步相移实现投影栅相位测量轮廓术

提出一种新的投影栅相位测量方法--两步相移法。该方法只需两幅相移条纹图，因此计算量小，速度快。给出了实验及计算结果，并同四步相移法进行了比较，证明了该方法具有较高的精度。     

长柱形CsI(Tl)闪烁晶体探测器的能量重建

提出了用于TEXONO实验中双端读出的长柱形CsI(Tl)闪烁晶体探测器的两种粒子能量重建方法———“算术平均值能量重建法”和“几何平均值能量重建法”,讨论了两种算法的理论依据和计算方法,并对两种算法进行了比较     

A comparison of two algorithms for the assignment problem

State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented.