机构可靠性

本文讨论了机构可靠性问题,指出机构可靠性主要取决于运动副的约束条件的稳定性.其中,包括运动约束条件和几何形状约束条件的稳定性,这就使机构可靠性研究的着眼点更为明确.     

二维 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阵列结构。不难将上述阵列推广到多维的情况。     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

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

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

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

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