弹道目标微多普勒特性基于逆Radon变换的稀疏表示

作为识别空间弹道目标的有效方法,微多普勒特性提取对于雷达系统的时频分辨率提出了很高的要求,因此,要求雷达系统具有更高的采样频率。作为近年来新兴的技术手段,在远低于奈奎斯特采样定理的采样频率下,压缩感知技术可以对具有稀疏特性的信号实现高精度还原。对空间弹道目标时频分布进行逆Radon变换,在变换后的IRT域内获得时频分布的稀疏表示,从而可以借助压缩感知技术有效降低采样频率的要求。     

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.     

基于小波变换模极大值恢复的信号消噪方法

大多数的信号常具有某种奇异性 ,并携带有随机噪声 .首先回顾了信号奇异性与小波变换模极大值之间的关系 ,然后利用信号与噪声的Lipschitz指数的符号不同 ,在S .Mallat等人工作的基础上 ,给出了从信号中去除噪声的具体算法     

混合量化与基于小波的图像压缩

本文针对基于小波的图像压缩,提出一种新的快速有效的量化方法。该方法将矢量量化的高效率和标量量化的简单性有机地结合起来,称为混合量化（ＨＱ－ＨｙｂｒｉｄＱｕａｎ－ｔｉｚａｔｉｏｎ）。它不需要进行码书训练,不要做乘除法。并用标准测试图像与其它著名方法的压缩结果进行了比较。     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

BDS/INS紧组合三频动对动模糊度解算方法

针对伪距观测噪声较大导致动对动条件下三频整周模糊度解法(Three Carrier Ambiguity Resolution, TCAR)模糊度解算不可靠的问题,提出了一种BDS/INS紧组合三频动对动整周模糊度解算方法。通过紧组合系统输出的高精度位置坐标,估算出双差几何距离值,并用其分别代替无几何和几何模式下的双差伪距观测值,显著降低了伪距双差观测噪声水平,有效提高了三频整周模糊度解算成功率。仿真实验结果表明,BDS/INS紧组合输出的高精度位置坐标使得伪距观测精度提高了60%以上,在短基线条件下,当伪距观测噪声达到2 m时,无几何模式下的TCAR算法模糊度解算成功率为0.73%,几何模式下的TCAR算法模糊度解算成功率为31.25%,而BDS/INS紧组合的TCAR算法在两种模式下的模糊度解算成功率达到99%以上,并且获得了厘米级的相对定位精度。     

希尔伯特-黄变换在脉冲涡流信号消噪与识别中的应用

针对传统方法无法有效识别不同尺寸细小裂纹所产生的脉冲涡流信号,提出一种基于希尔伯特-黄变换的脉冲涡流信号消噪与识别算法。对脉冲涡流信号进行集成经验模态分解并通过归一化自相关函数及其方差特性分选出含有噪声的本征模态函数;对含噪声的本征模态函数进行阈值消噪并与未做处理的本征模态函数重构成无噪声信号;对无噪声信号进行希尔伯特-黄变换并计算出希尔伯特边际谱;根据希尔伯特边际谱的差异识别出不同细小尺寸的表面与下表面裂纹。实验结果表明了所提方法的有效性,经过集成经验模态分解消噪,消除了噪声对脉冲涡流信号的干扰;而基于希尔伯特-黄变换的方法则能够有效识别出不同尺寸的裂纹。     

小波变换在零件边缘检测中的应用

目前对机械零件的尺寸、口径等参数的测量大多采用接触测量,而利用零件图像的边缘信息进行非接触测量,则是一种新的更好的检测方式。用此方法可以对机械零件图像的边缘进行精确的检测,再根据相应的数学关系得到相关参数的值,不但可以提高零件检测的精度,还可以大大节省人力和物力。模拟边缘检测技术的具体过程,依次采用最佳阈值迭代算法、小波变换模极大值法、边缘连接局部处理法对零件图像边缘信息进行边缘检测和提取,并对检测过程进行了重点分述。最后,通过一个具体实验,验证了小波技术与其他技术结合使用所获得的良好效果,从而进一步显示了小波变换在边缘检测技术中应用的巨大潜力。     

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

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