基于组合媒质通道模型的地下目标成像

由于电磁波在穿越不同介质时会出现折射现象,因此在地下目标成像过程中,电磁波信号穿越从雷达到地下目标的组合通道的路径不是直线而是折线,此时利用常规的自由空间中的合成孔径成像方法已经不能对目标进行成像。基于电磁波的传播规律和地层有耗媒质的特性,提出了电磁波传输的组合通道模型,并将其应用到地下目标成像中。通过仿真比较可以看出,使用组合通道模型对地下目标成像效果有明显的改善,组合通道模型适用于对分层土壤中的地下目标成像。     

信息错误检测项目的关系分析

从提高信息质量这一目标入手,定义了理论信息错误类别空间、可检测信息错误类别空间、检测项目集等基础概念,分析了检测项目集之间的对等、相交、包含和互斥等4种关系及其特点,形成了信息错误检测项目集的2种生成与优化方式,以及若干优化原则,并给出各原则的优先顺序。     

信息安全保障与信息作战的关系探究

为了给信息作战计划的制定、行动的实施提供安全保障指导,探讨了信息安全保障与信息作战(IO)之间的关系,以几种典型信息作战要素和信息作战空间的三个层次为对象,详细分析了信息安全保障与二者之间的关系。为军队信息安全保障体系的建立提供一定理论支持。     

Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

PMSM空间矢量控制在坦克全电炮控中的应用

介绍了数字交流全电式坦克炮控系统的设计,针对基于DSP(数字信号处理器)的永磁同步电动机(PMSM)电压空间矢量算法的特点,研究出了优化控制的新算法,减少了计算量,提高了系统的性能.试验结果表明系统具有良好的动静态性能,能显著地提高炮控系统的各项战技指标.     

利用数形结合方法求解几类代数问题

数学研究的对象是现实世界的数量关系(数)和空间形式(形)。“数”和“形”常按照一定的条件相互转化。数形结合思想是数学的重要的思想方法之一,并蕴于数学基础知识和基本技能之中,在数学解题中应用十分广泛。其实质是将抽象的数学语言与直观图形结合起来,发挥“数”与“形”两种信息的转化及其优势互补与整合,使逻辑思维与形象思维完美统一起来。对于培养学生的创新意识和创造思维具有积极的促进作用。     

A stochastic model for burn‐in procedures in accelerated environment

Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006