Research on Fault Tolerant Scheduling Algorithms of Web Cluster Based on Probability

Aiming at the soft real time fault tolerant demand of critical web applications at present, such as E-commerce, a new fault tolerant scheduling algorithm based on probability is proposed. ““““““““Ib achieve fault tolerant scheduling, the primary/slave backup technology is applied on the basis of task‘s self similar accessing characteristics, when the primary task completed successfully, the resources allocated for the slave task are reclaimed, thus advancing system‘s efficiency. Experimental results demonstrate on the premise of satisfying system‘s certain fault tolerant probability, task‘s schedulabilistic probability is improved, especially, the higher task‘s self similar degree is, the more obviously the utilization of system resources is enhanced.     

Mlgebraic Attack on Filter-Combiner Model Keystream Generators

Algebraic attack was applied to attack Filter-Combiner model keystream generators. We proposed thetechnique of function composition to improve the model, and the improved model can resist the algebraic attack. A new criterion for designing Filter-Combiner model was also proposed: the total length L of Linear Finite State Machines used in the model should be large enough and the degree d of Filter-Combiner function should be approximate [L/2].     

Dispatch Liquidity Theory in a Deregulated Environment

Power system security and reliability are more complex issues in a deregulated environment.Various criteria have been considered for power system reliability. In the day-ahead market, a successful trade schedule should be able to accept various disturbances with sufficient flexibility to be adjusted during the re-dispatch process. This paper describes the dispatch liquidity theory and some liquidity indices. The liquidity indices evaluate the effective operating reserves with the network constraints taken into consideration. A model is presented to calculate the liquidity index. An extended trade scheduling model with minimum liquidity index constraints is presented that considers the distribution requirements of the operating reserves. The liquidity indices could also be used to coordinate the security and reliability between multistage markets and for contingency selection. The algorithms were tested with real power system data. The results show that the dispatch liquidity theory is reasonable and the algorithms are effective.     

TTCAN协议的分析与展望

TTCAN是一种基于CAN总线充分利用时间触发与事件触发两种机制优点的新型协议，其具有带宽利用率高、通讯延时低以及消息传输可管理等特点，对于分布式硬实时系统的应用以及解决网络控制系统中消息延时具有重大的意义．本文旨在对TTCAN协议进行详细分析，并指出了进一步研究的方向和发展前景．     

基于IEEE802．11e MAC的联合无线资源管理

联合无线资源管理（JRRM）是针对耦舍多种无线接入技术的异构网络进行无线资源管理的一种新型机制，其目的是基于重配置技术和业务分流来整体优化异构网络的资源利用率。这种资源管理机制对其管理的各个接入网提出了QoS保证机制的要求。IEEE 802．11e的提出为WLAN提供了MAC层的QoS保证机制，从而促使IRRM能够高效工作。对基于IEEE 802．11e MAC的JRRM进行介绍，并分析了在联合会话允许控制和联合资源调度方面，基于IEEE802．11e MAC的方式能够改善异构无线环境中的网络性能。     

中国的民族政策与族群认同的几个问题——与于鹏杰同志商榷

于鹏杰同志的《族群认同的现代含义:以湖南城步苗族为例》认为中国政府的民族政策使得许多民族自愿或不自愿的采用了汉族的生活方式,并导致了新时代文化认同与族群认同的困惑。如此评价,实有误解乃至歪曲中国政府民族政策的嫌疑。新时代族群认同的困惑不是由于中国政府的民族政策造成的,而是在于“族群”概念的不确定性和民族、族群认同表现的多样性。     

基于演化多目标算法的混合流水作业调度优化

针对供应链网络优化领域中的混合流水作业调度问题提出了一种新的多目标演化优化算法。给出了这类问题的通用优化模型，在此基础上，提出了基于流程的矩阵基因编码方案，动态适应度分配机制，并引入小生境保优策略构造了算法过程，利用收敛进程参数分析了算法的收敛性能。性能分析和算例实验表明算法对于高维多目标优化问题是有效的，且能够以较快的速度收敛。     

分组的端到端延时上限

研究了分组交换网络中分组的端到端延时上限。证明了在节点处理速率恒定的情况下，一个流的最大分组在除首节点外的任意节点都不会遭遇队列延时，根据此结论得到了该流任意分组的端到端延时上限。将该结果推广到实际网络中，得到了当多个流共享同一条传输路径时任意流任意分组的端到端延时上限。模拟实验结果验证了理论推导公式的正确性。     

奥运通勤线路公交调度问题研究

奥运通勤线路上的人员调度问题可以归结为公交人员调度问题,解决公交人员调度通常采用"生成与选择"模式,此种模式具有的局限性使之不能满足解决奥运特色通勤线路上人员调度的要求.针对多条运营线路的奥运特色通勤线路人员调度问题,给出了奥运特色通勤线路人员调度问题的改进模型,模型的目标是在满足工作时间、就餐时间、换班要求等相关约束的条件下使人员完成任务的间隔时间最小.本文对已有蚁群算法解决车辆路径优化问题的算法进行了改进.对算法中相应的转移规则和轨迹更新规则进行了重新设定,改进了算法转移策略和信息素更新策略.给出了算法的实现步骤.通过仿真,对模型的正确性进行了验证.证明了改进蚁群算法解决奥运特色通勤线路人员调度问题的高效性和较强的适用性.     

基于遗传和禁忌搜索算法求解双资源车间调度问题

针对柔性生产环境下的车间调度问题,在考虑遗传算法早熟收敛特性和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传算法和禁忌搜索算法的双资源作业车间的调度优化问题算法,即不仅考虑到了每个工件有几条可行的工艺路线,而且考虑到了工件的调度受到机床、工人等资源制约的影响,并用实例对该算法进行了仿真研究.结果表明此算法有很好的收敛精度,是可行的,与传统的调度算法相比较,体现出其明显的优越性.