离散 Hartley 变换的 MIMD 并行算法

本文把长为N=N_1N_2(N_1为奇数)的离散Hartley变换(DHT)分解成N_1个长N_2的DHT及一些附加运算,附加运算也可以变成N_2个长N_1的DHT。由此得到计算它的一种MIMD并行算法,若用N_1台处理机并行计算,只需(?)个乘法步和(?)个加法步,这里M(N_2)和A(N_2)分别表示计算一个长N_2的DHT所需的乘法数及加法数。并行机的有效利用率接近于1。     

混合对策无人战机空战决策

在混合对策理论的基础上,将空战过程看作是由一系列离散的状态组成的离散事件动态系统,建立了空战过程的离散状态子模型,利用空战态势指数和战机空战能力指数构造了战术评估函数,以完成对战术动作的筛选工作,并结合3DOF质点模型设计了机动指令生成器,实现对无人机运动状态的控制,并在Matlab环境下对机动实例进行了仿真.     

基于神经网络的离散变结构控制系统

系统研究了基于神经网络的离散变结构控制系统设计方法,提出了几种具体设计方案.神经网络的引入可以使滑模(变结构)控制具备学习与自适应能力,使控制信号得以柔化,从而能够减轻或避免困扰常规滑模控制器的抖振现象,改善控制效果.     

环形区域极点/协方差约束下的模型简化设计

提出离散随机系统模型简化的一种新方法,即环形区域极点／协方差约束下的模型简化方法。这种设计方法的基本思路是构造指定维数的降阶模型,使其匹配给定的环形区域极点和稳态协方差参数,在系统的动态特性和稳态特性方面逼近给定的满阶模型。文中导出了期望的简化模型的存在条件及解析表达式,并提供了一个数值算例。     

基于Petri网的近程防空武器射击建模

提出一种扩展时延Petri网,新提出的Petri网与以往高级时延Petri网的不同之处在于它允许个体的个性与共性同样得到考虑。这种方法被用来对装备多跟踪装置、多种对空武器的防空系统对多目标进行射击过程进行建模、分析、模型的正确性在文章最后的仿真中得到了验证。     

DFT的Z变换算法

文中讨论了用Z变换计算DFT的方法。对于N=2~t的DFT,本算法所需的加法及乘法量分别为:(?),与Cooley-Tukey基-2算法比较,乘法量与加法量均减少25%,文中还讨论了本算法在微机上的实现,给出流程图。在运算时间上,本算法与通用FFT算法程序进行比较:节省时间30%。     

Constructing a strict total order for alternatives characterized by multiple criteria: An extension

The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

离散变结构控制理论研究现状与展望

对离散变结构控制理论的研究进展进行综述,总结了3种主要的DVSC方案,讨论了这一领域中存在的重要问题,并指出了该理论未来可能的研究方向.     

离散变速趋近律抖振机理及鲁棒性研究

研究基于离散变速趋近律的变结构控制设计问题.利用不等式形式到达条件研究变速趋近律的抖振机理,并对其鲁棒性进行分析.研究结果表明,只要不确定因素有界,即可保证闭环系统的鲁棒稳定性,而通过调整变速趋近律自身参数,可以避免抖振并使系统具有良好的动态品质.将理论成果用于某型船舶航向自动舵的设计,实验结果证实了它的有效性.