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     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

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.     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

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.     

Two differential equation systems for equality-constrained optimization

This paper presents two differential systems, involving first and second order derivatives of problem functions, respectively, for solving equality-constrained optimization problems. Local minimizers to the optimization problems are proved to be asymptotically stable equilibrium points of the two differential systems. First, the Euler discrete schemes with constant stepsizes for the two differential systems are presented and their convergence theorems are demonstrated. Second, we construct algorithms in which directions are computed by these two systems and the stepsizes are generated by Armijo line search to solve the original equality-constrained optimization problem. The constructed algorithms and the Runge–Kutta method are employed to solve the Euler discrete schemes and the differential equation systems, respectively. We prove that the discrete scheme based on the differential equation system with the second order information has the locally quadratic convergence rate under the local Lipschitz condition. The numerical results given here show that Runge–Kutta method has better stability and higher precision and the numerical method based on the differential equation system with the second information is faster than the other one.     

Asymptotic properties of an HIV/AIDS model with a time delay

A mathematical model for HIV/AIDS with explicit incubation period is presented as a system of discrete time delay differential equations and its important mathematical features are analysed. The disease-free and endemic equilibria are found and their local stability investigated. We use the Lyapunov functional approach to show the global stability of the endemic equilibrium. Qualitative analysis of the model including positivity and boundedness of solutions, and persistence are also presented. The HIV/AIDS model is numerically analysed to asses the effects of incubation period on the dynamics of HIV/AIDS and the demographic impact of the epidemic using the demographic and epidemiological parameters for Zimbabwe.     

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.     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.     

一种新的$1/f$过程小波模型

给出了一种新的二进小波1/f过程模型,从理论上证明了一类谱指数为H的近似1/f过程可通过一簇平稳随机过程产生.由于所提方法利用了1/f过程小波系数的相关性,因而有效地减少了合成1/f过程的谱误差.数值实验结果表明,新模型很好地改进了已有模型.