定向毫米波网络邻居发现协议

针对定向毫米波网络各节点间无波束方向先验信息导致邻居发现困难的问题,提出了一种基于盲交汇算法的邻居发现协议,推导了邻居发现过程中时隙长度、波束个数与邻居发现时间之间的理论关系。进一步,为了缩短邻居发现的时间,在盲交汇算法的邻居发现协议的基础上,提出了基于位置预测的邻居发现协议。仿真结果表明,基于盲交汇算法的邻居发现协议的最长邻居发现时间小于无协调的定向邻居发现协议,波束个数N接近2n(2n－1n,n>1,n∈Z)时,平均邻居发现时间低于无协调的定向邻居发现算法。此外,基于位置预测的邻居发现协议可以有效缩短邻居发现时间。     

JXTA网络短链路由改进算法

JXTA为构建对等网络提供了标准化计算平台,制定一些协议和服务专门解决构建P2P网络所遇见的问题.为了改进JXTA路由查询效率低下问题,提出一种路由短链改进算法.在端点路由协议的基础上,根据小世界短链现象采用物理邻居策略将网络划分簇,簇内采用Pastry算法,簇间运用freePastry算法进行资源搜索,使长跳路由减少短链路由增加.通过仿真实验说明,算法可有效增加检索效率,减少节点间的通讯时延.     

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

Text event mining, as an indispensable method of text mining processing, has attracted the extensive attention of researchers. A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper, i.e. UKGE-MS. Specifically, UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information, and solves the problems of traditional unsupervised feature selection methods, which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples. Firstly, considering the influence of local information of samples in feature correlation evaluation, a feature clustering algorithm based on average neighborhood mutual information is proposed, and the feature clusters with certain event correlation are obtained; Secondly, an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation, so as to enhance the generalization ability of the selected feature items. Finally, the events knowledge graph is constructed by means of sparse representation and l₁ norm. Extensive experiments are carried out on five real datasets and synthetic datasets, and the UKGE-MS are compared with five corresponding algorithms. The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection, and has some advantages over other methods in text event recognition and discovery.     

基于SNF的一种检测和跟踪性能优化方法

对于一个监视系统,跟踪性能的优化要求检测系统和跟踪系统通过引入反馈进行联合设计,针对最大量测幅值邻域滤波器(SNF),提出了先验和后验检测跟踪优化准则,通过分析得出先验优化准则不可行这一结论,而利用后验优化准则同时对检测阈值和门值的联合优化,仿真结果表明,用后验优化准则进行检测和跟踪性能优化,不仅具有比恒虚警率更好的跟踪精度,而且其计算代价也大为降低.     

一种基于DCT和SVM的人脸识别新方法

文中提出了一种新的人脸识别方法,该方法采用DCT提取人脸特征,并采用SVM对该特征进行分类识别。基于该方法,对ORL人脸库进行分类识别,仅用28个特征平均识别率达到97.4%。仿真结果表明,该方法显著地降低了特征维数和计算复杂度,明显提高了特征的可辨别能力,而且,SVM可以有效地提高分类器的分类和推广能力。     

基于相对密度的增量式聚类算法

基于聚类的相对性原则:簇内对象具有较高的相似度,而簇间对象则相反,提出一种基于相对密度的增量式聚类算法,它继承了基于绝对密度聚类算法的抗噪声能力强、能发现任意形状簇等优点[1],并有效解决了聚类结果对参数设置过于敏感、参数值难以确定以及高密度簇完全被相连的低密度簇所包含等问题。同时,通过定义新增对象的影响集和种子集能够有效支持增量式聚类。     

一种基于KNN-SVR的基因表达缺失值的估计方法

为了消除不相似基因对基因表达谱中缺失值估计的影响,提出了一种基于KNN SVR的缺失值估计方法.该方法先通过最近邻法选出与目标基因表达最相似的一组完全基因,再用这些基因通过支持向量回归对缺失值进行估计.还提出了用标准化偏差的方差来度量算法的稳定性和估计值的可信度.该方法通过对基因的过滤提高了缺失值估计的有效性.实验结果表明,KNN SVR法具有较高的估计精度和稳定性.