Stability control of the electrooptic effect with new maleimide copolymers containing photoreactive tricyanopyrrolidene‐based chromophores

New photocrosslinkable maleimide copolymers have been synthesized by the attachment of a tricyanopyrrolidene‐based chromophore. The 2‐(3‐cyano‐4‐(2‐{4‐[hexyl‐(6‐hydroxy‐hexyl)‐amino]‐phenyl}‐vinyl)‐5‐oxo‐1‐{4‐[4‐(3‐oxo‐3‐phenyl‐propenyl)‐ phenoxy]‐butyl}‐1,5‐dihydro‐pyrrol‐2‐ylidene)‐malononitrile chromophore exhibits nonlinear optical activity and contains a chalcone moiety that is sensitive to UV light (λ = 330–360 nm) for crosslink formation. The maleimide monomers have also been functionalized with chalcone moieties. The resultant copolymers exhibit great processability, and one of them shows a maximum electrooptic coefficient of 90 pm/V at 1300 nm. We could control the thermal stability of the electrooptic coefficient with the newly synthesized photoreactive copolymers successfully. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 531–542, 2007     

近场光学显微技术

本文在介绍近场光学显微镜原理的基础上，对近场光学显微技术进行了一定深度的探讨，并着重研究了纳米级探针的制作和纳米级样品与探针间距的控制这两个近场光学显微技术中的关键问题，说明了近场光学显微探针的工作方式，阐述了近场光学成像的衬度类型，介绍了近场光学显微技术在多个领域的应用。在参考大量国内外最新研究成果的基础上，提出了一些个人的见解。     

Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

QUATERNION GENERALIZED SINGULAR VALUE DECOMPOSITION AND ITS APPLICATIONS

This paper derives a theorem of generalized singular value decomposition of quaternion matrices （QGSVD）,studies the solution of general quaternion matrix equation AXB -CYD= E,and obtains quaternionic Roth＇s theorem. This paper also suggests sufficient and necessary conditions for the existence and uniqueness of solutions and explicit forms of the solutions of the equation.     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

Performance and simulation of an on-board guided-wave optical processor for airborne SAR applications

This paper describes the performance and simulation of a compact integrated optical processor for the real-time reconstruction of two-dimensional images in airborne stripmap synthetic aperture radar applications. The functional behavior of the processor is explained in some detail. The design criteria are briefly given. The simulation step allowed the main processor characteristics and properties to be identified. A number of comparisons were obtained in airborne SAR mission scenarios between the predictions of the optical device and those achieved by the modern electronic digital approach, based on the wavefront reconstruction method by matched filtering.     

D_x-广义正定矩阵

讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.