Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

二值化联合变换相关器识别复杂背景目标时的阈值选取

讨论了利用二值化联合变换相关器对复杂背景目标进行相关识别的阈值选取问题。由于不同阈值对二值化联合变换相关器识别结果有很大的影响,阈值过高,会损失过多的联合变换功率谱中的有效成份,使相关峰减弱;阈值过低,会使联合功率谱中的噪声放大,相关峰可能被淹没在噪声之中。因而存在一个最佳阈值。实验表明,最佳阈值位于联合功率谱最大灰度值的40%～50%之间,在此阈值范围内,相关峰值较高,噪声也得到有效抑制。     

利用FFT算法模拟联合变换相关器

由于联合变换相关器结构灵活,易于实现相关运算,目前在诸多领域得到了广泛的应用。实际应用中,联合变换相关器的光学系统带来的噪声会对识别效果产生较大的影响。采用快速傅里叶变换算法,由计算机模拟光学联合变换相关器可消除光学系统带来的噪声,达到理想的识别效果。通过实验验证了该方法的可行性。     

军队干部交流分配模型研究

针对军队干部交流分配常常采用定性方法的现状,结合每年都要交流大量干部的实际情况,在可行、合理交流的基础上,综合利用Delphi法、系统分解与协调法建立了干部交流分配模型,从而实现了干部在各种类别之间的交流,为军队干部的交流分配提供了定量依据.     

面向容侵的秘密共享系统的设计

针对Intemet服务器间安全连接所使用的会话密钥面临的威胁,利用秘密共享理论,结合Shamir有限域Zp中的多项式方程,提出面向容侵的(w,t)丁限设计方案.此方案是将会话密钥K分成W个子密钥,并秘密存储在不同的共享服务器中,若恢复会话密钥K,只需W个子密钥中的t个子密钥.而入侵者得到t个子密钥要比得到一个会话密钥更难,因此系统具有一定容侵功能,以保证会话密钥的安全.从结构、协议工作和特点等方面加以描述,并对安全性作了分析.初步建立了基于(w,t)秘密共享理论的网络容侵模型.     

专业课中加强新装备教学初探

对专业课中加强新装备教学的意义、方法及其规律进行了初探.重点讨论了专业课教学中如何根据新装备的特点,结合多种教学方法和手段,从基本原理、仪器结构、性能特点和实际应用等方面,提高教学质量和效率的体会与认识.     

现代条件下的价值创造与价值分配

从现代条件下劳动领域的扩展和劳动形态的变化出发 ,说明价值创造和价值分配的内在联系 ,同时指出 ,价值分配又不完全取决于价值创造 ,还受产权制度等因素的约束 ,并联系我国目前分配制度改革的实践 ,为收入理论创新寻找突破口     

国外GPS/INS复合制导技术的发展

在分别介绍国外惯性导航系统(INS)和全球定位系统(GPS)的基础上,着重叙述了在导弹和其他武器装备中广泛使用的GPS / INS复合制导技术的发展概况.     

从"误伤事件"原因分析,看战术数据链战略地位

以伊拉克战争为背景,介绍了美军及北约的战术数据链发展情况、技术概要,重点论述了不同时期的战术数据链在技术体制上的差异,以及由此可能导致互联、互通和互操作的分析.最后,结合我军的一些现状,在汲取外军教训的基础上,提出我军在战术数据链建设方面的一些建议.