An antiphishing strategy based on visual similarity assessment

The authors' proposed antiphishing strategy uses visual characteristics to identify potential phishing sites and measure suspicious pages similarity to actual sites registered with the system. The first of two sequential processes in the SiteWatcher system runs on local email servers and monitors emails for keywords and suspicious URLs. The second process then compares the potential phishing pages against actual pages and assesses visual similarities between them in terms of key regions, page layouts, and overall styles. The approach is designed to be part of an enterprise antiphishing solution.     

地质统计学反演在海上地震资料处理中的应用

面对海上地震资料频带有限、测井稀少且分布特殊的问题,以珠江口盆地惠州凹陷A油田为例,研究了用于储层精细描述的地质统计学方法的应用技巧,客观评价其识别效果。最终证明了在提高地震分辨率和合理选取变差函数的基础上,可以取得符合油藏研究精度的地球物理反演结果,推进了地质统计学方法在海洋环境下的应用。     

An efficient multiobjective differential evolution algorithm for engineering design

Solving engineering design and resources optimization via multiobjective evolutionary algorithms (MOEAs) has attracted much attention in the last few years. In this paper, an efficient multiobjective differential evolution algorithm is presented for engineering design. Our proposed approach adopts the orthogonal design method with quantization technique to generate the initial archive and evolutionary population. An archive (or secondary population) is employed to keep the nondominated solutions found and it is updated by a new relaxed form of Pareto dominance, called Pareto-adaptive ϵ-dominance (paϵ-dominance), at each generation. In addition, in order to guarantee to be the best performance produced, we propose a new hybrid selection mechanism to allow the archive solutions to take part in the generating process. To handle the constraints, a new constraint-handling method is employed, which does not need any parameters to be tuned for constraint handling. The proposed approach is tested on seven benchmark constrained problems to illustrate the capabilities of the algorithm in handling mathematically complex problems. Furthermore, four well-studied engineering design optimization problems are solved to illustrate the efficiency and applicability of the algorithm for multiobjective design optimization. Compared with Nondominated Sorting Genetic Algorithm II, one of the best MOEAs available at present, the results demonstrate that our approach is found to be statistically competitive. Moreover, the proposed approach is very efficient and is capable of yielding a wide spread of solutions with good coverage and convergence to true Pareto-optimal fronts.     

Short text similarity based on probabilistic topics

In this paper, we propose a new method for measuring the similarity between two short text snippets by comparing each of them with the probabilistic topics. Specifically, our method starts by firstly finding the distinguishing terms between the two short text snippets and comparing them with a series of probabilistic topics, extracted by Gibbs sampling algorithm. The relationship between the distinguishing terms of the short text snippets can be discovered by examining their probabilities under each topic. The similarity between two short text snippets is calculated based on their common terms and the relationship of their distinguishing terms. Extensive experiments on paraphrasing and question categorization show that the proposed method can calculate the similarity of short text snippets more accurately than other methods including the pure TF-IDF measure.     

Dual graph regularized NMF model for social event detection from Flickr data

In this work, we aim to discover real-world events from Flickr data by devising a three-stage event detection framework. In the first stage, a multimodal fusion (MF) model is designed to deal with the heterogeneous feature modalities possessed by the user-shared data, which is advantageous in computation complexity. In the second stage, a dual graph regularized non-negative matrix factorization (DGNMF) model is proposed to learn compact feature representations. DGNMF incorporates Laplacian regularization terms for the data graph and base graph into the objective, keeping the geometry structures underlying the data samples and dictionary bases simultaneously. In the third stage, hybrid clustering algorithms are applied seamlessly to discover event clusters. Extensive experiments conducted on the real-world dataset reveal the MF-DGNMF-based approaches outperform the baselines.     

Analysis and improvement of the quantum image matching

We investigate the quantum image matching algorithm proposed by Jiang et al. (Quantum Inf Process 15(9):3543–3572, 2016). Although the complexity of this algorithm is much better than the classical exhaustive algorithm, there may be an error in it: After matching the area between two images, only the pixel at the upper left corner of the matched area played part in following steps. That is to say, the paper only matched one pixel, instead of an area. If more than one pixels in the big image are the same as the one at the upper left corner of the small image, the algorithm will randomly measure one of them, which causes the error. In this paper, an improved version is presented which takes full advantage of the whole matched area to locate a small image in a big image. The theoretical analysis indicates that the network complexity is higher than the previous algorithm, but it is still far lower than the classical algorithm. Hence, this algorithm is still efficient.     

Cytoplasm and nucleus segmentation in cervical smear images using Radiating GVF Snake

A Radiating Gradient Vector Flow (RGVF) Snake aiming at accurate extraction of both the nucleus and cytoplasm from a single-cell cervical smear image is proposed. After preprocessing, the areas in the image are roughly clustered into nucleus, cytoplasm and the background by a spatial K-means clustering algorithm. After initial contours are extracted, the image is segmented using RGVF. RGVF involves a new edge map computation method and a stack-based refinement, and is thus robust to contaminations and can effectively locate the obscure boundaries. The boundaries can also be correctly traced even if there are interferences near the cytoplasm and nucleus regions. Experiments performed on the Herlev dataset, which contains 917 images show the effectiveness of the proposed algorithm.     

天然气在线密度补偿

天然气压缩因子和密度的在线补偿是工程中需要解决的问题,为此提供了一种用PLC实现的有效在线实施方案,用于天然气压缩因子和密度的计算。     

基于双分支网络联合训练的虚假新闻检测

虚假新闻在社交媒体上的广泛传播,给社会带来了不同程度的负面影响。针对虚假新闻早期检测任务中,社交上下文信息不充分的问题,提出一种基于双分支网络联合训练的虚假新闻检测模型。该模型由最大池化网络分支（max pooling branch,MPB）和广义均值池化网络分支（generalized mean pooling branch,GPB）组成。MPB采用卷积神经网络对新闻文章进行文本特征提取,GPB引入了可训练的池化层,学习新闻文章潜在的语义特征。同时,在每个分支网络中,对新闻标题和正文之间进行语义关联性度量。最终,对两个分支网络联合训练后的结果进行决策融合,判断新闻的真实性。实验结果表明,提出的模型在准确率、召回率、F1值评测指标上均优于基线模型,F1值达到94.1%,比最优的基线模型提升了6.4个百分点。