空间谱估计在干涉测角中的应用

提出了一种利用空间谱估计对干涉测角系统进行解算的方法,该方法在多重信号分类(M USIC)算法的基础上,对协方差矩阵的估计、特征值分解、谱峰搜索等计算量较大的步骤进行了改进,提高了运算速度.并根据入射角连续的特点,提出了空域跟踪搜索的算法,进一步减小了计算量,同时提高了解模糊的正确率.     

爆炸成型弹丸贯穿靶板靶后破片空间分布模型

深空撞击载荷对探测小天体内部物质成分和结构特性具有重要意义,因此,在考虑爆炸成型弹丸(explosively formed projectile, EFP)可变截面的特性和区分靶后破片来源的基础上,建立了EFP贯穿靶板靶后破片空间分布模型。在靶板厚度30 mm至70 mm、EFP着靶速度1 650 m/s至1 860 m/s的条件下,该模型可以定量预测靶后破片云中各个破片的速度、质量、数量与空间位置的关系。结果表明,相对速度总是随相对空间位置的增加而呈线性增加,相对质量、相对数量总是随相对空间位置的增加而呈幂函数增加。     

Quantification of projection angle in fragment generator warhead

Tactical Ballistic Missile (TBM) class target neutralization by the fragment spray of a Fragment Generator Warhead (FGW) calls for quantification of fragment projection angle scatter to finalize the end game engagement logic. For conventional axi-symmetric warhead, dispersion is assumed to be normal with a standard deviation of 3⁰. However, such information is not available in case of FGW. Hence, a set of experiments are conducted to determine the dispersion of fragments. The experiments are conducted with a specific configuration of FGW in an identical arena to quantify the scatter and then verified its applicability to other configurations having a range of L/D and C/M ratios, and contoured fragmenting discs. From the experimental study, it is concluded that the scatter in projection angle follows normal distribution with a standard deviation of 0.75° at Chi-square significance level of 0.01(χ²_0.99).     

营房管理可视化系统设计方案

利用地理信息技术、数据库技术以及办公自动化技术提出了营房可视化管理系统设计方案,实现了空间数据的上传下载以及与营地实力系统数据的导入导出;并根据面向对象技术实现了对空间图层类、信息窗体类和属性数据维护类的封装,为改变传统的营房管理模式,实现营房的信息化、可视化管理作了一定的探讨。     

基于标注事件图的空间数据库主动规则终止性分析

主动规则的终止性分析强化了规则的设计高效性。给出主动规则元模型的概念作为主动规则终止性分析和比较的基础;对精化触发图进行扩展,提出标注事件图分析模型。结合实例给出终止性分析算法。与各种方法的对比说明标注事件图是可应用于终止性分析的通用抽象模型。     

COSMIC掩星电子密度廓线的质量检核

利用COSMIC掩星任务自2010年至2014年的电离层电子密度廓线,使用只考虑廓线自身特性的4种参数进行质量检核,并对廓线质量的时空分布进行分析。发现在廓线质量的空间分布上,廓线不合格率在高纬地区最高,其次是低纬地区,在中纬地区最低,这可能与电子密度分布在磁赤道附近存在赤道异常、两极地区的磁场强度最大有关。廓线质量的季节变化较明显,在南、北半球,冬、春两季的廓线不合格率均显著高于夏、秋两季。另外,廓线质量具有一定昼夜分布特性,不合格率白天明显较夜晚低,且在晨昏分界线上变化较大。合格廓线的电子密度峰值和峰值高度分布在磁赤道附近明显高于其他区域,呈现"双驼峰"现象。     

模糊偏序关系的一种信息集成方法

以模糊超过关系、模糊不协调关系为例,就模糊偏序关系给出了一种基于分组加权极大(极小)算子的信息集成方法,讨论了该方法的一致性、非独裁性等性质.     

具有模糊偏好认知矩阵的超对策稳定性分析

针对一类具有模糊偏好认知矩阵的超对策问题,给出了具体的稳定性分析方法。基于相对模糊距离的概念和模糊有序加权平均(FOWA)算子提出了三角模糊互补判断矩阵的一种排序方法。由此方法得到局中人的结局偏好认知向量,进而给出了一阶超对策的稳定性分析过程。最后,以实际冲突为例说明这一方法。     

空间查询语言中拓扑关系的定义

拓扑关系是一种重要的空间关系,被广泛应用于空间查询和空间分析中。因此定义一个完备、互斥且可以嵌入到空间查询语言中的命名拓扑关系集合有着非常重要的意义。当前,对拓扑关系集合的定义还不能描述那些由点、线或面等不同维几何对象构成的复杂空间对象之间的拓扑关系。针对目前拓扑关系研究的不足,引入了混合几何对象的概念,基于OpenGISSQL规范(OpenGISSimpleFeaturesSpecificationforSQL),定义了一个拓扑关系集合:{disjoint,touches,within,crosses,overlaps,contains,equal}。它扩充了OpenGISSQL规范中拓扑关系的定义和范畴,具有完备性和互斥性,为空间查询语言中的拓扑关系的定义提供了一个统一的框架。     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.