坦克转向操纵装置组装工艺分析

影响坦克操纵力的因素很多.本文利用正交试验法,对影响操纵力的主要因素进行试验,得出转向操纵装置组装工艺的最优方案.对制定维修工艺过程、工艺标准、要求有一定的指导意义.     

坦克火控系统的自适应滤波与自适应解命中

在非制导火控系统中,为实现目标信息的自适应滤波与自适应解命中问题,机动目标模型应能动态识别,又要适应工作周期的各种变化.本文提出的“参数辨识模型”能同时满足上述要求,并可将自适应滤波纳入到现代控制理论的正常思路内予以解决.     

坦克火控系统的发展及电子综合化

坦克火控系统在近期的发展趋势中,除了继续沿着控制主线发展外,还将着重提高模型精度.加强火控系统的理论研究是促进火控系统合理发展的重要方面,实现火控系统与指控系统的综合化设计是当前坦克电子综合化系统设计中的中心内容.     

水平冷凝管中分相流的传热

本文对饱和蒸汽流经水平冷凝管时汽－液分相流的流动和传热模型进行了讨论,并给出有关方程。用该模型对饱和氨蒸汽流经水平铝管时的传热特性进行了计算,给出了流动参数和热学参数的轴向分布,并考察了有关因素对诸参数分布的影响。     

子波域中图象数据的矢量量化

介绍了子波变换的基本理论及特点,并用它对图象进行三层分解。矢量量化优于标量量化。它已成功地应用于图象的数据压缩。文中应用失显量化法量化图象于波域数据,取得较满意的压缩效果。     

鱼雷声输入型目标模拟器研究

介绍了鱼雷声自导系统陆上试验平台中声输入型目标模拟器的研究,给出了系统的组成方块图,阐述了工作原理及设计思想。通过声学理论的分析,得出设计对接装置的几个重要结论。声输入型目标模拟器是鱼雷陆上试验系统的关键设备,它与计算机数据处理系统、转台、海水深度压力模拟系统等构成鱼雷陆上半实物动态仿真试验系统。     

一类带有单调型算子紧扰动的半线性方程的可解性

在算子单调性和紧性假设下研究了半线性算子方程f∈Au-Tu+cu的可解性,其中A,T和C映一个自反Banach空间X的子集到它的对偶空间。所得结果扩展或改进了Guan最近的结果。     

基于模糊理论的舰船航迹控制器

着重介绍如何从航向控制的模糊规则扩展到航迹控制的模糊规则 ,并应用此模糊控制规则实现对舰船航迹的控制 .仿真表明 ,在此模糊控制器的控制下 ,船舶转向动态性能、航迹保持精度、抗干扰性能以及船舶参数发生变化时的鲁棒性均明显优于 PID控制器     

装备经济性分析中的结构制造复杂度参数建模

参数估算法是当前装备经济性分析的主要方法,TruePlanning软件为国际主流的装备经济性分析软件。基于TruePlanning软件,以制造复杂度(Manufacturing Complexity)为研究对象,通过对TrueH模块进行深度剖析,分析并确立了结构制造复杂度(Manufacturing Complexity for Structure)的建模思路和模型形式。通过一个实例分析,选取5个必要的输入参数,构建结构制造复杂度的初步模型,并进一步考虑附加参数的输入,对模型进行修正。结果显示了结构制造复杂度对各技术参数的不同响应形式和敏感程度,为开发国产费用估算模型提供了可行的思路。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004