Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

一种分布式拒绝服务攻击的检测方法

该文提出和实现了一种基于网络异常流量特征的检测模型。通过将多条链路或多个流的流量信号作为一个整体进行研究,构建了网络异常流量监控的系统模型。该模型包括了数据采集、分析、异常判断和警告等功能,并综合了异常信息融合及警告信息关联性分析技术。通过实验证明,该套系统模型对短时间段内的突发流量能提供有效的检测和报警服务。     

基于计算缓存方法的分子动力学程序性能优化

分子动力学数值模拟程序在现代高性能计算机上的计算效率往往很低,只能发挥系统峰值性能的几个百分点。本文对并行分子动力学程序PMD3D在联想深腾6800超级计算机上进行性能优化。通过性能分析,我们发现粒子相互作用力计算中相互关联的浮点运算严重影响了处理器的指令级并行效率,为此我们应用计算缓存的方法,将大量不规则的浮点计算进行缓存,达到一定规模后再进行向量化计算。这样使得单机性能在优化后提升4倍多,达到处理器峰值性能5.2GFlops的32.3%。最后,在深腾6800的64个节点的256个CPU上进行了并行性能测试,达到峰值运算性能1.3万亿次的27%。     

资源管理系统中基于作业检查点的自动容错

本文提出了在资源管理系统中基于作业检查点实现自动容错支持,深入分析了作业与任务检查点分离、映像文件管理、自动恢复执行等关键技术。基于BLCR在SLURM中实现了作业的自动检查点/恢复,详细介绍了实现中的关键技术难题。分析与测试表明,检查点与恢复执行功能正确,并能有效缩短大规模作业成功运行所需的时间。     

基于TMS320F2812 DSP的Focus控制器设计

借用原有DVD-ROM的机械机构、驱动单元、光学单元,以TMS320F2812 DSP芯片为核心控制器,搭建了DVD的Focus控制实验平台;分别从硬件和软件两方面进行设计,从而对前期采用PID算法设计的Focus控制器进行了可行性验证。     

基于类比的软件成本估算及其一种改进方法

基于类比的软件成本估算方法利用相似的历史项目信息来预测目标项目的属性值,具有不需要校准、能够在没有统计关系可以利用的情况下发挥作用等优点。本文在类比估算四个基本步骤的框架下,详细说明了类比估算所必须进行的相关操作,并参照案例推理系统把类比估算过程描述为一个从数据收集、属性选取开始,到估算报告输出、结果重用的循环结构。根据估算实践,提出了针对大数据集的计算优化方法,不仅有效降低了估算过程中的计算量,而且在一定程度上避免了次要因素的影响,提高了估算的可信度。     

Gbps串行链路信号完整性分析与设计

本文对影响Gbps串行链路信号完整性(SI)的主要原因进行了详细分析,提出了一系列改善信号完整性的解决方法和思想。实际设计了实验背板,测试结果验证了方法的有效性。     

智能机器人运动关节集成驱动控制器研究

根据智能机器人的控制要求,提出了机器人控制系统的顶层核心控制器和底层运动控制器的双层结构,底层与顶层基于CAN总线完成关节状态信息的上传和运动指令的下达.在此基础上,采用高速DSP、IPM功率智能模块、光电编码器、无刷直流电机等构建了机器人运动关节集成驱动控制器的硬件电路,并完成了相应软件设计.结果表明,这种集成驱动控制器简化了层间联系,提高了响应速度,增加了整体集成度,有利于运动关节的驱动控制一体化.     

嵌入式1394总线接口的设计和实现

本文介绍一种嵌入式处理器与1394总线接口设计方法,并给出基于现场可编程门阵列(FPGA)设计的VHDL代码结构、仿真时序和试验结果,最后提出了一种新的通用接口设计方法并指出了它的优势所在.     

快速自适应运动估计算法

为降低H.264中运动估计的复杂性,通过对自然图像序列的分析,提出了一种基于块的运动特征的快速自适应搜索算法。该算法充分利用视频序列中当前块的运动状态,根据不同块的运动情况合理选择运动搜索模板。实验表明,该算法在保证重构图像质量的前提下,编码速度有了显著提高,保证了实时应用的要求。