装备研发与制造一体化物资供应支持系统研究

首先分析了研发与制造一体化技术是适应武器装备柔性化制造需求的先进制造技术,然后介绍了装备研发与制造一体化技术的涵义和体系结构,分为以研发为中心的研发与制造一体化技术和以制造为中心的研发与制造一体化技术。最后详细研究了其中的物资供应支持系统及其体系结构。     

基于MDA的HLA系统开发流程与框架设计

HLA作为IEEE认定的分布式仿真标准,随着在军事、民用等仿真领域的广泛运用,其自身的模型重用性、互操作性等不强的弱点逐渐暴露出来,越来越不能满足大型复杂仿真系统的需要。将MDA方法引入HLA仿真系统设计中,尝试用MDA的模型思想对HLA系统进行开发,提升HLA的模型重用性和互操作性。对MDA在HLA系统中各种模型的设计和表述方式进行了分析研究,提出了一个基于MDA开发HLA仿真系统的开发流程,建立了一个基本开发框架,从软件开发的角度提高了系统的开发效率。     

自然元素在建筑设计中的创意与表达——石材

石材,在建筑发展的历史上一直扮演着重要角色,不但为人类提供遮风避雨的场所,还以其多变的魅力活跃在当今建筑文化的舞台上.建筑师通过各种充满创意的设计表达手法,赋予建筑更多的品质和意义.从石材在建筑上应用的起源入手,分析石材在景观和建筑设计中的表现手法,并结合大量的实例总结了石材的创意设计方法.     

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     

基于反射内存网的多飞行模拟器时间同步

飞行模拟器是一个复杂的分布式实时仿真系统,而多个飞行模拟器的联网则要求高精度的同步、更高的实时性.首先对单台飞行模拟器的网络结构、同步机制进行了描述,然后介绍了反射内存网的工作原理,并利用反射内存网作为同步信号的传输链路,对多飞行模拟器组网的同步进行了研究,同时对反射内存网和以太网结构并存的特点进行了分析.     

基于内外子区域划分的高阶精度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星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。