一种快速抑制单脉冲雷达角闪烁的方法

一种小窗口的快速中值滤波方法能够有效抑制比幅单脉冲末制导雷达角跟踪中的角闪烁。该方法根据比幅单脉冲雷达测角原理,在测角之后对测量结果以小窗口中值滤波的方式进行处理,最大程度上保留测角结果的细节信息又能够有效地抑制角闪烁,并且有较低的运算量。通过对仿真及实测数据的处理,表明该算法可以明显降低末制导雷达在接近目标时角闪烁的影响,有效提高雷达角跟踪精度。     

基于DEA方法的新疆少数民族高等教育效率评价研究

由于数据包络分析方法（DEA）对多输入多输出系统的效率评价问题具有十分独特的优势。近年来,DEA方法在高等教育效率评价,尤其是在高等学校人力资源利用效率评价中的应用日趋增多,取得了丰硕的研究成果。本文针对新疆少数民族高等教育效率评价问题,重点从地域角度,采用DEA交叉评价方法定量研究新疆少数民族高等教育资源利用效率的状况,以期为教育管理者在制定资源配置政策以及高校在如何提高资源利用效率方面提供借鉴与参考。     

基于SNR的烟幕干扰效果仿真

烟幕对红外等电磁波具有吸收、反射和散射特性,可导致导引头上接收的能量大大衰减,从而降低导弹的命中概率.针对外场烟幕性能测试受气象条件和环境因素的影响较大,对准确评估抗红外烟幕遮蔽性能存在较大困难的情况,结合气象条件从烟幕透过率的变化引起导引头信噪比变化的角度,建立了烟幕干扰效果的评估模型,通过计算机仿真,得出了烟幕对红外制导导弹的干扰效果.通过试验对其中的一些结论进行了实验验证,结果表明计算结果能够与实验数据较好吻合.     

C3I模拟系统目标数据处理的实现

海军岸基指挥自动化模拟系统中,目标数据录取及数据综合处理是非常重要的两个模块。本文介绍了在该模拟系统中这两个模块的仿真实现。首先简要介绍系统结构组成、信息流程,及目标数据录取和数据综合处理模块的基本功能;并着重介绍其软件流程,实现的关键技术;最后介绍其仿真实现。     

战场态势估计的理论体系研究

态势估计是数据融合体系中的一个重要层次。战场态势估计在现代作战中发挥了越来越重要的作用,但到目前为止关于态势估计的理论体系还没有一种比较统一的看法。本文从态势估计在数据融合中的地位出发,以态势估计处理融合数据的具体流程为根据,建立了三个层次的态势估计层次结构,解决了关于态势估计具体需要研究的内容问题。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Scheduling recurrent construction

A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.