A novel facial emotion recognition scheme based on graph mining

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. To reduce the number of generated sub-graphs, overlap ratio metric is utilized for this purpose. After encoding the final selected sub-graphs, binary classification is then applied to classify the emotion of the queried input facial image using six levels of classification. Binary cat swarm intelligence is applied within each level of classification to select proper sub-graphs that give the highest accuracy in that level. Different experiments have been conducted using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the final system accuracy was 90.00%. The results show significant accuracy improvements (about 2%) by the proposed system in comparison to current published works in SAVEE database.     

关于地球坐标系中机械能守恒问题

在只考虑地球自转时,地球坐标系中质点和质点组的机械能守恒定律依然成立。     

基于RBF神经网络的HPA自适应预失真算法

卫星通信中,高速数据传输系统要求使用频谱利用率高的高阶调制技术,但高阶调制对高功率放大器(HPA)的非线性非常敏感,会造成码间干扰和邻信道间干扰.提出一种基于RBF神经网络的自适应预失真算法,以实现HPA的线性化,同时推导了自适应算法的迭代公式.仿真结果表明,该算法能明显改善信号星座图,并能大大提高系统的误比特率性能.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

带落角约束的再入机动弹头的复合导引律

针对再入机动弹头垂直打击目标的要求,研究了具有末端落角约束的复合导引律.该导引律包括俯冲平面内的制导方程和转弯平面内的制导方程,通过在最优导引律的基础上引入滑模变结构控制,增强导引律的鲁棒性.为了减小控制量的抖振和能量损耗,提出了采用RBF(径向基函数)神经网络自适应调节切换项增益的方案,数学仿真验证了该方案的有效性.仿真结果还表明,与最优导引律相比,复合导引律在外界干扰的影响下仍能保持较高的制导精度.     

Network reliability assessment in a random environment

In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

舰炮弹道估计的卡尔曼滤波算法

针对舰炮弹道观测校正中的弹道最佳估计问题,提出了转换卡尔曼滤波算法,在三维空间里对观测弹丸飞行轨迹进行滤波,估计最佳弹道。给出了具体的算法并用某型海军舰炮进行了仿真,取得了较好效果。     

军事网络拓扑搜索

叙述了军用网络拓扑发现的特点和存在问题,军用网络拓扑发现的算法分两步:第一步,主干网络级,以路由器为主的网络主构架拓扑发现,给出了实现算法的数据结构和流程图;第二步,子网内拓扑发现,子网发现利用网桥管理对象组的信息,给出以交换机为骨架的子网拓扑,给出了子网拓扑发现算法。对开发网络拓扑发现软件有参考价值。     

Hopfield神经网络的防空火力最优分配问题

火力的最优分配是作战计划的重要内容,它包含火力单位特性、目标单位特性、最优准则、射击条件四个方面的内容。简要介绍了Hopfield神经网络的基础知识,建立了防空自动化指挥系统中火力分配的Hopfield神经网络算法一般模型,在此基础上,阐述了利用该算法在火力分配中的一般应用,并通过在计算机上借助C语言编程实现了这一模型,得出了一种比较合理可行的火力分配方案。