This paper presents a wavelet transform and Support Vector Machine (SVM) based algorithm for classification of power quality (PQ) disturbances. The features extracted through the wavelet transform are trained by a SVM for classification of power quality disturbances. Five types of disturbances are considered for the classification problem. The simulation results reveal that the combination of w...

In this paper, an architecture of a resourceallocating learning probabilistic neural network is considered. Construction and learning algorithms are proposed. The advantages of this network lie in the possibility of classification of data with substantially overlapping clusters. The construction algorithm significantly reduces the size of the network and tuning of the activation function parame...

Target classification fusion problem in a distributed, wireless sensor network is investigated. We propose a distance-based decision fusion scheme exploiting the relationship between sensor to target distance, signal to noise ratio and classification rate, which requires less communication while achieving higher region classification rate when compared to conventional majority-vote based fusion...

We compare two major approaches to variable selection in clustering: model selection and regularization. Based on previous results, we select the method of Maugis et al. (2009b), which modified the method of Raftery and Dean (2006), as a current state of the art model selection method. We select the method of Witten and Tibshirani (2010) as a current state of the art regularization method. We c...

This article reports an exploratory survey of the structure of interdisciplinary research in Agent-Based Social Simulation. One hundred and ninety six researchers participated in the survey completing an on-line questionnaire. The questionnaire had three distinct sections, a classification of research domains, a classification of models, and an inquiry into software requirements for designing s...

In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC1, respectively. This solves an open problem from Balcázar, Gabarró, and Sántha. We also show that the simulation problem is P-complete even for graphs of bounded path-w...