模块化设计方法在洗消装备设计中的应用探讨

介绍了模块化设计的发展、概念以及模块化设计的过程和步骤。以水基洗消装备为例分析了模块化设计方法在洗消装备设计中的应用,其中针对洗消装备功能分析、模块划分、模块接口等重要环节进行了具体阐述。提出了进行防化洗消装备模块化研究工作的建议。     

本征模式函数与经验模式分解方法分析

介绍本征模式函数IMF满足的条件和定义,分析了经验摸式分解EMD的前提、本质及其对非线性平衡系统数据处理所体现的优越性,并以隧道采集的风力数据处理为例,对上述理论进行了验证,展示了这种新方法的作用和效果。最后,从理论上证明了所处理数据的完备性及EMD成员正交性应满足的条件。     

发射药的分解机理及其安定性研究

在研究发射药中硝酸酯的分解机理及其与发射药安定性关系的基础上,分析了热分解,水解和自动催化作用对发射药安定性的影响,以色谱法和粘度法等实验手段探索发射药安定性的变化规律,通过不同温度下发射药老化过程的动力学研究,提出了确定发射药安全使用寿命的可靠方法。     

单质炸药和样品混合炸药热分解反应动力学参数的研究

本文用差示扫描量热仪(DSC7)测得了几种单质炸药和样品混合炸药的非等温DSC曲线,对热分解反应速率方程进行了研究,编制了由一条非等温DSC曲线的信息计算炸药热分解反应动力学参数的程序,并证明DSC的线性升温速率对动力学参数没有明显影响。     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Decomposition-based approximation algorithms for the one-warehouse multi-retailer problem with concave batch order costs

We study the one-warehouse multi-retailer problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem into single-facility subproblems, then propose approximation algorithms by judiciously recombining the subproblem solutions. For piecewise linear concave batch order costs with a constant number of slopes we obtain a constant-factor approximation, while for general concave batch costs we propose an approximation within a logarithmic factor of optimality. We also extend some results to subadditive order and/or holding costs.     

基于粒子群优化的稀疏分解最优匹配原子搜索算法

信号的稀疏分解能得到信号的稀疏表示形式,便于进一步处理,但其计算非常复杂,是一个NP问题.粒子群优化是群体智能优化算法,算法简单,易于实现,且搜索效果好.把粒子群优化算法用于稀疏分解的最优匹配原子的搜索,能降低稀疏分解复杂度,同时减少稀疏分解的超完备字典对存储空间的占用,以提高用稀疏分解理论进行信号处理的计算效率,满足或接近实时性的要求.实验证明,此方法切实可行.     

一种基于知识的作战计划系统设计

作战计划系统是复杂的问题求解系统,在军事领域的各个方面发挥着重要的作用。介绍了当前一些主要的作战计划辅助生成系统及其特点,分析比较和归纳整理了当前军用计划系统所采用的一些常见规划技术和优缺点,重点分析了作战计划系统中的智能规划技术。在此基础上,提出了一种基于知识的作战计划辅助生成系统的开发设想,构建了系统知识库,系统采用层级任务网络规划技术,给出了这种规划技术的理论框架和算法过程,并且把这种技术与多主体规划技术相结合,辅助实现军事作战任务的逐层分解与规划优化,进而生成完整的行动序列,较好地解决了作战计划辅助生成问题。     

多功能小区工程建设及其环境保护

研究表明,永川市某多功能小区目前环境质量良好,可满足永川新城建设需要。原渝西学院红河校区工程建设环境后评价发现,尽管对小区新建工程进行了科学决策与管理,但新建工程仍然对环境质量有轻微的不利影响,其积累效应值得有关方面关注。该结论对多功能小区环境规划、管理与保护具有一定意义。     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015