一类多输出函数研究

本文研究和讨论了作为多输出函数的N级模2~M背包变换平衡特性,给出了N级模2~M平衡背包变换的结构、计数和函数性质,指出了N级模2~M平衡背包变换本身作为密码变换函数存在着除了第M路外,所有各路的输出函数都是不完全函数的弱点,从而得出了背包变换是密码学弱函数的结论.     

Specific Design of Titanium(IV) Phenolato Chelates Yields Stable and Accessible,Effective and Selective Anticancer Agents

Octahedral titanium(IV) complexes of phenolato hexadentate ligands were developed and showed very high stability for days in water solutions. In vitro cytotoxicity studies showed that, whereas tetrakis(phenolato) systems are generally of low activity presumably due to inaccessibility, smaller bis(phenolato)bis(alkoxo) complexes feature high anticancer activity and accessibility even without formulations, also toward a cisplatin‐resistant cell line. An all‐aliphatic control complex was unstable and inactive. A leading phenolato complex also revealed: 1) high durability in fully aqueous solutions; accordingly, negligible loss of activity after preincubation for three days in medium or in serum; 2) maximal cellular accumulation and induction of apoptosis following 24–48 h of administration; 3) reduced impact on noncancerous fibroblast cells; 4) in vivo efficacy toward lymphoma cells in murine model; 5) high activity in NCI‐60 panel, with average GI₅₀ of 4.6±2 μm . This newly developed family of Ti^IV complexes is thus of great potential for anticancer therapy.     

Convergent adaptive finite elements for the nonlinear Laplacian

Summary. The numerical solution of the homogeneous Dirichlet problem for the p-Laplacian, , is considered. We propose an adaptive algorithm with continuous piecewise affine finite elements and prove that the approximate solutions converge to the exact one. While the algorithm is a rather straight-forward generalization of those for the linear case p=2, the proof of its convergence is different. In particular, it does not rely on a strict error reduction. Received December 29, 2000 / Revised version received August 30, 2001 / Published online December 18, 2001 RID="*" ID="*" Current address: Dipartimento di Matematica, Università degli Studi di Milano, Via C. Saldini 50, 20133 Milano, Italy; e-mail: veeser@mat.unimi.it     

Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems

Summary. In this paper, we consider some nonlinear inexact Uzawa methods for iteratively solving linear saddle-point problems. By means of a new technique, we first give an essential improvement on the convergence results of Bramble-Paschiak-Vassilev for a known nonlinear inexact Uzawa algorithm. Then we propose two new algorithms, which can be viewed as a combination of the known nonlinear inexact Uzawa method with the classical steepest descent method and conjugate gradient method respectively. The two new algorithms converge under very practical conditions and do not require any apriori estimates on the minimal and maximal eigenvalues of the preconditioned systems involved, including the preconditioned Schur complement. Numerical results of the algorithms applied for the Stokes problem and a purely linear system of algebraic equations are presented to show the efficiency of the algorithms. Received December 8, 1999 / Revised version received September 8, 2001 / Published online March 8, 2002 RID="*" ID="*" The work of this author was partially supported by a grant from The Institute of Mathematical Sciences, CUHK RID="**" ID="**" The work of this author was partially supported by Hong Kong RGC Grants CUHK 4292/00P and CUHK 4244/01P