分布式实时网络半实物仿真方法研究

介绍了基于分布式实时网络的复合寻的制导武器半实物仿真试验环境建立的基本方法,对其工作原理、主要设备和技术进行了分析。     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Open64的MPI代码自动生成算法

针对开源编译器Open64存在MPI不能自动并行化的问题,对Open64中面向Cluster的MPI代码自动生成进行了研究。分析了MPI代码自动生成模块在Open64体系结构中的位置,提出了基于Open64的MPI代码自动生成算法,并对其进行了实验验证。实验结果表明：该算法不但能够有效降低MPI并行程序的通信开销,而且能够明显提高其加速比。     

基于作战功能模块设计的武器装备体系需求生成方法框架研究

以FoS（Family of Systems）武器装备体系需求生成为研究对象,构建基于作战功能模块设计的武器装备体系需求生成框架,提出适用于该方法框架的基于目标-概念-任务的作战任务需求分析方法、基于任务-功能的作战能力分析方法,从实践角度实现了模块化作战力量建设与FoS武器装备体系模块化、综合化、集成化建设的一体化设计,为武器装备体系需求生成提供了新的方法框架。     

边界扫描测试的数学描述模型

IEEE1149.1边界扫描机制是一种新型的VLSI电路测试及可测试性设计的有效方法,为了高效地应用边界扫描机制对电路系统进行测试,必须对其所涉及的理论方法进行深入探讨。本文应用布尔矩阵理论建立起边界扫描测试的数学描述模型,并基于所建立的模型导出了边界扫描测试中的故障检测条件和故障隔离条件。为边界扫描测试生成算法的深入研究奠定了理论基础。     

线性调频基带数字产生的关键技术研究

介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较，然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案，分析了基带数字产生的主要关键技术，并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。     

符号执行火控系统诸元解算程序测试用例生成技术

火控系统作为各种武器装备的中枢和大脑,控制着武器系统的运转,其有效性直接关系着射击的成败甚至武器系统的综合效能。诸元解算程序是将各种输入条件依据弹道模型经过多次迭代转换为射击诸元,由于其复杂性,当前软件测试用例只是在几个关键点上进行校验,很难覆盖程序所有分支和路径,存在着测试不充分。针对这个问题,提出了一种基于符号执行的用例自动生成技术,结合解弹道方程组约束条件和程序分支控制变量使用符号执行框架内能够得到覆盖所有可能的执行路径,从而保证测试的充分性。     

时序电路测试中敏化路径选择研究

时序电路测试产生过程中,在进行敏化路径选择时会遇到失败问题.本文针对迭代组合阵列模型测试中产生的这些问题进行了有益的探讨,并提出了改进的时序电路测试产生算法,使之更加完善.     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000