排队

小动物们放学了，大象老师让小动物们排好队，跟着它一起。过马路。小朋友，请你根据图例中的提香。从下面的图中找出小动物们排队的正确图片。

排队

深秋的风从浦江吹来了萧瑟，我们。在世博临近尾声的时候来到了上海。同行6人，我们夫妇外，还有恒波、林权、小郭和小陈。

运用《排队论》对控制门诊拥挤现象的探讨

《排除论》是研究拥挤现象的一门科学。目前看病拥挤现象在城市某些医院或医院的某些科室仍不同程度地存在着，有的甚至还比较突出。医院工作必须以医疗和患者为中心，确保医疗质量。门诊是医院对外服务的窗口，是诊治患者的重要场所。倘若门诊量过大，单位时间内就诊密度过高，超过了医院正常服务的能力，势必成为影响诊疗质量的因素。固此如何对医院门诊进行科学管理，最大限度发挥现有医疗潜力，控制排队系统，维护正常秩序。

Effects of pooling,specialization,and discretionary task completion on queueing performance

Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.

Effect of quality uncertainty of parts on performance of reprocessing system in remanufacturing environment

Aimed at the problem of stochastic routings for reprocessing operations and highly variable processing times,an open queuing network is utilized to model a typical reprocessing system.In the model,each server is subject to breakdown and has a finite buffer capacity,while repair times,breakdown times and service time follow an exponential distribution.Based on the decomposition principle and the expansion methodology,an approximation analytical algorithm is proposed to calculate the mean reprocessing time,the throughput of each server and other parameters of the processing system.Then an approach to determining the quality of disassembled parts is suggested,on the basis of which the effect of parts quality on the performance of the reprocessing system is investigated.Numerical examples show that there is a negative correlation between quality of parts and their mean reprocessing time.Furthermore,marginal reprocessing time of the parts decrease with the drop in their quality.

The MAP/PH(PH/PH)/1 Discrete-time Queuing System with Repairable Server

In this paper, we discuss a discrete time repairable queuing system with Markovian arrival process, where lifetime of server, service time and repair time of server are all discrete phase type random variables. Using the theory of matrix geometric solution, we give the steady state distribution of queue length and waiting time. In addition, the stable availability of the system is also provided.

Travel time function for basic link considering signal control in network traffic model

In order to describe the travel time of signalcontrolled roads, a travel time model for urban basic roads based on the cumulative curve is proposed. First, the traffic wave method is used to analyze the formation and dispersion of the vehicle queue. Cumulative curves for road entrances and exits are established. Based on the cumulative curves, the travel time of the one-lane road under stable flow input is derived. And then, the multi-lane road is decomposed into a series of single-lane links based on its topological characteristics. Hence, the travel time function for the basic road is obtained. The travel time is a function of road length, flow and control parameters. Numerical analyses show that the travel time depends on the supply-demand condition, and it has high sensitivity during peak hours.

Optimal gateway deployment under different queuing mechanisms in smart grid

By optimizing the network topology, this paper proposes a newmethod of queuing theory clustering algorithm based on dynamic programming in a home energy management system（ HEMS）. First, the total cost of the HEMS system is divided into two parts, the gateway installation cost and the data transmission cost. Secondly, through comparing two kinds of different queuing theories, the cost problem of the HEMS is converted into the problem of gateway deployment. Finally, a machine-to-machine（ M2M） gateway configuration scheme is designed to minimize the cost of the system. Simulation results showthat the cost of the HEMS system mainly comes from the installation cost of the gateways when the gateway buffer space is large enough. If the gateway buffer space is limited, the proposed queue algorithm can effectively achieve optimal gateway setting while maintaining the minimal cost of the HEMS at desired levels through marginal analyses and the properties of cost minimization.

On approximating multifractal traffic burstiness with Markov modulated Poisson processes

We investigate the approximating capability of Markov modulated Poisson processes (MMPP) for modeling multifractal Internet traffic. The choice of MMPP is motivated by its ability to capture the variability and correlation in moderate time scales while being analytically tractable. Important statistics of traffic burstiness are described and a customized moment-based fitting procedure of MMPP to traffic traces is presented. Our methodology of doing this is to examine whether the MMPP can be used to predict the performance of a queue to which MMPP sample paths and measured traffic traces are fed for comparison respectively, in addition to the goodness-of-fit test of MMPP. Numerical results and simulations show that the fitted MMPP can approximate multifractal traffic quite well, i.e. accurately predict the queueing performance.

