二维粒子模拟的多时标法

将多时标法应用于二维激光等离子体全电磁相对论粒子模拟程序中,对共振吸收及相关的物理现象进行了模拟计算,既正确地描述了等离子体的动力学行为,又大大节省了计算时间。     

应用分解法分析二阶锁相环路

本文介绍了一种新的非线性分析方法──分解法,并通过引入数学机械化的方法,将其应用于非理想二阶锁相环路的分析,推导了捕捉过程中相位差、频率差的逼近解析解,分析了环路的稳定性,得到了环路稳态相差、稳态频差和捕捉时间等参数。     

二维 DFT 和 DCT 的 Systolic 阵列

超级计算中一个活跃的研究领域是将某些有限和,如离散富里叶变换(DFT)、离散余弦变换(DCT),映射到多处理机阵列上。本文首先通过二维DFT的行列分解算法流程图,给出了计算二维DFT的二种Systolic阵列:一种是由N_1个处理器组成的线性阵列,所花时间步为O(N_1N_2)(设二维DFT为N_1×N_2长的),与行列分解算法在单处理机上顺序执行所花时间相比,加速比为O(N)(设N_1=N_2=N)。这一结果无论是在时间消耗,还是在PE数量上都是目前最优的。另一种是由N_1×N_2个处理器组成的矩形阵列,所需时间为O(N_1+N_2),与行列算法在单处理机上顺序运行所花时间相比,加速比为O(N~2)(这里仍假定N_1=N_2=N)。本文还给出了二维DCT的与二维DFT相似的Systoilc阵列结构。不难将上述阵列推广到多维的情况。     

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

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

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

介绍本征模式函数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     

平台式惯导系统初始对准最佳可观性分析

首先应用线性系统的奇异值分解理论对静基座初始对准的可观性及可观度进行了深入地分析.给出了不同奇异值下系统状态可观性状况的直方图,并且计算出不同状态组合时系统奇异值的大小及对可观性的影响.理论分析表明选取(△)N、(△)E、εE为不可观测时,系统的估计效果最好.其次采用卡尔曼滤波器对可观阵的秩为7的三种状态组合进行最优估计,仿真结果验证这种论断的正确性.最后从误差分析的角度阐述了这种论断的合理性.     

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.