传统文化视野下的“水泊梁山”及其局限性分析

意识形态的混乱与吏治败坏是造成中国传统社会失范的两大因素。古典小说《水浒传》艺术地呈现了北宋末年社会存在的失范状况,同时,它又根据中国传统文化所提供的小康社会的信息,在梁山上建立起一个乌托邦性质的小社会。但是,由于传统文化特别是"忠义"道德观念的局限性,好汉们进行的秩序重建是不完善的,它从根源上无法解决导致社会失范的因素。     

Invariance of stationary probabilities of states for network of multiserver queues

A queueing network consisting of multiserver nodes with different sources of customers is considered. We investigate stationary probability distributions of network states. Their invariance with respect to the functional form of distributions of input and service processes is established under fixed expectations of these distributions and service discipline when any entering customer has a preemptive resume discipline.     

网络品牌忠诚驱动因素分类研究

将网络品牌分为传统品牌的网络延伸和网络新品牌两种形式,通过分析网络品牌忠诚的动态形成过程,构建了网络品牌忠诚驱动要素研究模型。实证研究发现,网络品牌的符号因素、属性因素、精神因素、价值观因素、传播因素、体验因素都与网络品牌忠诚正相关,但两类网络品牌忠诚的关键驱动因素存在差别。体验因素、价值观因素和属性因素是网络新品牌忠诚的关键驱动因素,而属性因素、体验因素和传播因素对网络化的传统品牌忠诚度有重要影响。     

Tail asymptotics for service systems with transfers of customers in an alternating environment

This study examines service systems with transfers of customers in an alternating environment. We model the service system as a two-server two-parallel queue (primary and auxiliary queues), that has various applications especially in manufacturing and healthcare systems. We establish a sufficient stability condition, and based on the censoring technique, we provide sufficient conditions under which the stationary distribution possesses an exactly geometric tail along the direction of the queue length in the primary queue.     

具有负顾客的GI/M/1休假排队模型

在Neuts提出的“矩阵几何解”的基础上,针对GI／M／1排队模型中可能出现的干扰因素,提出了研究具有负顾客的GI／M／1休假排队这一模型．其中服务规则为先到先服务,休假策略为空竭服务多重休假,负顾客一对一地抵消队尾的正顾客(若有),由矩阵几何解方法成功求得了稳态队长分布的概率母函数的表达式,并对所得结果进行了推广．     

实施顾客满意营销的理论探讨

顾客满意营销是当今尚未被企业所普遍接受的一种新型营销理念和营销方式,企业由看重市场占有率指标转向看重顾客满意度指标,通过一系列有效的手段和方法,向顾客提供具有附加价值的产品和服务,并在有限的资源配置下专注于最有价值的顾客,从而赢得竞争优势。     

带负顾客和休假中止的Geo/Geo/1工作休假排队模型

将负顾客和休假中止策略引入离散时间休假排队.工作休假中当一个服务完成时有顾客等待则发生休假中止.负顾客作为一种干扰信号,文中规定其只在忙期中到达,负顾客不接受服务,一对一抵消队首正在接受服务的正顾客.利用拟生灭过程和矩阵几何解方法,得到了系统队长的稳态分布,也得到了稳态队长的条件随机分解结构.     

Equilibrium queueing strategies of two types of customers in a two-server queue

We consider a single queue with two identical servers and two types of customers. The high-type customer is more delay-sensitive but brings less workload to the system than the low-type customer. We obtain the equilibrium queueing strategy for each type of customers.     

����˿͹����Ŷ�ϵͳ����Ϣ����

The discriminatory processor sharing queues with multiple classes of customers (abbreviated as DPS queues) are an important but difficult research direction in queueing theory, and it has many important practical applications in the fields of, such as, computer networks, manufacturing systems, transportation networks, and so forth. Recently, researchers have carried out some key work for the DPS queues. They gave the generating function of the steady-state joint queue lengths, which leads to the first two moments of the steady-state joint queue lengths. However, using the generating function to provide explicit expressions for the steady-state joint queue lengths has been a difficult and challenging problem for many years. Based on this, this paper applies the maximum entropy principle in the information theory to providing an approximate expression with high precision, and this approximate expression can have the same first three moments as those of its exact expression. On the other hand, this paper gives efficiently numerical computation by means of this approximate expression, and analyzes how the key variables of this approximate expression depend on the original parameters of this queueing system in terms of some numerical experiments. Therefore, this approximate expression has important theoretical significance to promote practical applications of the DPS queues. At the same time, not only do the methodology and results given in this paper provide a new line in the study of DPS queues, but they also provide the theoretical basis and technical support for how to apply the information theory to the study of queueing systems, queueing networks and more generally, stochastic models.     

On an M (X)/G/1 Retrial System with Two Types of Search of Customers from the Orbit

Single server retrial queueing models in which customers arrive according to a batch Poisson process are considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit (the orbital customers) try to reach the server subsequently with the inter-retrial times exponentially distributed. Additionally, at each service completion epoch, two different search mechanisms, that is, type I and type II search, to bring the orbital customers by the system to service, are switched on. Thus, when the server is idle, a competition takes place among primary customers, customers who come by retrial and by two types of searches. The type I search selects a single customer whereas the type II search considers a batch of customers from the orbit. Depending on the maximum size of the batch being considered for service by a type II search, two cases are addressed here. In the first case, no restriction on batch size is assumed, whereas in the second case, maximum size of the batch is restricted to a pre-assigned value. We call the resulting models as model 1 and model 2 respectively. In all service modes other than type II search, only a single customer is qualified for service. Service times of the four types of customers, namely, primary, repeated, and those who come by two types of searches are arbitrarily distributed (with different distributions which are independent of each other). Steady state analysis is performed and stability conditions are established. A control problem for model 2 is considered and numerical illustrations are provided.