Linear‐dendritic block copolymer hosts for the encapsulation of electro‐optic chromophores via H‐Bonding

Linear‐dendritic block copolymer hosts were synthesized by end‐functionalizing poly(methylmethacrylate) with dendrons that acted as hydrogen‐bonding acceptors for nonlinear optical chromophores. Second harmonic generation experiments indicate that the d₃₃ coefficients and maximum chromophore loading are increased in linear‐dendritic block copolymer hosts over comparable homopolymer hosts. Transmission electron microscopy shows 5–10 nm chromophore domains, confirming the effective spatial dispersion of the chromophores. © 2009 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 47: 5017–5026, 2009     

Discrete stochastic location models

In this paper, we study how the two classical location models, the simple plant location problem and thep-median problem, are transformed in a two-stage stochastic program with recourse when uncertainty on demands, variable production and transportation costs, and selling prices is introduced. We also discuss the relation between the stochastic version of the SPLP and the stochastic version of thep-median.     

Isometries for Ky Fan norms between matrix spaces

We characterize linear maps between different rectangular matrix spaces preserving Ky Fan norms.

     

On the greedy solution in integer linear programming

A version of the greedy method not using any knapsack relaxation of the integer programming problem is considered in this paper. It is based on a natural partial ordering of the vectors. Our aim is to determine a large class of problems where the greedy solution is always optimal. The results generalize some theorems of an early paper of Magazine, Nemhauser and Trotter and at the same time show a connection between two different notions of combinatorics: the greedy method and the Hilbert basis.

---

Zusammenfassung In dieser Arbeit wird eine Version des Greedy-Algorithmus zur Lösung ganzzahliger linearer Optimierungsprobleme benutzt, die kein Rucksackproblem als Relaxation verwendet. Das Verfahren basiert auf der natürlichen partiellen Ordnung von Vektoren. Ziel der Arbeit ist es, eine möglichst große Problemklasse zu beschreiben, für die die Greedy-Lösung optimal ist. Die Ergebnisse verallgemeinern Sätze einer früheren Arbeit von Magazine, Nemhauser und Trotter und zeigen gleichzeitig einen Bezug zwischen zwei verschiedenen Gebieten der Kombinatorik auf: des Greedy-Verfahrens und von Hubert-Basen.

     

Numerical Approximation of the Spectra of Phan-Thien Tanner Liquids

The linear stability of the linear Phan-Thien Tanner (PTT) fluid model is investigated for plane Poiseuille flow. The PTT model involves parameters that can be used to fit shear and extensional data, which makes it suitable for describing both polymer solutions and melts. The base flow is determined using a Chebyshev-tau method. The linear stability equations are also discretized using Chebyshev approximations to furnish a generalized eigenvalue problem. The spectrum is shown to comprise a continuous part and a discrete part. The theoretical and numerical results are validated for the UCM and Oldroyd-B models, which are special cases of the PTT model, by comparing with results in the literature. It is demonstrated that the linear PTT fluid is stable to infinitesimal disturbances with respect to the range of shear-thinning, extensional and elasticity parameters considered. The computational efficiency and accuracy of the numerical method are also investigated.     

More on regular linear spaces

We extend the enumeration of regular linear spaces in 1 to at most 19 points. In addition, one of the 5 missing cases in the previous list is settled. The number of regular linear spaces of type (15|2¹⁵,3³⁰) is 10,177,328. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

A convex analysis approach for convex multiplicative programming

Global optimization problems involving the minimization of a product of convex functions on a convex set are addressed in this paper. Elements of convex analysis are used to obtain a suitable representation of the convex multiplicative problem in the outcome space, where its global solution is reduced to the solution of a sequence of quasiconcave minimizations on polytopes. Computational experiments illustrate the performance of the global optimization algorithm proposed.      

广义Hamming重量的广义Griesmer界进一步分析

通过对q元线性码广义Hamming重量dr(·)的分析,应用支撑重量ωs(C)的性质,再次分析了q元[n,k]线性码广义Griesmer界n≥dr+sum from i=1 to k-r[(q-1)dr/qi(qr-1)].     

非正则线性增广拉格朗日乘子法的收敛速率研究CSCD

Recently,an indefinite linearized augmented Lagrangian method(IL-ALM)was proposed for the convex programming problems with linear constraints.The IL-ALM differs from the linearized augmented Lagrangian method in that the augmented Lagrangian is linearized by adding an indefinite quadratic proximal term.But,it preserves the algorithmic feature of the linearized ALM and usually has the advantage to improve the performance.The IL-ALM is proved to be convergent from contraction perspective,but its convergence rate is still missing.This is mainly because that the indefinite setting destroys the structures when we directly employ the contraction frameworks.In this paper,we derive the convergence rate for this algorithm by using a different analysis.We prove that a worst-case O(1/t)convergence rate is still hold for this algorithm,where t is the number of iterations.Additionally we show that the customized proximal point algorithm can employ larger step sizes by proving its equivalence to the linearized ALM.