Forecasting binary longitudinal data by a functional PC-ARIMA model

In order to forecast time evolution of a binary response variable from a related continuous time series a functional logit model is proposed. The estimation of this model from discrete time observations of the predictor is solved by using functional principal component analysis and ARIMA modelling of the associated discrete time series of principal components. The proposed model is applied to forecast the risk of drought from El Niño phenomenon.     

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.     

Mixtures of robust probabilistic principal component analyzers

Mixtures of probabilistic principal component analyzers model high-dimensional nonlinear data by combining local linear models. Each mixture component is specifically designed to extract the local principal orientations in the data. An important issue with this generative model is its sensitivity to data lying off the low-dimensional manifold. In order to address this problem, the mixtures of robust probabilistic principal component analyzers are introduced. They take care of atypical points by means of a long tail distribution, the Student-t. It is shown that the resulting mixture model is an extension of the mixture of Gaussians, suitable for both robust clustering and dimensionality reduction. Finally, we briefly discuss how to construct a robust version of the closely related mixture of factor analyzers.     

A neural networks learning algorithm for minor component analysis and its convergence analysis

The eigenvector associated with the smallest eigenvalue of the autocorrelation matrix of input signals is called minor component. Minor component analysis (MCA) is a statistical approach for extracting minor component from input signals and has been applied in many fields of signal processing and data analysis. In this letter, we propose a neural networks learning algorithm for estimating adaptively minor component from input signals. Dynamics of the proposed algorithm are analyzed via a deterministic discrete time (DDT) method. Some sufficient conditions are obtained to guarantee convergence of the proposed algorithm.     

反射式实时集成中间件

反射式实时集成中间件主要研究一类适应于分布式实时应用环境中软件合成与软件集成的构件粘合剂.这种中间件基于反射技术设计,用于分布式实时领域里实时构件间的粘合与集成,并能维护这些构件间交互协作环境的时间约束特征,保障环境变化的动态性和适应性以及降低协同工作环境中通讯机制的耦合度,实践软件复用思想在分布式实时应用领域中的应用.     

Multi-rate model predictive control of particle size distribution in a semibatch emulsion copolymerization reactor

A multi-rate model predictive controller algorithm is presented for the in-batch closed-loop control of the full particle size distribution (PSD) in a semibatch emulsion copolymerization system. The lack of frequent measurements of the PSD and the measurement delay of these measurements are addressed through the use of frequent density measurements from which the current conditions of the system are estimated. The high dimensionality of the discretized full PSD is reduced by the use of model order reduction based on principal component analysis. This method effectively reduces the size of the problem while preserving the main characteristics of the population balance system. Disturbances that perturb the surfactant and monomer amounts inside the semibatch vinyl acetate–butyl acrylate reactor are considered to demonstrate the performance of the proposed control algorithm.     

Integration of independent component analysis and neural networks for ECG beat classification

In this paper, we propose a scheme to integrate independent component analysis (ICA) and neural networks for electrocardiogram (ECG) beat classification. The ICA is used to decompose ECG signals into weighted sum of basic components that are statistically mutual independent. The projections on these components, together with the RR interval, then constitute a feature vector for the following classifier. Two neural networks, including a probabilistic neural network (PNN) and a back-propagation neural network (BPNN), are employed as classifiers. ECG samples attributing to eight different beat types were sampled from the MIT-BIH arrhythmia database for experiments. The results show high classification accuracy of over 98% with either of the two classifiers. Between them, the PNN shows a slightly better performance than BPNN in terms of accuracy and robustness to the number of ICA-bases. The impressive results prove that the integration of independent component analysis and neural networks, especially PNN, is a promising scheme for the computer-aided diagnosis of heart diseases based on ECG.     

基于可复用功能组件的测试用例生成方法

针对交互式软件的频繁交互、状态复杂等特点,基于功能测试和层次型结构,从需求规范中提取基于操作流程的功能组件,通过映射、重组测试脚本,导入测试数据,并自动生成测试用例。功能组件的构建具有层次型结构的特点,即一个功能组件可以包含一个或多个功能组件,更大程度地共享了测试脚本。     

基于COM的Delphi和Matlab接口编程研究

简要介绍了Delphi与Matlab各自的优缺点,较为全面地列举和分析了二者接口编程的几种方式,重点讨论了Delphi调用Matlab编译生成的COM组件的方法和原理,实现二者的无缝集成.提供的实现过程和应用实例均说明了该方法简便、可操作性强.通过Delphi和Matlab的整合,可以根据实际需要,开发功能强大而且界面友好的软件.     

利用PCA增强随机化隐私数据保护方法

基于随机化的数据扰乱及重构技术是数据挖掘中的隐私保护(Privacy-Preserving Data Mining,PPDM)领域中最重要的方法之一.但是,随机化难以消除由于属性变量本身相关性引起的数据泄漏.介绍了一种利用主成分分析(Principal Component Analysis,PCA)进行属性精简的增强随机化方法,降低了参与数据挖掘的属性数据间相关性,更好地保护了隐私数据.