Permanence for non-autonomous food chain systems with delay

In this paper we first establish a new general criterion for the permanence of Kolmogorov-type systems of nonautonomous functional differential equations. Then, as applications of this criterion we study the permanence of a class of n-species general nonautonomous food chain systems with delay and new sufficient condition are established.     

Periodic Solution of a Nonautonomous Diffusive Food Chain System of Three Species with Time Delays

Abstract By using the continuation theorem of coincidence degree theory,the existence of a positive periodicsolution for a nonautonomous diffusive food chain system of three species. dx_1(t)/dt=x_1(t)[r_1(t)-a_(11)(t)x_1(t)-a_(12)(t)x_2(t)]+D_1(t)[y(t)-x_1(t)], dx_2(t)/dt=x_2(t)[-r_2(t)+a_(21)(t)x_1(t-r_1)-a_(22)(t)x_2(t)-a_(23)(t)x_3(t)], dx_3(t)/dt=x_3(t)[-r_3(t)+a_(32)(t)x_2(t-r_2)-a_(33)(t)x_3(t)], dy(t)/dt=y(t)[r_4(t)-a_(44)(t)y(t)]+D_2(t)[x_1(t)-y(t)]+D_2(t)[x_1(t)-y(t)],is established,where,r_i(t),a_(ii)(t)(i=1,2,3,4),D_i(t)(i=1,2),a_(12)(t),a_(21)(t),a_(23)(t)and a_(32)(t) are all positiveperiodic continuous functions with period w>0,T_i(i=1,2)are positive constants.     

Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

Stopping times for quantum Markov chains

In the paper we introduce stopping times for quantum Markov states. We study algebras and maps corresponding to stopping times, give a condition of strong Markov property and give classification of projections for the property of accessibility. Our main result is a new recurrence criterium in terms of stopping times (Theorem 1 and Corollary 2). As an application of the criterium we study how, in Section 6, the quantum Markov chain associated with the one-dimensional Heisenberg (usually non-Markovian) process, obtained from this quantum Markov chain by restriction to a diagonal subalgebra, is such that all its states are recurrent. We were not able to obtain this result from the known recurrence criteria of classical probability.Supported by GNAFA-CNR, Bando n. 211.01.25.     

有向图上的随机游动

设G=(V,Г)是有向图,G上的随机游动X(G)定义如下:位于某个顶点上的一个粒子将以等概率转移到该顶点的所有后继顶点.令M(j,n)表示随机游动X(G)在前n步内访问顶点j的平均次数,用W(j)表示随机游动X(G)到达顶点j所需要的平均步效.我们对M(j,n)和W(j)的值进行了估计,证明了M(j,n)=O(n),并给出了W(j)的上界.     

关于任意随机变量序列泛函的强极限定理

本文在k是固定的正整数，{fn}是R^k 1上的Borel可测函数列时，得到了任意随机变量序列{Xrn≥0}的泛函{fn(Xn-k,…,Xn)}的强极限定理，它是Chung的关于独立随机变量序列的强大数律的推广，作为推论，得到了k重非齐次马尔科夫链的一类强极限定理．     

分布式配送系统在运输时间均匀分布条件下的性能分析

本文在运输时间不确定的前提下，对分布式配送系统在两个部件和最终产品早到无限制的情形下建立了随机优化模型。我们在极小化库存费用的同时以满足定时送货要求为目标，讨论了如何确定运输提前期，并给出了敏感性分析结果。     

Perfectly normal non-metrizable non-Archimedean spaces are generalized Souslin lines

In this paper we prove the equivalence between the existence of perfectly normal, non-metrizable, non-archimedean spaces and the existence of ``generalized Souslin lines", i.e., linearly ordered spaces in which every collection of disjoint open intervals is -discrete, but which do not have a -discrete dense set. The key ingredient is the observation that every first countable linearly ordered space has a dense non-archimedean subspace.

     

Morphological evidence for surface pre-melting on Si(1 1 1)

We present what we believe to be the first morphological evidence for the occurrence of surface pre-melting on the Si(1 1 1) surface. Our results complement the extensive previous evidence from diffraction and ion scattering techniques for the presence of pre-melted (liquid-like) layers on Si(1 1 1) below the bulk melting temperature and also suggest how atomic steps are involved in the initiation of such layers. Our results are based on atomic force microscopy studies of morphologies that are preserved when surfaces are annealed in a range of high temperatures and then rapidly cooled to room temperature for observation. A unique feature of the experiments is the use of specially prepared atomically flat or very low step density surfaces; this allows us to see how the liquid-like morphologies are associated with the steps and also allows the high temperature structures to survive the cooling process without being absorbed into the steps which normally would exist on a surface vicinal to (1 1 1). Quenched-in structures ascribed to pre-melting also act as sinks for diffusing ‘excess’ adatoms generated by the (1 × 1) to (7 × 7) transition and this leads to the formation of dendritic islands.     

Structural characterization of nanopatterned surfaces

In this work, chemically and topographically nanopatterned surfaces were produced by a top-down processing approach for biosensing devices. The nanopatterning was the result of the combination of plasma polymerisation (pp) of biofunctional materials and colloidal lithography techniques. The morphological and chemical properties induced by the plasma deposition-etching treatment were characterised by optical method combining ellipsometry and Fourier Transform Infrared spectroscopy studies. This method supported by atomic force microscopy measurements, allowed the full optical characterization of each step of the top-down process. The optical characterization of the end-up nanopatterned samples demonstrated that the chosen process is able to produce well-defined nanostructured surfaces with controlled chemical and morphological properties.