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     

基于作战仿真的装甲车辆作战效能评估方法

在研制开发装甲车辆的过程中需要预先知道设计的装备是否满足未来战场需要,主要是它的作战效能是否能满足要求。为了获得研制中装备的作战效能,较好的办法是建立作战模型进行仿真。在仿真结果的基础上,通过选取作战效能评估的主要评价指标,建立装甲车辆作战效能的一个综合评估模型,得到了作战效能。     

光纤激光水听器的PGC实时全数字解调系统

概述了基于麦克尔逊干涉仪的光纤激光水听器的相位载波零差法(PGC)调制解调原理,通过数学推导及仿真,分析了调制信号和混频信号的频差是导致全数字化解调结果错误的主要因素之一。针对该诱导因素提供了可行的解决方案,并实现了基于DSP的1 MHz采样频率下使用PGC方法的全数字实时解调系统。对低频水声波段800Hz水声信号进行解调,实验结果表明:解调信号波形良好。     

基于信息系统装备指挥运行机制构建研究

着眼装备指挥变革和提高指挥效能的需要,提出了基于信息系统装备指挥运行机制的概念,构建了基于信息系统的要素式装备指挥机构模型,明确了各指挥要素职能及其相互关系,分析了装备指挥信息、决策计划、协调控制的流程,建立了装备指挥效能计算模型,以期为建设新型科学的装备指挥运行机制提供依据．     

基于改进粒子群优化RBF神经网络的算法

针对粒子群算法易陷入局部极小的缺陷,提出了一种改进的粒子群优化算法,并将改进后的算法应用到RBF神经网络核函数参数的选取中。依照文中提出的编码方式、迭代公式和适应度函数,在全局空间中搜索具有最优适应值的参数向量。实例仿真表明,基于改进粒子群算法优化的RBF神经网络不仅收敛速度快,且误差精度高。     

一种新的多传感器航迹关联算法

提出一种基于多传感器航迹的关联算法.首先根据雷达和目标球极投影后的几何位置关系,利用三角形的几何性质分别建立两个航迹关联函数,并利用加权思想进一步建立相似度函数;在此基础上,利用一阶泰勒展式对航迹关联函数理论分析获得航迹粗关联门限;然后依次通过粗关联和精关联实现航迹关联.仿真结果表明了该算法的时效性和稳定性.     

数码钢琴集体课教学中的创造力培养

本文主要论述利用新的数码钢琴教学技术,创新的教学手段,通过视奏与移调、独奏与重奏、模仿与即兴创编等教学,使音乐理论和键盘技术相结合,推进素质教育,培养学生创新思维和实践能力。     

装备液压系统污染控制建模分析

结合某型装备液压系统的结构特点,建立颗粒污染控制模型,具体分析了几个关键参数对颗粒污染度的影响,为液压系统污染控制理论的建立和完善提供了理论依据。     

电刷镀Cu／Ni多层膜的摩擦学性能研究

采用电刷镀法制备了Cu／Ni多层膜,对多层膜的摩擦学性能进行了研究。结果表明,电刷镀法制备Cu/Ni多层膜镀层平整、均匀致密、晶粒细小,界面清晰;多层膜的摩擦磨损性能直接由单层膜厚决定:随着单层膜厚的减小,多层膜的摩擦系数减小,磨损形式由磨料磨损逐渐转变为粘着磨损;多层膜的磨损量随单层膜厚的减小而减小,当单层膜厚减小至纳米尺度时,存在一磨损量的最小值;电刷镀 Cu／Ni多层膜的临界单层膜厚约为20 nm。     

纳米粒子在油品中的抗磨性能研究与分析

采用四球试验机研究Cu、Zn(OH)2和PbO3种不同纳米粒子的摩擦性能,探讨纳米粒子在油品中的润滑作用机理。结果表明:纳米粒子在油品中抗磨作用的发挥存在载荷临界点;只有当载荷高于临界载荷时,纳米粒子才能表现出良好的摩擦学性能。