排队系统仿真输出数据的采集和分析

如何对计算机仿真运行后得到的信息进行采集和分析,已成为排队系统仿真研究中一个十分关键的问题.本文介绍了采集和分析输出数据的多种方法,并对其应用效果和应用范围进行了初步分析.

GSR无线节点仪器与数字化地震队系统的结合及生产应用

GSR无线节点采集仪器和数字化地震队系统在2013~2014年期间被应用在国外某勘探采集项目中。本文结合一个高密度三维项目和一个常规三维项目,介绍与GSR仪器+数字化地震队系统配套的采集技术、作业程序和质量控制方法,以及相关软件新增模块功能的完善。

利用智能化地震队系统实现物探测量的质量控制

文中在阐述智能化地震队系统定义的基础上,详细论述了智能化地震队Web端和手机端的基本功能。可视化的地震勘探生产信息的展示,能够帮助计算员快速、准确的掌握野外各个小组作业生产动态,从而能够更加直观和便捷地了解测量工作进展,在野外采集数据过程中的质量监控消息提示以及可在现场合理利用影像图进行点位偏移的全新的质量控制方式,能够助力现场决策,从而能够让测量适应高效率地震勘探采集的提质提效和流程再造的需求。

浅谈调查队系统内部会计控制现状及对策建议

内部会计控制制度是现代企业管理理论的重要组成部分。调查队系统各单位作为参照公务员管理的事业单位,虽然不是赢利单位,但建立和完善有效的内部会计控制体系也具有非常重要的现实意义。通过建立有效的内控制度,不仅可以规范单位的管理,促进各项工作的顺利开展,保护各类资产的安全性和完整性,对于防范财务风险、提高管理水平、严格财经纪律也有着极其重要的作用。目前调查队系统各单位的内部会计控制工作中仍然存在或多或少的问题,若不加以防范将会造成财务收支无法控制、会计信息失真等不良后果。文章从内部会计控制的特殊性着手,通过分析目前调查队系统内部会计控制的现状,提出具体的改进措施和对策建议。

数字化地震队系统在超高效混叠采集施工中的应用

超高效混叠采集技术(UHP)是国外某油公司提出的一项高效采集技术,为了实现该技术的工业化应用,对数字化地震队系统做了相应的升级。UHP技术不但要求可控震源遵循严格的时间距离规则,还对实施该技术的新一代数字化地震队系统提出了多群组、实时可控震源扫描质量监控、长距离可控震源作业管理,根据采集系统排列的状态指导可控震源扫描作业等要求。通过阐述超高效混叠采集技术的原理,介绍了新一代数字化地震队系统在超高效混叠采集技术的实施步骤,系统的分析了数字化地震队系统在超高效混采中成功应用的算法与功能。超高效混叠采集技术依靠新一代数字化地震队系统的应用载体,成为目前业内效率最高的可控震源采集施工技术。

基于环状加强架构的民航机队信息系统

针对B/S层状架构存在信息安全性差、某些数据和多媒体操作繁琐、传输大数据时对网络的带宽和稳定需求较高等缺点,提出了在信息管理中采用数据库→WWW服务器→浏览数据→下载第3方介质→介质上填写信息→介质处理服务器→数据库的环状加强架构作为B/S架构的改进,该架构具有安全性大为加强、数据填写简单易用、介质处理服务可以有更充沛的资源来对提交介质的信息进行深度的分析和处理,和在处理大数据对象上效率比较高等优点,介绍了该架构在民航机队信息系统建设中基于ASP+、Oracle、VisualBasic和Word的实现。实际工作表明,该架构具有广阔的应用推广前景。

网络游戏公会运营发展及公会管理成员角色特点研究——以FPS游戏《穿越火线》战队公会为例

以穿越火线战队系统及延伸出的YY语音公会组织为切入点,研究了网游公会运营发展及相关公会管理成员的角色特点。通常而言,该类网络社区通常具有“四低”及“四高”的特点,即从业门槛低、管理水平低、行骗难度低、违法成本低;入会随机性高、职权区分度高、投入产出比高、人员流动性高。虽然网游公会多以汇聚玩家并提升游戏乐趣为出发点,但即便如此也应时刻保持警惕,谨防网络诈骗行为。

高速公路收费站汽车排队问题的数学模型分析

建立了高速公路收费站汽车排队问题的两个数学模型,比较单队多服务台系统和多队多服务台系统评价指标的优劣。

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.

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.

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.

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.

A novel resource co-allocation model with constraints to budget and deadline in computational grid

To address the issue of resource co-allocation with constraints to budget and deadline in grid environments, a novel co-allocation model based on virtual resource agent was proposed. The model optimized resources deployment and price scheme through a three-side co-allocation mechanism, and applied queuing system to model the work of grid resources for providing quantitative deadline guarantees for grid applications. The validity and solutions of the model were presented theoretically. Extensive simulations were conducted to examine the effectiveness and the performance of the model by comparing with other co-allocation policies in terms of deadline violation rate, resource benefit and resource utilization. Experimental results show that compared with the three typical co-allocation policies, the proposed model can reduce the deadline violation rate to about 3.5% for the grid applications with constraints to budget and deadline. Also, the system benefits can be increased by about 30% compared with the those widely-used co-allocation policies.

