An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

Existence Results for Semilinear Neutral Functional Differential Inclusions via Analytic Semigroups

In this paper we prove existence results for semilinear neutral functional differential inclusions with finite or infinite delay in Banach spaces. Our theory makes use of analytic semigroups and fractional powers of closed operators, integrated semigroups and cosine families.      

p+209Bi核反应微观数据的理论计算

利用光学模型、激光模型、蒸发模型及扭曲波玻恩近似理论,对入射能量从阈能到300MeV,p+²⁰⁹Bi的中子反应截面、剩余核截面、出射粒子的多重数进行了理论计算及分析,并将计算结果与实验数据进行了比较.同时得到一组能量到50?0MeV与实验数据符合很好的光学势参数.     

知识发现中一种变化趋势模型的算法研究

在时序数据库中,有许多成熟的技术和方法用来对布尔型属性之间的关系进行挖掘,但对于数值型属性变化趋势关联关系的研究却不是很多.本文提出了一种数值型属性变化趋势的研究模型QMP(QuantityMovementPattern),依据该模型可利用数据挖掘算法发现不同数值型属性之间变化趋势之间的关系.文中分析了该模型的几种实现算法,并给出了一种快速实现算法及实验数据.     

BEPC中电子云导致的束团横向尺寸增长研究

多束团正电子储存环中可能发生电子云不稳定性. 由于电子云导致的束团横向尺寸增长已经成为提高对撞机对撞亮度的主要限制因素之一. 介绍了在BEPC储存环中, 利用条纹相机直接测量由于电子云导致的束团横向尺寸增长结果, 并与模拟计算进行了比较.     

Bubble point pressure estimates from Gibbs ensemble simulations

Bubble pressure points of ethanol–1,1,1,2,3,3,3-heptafluoropropane (HFC-227ea refrigerant) mixtures from the third Industrial Fluid Properties Simulation Challenge are computed using publicly available molecular simulation software. Several published force fields are compared against the known answers provided in the contest guidelines and the best force fields are used to make predictions for the unknown results.     

非对称度量空间上不动点定理

提出建立在非对称度量空间之间的上收缩映射和下收缩映射的概念.考虑到非对称度量的不对称性,进一步定义了非对称度量空间到自身映射的左不动点和右不动点.最后,给出了非对称度量空间上的两个不动点定理.     

On the number of full levels in tries

We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2^k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log_1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Isotone relations revisited

We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.