基于激光雷达的高炉回旋区深度探测研究

炼铁高炉回旋区深度的直接探测存在较大困难,提出了一种基于激光雷达的回旋区边缘探测方法。探测得到的回波信号存在较大噪声干扰,为提取边缘回波信号,首先对噪声特点进行分析,判明噪声包括白噪声和1/fγ非平稳随机噪声;由此采用多小波平移不变算法进行滤波处理;采用H ilbert-Huang变换对滤波后的信号进行处理,对其瞬时能量进行分析。由于回旋区边缘表现出较为强烈的局部能量,从能量谱中可较好地提取回旋区边缘信号。试验表明,采用激光雷达探测回旋区的深度,能较为真实地反映高炉回旋区的真实状态,其值较计算建模方法更可靠。进一步的研究可望得到回旋区的二维或三维形貌。     

Weapon acquisition with target uncertainty

This article is concerned with choosing a mix of weapons, subject to constraints, when the targets to be attacked are known imprecisely. It is shown that the correct method for optimizing the mix of weapons involves a pair of nested optimization problems (two-stage optimization). Two methods for optimizing the expected utility of a mix are discussed. The first involves a simultaneous attack model, in which it is implicitly assumed that all weapons are used at once. The second involves a sequential attack model, in which targets appear in random order and are attacked one at a time. Particular attention is given to the question of the appropriate mix of general-purpose and special-purpose weapons.     

On the number of games played in a best of (2n – 1) series

Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of X_n, the number of games played in the series. It is shown that X_n is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on X_n is unique.     

一种自适应Harris角点检测算法

针对传统算法检测效果不理想的问题,提出了一种基于自适应非最大抑制策略的Harris角点检测算法;通过设置抑制半径与角点响应函数的局部最大值关联,减小抑制半径获取角点。算法有效解决了阈值选取和"聚簇"的问题。实验表明,该算法检测出的角点均匀分布,能很好地适应特征匹配等实际应用。     

文化现象与外语教学

语言体现文化,文化蕴于语言之中.研究文化与语言的关系,把语言中的种种文化观象,应用于外语教学,可加深学生对语言的理解,提高外语教学效果.     

A cutting plane algorithm for the bilinear programming problem

In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts.     

Optimal investment,pricing and replacement of computer resources

The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed.     

An optimum t-test for the scale parameter of an extreme-value distribution

A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H₁: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study.     

Computerized scheduling of seagoing tankers

Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone.