QUEUEING NETWORKS WITH STRING TRANSITIONS OF MIXED VECTOR ADDITIONS AND VECTOR REMOVALS

1 IntroductionProduct form queueing networks have regained considerable interest over the last coupleof years. In particular, extensions beyOnd the wellknown JaCkson, BCMP and KellyWhittletyPe networks (e.g., I1--5]) have been establlshed. Extensions include networks with batchmovements (such as [6--10]), networks with negative customers and signalling ([11--17l, amongothers), and assemblytransfer networks ([18, 19]). Transitions ill product form netWOrs nowgeneral1y include multiPle sta…     

具有阻塞影响的柔性制造系统排队网络模型

用有限容量局部库区的开排队网络模拟柔性制造系统，模型中，机床加工工件的时间服从指数分布，运送台车按照静态Ｍａｒｋｏｖ方式运送工件且运送时间服从指数分布，被阻塞的工件按照ＢＡＲ机理被处理，静态Ｍａｒｋｏｖ工件运送方式中的概率值受工件被阻塞的影响。     

Stability of Kumar-Seidman Networks Under Longest Queue First Policy

This paper is concerned with the stability of multiclass queueing networks of 2 stations and4 buffers under the longest queue first served discipline(LQFS).For this network,the service priority of a customer is determined by the length of the queue that customer resides in at that time.The main result includes two parts.Firstly,the corresponding fluid model is established,and then it is shown that the queueing networks under LQFS are stable whenever the traffic intensity is strictly less than one for each station.     

The M/M/1 queue with working vacations and vacation interruptions

In this paper, we study the M/M/1 queue with working vacations and vacation interruptions. The working vacation is introduced recently, during which the server can still provide service on the original ongoing work at a lower rate. Meanwhile, we introduce a new policy：, the server can come back from the vacation to the normal working level once some indices of the system, such as the number of customers, achieve a certain value in the vacation period. The server may come back from the vacation without completing the vacation. Such policy is called vacation interruption. We connect the above mentioned two policies and assume that if there are customers in the system after a service completion during the vacation period, the server will come back to the normal working level. In terms of the quasi birth and death process and matrix-geometric solution method, we obtain the distributions and the stochastic decomposition structures for the number of customers and the waiting time and provide some indices of systems.     

An M/M/1 Queueing-Inventory System with Geometric Batch Demands and Lost Sales

This paper studies an M/M/1 queueing-inventory system with batch demands. Customers arrive in the system according to a compound Poisson process, where the size of the batch demands for each arrival is a random variable that follows a geometric distribution. The inventory is replenished according to the standard (s,S) policy. The replenishment time follows an exponential distribution. Two models are considered. In the first model, if the on-hand inventory is less than the size of the batch demands of an arrived customer, the customer takes away all the items in the inventory, and a part of the customer’s batch demands is lost. In the second model, if the on-hand inventory is less than the size of the batch demands of an arrived customer, the customer leaves without taking any item from the inventory, and all of the customer’s batch demands are lost. For these two models, the authors derive the stationary conditions of the system. Then, the authors derive the stationary distributions of the product-form of the joint queue length and the on-hand inventory process. Besides this, the authors obtain some important performance measures and the average cost functions by using these stationary distributions. The results are illustrated by numerical examples.     

Analysis of discrete-time queues with batch renewal input and multiple vacations

This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed.Service and vacation times are mutually independent and geometrically distributed.The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch.The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system.Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival,arbitrary and outside observer’s observation epochs for partial-batch rejection policy.The blocking probability of the first-,an arbitrary-and the last-job in a batch have been discussed.The analysis of actual waiting-time distributions measured in slots of the first-,an arbitrary- and the last-job in an accepted batch,and other performance measures along with some numerical results have also been investigated.     

Construction of continuous time Markovian arrival processes

Markovian arrival processes were introduced by Neuts in 1979 (Neuts 1979) and have been used extensively in the stochastic modeling of queueing, inventory, reliability, risk, and telecommunications systems. In this paper, we introduce a constructive approach to define continuous time Markovian arrival processes. The construction is based on Poisson processes, and is simple and intuitive. Such a construction makes it easy to interpret the parameters of Markovian arrival processes. The construction also makes it possible to establish rigorously basic equations, such as Kolmogorov differential equations, for Markovian arrival processes, using only elementary properties of exponential distributions and Poisson processes. In addition, the approach can be used to construct continuous time Markov chains with a finite number of states     

供应链建模与优化

首先介绍了供应链的概念及研究内容 ;接着对供应链优化模型进行总结 ,包括排队论、对策论、网络流和策略评价模型 ,并重点讨论了一些典型的混合整数规划 ( Mixed Integer Programming,MIP)模型 ;在此基础上 ,对供应链优化模型框架进行分析 ,并讨论了供应链模型应该考虑的目标和约束等因素 ;最后 ,在对现有的研究工作进行分析的基础上 ,提出了今后进一步研究的方向 .     

多版本编程技术在故障识别中的应用与仿真

通过分析网络性能数据来发现和识别故障是网络故障管理的重要手段之一，本文研究并提出了一种基于神经网络的故障识别方案，通过分析网络性能的数字特征来识别大型网络中的故障，为了提高系统的识别率，引入了软件工程中多版本编程技术，并行训练多组神经网络，由多数决投票机制合成为一个系统，同时定义了神经网络之间的错误关联系数概念，依据计算机仿真的结果，选取错误负相关的神经网络所组成的系统，对测试集能够达到100％的识别率。     

BBS虚拟社区的演化规律探索及仿真

结合复杂网络理论对BBS中虚拟社区网络的演化规律进行了研究.首先,通过BBS版块的数据信息构建有向虚拟社区网络,研究了网络拓扑结构特性的演化,包括新增结点数和边数、度分布的幂指数、网络结构熵等随时间变化的规律,发现网络从"有序"到"无序"再到"稳定有序"的变化过程,并且在此类社区网络中存在富人俱乐部现象.然后,基于BBS版块虚拟社区的演化规律,提出了一种虚拟社区网络构造模型.该模型方法的仿真结果与真实虚拟社区网络演化特性相符,在一定程度上能解释虚拟社区的演化规律,具有很强的实际意义.     

SINGLE SERVER QUEUES WITH A BATCH MARKOVIAN ARRIVAL PROCESS AND BULK RENEWAL OR NON-RENEWAL SERVICE

We first consider an infinite-buffer single server queue where arrivals occur according to a batch Markovian arrival process(BMAP).The server serves customers in batches of maximum size 'b' with a minimum threshold size 'a'.The service time of each batch follows general distribution independent of each other as well as the arrival process.The proposed analysis is based on the use of matrix-analytic procedure to obtain queue-length distribution at a post-departure epoch.Next we obtain queue-length distributions at various other epochs such as,pre-arrival,arbitrary and pre-service using relations with post-departure epoch.Later we also obtain the system-length distributions at post-departure and arbitrary epochs using queue-length distribution at post-departure epoch.Some important performance measures,like mean queue-lengths and mean waiting times have been obtained.Total expected cost function per unit time is also derived to determine the locally optimal values of a and b.Secondly,we perform similar analysis for the corresponding infinite-buffer single server queue where arrivals occur according to a BMAP and service process in this case follows a non-renewal one,namely,Markovian service process(MSP).     

二分网络社团结构的比较性定义

为了解决二分网络的聚类问题,借鉴单顶点网络社团结构的比较性定义,提出了直接基于原始二分网络社团结构的比较性定义,这个定义允许社团之间存在重叠,并定义了在二分网络中顶点与社团之间的作用力.在不引进额外参数的情况下,设计了基于此定义的二分网络的聚类算法,并将此算法应用于人工网和一些实际网络中,结果表明这个算法可以比较准确地对网络进行聚类,说明该定义是有效的.     

Vertical handoff algorithm in heterogeneous networks to maximize system benefit

A new vertical handoff decision algorithm is proposed to maximize the system benefit in heterogeneous wireless networks which comprise cellular networks and wireless local area networks (WLANs). Firstly the block probability, the drop probability and the number of users in the heterogeneous networks are calculated in the channel-guard call admission method, and a function of the system benefit which is based on the new call arrival rate and the handoff call arrival rate is proposed. Then the optimal radius of WLAN is obtained by using simulation annealing (SA) method to maximize the benefit. All the nodes should handoff from cellular network to WLAN if they enter WLAN’s scope and handoff fromWLAN to cellular network if they leave the scope. Finally, the algorithm in different new call arrival rates and handoff call arrival rates is analyzed and results show that it can achieve good effects.     

LOT SIZING WITH NON-ZERO SETUP TIMES FOR REWORK

In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product the machine is setup for the rework of the defectives of the same product and then the rework process starts. We assume that the setup time for the normal production process as well as the rework process is non-zero. Further we consider the waiting time cost of defectives for rework. This paper has two objectives. The first objective is to obtain the economic batch quantity （EBQ） for a single product. The second objective is to extend the result of the first objective to the multi-product case. Adopting the common cycle scheduling policy we obtain optimal batch sizes for each product such that the total cost of the system per unit time is minimized.     

武器装备体系的异质超网络模型

超网络理论是复杂网络理论最新进展,其与体系问题有着天然的契合性。基于超网络理论提出了武器装备体系的一种网络化概念模型,可以对体系中的多种动、静态因素进行有效地描述。将体系映射为物理网、关系网和交互网,给出了物理网的定义,并以流的形式定义了交互网,定性分析了不同网络间的关系,介绍了模型实例化方法和基于模型的分析方法,最后以举例的方式进行说明。     

The Dynamics of Two-State Public Opinion Propagation On Signed Networks

The formation of public opinion on the network is a hot issue in the field of complex network research, and some classical dynamic models are used to solve this problem. The signed network is a particular form of the complex network, which can adequately describe the amicable and hostile relationships in complex real-world systems. However, the methods for studying the dynamic process of public opinion propagation on signed networks still require to be further discussed. In this paper, the authors pay attention to the influence of negative edges in order to design a two-state public opinion propagation mechanism suitable for signed networks. The authors first set the interaction rules between nodes and the transition rules of node states and then apply the model to synthetic and real-world signed networks. The simulation results show that there is a critical value of the negative edge ratio.When the negative edge ratio exceeds this critical value, the evolutionary result of public opinion will change from a consistent state to a split state. This conclusion is also consistent with the distribution result of opinions within communities in the signed network. Besides, the research on the network structural balance shows that the model makes the network evolve in a more balanced direction.     

非线性系统辨识的一种泛函网络方法

泛函网络是最近提出的一种对神经网络的有效推广.与神经网络不同,它处理的是一般的泛函模型,而不仅仅是Sigmoidal函数,并且在各个处理单元之间没有权值.提出了一种基于泛函网络的非线性系统的辨识方法,而网络参数利用梯度下降方法来进行学习.计算机仿真结果表明,这种辨识方法具有较快的收敛速度和良好的性能.     

集装箱码头集卡配置优化的闭合排队网络模型

以集装箱码头同贝同步装卸作业为研究对象,以提高码头作业效率、提升服务能力为目标,研究码头内部集卡数量配置优化问题.将码头作业系统视为服务网络,构建码头同贝同步装卸作业的闭合排队网络模型,刻画集卡在各个环节的作业过程,分析不同设备配置下码头作业系统服务能力,揭示制约码头整体作业效率关键环节.以码头作业成本最小为目标,考虑集卡在各个环节的排队等待时间及设备利用率,建立了基于同贝同步装卸作业的集卡数量优化模型,并设计算法对模型进行求解.本研究从服务网络角度揭示了码头作业效率与岸桥、集卡、场桥配置的关系,为码头设备调度与服务流程设计提供了依据.     

批处理化工生产过程的CIMS方案应用设计

CIMS的开发设计是当前的主要研究课题之一。本文针对某农药生产企业进行了CIMS的开发工作,着重处理了某批处理生产过程的排产问题,整个CIMS使该厂产、供、销融为一体,在实际应用中取得了良好的效果。     

自聚集、吸引核与聚集量

研究复杂系统的自聚集演化过程和聚集量.文中给出两个类似生长网络的模型.第一个模型比较简单,每一时间步长只有一条新边进入网中,但概括面较广,例如可描写选举、科学论文引用、食物源对蚁群蜂群的吸引、某种商品或股票、堤坝渗漏处,等等.第二个模型比较一般,每次可有m条新边进入网络.文中引用BA网络模型给出的“优先连接”的概念,研究上面两个网络中各点的聚集量.结果表明：对于这两个模型,各点可能的聚集量均可用一个数学期望的简单公式描述,即Et^s=ks/t0t .其中,s表示网中某点,t0是初始时间,ks是t0时点s的顶点度,t是任何时间,t也是此时网的总度数,或总聚集量.ks/t0表征点s的初始优势或初始吸引能力,点可称为吸引核,ks/t0可称为吸引系数.文中解释了对于不同情况下 Et^s=k/t0t的意义.