Multi-target localization for bistatic MIMO radar in the presence of unknown mutual coupling

A decoupling-estimation signal parameters via rotarional invariance technique(ESPRIT) method is presented for multi-target localization with unknown mutual coupling in bistatic multiple-input multiple-output(MIMO) radar.Two steps are carried out in this method.The decoupling operation between angle and mutual coupling estimates is realized by choosing the auxiliary elements on both sides of the transmit and receive uniform linear arrays(ULAs).Then the ESPRIT method is resilient against the unknown mutual coupling matrix(MCM) and can be directly utilized to estimate the direction of departure(DOD) and the direction of arrival(DOA).Moreover,the mutual coupling coefficient is estimated by finding the solution of the linear constrained optimization problem.The proposed method allows an efficient DOD and DOA estimates with automatic pairing.Simulation results are presented to verify the effectiveness of the proposed method.     

闽东柳杉人工林密度效应模型研究

应用闽东地区柳杉人工林样地材料,探讨了密度效应二次模型,并对其进行生产弹性分析和边际产量分析,测定了柳杉人工林林分密度的生产弹性值和边际产量。     

模型误差与轨道精度

应用模型与实际模型总是存在差异,如何从理论上探讨这种差异的影响以及在实际处理中如何进行选择是非常困难的。本文中分析了差异的主要原因,明确了模型误差的概念,并从理论上探讨了模型误差对轨道估计精度的影响,给出了具体的影响误差计算公式;在此基础上,提出了轨道参数的估计效率和客户效率的概念,并由此导出了模型误差处理原则,从而回答了实际数据处理中,模型误差处理方案的选择问题。最后,给出了一个应用实例     

基于样条插值和HV分形的图像分层编码方法

本文提出了基于对称短核滤波器（ＳＳＫＦ）的子带编码、样条插值与基于迭代函数系统（ＩＦＳ）的ＨＶ分块分形图像编码相结合的图像编码方法。实验结果表明,与基本的自动分形图像编码方法相比,在基本保证重建图像质量的前提下,运算时间和码率均下降。     

虚拟场景中自然景物的真实感与实时性的研究

从真实感与实时性两个方面着手,深入研究了虚拟场景中云彩、树木等自然景物的建模及其生成算法。提出了一种基于迭代函数系统ＩＦＳ与颜色溶合的云彩模型及实时生成算法。还采用分枝与高度抽象外形的方法,对树木构造了模型,并提出了实时生成算法。目前,上述两种模型及其算法已采用ＶＣ＋＋语言与ＯｐｅｎＧＬ库函数编程,在Ｉｎｔｅｌ３００微机平台上得以实现,其实时性和真实感效果均较好。     

航空电子综合化数据传输网络建模方法研究

采用Petri网理论对航空电子综合化数据传输网络系统的建模方法进行研究。通过对研究对象的基本假设、研究对象与Petri网理论之间的关系,给出了航空电子综合化数据传输网络系统的Petri网模型     

SEA方法及其在$C^3I$系统效能分析中的应用(Ⅲ)——监视模型

针对ＳＥＡ方法的要求,提出了评估$Ｃ^３Ｉ$系统在执行监视任务时的系统效能的三个性能量度（ＭＯＰ）,通过分析$Ｃ^３Ｉ$系统在执行监视任务时的行为过程和环境特点,结合排队理论,建立了评估$Ｃ^３Ｉ$系统监视效能的ＳＥＡ方法模型．利用该模型计算了一个实际$Ｃ^３Ｉ$系统的监视效能,并对结果进行了简要分析．     

基于接收方信用量调整的TCP新算法

传输控制协议(transport control protocol, TCP)发送窗口的大小由拥塞窗口和接收方确认窗口中较小的值来确定。在高速网络中,通过合理地增加拥塞窗口,可以提高TCP的性能。然而,一个相对较小的接收方确认窗口将限制发送窗口的增加,如果根据TCP接收方的数据变化率恰当地增加接收方确认窗口赋予发送方的信用量,就能减少这种限制。提出一种增强的TCP算法,命名为接收方信用量调整传输控制协议（receiver credit adjustment transport control protocol, RCA-TCP）,该算法根据TCP接收方缓冲区的动态数据变化率和TCP连接的最小往返时间之间的乘积的估计值来获得信用量增量。在ns-2(network simulator, version 2)下仿真表明,该算法能获得更好的性能。     

Clustering patents using non-exhaustive overlaps

Patent documents are unique external sources of information that reveal the core technology underlying new inventions.Patents also serve as a strategic data source that can be mined to discover state-of-the-art technical development and subsequently help guide R&D investments.This research incorporates an ontology schema to extract and represent patent concepts.A clustering algorithm with non-exhaustive overlaps is proposed to overcome deficiencies with exhaustive clustering methods used in patent mining and technology discovery.The non-exhaustive clustering approach allows for the clustering of patent documents with overlapping technical findings and claims,a feature that enables the grouping of patents that define related key innovations.Legal advisors can use this approach to study potential cases of patent infringement or devise strategies to avoid litigation.The case study demonstrates the use of non-exhaustive overlaps algorithm by clustering US and Japan radio frequency identification (RFID) patents and by analyzing the legal implications of automated discovery of patent infringement.     

从资产相关性计算信用质量相关性

】