BM+-tree: A hyperplane-based index method for high-dimensional metric spaces

In this paper, we propose a novel high-dimensional index method, the BM+-tree, to support efficient processing of similarity search queries in high-dimensional spaces. The main idea of the proposed index is to improve data partitioning efficiency in a high-dimensional space by using a rotary binary hyperplane, which further partitions a subspace and can also take advantage of the twin node concept used in the M+-tree. Compared with the key dimension concept in the M+-tree, the binary hyperplane is more effective in data filtering. High space utilization is achieved by dynamically performing data reallocation between twin nodes. In addition, a post processing step is used after index building to ensure effective filtration. Experimental results using two types of real data sets illustrate a significantly improved filtering efficiency.

Virtual teachers: Negotiating new spaces for teaching bodies

In 2002, the authors reviewed the educational performance of a state education department virtual schooling service during its first 2 years of operation, 2000-2001 (Pendergast, Kapitzke, Land, Luke, & Bahr, 2002). Established by Education Queensland, the Virtual Schooling Service (VSS) utilises synchronous and asynchronous online delivery strategies and a range of learning technologies to support students at a distance (see http://education.qld.gov.au/learningplace/vss/). The service commenced with a focus on senior secondary subjects. At present, there are over 700 students in 89 schools across the state enrolled in 9 subjects. In response to the recommendations of the study, a series of professional development activities were conducted with the VSS teachers by the authors. Opportunity for critical reflection was provided, including consideration of the ways in which the teachers were developing as a learning community. Some data, including visual representations, were collected from participants with the purpose of understanding how VSS teachers are constructed as professionals. This study compares and contrasts that data with self-constructions of teacher professionals in other fields.

Matching commercial clips from TV streams using a unique, robust and compact signature

One of critical challenges in automatic recognition of TV commercials is to generate a unique, robust and compact signature. Uniqueness indicates the ability to identify the similarity among the commercial video clips which may have slight content variation. Robustness means the ability to match commercial video clips containing the same content but probably with different digitalization/encoding, some noise data, and/or transmission and recording distortion. Efficiency is about the capability of effectively matching commercial video sequences with a low computation cost and storage overhead. In this paper, we present a binary signature based method, which meets all the three criteria above, by combining the techniques of ordinal and color measurements. Experimental results on a real large commercial video database show that our novel approach delivers a significantly better performance comparing to the existing methods.

Playing in continuous spaces: Some analysis and extension of population-based incremental learning

As an alternative to traditional evolutionary algorithms (EAs), population-based incremental learning (PBIL) maintains a probabilistic model of the best individual(s). Originally, PBIL was applied in binary search spaces. Recently, some work has been done to extend it to continuous spaces. In this paper, we review two such extensions of PBIL. An improved version of the PBIL based on Gaussian model is proposed that combines two main features: a new updating rule that takes into account all the individuals and their fitness values and a self-adaptive learning rate parameter. Furthermore, a new continuous PBIL employing a histogram probabilistic model is proposed. Some experiments results are presented that highlight the features of the new algorithms.