The (S−1,S) inventory model and its counterparts in queueing theory

We explore the relationship between the ($S?1,S$) inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the ($S?1,S$) model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period.     

On hyperbolic virtual polytopes and hyperbolic fans

Hyperbolic virtual polytopes arose originally as polytopal versions of counterexamples to the following A.D.Alexandrov’s uniqueness conjecture: Let K ⊂ ℝ³ be a smooth convex body. If for a constant C, at every point of ∂K, we have R ₁ ≤ C ≤ R ₂ then K is a ball. (R ₁ and R ₂ stand for the principal curvature radii of ∂K.) This paper gives a new (in comparison with the previous construction by Y.Martinez-Maure and by G.Panina) series of counterexamples to the conjecture. In particular, a hyperbolic virtual polytope (and therefore, a hyperbolic hérisson) with odd an number of horns is constructed. Moreover, various properties of hyperbolic virtual polytopes and their fans are discussed.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

中国红豆杉细胞紫杉醇合成期特异表达新基因TS1-FL的部分cDNA克隆

采用mRNA差异显示技术(DDRT—PCR)比较了悬浮培养的中国红豆杉细胞合成紫杉醇前后的基因表达差异,并从紫杉醇合成期细胞中分离出一个特异表达的cDNA克隆TS1．TS1长度为638bp,序列相似性分析结果表明它代表一新基因序列(Genbank登录号：AF426429),将此新基因命名为TS1-FL．开放读框分析结果表明Tsl拥有一个不完整的开放读框,蛋白质同源性检索没有发现与TS1翻译序列有较大同源性的蛋白质．对此基因的进一步研究可揭示它在紫杉醇生物合成中所扮演的角色．     

Existence and global bounds for a fluid model of plasma display technology

This article considers the fluid model for the discharge of plasma particle species in display technology. The fluid equations are coupled with Poisson's equation, which describes the effect of the charged particles on the electric field. The diffusion and mobility coefficients for the positive ion particles depend on the electric field, while those for the electrons depend on the electron mean energy. The reaction rates are proportional to the products of the densities of the reacting particles involved in the particular ionization, conversion or recombination reactions. Moreover, the ionization coefficients are dependent on the electric field, which varies spatially and temporally. The main ionization and discharge reactions are described by an initial-boundary value problem for a system of coupled parabolic–elliptic partial differential equations. The system is first analyzed by upper–lower solution method. By means of the a priori bounds obtained for an arbitrary time, the existence of solution for the initial-boundary value problem is proved in an appropriate Hölder space.     

凸四边形上一类具有C~2-连续的插值问题的样条解及其应用

本文讨论了一类凸四边形上的插值问题.指出这类插值问题是可解的,其解是分片二元三次多项式,且在凸四边形上是C~2-连续的.我们证明了这类插值问题的解的存在性和唯一性,给出了解样条的分片表达式及其逼近度的估计.最后还给出了一个应用实例和图形显示来说明本方法是可行的.     

A Categorical Structure for the Virtual Braid Group

This article gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one morphism corresponding to a transposition in the symmetric group. This point of view makes many relationships between the virtual braid group and the pure virtual braid group apparent, and makes representations of the virtual braid groups and pure virtual braid groups via solutions to the algebraic Yang–Baxter Equation equally transparent. In this categorical framework, the virtual braid group has nothing to do with the plane and nothing to do with virtual crossings. It is a natural group associated with the structure of algebraic braiding.