Asymptotic distribution of maximal autoregressive process with weight tending to 1

The maximal operator plays the similar role as the summation operator in the sense of stability of operation. So, we could discussARMA processes in the maximal operation by the same way as in the summation operation. However, many papers already treated with moving order statistics. In this paper, we discuss asymptotic behaviors of maximal autoregressive (MAR) processes with the weight tending to 1.     

On the distribution of the number of packets in the fluid flow approximation of packet arrival streams

Fluid flow approximations are widely used for approximating models of communication systems where packet arrival streams are generated in a regular manner over certain intervals (constant rate). The appropriate mathematical model for describing those bursty arrival streams in the fluid flow framework are the well-known Markov modulated rate processes (MMRP). The paper deals with the distribution of the numberN(t) of packets in the interval [0,t] of MMRP. For two-state MMRPs and their superpositions we derive formulas for the distribution ofN(t) and its density. Further we give asymptotic results. The presented numerical results and simulation studies illustrate the goodness of the fluid flow approximation and show that the proposed numerical algorithms work well even in the case of multiplexing a large number of burst silence sources.This work was partially supported by a grant from the Deutsche Bundespost TELEKOM.     

带耗散的一阶非线性偏微分方程组的Cauchy问题

本文采用整体迭代法证明了带小初值的一阶非线性耗散偏微分方程组的Cauchy问题的整体经典解的存在性及指数衰减性质。     

A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS

In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.     

A law of the iterated logarithm for processes with independent increments

ＡＬＡＷＯＦＴＨＥＩＴＥＲＡＴＥＤＬＯＧＡＲＩＴＨＭＦＯＲＰＲＯＣＥＳＳＥＳＷＩＴＨＩＮＤＥＰＥＮＤＥＮＴＩＮＣＲＥＭＥＮＴＳＷＡＮＧＪＩＡＧＡＮＧ（汪嘉冈）（ＥａｓｔＣｈｉｎａＵｎｉｖｅｒｓｉｔｙｏｆＳｃｉｅｎｃｅ＆Ｔｅｃｈｎｏｌｏｇｙ,Ｓｈａｎｇ...     

Joint availability of systems modelled by finite semi–markov processes

Consider a repairable system at the time instants t and t + x, where t, x ≥0. The joint availability of the system at these time instants is defined as the probability of the system being functional in both t and t + x. A set of integral equations is derived for the joint availability of a system modelled by a finite semi–Markov process. The result is applied to the semi–Markov model of a two–unit system with sequential preventive maintenance. The method used for the numerical solution of the resulting system of integral equations is a two–point trapezoidal rule. The system of implementation is the matrix computation package MATLAB on the Apple Macintosh SE/30. The numerical results obtained by this method are shown to be in good agreement with those from simulation.     

Equivalence of conditions for convergence of iterative methods for singular equations

Equivalence is shown between different conditions for convergence of iterative methods for consistent singular systems of linear equations on Banach spaces. These systems appear in many applications, such as Markov chains and Markov processes. The conditions considered relate the range and null spaces of different operators.     

On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling

Recently, Freund and Nachtigal proposed the quasi-minimal residual algorithm (QMR) for solving general nonsingular non-Hermitian linear systems. The method is based on the Lanczos process, and thus it involves matrix—vector products with both the coefficient matrix of the linear system and its transpose. Freund developed a variant of QMR, the transpose-free QMR algorithm (TFQMR), that only requires products with the coefficient matrix. In this paper, the use of QMR and TFQMR for solving singular systems is explored. First, a convergence result for the general class of Krylov-subspace methods applied to singular systems is presented. Then, it is shown that QMR and TFQMR both converge for consistent singular linear systems with coefficient matrices of index 1. Singular systems of this type arise in Markov chain modeling. For this particular application, numerical experiments are reported.     

Ba(Zr0.3Ti0.7)O3 铁电薄膜的制备

介绍了用溶胶-凝胶法(sol-gel)在Pt/Ti/SiO2/Si衬底和石英衬底上制备Ba(Zr0.3Ti0.7)O3铁电薄膜的基本原理、工艺过程及工艺特点;Sol-gel制备的Ba(Zr0.3Ti0.7)O3铁电薄膜表面平整、厚度均匀.     

Charge storage and relaxation process of polymer film by thermally stimulated discharge current technique

Charge storage and relaxation process of the polymide film electret were investigated using the thermally stimulated discharge current technique. Homo- and heterocharges were mainly observed up to and above the polarization temperature.