Physicochemical studies on hydrophobic PEO‐PPO‐PEO triblock copolymer micelles in SDS micellar environment

The shape, size, aggregation, hydration, and correlation times of water insoluble PEO‐PPO‐PEO triblock copolymer micelles with sodium dodecylsulfate (SDS) micelles were investigated using transport studies and dynamic light scattering technique. From the conductance of micellar solutions of the polymer in 25 mM SDS and 5 mM NaCl, the hydration of polymer micelles were determined using the principle of obstruction of electrolyte migration by the polymer. The asymmetry of the micellar particles of polymer and polymer‐SDS mixed micellar systems in 5 mM NaCl and their average axial ratios were calculated using intrinsic viscosity and hydration data obeying Simha–Einstein equation. Hydration number and micellar sizes were variable with temperature. The shape of the polymer micelles has been ellipsoidal rather than spherical. The micellar volume, hydrodynamic radius, radius of gyration, diffusional coefficients as well as translational, rotational and effective correlation times have been calculated from the absolute values of the axes. The partial molal volume of polymer micelles has also been determined and its comparison with the molar volume of pure polymer suggested a volume contraction due to immobilization of the water phase by the hydrophilic head groups of the polymer. The thermodynamic activation parameters for viscous flow favor a more ordered water structure around polymer micelles at higher temperatures. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 2410–2420, 2007     

桌域网及其新技术的研究

桌域网是一种适合于多媒体业务需要的小型ATM网 ,是对传统计算机网络的体系结构的一种补充。本文介绍了设计桌域网的基本策略 ,讨论了它的设计目标和特性 ,给出了桌域网的体系结构、网络接入设备及其性能 ,最后提出研究桌域网的几点建议。     

大型复杂高精度波导钎焊设备的研制：简介ZHS—132型真空钎焊炉

应军事电子装备，特别是军用雷达预研和生产的急需，电子工业部第二研究所近期研制的成功大型、复杂、高精度波导钎焊设备ＺＨＳ－１３２型真空钎焊炉。文中主要介绍了该设备的开发背景和对波导钎焊工艺的影响，该设备的设计构思、结构和技术特征，使用功能和效果，以及推广应用前景。     

集群系统与公用网互连的仿真模型和模拟算法

在讨论ＭＰＴ１３２７信令的集群移动通信系统与国内Ｎｏ．７信令的ＰＳＴＮ网间互连，帝现两种信令配合中，研究了集群系统的仿真模型和模拟算法，同时模拟出整个集群系统的工作情况，运行结果证实了所提方案的可行性与准确性。     

混沌光学系统的前向神经网络系统辨识研究

为解决混沌光学系统自适应控制所需之控制参考动力学模型问题，以布拉格声光混沌系统的系统辨识为例．研究了利用前向神经网络对混沌光学系统进行系统辩识的可行性。计算机仿真实验发现．在静态ＢＰ算法支持下一结构十分简单的三层ＢＰ前向神经网络（１：４：１）即可在一定的精度范围内完成对布拉格声光混沌系统的系统辨识．此结果表明．三层前向ＢＰ神经网络在静态ＢＰ算法的支持下确是一良好的混沌光学系统辨识器，因而可用来处理混沌光学时间序列以进行混沌光学系统的动力学重构。     

ATM技术在校园网中的实时性应用

讨论了ＡＴＭ论坛关于局域网仿真技术的基本思想及其协议体系的工作过程，并介绍了利用局域网仿真技术在校园网中应用ＡＴＭ技术实现视频传输的方法。     

ℙmax variations related to slaloms

We prove the iteration lemmata, which are the key lemmata to show that extensions by Pmax variations satisfy absoluteness for Π₂-statements in the structure 〈H (ω ₂), ∈, NS_{ω 1}, R 〉 for some set R of reals in L (ℝ), for the following statements: (1) The cofinality of the null ideal is ℵ₁. (2) There exists a good basis of the strong measure zero ideal. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Supercompactness and measurable limits of strong cardinals II: Applications to level by level equivalence

We construct models for the level by level equivalence between strong compactness and supercompactness in which for κ the least supercompact cardinal and δ ≤ κ any cardinal which is either a strong cardinal or a measurable limit of strong cardinals, 2^δ > δ ⁺ and δ is < 2^δ supercompact. In these models, the structure of the class of supercompact cardinals can be arbitrary, and the size of the power set of κ can essentially be made as large as desired. This extends and generalizes [5, Theorem 2] and [4, Theorem 4]. We also sketch how our techniques can be used to establish a weak indestructibility result. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Further generalization of the Dubovicki-Milutin theorem

Combining the results of Walczak (Ref. 1) and Lasiecka (Refs. 2 and 3), we extend the well-known Dubovicki-Milutin theorem in two directions: (i) We allow for treatment of several equality constraints in optimization problems; and (ii) We assume less regularity of optimization problems by requiring the existence of external cones instead of tangent cones. An example of an optimization problem is also considered.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.