基于粒子群优化的三维突防航迹规划仿真研究

提出了一种基于粒子群优化的三维突防航迹规划方法并进行了仿真验证。通过引入最小威胁曲面的概念生成三维航迹搜索空间,利用一个有限项的多项式函数来逼近最小威胁曲面中的三维航迹在二维水平面内的投影,从而原来的规划问题简化为在一个一元函数多项式系数空间中的搜索寻优。利用粒子群优化,将约束条件和搜索算法相结合,能有效减小搜索空间,提高效率。仿真结果表明,生成的航迹具有地形跟随、地形回避和威胁回避的功能。     

线性方程组符号求解Bareiss算法的改进与实现

使用改进后的Bareiss消去法,在求解具有符号系数的线性方程组时可以避免普通Gauss消去法在计算过程中出现所谓中间系数爆炸的问题,还可以求解系数矩阵不是方阵以及系数矩阵奇异的线性方程组的情况.并且以这一改进算法与syzygy算法为基础,给出了求解多项式系数线性方程组的多项式解的算法.已经在自行开发的自动推理平台软件MMP上实现了这个算法.     

D-SThBILITY TESTING FOR THE INTERVALMATRIX FAMILY

*ThisresearchissupportedbytheNationalNaturalScienceFoundationofChina.1.IntroductionConsiderarealintervalmatrixfamilydefinedbyA={A=(qij),,..,Iqij5qij5q;,fori,j=1,2,'',n}(l.1)whichisasuperrectangleinlynxswithdimensionnxn.ForanyACA,leta(A)denotethesetoftheeigenvaluesofA.Definition1GivenanyopenandconnectedregionDinthecomplexplaneC,whichissymmetricabouttherealaxis.AissaidtobeD-stableifforeachAEA,a(A)CD.SincethepublicationofKharitonovTheorem[1],aconsiderableportionofresearchhasbeenaimeda…     

A CLASS OF GENERALIZED MULTIPROCESSOR SCHEDULING PROBLEMS

1. IntroductionOne of the fundamental problems in the theory of scheduling is to sChedule n independent jobs non-preemptively on m 2 2 multiprocessors. It is well-known that PllCm.. andPI I Z:=, wiCi are strongly NP-hardll'2].In this paper, we consider a class of generalized multiprocessor scheduling problem. It canbe described as follows: There are m almost identical processors M = {MI, M2,'' 5 Mm}, andn independent jobs J = {JI, J2,'' 9 Jn}. The processing time of job Ji is pi. A…     

Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field

Multivariate(n-D) polynomial matrix factorization is one of important research contents in multidimensional(n-D) systems, circuits, and signal processing. In this paper, several results on n-D polynomial matrices factorization over arbitrary coefficient fields are proved. Based on these results,generalizations of some results on general matrix factorization are obtained for given n-D polynomial matrices whose maximal order minors or lower order minors satisfy certain conditions. The proposed results fit for arbitrary coefficient field and have a wide range of application.     

Analysis for MIMO correlated frequency-selective channel in the presence of interference

The space time spreading,superimposed training sequences,and space-time coding are used to present a multiple input and multiple output(MIMO)systems model,and a closed-form of average error probability upper bound expression for MIMO correlated frequency-selective channel in the presence of interference(co-channel interference and jamming signals)is derived.Moreover,the correlation at both ends of the wireless link that can be incorporated equivalently into correlation at the transmit end is also derived.which is significant to analyze space-time link algorithm of MIMO systems.     

单基地MIMO雷达低复杂度求根MUSIC角度估计方法

针对单基地多输入多输出(multiple input multiple output,MIMO)雷达波达方向(direction of arrival,DOA)估计问题,该文提出一种低复杂度的实值求根多重信号分类(multiple signal classification, MUSIC)方法。该方法首先通过降维变换降低接收数据的维数,利用酉变换将复值数据协方差矩阵实值化,然后构造基于酉MUSIC的求根多项式,采用保角映射将复系数多项式映射为实系数多项式,最后通过求解该实系数多项式的根来得到目标的DOA估计。该方法不需要进行谱峰搜索,所涉及的特征值分解和多项式求根运算均只在实数域进行,在大大降低算法运算复杂度的同时可以获得更好的角度估计性能。仿真结果验证了所提算法的有效性。     

分形网络与复杂空间解集的算法转换模型

空间上看来简单的问题在时间上可能导致非常复杂的计算问题,而时间上的计算问题一旦在空间上采用某种有序划分,复杂过程又可以约化为简单的处理程序.分形思想为这类有序划分提供了可取的思路.借助分形思想和“分而治之“的策略,可望将复杂问题的“穷尽处理法“变为“有限选择法“,从而找到虽非最优但可满意的解决方案.以经典的TSP为例,提出空间系统复杂计算问题的处理方法,这种方法有助于实现指数算法与多项式算法的实用转换过程.     

Automated derivation of the conservation laws for nonlinear differential-difference equations

Based on Wu’s elimination method and "divide-and-conquer" strategy,the undetermined coefficient algorithm to construct polynomial form conservation laws for nonlinear differential-difference equations(DDEs) is improved.Furthermore,a Maple package named CLawDDEs,which can entirely automatically derive polynomial form conservation laws of nonlinear DDEs is presented.The effectiveness of CLawDDEs is demonstrated by application to different kinds of examples.     

近地天体与空间目标初轨确定的多解问题

