On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Dynamic inventory and pricing models for competing retailers

We address infinite‐horizon models for oligopolies with competing retailers under demand uncertainty. We characterize the equilibrium behavior which arises under simple wholesale pricing schemes. More specifically, we consider a periodic review, infinite‐horizon model for a two‐echelon system with a single supplier servicing a network of competing retailers. In every period, each retailer faces a random demand volume, the distribution of which depends on his own retail price as well as those charged by possibly all competing retailers. We also derive various comparative statics results regarding the impact several exogenous system parameters (e.g., cost or distributional parameters) have on the equilibrium decisions of the retailers as well as their expected profits. We show that certain monotonicity properties, engrained in folklore as well as in known inventory models for centralized systems, may break down in decentralized chains under retailer competition. Our results can be used to optimize the aggregate profits in the supply chain (i.e., those of the supplier and all retailers) by implementing a specific wholesale pricing scheme. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Walker星座自主定轨误差分析

通过对Walker星座中卫星间的相对运动进行分析,给出星间相对距离的解析表达式及其对轨道根数的偏导数,直观地描述在同轨道面和异轨道面的星间观测对轨道根数变化的体现情况;根据星座中卫星的相对位置,提出合理的约束条件和平差方法,利用星间测距网实现星座的整网定位;通过仿真算例,比较在不同情况下,采用合适的整网定位方法对轨道根数的系统误差和随机误差修正的情况。     

灾害应急反应建模与仿真

为了满足多智能体应急反应仿真的需求,首先对构建多智能体应急反应仿真模拟框架的复杂性进行了分析,在此基础上提出并设计了组件式仿真模拟框架.采用本体(Ontology)建模、语义网模型及产生式规则推理等理论方法构建了仿真模拟框架的场景建模模块、人员Agent建模模块等组件.最后对依照上述研究内容所开发的原型系统进行了测试,对测试结果进行了分析,结果表明该框架能够有效满足多智能体应急反应仿真的建模需求.     

起重机吊重摆角的产生机理与动态仿真研究

针对吊重二自由度摆角非线性动力学模型,研究了起重机吊重摆角的产生机理和摆角的影响因素。起重机小车和大车同时做加（减）速的复合运动时,产生吊重二自由度摆角,摆角的大小受起升绳长度和小车运行加（减）速度大小的影响。动态仿真表明：小车运行加（减）速度对摆角的影响比绳长度显著;小车起动和制动时,吊重做受迫摆动;当小车加（减）速度增大l倍时,吊重摆角约增大0．12rad,摆速约增大0．164rad／s;当绳长度增加2m时,摆角和摆速无明显变化,吊重自由摆动的周期约增加1．3s。     

武警部队远程教育培训探讨

针对武警部队集中学习相对困难的情况,对当前远程教育培训模式进行了探讨,分析了远程教育中的资源建设问题,并以《汽车构造》课程为例进行了网络课程的开发,为武警部队培养高素质的现代官兵队伍提供有益参考。     

防空反导网络化作战发展研究

网络中心战是信息时代重要的作战形式,可将战场信息优势转化为决策优势,是信息技术在军事领域应用的必然选择,网络中心战在防空反导领域的应用也称为防空反导网络化作战.主要跟踪研究了国内外网络中心战的最新进展和发展趋势,分析了网络化作战的特点和关键技术,针对我国防空反导武器系统的现状,提出了防空反导网络化作战的发展建议.     

弹载星敏感器应用方案比较研究

简述了弹载星敏感器几种应用方案的原理,从视场大小、导航星等、观星方式、像元分辨率、三轴姿态精度、动态性能、惯性基准误差分离等方面分析、比较了各种方案的优缺点.除平台方案外,捷联星图方案和单(双)星方案的技术参数相当,动态性能均有待提高.星图方案较单(双)星方案在2个方面占优势:一是星图方案不要求调整星敏感器光轴对准导航星,星跟踪算法等技术能快速识别星图;二是星图方案可同时、连续观测6～8颗星,解算出弹体三轴姿态,可以采用先进的滤波技术准确地分离惯性基准误差.     

基于改进人工鱼群算法的WNN优化设计

针对人工鱼群算法优化设计小波神经网络(WNN)的缺陷,引入了视野范围与步长的自调整策略,以提高搜索效率和收敛速度。改进后的人工鱼群算法可在WNN的搜索空间中同时确定参数初始值和隐节点数。仿真实例验证了其有效性。     

多层卫星通信网络结构设计与分析

针对单层卫星网络时延高、网络阻塞概率大等问题,研究了多层卫星网络的系统结构及其特点。结合不同轨道卫星特点,引入分层卫星网络结构,采用Walker和极轨星座覆盖带设计法,设计了多层卫星网络星座。采用"弱连接"模型作为星际链路建立的基本原则,并对星座的覆盖性能和星际链路特性进行了仿真分析,结果表明,多层卫星网络在覆盖特性和星际链路性能上更具优势。