一种基于0-1整数规划的全局数据分布优化方法

数据分布是影响并行程序在分布主存多处理机上执行性能的重要因素.针对分布主存多处理机中的数据分布问题,提出了一种基于0-1整数规划、利用数据变换技术进行有效数据分布的方法.该方法通过数据变换技术改变数据的存储布局,以使得数据能被有效地分布,并且该方法还利用数据分布图描述程序被并行的情况及其所含数组被访问的情况,并将全局数据分布优化问题转换为求解数据分布图中最优路径的问题,从而可用0-1整数规划求解最优路径问题.该方法能对多个嵌套循环中具有仿射数组下标的任意维数组进行有效的数据分布,并且也能使嵌套循环的并行度尽可能地大.另外,该方法也考虑了偏移常量的对准问题,从而能使数据通信量尽量地小.实验结果验证了该方法的有效性.     

助推滑翔飞行器复合控制系统线性化小偏差运动方程推导与控制系统设计

助推滑翔技术是制导武器实现增加射程、提高机动突防能力的关键技术之一,对飞行器姿态控制有较高的要求,需要设计复合控制方式的姿态控制系统.针对采用空气舵与燃气舵联动控制的飞行器,建立了动力学模型,详细推导了完整的三通道线性化小偏差运动方程,结合典型弹道数据给出了动力系数图像,分析了助推滑翔弹道各飞行段中飞行器的稳定性,在此基础上选取再入段低空飞行特征点进行了姿控系统设计,仿真结果验证了线性化小偏差运动方程的正确性和控制系统的有效性,为进行此类飞行器的稳定性分析与姿态控制系统设计提供了有益的参考.     

大型相控阵雷达系统安全性综合评价

针对大型相控阵雷达系统安全性因素多、评价困难的特点,分析并建立了大型相控阵雷达系统安全评价指标体系。提出了一种基于改进模糊层次分析法、熵权法和拉格朗日算法确定综合权重的方法,并建立了雷达系统安全性模糊综合评价模型。以某型大型相控阵雷达系统的安全性评价为例,运用所提方法确定该雷达系统的安全性指标综合权重,并进行安全性综合评价。将该方法与传统AHP评价法进行对比分析,验证了该方法的科学性和合理性。     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

区块链在分队战术协同中的应用构想

从战术分队角度出发,探讨了区块链技术在作战实体之间的信息交互及智能协同方面的应用设想,分析了战术分队信息交互的相关技术及面临的挑战,阐述了区块链在未来战术分队指挥体系构建中的发展构想。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于面积比矩阵的加权特征向量点匹配算法

提出一种在仿射变换下点集关系描述算子--面积比矩阵,证明了其在仿射变换群下的不变性质;并由该性质推导得出特征向量(EA)匹配算法抗噪性能差的原因,在此基础上给出了基于面积比矩阵的加权特征向量算法.算法构造不同图像的面积比矩阵,对矩阵进行分解得到其特征值和特征向量,通过特征值进行加权获得图像中点的特征向量,比较图像点的特征向量获取匹配关系.因面积比矩阵的仿射不变性质,算法能实现仿射变换下点集精确匹配;采用的加权特征向量法改进了EA匹配法,具有更好的抗噪性能.实验表明算法切实可行.     

一种改进的事件驱动系统框架

在给出事件驱动系统安全漏洞的基础上,指出了产生漏洞的根本原因是:系统忽视了输入系统的事件序列之间存在的相关性;系统无条件信任任何事件源产生的事件.针对这两个原因,相应提出了事件序列形式安全分析模型及基于事件源的可信度评估模型,依据这两个模型,构建了一种改进的事件驱动系统框架.     

基于循环子空间理论的线性系统测试矩阵优化

研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值.