Advanced User-Based Interaction Model in Cloud

With the increasing popularity of cloud computing, there is an increased de mand for cloud resources in cloud. It has be come even more urgent to find solutions to improve resource utilization. From the per spective of a cloud consumer, a cloud applica tion processes a large information flow in volving user actions that access resources, but little work has so far been devoted to research from the perspective of the interaction be tween the user and the cloud application. In this paper, we analyze the interaction in detail, and propose a general mathematical interac tion model to formulate the challenge pertain ing to storage resource allocation as an opti mization problem, focusing on minimizing both the user＇s cost and server＇s consumption. A potential response mechanism is then de signed based on the interaction model. Fur thermore, the proposed model is used to ex plore strategies when multiple users access the same file simultaneously. Additionally, an improved queuing system, namely M/ G~ oo queue with standby, is introduced. Finally, an evaluation is presented to verify the interac- tion model.

Application of generalized predictive control in networked control system

A new framework for networked control system based on Generalized Predictive Control (GPC) is proposed in this paper. Clock-driven sensors, event-driven controller, and clock-driven actuators are required in this framework. A queuing strategy is proposed to overcome the network induced delay. Without redesigning, the proposed framework enables the existing GPC controller to be used in a network environment. It also does not require clock synchronization and is only slightly affected by bad network condition such as package loss. Various experiments are designed over the real network to test the proposed approach, which verify that the proposed approach can stabilize the Networked Control System (NCS) and is robust.

Multi-agent Coordinated Control and Collision Avoidance with Unknown Disturbances

The formation problem of multi-agent systems via coordinated control is investigated,where the multiple agents can achieve the common velocity with leader and avoid collision during the evolution.In the real-world situation,the communication is often disturbed and inaccurate.Hence,the unknown disturbances are considered in the velocity measurements,which is assumed to be bounded and does not need to be modelled.Moreover,a complicated nonlinear interaction among agents is presented in the design of control.Based on the existing work of multi-agent systems,a flocking control protocol is proposed to address the formation problem in the dynamic topology.The stability analysis is given to prove that the velocities of all agents can converge to the velocity of leader and the stable motion with collision avoidance can be achieved eventually.Finally,some simulations are presented to verify the effectiveness of the proposed algorithm.

Coordinated scheduling model for intermodal transit hubs based on GI/M^K/1 queuing system

Coordinated scheduling of multimode plays a pivotal role in the rapid gathering and dissipating of passengers in transport hubs. Based on the survey data, the whole-day reaching time distribution at transfer points of passengers from the dominant mode to the connecting mode was achieved. A GI/M K/1 bulk service queuing system was constituted by putting the passengers' reaching time distribution as the input and the connecting mode as the service institution. Through queuing theory, the relationship between average queuing length under steady-state and headway of the connecting mode was achieved. By putting the minimum total cost of system as optimization objective, the headway as decision variable, a coordinated scheduling model of multimode in intermodal transit hubs was established. At last, a dynamic scheduling strategy was generated to cope with the unexpected changes of the dominant mode. The instance analysis indicates that this model can significantly reduce passengers' queuing time by approximately 17% with no apparently increase in departure frequency, which provides a useful solution for the coordinated scheduling of different transport modes in hubs.

Eagle-Vision-Based Object Detection Method for UAV Formation in Hazy Weather

Inspired by eagle’s visual system,an eagle-vision-based object detection method for unmanned aerial vehicle(UAV)formation in hazy weather is proposed in this paper.To restore the hazy image,the values of atmospheric light and transmission are estimated on the basis of the signal processing mechanism of ON and OFF channels in eagle’s retina.Local features of the dehazed image are calculated according to the color antagonism mechanism and contrast sensitivity function of eagle’s visual system.A center-surround operation is performed to simulate the response of reception field.The final saliency map is generated by the Random Forest algorithm.Experimental results verify that the proposed method is capable to detect UAVs in hazy image and has superior performance over traditional methods.

Admission control with long-range dependence traffic input

The admission control scheme is investigated for a FIFO self-similar queuing system with Quality of Service (QoS) performance guarantees. Since the self-similar queuing system performance analysis is often carried out under the condition of infinite buffer, it is difficult to deduce the upper boundary of buffer overflow probability. To overcome this shortcoming, a simple overflow condition is proposed, which defines a buffer overflow occurrence whenever the arrival rate exceeds the service rate. The analytic formula for the buffer overflow probability upper boundary is easily obtained under this condition. The required bandwidth upper boundary with long-range dependence input and determined overflow probability is then derived from this formula. Based on the above analytic formulas, the upper boundaries of the admission control regions for homogeneous and heterogeneous long-range dependence traffic sources are separately obtained. Finally, an effective admission control scheme for long-range dependence input is proposed. Simulation studies with real traffic have confirmed the validity of these results.

Unemployment Period Approach with Infinite Servers Queue Systems

With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.