脉冲压缩技术在火控雷达中的应用

分析了决定火控雷达作用距离的各项因素 ,介绍了脉冲压缩技术的发展 ,论述其在高距离分辨率下提高雷达作用距离方面具有的优势及在其它方面具有的潜在优势 ,并简介了具体的应用实例     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

An integer programming model for the weekly tour scheduling problem

We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001.     

化学物料泄漏的危害及安全处置中应注意的问题

化学物料泄漏具有引起火灾、爆炸事故,造成严重的毒害事故,污染、破坏生态环境等危害,其泄漏的原因有自然灾害、设备本身、人为及意外事故几方面,在处置化学物料泄漏事故应注意防止形成燃爆条件;严防毒害;防止冻伤;搞好现场监测等问题.     

GPS和类GPS测距技术联合用于双星编队星座的状态确定

编队卫星状态的高精度确定是编队星座功能实现的重要基础。针对对地观测的双星编队星座的状态确定问题,为了提高状态确定的精度,在GPS技术的基础上,引入了类GPS测距技术,建立了联合GPS和类GPS测距技术进行状态整体确定的两种数学模型,并讨论了GPS星间单差模糊度和类GPS星内单差模糊度的同时初始化方法,最后进行了数值仿真。仿真结果显示,类GPS观测值尤其是类GPS星内载波单差观测值的引入,明显提高了双星编队星座的状态确定精度,其中绝对姿态角的精度达到rad,相对位置的精度达到m,相对钟差的精度达到s。仿真证明方法正确有效,模型二更优于模型一。     

冲激SAR成像的分辨率估计

后向投影 (BP)算法是一种被广泛应用于冲激SAR的成像算法。当冲激SAR的发射信号是某一类冲激信号时 ,根据冲激SAR成像的特点 ,推导出BP算法的方位分辨率与成像积累角、信号中心频率的关系。仿真结果表明 ,在相当范围内 ,估计公式都是准确的     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

X波段雷达线性调频脉冲压缩信号仿真研究

对雷达线性调频脉冲压缩信号进行分析以及仿真,在雷达信号模拟领域中是非常重要的.给出了常规调频脉冲压缩信号以及匹配滤波器模型及仿真结果,并在对某X波段雷达调频脉冲压缩信号处理特点研究的基础上,分析了距离分辨率对不同距离目标分辨的影响,并进行了仿真验证.     

Regional mediation strategy: The case of Zimbabwe

The growth and survival of the field of conflict resolution can only be attained if practice is used to generate theory, rather than a reliance on the current situation where theory attempts to direct practice. Some conflict resolution practitioners believe that theory and practice cannot be separated. This article evaluates the art of mediation using Zimbabwe as a case study, where the strategy was used in an attempt to resolve the Zimbabwean conflict that began in 1999. Employing primary and secondary sources, the article delineates the major characteristics of mediation and clarifies principles of the strategy. It further establishes the affinity and dissonance between practice and theory. In addition, it asserts that in the Zimbabwean case, the achievements of insider-partial mediation as a strategy were limited. In the long term the mediation strategy failed because the Government of National Unity did not fulfil all the outstanding issues enunciated by the global political agreement as a precursor to free and fair, credible and legitimate elections. In opposition to the mediation targets towards sustainable peace, Zimbabwe witnessed rushed elections before the accomplishment of the issues at stake, leading to the overall failure of the insider-partial mediation.