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的线性化,同时推导了自适应算法的迭代公式.仿真结果表明,该算法能明显改善信号星座图,并能大大提高系统的误比特率性能.     

What you should know about location modeling

Facility location models have been applied to problems in the public and private sectors for years. In this article, the author first presents a taxonomy of location problems based on the underlying space in which the problem is embedded. The article illustrates problems from each part of the taxonomy with an emphasis on discrete location problems. Selected recent research in the area is also discussed. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

What you should know about simulation and derivatives

Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 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