基于数据库的电子对抗作战效能分析系统的设计

介绍了基于数据库的电子对抗作战效能分析系统设计的基本思路.系统采用模块化设计,指挥员可根据不同需要添加或删减模块以达到自己的目的.同时,系统采用了双缓冲读取数据机制,很好地解决了仿真推演所需数据量大与电子对抗作战态势实时显示之间的矛盾,将无形的电磁态势以形象直观的形式显现出来,有助于指挥员加深对电子对抗这种作战手段的理解、战术的运用以及辅助作出正确的决策.     

固体热容激光器温度场应力场分析

采用有限元分析方法,对Nd:YAG作为激活介质的固体热容激光器的温度场及应力场进行了研究.结果表明固体热容激光器的温度场、应力场与常规的固体激光器有很大的差异,常规的固体激光器激活介质必须在泵浦的同时进行冷却,晶体表面温度比中心温度低,晶体表面受到的是张应力.固体热容激光器发射激光时,激活介质处于绝热状态.激活介质表面的温度要比中心高,激活介质表面出现的是压应力.这种差异是固体热容激光器可以高功率运转的物理机制.     

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

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

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

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

二部图的(g,f)匹配

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

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

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

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.     

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.     

Dynamic coordination of production planning and sales admission control in the presence of a spot market

We consider the decision‐making problem of dynamically scheduling the production of a single make‐to stock (MTS) product in connection with the product's concurrent sales in a spot market and a long‐term supply channel. The spot market is run by a business to business (B2B) online exchange, whereas the long‐term channel is established by a structured contract. The product's price in the spot market is exogenous, evolves as a continuous time Markov chain, and affects demand, which arrives sequentially as a Markov‐modulated Poisson process (MMPP). The manufacturer is obliged to fulfill demand in the long‐term channel, but is able to rein in sales in the spot market. This is a significant strategic decision for a manufacturer in entering a favorable contract. The profitability of the contract must be evaluated by optimal performance. The current problem, therefore, arises as a prerequisite to exploring contracting strategies. We reveal that the optimal strategy of coordinating production and sales is structured by the spot price dependent on the base stock and sell‐down thresholds. Moreover, we can exploit the structural properties of the optimal strategy to conceive an efficient algorithm. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010