Approximation Algorithms in Batch Processing

A polynomial approximation scheme for minimizing makespan in a batch processing system under dynamic job arrivals is presented. A lower bound of on the competitive ratio of any on-line algorithm is proved. This is matched by an on-line algorithm for the special case of unbounded machine capacity.     

Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time

This paper considers the on-line problem of scheduling nonpreemptively n independent jobs on m > 1 identical and parallel machines with the objective to maximize the minimum machine completion time. It is assumed that the values of the processing times are unknown but the order of the jobs by their processing times is known in advance. We are asked to decide the assignment of all the jobs to some machines at time zero by utilizing only ordinal data rather than the actual magnitudes of jobs. Algorithms to slove the problem are called ordinal algorithms. In this paper, we give lower bounds and ordinal algorithms. We first propose an algorithm MIN which is at most -competitive for any m machine case, while the lower bound is _i=1 ^m 1/i. Both are on the order of (ln m). Furthermore, for m = 3, we present an optimal algorithm.     

政府公共危机管理失灵:内在机理与消解路径——基于风险社会视域

频发的公共危机让人类步入了风险社会。公共危机的治理显然无法通过危机衍生系统的自适应来化解。政府作为危机管理的核心主体毋庸置疑,特别是对采取政府主导性发展战略并取得举世瞩目成就的中国而言,其功能性地位更为凸显。然而,现行的基于常态公共事务管理的政府管理理念、管理体制和管理方式,制约了政府公共危机管理的绩效,甚至形成政府公共危机管理的低效或失灵的路径依赖。这集中表现为,基于传统人治理念治理风险社会的公共危机,使政府进退失据;基于现行官僚体制治理风险社会的公共危机,形成有组织的不负责任局面;基于垄断式管理模式治理风险社会的公共危机,使政府力不从心。鉴于此,更新危机管理理念,重塑官僚体制,引入协作治理体系,就成为化解政府公共危机管理失灵的基本路径。     

构建高校网络舆情引导立体体系

文章通过研究高校共青团舆情引导现状与现行青年舆情需求的冲突,提出高校共青团应占领网络阵地,通过完善门户网站、依托热门论坛开辟团情舆情版块与打造网络舆情团支部等途径丰富高校共青团网络舆情引导载体。     

不同消解法对污泥中总磷测定的影响

试验了三种消解法处理污泥样品,用钼锑抗分光光度法测定总磷的含量。结果表明：用灰化法处理样品测得污泥中总磷的含量较低,而其它二种湿化消解法处理样品得到的结果相近。     

网络营销的成功之道

网络营销的成功之道;在于要提供个性化的顾客服务,并重视顾客的长期价值;在于充分发挥网络互动性优势,开展互动式营销;在于要遵循网络礼仪,不接受未经请求的资料信息、实行软营销;还在于要利用网络虚拟化特征,以降低营销成本。     

Preemptive Machine Covering on Parallel Machines

This paper investigates the preemptive parallel machine scheduling to maximize the minimum machine completion time. We first show the off-line version can be solved in O(mn) time for general m-uniform-machine case. Then we study the on-line version. We show that any randomized on-line algorithm must have a competitive ratio m for m-uniform-machine case and ∑_{i = 1}^m1/i for m-identical-machine case. Lastly, we focus on two-uniform-machine case. We present an on-line deterministic algorithm whose competitive ratio matches the lower bound of the on-line problem for every machine speed ratio s≥ 1. We further consider the case that idle time is allowed to be introduced in the procedure of assigning jobs and the objective becomes to maximize the continuous period of time (starting from time zero) when both machines are busy. We present an on-line deterministic algorithm whose competitive ratio matches the lower bound of the problem for every s≥ 1. We show that randomization does not help.     

基于Web和数据仓库的企业决策支持系统研究

本文针对目前企业决策支持系统面临的问题,提出了Intranet环境下,以数据仓库为中心的企业DSS的总体结构与设计。探讨了基于Web和数据仓库的DSS方法与技术,结合实例介绍了系统的设计与开发过程。     

论网络游戏的德性价值及其德育实践——基于文化育德的视角

网络游戏作为一种文化实践活动,其主题元素、设计环节和题材背景、线下交互等形成了特殊的大众文化,蕴含着丰富的德性价值,具有重要的隐性德育功能。网络游戏的快速发展,已成为信息时代和大众传媒时代开展大众德育不可或缺的重要阵地,其教育示范与情感体验功能为游戏育德提供了可能。通过开展网络游戏德育实践应积极发掘网络游戏的价值主题,加强网络游戏监管以充分发挥网络游戏的正面德育作用,并通过组建队伍引导网络游戏者参与德育实践,为各方主体参与网络游戏育德搭建平台并提供服务,实现网络游戏育德的实践探索。     

漫谈网络广告

网络广告从1994年到现在已经发展了十余年,走过了它的初级阶段,已经迎来了其发展的快速成长期。文章从网络广告与传统媒体的优势比较、网络广告的形式、网络广告发展的不足与趋势等诸多方面来论述网络广告的发展空间,对网络广告目前的状态和未来发展的方向进行了梳理,旨在更广泛地推荐网络广告这一新兴传播媒介,以引起业界更多的人来关注和支持网络广告的发展。