SIMULINK仿真过程中的动态数据传递研究

针对大型复杂控制系统仿真建模中所遇到的动态数据传递问题,研究了初始数据和参数的统一装订方法,仿真过程中数据的动态输入和输出方法以及状态变量的实时切换方法。这些方法灵活方便,对于大型复杂系统的仿真建模十分有益。     

粉末粒度对储氢电极电化学性能的影响

以M1（NiCoMnTi）5为例,系统研究了粉末粒度对储氢电极电化学性能的影响。结果表明,在试验粒度范围内,合金粉越细,其放电容量越高,高倍率放电性能和循环稳定性也越好;将两种不同粒度的合金粉混合使用时,粒径相差越大,其放电容量越高。且当粗细粉质量比为7：3时,放电容量最高。     

高层建筑防排烟设计

本文论述了防排烟分区的划分,防排烟方式的选择,疏散楼梯间和消防电梯的防排烟设计,并探讨了防排烟设计中的问题     

现代武装直升机航空电子系统技术发展述评

概述了发展现代军用直升机航空电子系统的必要性,简要论述了直升机航空电子系统的模块化设计思想,以宝石柱和宝石台两大项目为例介绍了美国在发展模块化航空电子系统研究中所走过和正在走的道路,并谈到了欧洲各国及南非的发展概况。从几项关键技术入手比较系统地研究了有关今后发展中的技术走向问题。     

紧固件拆装时间预计模型

紧固件拆装作业时间是影响机械产品维修性的主要因素之一,占机械产品维修作业时间的70％～80％。因此,探讨紧固件拆装作业时间的预计方法,对研究、设计机械产品的维修性,将是十分必要的。通过分析紧固件拆装作业过程,探索出了影响拆装作业时间的诸因素,并对所有的影响因素进行分析、权衡和回归,建立紧固件拆装作业时间的预计模型。将此模型在某型履带式车辆上进行了实际验证,证明了模型的正确性及通用性。     

计算机控制发动机喷油量的分析

分析了在计算机控制下的喷油量调控原理,阐述了基本喷油量、校正喷油量、开环控制喷油量和最终闭环喷油量的数学模型.     

基于最大熵谱估计验证战术导弹的气动模型

现代谱估计方法是验证系统仿真模型的有效方法。战术导弹飞行试验的遥、外测数据记录了大量的过程参数,可以利用这些参数进行气动力和气动力矩的计算,与飞行试验过程参数进行分析比较。应用最大熵谱估计检验导弹的气动力和气动力矩模型的可信性,可以给出定量的结果。文章给出的方法可以作为战术导弹气动参数模型研究的一种辅助手段。     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

在新的起点上推进军队政治工作信息化建设

在新的起点上推进军队政治工作信息化建设,必须进一步理清推进政治工作信息化建设科学发展的总体思路;下大力抓好政治工作信息化建设重点任务落实;重视加强对政治工作信息化建设的组织领导.