内函数逼近定理及上溢原理的推广及应用

在κ-饱和的非标准模型中,首先推广了内函数逼近定理,并用这一推广定理证明了著名的A sco li定理;其次将上(下)溢原理推广到一般的定向集上,并证明了拓扑空间中单子的一些性质,给出了无穷小延伸定理的一个简单证明.     

Charmonium suppression at RHIC and SPS: A hadronic baseline

A kinetic equation approach is applied to model anomalous J/ψ$J/\psi$ suppression at RHIC and SPS by absorption in a hadron resonance gas which successfully describes statistical hadron production in both experiments. The puzzling rapidity dependence of the PHENIX data is reproduced as a geometric effect due to a longer absorption path for J/ψ$J/\psi$ production at forward rapidity.     

A first-order system approach for diffusion equation. II: Unification of advection and diffusion

In this paper, we unify advection and diffusion into a single hyperbolic system by extending the first-order system approach introduced for the diffusion equation [J. Comput. Phys., 227 (2007) 315–352] to the advection–diffusion equation. Specifically, we construct a unified hyperbolic advection–diffusion system by expressing the diffusion term as a first-order hyperbolic system and simply adding the advection term to it. Naturally then, we develop upwind schemes for this entire   system; there is thus no need to develop two different schemes, i.e., advection and diffusion schemes. We show that numerical schemes constructed in this way can be automatically uniformly accurate, allow O(h)$O(h)$ time step, and compute the solution gradients (viscous stresses/heat fluxes for the Navier–Stokes equations) simultaneously to the same order of accuracy as the main variable, for all Reynolds numbers. We present numerical results for boundary-layer type problems on non-uniform grids in one dimension and irregular triangular grids in two dimensions to demonstrate various remarkable advantages of the proposed approach. In particular, we show that the schemes solving the first-order advection–diffusion system give a tremendous speed-up in CPU time over traditional scalar schemes despite the additional cost of carrying extra variables and solving equations for them. We conclude the paper with discussions on further developments to come.     

Blocking and delay performance for differential output-ports choosing probability scheme applied optical burst switching network

Differential output-ports choosing probability (DOCP) scheme is a novel traffic outputting model for core router in optical burst switching (OBS) network. In this paper, we provide an analytical model for studying the performance of traffic blocking and delay in DOCP-applied OBS network. We first evaluate blocking probabilities using DOCP and confirm it by simulation. Then, in optical buffer-equipped OBS core router, we consider the average delay time for buffered traffic and the average total traffic queueing length in core router. The knowledge of delay performance is useful for the optical buffer architecture configuration in differential traffic scenario. Several results indicate that, under the same load condition, the blocking probabilities and the delay time will change along with the changeable ports choosing probability and the ratio between different length bursts in the OBS system.     

Occupation times for the finite buffer fluid queue with phase-type ON-times

In this short communication we study a fluid queue with a finite buffer. The performance measure we are interested in is the occupation time over a finite time period, i.e., the fraction of time the workload process is below some fixed target level. Using an alternating renewal sequence, we determine the double transform of the occupation time; the occupation time for the finite buffer M/G/1 queue with phase-type jumps follows as a limiting case.     

A note on the Conley attractors of lower semicontinuous multifunctions

We discuss Conley-type approach to attractive sets for lower semicontinuous multifunctions. Since every iterated function system induces a Barnsley–Hutchinson multifunction which is l.s.c. in such a case it is much more natural to consider a multifunctions of that type then closed relations on compact spaces earlier considered by some authors. We use topological (Kuratowski’s) limit instead of commonly used Hausdorff metric.     

New general convergence theory for iterative processes and its applications to Newton–Kantorovich type theorems

Let T:D⊂X→X$T:D\subset X\to X$ be an iteration function in a complete metric space X$X$. In this paper we present some new general complete convergence theorems for the Picard iteration _xn+1=T_xn$x_{n+1}=T{x}_n$ with order of convergence at least r≥1$r\ge 1$. Each of these theorems contains a priori and a posteriori error estimates as well as some other estimates. A central role in the new theory is played by the notions of a function of initial conditions   of T$T$ and a convergence function   of T$T$. We study the convergence of the Picard iteration associated to T$T$ with respect to a function of initial conditions E:D→X$E:D\to X$. The initial conditions in our convergence results utilize only information at the starting point _x0$x_0$. More precisely, the initial conditions are given in the form E(_x0)∈J$E\left(x_0\right)\in J$, where J$J$ is an interval on _R+${\mathbb{R}}_{+}$ containing 0. The new convergence theory is applied to the Newton iteration in Banach spaces. We establish three complete ω$\omega$-versions of the famous semilocal Newton–Kantorovich theorem as well as a complete version of the famous semilocal α$\alpha$-theorem of Smale for analytic functions.     

The approximation characteristic of diagonal matrix in probabilistic setting

In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)$(n,\delta )$-width and p$p$-average linear n$n$-width of diagonal matrix M$M$ are determined.