防空火力单元射击有利度计算方法研究

针对现代防空作战火力分配的实际需要,在确定防空火力单元可射击系数的基础上,对影响防空火力单元射击有利度的指标进行分析,结合防空作战的实际情况,介绍了计算射击有利度的一般步骤。该算法有效克服了传统射击有利度算法的不足,较好地实现了射击有利度的计算。     

多层局部回归神经网络在激光陀螺捷联惯导系统惯性敏感器误差补偿中的应用

惯导系统误差补偿技术对提高武器装备的性能具有重要的意义 ,而误差补偿的关键在于误差模型的辨识。探讨将多层局部回归神经网络引入到惯性敏感器误差建模中 ,详细介绍了网络结构和对应的自适应动态梯度算法。仿真算例说明 ,多层局部回归神经网络在惯性敏感器输出误差建模时具有一定的优点 :网络收敛速度快、较好的跟踪性能、稳定性好。     

微元内破片平均杀伤概率估算的新方法

本文提供了一种在弹药破片杀伤面积的估算中,求取微元内破片平均杀伤概率估值的新方法,这种方法可以保证在较小工作量的条件下提高估值精度.     

具有高效混洗模式存储器的可编程混洗单元

为向量DSP提出并设计了一种具有高效混洗模式存储器的可编程混洗单元,该结构能够使应用程序的混洗指令在执行时和通用寄存器或访存带宽等系统的关键资源分离,从而提高混洗单元的执行效率.采用区分不同混洗粒度和元素索引等方法对混洗模式所对应的开关矩阵进行了压缩,我们的存储效率高于当前其他方案.该混洗单元具有可编程的特点,应用程序...     

基于ARM7处理器的馈线自动化终端研制

主要探讨了一种基于ARM7处理器的馈线自动化终端的研制情况,给出了将μC/OS-II移植至AT91M55800A中的详细代码,并讨论了应用软件的整体设计思路和主要任务的详细流程。     

新湖农场一分场一连调查报告

全国对农村村落社会调查课题已经过有关单位进行,并已取得一定成果。然而,国家计划单列单位的新疆生产建设兵团仍然没有这方面的基层连队社会调研,本文就是从这点出发,对新湖农场一连从连队的基本情况,连队的党政组织建设,群众组织存在状况,经济社会发展,职工科学文化素质等等作实地调查。     

外军两栖车辆水上推进装置的分类及评价

给出了当今外军典型两栖车辆的主要性能指标,对水上推进装置进行了分类,定性分析了各种水上推进装置的工作原理及主要影响因素,给出了FT-C牵引车模型的试验结果.通过对水上推进装置产生的推力和两栖车辆水上行驶的阻力分析,得出了有价值的结论.最后根据实际需求对履带划水式、喷水式、螺旋桨式3种水上推进装置进行了综合评估,其结论对新型两栖车辆的论证、研究具有借鉴作用.     

A sequential auction‐bargaining procurement model

One of the most important decisions that a firm faces in managing its supply chain is a procurement decision: selecting suitable suppliers among many potential competing sellers and reducing the purchase cost. While both auctions and bargaining have been extensively studied in the literature, the research that combines auctions and bargaining is limited. In this article, we consider a combined auction‐bargaining model in a setting where a single buyer procures an indivisible good from one of many competing sellers. The procurement model that we analyze is a sequential model consisting of the auction phase followed by the bargaining phase. In the auction phase, the sellers submit bids, and the seller with the lowest bid is selected as the winning bidder. In the bargaining phase, the buyer audits the cost of the winning seller and then negotiates with him to determine the final price. For this auction‐bargaining model, we find a symmetric equilibrium bidding strategy for the sellers in a closed form, which is simple to understand and closely related to the classical results in the auction and bargaining literature. We also show that the auction‐bargaining model generates at least as much profit to the buyer as the standard auction or sequential bargaining model. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Mean sojourn times in multiclass feedback queues with gated disciplines

In this paper, we investigate multiclass feedback queues with gated disciplines. The server selects the stations by a nonpreemptive priority scheduling algorithm and serves customers in the selected station by either a gated FCFS discipline or a gated priority discipline. We take a rather systematic approach to their mean sojourn times. We define conditional expected sojourn times for all customers and derive their expressions from an analysis of busy periods. Since they are shown to be linear in some components of the system states, their steady state mean values can be derived from simple limiting procedures. These mean values can be obtained from a set of linear equations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 719–741, 2003.     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003