Modeling and analysis of a mixed‐model assembly line with stochastic operation times

We consider a mixed‐model assembly line (MMAL) comprised a set of workstations and a conveyor. The workstations are arranged in a serial configuration. The conveyor moves at a constant speed along the workstations. Initial units belonging to different models are successively fed onto the conveyor, and they are moved by the conveyor to pass through the workstations to gradually generate final products. All assembling tasks are manually performed with operation times to be stochastic. An important performance measure of MMALs is overload times that refer to uncompleted operations for operators within their work zones. This paper establishes a method to analyze the expected overload times for MMALs with stochastic operation times. The operation processes of operators form discrete time nonhomogeneous Markov processes with continuous state spaces. For a given daily production schedule, the expected overload times involve in analyzing the Markov processes for finite horizon. Based on some important properties of the performance measure, we propose an efficient approach for calculating the expected overload times. Numerical computations show that the results are very satisfactory. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于交叉熵最小化的 Turbo 码迭代译码停止准则

根据Turbo码最优译码算法及迭代译码的基本原理 ,在保证迭代收敛的条件下 ,利用交叉熵最小化原则推导出Turbo码译码过程中停止迭代的准则 ,并给出了一种降低计算复杂性和减少存贮空间的简化算法 ,最后通过仿真证明了此迭代停止准则及其简化算法的有效性。     

弹道导弹基本诸元的快速装订算法研究

应用牛顿迭代法实现了弹道导弹基本诸元的快速装订。推导了根据落点偏差求飞行程序角和发射方位角的牛顿迭代公式，设计了迭代算法，并给出了实际算例。考虑到迭代算法收敛速度与所给的迭代初值有一定的关系，提出了预先准备简易射表采用反插值算法为牛顿迭代法准备初值的方法，经计算表明可以大大减少迭代次数，从而实现标准弹道的快速设计。     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

常微分方程的割线迭代格式

在常微分方程的数值解法中，Euler的隐式格式稳定性较好，但由于它为隐式，因而给计算带来了极大地不方便。为了解决此问题，本文给出了一种数值解法——常微分方程的割线迭代格式。     

适应保障建设需要 关注信息作战动员

新军事变革与军队信息化建设的发展,尤其是信息化武器装备的研制与发展,对装备保障和作战保障提出了越来越高的要求.而在常备军不断精简、"军民一体化"思想逐步深入之时,对国防动员的需求,特别是对信息作战动员的建设与发展的需求与日俱增.因此,在提出信息作战动员的基本内涵的基础上,结合国内外信息作战动员的发展现状,对如何有效实施信息作战动员提出几点看法.     

潜艇兵力作战方案选优软件的设计与实现

对联合封锁中潜艇兵力作战方案选优问题进行了研究,针对在只有一个选优指标时,人们通过比较分析法能够容易地准确判别方案优劣的特点,综合采用了改进的层次分析法、模糊综合评判等方法设计并实现了方案的选优。通过验证,该软件在应用于作战方案多目标决策等复杂系统时是适用的和可靠的,并且此软件较为简便,可操作性强。     

多载波码分多址在低密度二分图上的建模与分析

多载波码分多址是移动通信重要的多址技术之一,传统方法将扩频序列的构造和多用户检测单独考虑,未能做到发射机和接收机的一体化设计。受到低密度奇偶校验码的启发,基于图论建立多载波码分多址收发机模型,采用二分图定义码片和数据符号间的扩频关系。在此基础上,利用适合低密度二分图的消息传递算法完成多用户迭代检测,推导并分析洪水消息传递和串行消息传递两种检测机制。仿真结果表明,当传统的多载波码分多址系统陷入严重过载而不能正常通信的情况下,基于低密度二分图的多载波码分多址系统依然能够达到理想的传输性能,为下一代移动通信系统的设计提供了有益的参考。     

海警部队参与海上反恐作战的思考

随着各国加强对空中和陆地恐怖主义的防控，恐怖主义把视角转向海上。海上恐怖主义具有事件的突发性、手段的多样性、处置的复杂性等特点。边防海警部队参与海上反恐作战有利于取得海上反恐斗争的胜利，有利于掌握海上反恐主动权，有利于顺应国际海上反恐斗争的形势。针对海上恐怖主义的特点，边防海警部队应做到以下几点：一是平时反恐作战准备应具有超前性，二是参与海上反恐作战应体现实效性，三是参与海上反恐作战应把握全局性。     

武器控制系统战斗有效性分析

分析了武器控制系统对机载武器系统战斗有效性的影响因素,定量描述了各影响因素,给出了影响战斗有效性程度的指数,并研究了其计算的方法。根据计算结果,得到了战斗有效性的损失变化范围,这一变化范围可作为评价武器控制系统优劣的重要依据,最后给出了具体算例和说明。