整环上不定方程组的通解公式及其应用

借助Z上矩阵A∈Mm×n(Z)的标准形式D=VAU=diag(d1,d2,…,dq,0,…,0),得到了整环上不定方程组AX=B的通解公式以及矩阵初等变换法.     

导函数性质及其应用

处处有导数的函数（导函数）有两个很好的性质：（1）在一点处有极限，则该点必连续，若无极限则该点两侧或单侧必振荡；（2）可能有不连续点的导函数介值定理仍成立。如果函数某点的领域内处处可导，我们可得到如下三个推论：（1）当f^l（x0＋0）=f^l（x0-0）时，则存在且连续。（2）当f^l（x0＋0）≠f^l（x0-0），或至少有一个单侧极限为无穷时，函数在该点不可导，（3）当f^l（x0＋0）和f^l（f0-0）中一个或同时振荡时，函数在该点可能可导。     

基于混合优化算法的单分量磁性定位方法

为解决现有磁定位方法的定位精度较大程度上依赖于定位参数初始值估计精度的问题,提出了基于混合优化算法的单分量磁定位方法.首先利用舰船垂向磁场的衰减特性构造了相关系数函数,该函数与测量面上磁场的拟合误差函数共同组成了一种新的多目标规划函数,然后将微分进化算法与方向加速法相结合形成了混合优化算法,再利用该算法通过多目标规划函数确定最优的定位参数解.实验证明,对于未安装定位系统的半合作舰船,该定位方法利用磁传感器所测目标的垂向磁场,能较准确地确定舰船相对于磁传感器的位置,定位结果稳定可靠,定位精度较高.     

基于Holtrop公式与遗传算法的船型参数优化

针对方尾水面舰船,采用Holtrop阻力计算公式,以总阻力为目标函数,据遗传算法,对主要的船型参数进行了优化计算,进而得出了在一系列速度下主要船型参数的最优解及相应的由Holtrop公式计算得到的总阻力,并绘制了在各最优解下由Holtrop公式计算的总阻力随速度的变化曲线,结合Holtrop公式相应图谱对所得优化计算结果进行了分析.结果表明,该方法对于水面舰船的主尺度比等船型参数优选具有较强的实用性.     

一种数据驱动的飞行仿真参数辨识方法

目前飞行参数经验公式针对于不同飞机机型拟合不准确,且传统黑箱算法无法定量表达飞行参数相关性。针对上述问题提出一种基于快速存取记录器（quick access recorder,QAR）数据的飞行仿真参数辨识方法,该方法在多项式拟合算法基础上,增加权重系数分配输入参数在算法中所占比重,利用斯皮尔曼等级（Spearman rank）相关系数计算不同输入参数权重系数。由此设计二元多项式,基于改进算法求解最优多项式系数。仿真结果表明,该方法可有效降低仿真误差。     

求解WTA问题的智能算法评价准则

目前求解火力优化配置(WTA)问题的智能算法层出不穷,急需统一的算法评价准则来比较各算法的寻优能力,以得到相对更高精度、更高效率的算法.针对上述问题建立了完善的评价准则体系,从算法代码编制质量、算法精准度和算法执行效率3个方面对智能算法的寻优能力深入讨论,并给出了2个标准测试模型及其初始化参数.实例说明本评价准则科学合理,具有很高的实用价值.     

关于 Kaiser 时窗函数的谱特性分桁

本文讨论的是Kaiser 时窗函数,其目的是:(1)对Kaiser 时窗函数及它的一些基本性质作一简单的介绍;(2)从计算得出的Kaiser 时窗频谱出发,对Kaiser 窗的谱特性进行初步的探讨与分析。本文给出了Kaiser 窗公式及一些参数公式的推导,列出了Kaiser 窗取不同参数α时的能量比值、主瓣宽度及旁瓣峰值,并大略描绘了频谱曲线。     

关于 Kaiser时窗函数的谱特性分析

本文讨论的是 Kaiser时窗函数,其目的是:(1) 对 Kaiser时窗函数及它的一些基本性质作一简单的介绍;(2)从计算得出的 Kaiser时窗频谱出发,对 Kaiser窗的谱特性进行初步的探讨与分析。本文给出了 Kaiser窗公式及一些参数公式的推导,列出了Kaiser窗取不同参数 α 时的能量比值、主瓣宽度及旁瓣峰值,并大略描绘了频谱曲线。     

一种α稳定分布噪声下的跳频参数盲估计方法

针对目前以高斯白噪声为模型的大部分跳频参数估计方法在α稳定分布噪声背景下,性能急剧下降的缺点,对跳频信号进行两次窗函数长短不同的分数低阶STFT,从而得到两组时频数据,,将两组时频数据点乘,得到新的时频表示,基于时频分析的跳频参数估计方法,实现跳频参数的估计。仿真实验表明,提出的方法有效抑制了α噪声,在α=0.8,GSNR≥1 d B;α=1.5,GSNR≥0 d B时,可以实现跳频周期的准确估计。在α=1.5,GSNR=3 d B时,该算法跳变时刻估计值最大相对误差比STFT低3%、比分数低阶STFT低1.6%,跳变频率估计值更加精确。     

对流层散射下MPLS重路由信号去噪研究

针对对流层散射信道MPLS重路由信号数据含有噪声的问题,分析了Facility重路由原理和MPLS标签转发过程,引入小波阈值去噪算法对含噪声标签信号数据进行处理。利用一种随分解层数变化的阈值和折中阈值函数规则,来解决传统算法中的阈值确定和阈值函数选取存在的问题,针对折中阈值函数规则中参数a的确定问题,利用模拟数据,以信噪比(SNR)为目标函数,采用定步长变a形式,从而得到去噪效果最好时对应的a值,并用实测数据加以验证。仿真结果表明,改进后的算法在信噪比上有1.5 d B~3.4 d B的提高,均方差(RMSE)下降约0.01~0.03,为路由修复信号的去噪提供一种可行的方案。     

