基于改进遗传算法的平流层飞艇定点悬停控制(英文)

平流层飞艇定点悬停控制是飞艇应用领域的关键技术。该控制问题可以转化为非线性多目标优化问题来求解。遗传算法是解决现代非线性多目标优化问题的一种重要方法。但是基本遗传算法在解决定点悬停飞艇实际控制问题时,具有易陷入局部最优解、在遗传进化过程中随机性较强、搜索效率低下及耗时多等缺陷。通过借鉴并行遗传算法、模拟退火算法和向量评价遗传算法的基本思想,在基本遗传操作中添加切断算子和拼接算子,设计一种改进遗传算法来改善上述缺陷。仿真结果表明该方法是有效可行的。     

智能化电子对抗装备发展

当前,智能化武器装备成为世界各国发展的重点,而电子对抗作为新型作战力量将直接影响战争的胜负。文章分析当前电子对抗装备存在的显著不足,论证发展智能化电子对抗装备的迫切性和必要性,明确提出发展智能化电子对抗装备的若干关键技术,阐述智能化电子对抗装备对未来信息化战争的直接影响,以及智能化电子对抗装备未来的发展方向。     

基于无线双工通信系统分组数据传输的探讨

分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网（电路交换网、分组交换网）、数字化部队单工无线电数据网互联的关键技术。     

Empirical Biases and Some Remedies in Estimating the Effects of Selective Reenlistment Bonuses on Reenlistment Rates

Researchers have, for decades, been attempting to estimate the effects of Selective Reenlistment Bonuses (SRBs) on the probability of reenlistment for the military services. SRBs are targeted to specific military occupations for which reenlistment rates are lower (or expected to be lower) than what is needed. This article first identifies four primary sources of biases affecting these models: reverse causality from supply shifts (a negative bias), the endogeneity of the decision point causing coded SRBs to be higher for reenlisters than leavers (a positive bias), measurement error (a likely negative bias), and excess supply preventing the full effect of an SRB change to materialize (a positive or negative bias). The report proceeds to develop a model that attempts to address the first two biases. With U.S. Navy data from FY2001-FY2008, I examine the extent to which these two biases are affecting the estimated SRB effects. Despite these corrections, the difficulty of addressing the other biases calls into doubt studies that examine the effects of retention bonuses or even the effects of the structure of military pay in general.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于重力加速度的自对准算法在摇摆台上的验证

摇摆基座条件下陀螺和加速度计测量的地球自转角速度和重力加速度受到了摇摆运动的干扰,无法根据陀螺和加速度计的输出直接获得初始姿态矩阵。针对这一问题,通过验证实验证明了基于重力加速度的对准算法的有效性,并依据实验结果从理论上对该方法的对准误差进行了分析,提出了进一步提高对准精度的措施。     

公安高校计算机基础课程关联性分析

对＂1＋X＂双层课程体系下的计算机基础课程之间的关联性进行初步分析,揭示了教学目标一致性、教学内容互相渗透、人才培养逐层连续性等特点。     

基于DSP平台的H.324系统研究与实现

在分析H.324系统中双向视音频编解码所需要的运算量和存储容量的基础上,选择两片高速DSP芯片TMS320VC5509,合理分配资源,对视频编解码中关键代码进行优化,设计和实现了双向视音频编解码的实时H.324系统。特别是在定点DSP上采用了整数变换代替浮点DCT,消除了浮点运算,减少了运算量,给出了实验结果。     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

对空向量瞄具设计

给出了对空向量瞄具的设计计算方法,并对一个实例进行了详细的分析。