大规模科学数据体绘制技术综述

体绘制是刻画大规模科学数据中复杂物理特征的有效途径,然而,数据量极大、特征难以捕捉等问题依然是目前体绘制研究的主要挑战。为此,研究者们从三个方面对体绘制算法进行了深入研究,以提高大规模数据体绘制的效率和效果。一方面,依托硬件通过多处理器核来分担计算,降低单处理器核所要完成的计算量,是提高体绘制效率的一个有效途径。另一方面,充分发掘数据场内在特性对三维数据场进行约简,大幅减少绘制处理数据量从而降低算法开销,也是提高体绘制效率的一个有效途径。同时,在体绘制算法中融入特征分析和特征增强方法,让复杂物理特征从数据场中突显出来,以实现对科学数据的高质量绘制。本文对国内外体绘制技术相关研究进展进行了调研、综述,并分析了不同的研究方法,最后展望了未来体绘制技术研究的可能发展方向,包括应用驱动的特征体绘制、基于特征的约简体绘制、适应硬件的体绘制多级加速以及原位智能化体绘制等。     

数据基故障诊断算法更新问题研究

机内测试被广泛应用于故障诊断、装备健康管理与预测等领域。针对机内测试设备在设计和升级时遇到的分类器更新、样本数量不平衡、硬件条件限制问题,提出初步解决方案。利用基于密度的聚类和人工免疫方法处理原始数据;提出基于代表样本点的混合学习方法;利用支持向量机和仿真案例验证所提方法。结果表明所提方法能够解决上述问题,有助于基于数据的机内测试设备设计与升级。     

网络化军事信息系统数据架构研究

针对网络化军事信息系统的数据特点,提出了一种网络化军事信息系统数据架构,在多维数据分类的基础上,建立由全军数据、战区数据、部门数据构成的数据参考模型,并从支持信息共享、业务互操作、系统灵活重组3个方面,提出网络化军事信息系统的数据应用模式,探讨全军范围内的数据共享、业务互操作的实现方式,为网络化军事信息系统的数据规划提供参考。     

稳定特征选择的多目标蚁群优化

为了提高进化算法特征选择稳定性,提出一种面向稳定特征选择的多目标蚁群优化方法。通过抽样策略集成三种特征排序法的输出作为多目标蚁群优化的稳定性指导信息,聚合特征的费舍尔分值和最大信息系数值作为多目标蚁群优化的启发式信息,以分类正确率和扩展昆彻瓦指标值作为两个优化目标,兼顾算法的分类性能与特征选择稳定性。在四个标准数据集上进行对比实验,结果表明,所提方法能够在分类性能与稳定性方面达到较好的平衡。     

Chebyshev subinterval polynomial approximations for continuous distribution functions

An algorithm for constructing a three-subinterval approximation for any continous distribution function is presented in which the Chebyshev criterion is used, or equivalently, the maximum absolute error (MAE) is minimized. The resulting approximation of this algorithm for the standard normal distribution function provides a guideline for constructing the simple approximation formulas proposed by Shah [13]. Furthermore, the above algorithm is extended to more accurate computer applications, by constructing a four-polynomial approximation for a distribution function. The resulting approximation for the standard normal distribution function is at least as accurate as, faster, and more efficient than the six-polynomial approximation proposed by Milton and Hotchkiss [11] and modified by Milton [10].     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

基于改进线性二次型调节器的近地轨道编队卫星鲁棒控制

为解决编队卫星在近地空间复杂力学环境特别是地球非球形摄动作用下构型易发散的问题,给出一种基于改进线性二次型调节器的编队卫星构型控制方法。该方法先估计近地空间编队卫星构型设计时由未建模摄动力引起的误差最大有界范围,再利用误差最大有界范围的二范数改进经典的线性二次型调节器控制方法,提高经典线性二次型调节器控制器在控制编队卫星构型时的鲁棒性。为评价改进方法的有效性,给出了一种鲁棒性强弱的量化评判标准。仿真结果表明,改进的方法可以大大提高经典线性二次型调节器方法的鲁棒性,增强编队卫星控制方法对各种不确定项的抵御能力。