电晕放电辐射信号分析的小波基函数选取

研究电晕放电辐射信号既有利于消除其危害又有助于加强对其利用。针对小波变换提出在不同情况下对不同类型的电晕放电进行分析时,选取小波基函数的方法,理论上可以通过信号与小波波形的匹配或者通过计算信号与小波相关系数的方法来确定,而在不确定放电类型时可进行实际分析。     

提高MIMO系统容量的检测算法研究

为了满足通信容量的需求,在发射端和接收端设置多元素天线阵列构成多输入多输出系统,可以显著提高频谱的利用率.基于贝尔实验室提出的非线性迫零检测算法,提出了反向迫零检测算法.理论和仿真证明,在相同信噪比条件下,反向迫零检测算法获得的系统容量高于非线性迫零检测以及线性迫零检测算法.与奇异值分解算法相比,该算法虽然得到的系统容量有所减小,但是由于所需的运算量相对较小,因而易于实现.     

ARUAV前沿判别法抗多点源诱偏性能研究

基于反辐射无人机的时域鉴别技术,提出了一种以小波分析为手段的前沿判别法。将被动雷达导引头使用固定波门对脉冲前沿进行采样所得的信号作小波分析,对分析结果进行判定,当判定采样信号内为单辐射源信号时对其进行测向、测频、跟踪和打击。针对两点源诱偏系统分析表明,在大部分空域中,反辐射无人机总是能首先跟踪诱饵信号。通过建模与仿真,验证了前沿判别法能够有效对抗两点源诱偏系统,并由固定波门得到了有效的判别空域。     

声场干涉条纹图像的降噪研究与性能仿真

引导源目标定位算法形成的声场干涉条纹图像中常附带有噪声,这对定位性能的影响非常大。为了实现低信噪比条件下对目标的准确定位,根据算法仿真结果的特点,提出了利用小波阈值去噪法对图像进行降噪处理。针对软硬阈值去噪的不足,采用了阈值函数的改进方案。对小波去噪后图像再进行二值化设置,能有效提高算法去噪效果。仿真结果表明小波降噪处理能有效提高引导源目标定位算法在低信噪比条件下的定位性能。     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

S-四嗪类高氮含能化合物的合成及性能

以3,6-对(3,5-二甲基吡唑)-S-四嗪(BT)为起始物,研究了S-四嗪类高氮含能化合物3-氨基-6-(3,5-二甲基吡唑)-S-四嗪(ADMPT)、3-肼基-6-(3,5-二甲基吡唑)-S-四嗪(HDMPT)、3,6-二氨基-S-四嗪(DATz)、3,6-二肼基-S-四嗪(DHTz)与3,3’-偶氮-(6-氨基-S-四嗪)(DAAT)的合成,经IR、元素分析、1HNMR、13CNMR等对其结构进行了表征和确认。对DHTz和DAAT的热分解性能进行了研究,由不同升温速率下的DSC实验获得了其热分解动力学参数。结果表明DAAT热稳定性好、能量高,在10℃/min升温速率下,DAAT在280℃开始分解,放热峰值330℃,放热峰的分解焓为1974.33J/g;DHTz在120℃开始分解,放热峰值159℃,放热峰的分解焓为1843.23J/g。同时,采用高温高压爆轰产物状态方程(VLW EOS)对DHTz和DAAT的爆轰性能进行了理论计算。     

支持向量机的滚动轴承状态监测

提出了一种基于支持向量机的滚动轴承状态监测方法.该方法采用小波能量表征轴承信号的特征,采用支持向量机作为分类器构建支持向量机状态监测系统.仿真实验表明该方法具有很好的在线监测性能和分类性能,该方法对于滚动轴承的监测具有一定的应用价值,并可方便地推广到其他类似的工业应用领域.     

一种TM遥感影像的分割算法

从多分辨率分析角度分析图像分割概念,研究已有的图像分割方法,阐述基于二进小波变换的多分辨率分析原理,采取由粗到细的控制策略,有效地选取最优分割阈值,从而实现对TM遥感影像的分割,实验结果表明该算法对复杂遥感影像分割是有效的。     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Decomposition-based approximation algorithms for the one-warehouse multi-retailer problem with concave batch order costs

We study the one-warehouse multi-retailer problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem into single-facility subproblems, then propose approximation algorithms by judiciously recombining the subproblem solutions. For piecewise linear concave batch order costs with a constant number of slopes we obtain a constant-factor approximation, while for general concave batch costs we propose an approximation within a logarithmic factor of optimality. We also extend some results to subadditive order and/or holding costs.