基于排队论的病床安排流程重组模型分析

基于住院部当前的情况用排队论的医疗工作流程重组来建立安排病床的模型,先对数据进行合理处理,用MATLAB统计题目所提供的病人,并作出该统计结果的散点图。再根据病人到达近似服从泊松分布和初始统计条件列出状态方程,求解每天病人在系统内等候服务的队长L以及不同病人每天到达的概率Pn（t）。     

基于排队论的病床安排模型的研究

通过建立基于排队论的病床安排模型,得到系统运营指标如各类病人的平均队长及平均逗留时间。对病床安排模型进行评价。进而根据所有病人的住院时间长短的规律,将病床分为短期、中期、长期三类,构造优化病床分配模型,提高了病床利用率．并用实例进行验证．     

基于排队论的维修工具配置模型研究

将排队论引入装备维修工具配置过程,建立了维修工具排队系统的模型,提出了专用类维修工具和通用类维修工具的配置模型.通过实例进行分析,得出定量的分析比较结果,为维修工具的合理配置提供了理论依据.从定量的角度分析了维修工具的保障度问题,从而进一步提高装备维修工具的保障效率.     

基于排队论Oracle系统性能优化模型研究

响应时间是衡量Oracle数据库系统性能的重要指标。本文基于多服务台排队模型对Oracle数据库进行系统分析和性能优化设计,讨论了应用程序响应时间,处理器个数可变情况下,如何准确预测Oracle性能并进行调整,提高Oracle系统的服务性能和经济性能。     

消息中间件的排队论模型研究

1 引言分布式和跨平台用户需求的增加,使得中间件(middle-ware)技术应运而生。中间件是位于上层应用和下层服务之间,提供更简单可靠和增值服务的通用服务。中间件技术是IT界研究的热点之一。中间件一般可以分为事务处理中间件、分布式面向对象中间件和消息中间件。当应用程序需要在不同的网络硬件平台、不同的操作系统乃至不同的网络协议上通信时,适合选用消息中间件(MOM),因为此时应用程序     

基于排队论的交通堵塞问题的模型选择

针对道路堵塞问题,建立了依赖状态的排队论与交通波模型.通过对数据的采集和处理,并分别运用排队论和交通波模型求出交通堵塞时车辆的排队长度,通过比较可以知道,运用排队论模型得出的车辆排队长度更符合实际情况,可以作为实际交通堵塞问题参考.     

基于排队论模型的网络拥塞率研究

分析了目前拥塞控制存在的问题,以排队论模型为基础对网络拥塞率进行了研究,从一个路由器的角度出发研究网络拥塞问题,提出了基本模型,给出了求解瞬时拥塞率的算法,并得到了稳态拥塞率的解析表达式.通过数值结果指出,路由器缓存的适当增加可以降低拥塞率,但过渡增加反而会增加拥塞率;增加路由器的CPU处理速度可以降低拥塞率.     

网络分组交换中的排队论模型分析

排队论模型在计算机网络通信系统中具有广泛应用,如评价网络性能,设计计算机网络等。作者通过对M/M/l和M/D/1模型的深入分析,得出了M/G/1模型中的最佳排队系统模型。     

网络分组交换中的排队论模型分析

排队论模型在计算机网络通信系统中具有广泛应用,如评价网络性能,设计计算机网络等.作者通过对M/M/1和M/D/1模型的深入分析,得出了M/G/1模型中的最佳排队系统模型.     

基于排队论的医院体检管理系统研究

体检排队系统作为体检人员接受服务的第一个环节,是体检人员评价体检中心服务满意度的一个重要方面,利用排队论的知识对体检系统建立数学模型进行分析优化,使系统达到最佳的运营状态,具有一定的经济价值和实际意义。     

排队理论在车道收费系统中的应用研究

以排队理论为基础,研究了车道收费系统的排队模型及系统性能指标的评价方法,给出长青收费站在正常收费及繁忙时的性能参数;结合项目实例,给出了收费车道数的设计方法,并给出了车道数与设计小时交通辆(DHV)的变化曲线;最后对以社会总费用为目标的车道数进行了优化设计。     

Adversarial Queueing Model for Continuous Network Dynamics

In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuous aqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. This work was partially supported by eu IST-2004-15964 (aeolus), by the Spanish Ministry of Education and Science under cicyt tin2005-09198 (asce) and cicyt tin2005-25859-E, by the Regional Government of Madrid under contract No. 07T/0022/2003, and by the Universidad Rey Juan Carlos under project No. PPR-2004-42. Also partially supported by the Universidad de Chile (Mecesup fellowship and Anillo en Redes). A preliminary version of this work was presented in the 30th International Symposium on Mathematical Foundations of Computer Science (mfcs), Gdansk, Poland, LNCS, vol. 3618, pp. 144–155, Springer.     

A Queueing Model for the Design and Analysis of a Mining Stockyard

