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.     

基于粒子群优化的稀疏分解最优匹配原子搜索算法

信号的稀疏分解能得到信号的稀疏表示形式,便于进一步处理,但其计算非常复杂,是一个NP问题.粒子群优化是群体智能优化算法,算法简单,易于实现,且搜索效果好.把粒子群优化算法用于稀疏分解的最优匹配原子的搜索,能降低稀疏分解复杂度,同时减少稀疏分解的超完备字典对存储空间的占用,以提高用稀疏分解理论进行信号处理的计算效率,满足或接近实时性的要求.实验证明,此方法切实可行.     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

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

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

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

基于多Agent的编队导弹攻击火力分配的优化研究

目前解决火力分配优化问题的更多的是运用静态的数学模型,忽略了作战是一个激烈对抗的过程.为了更全面地研究编队导弹攻击分配的优化问题,提出了一种基于多Agent的编队导弹攻击火力分配仿真优化研究的方法.首先建立了舰艇Agent的模型,研究了Agent的演化模型,建立了基于Agent的火力分配的优化模型.通过Agent自身的演化,从而达到整个编队导弹攻击的火力分配决策的优化目的.最后给出了仿真试验,对仿真结果数据的分析,验证了方法的可行性.     

舰载直升机兵力使用方案优化建模与仿真

依据舰载直升机兵力使用计划活动的思维机制,分析了计划活动中所涉及的各种主要因素,采用定量与定性分析相结合的方法,建立了兵力使用方案优化的益损值模型,并以舰载直升机反潜作战样式为例,采用软件编程方式实现了该模型,实例表明该方法可为决策者做出科学、有效的决策提供支持。     

改进粒子群算法在导弹火力分配中的应用

粒子群优化算法是一种新兴的优化技术,思想来源于人工生命和演化计算理论.由于该算法简单易实现,可调参数少,目前已得到广泛研究和应用.在建立导弹武器火力分配数学模型的基础上,运用改进粒子群算法对模型进行了最优化求解,实例的计算结果表明该优化算法对于模型的求解具有较好的收敛性.     

一种基于SVM的炮位校射雷达弹道外推新方法

SVM是一种理论依据充分的机器学习新算法,主要用于对有限个样本的分类识别和回归建模.将一条弹道视为一个训练样本,利用SVM回归方法在不同弹道之间归纳弹道落点的规律,从而可以对未知弹道的落点进行预测.将SVM引入弹道外推是重要创新,构建具有代表性的训练样本,以及统一样本空间维数等是技术创新.仿真实验表明,SVM可以提高弹道外推精度,同时缩短外推时间.     

基于改进整型遗传算法的稀疏矩形平面阵列优化

为了降低固定稀疏率、固定孔径的稀疏矩形阵列的峰值旁瓣电平,提出一种改进整型遗传算法。该算法在整型遗传算法的基础上,提出了等间隔采样的交叉策略、多点变异策略以及优良基因重组的策略。采取等间隔采样的基因交叉方式,可以有效发挥整型编码的优势,从而提高算法的运行效率;为了提高种群的多样性,防止算法陷入局部最优,采用了多点变异策略;采用优良基因重组技术,加快了算法的收敛速度。仿真结果表明,相比传统的二进制和实数编码,整型编码更为直接高效;与用于稀疏矩形阵列优化的相关算法相比,本文所提算法获得了更优的旁瓣电平,证实了算法的有效性和优越性。