Robust surgery loading

We consider the robust surgery loading problem for a hospital’s operating theatre department, which concerns assigning surgeries and sufficient planned slack to operating room days. The objective is to maximize capacity utilization and minimize the risk of overtime, and thus cancelled patients. This research was performed in collaboration with the Erasmus MC, a large academic hospital in the Netherlands, which has also provided historical data for the experiments. We propose various constructive heuristics and local search methods that use statistical information on surgery durations to exploit the portfolio effect, and thereby to minimize the required slack. We demonstrate that our approach frees a lot of operating room capacity, which may be used to perform additional surgeries. Furthermore, we show that by combining advanced optimization techniques with extensive historical statistical records on surgery durations can significantly improve the operating room department utilization.     

A Web-based ERP system for business services and supply chain management: Application to real-world process scheduling

A Web-based ERP system developed for attacking business problems and managing real-world business processes ranging from simple office automation procedures to complicated supply chain planning is presented. The system’s Web-aspect provides significant advantages, as the system is distributed through interoperable, cross-platform and highly pluggable Web-service components. The system involves a powerful workflow engine that manages the entire process event flow within the enterprise increasing efficiency and control at the same time. Business processes, when needed, are controlled by the enterprise quality management system and consequently the ISO directives are accurately followed. A real-world process scheduling system developed for the specific needs of Greek Construction Manufacturing Enterprises is illustrated as a detailed paradigm of the system’s capabilities. The problem was formulated to assign project tasks in form of lots to enterprise resources in order that resources idle time and delays in project preparation time were minimized. The problem was solved by a simple and effective heuristic algorithm.     

Power Control for Link Quality Protection in Cellular DS-CDMA Networks with Integrated (Packet and Circuit) Services

The problem of admission control in a DS-CDMA network carrying a heterogeneous mix of traffic is addressed. In an interference limited system such as DS-CDMA, admission of a new user impacts the performance of all other users, as well as the system capacity. The admission process is concerned with two factors: (1) maintaining the QoS of active users, (2) allocating bandwidth to new users. We propose a simple power control algorithm and prove that it is optimal in the sense of maintaining active link quality while maximizing free capacity for new admissions. The algorithm scales the powers of active links appropriately to achieve link protection and improved tolerance of the link to new interference from bursty sources. This algorithm can be used to overlay bursty packet data services without compromising QoS of active circuits.     

用于网格计算的复合代码生成技术研究

网格计算的研究越来越受到关注，但是网格开发的复杂性制约网格技术普遍使用。讨论了用于网格计算的复合代码生成技术。文中首先简要介绍了自行研制的网格计算快速开发工具GBuilder和代码生成技术，然后详细描述了GBuilder中复合代码生成的体系结构。     

一种支持分级服务和最小带宽保证的改进TCP算法

本文提出了一种支持分级服务和最小带宽保证的改进TCP算法－DSAS－TCP，通过对TCP算中慢启动阈值和最小拥塞窗口的分级设置来使不同等级连接的平均吞吐量产生分级，并保证用户的最小带宽需求。通过理论分析和仿真实验验证了该算法的有效性。     

A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks

Estimating point-to-point demands from partially available information, such as total demand volumes originating and terminating at nodes and traffic volumes routed on links, has significant applications in various areas, such as communications network planning and transportation planning. Existing methods include matrix and link scaling methods, statistical methods, more complex mathematical programming models, and forecasting using demographic data. We present a new mathematical programming model based on equitable resource allocation. The model considers multiple services, e.g., data, video, and voice, and generates a point-to-point demand matrix for each service. Originating and terminating demands for each service and link loads, aggregated over all services, are viewed as resources. Each point-to-point demand is associated with a performance function that measures its weighted, normalized deviation from a target defined by a service-dependent community of interest matrix. The model formulation has a lexicographic minimax objective function and multiple knapsack resource constraints. The model has an intuitively appealing interpretation and a specialized algorithm can generate demand matrices for large network problems very fast.     

综合业务局部区域网的发展

本文首先说明企业机关单位中数据LAN与电话PABX宜予合并,组成综合业务局部区域网(ISLAN);继而解释建立这种ISLAN应予周密考虑的问题;然后,作为例子,介绍英国电信研究实验室专为ISLAN创拟的Orwell协议,包括分隙环(slotted ring)和并联环(torus),以及它们每一结点和每一线路复接器的结构。这种ISLAN是以异步转移方式(ATM)为依据的,接口码速150-600Mb/s。最后简单表示分布控制ISLAN在大楼的装置应用。     

Efficiency and welfare implications of managed public sector hospital waiting lists

A queuing model for public health service waiting lists is developed, and the implications for patient welfare of different systems for managing the waiting list are analysed. If patients are admitted to hospital on a first-come-first-served basis, a welfare gain is achieved by moving from a system of implicit to one of explicit rationing of access to the waiting list. If individual waiting times and hospital admissions are dependent on clinical priority, a further welfare gain is achievable without the use of explicit rationing, by reallocating the total waiting time from the more towards the less seriously ill. On efficiency and welfare criteria, a maximum waiting time guarantee does not appear to be a desirable development.     

TD-SCDMA特色产品打造特色解决方案

2007年中国在多个城市铺设TD-SCDMA试验网.大唐移动完成了几个城市的网络建设.通过推出特色产品,大幅减低网络建设成本,提高网络性能.根据不同环境的实际要求分别为体育馆、高速移动、地铁、广域覆盖设计了特色解决方案.围绕2008奥运会的举办,TD-SCDMA网络将推出新型、差异化业务.     

Grid emulation for managing random sensor networks

A common assumption in sensor networks is that sensors are located according to a uniform random distribution. In this paper, we show that uniform random points on the two dimensional unit square are almost a “grid”. In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability.This suggests the following framework. In order to solve a problem on a random sensor network, we solve the same problem on a grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally, we provide some examples that illustrate our method.