空间军事系统综合集成研讨厅中基于移动Agent的数据挖掘结构研究

空间军事系统综合集成研讨厅是一种分布式的网络结构,包含着丰富的信息资源。要想充分利用这些数据资源以及数据后面所隐藏的重要信息,必须建立有效的数据挖掘模式。本文在应用移动A-gent技术的基础上,将Web数据挖掘和分布式数据挖掘进行松散耦合,建立了合理的挖掘框架,并对其结构作了详细说明。     

浅谈成人高校后勤管理改革

当前成人高校的后勤存在的问题,决定必须对其进行改革,改革应遵循解放思想、实事求是的原则;因地、因校制宜的原则;坚持"三服务,两育人"的原则;维护学校稳定原则;集中统一、整体发展等原则.改革的根本途径在于后勤的社会化,其实质就是建立现代后勤制度.     

大机动格斗及近距空战的若干问题

较系统地综述了大机动格斗的一些基本战术和技术概念,引入了超机动性的一些度量,然后提出了使用具有刚体性质的质点飞机模型的可行性.最后提出在大机动格斗实战环境中,火力控制需要解决的若干问题.     

Word文件自动管理系统的设计和实现

论述了研制新型文档自动管理系统的原因及其重要性,给出了系统的软件结构和文档自动管理系统的部分设计界面.重点介绍了大文本的读写、Microsoft Word 的控制、Word的感知、套打、数据库的连接等主要技术难点,使系统能够存放文档文件的所有信息,按权限管理,保证文档文件在查询和网络传递中操作简单、安全可靠.     

空间碎片天基主动清除技术发展现状及趋势

随着国内外航天发射任务逐年增多,大量在轨滞留的失效航天器将成为未来空间资源有效利用所面临的一个严峻挑战。空间碎片天基主动清除技术是从根源上对空间资源化利用与安全处置的措施,将提升和加强近地空间的可持续循环利用。本文明晰了空间碎片天基主动清除的概念,分析了空间碎片天基主动清除技术的发展历程,提出了其发展过程中面临的非合作目标相对导航、协调控制和捕获方式及装置等主要问题,为我国空间碎片天基主动清除技术的发展提出了有益参考。     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015     

Life distribution analysis based on Lévy subordinators for degradation with random jumps

For a component or a system subject to stochastic degradation with sporadic jumps that occur at random times and have random sizes, we propose to model the cumulative degradation with random jumps using a single stochastic process based on the characteristics of Lévy subordinators, the class of nondecreasing Lévy processes. Based on the inverse Fourier transform, we derive a new closed‐form reliability function and probability density function for lifetime, represented by Lévy measures. The reliability function derived using the traditional convolution approach for common stochastic models such as gamma degradation process with random jumps, is revealed to be a special case of our general model. Numerical experiments are used to demonstrate that our model performs well for different applications, when compared with the traditional convolution method. More importantly, it is a general and useful tool for life distribution analysis of stochastic degradation with random jumps in multidimensional cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 483–492, 2015     

The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options

This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015     

压缩感知曲线SAR孔径优化和目标三维特征提取

在建立曲线合成孔径雷达回波信号稀疏表示模型的基础上,基于压缩感知采样矩阵设计的不相关原则,给出了曲线孔径优化设计的评价准则,并利用基于全局优化的基追踪方法实现了目标三维特征提取。仿真结果验证了孔径优化评价准则的正确性和基追踪方法在目标特征提取处理中的有效性。     

基于委托模式的多分辨率联合仿真

多分辨率联合仿真是实现多层次、多视角仿真的有效方法之一。现有多分辨率联合仿真模式存在一致性偏差和仿真剧情割裂问题,从而影响仿真的有效性。为此,提出基于委托模式的多分辨率联合仿真思路,该模式下能够较好地避免仿真剧情割裂问题,同时降低一致性问题的解决难度。通过实例验证,该方法较好地适用于大规模作战和局部作战行动的多分辨率联合仿真。