海洋环境监测平行系统优化融合

多个海洋环境监测系统之间存在的功能冗余导致资源浪费和不必要的资金投入,因此应将各个系统优化融合成有机整体来节约海洋环境监测的资源和成本。将海洋环境监测系统按照功能划分为不同的模块,在线性规划融合的基础上引入熵方法,以成本和效能指标为主要对象,通过合理分配,在确保系统优化融合后监测能力不降低的同时,尽量减少建设成本。     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

Scheduling a maintenance activity on parallel identical machines

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

JPEG2000遥感图像实时压缩系统中基于并行机制的“零时间”数据搬移策略

为了满足JPEG2000遥感图像实时压缩设备的实时性要求,提出了一种基于并行机制的“零时间”数据搬移策略。通过对EBC算法结构进行拆分,并采用EDMA方式进行数据搬移,使得算法运算与数据搬移过程完全并行,搬移时间等效为零。实验结果表明,采用新的数据搬移策略后,编码效率可以提升到100％,EBC算法实现的总时间可缩短46％以上。该搬移机制已成功应用于JPEG2000星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。     

双二体几何切面法及天梯地月转移轨道分析

双二体模型是求解地月转移轨道的重要基础。与传统的采用月球影响球入口点经纬度的描述方式不同,本文提出一种基于飞行轨道面参数来描述地月转移轨道的双二体模型几何表达方式,结合一维非线性方程求根算法Brent算法和Lambert原理,将原始三维球面搜索算法降维成为二维圆上的搜索算法,可以高效求解地月转移轨道的形状参数。为避免重复计算,将转移轨道窗口计算的轨道多变量搜索问题解耦分解成两个子问题——转移轨道形状参数求解问题和转移轨道面空间定向问题,降低了问题的求解维度。形成两级并行计算算法,充分发挥多核计算机算力,加速计算过程。仿真结果表明,基于提出的并行圆锥曲线几何切面法,可以成功应用于计算天梯地月转移轨道分析。     

并行程序调试中的环境再现技术

为解决调试并行程序碰到的第一个困难:并行程序的不确定性,文中提出了环境再现技术。文中叙述了环境再现技术的思想和实现这一技术需要的数据结构,并用CCNPASCAL语言进行了描述,最后给出了一个典型的应用例子。     

一种模拟退火伪并行遗传算法

借鉴模拟退火算法的局部搜索能力,结合并行计算的思想设计了一种采用模拟退火机制的实数编码自适应交叉、全概率变异伪并行遗传算法,最后用这种方法对典型的多峰值函数求极值,并和基本遗传算法进行比较,结果表明:该算法具有较强的全局搜索能力和局部搜索能力,能够更有效地克服早熟收敛问题。     

Conceptual failure,the Taliban's parallel hierarchies,and America's strategic defeat in Afghanistan

ISAF exists to protect the Afghan constitutional model. This strategic objective will be defeated because the GIRoA model has a conceptual flaw that renders it incapable of delivering governance at the local level (Tier IV). This fatal flaw has enabled the Taliban, by developing parallel hierarchies, to displace GIRoA and establish itself in southern locales as the political authority. The Taliban are fighting a revolutionary war, a Maoist displacement strategy that uses guerrilla tactics to advance a political program. Petraeus and McChrystal failed to recognize the character of war, and believed the Taliban are pursuing an exhaustion strategy. They failed to devise a counter-RW strategy. The ‘Surge’ was doomed ab initio.     

基于准循环双对角阵的LDPC码编码算法研究*

针对校验矩阵形如准循环双对角阵的结构化LDPC码,对比研究了两类高效的编码算法：矩阵分解编码算法和分项累加递归编码算法,指出了两种算法从实现角度是等效的,但分项累加递归编码算法推导更为直观,且便于硬件并行实现。基于分项累加编码算法,提出了一种适合准循环双对角LDPC码的部分并行编码结构,设计实现了IEEE 802.11n标准中的LDPC码编码器。FPGA实现结果表明,所设计的LDPC编码器硬件开销较少,信息比特吞吐率最高能达到13Gbps。