改进高频系数重构算法结合负压波法检测定位

传统基于小波变换的奇异值检测对大突变量信号检测效果明显,而对细微变化的信号或受噪声影响的信号奇异值检测不明显.为解决此问题在原基础上做出改进,对小波分解产生的高频系数进行域变换的数学处理方法,做指数变换.筛选一组新的高频系数,再运用小波重构恢复出原信号.通过运用matlab实现的仿真结果表明改进方法突出了奇异值的突变效果,也更准确地检测奇异点.通过与负压波法的结合实现对热网泄漏点的定位,该结合仍需大量实验来验证.     

不确定移动对象概率Skyline集的查询更新

Skyline查询的研究已从传统的静态Skyline操作延伸到动态的、不确定数据集上的Skyline查询和计算上。研究了移动环境下,查询点位置固定、目标点处于运动状态并且位置不确定情况下的连续概率Skyline计算问题。这个过程中,移动对象与查询对象之间的距离随时间不断变化。移动对象由于其运动状态导致位置无法精确定位,因此移动对象之间的支配关系只能采用概率形式表示,且随时间不断变化。给出了移动对象间的支配概率的定义,以及移动对象Skyline概率的定义,并定义了触发事件来记录对象支配概率发生变化的时刻,实现概率Skyline计算的连续跟踪和动态更新。提出了基于事件触发的连续概率Skyline查询算法(event triggered continuous probabilistic Skyline query for uncertain moving object,U-ECPS),对移动环境下的Skyline集进行连续查询和更新。大量的实验结果验证了U-ECPS算法的有效性。     

ROSA:资源敏感的高性能Web容器体系结构

现有的Web容器多采用线程池体系结构,而Web容器所支撑的动态Web组件在执行过程中可能需要获取多种共享资源,由共享资源并发量限制导致的线程阻塞可能会严重影响性能。提出了一种资源敏感的Web容器体系结构ROSA(resource-oriented staged architecture)。当某些共享资源达到饱和时,若Web容器接到对需要这些资源的Web组件的请求,ROSA会暂缓为这些请求提供服务以减少线程阻塞。基于排队Petri网,建立了ROSA结构和线程池结构的性能模型,通过模型仿真和负载实验验证了ROSA体系结构的性能优势。     

On social computing research collaboration patterns: a social network perspective

The field of social computing emerged more than ten years ago. During the last decade, researchers from a variety of disciplines have been closely collaborating to boost the growth of social computing research. This paper aims at identifying key researchers and institutions, and examining the collaboration patterns in the field. We employ co-authorship network analysis at different levels to study the bibliographic information of 6 543 publications in social computing from 1998 to 2011. This paper gives a snapshot of the current research in social computing and can provide an initial guidance to new researchers in social computing.     

A new algorithm for fast mining frequent itemsets using N-lists

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks.In this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets.Based on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent itemsets.Efficiency of PrePost is achieved by the following three reasons.First,N-list is compact since transactions with common prefixes share the same nodes of the PPC-tree.Second,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists respectively.Third,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of N-list.We have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic datasets.The experimental results show that the PrePost algorithm is the fastest in most cases.Even though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.     

西门子自动化实验室的建立及应用

介绍以西门子S7-300/200PLC、WINCC6.0、MM440变频器、6SE70系列变频器等产品为基础建立的莱钢新区炼钢厂西门子自动化实验室。