Comparison of the distributions of classical and adaptively aligned EEG power spectra

The distributions of eyes-closed resting electroencephalography (EEG) power spectra and their residuals were described and compared using classically averaged and adaptively aligned averaged spectra. Four minutes of eyes-closed resting EEG was available from 69 participants. Spectra were calculated with 0.5-Hz resolution and were analyzed at this level. It was shown that power in the individual 0.5 Hz frequency bins can be considered normally distributed when as few as three or four 2-second epochs of EEG are used in the average. A similar result holds for the residuals. Power at the peak Alpha frequency has quite different statistical behaviour to power at other frequencies and it is considered that power at peak Alpha represents a relatively individuated process that is best measured through aligned averaging. Previous analyses of contrasts in upper and lower alpha bands may be explained in terms of the variability or distribution of the peak Alpha frequency itself.

On the equivalence of weighted Country-Product-Dummy (CPD) Method and the Rao-System for multilateral price comparisons

The country-product-dummy (CPD) method, originally proposed in Summers (1973), has recently been revisited in its weighted formulation to handle a variety of data related situations (Rao and Timmer, 2000, 2003; Heravi et al., 2001; Rao, 2001; Aten and Menezes, 2002; Heston and Aten, 2002; Deaton et al., 2004). The CPD method is also increasingly being used in the context of hedonic modelling instead of its original purpose of filling holes in Summers (1973). However, the CPD method is seen, among practitioners, as a black box due to its regression formulation. The main objective of the paper is to establish equivalence of purchasing power parities and international prices derived from the application of the weighted-CPD method with those arising out of the Rao-system for multilateral comparisons. A major implication of this result is that the weighted-CPD method would then be a natural method of aggregation at all levels of aggregation within the context of international comparisons.

Kinematics, substructure and luminosity-weighted dynamics of six nearby galaxy groups

We have redefined group membership of six southern galaxy groups in the local universe (mean cz < 2000 km s(-1)) based on new redshift measurements from our recently acquired Anglo-Australian Telescope 2dF spectra. For each group, we investigate member galaxy kinematics, substructure, luminosity functions and luminosity-weighted dynamics. Our calculations confirm that the group sizes, virial masses and luminosities cover the range expected for galaxy groups, except that the luminosity of NGC 4038 is boosted by the central starburst merger pair. We find that a combination of kinematical, substructural and dynamical techniques can reliably distinguish loose, unvirialized groups from compact, dynamically relaxed groups. Applying these techniques, we find that Dorado, NGC 4038 and NGC 4697 are unvirialized, whereas NGC 681, NGC 1400 and NGC 5084 are dynamically relaxed.

Efficiently computing weighted proximity relationships in spatial databases

Spatial data mining recently emerges from a number of real applications, such as real-estate marketing, urban planning, weather forecasting, medical image analysis, road traffic accident analysis, etc. It demands for efficient solutions for many new, expensive, and complicated problems. In this paper, we investigate the problem of evaluating the top k distinguished “features” for a “cluster” based on weighted proximity relationships between the cluster and features. We measure proximity in an average fashion to address possible nonuniform data distribution in a cluster. Combining a standard multi-step paradigm with new lower and upper proximity bounds, we presented an efficient algorithm to solve the problem. The algorithm is implemented in several different modes. Our experiment results not only give a comparison among them but also illustrate the efficiency of the algorithm.