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.     

基于特勒根定理的风场送出线路新型纵联保护

双馈风机和永磁直驱风机广泛应用于陆上风电场。受控制策略影响,送出线路故障时风场侧故障特性与同步机电源差异显著,使传统纵联保护性能下降。特勒根定理建立于基尔霍夫电压、电流定律,仅与电路拓扑结构有关,对含线性/非线性、时变/时不变元件的电路均能适用。将特勒根定理应用到陆上风场送出系统,建立了满足定理应用要求的线路故障拓扑结构图。以此为基础,分析了能够区分内、外部故障的特征量,提出了一种基于故障前后线路两端电压电流的新型纵联保护动作判据。利用风场多个故障案例的录波数据和基于PSCAD的仿真数据对所提判据进行验证及对比分析,证明了所提纵联保护方法的优越性和可行性。     

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

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

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

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

ECMail:基于实体发现、查找和管理的中文邮件管理系统

随着个人用户的数据和信息级数增长,个人信息管理的研究成为热点.电子邮件作为个人信息的重要载体在个人信息业务中占据着重要的地位.随着个人信息的增加,用户在对邮件进行查询时经常遇到遗忘关键字的困扰,对此普通的邮件工具很难为用户组织和管理个人信息提供帮助.提出了一个基于实体发现、查找和管理的中文邮件管理系统--ECMail,有效改善了以上问题,同时对关键技术-中文分词、实体挖掘和实体关联管理的实现提出了自己的想法和处理机制,最终达到了提高用户邮件管理效率的目的.     

Low-contention data structures

We consider the problem of minimizing contention in static (read-only) dictionary data structures, where contention is measured with respect to a fixed query distribution by the maximum expected number of probes to any given cell. The query distribution is known by the algorithm that constructs the data structure but not by the algorithm that queries it. Assume that the dictionary has n$n$ items. When all queries in the dictionary are equiprobable, and all queries not in the dictionary are equiprobable, we show how to construct a data structure in O(n)$O\left(n\right)$ space where queries require O(1)$O\left(1\right)$ probes and the contention is O(1/n)$O(1/n)$. Asymptotically, all of these quantities are optimal. For arbitrary   query distributions, we construct a data structure in O(n)$O\left(n\right)$ space where each query requires O(logn/loglogn)$O(logn/loglogn)$ probes and the contention is O(logn/(nloglogn))$O(logn/(nloglogn))$. The lack of knowledge of the query distribution by the query algorithm prevents perfect load leveling in this case: for a large class of algorithms, we present a lower bound, based on VC-dimension, that shows that for a wide range of data structure problems, achieving contention even within a polylogarithmic factor of optimal requires a cell-probe complexity of Ω(loglogn)$\Omega (loglogn)$.     

基于阈值的社交网络影响力最大化算法

对于社交网络影响力最大化问题,Kemple和Kleinberg提出了有较好影响范围的贪心算法,但是KK算法的复杂度非常高,并不实用.利用线性阈值模型提出了一种基于节点激活阈值的启发式算法.它综合考虑了节点之间的影响力和节点的激活阈值,根据每个节点在激活过程中动态变化的阈值来计算PIN值,启发过程中,每一次都选取PIN最大的节点作为种子节点进行激活,贪心阶段中再贪心地挑选那些具有最大影响范围增量的节点作为种子节点.通过实验表明,即使在完全不采用贪心阶段,该算法的激活范围与KK算法都非常接近,而算法的复杂度则相对非常小.实验还表明该算法相对于HPG算法在相同启发因子c的情况下具有更大的激活范围.     

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.     

Graph-based algorithms for ranking researchers: not all swans are white!

Scientific importance ranking has long been an important research topic in scientometrics. Many indices based on citation counts have been proposed. In recent years, several graph-based ranking algorithms have been studied and claimed to be reasonable and effective. However, most current researches fall short of a concrete view of what these graph-based ranking algorithms bring to bibliometric analysis. In this paper, we make a comparative study of state-of-the-art graph-based algorithms using the APS (American Physical Society) dataset. We focus on ranking researchers. Some interesting findings are made. Firstly, simple citation-based indices like citation count can return surprisingly better results than many cutting-edge graph-based ranking algorithms. Secondly, how we define researcher importance may have tremendous impacts on ranking performance. Thirdly, some ranking methods which at the first glance are totally different have high rank correlations. Finally, the data of which time period are chosen for ranking greatly influence ranking performance but still remains open for further study. We also try to give explanations to a large part of the above findings. The results of this study open a third eye on the current research status of bibliometric analysis.     

Anticorrosion Behavior of Nickel-Rich Conductive Coating in Red Soil and the Effects of Fe2(SO4)3 on its Corrosion Resistance

Protection of Metals and Physical Chemistry of Surfaces - Anticorrosive conductive coatings were prepared by adding solvents, dispersants, nickel powders, etc. to acrylic resin coatings with high...