滑动容错辨识算法在航迹数据处理中的应用

由于试验环境和被测目标运动特性的影响,航迹测量数据中会出现斑点型异值。对最小二乘多项式进行改进,引进自适应调节函数和滑动窗口概念,提出了滑动多项式容错辨识算法,详细描述了采用该方法进行异值辨识和修复的具体过程。仿真分析和实际飞行试验的数据处理表明:该方法对处理含有斑点型异值的测量数据具有良好的效果。     

基于被动雷达和红外传感器的数据融合

提出基于被动雷达和红外传感器组成的复合探测系统,利用D-S证据理论提高目标识别率,借助神经网络改善目标跟踪算法的性能,同时保持跟踪滤波的计算结构尽可能简单,尤其是减少了数字计算上的复杂性。仿真结果表明了应用新算法的复合探测系统的有效性。     

ODS系统及其在电子战中的应用

数据仓库(DW)在决策支持系统起着举足轻重的作用,在数据的存储和挖掘中有着诸多优势,但对处理实时数据的处理效率不高,操作数据存储(operational data store)的出现弥补了数据仓库在效率上的不足。对ODS作了系统论述,并讨论其在电子战(EW)中的应用。     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Basic scheduling problems with raw material constraints

One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and L_max and C_max objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Properties of the geometric and related processes

Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

对象关系数据库中的数据结构

介绍了在面向对象数据库和关系数据库相结合的对象关系数据库中,实现关系型数据结构和面向对象数据结构的结合及其存储的一种方法,并举例说明对象关系数据库中对象关系数据记录存储的具体实现。     

借助思想分析信息增强队伍思想工作的针对性和有效性

从警察队伍思想信息运用的现实意义,队伍思想信息的基本特点,当前队伍思想信息收集运用能力不强的主要原因及队伍思想信息运用的基本方法四个方面,就如何提高队伍思想信息分析处理能力,有的放矢地开展思想政治工作进行了初步探讨。     

基于时间序无圈有向图的多准则优化成像调度

合理有效地利用遥感卫星资源获取更多高质量影像数据是卫星成像调度的重要工作。提出了一种新的成像调度解决方案。应用图论相关理论,建立卫星成像时间序无圈有向图模型,利用多项准则作为衡量标准对不同成像路径进行评价,提出时间序多准则最短路径算法求取优化成像路径。理论分析和实验表明,该解决方案可以在较短时间内获得多条pareto优化成像路径,具有良好的调度性能。