基于粒子系统的雷达箔条干扰仿真

粒子系统是模拟不规则模糊物体最为成功的一种图形生成算法。结合雷达对抗理论及计算可视化技术,分析了雷达箔条干扰的特征模型,提出了基于粒子系统的雷达箔条干扰计算机模拟的实现方法。     

The LP/POMDP marriage: Optimization with imperfect information

A new technique for solving large‐scale allocation problems with partially observable states and constrained action and observation resources is introduced. The technique uses a master linear program (LP) to determine allocations among a set of control policies, and uses partially observable Markov decision processes (POMDPs) to determine improving policies using dual prices from the master LP. An application is made to a military problem where aircraft attack targets in a sequence of stages, with information acquired in one stage being used to plan attacks in the next. © 2000 John Wiley & Sons, Inc., Naval Research Logistics 47: 607–619, 2000     

浅议计算机系统安全

介绍计算机病毒及其防护知识 ,提高用户的安全防范意识 ,做好计算机系统的安全防范工作。     

21世纪的C4I

首先介绍了新一代C4 I的主要特点。强调 2 1世纪的C4 I所进行的将是以网络为中心的战争。重点论述迅速发展的信息技术、网络技术、人工智能技术和多媒体技术在未来C4 I中的应用及这些技术对研究新一代C4 I体系结构所起的重要作用。     

前苏联发展反卫星武器的回顾

随着军用卫星的种类变化和性能提高 ,以及为谋求外层空间作战的军事优势 ,前苏联一直在积极发展反卫星武器。介绍了前苏联反卫星武器的组成、特点、技术方案及其发展情况 ,最后归纳了关于前苏联反卫星武器的几点看法。     

PLC与计算机的通讯系统设计

以 OMRON CPM1 A型 PLC为例 ,介绍了如何用 Visual Basic语言实现计算机与PLC的通讯 .该方案具有硬件简单、使用灵活的特点 .该通讯系统对于用计算机控制 PLC实现集中监控提供了可靠的手段 ;同时为利用计算机进一步开发基于 PLC信息的故障诊断系统诊断信息的获取提供了可靠的渠道     

关于创新计算机人才培养的探索

本文根据计算机基础教学的情况,简要分析了计算机基础教育面临的一些问题,并结合个人多年来教学经验,提出了一些解决方法。     

Optimal inventory and dynamic admission policies for a retailer of seasonal products with affiliate programs and drop‐shipping

This article investigates the optimal inventory and admission policies for a “Clicks‐and‐Bricks” retailer of seasonal products that, in addition to selling through its own physical and online stores, also sells through third‐party websites by means of affiliate programs. Through postings on partners' webpages, an affiliate program allows a retailer to attract customers who would otherwise be missed. However, this retailer needs to pay a commission for each sale that originates from the website operators participating in the program. The retailer may also refer online orders to other sources (such as distributors and manufacturers) for fulfillment through a drop‐shipping agreement and thus earns commissions. This would be an option when, for example, the inventories at the physical stores were running low. Therefore, during the selling horizon, the retailer needs to dynamically control the opening/closing of affiliate programs and decide on the fulfillment option for online orders. On the basis of a discrete‐time dynamic programming model, the optimal admission policy of the retailer is investigated in this paper, and the structural properties of the revenue function are characterized. Numerical examples are given to show the revenue impact of optimal admission control. The optimal initial stocking decisions at the physical stores are also studied. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于内外子区域划分的高阶精度CFD程序异构并行算法

对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法,结合结构化网格下有限差分计算和四阶龙格库塔方法的特点,引入ghost网格点区域,设计了一种ghost区域收缩计算策略,显著降低了异构计算资源之间的数据传输开销,负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠,提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数,分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)＋加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍,较MPI/OpenMP两级并行算法使用24个纯CPU核的性能,该算法使用单加速器时加速1.27倍,使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019