Modeling and navigation of social information networks in metric spaces

We are living in a world of various kinds of social information networks with small-world and scale-free characteristics. It is still an intriguing problem for researchers to explain how and why so many obviously different networks emerge and share common intrinsic characteristics such as short diameter, higher cluster and power-law degree distribution. Most previous works studied the topology formation and information navigation of complex networks in separated models. In this paper, we propose a metric based range intersection model to explore the topology evolution and information navigation in a synthetic way. We model the network as a set of nodes in a distance metric space where each node has an ID and a range of neighbor information around its ID in the metric space. The range of a node can be seen as the local knowledge or information that the node has around its position in the metric space. The topology is formed by setting up a link between two nodes that have intersected ranges. Information navigation over the network is modeled as a greedy routing process using neighbor links and the distance metric. Different from previous models, we do not assume that nodes join the network one by one and set up link according to the degree distribution of existing nodes or distances between nodes. Range of node is the key factor determining the topology and navigation properties of a network. Moreover, as the ranges of nodes grow, the network evolves from a set of totally isolated nodes to a connected network. Thus, we can easily model the network evolutions in terms of the network size and the individual node information range using the range intersection model. A set of experiments shows that networks constructed using the range intersection model have the scale-free degree distribution, high cluster, short diameter, and high navigability properties that are owned by the real networks.     

变化环境下鄱阳湖洪水指标演变特征研究

本文基于鄱阳湖洪水特点,选取特定洪水特征指标,利用数理统计方法分析鄱阳湖洪水特征指标的趋势性、突变性和周期性,并分析演变特征和驱动因素,得到结论如下：1）未来高洪可能性仍然较大,未来6～10a鄱阳湖年最高水位仍处于丰水期;2）洪水在年内分配发生较大改变,变化过程从“矮胖型”向相对“尖瘦型”演变,水量在年内更加集中化;3）高洪持续天数显著增加,19.00m以上的高水位维持时间平均每10a延长2.2d;4）年最高水位及年平均水位周期性变化主要受“五河”入湖周期性变化所控制,同时会受到其他因素影响而改变原有周期性变化规律,年最高水位具有5a为第一主周期,40～49a为第二主周期的变化规律。     

纳米复合W—6％ThO2和W—2％ThO2阴极材料的性能对比

通过真空热压烧结制备了W－6％ThO2和W－2％ThO2纳米复合阴极材料，分析表明两者的显微组织类似，纳米ThO2较均匀分布在W基体上；前者的起弧电场强度低于后者，逸出功也相应降低；两者的机械性能相差不大。     

Robust Video Text Detection with Morphological Filtering Enhanced MSER

Video text detection is a challenging problem, since video image background is generally complex and its subtitles often have the problems of color bleeding, fuzzy boundaries and low contrast due to vi...     

Analysis and Implementation of an Open Programmable Router Based on Forwarding and Control Element Separation

A router architecture based upon ForCES (Forwarding and Control Element Separation), which is being standardized by IETF ForCES working group, gains its competitive advantage over traditional router architectures in flexibility, programmability, and cost-effectiveness. In this paper, design and implementation of a ForCES-based router (ForTER) is illustrated. Firstly, the implementation architecture of ForTER is discussed. Then, a layered software model, which well illustrates ForCES features, is proposed. Based on the model, design and implementation of Control Element (CE) and Forwarding Element (FE) in ForTER are introduced in detail. Moreover, security for ForTER is considered and an algorithm to prevent DoS attacks is presented. Lastly, experiments of ForTER are illustrated for routing and running routing protocols, network management, DoS attack prevention, etc. The experimental results show the feasibility of the ForTER design. Consequently, the ForTER implementation basically testifies the feasibility of ForCES architecture and some IETF ForCES specifications.     

Intensity standardization simplifies brain MR image segmentation

