Grid resource management policies for load-balancing and energy-saving by vacation queuing theory

The resource management is the central component of grid system. The analysis of the workload log file of LCG including the job arrival and the resource utilization daily cycle shows that the idle sites in the Grid are the source of load imbalance and energy waste. Here we focus on these two issues: balancing the workload by transferring jobs to idle sites at prime time to minimize the response time and maximize the resource utilization; power management by switch the idle sites to sleeping mode at non-prime time to minimize the energy consume. We form the M/G/1 queue model with server vacations, startup and closedown to analysis the performance metrics to instruct the design of load-balancing and energy-saving policies. We provide our Adaptive Receiver Initiated (ARI) load-balancing strategy and power-management policy for energy-saving. The simulation experiments prove the accuracy of our analysis and the comparisons results indicate our policies are largely suitable for large-scale heterogeneous grid environment.     

A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem

The Prize-collecting Steiner Tree Problem (PCSTP) is a well-known problem in graph theory and combinatorial optimization. It has been successfully applied to solve real problems such as fiber-optic and gas distribution networks design. In this work, we concentrate on its application in biology to perform a functional analysis of genes. It is common to analyze large networks in genomics to infer a hidden knowledge. Due to the NP-hard characteristics of the PCSTP, it is computationally costly, if possible, to achieve exact solutions for such huge instances. Therefore, there is a need for fast and efficient matheuristic algorithms to explore and understand the concealed information in huge biological graphs. In this study, we propose a matheuristic method based on clustering algorithm. The main target of the method is to scale up the applicability of the currently available exact methods to large graph instances, without loosing too much on solution quality. The proposed matheuristic method is composed of a preprocessing procedures, a heuristic clustering algorithm and an exact solver for the PCSTP, applied on sub-graphs. We examine the performance of the proposed method on real-world benchmark instances from biology, and compare its results with those of the exact solver alone, without the heuristic clustering. We obtain solutions in shorter execution time and with negligible optimality gaps. This enables analyzing very large biological networks with the currently available exact solvers.     

Analysis of the M/G/1 queue with discriminatory random order service policy

We consider an M/G/1 queue with different classes of customers and discriminatory random order service (DROS) discipline. The DROS discipline generalizes the random order service (ROS) discipline: when the server selects a customer to serve, all customers waiting in the system have the same selection probability under ROS discipline, whereas customers belonging to different classes may have different selection probabilities under DROS discipline. For the M/G/1 queue with DROS discipline, we derive equations for the joint queue length distributions and for the waiting time distributions of each class. We also obtain the moments of the queue lengths and the waiting time of each class. Numerical results are given to illustrate our results.     

Spatial queueing for analysis, design and dimensioning of Picocell networks with mobile users

In this work, we characterize the performance of Picocell networks in the presence of moving users. We model various traffic types between base-stations and mobiles as different types of queues. We derive explicit expressions for expected waiting time, service time and drop/block probabilities for both fixed as well as random velocity of mobiles. We obtain (approximate) closed form expressions for optimal cell size when the velocity variations of the mobiles is small for both non-elastic as well as elastic traffic. We conclude from the study that, if the expected call duration is long enough, the optimal cell size depends mainly on the velocity profile of the mobiles, its mean and variance. It is independent of the traffic type or duration of the calls. Further, for any fixed power of transmission, there exists a maximum velocity beyond which successful communication is not possible. This maximum possible velocity increases with the power of transmission. Also, for any given power, the optimal cell size increases when either the mean or the variance of the mobile velocity increases.     

基于M340 PLC的余热锅炉控制系统

M340 PLC是施耐德公司推出的面向中端客户的自动化解决方案。在灵活强大的Unity软件配合下,使M340 PLC更能提供满意的自动控制任务。同时,通过以太网和CANopen总线、Modbus总线技术,其能够与Magelis触摸屏、VijeoCitect管理软件配合使用。在研究余热锅炉原理的基础上,设计了一套基于M340 PLC的余热锅炉自动控制系统,这套系统能够很好地完成余热锅炉自动控制任务。     

ATM网络流量控制中的一种信元丢弃机制

ATM论坛将基于速率的流量控制选定为ABR业务的流量控制方法。通过对基于速率的流量控制和基于凭证的流量控制方法的研究,提出了一种信元丢弃流量控制原则,该模型继承了基于凭证方法的记数机制,通过设定高低缓存门限和调节速率升降因数来控制源端速率,仿真结果表明,这种控制机制不仅能够保证缓存的充分利用,而且能够提高其在减少信元丢失等方面的性能。     

行政区划管理信息系统的设计与实现

对行政区划管理信息系统的研制目的、系统功能、软硬件选型、网络结构以及一些具体技术问题进行了论述。     

AVS-M解码在Symbian平台上的实现

AVS-M是<先进音视频编码>系列标准AVS的第七部分,是无线网络与手机等移动设备视频编解码的规范和标准,高效快速的编解码器对AVS-M标准能否得到推广和应用有着极其重要的作用.介绍了AVS-M标准参考代码移植到Symbim平台的方法和要解决的问题,并针对Symbian手机平台对AVS-M标准参考代码给出几种优化方法,实现了AVS-M在NOKIA 6670上解码QCIF格式达到15帧/秒,基本上能够实现在Symbian平台的流畅播放,对推广AVS-M有很大的帮助.     

现代远程教育之网络技术研究与探讨

现代远程教育是近年来国际教育发展的重要趋势。介绍了我国现代远程教育状况,就现代远程教育的解决方案中的网络技术进行了深入地研究和讨论。     

Use of Graduate Study in Psychology as a data source.

Comments on an article by C. M. Stoup and L. T. Benjamin, Jr. (see record 1983-24200-001), in which they used various editions of Graduate Study in Psychology, published by the American Psychological Association (APA), to report the GPAs and Graduate Record Examination scores of master's and doctoral students across various areas of psychology. It is cautioned that the use of Graduate Study in Psychology as a data source calls for skepticism, as there is sufficient reason to question some of the data that are submitted to the APA by psychology departments. (3 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)