On Hypercentral Groups G With |G:G n |<∞

In 1960, Baumslag, following up on work of Cernikov for the 1940s, proved that a hypercentral p-group G with G = G ^p is a divisible Abelian group. In this article, we provide an interesting generalization of this 45 year old result: If a hypercentral p-group G satisfies |G:G ^p |<∞ (of course, it contains G = G ^p ), there exists a normal divisible Abelian subgroup D such that |G:D|<∞.     

Wahl’s conjecture for a minuscule <Emphasis Type="Italic">G/P</Emphasis>

We show that Wahl’s conjecture holds in all characteristics for a minuscule G/P.     

输入受控M/G/1排队

本文讨论M/G/1排队系统输入过程的一个最优控制问题:假定顾客有几类,系统对每类顾客服务得到的报酬不同,在系统运行过程中如何对顾客进行筛选使得在单位时间内得到的报酬最大,这归结为一个马氏决策规划问题。本文对这一问题进行了讨论,并给出了算法。     

关于GI/G/1/∞排队系统的平稳等待时间分布的局部尾等价式

关于GI/G/1/∞排队系统的平稳等待时间分布W,已有许多经典的结果描述了其尾分布[AKW-](x)=1-W(x)的等价极限情况.该文结合一些保险与金融领域重要的风险变量,研究了关于分布W的各种局部尾等价式问题.     

Ek/G/1排队系统的遍历性

该文研究了$E_k/G/1$排队系统等待时间$W(t)$和队长$L(t)$的 Harris遍历、几何遍历和一致遍历. 首先作者利用判别法给出了$W(t)$的$h$ -骨架链的几种遍历性的充要条件.由此得出$W(t)$的相应结果,然后在$W(t)$的结果的基础上,利用小集的方法得到了队长 $L(t)$的这几种遍历性成立的充要条件.     

Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for <Emphasis Type="Italic">ρ</Emphasis><<Emphasis Type="Italic">c</Emphasis>

We present an exact simulation algorithm for the stationary distribution of customer delay for FIFO M/G/c queues in which ρ=λ/μ<c. In Sigman (J. Appl. Probab. 48A:209–216, 2011) an exact simulation algorithm was presented but only under the strong condition that ρ<1 (super stable case). We only assume that the service-time distribution G(x)=P(S≤x), x≥0, with mean 0<E(S)=1/μ<∞, and its corresponding equilibrium distribution $G_{e}(x)=\mu\int_{0}^{x} P(S>y)\,dy$G_{e}(x)=\mu\int_{0}^{x} P(S>y)\,dy are such that samples of them can be simulated. Unlike the methods used in Sigman (J. Appl. Probab. 48A:209–216, 2011) involving coupling from the past, here we use different methods involving discrete-time processes and basic regenerative simulation, in which, as regeneration points, we use return visits to state 0 of a corresponding random assignment (RA) model which serves as a sample-path upper bound.     

新Dirichlet级数Σn=0∞aneλns收敛横坐标

本文给出新Dirichlet级数Σ_n=0^∞a_ne^λ_ns的收敛横坐标σ_c、一致收敛横坐标σ_u和绝对收敛横坐标σ_a的定义.通过指数λ_n和系数a_n的关系去估计三个横坐标,并补充证明两类Dirichlet级数Σ_n=0^∞a_ne^λ_ns和Σ_n=0^∞a_ne^-λ_ns的收敛条件是一致的.     

空竭服务Geom/G/1休假模型

本文用嵌入Markov链的方法证明了Geom／G／1的边界状态变体模型的随机分解定理，同时又证明两种具体模型的结果．     

MATCHED QUEUEING SYSTEM M·PH/G/1

In this paper,we study the matched queueing system,MoPH/G/1,where the type-Ⅰ input is a Poisson process,the type-Ⅱ input is a PH renewal process, and the service times are i.i.d. random variables. A necessary and sufficient condition for the stationariness of the system is given.The expectations of the length of the non-idle period and the number of customers served in a non-idle period are obtained.     

多级适应性休假的M/G/1排队

在经典M/G/1排队中引入多级适应性休假规则,得到稳态队长、等待时间分布和随机分解,并给出忙期、假期、在线期分布.单重休假和多重休假模型是本文中模型的两个极端情况.     

推广的M~x/G(M/G)/1(M/G)可修排队系统(I)── 一些排队指标

考虑Ｍｘ／Ｇ（Ｍ／Ｇ）／１（Ｍ／Ｇ）可修排队系统,且把该系统推广到休假时间、服务时间、修理时间和延误休假时间都为任意分布（不一定连续）,利用服务员忙期和拉普拉斯交换,我们直接获得队长瞬态分布的Ｌ变换递推式和稳态分布的递推式,以及队长的概率母函数,同时指出了１９９４年史定华文中存在的错误．     

M/G/∞ with batch arrivals

Let p_∞(n) be the distribution of the number N(∞) in the system at ergodicity for systems with an infinite number of servers, batch arrivals with general batch size distribution and general holding times. This distribution is of importance to a variety of studies in congestion theory, inventory and storage systems. To obtain this distribution, a more general problem is addressed. In this problem, each epoch of a Poisson process gives rise to an independent stochastic function on the lattice of integers, which may be viewed as stochastic impulse response. A continuum analogue to the lattice process is also provided.     

推广的M~x/G(M/G)/1(M/G)可修排队系统(I)── 一些排队指标

考虑M     

Symmetric duality with (p, r) − ρ − (η, θ)-invexity

In this paper we introduce a new type of generalized invex function, called (p, r) − ρ − (η, θ)-invex function and study symmetric duality results under these assumptions. In our study the nonnegative orthants for the constraints are replaced by closed convex cones and their polars. We establish weak and strong duality theorems under (p, r) − ρ − (η, θ)-invexity assumptions for the symmetric dual problems. We also give many examples to justify our results.     

G/G/k模型下面对时间敏感顾客的即时服务平台供需协调问题研究

服务方通过一个即时服务平台为时间和价格均敏感的顾客提供服务,平台决定服务价格和服务方工资.基于即时服务平台的特征建立随机需求排队模型,将G/G/k排队模型等待时间函数引入顾客效用中,研究影响平台决策的市场因素.首先分析使用固定支付比例时平台的最优决策特征,然后扩展到使用动态支付比例的即时服务平台决策模型,并进行数值实验...     

Exact Formulas for Eθ/G/1/N-Type Queuing Systems

We investigate E /G/1/N-type queuing systems with limited queue. The investigation is based on the potential method proposed by Korolyuk     

应用G/G′展开法求Ostrovsky方程的孤子解

应用(G/G')展开法构造出(1+1)维0strovsky方程的10组精确解,这些解的类型主要包含双曲函数通解、三角函数通解和有理函数通解三种形式.对解的性质进行了相应地分析,当对双曲函数通解中的参数取特殊值时,可以得到了孤立波解.当对三角函数通解中引中的参数取特殊值时,可以得到对应的周期波函数解.     

空间l p(G ) (p>1)的单位球面间等距算子的延拓

首先得到l ^p(G ) (p>1, p≠2)单位球面之间(满)等距算子的表现定理, 然后利用作者过去一个结果导出: 上述算子均可延拓为全空间上的(实)线性等距算子.     

广义函数x+λ和x-μ的乘积

For any complcx λ≠integral, and any natural number n, the product is calcuated and Hadmard''s finite part of obtained. The product is also obtained when λ+μ is a complex number of any other possible kind, and μ is a complex number ≠ integral. The products are also calculated. Any special example of these kinds of products has not yet been calculated.