从"误伤事件"原因分析,看战术数据链战略地位

以伊拉克战争为背景,介绍了美军及北约的战术数据链发展情况、技术概要,重点论述了不同时期的战术数据链在技术体制上的差异,以及由此可能导致互联、互通和互操作的分析.最后,结合我军的一些现状,在汲取外军教训的基础上,提出我军在战术数据链建设方面的一些建议.     

Determination of burn‐in parameters and residual life for highly reliable products

Today, many products are designed and manufactured to function for a long period of time before they fail. Determining product reliability is a great challenge to manufacturers of highly reliable products with only a relatively short period of time available for internal life testing. In particular, it may be difficult to determine optimal burn‐in parameters and characterize the residual life distribution. A promising alternative is to use data on a quality characteristic (QC) whose degradation over time can be related to product failure. Typically, product failure corresponds to the first passage time of the degradation path beyond a critical value. If degradation paths can be modeled properly, one can predict failure time and determine the life distribution without actually observing failures. In this paper, we first use a Wiener process to describe the continuous degradation path of the quality characteristic of the product. A Wiener process allows nonconstant variance and nonzero correlation among data collected at different time points. We propose a decision rule for classifying a unit as normal or weak, and give an economic model for determining the optimal termination time and other parameters of a burn‐in test. Next, we propose a method for assessing the product's lifetime distribution of the passed units. The proposed methodologies are all based only on the product's initial observed degradation data. Finally, an example of an electronic product, namely contact image scanner (CIS), is used to illustrate the proposed procedure. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

模糊神经时延 Petri 网的信息融合模型

将模糊逻辑与融合技术相结合得到了一种模糊信息融合方法,然后用时延Ｐｅｔｒｉ网对此信息融合系统建模,并给出了信息融合系统反应时间的一个计算公式。然后将人工神经网络应用到时延Ｐｅｔｒｉ网中,提出了一种多传感器信息融合的模糊神经时延Ｐｅｔｒｉ网模型。     

美军数据链一体化建设及启示

通过总结美军数据链建设的现状与发展趋势,重点分析了美军数据链一体化建设中采取的基于数据转发、基于并行接口和基于消息标准多链路操作发展策略,并探讨了美军一体化建设过程中面临的问题。最后,结合数据链建设的实际情况,在汲取美军教训的基础上,提出了数据链一体化建设过程中应重点解决的问题。     

基于矩阵分析的D-S证据理论的多传感器雷达体制识别

采用不确定推理的矩阵分析方法,建立了用于雷达体制识别的多传感器数据融合的数学模型,提出了一种基于矩阵分析的多传感器信息融合的新算法,结合多传感器多测量周期的雷达体制识别给出了具体的实例.识别结果说明了该算法的有效性.     

管壁不连续对管路结构振动传递的影响

用传递矩阵法得出了管路中纯扭转波在通过管壁不连续处的波动形式的解,以此为基础分析了管壁材质以及厚度的差异对纯扭转波的透射系数的影响,并得出了管壁材料的密度与剪切模量的乘积相差越悬殊,隔离振动的效果越好,以及管壁几何结构不连续对隔振的贡献不大的结论.     

图形点阵液晶模块的中文菜单界面的实现

研究了基于DEM12864P图形点阵液晶模块实现中文菜单人机界面的问题。首先分析了液晶模块DEM12864P的特性,阐述了DDRAM寻址与液晶点阵的对应关系及中文字符、中文菜单在液晶模块上的显示规则,进而介绍了一种基于多任务背景的屏幕光标实现方法及菜单数据结构的设计,提出了相应软件设计的实现方法.