Compactness in fuzzy convergence spaces

Lowen and Lowen [Applications of category theory to fuzzy subsets (Kluwer, 1992) p. 153] and Lowen et al. [Fuzzy Sets and Systems 40 (1991) 347] recently introduced the category FCS of fuzzy convergence spaces, a topological quasitopos which is a supercategory of FTS, the category of fuzzy topological spaces. In this paper, compactness in FCS is examined. Doing so we found that to define compactness as an absolute property we had to generalize the definition of fuzzy convergence space to fuzzy subsets. All basic theorems are proved including the Tychonoff product theorem. Based on the theory developed here, in a following publication, a Richardson compactification for fuzzy convergence spaces will be given.     

An LQP Method for Pseudomonotone Variational Inequalities

In this paper, we proposed a modified Logarithmic-Quadratic Proximal (LQP) method [Auslender et al.: Comput. Optim. Appl. 12, 31–40 (1999)] for solving variational inequalities problems. We solved the problem approximately, with constructive accuracy criterion. We show that the method is globally convergence under that the operator is pseudomonotone which is weaker than the monotonicity and the solution set is nonempty. Some preliminary computational results are given.The author was supported by the NSFC grants Nos: 70571033 and 10571083.     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.     

局部有限超拓扑的局部紧性

本文讨论了赋予局部有限拓扑的非空闲子集超空间的局部紧性.主要结果是:X正则,则其闭子集超空间局部紧当且仅当X可表示成一个紧空间与一个离散空间的拓扑和.     

Total surface areas of Group IVA organometallic compounds: Predictors of toxicity to algae and bacteria

There is a high correlation between molecular surface area (TSA) of triorganotin and triorganolead compounds and their toxicity towards a bacterium (Escherichia coli) and an alga (Selenastrum capricornutum). Parallel attempts to correlate other Group IVA organometals incorporating silicon or germanium were unsuccessful. It was further demonstrated, however, that a high correlation was obtainable between certain series of compounds with the same organic substituent but different metal centers involving all Group IVA elements. In both instances, the inability to obtain a quantitative structure-activity relationship (QSAR) for all systems studied appears to be a function of the solubility of the compounds. While organotin TSA values have been found to correlate well with their toxicities toward various organisms, this study clearly suggests that this type of QSAR can be readily extended to include other organometal systems, provided that there is no solubility problem and the toxicity is a function of the hydrophobicity of the organometal compounds.     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

Banach空间中极大单调算子的一个邻近点算法

设E是Banach空间,T∶E→2E*是极大单调算子,T-10≠ф.令x0∈E,yn=(J λnT)-1xn en,xn 1=J-1(αnJxn (1-αn)Jyn),n0,λn>0,αn∈[0,1],文章研究了{xn}收敛性.     

有限混合Gamma分布的拓扑稠密性证明

首先给出了有限混合Erlang分布在正实数轴上所有概率分布中稠密的理论证明,进而给出了混合Gamma分布具有稠密性的结论,说明有限混合Gamma分布具有广泛的适用性,可以用来刻画正实数轴上的任意随机变量.     

Growth of Lévy trees

We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.     

Banach空间无界域上二阶脉冲积分微分方程的解

在比较宽松的条件下，研究了Banach空间中二阶脉冲积分微分方程在正半实轴上具有无穷个脉冲点的初值问题的解的存在性。利用递归法、Tonelii序列和局部凸拓扑，建立了新的存在性定理，对郭大钧的结果做了本质改进。