Comparison of two randomized policy M/G/1 queues with second optional service, server breakdown and startup

The problem addressed in this paper is to compare the minimum cost of the two randomized control policies in the M/G/1 queueing system with an unreliable server, a second optional service, and general startup times. All arrived customers demand the first required service, and only some of the arrived customers demand a second optional service. The server needs a startup time before providing the first required service until the system becomes empty. After all customers are served in the queue, the server immediately takes a vacation and the system operates the (T, p)-policy or (p, N)-policy. For those two policies, the expected cost functions are established to determine the joint optimal threshold values of (T, p) and (p, N), respectively. In addition, we obtain the explicit closed form of the joint optimal solutions for those two policies. Based on the minimal cost, we show that the optimal (p, N)-policy indeed outperforms the optimal (T, p)-policy. Numerical examples are also presented for illustrative purposes.     

Discrete-time queues with discretionary priorities

In this paper, we consider a discrete-time two-class discretionary priority queueing model with generally distributed service times and per slot i.i.d. structured inputs in which preemptions are allowed only when the elapsed service time of a lower-class customer being served does not exceed a certain threshold. As the preemption mode of the discretionary priority discipline, we consider the Preemptive Resume, Preemptive Repeat Different, and Preemptive Repeat Identical modes. We derive the Probability Generating Functions (PGFs) and first moments of queue lengths of each class in this model for all the three preemption modes in a unified manner. The obtained results include all the previous works on discrete-time priority queueing models with general service times and structured inputs as their special cases. A numerical example shows that, using the discretionary priority discipline, we can more subtly adjust the system performances than is possible using either the pure non-preemptive or the preemptive priority disciplines.     

Factors shaping mathematics lecturers’ service teaching in different departments

In this article we focus on university lecturers’ approaches to the service teaching and factors that influence their approaches. We present data obtained from the interviews with 19 mathematics and three physics lecturers along with the observations of two mathematics lecturers’ calculus courses. The findings show that lecturers’ approaches to teaching the same topic vary across departments; that is, they consciously privilege different aspects of mathematics, set different questions on examinations and follow different textbooks while teaching in different departments. We discuss factors influencing lecturers’ decision of what (mathematics) to teach in different departments and offer educational implications for service mathematics teaching in terms of students’ mathematical needs and the role of mathematics for client students.     

移动云计算中基于LBS的个性化服务推荐模型

随着智能手机的普及和3G技术的发展,信息呈指数式增长,从海量的信息中提取出用户感兴趣的内容已成为电子商务发展的一个重要趋势,然而传统的推荐策略已不能满足用户的需求.为此,基于移动云计算和位置信息,提出了一个个性化服务推荐模型解决方案,该方案综合了社交网络和时效性,建立了用户兴趣模型库.基于这个解决方案,在Android平台上,实现了初步的个性化图片推荐模型,取得了不错的效果.个性化服务推荐系统具有良好的发展和应用前景,能有效的保留客户,提高电子商务系统的服务能力,带来巨大的效益,具有一定的理论和现实意义.     

Large Deviations of Queues Sharing a Randomly Time-Varying Server

We consider a discrete-time model where multiple queues, each with its own exogenous arrival process, are served by a server whose capacity varies randomly and asynchronously with respect to different queues. This model is primarily motivated by the problem of efficient scheduling of transmissions of multiple data flows sharing a wireless channel. We address the following problem of controlling large deviations of the queues: find a scheduling rule, which is optimal in the sense of maximizing

An M/G/1 system with startup server and J additional options for service

We consider an M^[x]/G/1 queueing system with a startup time, where all arriving customers demand first the essential service and some of them may further demand one of other optional services: Type 1, Type 2, … , and Type J service. The service times of the essential service and of the Type i  (i=1,2,…,J)$(i=1\text{,}2\text{,}\dots \text{,}J)$ service are assumed to be random variables with arbitrary distributions. The server is turned off each time when the system is empty. As soon as a customer or a batch of customers arrives, the server immediately performs a startup which is needed before starting each busy period. We derive the steady-state results, including system size distribution at a random epoch and at a departure epoch, the distributions of idle and busy periods, and waiting time distribution in the queue. Some special cases are also presented.     

Implementation of a quality management system in meteorological practice in Serbia

An optional approach in the meteorological service Quality Management System (QMS) based on the case study of the Republic Hydrometeorological Service (MHS) of Serbia is presented and discussed in this paper. The idea is to use the ISO/IEC 17025 standard as a base for its QMS development. Main reasons for such a decision and the elements of the implemented solution are presented and discussed. Meteorological testing processes of the MHS of Serbia and relevant ISO/IEC 17025 scope of accreditation are presented. After establishing competencies in meteorological, environmental, and hydrological testing, the MHS of Serbia will develop an integrative ISO 9001 QMS. The Serbian case study could be taken into consideration as one of the options related to the future World Meteorological Organization Quality Management Framework.