基于多尺度小波变换的二维图像角点检测技术

提出一种基于多尺度小波变换的二维图像角点检测算法。首先利用二维零交叉边缘检测算子对图像进行边缘提取得到二值边缘图，通过基于边素（边过程）的围线跟踪算法得到图像的边缘围线。对边缘围线的方向曲线进行多尺度小波变换，利用变换结果的局部最大值信息检测和定位出图像角点。仿真结果表明该算法可有效地实现二维图像的角点检测与定位，具有较高的精度     

m序列二相编码雷达灵巧噪声干扰研究

针对前沿复制干扰能量利用效率低的问题,提出了利用前沿波形,通过预测,超前获取雷达信号完整波形,进而实施灵巧噪声干扰的思路。对于采用由n级移位寄存器产生的m序列的二相编码雷达,给出了利用获得的前2n个码元,通过解n元线性方程组,预测获得完整m序列的方法。进一步,针对该线性方程组的生成特点,提出了一种快速算法。利用该快速算法,可以将预测的计算工作量平均分配到从获得m序列的第n＋1个码元到获得第2n个码元的各个节拍中去,使得一旦获得m序列的第2n个码元,就能够立刻得到m序列的所有反馈系数,获取雷达的当前发射信号的完整波形,并以最短的延迟实施针对性的灵巧噪声干扰。     

Reliability of a single unit with k spares in case of the hyper-exponential and the erlang failure distribution

In this paper formulas are derived for the reliability of a single unit to which identical spares in standby are allocated, with all of these units having a hyper-exponential or Erlang distributed lifetime. Two advantages are obtained by using these distributions. First, the general procedure for calculating the effect of redundancy is applicable, in contrast with most of the common life distributions, such as Weibull. Moreover, both distributions are suitable for matching to observed curves and practical data by varying the values of the parameters, covering together most of the cases of practical interest.     

梯格形自适应控制

本文讨论并解决了具有d步时延的多变量系统的梯格形自适应控制问题。为此,把自适应控制下的闭环系统嵌入到ARMA模型中,采用梯格算法进行预报。为了考虑d步时延控制系统,采用简捷方法推导了d步梯格预报公式,并给出了控制量的确定方法。采用梯格形自适应控制可方便地调节模型的阶次,从而可以克服对象阶次不准引起的自适应控制失效的问题。     

矩形波导结构潘尼管工作特性的分析

本文导出了一般TE_(no)模矩形波导结构潘尼管的色散方程,对潘尼管作了更明确的解释,并详细计算了TE_(20)模潘尼管的色散方程,得到其基波和第三次谐波同步谐振的色散曲线。该曲线表明,潘尼管在基波谐振上有1.5%的增长率,而在第三次谐波上有0.8%的平均增长率。此外,用非线性理论分析基波和第三次谐波同步谐振时的工作情况,给出了电子饱和时的电子分布图。在常直流磁场下优化结果表明,潘尼管在其次谐振时有51%的高效率和QP_w=9949.9MW 的输出功率,而在第三次谐振时有11%的效率和QP_w=1741.8MW 的输出功率。     

Implicit enumeration based algorithms for postoptimizing zero-one programs

It has been shown by G. Roodman that useful postoptimization capabilities for the 0-1 integer programming problem can be obtained from an implicit enumeration algorithm modified to classify and collect all fathomed partial solutions. This paper extends the the approach as follows: 1) Improved parameter ranging formulas are obtained by higher resolution classification criteria. 2) Parameters may be changed so as to tighten the original problem, in addition to relaxing it. 3) An efficient storage structure is presented to cope with difficult data collection task implicit in this approach. 4) Finally, computer implementation is facilitated by the elaboration of a unified set of algorithms.     

Comparison of stochastic processes used in sonar detection models

In any model for a sonar detection process, some assumption must be made about the nature of the acoustic fluctuation process. Two processes that are widely used in this role are the jump process and the Gauss-Markov process. These processes are similar in that they are both stationer) Markov processes and have autocovariance functions of the form s?²exp(—γt). For these reasons, it might be believed that one could use either of these processes and get comparable results if all one is interested in is computing cumulative detection probabilities or mean time to gain or lose contact. However, such is not the case in that vastly different results can be obtained in some applications. An application of this sort is presented. We also present necessary and sufficient conditions for a threshold to have the property that it is almost surely crossed by the jump process, or by the Gauss-Markov process. This affords another method of comparison.     

The variance of the coverage of a randomly located area target by a salvo of weapons

We derive formulas for the variance of that proportion of the value of a randomly located, circularly symmetric area target that is destroyed by N independently fired weapons of identical type whose damage functions are circularly symmetric about the respective impact points. The probability density functions of the target center location and of the weapon impact points are also circularly symmetric. The general results are specialized to uniform and Gaussian functions. In the latter case a closed-form solution (triple integral) for the variance of the coverage is derived. Similar to some well-known results on expected coverage, this expression for the variance of the coverage can be easily evaluated by numerical quadrature. Numerical results are given which indicate the target coverage variability caused by the combined effects of random target-locating errors and weapon impact point fluctuations.     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

RTDX与Matlab实现基于DSP的FIR滤波器设计

介绍了一种RTDX与Matlab结合设计基于DSP的FIR数字滤波器的方法.在VB中调用Matlab进行指定特性FIR数字滤波器设计,获得各阶权系数,然后调用RTDX,实时地向目标硬件传递该系数,从而实现了基于DSP的FIR数字滤波器精确设计,提高了DSP算法软件的设计效率.并对TI的RTDX技术及使用方法作了相关介绍.