Effects of poly[styrene‐b‐(ethylene‐co‐butylene)‐b‐styrene] on the charge distributions of low‐density polyethylene/polystyrene blends

The effect of the triblock copolymer poly[styrene‐b‐(ethylene‐co‐butylene)‐b‐styrene] (SEBS) on the formation of the space charge of immiscible low‐density polyethylene (LDPE)/polystyrene (PS) blends was investigated. Blends of 70/30 (wt %) LDPE/PS were prepared through melt blending in an internal mixer at a blend temperature of 220 °C. The amount of charge that accumulated in the 70% LDPE/30% PS blends decreased when the SEBS content increased up to 10 wt %. For compatibilized and uncompatibilized blends, no significant change in the degree of crystallinity of LDPE in the blends was observed, and so the effect of crystallization on the space charge distribution could be excluded. Morphological observations showed that the addition of SEBS resulted in a domain size reduction of the dispersed PS phase and better interfacial adhesion between the LDPE and PS phases. The location of SEBS at a domain interface enabled charges to migrate from one phase to the other via the domain interface and, therefore, resulted in a significant decrease in the amount of space charge for the LDPE/PS blends with SEBS. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2813–2820, 2004     

超短脉冲贝塞尔光束的非近轴效应对传输的影响

 对超短脉冲贝塞尔光束在近轴近似和非近轴情况下自由空间中的传输作了研究。结果表明，其空间波形在传输中保持贝塞尔形状不变，不受非近轴效应影响；然而当空间参数较大时，非近轴效应影响超短脉冲贝塞尔光束的时间波形。     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

The canonical solution operator of $ {\bar \partial } $ on weighted spaces with holomorphic coefficients

On weighted spaces with strictly plurisubharmonic weightfunctions the canonical solution operator of and the ‐Neumann operator are bounded. In this paper we find a class of strictly plurisubharmonic weightfunctions with certain growth conditions, so that they are Hilbert‐Schmidt operators between weighted spaces with different weightfunctions, if they are restricted to forms with holomorphic coefficients. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

Universal spaces for asymptotic dimension

We construct a universal space for the class of proper metric spaces of bounded geometry and of given asymptotic dimension. As a consequence of this result, we establish coincidence of asymptotic dimension with asymptotic inductive dimension.     

The large scale topology and algebraic K-theory of arithmetic groups

New compactifications of symmetric spaces of noncompact type X are constructed using the asymptotic geometry of the Borel–Serre enlargement. The controlled K-theory associated to these compactifications is used to prove the integral Novikov conjecture for arithmetic groups.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

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

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

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.