机电计算装置中运算放大器板离线自动检测方案研究

基于运算放大器能实现信号的加减运算这一基本原理,应用单片机控制检测技术,研究运放工作性能离线自动检测方案.利用本方案实现的检测仪器可以提高装备的维修效率.     

直接网络中的自适应路由算法分析

互连网络是大规模并行计算机的重要组成部分，路由算法是其中决定网络性能的重要因素，本文在直接网络结构基础上对路由算法进行讨论，给出了一种分类方法，并着重对采用虫孔路由开关技术的自适应路由算法进行分析，为进一步的评价和设计新的算法提供了参考。     

地形相关算法度量值的统计特性

考虑到地形相关匹配算法度量值统计特性与二维地形自相关系数的关系，本文提出一种改进的约翰逊方法——相关地形下的匹配算法度量值统计特性分析方法。首先，基于约翰逊方法的问题框架，修改其中基准数据的相邻像元值相互独立的假设，导出了地形相关 Ｍ Ｓ Ｄ 算法度量值的统计分布的解析函数。然后，讨论了约翰逊方法与本文方法的适用性，指出了约翰逊方法的不足之处。最后，给出了本文方法在地形可匹配性分析中的一种应用。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000     

数据并行程序设计语言中分布数组的地址计算

本文讨论了在大规模并行计算机上实现数据并行程序设计语言的关键问题──分布数组的地址计算问题。文中详细给出了维分布数组的下标地址计算公式,分布数组的内情向量结构以及分布数组映射函数算法,并对有关编译实现技术进行了探讨。     

基于遗传算法的协同多目标攻击空战决策方法

多机协同多目标攻击是未来空对空作战的一种重要形式。首先建立了多机协同空战的自主优势矩阵 ,并依据多人冲突决策理论构造了空战的总体优化指标向量 ,然后针对其他优化算法的不足 ,提出用遗传算法优化该指标向量 ,实现多机协同多目标攻击空战决策 ,最后对 2∶ 2空战进行了仿真。仿真结果证明了上述思想的正确性。     

装甲车辆使用与保障费用的指数回归模型

运用逐步回归和主成分分析的方法,选取了装甲车辆诸多战技性能指标集合中的自变量子集,建立了该子集与使用与保障费用之间指数回归方程组.该模型也可推广应用于装甲车辆综合性能的评估.     

一种新的基于图像复杂度的掩密分析技术

基于掩密图像与原始图像在图像复杂度上的差异,提出了一种新的针对图像LSB嵌入的掩密分析算法,通过分析待检图像在嵌入测试消息前后图像复杂度均值和方差的变化情况,利用Fisher判决准则,从而准确判断图像中是否嵌入了秘密消息.实验结果表明,文章所提算法不仅能准确检测顺序LSB嵌入,并且能估计出嵌入消息的长度,而且能够以98％的准确率检测随机LSB嵌入,同时具有实现简单,运行速度快等优点.     

A competitive genetic algorithm for resource-constrained project scheduling

In this paper we consider the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective. We propose a new genetic algorithm approach to solve this problem. Subsequently, we compare it to two genetic algorithm concepts from the literature. While our approach makes use of a permutation based genetic encoding that contains problem-specific knowledge, the other two procedures employ a priority value based and a priority rule based representation, respectively. Then we present the results of our thorough computational study for which standard sets of project instances have been used. The outcome reveals that our procedure is the most promising genetic algorithm to solve the RCPSP. Finally, we show that our genetic algorithm yields better results than several heuristic procedures presented in the literature. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 733–750, 1998