二部图的(g,f)匹配

本文证明了二部图存在(g,f)匹配和f 因子的充要条件以及有关的几个结果,并且给出了求二部图的最大(g,f)匹配、最小(g,f)匹配和最小权最大f 匹配、最小权(g,f)匹配、最大权(g,f)匹配的算法。     

大肠杆菌转录起始位点的计算定位方法

根据已有的启动子识别算法,提出了一种基于滑动窗口的大肠杆菌转录起始位点(TSS)计算定位方法,通过在启动子信号特征中引入复合模式来改进识别分类器,并将其用于滑动窗口序列,在合理限定的TSS定位范围内依次计算各个序列位置的TSS似然得分,再利用TSS与翻译起始位点(TLS)的距离分布信息作为TSS的位置得分,两者相结合来进行位置预测。对大肠杆菌真实数据的测试表明,算法可以大幅度减少假阳性结果,实现对真实TSS位置的有效预测。     

无人机避障航路规划方法研究综述

随着无人机作业空域从中高空不断向低空甚至超低空拓展,复杂的低空障碍环境对无人机造成了严重的威胁。研究无人机避障航路规划理论与方法,对于保障无人机的飞行安全和提升其任务效率具有重要作用。对无人机避障航路规划方法的研究现状进行了梳理,首先,根据航路规划问题所建立的优化模型,将规划方法划分为基于数学规划的方法、基于路标图的方法、基于空间分解的方法、基于势场的方法、基于随机规划的方法和基于机器学习的方法六个大类。然后,分别介绍了各类型方法的基本原理、代表性研究以及优缺点。最后,对避障航路规划方法未来可能的研究方向进行了展望。综述表明,复杂环境下无人机三维航路规划方法的研究仍有提升空间;未来应考虑将传统规划方法与新一代人工智能技术相结合;航路规划方法研究应充分考虑机载传感器的实际性能和工作特性;规划航路的可跟踪性问题也亟待解决。     

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.     

新型硫代双烯镍络合物合成及其对菁染料的光稳定作用

在合成中间体二(4-叔丁基苯基)羟乙酮基础上,进一步合成了双(1,2-二(4-叔丁基苯基)-1,2-二硫代双烯)镍络合物(DYE-02),利用核磁共振氢谱、红外光谱和元素分析等方法对中间体及DYE-02的结构进行了表征,并研究了DYE-02自身的光稳定性能及其对菁染料(Cy7)的光稳定作用.结果表明,与双(1,2-二苯基-1,2-二硫代双烯)镍络合物(DYE-01)相比,苯环上引入叔丁基后,DYE-02的最大近红外吸收波长在885nm,发生明显的红移,具备更好的自身光稳定性,并且能明显提高菁染料的光稳定性.     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

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     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

虚拟战场环境生成及关键技术

虚拟战场环境是军用仿真的一个重要基础平台,分析了该环境的构成结构,提出了场景可视化的实现流程,重点探讨了其中的地形建模和简化、实体和行为建模、特殊效果生成、视点控制与切换等几项关键技术,提出了解决这些技术的主要方法和步骤,并已在PC机上完成了上述算法,为进一步研究打下了良好基础.     

计算机辅助加工工件变形分析方法研究

为迅速、准确、合理地确定切削加工的工艺参数 ,将有限元方法、人工神经网络和遗传算法运用于计算机辅助加工工件变形分析中。通过合理的系统设计 ,实现了对工件切削加工变形量的准确预报和对加工参数的正确优化。实际生产证明 ,采用本方法优化确定加工参数 ,达到了预期的迅速、准确、合理的目标 ,有效地降低生产成本 ,提高生产率