论军队任职教育院校学报编辑策划

策划是任职教育院校学报发展的关键环节，对学报的生存与发展具有重要意义。文章叙述了任职教育院校学报编辑策划的内涵和原则，指出了提高任职教育院校学报质量应在学报定位、栏目、选题、稿源和装帧等方面强化编辑策划功能。     

从联合条令看美国军事法的发展和创新

联合条令不仅在美军向联合军队转型的过程中起到了非常重要的指引和保障作用,而且在内容和形式上也体现出美国军事法规的发展方向和创新思路.     

声场波数积分最大截止波数自动选取算法

为了提高声场波数积分传递函数矩阵法的计算稳定性与精确性，提出基于预估-校正思想的最大截止波数自动选取算法，具有简单可靠、附带计算量小的优点。自由空间球面波算例测试结果表明，传递函数自下而上（单向）求解顺序的计算稳定性相对较差，在声源上方易出现积分核函数非物理发散，需要在不同深度上采用不同的截止波数才能计算出正确结果；而上下对进（双向）求解顺序的计算稳定性与计算精度均较高。     

以科学发展观为指导推进军校科研工作创新发展

以科学发展观为指导推进军校科研工作创新发展,必须着眼于建设一流名校,创造条件充分实现教员干部学员的学术发展,着力解决好发展方式问题,积极适应全军院校教学工作评价对科研评价点的导向要求。     

Coordination of pricing and inventory control across products

We consider the joint pricing and inventory‐control problem for a retailer who orders, stocks, and sells two products. Cross‐price effects exist between the two products, which means that the demand of each product depends on the prices of both products. We derive the optimal pricing and inventory‐control policy and show that this policy differs from the base‐stock list‐price policy, which is optimal for the one‐product problem. We find that the retailer can significantly improve profits by managing the two products jointly as opposed to independently, especially when the cross‐price demand elasticity is high. We also find that the retailer can considerably improve profits by using dynamic pricing as opposed to static pricing, especially when the demand is nonstationary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009