论按要素分配与按劳分配

十六大明确了新的分配原则即“生产要素按贡献参与分配原则”,这是我国收入分配理论和政策方面的革命性突破。弄清楚这一原则的确切含义、实施原因、分配形式、实现途径以及它与按劳分配之间的关系,对充分调动社会各方面的积极性,优化资源配置,切实保障广大群众的切身利益有着十分重大的意义。     

基于“当前”统计模型的模糊自适应滤波算法

"当前"统计模型需要预先设计目标最大机动加速度和目标机动频率,不能适应各种机动情况。在"当前"统计模型的基础上,提出了一种基于"当前"统计模型的模糊自适应滤波算法。该算法能使目标最大机动加速度和目标机动频率随着机动特性自适应调整,适应各种机动情况。仿真结果表明,该算法的跟踪精度优于传统的基于"当前"统计模型的跟踪算法。     

基于能力概念的复杂系统需求理解框架

军事电子信息系统因其系统结构、运行基础设施复杂等特点,决定了对其需求分析的复杂性。针对此问题,采用基于能力规划的思想,从能力本体的角度出发,定义出能力的内涵与外延,得出能力分析框架,从而为用户方与开发方规范了共同的需求理解框架,为下一步的能力建模、语义分析与验证打下基础。最后,用一个简单实例分析来说明如何依据能力分析框架描述或理解能力。     

C4ISR系统情报信息能力评价方法

信息能力直接影响信息优势能力和指挥决策能力,如何分析和评价C4ISR系统信息能力对作战的影响是一个重要的研究课题.在分析信息能力概念及其流程的基础上,给出一种评估信息能力的解析数学模型,详细研究了信息能力的三个度量指标:完备性、准确性和时效性的评估方法,研究结果对信息战和信息优势具有参考价值.     

CEC条件下舰艇编队目标武器分配研究

在分析CEC条件下舰艇编队目标武器分配模式的基础上,综合运用MAS理论与方法,建立了舰艇编队目标武器分配MAS模型,即利用Agent描述舰艇编队的各种物理资源或逻辑资源,通过网络及Agent通讯协议将多个Agent连接成一个整体系统,设计了映射实体功能的Agent结构,从而为舰艇编队目标武器分配决策提供了一条新途径.     

关于机枪加速寿命试验的建模

通过建模的方法和试验数据对机枪加速寿命试验进行研究,探索并建立三种加速寿命试验映射模型。通过对机枪枪管参数变化与射击规范、射弹量变化关系的理论研究,为加速寿命模型的建立提供理论依据,并对所建立模型进行修正和改进。     

实时空地作战仿真系统

现有的分布交互仿真系统实时性较差,只能使用简化的武器模型来实现多武器对抗.本系统以地空导弹作战对抗系统为例,阐述项目研制仿真系统的总体设计方法,实现了分布交互仿真技术与半实物仿真系统的结合,提高了分布交互仿真系统的内部精度.此系统的设计为提高分布仿真中模型精确化和半实物实时仿真系统扩大仿真规模提供了一种可行的方案.     

辐射叶加载的短波宽带鞭状天线优化设计

提出一款具有多层辐射叶结构的新型鞭状天线,在10 m鞭状天线体上设置不同的辐射叶层数、半径、长度、分支数、仰角及其分布情况,研究其对天线辐射性能的影响,综合考虑选择一套最合适的辐射叶结构,并为天线进行双加载和宽带匹配网络的算法优化。仿真结果表明,与现有的普通宽带鞭状天线相比,增益和效率得到了普遍提高,在低频段增益最高提高了3 dB,效率最高提高了5%;在高频段增益最高提高了5 dB,效率最高提高了35%,方向图上翘也得到了一定的抑制,为改善现有的宽带鞭状天线提供一种新的结构设计方法。     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

Stochastic regret minimization for revenue management problems with nonstationary demands

We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016