基于循环子空间理论的线性系统测试矩阵优化

研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值.     

机动目标一维距离像RAT法线性化补偿

研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

永磁无刷直流电机驱动器并联系统环流的抑制

驱动器并联方式能有效扩大驱动容量,但该方式容易引入环流。为了抑制环流,分析了两个独立电源供电的两台驱动器并联结构系统,阐述了环流的特性,并提出了基于环流反馈的控制结构。这种控制结构通过环流的反馈,只需要控制调整其中一台驱动器,就可减小两台驱动器输出电压的差异,实现环流抑制。仿真结果表明:这种控制结构降低了控制的复杂性,能够抑制环流,实现独立电源供电的无刷直流电机驱动器并联。     

云南边境地区毒品犯罪特点及对策

当前,云南边境地区毒品犯罪呈现出武装贩毒明显、特殊人群贩毒突出、境内外相互勾结、缅甸籍人员贩毒突出等特点.这源于人们对毒品犯罪的危害认识不足、宣传教育力度不够、受毒品高额利润驱动等原因.要提高打击毒品犯罪实效,必须采取加强综合冶理、完善法律制度、加强区域合作、加强情报调研工作、加大专项打击力度等措施.     

光顺样条函数的再生核表示与计算

光顺样条是散乱数据拟合的理想函数,是噪声数据最优平滑的重要工具。因此,光顺样条的数学表示和计算的研究具有重要的意义。本文在一般的线性微分算子和线性泛函的情况下讨论光顺样条函数的构造和计算,通过构造一个适当的再生核Hilbert空间,使得所讨论的微分算子光顺样条成为该空间中的最小范数问题,再利用投影理论建立了光顺样条函数的再生核表示方法,并得到了插值偏差表达式。作为特例,还给出了奇次多项式光顺样条函数新的简洁的计算方法。     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

模糊-专家控制在智能消磁中的应用研究

综合消磁是处理舰船固定磁性的重要手段.长期以来,由于综合消磁工艺的复杂性,使得这项工作在很大程度上依赖人工.实现消磁自动化,就是要将工作人员从繁重的脑体劳动中解放出来,提高工作效率.目前的新型消磁站已经实现了数据采集、统计自动化,不仅基本免除了工作人员的体力劳动,也从一定程度上减轻了消磁技师的脑力劳动.然而由于需要人工参与决策,综合消磁的效果和效率仍然十分依赖于人的因素.所以,实现综合消磁工作的完全自动化,补偿电流值组合的智能化决策是关键问题.本文在分析以前所做工作的基础上,运用模糊控制理论构造模糊-专家控制器,替代人工决策过程以实现自动化消磁.     

基于自适应累量算法的舰船轴频电场信号检测方法

提出一种新的舰船轴频电场信号检测方法.该方法利用高阶累量对高斯噪声的抑制作用,首先使用基于自适应累量算法的FIR滤波器对接收信号进行滤波消噪处理,以提高信噪比;然后再对滤波输出信号进行滑动功率谱检测.实测数据处理结果表明了该方法的稳健性和有效性.     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008