考虑占位决策的围堵嫌犯模型

研究了2011年中国大学生数学建模竞赛B题的突发事件中交巡警对在逃嫌犯的围堵问题。不同于对该问题的以往的研究,本文考虑了交巡警在包围圈中可以占据某些路口,使得嫌犯不能通过这些被交巡警占据的路口,从而为形成包围圈的交巡警赢得更多时间。利用两篇相关文献的关于点截集判断的结论和考虑占位决策的建模方法,以不同的目标函数建立了考虑占位决策的围堵嫌犯问题的三个混合0-1非线性整数规划模型。通过选取部分线性约束和目标函数一起组合成混合0-1线性整数规划模型,设计了基于混合0-1线性整数规划方法的算法,并给出了算例。     

基于排队的两类顾客易逝品库存控制策略研究

本文采用排队理论在面向两类顾客需求的环境下讨论易逝品库存排队系统控制策略问题。首先刻画面向两类顾客服务且具有马尔科夫结构的易逝品库存系统排队模型,获得库存水平状态的稳态概率分布以及作为库存成本控制的系统稳态性能指标。接下来,构建库存控制成本函数及考虑服务水平约束的库存控制优化模型,设计了改进的遗传算法。最后,数值算例揭示出系统参数的敏感性和相应的管理启示。     

A search method for optimal control of a flow shop system of traditional machines

We consider a convex and nondifferentiable optimization problem for deterministic flow shop systems in which the arrival times of the jobs are known and jobs are processed in the order they arrive. The decision variables are the service times that are to be set only once before processing the first job, and cannot be altered between processes. The cost objective is the sum of regular costs on job completion times and service costs inversely proportional to the controllable service times. A finite set of subproblems, which can be solved by trust-region methods, are defined and their solutions are related to the optimal solution of the optimization problem under consideration. Exploiting these relationships, we introduce a two-phase search method which converges in a finite number of iterations. A numerical study is held to demonstrate the solution performance of the search method compared to a subgradient method proposed in earlier work.     

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平台上,实现了初步的个性化图片推荐模型,取得了不错的效果.个性化服务推荐系统具有良好的发展和应用前景,能有效的保留客户,提高电子商务系统的服务能力,带来巨大的效益,具有一定的理论和现实意义.     

Regular F-Abundant Semigroups

ABSTRACT

The investigation of regular F-abundant semigroups is initiated. In fact, F-abundant semigroups are generalizations of regular cryptogroups in the class of abundant semigroups. After obtaining some properties of such semigroups, the construction theorem of the class of regular F-abundant semigroups is obtained. In addition, we also prove that a regular F-abundant semigroup is embeddable into a semidirect product of a regular band by a cancellative monoid. Our result is an analogue of that of Gomes and Gould on weakly ample semigroups, and also extends an earlier result of O'Carroll on F-inverse semigroups.