PCA和ICA的舰船尾流后向散射光信号检测

水体的后向散射光信号是舰船尾流后向散射光信号检测的常见干扰,由于其在频域十分接近且信号强度大于尾流信号,因此严重影响了有用信号的提取。针对这一问题,提出了一种基于主成分分析(PCA)和独立成分分析(ICA)相结合的尾流散射光信号检测方法。首先使用主成分分析对采集的散射光信号进行降维,去除冗余成分,之后使用基于负熵的F astICA算法对数据进行处理,分离了水体和舰船尾流的散射光信号,通过实验验证了该算法的有效性。     

基于状态变换的数字电路冗余确认研究

以状态跳变图为基础,深入分析了冗余变换与非法变换的特征,提出结构冗余和功能冗余的概念,并讨论了可测故障、不可测故障和冗余之间的联系.最后结合验证和测试生成,提出状态冗余的隐含遍历确认策略.     

A computation procedure for the exact solution of location-allocation problems with rectangular distances

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem.     

雷达网抗干扰性能综合评估指标

如何对雷达网的抗干扰性能进行评估一直是国内外的研究热点之一。从雷达网的战术功能总体需求出发,指出可以根据雷达网在干扰前后的情报信息提供能力的变化来进行评估,然后结合对雷达网内部影响其抗干扰性能的各因素分析,并考虑到外场实际开展对雷达网抗干扰性能试验评估的需求,在现有评估指标的基础上,提出用于综合评估雷达网抗干扰性能的指标。     

炮射导弹飞行可靠性试验法研究

结合炮射导弹的性能特点 ,研究分析了传统的飞行可靠性试验法的不足 ,提出了炮射导弹飞行可靠性试验的寿命型定时截尾指数分布新方法 ,该方法的应用使试验的方法更为可行 ,结果更为合理     

软件可靠性考核试验方法研究

分析了软件可靠性考核的时机 ,提出了软件可靠性的验证试验方法 ,并对基于经典方法和 Bayes方法的无故障运行考核方法进行了研究     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

Optimal material control in an assembly system with component commonality

Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001