基于共进化的多任务分配与调度

在考虑多种约束关系基础上 ,提出一种并行与分布式系统中多约束关系的任务分配与调度的共同进化遗传算法。仿真试验结果表明所给算法比传统单种遗传算法更能有效地进行多任务分配与调度 ,具有一定的工程价值     

声场波数积分最大截止波数自动选取算法

为了提高声场波数积分传递函数矩阵法的计算稳定性与精确性,提出基于预估-校正思想的最大截止波数自动选取算法,具有简单可靠、附带计算量小的优点。自由空间球面波算例测试结果表明,传递函数自下而上（单向）求解顺序的计算稳定性相对较差,在声源上方易出现积分核函数非物理发散,需要在不同深度上采用不同的截止波数才能计算出正确结果;而上下对进（双向）求解顺序的计算稳定性与计算精度均较高。     

Spaghetti: systems thinking and the US Army

In the mid-2000s, the United States Army was embroiled in counterinsurgency missions in Iraq and Afghanistan that required deeper understanding of local social systems. The Army turned to systems thinking and design thinking to model and understand the world, define problems, and develop approaches to strategic and operational challenges. However, the Army’s approach as expressed in publications and doctrine encourages the development of complicated, unsupported, and unfalsifiable hypotheses. The risk is that the Army will act on incorrect assumptions and develop plans that are fragile.     

基于降低运算复杂度的子空间跟踪算法稳健性分析

FDPM和FOOJA是目前两种最为有效的适用于主、次子空间跟踪的方法,属于低复杂度算法。进一步降低算法运算复杂度,对保证算法的实时性具有非常重要的意义。以降低算法运算复杂度为背景,通过对FDPM、FOOJA算法的分析,指出存在两种简化运算量的FDPM1stcol、FOOJA1stcol方法。在有限精度运算条件下,对四种方法的稳定性、数值鲁棒性进行了深入分析和讨论。通过实验仿真,对分析的结论进行了验证。     

Fibonacci数列及其算法分析

讨论了方程x^k=x^k-1＋x^k-2＋……＋x＋1的性质根,并利用其给出了k阶Fibonacci数列的通项公式及其性质,最后,给出了该数列的一些算法,并对这些算法做了简要分析。     

装备工作TRD方法论研究

在分析装备工作复杂性特点的基础上,提出了从事装备工作需要树立系统、活动、体系、部队和设计等5个观念,构建了用于装备工作的“任务-规律-设计”方法论,设计了从事装备工作的一般逻辑步骤,讨论了该方法论的特点、运用原则及方法体系,并以装备采购工作中货源选择工作为例,验证了该方法论的实用性。     

Repairable consecutive‐k‐out‐of‐n: F system with Markov dependence

In this article, a model for a repairable consecutive‐k‐out‐of‐n: F system with Markov dependence is studied. A binary vector is used to represent the system state. The failure rate of a component in the system depends on the state of the preceding component. The failure risk of a system state is then introduced. On the basis of the failure risk, a priority repair rule is adopted. Then the transition density matrix can be determined, and the analysis of the system reliability can be conducted accordingly. One example each of a linear and a circular system is then studied in detail to explain the model and methodology developed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 18–39, 2000     

火炮身管寿命分析与计算

分析了射击时弹丸挤进过程 ,建立了弹丸初速下降量与炮膛内膛磨损量计算模型 ,并以某火炮为实例计算了该炮弹丸初速下降量与炮膛内膛磨损量之间变化关系 ,分析了弹道峰现象 ,为身管寿命预测提供理论依据     

应用多GPU的可压缩湍流并行计算

利用CUDA Fortran语言发展了基于图形处理器(GPU)的计算流体力学可压缩湍流求解器。该求解器基于结构网格有限体积法,空间离散采用AUSMPW+格式,湍流模型为k-ωSST两方程模型,采用MPI实现并行计算。针对最新的GPU架构,讨论了通量计算的优化方法及GPU计算与PCIe数据传输、MPI通信重叠的多GPU并行算法。进行了超声速进气道及空天飞机等算例的数值模拟以验证GPU在大网格量情况下的加速性能。计算结果表明:相对于Intel Xeon E5-2670 CPU单一核心的计算时间,单块NVIDIA GTX Titan Black GPU可获得107~125倍的加速比。利用四块GPU实现了复杂外形1.34亿网格的快速计算,并行效率为91.6%。     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000