Large melting point depression of 2–3‐nm length‐scale nanocrystals formed by the self‐assembly of an associative polymer: Telechelic,pyrene‐labeled poly(dimethylsiloxane)

Large melting point depressions for organic nanocrystals, in comparison with those of the bulk, were observed in an associative polymer: telechelic, pyrene‐labeled poly(dimethylsiloxane) (Py‐PDMS‐Py). Nanocrystals formed within nanoaggregates of pyrenyl units that were immiscible in poly(dimethylsiloxane). For 5 and 7 kg/mol Py‐PDMS‐Py, physical gels resulted, with melting points exceeding 40 °C and with small‐angle X‐ray scattering peaks indicating that the crystals were nanoconfined, were 2–3 nm long, and contained roughly 18–30 pyrenyl dye end units. In contrast, 30 kg/mol Py‐PDMS‐PY was not a gel and exhibited no scattering peak at room temperature; however, after 12 h of annealing at ?5 °C, multiple melting peaks were present at 5–30 °C. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 3470–3475, 2004     

半自由声场的全息重建和预测实验研究

半自由声场环境下的声源重建和声场预测研究对声全息技术走向实际应用具有非常重要的意义.在提出基于分布源边界点法的半自由声场全息重建和预测方法的基础上，对此展开了实验研究.并将重建和预测的结果与常规方法重建和预测的结果进行了比较和讨论，说明了重建预测过程中反射声压的影响和考虑反射声压的必要性，证明了所提出方法在解决半自由声场环境下存在地面反射时的声源重建和声场预测时的有效性和准确性.还提出了采用奇异值截断滤波和Tikhonov正则化方法来削弱测量误差的影响，从而进一步优化了重建结果，提高了全息成像的可信度. 关键词： 声全息 半自由场 边界点 声辐射 反射声     

The Isoelectric Point and the Points of Zero Charge of Fe-Al-Mg Hydrotalcite-like Compounds

The relation of the isoelectric point (IEP) and the point of zero net charge (PZNC) of the hydrotalcite-like compounds was discussed. It was found that the IEP does not equal to the PZNC and the IEP is higher than the PZNC. The structural positive charges existing in the HTlc,which cause the difference between the IEP and the PZNC. The effects of the structural positive charges of the HTlc on its IEP and PZNC are the same as the specific adsorption of metal cations.     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

基于改进遗传算法的布局优化子问题

本针对子问题，构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题，数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题，所以利用该算法可以找到整个布局优化问题的全局最优解。     

Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

A Fixed Point Theorem for Multi—valued Composite Increasing Operators

Ａ　Ｆｉｘｅｄ　Ｐｏｉｎｔ　Ｔｈｅｏｒｅｍ　ｆｏｒ　Ｍｕｌｔｉ－ｖａｌｕｅｄ　Ｃｏｍｐｏｓｉｔｅ　Ｉｎｃｒｅａｓｉｎｇ　ＯｐｅｒａｔｏｒｓＬｉＦｅｎｇｙｏｕ（李凤友）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｔｉａｎｊｉｎ＇ＮｏｒｍａｌＵｎｉ...     

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.     

Curvature of curvilinear 4-webs and pencils of one forms: Variation on a theorem of Poincaré, Mayrhofer and Reidemeister

A curvilinear d-web W = (F ₁ , . . . , F _d ) is a configuration of d curvilinear foliations F _i on a surface. When d = 3, Bott connections of the normal bundles of F _i extend naturally to equal affine connection, which is called Chern connection. For 3 < d, this is the case if and only if the modulus of tangents to the leaves of F _i at a point is constant. A d-web is associative if the modulus is constant and weakly associative if Chern connections of all 3-subwebs have equal curvature form. We give a geometric interpretation of the curvature form in terms of fake billiard in §2, and prove that a weakly associative d-web is associative if Chern connections of triples of the members are non flat, and then the foliations are defined by members of a pencil (projective linear family of dim 1) of 1-forms. This result completes the classification of weakly associative 4-webs initiated by Poincaré, Mayrhofer and Reidemeister for the flat case. In §4, we generalize the result for n + 2-webs of n-spaces. Received: September 23, 1996     

Quadratic Functionals with General Boundary Conditions

The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation solutions. Accepted 27 February 1996