Investigation of the mean free path of projectile fragments produced in 16O－Em collision at 60 A GeV

Results are presented for an investigation of the mean free path of projectile fragments with charge 3≤Z≤8, produced by 60 A GeV {}^{16}O in nuclear emulsion. No dependence of mean free path on the distance from the point of the fragment emission is observed and our result is consistent with the nonexistence of anomalons.     

CONVERGENCE OF CASCADE ALGORITHMS AND SMOOTHNESS OF REFINABLE DISTRIBUTIONS

In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).     

Numerical approximation of generalized Newtonian fluids using Powell–Sabin–Heindl elements: I. theoretical estimates

In this paper we consider the numerical approximation of steady and unsteady generalized Newtonian fluid flows using divergence free finite elements generated by the Powell–Sabin–Heindl elements. We derive a priori and a posteriori finite element error estimates and prove convergence of the method of successive approximations for the steady flow case. A priori error estimates of unsteady flows are also considered. These results provide a theoretical foundation and supporting numerical studies are to be provided in Part II. Copyright © 2003 John Wiley & Sons, Ltd.     

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

半导体带电粒子探测器的研制及其在空间物理中的应用

阐述了空间辐射环境监测的意义,描述了半导体带电粒子探测器的研制及由其组成的望远镜系统在空间物理中的应用,并给出了用此探测器在卫星上进行地球辐射环境监测、太阳质子事件和地磁暴探测的部分结果.     

ON THE PRODUCT OF GATEAUX DIFFERENTIABILITY LOCALLY CONVEX SPACES

A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS.     

一个增算子不动点定理及其在Banach 空间非线性方程的应用

给出了Banach空间的一个增算子不动点定理,将这一定理应用到Banach空间的积分-微分方程,给出了一类积分-微分方程的连续可微最大解和连续可微最小解的存在性定理.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

关于Banach空间中凸泛函的广义次梯度不等式

本文在前人^[1,2]的基础之上，以凸泛函的次梯度不等式为工具，将Jensen不等式推广到Banach空间中的凸泛函，导出了Banach空间中的Bochner积分型的广义Jensen不等式，给出其在Banach空间概率论中某些应用，从而推广了文献[3—6]的工作．