In this paper we model the operation of a mining stockyard by an \erk queue. We describe the stockpile configuration of the stockyard by a set of discrete parameters, taking values in the set of positive integers, which define the queueing system. Our goal is to optimise both the throughput and a penalised throughput of this queueing system, by selecting the optimal number and size of the stockpiles within the stockyard. This is accomplished by the development of several tools, including a local search algorithm that exploits the specific nature and constraints of the system.     

基于排队网络的流水线模拟器任务缓存新分析模型

流水线软件模拟器是嵌入式微处理器软件仿真系统的关键技术,提出对嵌入式微处理器流水线仿真系统的排队网络建模与缓存大小分析方法.对SPARC-V8流水线模拟器建立M/M/1/N型排队网络模型,分析指令到达及服务阻塞机制.为了解决模型计算中的阻塞问题,在排队网络模型中增加“保持节点”,得到扩展的等价排队网络模型.采用近似计算迭代算法,得到系统性能评价指标,并建立排队网络节点性能关系曲线,确定各功能模块的任务缓存大小.根据得出的任务缓存计算值设置流水线软件模拟器实际缓存大小,实验表明模型计算数据与实际运行数据基本一致.该评价方法对嵌入式微处理器流水线仿真系统的建模与性能分析具有重要的指导意义.     

可修排队系统Mx/G (M/H)1的瞬态解

本文研究一个典型的批到达可修排队系统＾ｘ／（／）１．记号（／）表服务台寿命服从指数分布，而其修理时间为一连续型分布。利用向量马氏过程方法，我们得到了它的瞬态解。特别是发现了服务台的可靠性指标仅依赖于可修排队系统的空闲概率，或等价地仅依赖于它的忙期和忙循环。     

可修排队系统GI/G(M/G)/1的可靠性分析

利用更新过程理论和向量马氏过程方法全面考察了可修排队系统GI/G(M/G)/1的结构,得到了所有感兴趣的指标,并证明了服务台的可靠性指标只与系统的忙期、闲期和忙期循环时间有关.     

基于两级对准模型的运载火箭自动转载

固体运载火箭作为我国航天运输系统的重要组成部分, 具有整箭贮存运输、快速发射响应等特点, 在军民商发射领域受到广泛青睐. 针对车载起重设备在自动化转载运载火箭中面临的执行机构变形所导致的对准误差问题, 本文提出了基于两级对准模型的运载火箭自动转载方法, 以解决常规转载方法无法应对的机构变形误差闭环检测缺陷, 通过蒙特卡洛仿真对所提方法进行了验证. 结果表明: 相比于常规转载方法, 所提方法的一次转载成功率约为96%, 解决了重载大变形下自动转载对准精度问题, 转载精度良好, 可以保证车箭精确对接.     

基于DSP技术的贮运发射箱监测系统设计

文章设计了基于DSP技术、传感器技术、微型存储技术和小波分析等技术的贮运发射箱监测系统,该系统既可实时记录发射箱在转运、发射过程中所承受的应力、压力、振动等参数,又能对发射箱内温度、湿度等环境参数进行实时监测,文章提出了该系统的硬件和软件设计方案,并对微型化数据采集、存储等关键技术进行了详细的论述。     

基于测发一体化技术的导弹发射控制系统设计

传统导弹发控系统检测功能单一,缺乏定量分析能力和故障诊断手段;采用测试发控一体化技术,利用虚拟仪器软件就是仪器的优点,在传统射检发控功能的基础上集成了动态检测功能和快速故障诊断功能;阐述了系统设计的基本方法和实现过程,包括设计思想、总体方案、信号适配电路设计、软件计数算法和动态测试技术的实现等内容;实践表明,该系统有效提升了导弹发控系统的技术水平和层次,为导弹发射成功提供了可靠保障。     

Calibration of a Queueing Model of RAID Systems

A recent queueing-based modelling methodology of RAID systems compared the mean disk access times of the two most common variants, RAID0-1 and RAID5, as well as a multi-RAID system in which they coexist. Accesses to multiple disks occur concurrently for each logical (user) request and complete only when every disk involved has completed. The models therefore needed to estimate the mean value of the maximum of the individual disk response times, each of which is modelled by the waiting time of an M/G/1 queue. This mean-max value was approximated in terms of the second moment of queueing time which in turn required the third moment of disk service time, itself a function of seek time, rotational latency and block transfer time. To achieve consistently good agreement with an event-driven simulator of the physical hardware and system software requires careful calibration of the resulting model's parameters and validation of its assumptions. This calibration and validation process involves detailed analysis of sub-models to reveal the restrictions necessary on the domain of real-world operating parameters that facilitate a viable predictive model. The process yields significant insight into several of the abstract subsystems involved that may be utilised in a range of practical modelling studies; for example, the effect of approximating a bank of parallel queues with synchronised arrivals by a bank of identical, independent queues. The final comparison against the hardware simulator shows excellent agreement, far surpassing that of the original model.