Invertible linear maps preserving {1}-inverses of matrices over PID

Let R be a PID,chR = 2,n > 1, M_n(R) be then xn full matrix algebra over R.f denotes any invertible linear map preserving {1}-inverses from M_n(R) to itself. In this paper, we have proven thatf is an invertible linear map on M_n(R) preserving {1}-inverses if and only iff satisfies any one of the following two conditions: (i) there exists a matrixP ? GL _n(R) such thatf(A) =PAP ^?1 for allA ? M _n(R), (ii) there exists a matrixP ? GL _n(R) such thatf(A) =PA ^t P^?1 forA ? M _n(R).     

Well-Posedness of Fractional Differential Equations on Vector-Valued Function Spaces

We study the well-posedness of the fractional differential equations with infinite delay (P ₂): D^a u(t)=Au(t)+ò^t_-￥a(t-s)Au(s)ds + f(t), (0 ￡ t ￡ 2p){D^\alpha u(t)=Au(t)+\int^{t}_{-\infty}a(t-s)Au(s)ds + f(t), (0\leq t \leq2\pi)}, where A is a closed operator in a Banach space ${X, \alpha > 0, a\in {L}^1(\mathbb{R}_+)}${X, \alpha > 0, a\in {L}^1(\mathbb{R}_+)} and f is an X-valued function. Under suitable assumptions on the parameter α and the Laplace transform of a, we completely characterize the well-posedness of (P ₂) on Lebesgue-Bochner spaces L^p(\mathbbT, X){L^p(\mathbb{T}, X)} and periodic Besov spaces B _p,q^s(\mathbbT, X){{B} _{p,q}^s(\mathbb{T}, X)} .     

平面图的k-重(2k+2)-染色

G=(V,E)表示一个顶点集为V,边集为E的有限简单无向图.若存在映射φ:V(G)→Zk(n)(Zk(n)是由{1,2,…,n}的所有k-元子集构成的集合),满足:(A) uv∈E(G),有φ(u)∩φ(u)=θ,则称φ是G的一个k-重n-顶点染色.本文证明了奇围长至少为5k-7(k=4)或5k-9(k=6)的平面图G...     

Analyzing Multiple Phenotypes Based on Principal Component Analysis

Acta Mathematicae Applicatae Sinica, English Series - Joint analysis of multiple phenotypes can have better interpretation of complex diseases and increase statistical power to detect more...     

Singular nature of nonlinear macroscale effects in high-rate flow through porous mediaNature singulière des effets macroscopiques non linéaires dans un écoulement à hautes vitesses en milieux poreux

The quadratic law of laminar flow through porous media at high Reynolds numbers, which is well confirmed by the multiple experimental data, is shown to give rise to three fundamental paradoxes. All them can be resolved by assuming the singular structure of flow. The singularity is produced by the formation of jet brunches which invade the stagnant zones and sharply loss their kinetic energy. The numerical simulation confirms this effect. To cite this article: M. Panfilov et al., C. R. Mecanique 331 (2003).     

甲基丙烯酸甲酯光引发聚合中的初级自由基终止效应

本文研究了甲基丙烯酸甲酯在30℃时的光引发聚合。当光强较强时,聚合速率和光强的平方根不呈线性关系,聚合速率略低于经典动力学关系式所预示的数值。粘均聚合度的倒数和聚合速率也不呈线性关系。在考虑了初级自由基的终止反应后,这些偏离都得到了合理的解释。 比较甲基丙烯酸甲酯在30℃的光引发聚合和在60℃的过氧化苯甲酰引发聚合的数据,可以看出,初级自由基的终止效应在低温时更为重要。     

A note on operator‐valued Fourier multipliers on Besov spaces

Let X be a Banach space. We show that each m : ? \ {0} → L (X ) satisfying the Mikhlin condition sup_{x ≠0}(‖m (x )‖ + ‖xm ′(x )‖) < ∞ defines a Fourier multiplier on B ^s _p,q (?; X ) if and only if 1 < p < ∞ and X is isomorphic to a Hilbert space; each bounded measurable function m : ? → L (X ) having a uniformly bounded variation on dyadic intervals defines a Fourier multiplier on B ^s _p,q (?; X ) if and only if 1 < p < ∞ and X is a UMD space. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Towards auction algorithms for large dense assignment problems

In this paper, we focus on the problem of solving large-scale instances of the linear sum assignment problem by auction algorithms. We introduce a modified auction algorithm, called look-back auction algorithm, which extends the forward auction algorithm by the ability of reusing information from previous bids. We show that it is able to reuse information from the previous bids with high efficiency for all tested types of input instances. We discuss then the design and implementation of a suite of sequential and distributed memory auction algorithms on a Linux cluster with the evaluation on several types of input instances of the linear sum assignment problem. Our results show that the look-back auction algorithm solves sequentially nearly all types of dense instances faster than other evaluated algorithms and it is more stable than the forward-reverse auction algorithm for sparse instances. Our distributed memory auction algorithms are fully memory scalable. This research has been supported by IGA CTU under grant CTU0308013 and under research program MSMT 6840770014.