Thermoplastic poly(ester‐imide)s derived from anhydride‐terminated polyester prepolymer and diisocyanate

The phase‐separation behavior of thermoplastic poly(ester‐imide) [P(E‐I)] multiblock copolymers, (A‐B)_n, was investigated by a stepwise variation of the imide content. All the multiblock copolymers were synthesized by solution polycondensation with dimethylformamide as a solvent. P(E‐I)s were prepared with anhydride‐terminated polyester prepolymer and diisocyanates. Polyester prepolymers were prepared by the reaction of pyromellitic dianhydride and two different polyols [poly(tetramethylene oxide glycol) (PTMG) and polycaprolactone diol (PCL)]. Structural determination was done with Fourier transform infrared spectroscopy and Fourier transform NMR, and the molecular weight was determined by gel permeation chromatography. The effect of the imide content on the thermal properties of the synthesized P(E‐I)s was investigated by thermogravimetric analysis and differential scanning calorimetry. The polymers were also characterized for static and dynamic mechanical properties. Thermal analysis data indicated that the polymers based on PTMG were stable up to 330 °C in nitrogen atmosphere and exhibited phase‐separated morphology. Polymers based on PCL showed multistage decomposition, and the films derived from them were too fragile to be characterized for static and dynamic mechanical properties. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 341–350, 2004     

New liquid‐crystalline poly(ester amide)s: The role of nitro groups in the phase behavior

New hydrogen‐bonded liquid‐crystalline poly(ester amide)s (PEA)s were obtained from 1,4‐terephthaloyl[bis‐(3‐nitro‐N‐anthranilic acid)] (5) or 1,4‐terephthaloyl[bis‐(N‐anthranilic acid)] (6), with or without nitro groups, respectively, through the separate condensation of each with hydroquinone or dihydroxynaphthalene. The dicarboxylic monomers were synthesized from 2‐aminobenzoic acid. The phase behavior of the monomers and polymers were studied with differential scanning calorimetry, polarized light microscopy, and wide‐angle X‐ray diffraction methods. Monomer 5, containing nitro groups, exhibited a smectic liquid‐crystalline phase, whereas the texture of monomer 6 without nitro groups appeared to be nematic. The PEAs containing nitro groups exhibited polymorphism (smectic and nematic), whereas those without nitro groups exhibited only one phase transition (a nematic threaded texture). The changes occurring in the phase behavior of the polymers were explained by the introduction of nitro groups. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 1289–1298, 2004     

Diffusion in poro‐plastic media

A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd.     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

剖析博彩弹子机的赢钱原理

介绍了博彩弹子机 ,运用数学建模法剖析了它的赢钱原理 ,强调了一般博彩业主永远是赢家的道理     

Continuation of travelling‐wave solutions of the Navier–Stokes equations

An efficient way of obtaining travelling waves in a periodic fluid system is described and tested. We search for steady states in a reference frame travelling at the wave phase velocity using a first‐order pseudospectral semi‐implicit time scheme adapted to carry out the Newton's iterations. The method is compared to a standard Newton–Raphson solver and is shown to be highly efficient in performing this task, even when high‐resolution grids are used. This method is well suited to three‐dimensional calculations in cylindrical or spherical geometries. Copyright © 2006 John Wiley & Sons, Ltd.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints

In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile).     

Optimal algebraic multilevel preconditioning for local refinement along a line

The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper.