I.I.D.并行分布式检测网相同门限假定的合理性条件

并行分布式检测网最优设计是复杂难解的,相同门限假定使Ｉ．Ｉ．Ｄ．网的设计极度简化,并在实际工程中广泛使用。本文研究了相同门限假定的合理性条件,为合理采用习惯性处理方法提供了理论依据。     

The parallel replacement problem with demand and capital budgeting constraints

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000     

低复杂度非规则LDPC码的构造方法

较高的编码复杂度成为非规则LDPC码应用的一个难点。文章从实际应用的角度出发,针对中长码提出了两种低复杂度的非规则LDPC码的构造方法:改进的B IBD和ALDPC,大大降低了编码复杂度。仿真结果表明,构造出的码字比传统的PEG构造方法有一定的性能改善。最后,从非规则码的EX IT图出发,分析了两种构造码子性能的差异。     

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     

光学阵列器件的慢刀伺服车削加工技术

慢刀伺服技术是相对于快刀伺服提出的方法.采用C轴、X轴、Z轴联动的方法在极坐标或圆柱坐标内进行加工.光学阵列如微透镜阵列、微反射镜阵列在高速数据、声音和视频信号传输中具有重要作用.将光学阵列看作一个自由曲面,使用慢刀伺服车削技术一次加工成形,可以解决传统加工中将光学阵列分块加工后拼装和调整的困难.但是由于光学阵列表面形状复杂,其表面法线的突变可能会使机床运动超出伺服轴执行能力.根据慢刀伺服加工技术的特点,建立了伺服轴执行能力限制曲线,研究了不同刀具半径补偿方式对加工的影响.实验结果表明,根据机床伺服轴执,厅能力合理选择刀具半径补偿方式可实现微光学阵列器件高精度加工.     

自旋稳定动能拦截器轨控发动机推力控制

提出了大气层外自旋稳定式动能拦截器的一种典型轨控发动机阵列布局.在分析小发动机工作的各种约束条件的基础上,推导了发动机推力角度、推力大小和冲量效率的计算公式,提出了发动机工作的控制方法.在各种初始条件下进行拦截仿真,所得的脱靶量均在0.3 m以内,可视为直接碰撞命中目标.同时通过仿真分析了冲量效率与自旋速度、发动机工作时间、每圈发动机个数的关系.     

基于内外子区域划分的高阶精度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.     

使用FPGA设计高可靠SpaceWire路由器

为了提高系统的可靠性和可用性,提出一种基于静态随机存取存储器（Static Random-Access Memory,SRAM）型现场可编程门阵列（Field-Programmable Gate Array, FPGA）的SpaceWire路由器设计方法。路由器通过系统级三模冗余技术加固,采用基于位流重定位的动态部分刷新技术修复系统中发生的软故障,并提出一种基于工作输入和健康现态的实时状态同步方法,以确保故障模块修复后的状态与其他模块同步。因此,该系统能够进行错误掩蔽和自我修复。在Xilinx Virtex-5 FPGA开发板ML507上对所提出的路由器系统结构和设计方法进行实现和验证。实验结果表明,路由器的可靠性和可用性显著增加,且系统的实时性很好,能保证路由器在整个工作过程中提供正常服务而不会引起系统功能中断或延迟;位流重定位技术的采用将所需存储空间减少三分之二,同时也降低了原始位流本身故障的可能性。