一种基于粒子滤波的测向定位跟踪算法

基于多站测向定位提供的目标辐射源方位角信息,提出了一种基于粒子滤波的测向定位跟踪算法.该算法采用序贯蒙特卡罗的粒子滤波技术,对目标辐射源方位信息进行粒子滤波融合处理,实现了对机动目标辐射源的无源定位跟踪.仿真实验表明,该算法适用于非线性模型和非高斯噪声的目标跟踪,与传统的基于卡尔曼滤波的多传感器融合跟踪算法相比,定位跟踪更为精确,从而对提高战场电子目标定位跟踪和精确打击具有广泛的应用价值.     

Noncooperative facility location games

A noncooperative game theoretical approach is considered for the multifacility location problem. It turns out that the facility location game is a potential game in the sense of Monderer and Shapley and some properties of the game are studied.     

需求势能理论的配送中心选址方法的研究

物流配送中心选址的合理性直接影响着物流分销网络规划和优化.提出了针对物流网点选址的需求势能理论,并提出了一种基于需求势能的分销物流系统中配送中心的选址实现方法.最后通过实例证明,该方法简便快捷,结果正确合理,为解决此类配送中心选址问题提供了科学的指导依据.     

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives

Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect).We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results.     

医疗和危险废物高温洁净热处理及环境力学

结合2003年中国的突发危害公众健康的事件，分析了医疗、化学战剂及危险废物的分类、特性，比较了各种高温热处理技术的基本要求，方法分类和设备特点，包括：各类焚烧炉、热解炉和等离子体裂解装置．还对前处理工艺要求，尾气处理工艺等进行了分析讨论，讨论了防止二次污染的技术手段，特别介绍了二噁英等高危险性产物的特性．还介绍了发达国家的医疗废物和危险废物的管理、处置和二次污染防治等情况．     

Discretization and resolution of the (<Emphasis Type="Italic">r</Emphasis>|<Emphasis Type="Italic">X</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>)-medianoid problem involving quality criteria

In this paper an extension of the (r|X _p )-medianoid on networks introduced by Hakimi (1983) is studied. In this extension the customer considers not only the distance but some characteristics of the facilities such as store size, quality of service and parking space. A new firm wants to establishr new facilities which have to compete with thep facilities that already exist in the market. The entry firm wants to find their locations and characteristics to maximize profits. Three different customer choice rules (binary, partially binary and proportional preferences) are considered. Some discretization results are obtained and a resolution procedure is proposed. The problem is solved combining a global search algorithm based on a branch and bound procedure with some combinatorial heuristics (greedy, interchange, and tabu search). Some computational experiences are presented. Partially supported by Ministerio de Ciencia y Tecnología (Spain) and FEDER, grant BFM2002-04525-C02-01.     

The location of median paths on grid graphs

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.     

测定透镜厚度新法及其误差探讨

本文介绍利用景深短、高倍率、大口径的物镜，采用光学方法，对被测透镜上下表面调焦，从而测定其中心厚度的一种新方法，并对测量误差进行了探讨。     

非正则位置参数模型中的拟极大似然估计

当分布密度的形式未知时，参数的极大似然估计没有明确的解析表达式，也不能通过设计算法由计算机运算得到。本文我们将从该分布中抽取的样本当作是来自另一个形式已知的分布密度的样本，该已知分布密度的选取依赖于未知的分布密度，但是具有与未知分布相似的边界性质。基于这两个分布族，我们提出了拟极大似然估计的概念，同时，对这种拟极大似然估计的渐近性质进行了讨论。结果表明拟极大拟然估计与极大似然估计有关相同的渐近性质，并且由于拟极大似然估计的获得不依赖于未知分布密度的形式，只与一已知的分布密度有关，使得通过计算机可以实现对其的求解。     

一种非刚性医学图像点匹配方法

提出了一种非刚性点匹配的算法并把其运用于医学图像配准．该算法采用信号滤波的方法来获得点集间的匹配信息，并运用松弛标记法将各点邻域关系对模糊的匹配信息进行迭代获得明确的匹配关系．在此基础上，利用高斯径向基函数来描述点模式间的弹性形变，在基本的迭代框架下实现问题的求解．实验结果显示在形变程度为5％、出格点比率50％和噪声标准差为5％的情况下该算法的匹配误差能控制在0．13以下，表明了该算法的鲁棒性和有效性，较好地解决了医学非刚性形变的点匹配问题．