模糊时滞系统控制器依赖于状态时滞的H∞控制

针对一类非线性时滞系统,研究了该系统基于T—S模糊模型的H∞控制器设计问题。采用线性矩阵不等式LMI的方法,设计一个依赖于状态时滞的模糊控制器,得到了系统存在模糊控制器的充分条件,此充分条件等价于一类线性矩阵不等式的可解性,最后通过仿真说明了控制器的有效性。     

Designing and pricing menus of extended warranty contracts

Extended warranties provide “piece of mind” to a consumer in that product failures which occur after the base warranty expires are rectified at little or no cost. They also provide an additional source of revenue for manufacturers or third‐party providers, such as retailers or insurance providers, and help cultivate consumer loyalty. In this article, we analyze a number of extended warranty contracts which differ in design, including restrictions on deferrals and renewals. With the use of dynamic programming, we compute the optimal strategy for a consumer with perfect information and determine the optimal pricing policy for the provider given the consumer's risk characterization. We also provide insight into when different contracts should be issued. Finally, we illustrate how profits can be dramatically increased by offering menus of warranty contracts, as opposed to stand alone contracts, with the use of integer programming. Surprisingly, risk‐taking consumers provide the greatest benefit to offering menus. These insights can help a company develop a comprehensive warranty planning strategy for given products or product lines. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于DSP平台的H.324系统研究与实现

在分析H.324系统中双向视音频编解码所需要的运算量和存储容量的基础上,选择两片高速DSP芯片TMS320VC5509,合理分配资源,对视频编解码中关键代码进行优化,设计和实现了双向视音频编解码的实时H.324系统。特别是在定点DSP上采用了整数变换代替浮点DCT,消除了浮点运算,减少了运算量,给出了实验结果。     

Optimal switchover times between two activities utilizing the same resource

The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008     

基于进化规划的RBF网络用于二相码旁瓣优化

研究了低截获概率技术中常用的二相编码信号处理中的距离旁瓣压缩问题,采用改进的进化规划算法优化径向基函数网络,提出了一种基于改进进化规划算法的计算方法。通过对13位巴克码和31位M编码的仿真实验,表明新的方法在旁瓣抑制能力和运算速度等性能方面,都有较大的提高。     

系泊系统动力学特性的研究进展

综述了系泊系统动力学特性的研究现状和方法 ,讨论了所存在的问题及发展趋势 .     

一类非线性控制系统模型的数学分析

采用非线性分析的方法,研究了一类非线性控制系统模型,得到解的整体存在性。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008