Statistical concepts in computational mathematics

For a young science and even for most old ones, the intensity and variety of activities involved in computer science are unsurpassed. In an effort to provide the extremely varied training needed in the field, curriculum planners have tended to slight probability and statistics. Rarely has it been a requisite and only occasionally a desired elective However, not only is an adequate foundation in probability and statistics necessary for such external computer applications as tracking and other data reduction, Monte Carlo techniques, gaming, operations research, traffic analyses, etc., but it also plays an important role in internal applications to computer science and technology This effort in Rand's continuing study of computational mathematics and its applications offers a number of examples in various areas of computational mathematics and computing machine arithmetic-to say nothing of computer design, time sharing, and the like-to support the thesis that probability and statistics should be a requisite, not simply an elective or, even worse, ignored, at any institution offering a program in computer science. Further more, a potentially profitable source of research problems can be found in the interface between probability and statistics and computer science.     

A branch-bound algorithm for the capacitated facilities location problem

This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch-bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix.     

Vessel allocation by linear programming

This paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel.     

Application of renewal theory to continuous sampling plans

Renewal theory is used to study the effectiveness of a class of continuous sampling plans first introduced by Dodge. This approach provides a simple way of viewing and computing the long-run Average Outgoing Quality (AOQ) and its maximum AOQL. More importantly, it is used to study the average outgoing quality in a short production run through an approximation formula AOQ^*(t). Formulas for AOQ and AOQ^*(t) are provided. By simulation, it is found that AOQ^*(t) is sufficiently accurate in situations corresponding to actual practice.     

基于圆阵的二维DOA估计新方法

通过分析圆阵阵列流形,提出一种新的圆阵二维谱估计模型,可以直接应用MUSIC算法进行二维DOA估计,从而避免了对圆阵输出信号进行模式激励.应用此模型仿真分析了均匀圆阵和均匀半圆阵的二维DOA估计性能,相比模式激励方法,减小了计算量;半圆阵与圆阵的DOA性能差别很小,但是半圆阵减少近一半的阵元数.     

飞机电传操纵系统控制律的神经网络实现

现代多功能战机多用电传操纵系统替代传统的机械杆系,但由于飞机的多变量、强耦合和不稳定等强非线性特点,使得其电传控制律的工程实现相当复杂.为此,对电传操纵系统控制律的神经网络实现方法进行了研究.通过利用径向基函数(RBF)网络良好的非线性跟踪性能,探讨了用RBF网络实现电传控制律的一般方法,并以某型飞机电传操纵系统纵向通道为例,对该方法进行了验证.     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于信息模型的C4ISR系统需求集成方法

多视图需求工程中"分而治之"的需求开发方式,必然会产生"需要集成"和"如何集成"等问题.研究了基于多视图的C<'4>ISR系统需求框架及其视图产品,并在此基础上给出了C<'4>ISR系统需求集成的概念与范围.通过建立需求信息模型,从语法、语义和语用三个层次研究构建一个需求集成框架.通过需求产品之间的关联关系,分析不同视图产品在集成中存在的问题,并给出了需求集成框架中不同需求产品的集成过程,为C<'4>ISR系统需求集成问题的解决提供一个可供参考的方法.     

左手材料涂敷目标的RCS仿真研究

左手材料的介电常数和磁导率都为负值,电场、磁场和波矢量在左手材料中表现为左手螺旋关系,相速与群速方向相反。根据传输线理论分析了波入射到分层媒质上的表面反射系数,计算了随入射波频率、涂层厚度变化情况下的左、右手材料的反射率;基于非均匀有理B样条参数曲面模拟目标的几何外形,采用物理光学法计算了涂敷左手材料目标的雷达散射截面...     

基于BP网络的BTT导弹逆控制方法

运用BP神经网络结构和Levenberg-Marquardt算法,对导弹动力学特性进行动态逆模型辨识,并以辨识模型为控制器与BTT导弹控制系统串联构成动态伪线性系统,进而应用逆系统方法设计了一种用于解决BTT导弹非线性控制问题的经典控制与神经网络在线自学习控制相结合的控制方法.从理论上证明了该控制方案可以实现对导弹三通...