ID	原文	译文
1863	近年来，各领域内频频发生各类突发事件，对社会稳定发展产生了一定程度的影响。	In recent years, a wide variety of bursty events have been occurring frequently in many fields, impacting both the stability and the development of our society.
1864	本文提出了一种基于多种词特征的微博突发事件检测模型，可以在海量微博数据中对突发事件进行检测，便于相关决策者进行微博监控和舆论引导，尽可能减少突发事件给社会带来的危害。	This paper proposes an event detection model based on multiple wordfeatures, which is intended to detect bursty events in the massive microblog data. The model will assist decision-makers tomonitor microblogs and guide public opinions and will minimize the negative effect of bursty events to society.
1865	首先根据时间信息对微博数据进行时间切片，	Firstly, themodel slices the microblog data according to the time information.
1866	对每一个时间窗口内的数据分别计算各个词语的词频特征、话题标签特征和词频增长率特征;	In each time window, the word frequency feature, the top-ic tag feature and the word frequency growth rate feature of each word are calculated separately.
1867	然后基于 D-S 证据理论和层次分析法，确定词的各个特征权重，并进行加权融合得到词的突发特征值，	Then, the D-S evidence the-ory and the analytic hierarchy process are utilized to determine each word's feature weights, which are then merged to obtain the bursty feature value of the word.
1868	将突发特征值大的词挑选出来构成突发特征词集，构建基于共现度和结合紧密度的突发事件特征词集的耦合度矩阵;	Words with large bursty feature value are selected to form the bursty feature word setand to construct a coupling degree matrix of bursty feature word set based on co-occurrence degree and tightness.
1869	最后将该耦合度矩阵作为凝聚式层次聚类算法的输入，生成一棵由突发词为叶子节点的二叉树，并采用内部相似度的二叉树剪枝算法对聚类结果进行划分，即可实现对相应时间窗口突发事件的检测。	Finally, thecoupling degree matrix is used as the input of the hierarchical agglomerative clustering algorithm to generate a binary treewith bursty words being leaf nodes, and the internal similarity binary tree pruning algorithm is used to divide the clustering results. In this way, the detection of the corresponding time window's bursty events can be realized.
1870	实验结果表明，基于突发词的事件检测模型在簇内部相似度阈值等于 1.1 时效果最好，正确率达到 0.8462、召回率达到 0.8684、F 值为 0.8571，表明了本文所提方法的有效性。	The experimental results show that the event detection model based on bursty words has the best effect when the intra-cluster similarity threshold is1. 1, the correct rate is as high as 0. 8462, the recall rate reaches 0. 8684, and the F value is 0. 8571, indicating the effectiveness of the proposed method.
1871	近似计算技术通过降低电路输出精度实现电路功耗、面积、速度等方面的优化。	Approximate computing is a novel way in logic circuit design which offers the savings of the power, area and delay at cost of reduced accuracy.
1872	本文针对 RM(Reed-Muller)逻辑中“异或”运算特点，提出了基于近似计算技术的适合 FPRM 逻辑的电路面积优化算法，	This paper focused on the fixed-polarity Reed-Muller(RM)functions area optimiza-tion by using approximate computing technique which is different from those used in traditional Boolean functions optimiza-tion in term of the characteristic of“XOR”in RM functions.