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     

基于本体的战场环境信息规范化目录服务研究

目录服务是面向服务架构的战场环境保障系统的重要功能,其根本目的是使分布、海量战场环境信息形成面向任务的数据集,供作战人员使用.为了规范战场环境信息目录服务并实现智能查询功能,将OGC-CSW规范和本体引入战场环境信息目录服务的设计中,建立了战场环境信息目录服务框架,并重点对面向任务的元数据信息模型、任务本体模型以及语义查询机制等关键技术进行了深入研究.最后通过实验对文中方法进行了验证.     

纤维缠绕复合材料约束球形浮力芯材准静态压缩吸能机制

针对海洋工程平台的防护吸能和浮力储备需求,设计一种纤维缠绕复合材料约束球形浮力芯材吸能结构。为分析其变形损伤特征和能量耗散机理,通过ABAQUS有限元软件和万能材料试验机开展数值模拟分析和试验验证研究。通过力学响应特征和损伤破坏模式分析可知,结构吸能设计的关键在于表层和芯材的泊松比匹配。芯材主要通过塑性压缩损伤和剪切断裂破坏吸收能量,而表层吸能则主要通过环向的花瓣形拉伸断裂破坏。研究表明,该型结构单元压缩吸能特性优异,可实现海洋工程结构平台的防护吸能和浮力储备要求。     

空间非合作目标捕获方法综述

随着空间事故和失效航天器的增多,地球附近的轨道资源越来越紧张。如今世界各国都在大力发展在轨服务和太空碎片清除,作为其中最关键的技术之一,空间非合作目标捕获近年来成了太空研究领域的重点。目前,国内外各大研究机构针对非合作目标进行了深入研究,并提出了多种捕获方法,取得了较大的进展。对非合作目标进行分类,基于现有的捕获方法介绍了国内外非合作目标捕获技术发展的最新状况,总结了原理方案,分析了捕获方法和关键技术,为我国后续开展相关研究提供了一种研究思路。     

基于内外子区域划分的高阶精度CFD程序异构并行算法

对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法,结合结构化网格下有限差分计算和四阶龙格库塔方法的特点,引入ghost网格点区域,设计了一种ghost区域收缩计算策略,显著降低了异构计算资源之间的数据传输开销,负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠,提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数,分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)＋加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍,较MPI/OpenMP两级并行算法使用24个纯CPU核的性能,该算法使用单加速器时加速1.27倍,使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。     

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

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

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 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星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。