关于M/M/n排队模型的动态解及稳定性

文章讨论动态 M/M/n排队模型 ,运用算子半群理论证明了该模型动态正解的存在唯一性 .并进一步表明零点是系统的一个本征值 ,相应的本征函数为系统的一个定态正解 ,系统的动态正解强稳定到定态解     

正项级数在M/M/1重试排队模型的特征值研究中的应用

运用正项级数的有关知识证明:当(λ(α+λ)/(αβ)=1/4时,M/M/1重试排队模型的主算子在左半复平面中有不可数无穷多个特征值.     

多服务台可修系统的优化分析

机器可修系统是可修排队的一个重要研究方向,研究了具有止步,中途退出和服务台可发生故障的M/M/R机器可修问题.利用矩阵几何解法,得到了稳态概率的矩阵几何解,在此基础上建立了系统的费用模型,并进行了数值分析.     

M/M~B/1排队模型的时间依赖解的存在唯一性

应用线性算子的积分半群理论证明 M/MB/1排队模型的时间依赖解的存在唯一性 ,其次推出 M/M/1排队模型的时间依赖解的存在唯一性 .     

Once-punctured Klein bottles in knot complements

We find the family of all knots in S³ which are spanned by two essential once-punctured Klein bottles with boundary slopes at distance 4, thus settling a conjecture by K. Ichihara, M. Ohtouge, and M. Teragaito. We also address the more general question of when a knot exterior in an arbitrary 3-manifold contains two essential once-punctured Klein bottles with distinct boundary slopes.     

M5 model tree and Monte Carlo simulation for efficient structural reliability analysis

Practically, the performance of many engineering problems can be defined using a complex implicit limit state function. Approximation of the accurate failure probability is very time-consuming and inefficient based on Monte Carlo simulation (MCS) for complex performance functions. M5 model tree (M5Tree) model is robust approach for simulation and prediction phenomena, which provides ability to dealing with complex implicit problems by dividing them into smaller problems. By improving the efficiency of reliability method using accurate approximated failure probability, an efficient reliability method using the MCS and M5Tree is proposed to calibrate the performance function and estimate the failure probability, respectively. The superiorities including simplicity and accuracy of M5Tree meta-model are investigated to evaluate the actual performance function through five nonlinear complex mathematical and structural reliability problems. The proposed reliability method-based MCS and M5Tree improved the computational efforts for evaluating the performance function in reliability analysis. The M5Tree significantly increased the efficiency of reliability analysis with accurate failure probability.     

关于M/M/1动态排队系统解的半稳定性

本文讨论了两类 M/M/1 动态系统的数学模型 ,利用常微分方程所描述的 M/M/1 系统的结果证明了较复杂的偏微分方程所描述的 M/M/1 系统的一些性质 ,该方法简化了已有结果     

M/M/1排队模型的l~1动态解及其稳定性

运用算子半群理论证明了 M/M/1排队模型的 l1动态解的稳定性和正等距性 .     

基于GMVAR模型的货币供应量的预测分析

为分析和预测货币供应量的变化趋势,建立了M0供应量的同比增长率RM0与M2供应量的同比增长率RM2的GMVAR(2,2)模型和VAR(2,2)模型.通过对比AIC和BIC发现GMVAR(2,2)模型明显优于一般VAR(2,2)模型.对未知参数进行最大似然估计,发现GMVAR(2,2)模型参数估计的效果较好.通过使用GM...     

常微分方程形式的M/M/1排队模型的一个注

讨论动态Ｍ／Ｍ／１排队模型，运用半群理论证明了该模型存在唯一的正解，并研究了相应算子的谱特征．     

具有剩余寿命的M/G/1/K排队模型非负解的存在唯一性

研究了以剩余寿命作为增补变量的M／G／1／K排队模型．利用泛函分析中线性算子半群的积分半群理论讨论了该模型的瞬态解的存在唯一性问题．     

具有剩余寿命且排队空间有限的M/G/1排队模型非负解的存在唯一性

研究了以剩余寿命作为增补变量,排队空间有限的M/G/1排队模型,利用泛函分析中线性算子半群的积分半群理论讨论了该模型的瞬态解的存在唯一性问题。     

单调函数在具有可选服务的M/M/1排队模型研究中的应用

运用函数的导数与单调性之间的关系证明具有可选服务的M/M/1排队模型的主算子的豫解集研究中出现的三个不等式.由此推出,在虚轴上除了零外其它所有点都属于该模型的主算子的豫解集.     

对一类等待空间有限的抢占优先权排队的分析

讨论M/M/1抢占优先权排队模型, 且假设低优先权顾客的等待空间有限. 该模型可以用有限位相拟生灭过程来描述. 由矩阵解析方法, 对该拟生灭过程进行了分析, 并得到排队模型平稳队长的计算公式, 最后还用数值 结果说明了方法的有效性.     

可变输入率M/M/n模型的动态解及其渐近稳定性

本文运用有界线性算子半群理论讨论了可变输入率M/M/n排队模型,证明模型主算子生成C0半群,并运用一定的技巧证明动态解渐近稳定到其定态解.     

Combined location and routing problems for designing the quality-dependent and multi-product reverse logistics network

With a growing awareness of carbon footprints and their impact on environmental degradation, many firms hope to streamline their reverse logistics (RL) operations involving end-of-use products. However, managing end-of-use products can be extremely challenging due to inherent complexity involved in the collection, sorting, transhipment, and processing of these products. Despite numerous challenges, the efficient handling of these products can be a source of competitive advantages. In this regard, a plastic recycling industry in Southern India is no exception. This industry often copes with the problem of picking up recyclable plastic bottles using private collecting agents, transferring those bottles to the initial collection points (ICPs), and then transhipping and consolidating them at the centralized return centres (CRCs) for final shipments to the processing centres where these bottles were treated for recycling. This problem can be further complicated with the dilemma of finding the most ideal locations of ICPs and CRCs and the optimal routing of vehicles serving ICPs and CRCs such that the total RL cost is minimized. To aid the industry in dealing with such RL problems, we developed a mathematical model and then evaluated the performances of that model with the actual data obtained from a case study of the Indian company. Given a lack of efforts in combining the location-routing problem with the balanced allocation problem in the closed-loop supply chain network, the main contribution of this paper includes the simultaneous consideration of location, allocation, and routing decisions. In addition, this paper is one of the first to consider incentive payments, the quality level of products, and multiple types of products.     

服务员强制休假的M/G/1排队模型的适定性

运用Hille-Yosida定理,Phillips定理与Fattorini定理证明服务员强制休假的M/G/1排队模型存在唯一的概率瞬态解.     

长记忆模型的Bayes估计及其在汇率波动中的应用

本文介绍了长记忆模型及其检验方法,根据Bayes原理,提出了记忆参数的一种新的估计方法.在运用Teverovsky/Taqqu(1997)年提出的一种基于样本方差的直观方法的初步检验基础上,运用新的检验方法,以美元对人民币汇率为研究对象,说明了我国汇率波动的长记忆性.然后,将经典的GPH-估计与新方法所得出的Bayes-估计相比较,可以看出这种新的估计方法较之经典的GPH-估计要稳定.     

第二种服务可选的M/G/1排队模型的适定性

运用Hille-Yosida定理,Phillips定理与Fattorini定理证明第二种服务可选的M/G/1排队模型存在唯一的概率瞬态解.     

Tandem Brownian queues

We analyze a two-node tandem queue with Brownian input. We first derive an explicit expression for the joint distribution function of the workloads of the first and second queue, which also allows us to calculate their exact large-buffer asymptotics. The nature of these asymptotics depends on the model parameters, i.e., there are different regimes. By using sample-path large-deviations (Schilder’s theorem) these regimes can be interpreted: we explicitly characterize the most likely way the buffers fill. This research has been funded by the Dutch BSIK/BRICKS (Basic Research in Informatics for Creating the Knowledge Society) project. M. Mandjes is also affiliated with the Korteweg-de Vries Institute, University of Amsterdam, The Netherlands, and EURANDOM, Eindhoven, The Netherlands.