基于离散化模型的雷达优化配置与部署方法

雷达优化配置与部署问题存在模型复杂的问题,很难对其进行优化.提出了一种基于网格的离散化模型.雷达配置与部署的方案、雷达网对防区的覆盖能力以及雷达布站的约束条件都分别通过网格和矩阵进行了定量描述,在此基础上,建立了雷达优化配置与部署问题的数学模型.这样就可以采用模拟退火算法对该问题优化.仿真实验证明了该方法的有效性和可行性.     

自适应权值的嵌套式轮循调度算法

服务质量是目前网络应用研究的一个热点.采取何种队列调度算法则是确保服务质量的关键因素之一.针对NDRR算法不能很好地满足实时业务队列突发情况下的延迟性需求,提出了自适应权值的嵌套式轮循调度算法.当实时业务队列处于突发情况时,能够实现动态增加其权重.理论分析表明该算法有较好的公平性,并能降低实时业务队列的延迟上界,且算法的复杂度为O(1).仿真结果表明,该算法明显改善了突发状态下实时业务队列的延迟性能.     

SET协议的可追究性分析与改进

协议的可追究性为解决电子商务纠纷提供了重要的不可否认的证据,有必要深入分析SET协议的可追究性.Kailar逻辑是一种针对电子商务协议的可追究性而开发的形式化分析工具.先对SET协议进行了形式化的表述,然后利用一种改进的Kailar逻辑对SET协议的可追究性进行分析,结果表明协议只能满足商家和支付网关的可追究性,而不能满足持卡人的可追究性.最后,对协议进行了改进,使其能够满足持卡人的可追究性.     

数字中频接收机中的数字AGC的设计与实现

介绍了数字自动增益控制(AGC)技术在数字中频接收机中的实现方法’,提出了利用 DSP Builder模型库设计的一种实用的数字自动增益控制电路,所设计的电路在数字中频接收机系统内工作良好。该数字 AGC具有快速收敛、结构简单、性能稳定和成本低等特点。占用 Altera StratixⅡ FPGA 片上163个自适应逻辑单元(ALUTs)。     

The multiplicative representation for multiple objectives optimization with an application for arms procurement

Multiple Objectives Optimization is much seen in combination with linear functions and even with linear programming, together with an adding of the objectives by using weights. With distance functions, normalization instead of weights is used. It is also possible that together with an additive direct influence of the objectives on the utility function a mutual utility of the objectives exists under the form of a multiplicative representation. A critical comment is brought on some representations of this kind. A full‐multiplicative form may offer other opportunities, which will be discussed at length in an effort to exclude weights and normalization. This theoretical approach is followed by an application for arms procurement. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 327–340, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10014     

Optimal switchover times between two activities utilizing the same resource

The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008     

Suppression of enemy air defenses (SEAD) as an information duel

Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046