新安江水电站水轮机主轴的焊接

通过对新安江水电站增容改造的9号机组的主轴结构及其焊接工艺研究，设计了合理的焊接坡口，制定了可行的工艺方案，通过实施该工艺，主轴焊接一次成功，为以后同类结构的大轴焊接积累了经验。     

Video summarization via minimum sparse reconstruction

The rapid growth of video data demands both effective and efficient video summarization methods so that users are empowered to quickly browse and comprehend a large amount of video content. In this paper, we formulate the video summarization task with a novel minimum sparse reconstruction (MSR) problem. That is, the original video sequence can be best reconstructed with as few selected keyframes as possible. Different from the recently proposed convex relaxation based sparse dictionary selection method, our proposed method utilizes the true sparse constraint L₀ norm, instead of the relaxed constraint _L2,1$L_{2,1}$ norm, such that keyframes are directly selected as a sparse dictionary that can well reconstruct all the video frames. An on-line version is further developed owing to the real-time efficiency of the proposed MSR principle. In addition, a percentage of reconstruction (POR) criterion is proposed to intuitively guide users in obtaining a summary with an appropriate length. Experimental results on two benchmark datasets with various types of videos demonstrate that the proposed methods outperform the state of the art.     

一种带负充电泵的IR2110驱动抗干扰电路设计

由于IR2110内部不能产生负电压,因此在采用零电压关断IGBT时容易产生毛刺干扰,对此研究了IGBT体寄生二极管反向恢复过程,并结合IGBT的输入阻抗米勒效应,分析出IR2110零电压关断毛刺干扰产生原因,最后对IR2110典型零电压关断电路进行改进,设计一种带负充电泵的IR2110关断电路.经实验验证,该电路可有效解决IR2110的零电压关断毛刺干扰问题,保证逆变器的工作稳定性.     

一种基于极坐标变换的点模式匹配算法

点模式匹配是目标识别、图像配准与匹配、姿态估计等计算机视觉与模式识别应用方向的基础问题之一。提出了一种新的利用点特征进行匹配的算法,该算法根据点集的分布与点位置信息,构建了点的特征属性图,通过极坐标变换得到对数极坐标的特征图,并利用几何不变矩方法对特征图进行描述。由特征描述向量的比较,获得粗匹配结果,然后通过几何约束迭代的方法获取最终的点集匹配结果。本文贡献如下:一,构建了一种点的极坐标变换特征,并运用不变矩进行描述,使所提特征具有旋转与平移的不变性;二,提出了利用点特征与整体点集几何约束结合的匹配算法,能有效克服出格点与噪声带来的不利影响。最终实验说明了算法的有效性和鲁棒性。     

The governance strategies for public emergencies on social media and their effects: a case study based on the microblog data

Since the 1980s, the development of information and communication technologies (ICTs) has greatly changed people’s modes of production and lifestyle, and it has also had a significant influence on traditional social structures. Microblogs – a type of social media application such as Twitter or Weibo – have served as an important platform for network governance in some local governments in China. This study makes an attempt to answer the following questions: What types of strategies should governments implement on social media platforms during public emergencies? What are the effects of these strategies? Based on the case of the Shifang Incident, which was a large-scale environmental protest that occurred in Shifang, China in 2012, we analyze all the messages posted during the incident on the official microblog of the Shifang government and examine the public feedback by using an online big data analysis tool. In line with the time sequence and the extent of the conflict, we divide the Shifang Incident into three phases: the fermentation period, the confrontation period, and the digestion period. In addition, we classify government strategies on social media into five categories: introducing, appealing, explaining, rumor-refuting, and decision-making. The analysis results show that different government strategies are applied to different phases of the incident and that the responses of the public also vary during different periods.     

Re-ranking for microblog retrieval via multiple graph model

As a new information sharing platform, microblog has got explosive growth in recent years and has become an important source for public opinion mining. A variety of information like the reviews of brands/products or the trends of events can be socially sensed from such kind of data. However, it is still a challenging task to search relevant microblogs as the user generated content tends to be mixed with noise. Besides short text, image is getting popular in microblogs due to its power in visual information conveying. In this paper, we leverage textual and visual cues integratedly and propose a general re-ranking approach for microblog retrieval via multi-graph semi-supervised learning. We argue that the different types of information in microblogs correspond to different relationships among microblogs and each type of the relationship can be represented as a similarity graph. We then integrate different graphs into a unified framework and solve them simultaneously for microblog re-ranking. Extensive experiments on a recently published Brand-Social-Net dataset showed the effectiveness of the proposed method and marginal improvements have been achieved in accuracy as compared to the single graph model based method.     

Tracking Performance Bound with Finite Control Energy and Erasure Channel Energy Constraint

This paper studies the tracking performance of the single‐input single‐output (SISO), finite dimensional, linear and time‐invariant (LTI) system under the channel input energy constraint over the Erasure channel. A new performance index is proposed which is minimized over all two‐degree‐of‐freedom stabilizing controllers. The explicit expressions of the lower bound of the performance index and the minimum of the signal‐to‐noise ratio are obtained. The results show that the performance bound is correlated to unstable poles, non‐minimum phase zeros and the packet loss probability. Finally, examples are given to validate the conclusions derived.     

给水管网抗震对策的重要度分析方法研究

针对城市给水管线不同管段在灾后对于管网整体可靠度影响的差异性,为了能够较好地评价不同管段对管网系统连接可靠度的贡献,引入失效概率重要度和关键重要度,建立了基于历史经验方法的管网可靠度及管线失效概率重要度、关键重要度计算模型。实例计算结果表明,该模型计算的管网连接可靠度结果与其他文献方法的计算结果基本一致,验证了模型的合理性、有效性。进而应用该模型计算出各段管线的失效概率重要度、关键重要度,对管线防灾等级划分,给出了管网分割方法与管网震后恢复策略。研究结果为编制给水管网抗震防灾规划、震后管网恢复计划及制定出相应的抗灾应急措施提供依据。     

AM186EM处理器的地址空间优化及应用

本文介绍了一种基于 AM186 EM 处理器的地址空间优化应用,当系统需要处理器支持的最大容量内存时, FLASH 和外围存储器(例如双口 RAM等)可以共用处理器的UCS选通信号,从而实现 FLASH 和外围存储器共用尽可能大的地址空间。同样,当系统需要最大容量的FLASH 时,内存 RAM和外围存储器可以共用处理器的LCS选通信号,从而实现 RAM和外围存储器共用尽可能大的地址空间。     

Taking a free ride for routing topology inference in peer-to-peer networks

A Peer-to-Peer (P2P) network can boost its performance if peers are provided with underlying network-layer routing topology. The task of inferring the network-layer routing topology and link performance from an end host to a set of other hosts is termed as network tomography, and it normally requires host computers to send probing messages. We design a passive network tomography method that does not require any probing messages and takes a free ride over data flows in P2P networks. It infers routing topology based on end-to-end delay correlation estimation (DCE) without requiring any synchronization or cooperation from the intermediate routers. We implement and test our method in the real world Internet environment and achieved the accuracy of 92 % in topology recovery. We also perform extensive simulation in OMNeT++ to evaluate its performance over large scale networks, showing that its topology recovery accuracy is about 95 % for large networks.