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     

0.8W/80K直线驱动斯特林制冷机的研制

介绍了一种 0 .8W/ 80 K分置式斯特林制冷机。该制冷机采用当前国外先进的直线电机驱动 ,双活塞对称布置结构。该制冷机已通过军品所要求的环境试验 ,输入功率小于 4 0 W(DC)情况下 ,其 +6 0℃高温环境下制冷量≥ 0 .5 W/ 80 K ,带载 0 .5 W工况下 MTTF已突破 2 0 0 0小时。文中主要论述了其工作原理、结构特点、试验情况。     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

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.     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.     

The multiple-scale wave equation

An analytic and numerical study of the behavior of the linear nonhomogeneous wave equation of the form ε²u_tt = Δu + tf with high wave speed (ε 1) is carried out. This study was initially motivated by meteorological observations which have indicated the presence of large spatial scale gravity waves in the neighborhood of a number of summer and winter storms, mainly from visible images of ripples in clouds in satellite photos. There is a question as to whether the presence of these waves is caused by the nearby storms. Since the linear wave equation is an approximation to the full system describing pressure waves in the atmosphere, yet is considerably more tractable, we have chosen to analyze the behavior of the linear nonhomogeneous wave equation with high wave speed. The analysis is shown to be valid in one, two, and three space dimensions. Partly because of the high wave speed, the solution is known to consist of behavior which changes on two different time scales, one rapid and one slow. Additionally, because of the presence of the nonhomogeneous forcing term tf, we show that there is a component of the solution which will vary only on a very large spatial scale. Since even the linearized wave equation can give rise to persistent large spatial scale waves under the right conditions, the implication is that certain storms could be responsible for the generation of large-scale waves. Numerical simulations in one and two dimensions confirm analytic results.     

无偏的岭回归迭代算法

本文探讨线性模型的无偏的岭回归迭代算法,这种算法保持最小二乘法的性质,当存在较为严重的共线性时,它能给出较为精确的参数及其协差阵的估计值;当存在严格的共线性时,给出参数及其协差阵的无穷多解中的一个,这个解由初值决定。文章还给出了算法的收敛性及一些其它性质的证明。     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.