基于形态滤波的漏磁信号基线漂移在线处理

为了实现快速漏磁检测,采用形态滤波的方法对漏磁信号的基线漂移进行在线处理．首先,运用Maragos类型形态滤波器,选择平面结构元素作为最佳形态滤波形式,并通过实验得到最佳结构元素选取标准;然后,利用该滤波器和小波分解的方法分别对仿真信号和采集到的漏磁信号进行基线漂移的处理．结果表明：形态滤波的方法能够实时准确地实现基线漂移的去除．     

激光加热辅助引弧微爆炸加工工程陶瓷的试验研究

为验证激光加热辅助技术改善引弧微爆炸加工质量和提高加工效率的可行性,探索加工工艺参数对加工过程的影响规律,设计了激光加热辅助引弧微爆炸加工试验系统,并通过试验研究了工艺参数对材料去除率和崩碎的影响规律。试验结果表明：激光加热辅助引弧微爆炸加工陶瓷可以提高材料去除率,改善崩碎情况;加工效率随激光功率的增加而提高,随光斑尺寸的增大而降低,随距离的增加先提高后降低;崩碎随激光功率的增加而减少,随光斑尺寸的增大先减少后增多,随距离的增加先减少后增多。研究结果为激光加热辅助引弧微爆炸加工机理的研究和工艺参数的优化提供了参考依据。     

一种新颖的并行级联LDPC码译码算法

针对传统的并行级联低密度奇偶校验码(PCGC)译码算法采用串行算法导致译码延迟大,难以在实时通信系统中应用的问题,提出了一种新颖的PCGC码译码算法,该算法通过对各子码进行并行消息迭代,对相同的信息位进行变量消息联合更新,实现了PCGC码的并行译码。理论分析和仿真结果表明,提出的PCGC码译码算法相较于传统译码算法译码延迟降低,信噪比较低时误码率性能弱于后者,信噪比较高时,误码率性能优于后者。     

基于能力映射的体系网络化建模与分析

从体系所具有的能力出发,准确地描述体系中实体之间的关系,建立体系结构模型是体系设计与分析的基础,也是基于能力的体系规划的关键。首先提出了能力到组分系统的映射规则,然后将所构建的体系二分网络转化为组分系统的加权合作网络,有效描述了体系组分系统间的复杂关系。最后给出了体系组分系统关系价值度量指标,并对网络模型进行社团结构分析,为基于能力的体系规划作了有益尝试。     

陆军战术部队用天体系能力研究

以未来信息化战场联合作战为背景,强调天基资源在陆军战术部队作战体系中的重要地位,深入分析美国陆军天基资源运用现状和能力形成途径,从陆军装备转型建设实际需求出发,研究陆军用天(基)体系架构,阐述体系能力特征。     

基于目标中心战的舰载UAV协同对海突击作战构想

针对舰载无人机编队协同对海突击作战的特点,在充分吸收目标中心战理论的基础上,提出了基于目标中心战的舰载无人机编队协同对海突击作战构想,论证了目标中心战应用于舰载无人机编队协同对海突击作战的可行性,并对其概念和特征进行了界定和分析,着重对目标中心战理论中的“侦-控-打-评”作战过程进行适应性改造,提出了基于目标中心战的舰载无人机编队协同对海突击作战的主要环节,包括态势评估,目标选择与分配,航路规划,协同打击和效能评估等。     

基于Rényi信息增量的机动目标协同跟踪算法

针对基于多传感器组网进行机动目标跟踪的传感器管理问题,提出了一种基于Rényi信息增量的机动目标协同跟踪算法。首先结合"当前"统计模型和交互式多模型不敏卡尔曼滤波算法设计了一种变结构多模型算法,来进行机动目标的状态估计;然后以Rényi信息增量为评价准则,选择使Rényi信息增量最大的单个传感器进行目标跟踪;最后利用得到的最优加速度估计进行网格划分,更新变结构多模型中的模型集合。在一般机动及强机动场景下进行了算法性能分析,仿真结果表明,该算法能够合理地选择传感器,提高了对机动目标的跟踪精度。     

基于改进Markov模型软件测试策略

针对已有软件测试Markov模型与工程实践不符的情况,通过引入软件需求覆盖率改进Markov模型。在改进的Markov模型基础上,本文以软件测试过程中测试总代价最小为控制目标,采用交叉熵方法修正测试剖面,由优化测试剖面生成测试用例序列。仿真结果表明这种方法能够有效地降低软件测试总代价,是一种有效的软件测试方法。     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

Optimal pricing and scheduling control of product shipping

In this article, we seek to understand how a capacity‐constrained seller optimally prices and schedules product shipping to customers who are heterogeneous on willingness to pay (WTP) and willingness to wait (WTW). The capacity‐constrained seller does not observe each customer's WTP and WTW and knows only the aggregate distributions of WTP and WTW. The seller's problem is modeled as an M/M/N_s queueing model with multiclass customers and multidimensional information screening. We contribute to the literature by providing an optimal and efficient algorithm. Furthermore, we numerically find that customers with a larger waiting cost enjoys a higher scheduling priority, but customers with higher valuation do not necessarily get a higher scheduling priority. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 215–227, 2015