ANALYSIS ON A TYPE OF SERVICING MACHINES MODEL WITH REPAIRABLE SERVICE STATION

This paper deals with a type of servicing machines model, which service station has a life time of the kth Er-langian distribution and can be repaired just like a new one. The cyclic time and the inefficiency quantities of this system in equilibrium are obtained.

笑话六则

加时赛代数老师对一学生家长抱怨道：＂你看看你儿子是怎么学数学的,90减去45等于下半场!＂父亲道：＂嗯,我回去是得好好教导他了,他竟然没考虑到加时赛的情况。＂

A Precise Information Extraction Algorithm for Lane Lines

Lane line detection is a fundamental step in applications like autonomous driving and intelligent traffic monitoring. Emerging applications today have higher requirements for accurate lane detection. In this paper, we present a precise information extraction algorithm for lane lines. Specifically, with Gaussian Mixture Model(GMM), we solved the issue of lane line occlusion in multi-lane scenes. Then, Progressive Probabilistic Hough Transform(PPHT) was used for line segments detection. After K-Means clustering for line segments classification, we solved the problem of extracting precise information that includes left and right edges as well as endpoints of each lane line based on geometric characteristics. Finally, we fitted these solid and dashed lane lines respectively. Experimental results indicate that the proposed method performs better than the other methods in both single-lane and multi-lane scenarios.

An analytical method to calculate station evacuation capacity

The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.

Fork-Join program response time on multiprocessors with exchangeable join

The Fork-Join program consisting of K parallel tasks is a useful model for a large number of computing applications. When the parallel processor has multi-channels, later tasks may finish execution earlier than their earlier tasks and may join with tasks from other programs. This phenomenon is called exchangeable join (EJ), which introduces correlation to the task’s service time. In this work, we investigate the response time of multiprocessor systems with EJ with a new approach. We analyze two aspects of this kind of systems: exchangeable join (EJ) and the capacity constraint (CC). We prove that the system response time can be effectively reduced by EJ, while the reduced amount is constrained by the capacity of the multiprocessor. An upper bound model is constructed based on this analysis and a quick estimation algorithm is proposed. The approximation formula is verified by extensive simulation results, which show that the relative error of approximation is less than 5%.

Bottleneck Analysis for Data Acquisition in High-Speed Network Traffic Monitoring

The increasing network throughput challenges the current network traffic monitor systems to have compatible high-performance data processing.The design of packet processing systems is guided by the requirements of high packet processing throughput.In this paper,we depict an in-depth research on the related techniques and an implementation of a high-performance data acquisition mechanism.Through the bottleneck analysis with the aid of queuing network model,several performance optimising methods,such as service rate increasing,queue removing and model simplification,are integrated.The experiment results indicate that this approach is capable of reducing the CPU utilization ratio while improving the efficiency of data acquisition in high-speed networks.

Appointment scheduling with customer impatience based on operating cost model

An appointment scheduling problem is studied with the consideration of customer impatience.On the assumption that both the time of leaving queue and the time of service are exponentially distributed,in order to minimize the joint cost,the optimal appointment schedule of the fixed number of customers is studied.The joint cost function is composed of customers expected delay time and service availability time.The expected delay time of each customer in the queue is recursively computed in terms of customer interarrival time.Furthermore,the effect of impatience on the optimal schedule as well as the total operating cost is studied.The results show that as the impatience rate increases,the optimal interarrival time becomes shorter and the interarrival time of the last few customers gradually approaches that of the customers in the middle.In addition,impatient behaviors can increase the joint cost.

Using multi-class queuing network to solve performance models of e-business sites

Due to e-business' s variety of customers with different navigational patterns and demands, multiclass queuing network is a natural performance model for it. The open multi-class queuing network(QN) models are based on the assumption that no service center is saturated as a result of the combined loads of all the classes. Several formulas are used to calculate performance measures, including throughput, residence time, queue length, response time and the average number of requests. The solution technique of closed multi-class QN models is an approximate mean value analysis algorithm (MVA) based on three key equations, because the exact algorithm needs huge time and space requirement. As mixed multi-class QN models, include some open and some closed classes, the open classes should be eliminated to create a closed multi-class QN so that the closed model algorithm can be applied. Some corresponding examples are given to show how to apply the algorithms mentioned in this article. These examples indicate that multi-class QN is a reasonably accurate model of e-business and can be solved efficiently.