双亲性无规共聚物P（VM-co-AMPS）的自组装及其性能

以2-丙烯酰胺基-2-甲基丙磺酸（AMPS）和苯乙烯类光敏单体7-（4-乙烯基苄氧基）-4-甲基香豆素（VM）为共聚单体,采用自由基聚合法制备了光敏性双亲共聚物P（VM-co-AMPS）。P（VM-co-AMPS）在溶剂水中自组装胶束化,用原子力显微镜（AFM）表征了自组装胶体粒子的形态、粒径及其分布。紫外光照使胶体粒子中香豆素基元发生光二聚反应,用紫外-可见光分光光度计（UV-Vis）跟踪其光二聚交联过程,用光学显微镜考察了胶体粒子的乳化性能。结果表明：胶体粒子具有较好的紫外吸收性能和较好的乳化性能。该胶束制备工艺简单,条件温和,避免了溶剂的使用。     

On the strong convergence rate for positively associated random variables

For sequences of the positively associated random variables which are strictly weaker than the classical associated random ones introduced by Esary et al. (1967) [7], strong convergence rate is obtained, which reaches the available one for independent random variables in terms of Berstein type inequality. Further, we give the corresponding precise asymptotics with respect to the rate mentioned above, which extend and improve the relevant results in Fu (2009) [8].     

The bialternate matrix product revisited

The well known bialternate product of two square matrices is re-examined together with another matrix product defined by means of the permanent function and having similar properties. Old and new results concerning both products are presented in a unified manner. A simple and elegant relation with the Kronecker product of matrices is also given.     

Powers of complex persymmetric or skew-persymmetric anti-tridiagonal matrices with constant anti-diagonals

In this paper, we derive a general expression for the entries of the powers of any complex persymmetric or skew-persymmetric anti-tridiagonal matrix with constant anti-diagonals, in terms of the Chebyshev polynomials of the second kind.     

On the degree of approximation of functions belonging to a Lipschitz class by Hausdorff means of its fourier series

In a recent paper Lal and Yadov [4] obtained a theorem on the degree of approximation for a function belonging to the Lipschitz class Lipα using the product of the Cesàro and Euler means of order one of its Fourier series. In this paper we extend this result to any regular Hausdorff matrix for the same class of functions.     

Effective partitioning method for computing generalized inverses and their gradients

We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from [11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that purpose, we exploit two effective structures form [6], which make use of only nonzero addends in polynomial matrices, and define their partial derivatives. Symbolic computational package MATHEMATICA is used in the implementation. Several randomly generated test matrices are tested and the CPU times required by two used effective structures are compared and discussed.     

A parametric GP model dealing with incomplete information for group decision-making

We consider a group decision-making problem where preferences given by the experts are articulated into the form of pairwise comparison matrices. In many cases, experts are not able to efficiently provide their preferences on some aspects of the problem because of a large number of alternatives, limited expertise related to some problem domain, unavailable data, etc., resulting in incomplete pairwise comparison matrices. Our goal is to develop a computational method to retrieve a group priority vector of the considered alternatives dealing with incomplete information. For that purpose, we have established an optimization problem in which a similarity function and a parametric compromise function are defined. Associated to this problem, a logarithmic goal programming formulation is considered to provide an effective procedure to compute the solution. Moreover, the parameters involved in the method have a clear meaning in the context of group problems.     

Enumeration of non-crossing pairings on bit strings

A non-crossing pairing on a bit string is a matching of 1s and 0s in the string with the property that the pairing diagram has no crossings. For an arbitrary bit-string w=p₁¹q₁⁰…pr¹qr⁰, let φ(w) be the number of such pairings. This enumeration problem arises when calculating moments in the theory of random matrices and free probability, and we are interested in determining useful formulas and asymptotic estimates for φ(w). Our main results include explicit formulas in the “symmetric” case where each pi=qi, as well as upper and lower bounds for φ(w) that are uniform across all words of fixed length and fixed r. In addition, we offer more refined conjectural expressions for the upper bounds. Our proofs follow from the construction of combinatorial mappings from the set of non-crossing pairings into certain generalized “Catalan” structures that include labeled trees and lattice paths.