数据融合技术与潜艇指控系统的发展

就潜艇指控系统的现状和发展,综述了数据融合技术在潜艇指控系统中的应用前景。     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

航空电子多总线记录系统的设计与实现

讨论了某型航空电子设备的数据记录系统的设计与实现 ,主要探讨了此系统的软、硬件开发 ,系统组成及其信息流。系统采用了 ARINC4 2 9总线和并行总线 ,将各个子系统连接起来 ,实现数据的综合处理、综合控制、综合传输 ,在实际应用中收到了很好的效果     

基于SVR的火控系统解算诸元数据拟合方法

火控系统动态精度测试,需要以对火控系统实际输出射击诸元数据的有效数据拟合为前提。采用SVR方法,可将非线性的复杂函数转化为高维特征空间的线性拟合问题。利用ε不敏感损失函数,描述了采用SVR对火控系统解算诸元的拟合方法,并通过与多项式拟合与神经网络拟合方法相比较,表明了SVR方法的有效性。     

目标数据关联多因素分布式推理判决系统推理结构

目标数据关联多因素分布式推理判决系统 ,是一基于分布式判决分类系统理论进行目标数据关联分析的大规模推理判决系统 ,在C3I系统中有着广泛的应用前景。本文在分析推理判决系统的推理规则类型和状态类型的基础上 ,给出系统的推理结构图 ,该推理结构是正关联神经推理结构     

利用主观数据建立维修模型

给出了在维修建模过程中用三个状态描述设备状态时,利用主观数据和客观数据建立维修模型的程序、方法和示例,所给方法可直接用于实际问题的建模。     

内弹道多通道实验数据处理方法研究

本文对内弹道多通道实验曲线的处理方法进行了较为详细的分析.充分利用多通道实验数据,得出了弹丸运动规律、弹底压力变化规律、平均压力变化规律.为进一步认识膛内现象奠定了一定的基础.     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

Transactional and in-store display data of a large supermarket for data-driven decision-making

This article describes daily and monthly transactional and in-store display data of a large supermarket from January to October in 2019 associated with 28 757 stock-keeping units (SKUs) in 5 categories and 41 subcategories. The database contains five parts, including information about each SKU, in-store display, daily sales, inventory, and replenishment. We also propose some research questions related to assortment planning, pricing, inventory management, and customer behavior. Researchers are welcome to develop data-driven models or other innovative methods to address these questions or other practical problems using this database.