Typically, brain MR images present significant intensity variation across patients and scanners. Consequently, training a classifier on a set of images and using it subsequently for brain segmentation may yield poor results. Adaptive iterative methods usually need to be employed to account for the variations of the particular scan. These methods are complicated, difficult to implement and often involve significant computational costs. In this paper, a simple, non-iterative method is proposed for brain MR image segmentation. Two preprocessing techniques, namely intensity-inhomogeneity-correction, and more importantly MR image intensity standardization, used prior to segmentation, play a vital role in making the MR image intensities have a tissue-specific numeric meaning, which leads us to a very simple brain tissue segmentation strategy.Vectorial scale-based fuzzy connectedness and certain morphological operations are utilized first to generate the brain intracranial mask. The fuzzy membership value of each voxel within the intracranial mask for each brain tissue is then estimated. Finally, a maximum likelihood criterion with spatial constraints taken into account is utilized in classifying all voxels in the intracranial mask into different brain tissue groups. A set of inhomogeneity corrected and intensity standardized images is utilized as a training data set. We introduce two methods to estimate fuzzy membership values. In the first method, called SMG (for simple membership based on a gaussian model), the fuzzy membership value is estimated by fitting a multivariate Gaussian model to the intensity distribution of each brain tissue whose mean intensity vector and covariance matrix are estimated and fixed from the training data sets. The second method, called SMH (for simple membership based on a histogram), estimates fuzzy membership value directly via the intensity distribution of each brain tissue obtained from the training data sets. We present several studies to evaluate the performance of these two methods based on 10 clinical MR images of normal subjects and 10 clinical MR images of Multiple Sclerosis (MS) patients. A quantitative comparison indicates that both methods have overall better accuracy than the k-nearest neighbors (kNN) method, and have much better efficiency than the Finite Mixture (FM) model-based Expectation-Maximization (EM) method. Accuracy is similar for our methods and EM method for the normal subject data sets, but much better for our methods for the patient data sets.     

可见光与红外图像融合质量评价指标分析

目的 客观评价作为图像融合的重要研究领域,是评价融合算法性能的有力工具。目前,已有几十种不同类型的评价指标,但各应用领域包括可见光与红外图像融合,仍缺少统一的选择依据。为了方便比较不同融合算法性能,提出一种客观评价指标的通用分析方法并应用于可见光与红外图像融合。方法 将可见光与红外图像基准数据集中的客观评价指标分为两类,分别是基于融合图像的评价指标与基于源图像和融合图像的评价指标。采用Kendall相关系数分析融合指标间的相关性,聚类得到指标分组;采用Borda计数排序法统计算法的综合排序,分析单一指标排序和综合排序的相关性,得到一致性较高的指标集合;采用离散系数分析指标均值随不同算法的波动程度,选择充分体现不同算法间差异的指标;综合相关性分析、一致性分析及离散系数分析,总结具有代表性的建议指标集合。结果 在13对彩色可见光与红外和8对灰度可见光与红外两组图像源中,分别统计分析不同图像融合算法的客观评价数据,得到可见光与红外图像融合的建议指标集(标准差、边缘保持度),作为融合算法性能评估的重要参考。相较于现有方法,实验覆盖20种融合算法和13种客观评价指标,并且不依赖主观评价结果。结论...     

纤维增强复合材料装甲防护性能影响因素分析研究

本文从树脂基体、增强材料以及成型工艺等多方面采用正交试验设计开展了舰船防护用纤维增强复合材料研究工作,分析了各因素对复合材料装甲材料防护12.7 mm穿燃弹性能的影响,找出了较优的树脂配方、增强纤维以及成型工艺参数。     

校园网网络事件源定位技术研究

为了解决在校园网内部分网络安全事件和故障事件中只能确认攻击和事故的发生,而无法确定攻击和事故的源头这一问题.文章提出一种三步骤的校园网内网网络事件源定位模型.该模型将神经网络和证据理论相结合应用于攻击源定位.提高了校园网内网攻击定位的效率和准确性.     

Reproducibility and stability of N–Al codoped p-type ZnO thin films

Reproducible and stable p-type ZnO thin films have been prepared by the N–Al codoping method. Secondary ion mass spectroscopy measurements demonstrate that N and Al are incorporated into ZnO. The resistivity, carrier concentration, and Hall mobility are typically of 50–100 Ωcm, 1×10¹⁷–8×10¹⁷ cm⁻³, and 0.1–0.6 cm²/Vs, respectively, for the N–Al codoped p-type ZnO films. Hall measurement, X-ray diffraction, and optical transmission were carried out to investigate the changes of the properties with the storage period. Results show that the p-type characteristics of the N–Al codoped ZnO films are of acceptable reproducibility and stability. In addition, the N–Al codoped p-type ZnO films have good crystallinity and optical quality. The properties are time independent.