基于故障树分析的航空装备体系结构贡献率评估方法

针对航空装备体系构成复杂的特点,将故障树分析引入航空装备体系结构贡献率评估问题,提出基于故障树分析的评估方法.从作战装备、信息支援装备和保障装备三个方面构建航空装备体系结构,建造航空装备体系结构故障树;采用底事件的关键重要度指标来计算航空装备的体系结构贡献率,建立基于关键重要度的航空装备体系结构贡献率评估模型;以某航空...     

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

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

非致命防暴动能弹作战效能评估

提出了非致命防暴动能弹作战效能的评估法,分析了非致命防暴动能弹的技术性能,建立了以非致命性为核心指标的防暴动能弹效能指标体系。采用定性分析与定量分析相结合,将集对分析法应用到了非致命防暴动能弹的效能评估中,对3种防暴动能弹进行了效能评估。为非致命防暴动能弹的研发生产提供了重要的理论支撑。     

二部图的(g,f)匹配

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

多管火箭武器储运发射箱长期储存蠕变性能预测

为探究火箭武器储运发射箱长期储存的蠕变性能,制备复合材料层压板并开展单轴拉伸蠕变试验,获得了单向纤维复合材料主方向的蠕变本构模型参数。采用有限元方法并借助用户自定义材料子程序建立储运发射箱长期储存蠕变的数值分析模型,预测了堆码储存15年后底层发射箱的蠕变变形。以储存后的发射箱作为初始状态建立弹管耦合发射动力学仿真计算模型,进一步分析蠕变对火箭弹发射过程的影响。仿真结果表明:蠕变引起的定向器平行度和发射箱底面平面度的变化均小于技术指标规定值,定向器束的最大残余变形在三维空间内呈马鞍状分布,上、下两行中间位置定向器的变形最大,左、右两列中间位置定向器的变形最小。定向器蠕变变形使得弹管间隙减小,火箭弹在管内运动使弹管之间的动态接触碰撞力增大,离轨速度降低。     

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

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

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.     

Physical and damping properties of kenaf fibre filled natural rubber/thermoplastic polyurethane composites

The paper presents the investigation of the effect of alkaline treatment of sodium hydroxide (NaOH) on physical and dynamic mechanical analysis (DMA) viscoelastic properties of kenaf fibre filled natural rubber (NR)/thermoplastic polyurethane (TPU) composites. The treated kenaf fiber, NR and TPU were weighed and proportioned according to the required compositions and were blended using hot mixed Brabender machine. The polymer composites were then fabricated using the hot press to form a sample board. The sample was cut and prepared and water absorption, density, thickness swelling and DMA tests were performed. As far as physical properties are concerned, composites with the highest NR amount of shows the best results, which indicates good fiber bonding adhesion. The polymer composites with the highest amount of TPU shows the highest damping properties at high temperature.     

The Organization of the Defense Support System: An Economic Geography Perspective

In the context of restricted budgetary resources and the growing cost of maintenance, repair, and overhaul (MRO) activities, a major issue for modern armed forces is to sustain defense platforms. A possible method consists of realizing economies of scale through the concentration of maintenance activities, which involves the spatial reorganization of existing industrial sites dedicated to MRO. This article provides a formalized framework to discuss the optimal organization for the MRO of defense platforms in space. The public planner organizes the maintenance of defense platforms with only two possible spatial configurations. In the dispersed configuration, two industrial production units in charge of the maintenance optimally cover space, whereas in the concentrated configuration, a unique industrial unit covers space. Focusing on the tipping point between the two configurations, the balance of forces between agglomeration and dispersion in defense support activities is described and discussed. On the one hand, economies of scale provide an opportunity to optimize defense support costs, favoring concentration in a unique industrial unit. On the other hand, space causes dispersion to reduce both transport costs and operational social costs. This trade-off illustrates a general principle in spatial economics with an application to MRO production in the French case.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.