饱和系统的线性最优容错不变集

针对饱和系统的容错控制问题,提出了一种D稳定约束下系统吸引域的估计方法。分别以不变集和参考集的容量为优化目标,给出了两个优化容错不变集的充分条件。为解决不变集优化中出现的双线性矩阵不等式(BMI)问题,通过构造包含线性矩阵不等式(LMI)的目标函数,将它转化为非线性规划的形式进行求解。通过一个仿真实例对该方法进行验证。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

雷达侦察效能对防空兵群抗击效率的影响评估

从信息化条件下防空作战的实际需要出发,描述了搜索雷达与火控雷达的侦察效能对群抗击效率影响的基本特点,运用概率论和防空兵射击指挥理论,建立了防空兵群分散指挥和集中指挥时,搜索与火控雷达发现目标概率对群抗击效率影响的数学模型,结合实例计算分析了选择射击指挥方式时搜索雷达发现目标概率的临界值。     

基于支持向量机的高空无人机侦察目标识别

针对高空无人侦察机遥感图像目标不明显、图像背景复杂等特点,提出了一种基于支持向量机的目标分类方法。将支持向量机应用于高空无人侦察机的遥感图像目标识别,并且对特征值的提取进行深入研究。实验结果表明,特征值输入的多分类器在识别性能上具有很高的识别率,对提高高空无人机的侦察能力具有重要意义。     

基于直\气复合的再入飞行器操纵耦合分析及鲁椿控制设计

为保证再入飞行器在剧烈变化飞行环境下的控制能力,传统单一气动舵面控制被直＼气复合控制模式取代.性能提升同时,多个参与飞行控制的执行机构之间引起的操纵耦合使系统耦合加剧.以再入飞行器为研究重点,分析了直＼气复合控制模式下的两类操纵耦合原理,建立数学模型.采用动态逆,模糊理论和变结构方法相结合策略设计鲁棒控制器.仿真结果表明该方法是行之有效的.     

防空兵弹药保障计算方法

结合防空作战弹药保障的具体实际,利用概率论和防空作战运筹方法,描述了防空兵弹药保障存在的问题与对策,分析了影响弹药保障的主要因素,提出了防空兵弹药需求量和供应量的计算方法,以及面向作战进程、掩护对象和火力单元的弹药分配量计算方法,结合实例说明了弹药保障计算方法的应用。     

BLT方程在任意布局传输线串扰分析中的应用

应用BLT方程对任意布局传输线间的串扰进行分析.将传输线离散,并引入理想节点的概念计算离散时引入节点的散射参数,将传输线等效为多导体传输线网络进行求解.主要针对非平行线及交叉线两种具有代表性的传输线布局进行分析,数值算例表明了方法的有效性,能够对电磁兼容中的串扰分析提供理论指导.     

面向普适计算应用的构件定义语言UCDL

普适计算的适应性特征对于软件重用的要求决定了构件模型是目前普适计算软件体系结构的理想选择.在面向普适计算的自适应软件平台UbiStar的研究过程中,为了准确地对普适应用中构件的外部特征进行抽象描述,参考了CORBA构件模型使用IDL3和CIDL对构件进行特征抽象的方法,结合UbiStar普适计算平台的特点与需求,提出了一种适用于普适计算环境的构件定义语言UCDL,并且给出了一个应用示例.     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008