针对近地天体与空间目标光学观测资料初轨确定过程中求解Laplace或Gauss八次方程时遇到的多个根无法判别的问题, 提出了一种有效的选择算法。通过构建Laplace八次方程, 分析了八次方程系数与根的个数之间的关系。利用观测平台地心距对八次方程进行归一化, 消除了平凡解, 并分析了方程非伪解个数与观测几何之间的关系。从求解半通径的方程出发, 利用Shefer方程, 推导了斜距约束, 得到了观测时间间隔和斜距变化量之间应满足的方程组的解析形式, 给出了利用该方程组判别非伪解的方法。最后, 对近地天体和空间目标的初轨确定进行了仿真验证, 仿真结果表明本方法能快速且有效地选择出正确的根, 解决了多个非伪解难以选择的问题。     

THE MARCINKIEWICZ-ZYGMUND INEQUALITY IN B_α SPACES(I)

The Marcinkiewicz-Zygmund inequality with derivative for an algebraic polynomial of order < N = (q +1)n - 1 is established in a Ba space. As a corollary, the Marcinkiewicz-Zygmund inequality with derivative for an algebraic polynomial in a particular Orlicz space is obtained.     

一类带交货期约束的资源选择问题研究

研究生产计划和控制中带交货期约束且子任务之间具有先序关系的资源选择问题,证明了该问题是NP完全问题,目前该问题还没有多项式时间求解算法.建立了该问题的非线性整数规划模型,分析了模型中目标函数和约束函数的单调性,并根据该单调性构造了分支定界求解算法.与招投标算法比较,表明分支定界算法具有求解问题的规模大、运算速度快的优越性.     

基于交叉定位的多传感器多机动目标跟踪

交叉定位的思想可以用来简化数据关联 ,实现状态估计。但在杂波或多目标的环境中 ,定位法会产生大量虚假目标。通过分析传感器数目的选择 ,来限定虚假目标生成的概率。提出了一种基于HMM(HiddenMarkovModel)的全邻似然估计跟踪算法。该算法采用观测 -航迹关联 ,具有相对简单的多项式复杂度。由于传感器量测的融合在状态空间中统一进行 ,该算法可推广到异类传感器组成的系统中。     

ON A FINITENESS THEOREM ABOUT PROBLEMS INVOLVING INEQUALITIES

ＯＮＡＦＩＮＩＴＥＮＥＳＳＴＨＥＯＲＥＭＡＢＯＵＴＰＲＯＢＬＥＭＳＩＮＶＯＬＶＩＮＧＩＮＥＱＵＡＬＩＴＩＥＳ￥ＷＵＷｅｎｉｎｎ（ＷＵＷｅｎ－ｔｓｕｎ）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，ＡｃａｄｅｍｉａＳｉｎｉｃａ，Ｂｅｉｊｉｎｇ１...     

基于mc-PPS模型的空间目标运动补偿

详细分析了高速平动和旋转运动对空间目标一维成像的影响,建立了目标雷达回波多分量多项式相位信号(mc PPS)模型,采用基于多延迟乘积型高阶模糊函数(ml PHAF)的方法估计模型参数,并提出了两类不同稳定姿态的空间目标的运动补偿方法。仿真实验表明这两种方法对运动引起的成像失真有显著改善。     

The RCH Method for Computing Minimal Polynomials of Polynomial Matrices

In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by term from lower to higher degree.By using a random vector and randomly shifting,it requires no condition on the input matrix and works with probability one.In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation,by using the modular technique,a parallelized version of the RCH method is also given.Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.     

基于NSST域的红外和彩色可见光图像融合

为了进一步提升彩色可见光和红外图像的融合质量,提出了基于NSST和颜色空间的彩色图像融合方法.首先将RGB空间的彩色可见光图像变换到更符合人类视觉系统的颜色空间,其次利用NSST可以更好提取图像细节信息的优势,对颜色空间的非彩色分量和红外图像进行NSST分解,对分解后的低频系数采用基于方向信息测度的系数选择方案,对高频系数则采用基于隐马尔可夫树(hidden Markov tree,HMT)模型的系数选择方案,然后对经过选择融合的低、高频系数进行NSST逆变换,得到的融合图像作为新的非彩色分量,结合已有的分量将其逆变换回RGB空间,得到最终的融合图像.仿真实验证明了方法的有效性.     

整数规划的旋转矢量法

针对整数规划问题的求解,改造了基本旋转矢量方法中的旋转因子和收缩因子。旋转因子的选取保证了矢量旋转过程中矢径长度不变,矢径的收缩策略的选取能保证最大范围地搜索解空间。多点旋转矢量法采用多矢量同时旋转的思想,在算法实施中基于优胜劣汰的原则引入了矢径舍弃系数和种群保留系数两个控制参数,极大地提高了计算效率和求解精度。最后,通过整数规划算例验证了该方法的有效性,表明对于维数较高的整数规划问题效果也很好。     

MODEL SELECTION FOR LOG-LINEAR MODELS OF CONTINGENCY TABLES

In this paper, we propose an information-theoretic-criterion-based model selection procedure for log-linear model of contingency tables under multinomial sampling, and establish the strong consistency of the method under some mild conditions. An exponential bound of miss detection probability is also obtained. The .selection procedure is modified so that it can be used in practice. Simulation shows that the modified method is valid. To avoid selecting the penalty coefficient in the information criteria, an alteruative selection procedure is given.     

运动目标位置的合成

研究由脱靶量和经纬仪位置获得和预测运动目标位置的方法。提出利用解方程组确定插值多项式系数的方法。与Lagrange插值多项式相比 ,使用这种方法得到的多项式在形式上更加简单。利用插值多项式 ,根据非整数倍周期时的偏差量 ,给出偏差量在整数倍周期时的带有延时作为参数的表示式。利用这一表示式 ,在目标作匀加速运动的前提下提出了延时的辨识方法 ,从而解决了目标位置合成中的难题。