ISO900O族标准在装甲车辆维修质量管理中的应用

首先,分析了装甲车辆维修质量管理的现状和存在的问题。根据装甲车辆维修工作内容和特点,结合ISO9000族国际标准,提出了建立装甲车辆维修质量管理体系模式。主要强调了以过程控制为主,为提高装甲车辆维修质量管理提供了有效的理论指导方法。     

蚁群算法在光电载荷标校中的应用

针对空中平台光电载荷安装误差的梗准问题,提出了一种利用蚁群算法实现动态标校的方法.通过光电裁荷测量得到的目标方位角、俯仰角和平台导航信息,结合GPs转化得到的方位角、俯仰角真值,建立了基于最优估计理论的目标函数,并利用蚁群算法求得了系统的安装误差.通过蒙特卡洛模拟仿真,验证了该方法能够较为准确地标定出安装误差;通过校准,有效避免了由安装误差引起的结果有偏,使得目标跟踪结果收敛至真值附近.     

扭力矩对曲折槽保险机构动力学响应影响分析

在考虑扭力矩作用的基础上,建立曲折槽保险机构的动力学模型,以某机构为计算实例,与传统的动力学模型进行比较。数值计算结果表明：引信跌落到硬质地面时,扭力矩的影响作用不明显,而跌落到松软地面上时扭力矩使惯性简的位移响应明显增大,不能忽略。其结论为判断长储引信勤务处理意外跌落的安全状态提供了理论参考。     

随机动态规划的混合算法研究

针对随机条件下动态规划模型的主要特点,运用智能算法混合编程理论,设计了一种探索多阶段决策问题的智能混合算法.该算法首先将问题转化成一族同类型的一步决策子问题,然后利用随机模拟和遗传算法,依据训练样本形成的训练神经元网络,在单步决策中寻求最优策略和最优目标值,逐个求解,再据初始状态逆序求出最优策略序列和最优目标值.仿真结果表明,该算法具有一定的通用性,初始设计点可以随机产生,其计算精度不因函数的非线性强弱而受影响,对目标和约束的限制较少,可应用于多种形式的随机多阶段决策优化问题,较好地满足了随机动态规划模型求解和优化的要求.     

一种基于AMDF和ACF的基音周期提取算法研究

文中提出一种基于短时平均幅度差分函数(AMDF)和短时自相关函数(ACF)的基音周期提取算法。首先,将每帧语音信号通过AMDF算法进行计算,然后把得到的AMDF数值再通过ACF算法进行计算,得出每帧信号的基音周期,最后运用动态平滑技术计算出最终语音信号的基音周期。通过仿真实现该算法,并同基于MAMDF和ACF的基音周期提取算法进行比较。     

认知无线电与频谱管理

当前的频谱管理采用固定频谱分配策略,频谱资源被分配给固定的授权用户,从而造成了频谱资源的浪费。认知无线电技术是一种智能无线电通信技术,它能够大幅度提高系统的频谱利用率,有效解决目前的频谱资源匮乏问题。因此,认知无线电技术的出现必将对现有的频谱管理策略产生一定的影响。文中主要介绍了认知无线电的基本概念和频谱管理技术,并对认知无线电下的频谱管理提出了一些看法和建议。     

Quality risk in outsourcing: Noncontractible product quality and private quality cost information

This article addresses the concept of quality risk in outsourcing. Recent trends in outsourcing extend a contract manufacturer's (CM's) responsibility to several functional areas, such as research and development and design in addition to manufacturing. This trend enables an original equipment manufacturer (OEM) to focus on sales and pricing of its product. However, increasing CM responsibilities also suggest that the OEM's product quality is mainly determined by its CM. We identify two factors that cause quality risk in this outsourcing relationship. First, the CM and the OEM may not be able to contract on quality; second, the OEM may not know the cost of quality to the CM. We characterize the effects of these two quality risk factors on the firms' profits and on the resulting product quality. We determine how the OEM's pricing strategy affects quality risk. We show, for example, that the effect of noncontractible quality is higher than the effect of private quality cost information when the OEM sets the sales price after observing the product's quality. We also show that committing to a sales price mitigates the adverse effect of quality risk. To obtain these results, we develop and analyze a three‐stage decision model. This model is also used to understand the impact of recent information technologies on profits and product quality. For example, we provide a decision tree that an OEM can use in deciding whether to invest in an enterprise‐wide quality management system that enables accounting of quality‐related activities across the supply chain. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Locational tying of complementary retail items

We study a selling practice that we refer to as locational tying (LT), which seems to be gaining wide popularity among retailers. Under this strategy, a retailer “locationally ties” two complementary items that we denote by “primary” and “secondary.” The retailer sells the primary item in an appropriate “department” of his or her store. To stimulate demand, the secondary item is offered in the primary item's department, where it is displayed in very close proximity to the primary item. We consider two variations of LT: In the multilocation tying strategy (LT‐M), the secondary item is offered in its appropriate department in addition to the primary item's department, whereas in the single‐location tying strategy (LT‐S), it is offered only in the primary item's location. We compare these LT strategies to the traditional independent components (IC) strategy, in which the two items are sold independently (each in its own department), but the pricing/inventory decisions can be centralized (IC‐C) or decentralized (IC‐D). Assuming ample inventory, we compare and provide a ranking of the optimal prices of the four strategies. The main insight from this comparison is that relative to IC‐D, LT decreases the price of the primary item and adjusts the price of the secondary item up or down depending on its popularity in the primary item's department. We also perform a comparative statics analysis on the effect of demand and cost parameters on the optimal prices of various strategies, and identify the conditions that favor one strategy over others in terms of profitability. Then we study inventory decisions in LT under exogenous pricing by developing a model that accounts for the effect of the primary item's stock‐outs on the secondary item's demand. We find that, relative to IC‐D, LT increases the inventory level of the primary item. We also link the profitability of different strategies to the trade‐off between the increase in demand volume of the secondary item as a result of LT and the potential increase in inventory costs due to decentralizing the inventory of the secondary item. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009