航空电子多总线记录系统的设计与实现

讨论了某型航空电子设备的数据记录系统的设计与实现 ,主要探讨了此系统的软、硬件开发 ,系统组成及其信息流。系统采用了 ARINC4 2 9总线和并行总线 ,将各个子系统连接起来 ,实现数据的综合处理、综合控制、综合传输 ,在实际应用中收到了很好的效果     

基于对象的有色Petri网舰载C3I系统模型

将面向对象的分析方法和有色Petri网相结合而得到的对象有色Petri网(OCPN),将会为研究舰载C3I系统提供一种有力的工具.通过分析舰载C3I系统组成和相互关系,建立了舰载C3I系统的OCPN模型,并讨论了该模型的特点和在舰载C3I系统性能分析领域中的应用前景.     

军事训练中学员发生运动性晕厥的原因与机理分析

采取问卷调查、跟踪观察等方法,通过对运动性晕厥发生的不同种类进行分析研究,指出产生的原因,分析发病的机理,提出预防的措施,为有效防止运动性晕厥的发生提供科学依据。     

GPS与其他数字系统的共存问题

现代飞行器配备多种电子系统工作在复杂的电磁环境中,需要解决各系统兼容的问题.因此,在理论上分析了窄带数字系统、宽带CDMA系统、超宽带系统对GPS系统影响,然后讨论了解决方案,最后给出仿真结果.     

Tripwires and free-riders: Do forward-deployed U.S. troops reduce the willingness of host-country citizens to fight for their country?

This article investigates the relationship between U.S. overseas troops and the willingness of the citizens of host states to fight for their country. The study joins the long-running debate about burden-sharing and free-riding among U.S. allies. Unlike most previous empirical studies, we focus on non-material or intangible measures of the underlying concepts. Our dependent variable estimates the proportion of citizens expressing a willingness to fight for their country. Scores at the aggregate-national as well as the individual level are shaped by the presence of U.S. military forces, which act as a “tripwire” signaling credible security commitments. This increases opportunities of (non-material) free-riding. We present both bivariate and multivariate analyses covering the period 1981–2014 to test this supposition. Findings indicate that once U.S. troop levels reach a certain threshold (between 100 and 500 troops), citizens’ willingness to fight drops significantly. This likely reflects non-material free-riding.     

基于熵的地磁匹配定位算法

地磁匹配定位是近年来发展起来的新技术,针对地磁匹配定位中的匹配算法问题,引入了熵的概念,定义了地磁信息熵和地磁差异熵,提出了地磁信息熵和地磁差异熵综合的匹配算法,详细分析了其基本原理和实现过程。仿真实验表明,地磁熵算法的匹配误差并不随实时数据测量误差的增加而增加,该算法计算速度快、具有良好的抗测量误差干扰的能力,符合匹配精度和速度的要求。     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

浅析唐朝军事行政法的借鉴价值

唐朝进行了大规模的军事立法活动,形成了较为完备的军事法律制度,其中军事行政法律制度在整个军事法律体系中占有相当重要的位置。虽然它没有现代军事行政法律制度完善,但作为当时世界上国力强大的王朝,在军事行政法制上仍然有值得借鉴的地方。     

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