Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems.     

Performance Evaluation of Packet Mobile Communications through Level Crossing Analysis

In this paper the performance of a packet mobile radio network is studied inthe presence of shadow fading outage intervals.Under quite general assumptions for the medium access protocol,the probability mass function of the sequence of packets that may be lostdue to an outage interval is derived. It is seen that long sequences of lostpackets are likely to occur for typical values of the mobile speed andshadowing correlation parameters.For delay constrained sources, e.g., voice, the analysis is mainly focused atderiving the probability function of the sequence of dropped packetsand the probability of dropping. For data sources, the delay statistic isalso derived. In the latter case, the effect of finite buffer length isaddressed. Simulation is used to verify the accuracy of approximations introduced in the analysis.     

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing

We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times.     

总延误问题顺时安排法的性能比

给定一组工件的加工时间与工期，要求确定这些工件在一台机器上的加．工排列，使相应的总延误达到最小，这就是总延误问题．该问题在近年已被证明是NP困难的．由Wilkermn和Irwin（1971），林勋（1983）等所研究的顺时安排法能得到相邻交换意义下的局部解．在本文中，我们进一步证明该算法能得到前移邻域意义下的局部解，并确定了该算法的性能比．     

The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

1　IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1～ 2 ] ,andtheotherisforthequalityofservice[3～6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo…     

核心通信网的光分组交换

文章首先简单说明了新一代通信网需要使用分级交换的由来。接着详细叙述了光分组交换在未来光通信网的应用，包括节点结构、分组格式、输入、输出接口和一些特别重要的技术，如再生、同步、信头处理、缓冲、空间交换和波长转换等。     

带到达时间的单机排序中的资源分配问题

讨论两个单机排序的资源分配问题1｜rj,pj=bj-ajuj,Cmax≤｜∑uj和1｜rj,prec,pj=bj-ajuj C max≤｜∑uj并给出求其最优资源分配的多项式算法.     

基于小波包分析及支持向量机的超音速目标识别方法研究

提出了基于小波包分析及支持向量机的超音速目标识别方法 .通过 5 .5 6mm ,7.6 2mm和 12 .7mm三种枪弹试验获取信号 ,用小波包分解激波信号 ,统计每个频带的能量特征 ,用支持向量机方法训练测试样本 ,获得了很好的分类效果 .仿真结果表明基于超音速飞行体产生的激波信号来识别目标是可行的 .     

因特网防御DoS攻击技术评述Ⅰ--攻击分类与特征·包过滤·攻击检测与防御

概述了因特网上DoS攻击的相应分类及基本特征，评述了包过滤、攻击检测及防御技术的最新成果．前一部分介绍了入口过滤、基于路由的过滤网和有效源地址强制协议．后一方面主要讨论了适合于检测攻击包的技术，介绍了新近提出的频谱分析方法和泛滥检测系统．简要评述了已有的防御SYN泛滥攻击的技术措施，介绍了Cisco的TCP拦截技术，提出了改进策略．     

CDMA2000 1xEV-DO中的分组调度算法

移动通信系统需要更好地支持分组数据业务，并满足高速分组数据业务的服务质置要求。这可以通过采用好的调度算法提高平均业务速率和系统整体稳定性实现。针对CDMA2000 1x EV-DO系统的有代表性的调度算法有3种：正比公平算法、速率受限的最大载干比算法、加权公平排队-正比公平（WFQ-PF）联合算法。正比公平调度算法是一种算法简单实用的调度方案，但不能满足用户的服务质景保证；速率受限的最大载干比算法具有比正比公平算法更高的平均吞吐量，可方便地在吞吐量和公平性之间获得很好的折衷；WFQ-PF联合算法具有良好的综合性能，但算法较复杂。