Revising the OWA operator for multi criteria decision making problems under uncertainty

Multi criteria decision making (MCDM) problems are usually under uncertainty. One of these uncertain parameters is the decision maker (DM)’s degree of optimism, which has an important effect on the results. Fuzzy linguistic quantifiers are used to obtain the assessments of this parameter from DM and then, because of its uncertainty it is assumed to have stochastic nature. A new approach, entitled FSROWA, is introduced to combine the Fuzzy and Stochastic features into a Revised OWA operator.     

含估计参数的加权经验过程

在讨论(广义)非参数似然比拟合优度检验时,加权经验过程理论是一个非常重要的基础.但对含估计参数的加权经验过程理论,目前文献中很少讨论.对含估计参数的加权经验过程的上界型和积分型两种统计量的近似分布进行了讨论,给出了较一般的结果.所得结论叮以为进一步讨论复合零假设下(广义)非参似然比拟合优度检验提供理论基础.     

多圆盘上的H∞与广义加权Bloch空间之间的复合算子

设φ 是Cⁿ的开单位多圆盘上的全纯自映射,α > 0. 该文主要研究了多圆盘上的H^∞与广义加权Bloch空间B^α_log(Uⁿ)之间的复合算子C_φ的有界性与紧性.     

加权Begman空间的加权复合算子的本性模

利用上极限,给出了单位球上加权Bergman空间的加权复合算子的本性模的表示．     

Estimates on Bloch constants for planar harmonic mappings

The Bloch constants for quasiregular harmonic mappings and open planar harmonic mappings are considered. Better estimates are obtained. The results, presented in this paper, improve the one made by Chen et al. and Grigoryan. This work was supported by the Research Foundation for Doctor Programme (Grant No. 20050574002) and the National Natural Science Foundation of China (Grant No. 10471048)     

Bergman型空间的加权复合算子

Let g1,g2 be normal functions. For all 0 〈 p,q 〈 ∞, the necessary and sufficient conditions for weighted composition operators Tψ,φ ： A^Pg1 → A^Pg2 to be bounded or compact between Bergman type spaces on the unit ball of C^n are given.     

An algorithm for three-dimensional Voronoi S-network

The paper presents an algorithm for calculating the three-dimensional Voronoi-Delaunay tessellation for an ensemble of spheres of different radii (additively-weighted Voronoi diagram). Data structure and output of the algorithm is oriented toward the exploration of the voids between the spheres. The main geometric construct that we develop is the Voronoi S-network (the network of vertices and edges of the Voronoi regions determined in relation to the surfaces of the spheres). General scheme of the algorithm and the key points of its realization are discussed. The principle of the algorithm is that for each determined site of the network we find its neighbor sites. Thus, starting from a known site of the network, we sequentially find the whole network. The starting site of the network is easily determined based on certain considerations. Geometric properties of ensembles of spheres of different radii are discussed, the conditions of applicability and limitations of the algorithm are indicated. The algorithm is capable of working with a wide variety of physical models, which may be represented as sets of spheres, including computer models of complex molecular systems. Emphasis was placed on the issue of increasing the efficiency of algorithm to work with large models (tens of thousands of atoms). It was demonstrated that the experimental CPU time increases linearly with the number of atoms in the system, O(n).     

Parallel coupled perturbed CASSCF equations and analytic CASSCF second derivatives

A parallel algorithm for solving the coupled-perturbed MCSCF (CPMCSCF) equations and analytic nuclear second derivatives of CASSCF wave functions is presented. A parallel scheme for evaluating derivative integrals and their subsequent use in constructing other derivative quantities is described. The task of solving the CPMCSCF equations is approached using a parallelization scheme that partitions the electronic hessian matrix over all processors as opposed to simple partitioning of the 3 N solution vectors among the processors. The scalability of the current algorithm, up to 128 processors, is demonstrated. Using three test cases, results indicate that the parallelization of derivative integral evaluation through a simple scheme is highly effective regardless of the size of the basis set employed in the CASSCF energy calculation. Parallelization of the construction of the MCSCF electronic hessian during solution of the CPMCSCF equations varies quantitatively depending on the nature of the hessian itself, but is highly scalable in all cases.     

Asymptotic properties of supercritical branching processes in random environments

We consider a supercritical branching process （Zn） in an independent and identically distributed random environment ξ, and present some recent results on the asymptotic properties of the limit variable W of the natural martingale Wn = Zn/E[Zn｜ξ], the convergence rates of W - Wn （by considering the convergence in law with a suitable norming, the almost sure convergence, the convergence in Lp, and the convergence in probability）, and limit theorems （such as central limit theorems, moderate and large deviations principles） on （log Zn）.     

Complete Convergence of Weighted Sums for Arrays of Rowwise $m$-Negatively Associated Random Variables

In this paper, we discuss the complete convergence of weighted sums for arrays of rowwise $m$-negatively associated random variables. By applying moment inequality and truncation methods, the sufficient conditions of complete convergence of weighted sums for arrays of rowwise $m$-negatively associated random variables are established. These results generalize and complement some known conclusions.